Ändra sökning
RefereraExporteraLänk till posten
Permanent länk

Direktlänk
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
The cone of cyclic sieving phenomena
KTH, Skolan för teknikvetenskap (SCI), Matematik (Inst.), Matematik (Avd.).ORCID-id: 0000-0002-2305-9764
KTH, Skolan för teknikvetenskap (SCI), Matematik (Inst.), Matematik (Avd.).
2019 (Engelska)Ingår i: Discrete Mathematics, ISSN 0012-365X, E-ISSN 1872-681X, Vol. 342, nr 6, s. 1581-1601Artikel i tidskrift (Refereegranskat) Published
Abstract [en]

We study cyclic sieving phenomena (CSP) on combinatorial objects from an abstract point of view by considering a rational polyhedral cone determined by the linear equations that define such phenomena. Each lattice point in the cone corresponds to a non-negative integer matrix which jointly records the statistic and cyclic order distribution associated with the set of objects realizing the CSP. In particular we consider a universal subcone onto which every CSP matrix linearly projects such that the projection realizes a CSP with the same cyclic orbit structure, but via a universal statistic that has even distribution on the orbits.

Reiner et.al. showed that every cyclic action gives rise to a unique polynomial (mod q^n-1) complementing the action to a CSP. We give a necessary and sufficient criterion for the converse to hold. This characterization allows one to determine if a combinatorial set with a statistic gives rise (in principle) to a CSP without having a combinatorial realization of the cyclic action. We apply the criterion to conjecture a new CSP involving stretched Schur polynomials and prove our conjecture for certain rectangular tableaux. Finally we study some geometric properties of the CSP cone. We explicitly determine its half-space description and in the prime order case we determine its extreme rays.

Ort, förlag, år, upplaga, sidor
Elsevier, 2019. Vol. 342, nr 6, s. 1581-1601
Nyckelord [en]
cyclic sieving, stretched schur polynomial, convex polytope
Nationell ämneskategori
Diskret matematik
Forskningsämne
Matematik
Identifikatorer
URN: urn:nbn:se:kth:diva-250764DOI: 10.1016/j.disc.2019.01.037ISI: 000466833400006Scopus ID: 2-s2.0-85062678575OAI: oai:DiVA.org:kth-250764DiVA, id: diva2:1313631
Anmärkning

QC 20190510

Tillgänglig från: 2019-05-05 Skapad: 2019-05-05 Senast uppdaterad: 2019-05-29Bibliografiskt granskad
Ingår i avhandling
1. Combinatorics and zeros of multivariate polynomials
Öppna denna publikation i ny flik eller fönster >>Combinatorics and zeros of multivariate polynomials
2019 (Engelska)Doktorsavhandling, sammanläggning (Övrigt vetenskapligt)
Abstract [en]

This thesis consists of five papers in algebraic and enumerative combinatorics. The objects at the heart of the thesis are combinatorial polynomials in one or more variables. We study their zeros, coefficients and special evaluations. Hyperbolic polynomials may be viewed as multivariate generalizations of real-rooted polynomials in one variable. To each hyperbolic polynomial one may associate a convex cone from which a matroid can be derived - a so called hyperbolic matroid. In Paper A we prove the existence of an infinite family of non-representable hyperbolic matroids parametrized by hypergraphs. We further use special members of our family to investigate consequences to a central conjecture around hyperbolic polynomials, namely the generalized Lax conjecture. Along the way we strengthen and generalize several symmetric function inequalities in the literature, such as the Laguerre-Tur\'an inequality and an inequality due to Jensen. In Paper B we affirm the generalized Lax conjecture for two related classes of combinatorial polynomials: multivariate matching polynomials over arbitrary graphs and multivariate independence polynomials over simplicial graphs. In Paper C we prove that the multivariate $d$-matching polynomial is hyperbolic for arbitrary multigraphs, in particular answering a question by Hall, Puder and Sawin. We also provide a hypergraphic generalization of a classical theorem by Heilmann and Lieb regarding the real-rootedness of the matching polynomial of a graph. In Paper D we establish a number of equidistributions between Mahonian statistics which are given by conic combinations of vincular pattern functions of length at most three, over permutations avoiding a single classical pattern of length three. In Paper E we find necessary and sufficient conditions for a candidate polynomial to be complemented to a cyclic sieving phenomenon (without regards to combinatorial context). We further take a geometric perspective on the phenomenon by associating a convex rational polyhedral cone which has integer lattice points in correspondence with cyclic sieving phenomena. We find the half-space description of this cone and investigate its properties.

Ort, förlag, år, upplaga, sidor
Stockholm: KTH Royal Institute of Technology, 2019. s. 42
Serie
TRITA-SCI-FOU ; 2019:33
Nationell ämneskategori
Diskret matematik
Forskningsämne
Matematik
Identifikatorer
urn:nbn:se:kth:diva-251303 (URN)978-91-7873-210-4 (ISBN)
Disputation
2019-05-24, D3, Lindstedsvägen 5, Stockholm, 14:00 (Engelska)
Opponent
Handledare
Anmärkning

QC 20190510

Tillgänglig från: 2019-05-10 Skapad: 2019-05-09 Senast uppdaterad: 2019-05-10Bibliografiskt granskad

Open Access i DiVA

Fulltext saknas i DiVA

Övriga länkar

Förlagets fulltextScopus

Personposter BETA

Amini, NimaAlexandersson, Per

Sök vidare i DiVA

Av författaren/redaktören
Amini, NimaAlexandersson, Per
Av organisationen
Matematik (Avd.)
I samma tidskrift
Discrete Mathematics
Diskret matematik

Sök vidare utanför DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetricpoäng

doi
urn-nbn
Totalt: 102 träffar
RefereraExporteraLänk till posten
Permanent länk

Direktlänk
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf