Marcelo Aguiar ; Aaron Lauve

Lagrange's Theorem for Hopf Monoids in Species
dmtcs:2887 
Discrete Mathematics & Theoretical Computer Science,
January 1, 2011,
DMTCS Proceedings vol. AO, 23rd International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2011)

https://doi.org/10.46298/dmtcs.2887
Lagrange's Theorem for Hopf Monoids in SpeciesArticle
Authors: Marcelo Aguiar ^{1}; Aaron Lauve ^{2}
NULL##NULL
Marcelo Aguiar;Aaron Lauve
1 Department of Mathematics and Statistics [Texas Tech]
2 Department of Mathematics [Austin]
We prove Lagrange's theorem for Hopf monoids in the category of connected species. We deduce necessary conditions for a given subspecies $\textrm{k}$ of a Hopf monoid $\textrm{h}$ to be a Hopf submonoid: each of the generating series of $\textrm{k}$ must divide the corresponding generating series of $\textrm{k}$ in ℕ〚x〛. Among other corollaries we obtain necessary inequalities for a sequence of nonnegative integers to be the sequence of dimensions of a Hopf monoid. In the settheoretic case the inequalities are linear and demand the non negativity of the binomial transform of the sequence.
Categories, Hopf Algebras, and Algebraic Combinatorics; Funder: National Science Foundation; Code: 1001935
References
3 Documents citing this article
Wenjuan Zhao;Shunfu Jin;Wuyi Yue, 2021, A stochastic model and social optimization of a blockchain system based on a general limited batch service queue, Journal of Industrial and Management Optimization, 17, 4, pp. 1845, 10.3934/jimo.2020049, https://doi.org/10.3934/jimo.2020049.
Wenjuan Zhao;Shunfu Jin;Wuyi Yue, Lecture Notes in Computer Science, Analysis of the Average Confirmation Time of Transactions in a Blockchain System, pp. 379388, 2019, 10.1007/9783030271817_23.