Canonical characters on simple graphs
Czechoslovak Mathematical Journal (2013)
- Volume: 63, Issue: 1, page 107-113
- ISSN: 0011-4642
Access Full Article
topAbstract
topHow to cite
topStojadinović, Tanja. "Canonical characters on simple graphs." Czechoslovak Mathematical Journal 63.1 (2013): 107-113. <http://eudml.org/doc/252547>.
@article{Stojadinović2013,
abstract = {A multiplicative functional on a graded connected Hopf algebra is called the character. Every character decomposes uniquely as a product of an even character and an odd character. We apply the character theory of combinatorial Hopf algebras to the Hopf algebra of simple graphs. We derive explicit formulas for the canonical characters on simple graphs in terms of coefficients of the chromatic symmetric function of a graph and of canonical characters on quasi-symmetric functions. These formulas and properties of characters are used to derive some interesting numerical identities relating multinomial and central binomial coefficients.},
author = {Stojadinović, Tanja},
journal = {Czechoslovak Mathematical Journal},
keywords = {Hopf algebra; simple graph; quasi-symmetric function; character; multiplicative functional; graded connected Hopf algebra; simple graph; quasi-symmetric function; even character; odd character; chromatic symmetric functions; quasi-symmetric functions; identities; multinomial coefficients; central binomial coefficients},
language = {eng},
number = {1},
pages = {107-113},
publisher = {Institute of Mathematics, Academy of Sciences of the Czech Republic},
title = {Canonical characters on simple graphs},
url = {http://eudml.org/doc/252547},
volume = {63},
year = {2013},
}
TY - JOUR
AU - Stojadinović, Tanja
TI - Canonical characters on simple graphs
JO - Czechoslovak Mathematical Journal
PY - 2013
PB - Institute of Mathematics, Academy of Sciences of the Czech Republic
VL - 63
IS - 1
SP - 107
EP - 113
AB - A multiplicative functional on a graded connected Hopf algebra is called the character. Every character decomposes uniquely as a product of an even character and an odd character. We apply the character theory of combinatorial Hopf algebras to the Hopf algebra of simple graphs. We derive explicit formulas for the canonical characters on simple graphs in terms of coefficients of the chromatic symmetric function of a graph and of canonical characters on quasi-symmetric functions. These formulas and properties of characters are used to derive some interesting numerical identities relating multinomial and central binomial coefficients.
LA - eng
KW - Hopf algebra; simple graph; quasi-symmetric function; character; multiplicative functional; graded connected Hopf algebra; simple graph; quasi-symmetric function; even character; odd character; chromatic symmetric functions; quasi-symmetric functions; identities; multinomial coefficients; central binomial coefficients
UR - http://eudml.org/doc/252547
ER -
References
top- Aguiar, M., Bergeron, N., Sottile, F., 10.1112/S0010437X0500165X, Compos. Math. 142 (2006), 1-30. (2006) MR2196760DOI10.1112/S0010437X0500165X
- Aguiar, M., Hsiao, S. K., Canonical characters on quasi-symmetric functions and bivariate Catalan numbers, Electron. J. Comb. 11 (2005), Research paper R15 34 pp. (2005) Zbl1071.05072MR2120110
- Schmitt, W. R., 10.1016/0022-4049(94)90105-8, J. Pure Appl. Algebra 96 (1994), 299-330. (1994) Zbl0808.05101MR1303288DOI10.1016/0022-4049(94)90105-8
- Stanley, R., 10.1006/aima.1995.1020, Adv. Math. 111 (1995), 166-194. (1995) Zbl0831.05027MR1317387DOI10.1006/aima.1995.1020
NotesEmbed ?
topTo embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.