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

Direktlänk
BETA
Alexandersson, Per
Publikationer (5 of 5) Visa alla publikationer
Alexandersson, P. & Jordan, L. (2019). Enumeration of Border-Strip Decompositions and Weil-Petersson Volumes. Journal of Integer Sequences, 22(4), Article ID 19.4.5.
Öppna denna publikation i ny flik eller fönster >>Enumeration of Border-Strip Decompositions and Weil-Petersson Volumes
2019 (Engelska)Ingår i: Journal of Integer Sequences, ISSN 1530-7638, E-ISSN 1530-7638, Vol. 22, nr 4, artikel-id 19.4.5Artikel i tidskrift (Refereegranskat) Published
Abstract [en]

We describe an injection from border-strip decompositions of certain diagrams to permutations. This allows us to provide enumeration results as well as q-analogues of enumeration formulas. Finally, we use this injection to prove a connection between the number of border-strip decompositions of the n x 2n rectangle and the Weil-Petersson volume of the moduli space of an n-punctured Riemann sphere.

Ort, förlag, år, upplaga, sidor
UNIV WATERLOO, 2019
Nyckelord
border-strip decomposition, permutation, q-analogue, Weil-Petersson volume, rectangular shape
Nationell ämneskategori
Matematik
Identifikatorer
urn:nbn:se:kth:diva-255466 (URN)000473287400001 ()
Anmärkning

QC 20190918

Tillgänglig från: 2019-09-18 Skapad: 2019-09-18 Senast uppdaterad: 2019-09-18Bibliografiskt granskad
Alexandersson, P. (2019). Polytopes and Large Counterexamples. Experimental Mathematics, 28(1), 115-120
Öppna denna publikation i ny flik eller fönster >>Polytopes and Large Counterexamples
2019 (Engelska)Ingår i: Experimental Mathematics, ISSN 1058-6458, E-ISSN 1944-950X, Vol. 28, nr 1, s. 115-120Artikel i tidskrift (Refereegranskat) Published
Abstract [en]

In this short note, we give large counterexamples to natural questions about certain order polytopes, in particular, Gelfand–Tsetlin polytopes. Several of the counterexamples are too large to be discovered via a brute-force computer search. We also show that the multiset of hooks in a Young diagram is not enough information to determine the Ehrhart polynomial for an associated order polytope. This is somewhat counter-intuitive to the fact that the multiset of hooks always determine the leading coefficient of the Ehrhart polynomial.

Ort, förlag, år, upplaga, sidor
TAYLOR & FRANCIS INC, 2019
Nyckelord
polytopes, counter-examples, hook formula, Ehrhart polynomial, Kostka coefficient
Nationell ämneskategori
Matematik
Identifikatorer
urn:nbn:se:kth:diva-250885 (URN)10.1080/10586458.2017.1361367 (DOI)000464579100010 ()2-s2.0-85030153152 (Scopus ID)
Anmärkning

QC 20190507

Tillgänglig från: 2019-05-07 Skapad: 2019-05-07 Senast uppdaterad: 2019-06-11Bibliografiskt granskad
Amini, N. & Alexandersson, P. (2019). The cone of cyclic sieving phenomena. Discrete Mathematics, 342(6), 1581-1601
Öppna denna publikation i ny flik eller fönster >>The cone of cyclic sieving phenomena
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
Nyckelord
cyclic sieving, stretched schur polynomial, convex polytope
Nationell ämneskategori
Diskret matematik
Forskningsämne
Matematik
Identifikatorer
urn:nbn:se:kth:diva-250764 (URN)10.1016/j.disc.2019.01.037 (DOI)000466833400006 ()2-s2.0-85062678575 (Scopus ID)
Anmärkning

QC 20190510

Tillgänglig från: 2019-05-05 Skapad: 2019-05-05 Senast uppdaterad: 2019-05-29Bibliografiskt granskad
Alexandersson, P. & Panova, G. (2018). LLT polynomials, chromatic quasisymmetric functions and graphs with cycles. Discrete Mathematics, 341(12), 3453-3482
Öppna denna publikation i ny flik eller fönster >>LLT polynomials, chromatic quasisymmetric functions and graphs with cycles
2018 (Engelska)Ingår i: Discrete Mathematics, ISSN 0012-365X, E-ISSN 1872-681X, Vol. 341, nr 12, s. 3453-3482Artikel i tidskrift (Refereegranskat) Published
Abstract [en]

We use a Dyck path model for unit-interval graphs to study the chromatic quasisymmetric functions introduced by Shareshian and Wachs, as well as unicellular LLT polynomials, revealing some parallel structure and phenomena regarding their e-positivity. The Dyck path model is also extended to circular arc digraphs to obtain larger families of polynomials, giving a new extension of LLT polynomials. Carrying over a lot of the noncircular combinatorics, we prove several statements regarding the e-coefficients of chromatic quasisymmetric functions and LLT polynomials, including a natural combinatorial interpretation for the e-coefficients for the line graph and the cycle graph for both families. We believe that certain e-positivity conjectures hold in all these families above. Furthermore, beyond the chromatic analogy, we study vertical-strip LLT polynomials, which are modified Hall-Littlewood polynomials. 

Ort, förlag, år, upplaga, sidor
ELSEVIER SCIENCE BV, 2018
Nyckelord
Chromatic quasisymmetric functions, Elementary symmetric functions, LLT polynomials, Orientations, Unit interval graphs, Positivity, Diagonal harmonics
Nationell ämneskategori
Diskret matematik
Identifikatorer
urn:nbn:se:kth:diva-238893 (URN)10.1016/j.disc.2018.09.001 (DOI)000448496500020 ()2-s2.0-85053911752 (Scopus ID)
Anmärkning

QC 20181126

Tillgänglig från: 2018-11-26 Skapad: 2018-11-26 Senast uppdaterad: 2018-11-26Bibliografiskt granskad
Alexandersson, P. & Sawhney, M. (2017). A Major-Index Preserving Map on Fillings. The Electronic Journal of Combinatorics, 24(4), Article ID P4.3.
Öppna denna publikation i ny flik eller fönster >>A Major-Index Preserving Map on Fillings
2017 (Engelska)Ingår i: The Electronic Journal of Combinatorics, ISSN 1097-1440, E-ISSN 1077-8926, Vol. 24, nr 4, artikel-id P4.3Artikel i tidskrift (Refereegranskat) Published
Abstract [en]

We generalize a map by S. Mason regarding two combinatorial models for key polynomials, in a way that accounts for the major index. Furthermore we define a similar variant of this map, that regards alternative models for the modified Macdonald polynomials at t = 0, and thus partially answers a question by J. Haglund. These maps together imply a certain uniqueness property regarding inversion- and coinversion-free fillings. These uniqueness properties allow us to generalize the notion of charge to a non-symmetric setting, thus answering a question by A. Lascoux and the analogous question in the symmetric setting proves a conjecture by K. Nelson.

Nationell ämneskategori
Matematik
Identifikatorer
urn:nbn:se:kth:diva-218233 (URN)000414866100006 ()2-s2.0-85031091360 (Scopus ID)
Anmärkning

QC 20171128

Tillgänglig från: 2017-11-28 Skapad: 2017-11-28 Senast uppdaterad: 2017-11-28Bibliografiskt granskad
Organisationer

Sök vidare i DiVA

Visa alla publikationer