Order quasisymmetric functions distinguish rooted trees


Hokkaido University \| Library \| HUSCAP	Advanced Search		言語

	Home
	About HUSCAP
	Open Access Policy

	Browse by Author

Browse
	Communities & Collections

	Scholarly Journals
	Theses
	Doctoral Dissertations Listed by Graduate Schools
	Conference Procs.
	Events

	HUSCAP Senior (in Japanese)

	Societies

	Downloads (country)

For university staff
	How to post your papers to HUSCAP
	Publication of theses
	Helpline about theses publication

Open Archives Compliant

You can search our collection also at:
	Google
	Google Scholar
	CiNii
	IRDB
	OAIster
	NDLTD

Files in This Item:

J ALGEBR COMB46-3-4_499-515.pdf

138.76 kB

PDF

Please use this identifier to cite or link to this item:http://hdl.handle.net/2115/76012

Title:	Order quasisymmetric functions distinguish rooted trees
Authors:	Hasebe, Takahiro Browse this author →KAKEN DB
Authors:	Tsujie, Shuhei Browse this author
Keywords:	Rooted tree
	P-partition
	Quasisymmetric function
	Overlapping shuffle
	N-free
Issue Date:	Dec-2017
Journal Title:	Journal of Algebraic Combinatorics
Volume:	46
Issue:	3-4
Start Page:	499
End Page:	515
Publisher DOI:	10.1007/s10801-017-0761-7
Abstract:	Richard P. Stanley conjectured that finite trees can be distinguished by their chromatic symmetric functions. In this paper, we prove an analogous statement for posets: Finite rooted trees can be distinguished by their order quasisymmetric functions.
Type:	article (author version)
URI:	http://hdl.handle.net/2115/76012
Appears in Collections:	理学院・理学研究院 (Graduate School of Science / Faculty of Science) > 雑誌発表論文等 (Peer-reviewed Journal Articles, etc)

Submitter: 長谷部高広

OAI-PMH ( junii2 , jpcoar_1.0 )

- Hokkaido University