arXiv subjects
Publications and source records attributed to Per Alexandersson.
We describe an injection from border-strip decompositions of certain shapes 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\times 2n$ rectangle and the Weil-Petersson volume of the moduli space of an $n$-punctured Riemann sphere.
We present positivity conjectures for the Schur expansion of Jack symmetric functions in two bases given by binomial coefficients. Partial results suggest that there are rich combinatorics to be found in these bases, including Eulerian numbers, Stirling numbers, quasi-Yamanouchi tableaux, and rook boards. These results also lead to further conjectures about the fundamental quasisymmetric expansions of these bases, which we prove for special cases.
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 give 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 give 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.
We examine the non-symmetric Macdonald polynomials $E_λ(x;q,t)$ at $q=1$, as well as the more general permuted-basement Macdonald polynomials. When $q=1$, we show that $E_λ(x;1,t)$ is symmetric and independent of $t$ whenever $λ$ is a partition. Furthermore, we show that for general $λ$, this expression factors into a symmetric and a non-symmetric part, where the symmetric part is independent of $t$, while the non-symmetric part only depends on the relative order of the entries in $λ$. We also examine the case $q=0$, which give rise to so called permuted-basement $t$-atoms. We prove expansion-properties of these, and as a corollary, prove that Demazure characters (key polynomials) expand positively into permuted-basement atoms. This complements the result that permuted-basement atoms are atom-positive. Finally, we show that a product of a permuted-basement atom and a Schur polynomial is again positive in the same permuted-basement atom basis, and thus interpolates between two results by Haglund, Luoto, Mason and van Willigenburg. The common theme in this project is the application of basement-permuting operators as well as combinatorics on fillings, by applying results in a previous article by the first author.
We use a Dyck path model for unit-interval graphs to study the chromatic quasisymmetric functions introduced by Shareshian and Wachs, as well as vertical strip --- in particular, unicellular LLT polynomials. We show that there are parallel phenomena regarding $e$-positivity of these two families of polynomials. In particular, we give several examples where the LLT polynomials behave like a "mirror image" of the chromatic quasisymmetric counterpart. The Dyck path model is also extended to circular arc digraphs to obtain larger families of polynomials. This circular extensions of LLT polynomials has not been studied before. A lot of the combinatorics regarding unit interval graphs carries over to this more general setting, and we prove several statements regarding the $e$-coefficients of chromatic quasisymmetric functions and LLT polynomials. In particular, we believe that certain $e$-positivity conjectures hold in all these families above. Furthermore, we study vertical-strip LLT polynomials, for which there is no natural chromatic quasisymmetric counterpart. These polynomials are essentially modified Hall--Littlewood polynomials, and are therefore of special interest. In this more general framework, we are able to give a natural combinatorial interpretation for the $e$-coefficients for the line graph and the cycle graph, in both the chromatic and the LLT setting.
We generalize a map by S. Mason regarding two combinatorial models for key polynomials, in a way that accounts for the major index. We also define similar variants of this map, that regards alternative models for the modified Macdonald polynomials at $t=0$, thus partially answer a question by J. Haglund. These maps imply certain uniqueness property regarding inversion-- and coinversion-free fillings, which allows us to generalize the notion of charge to a non-symmetric setting, thus answering a question by A. Lascoux. The analogous question in the symmetric setting proves a conjecture by K. Nelson.
In this paper, we study shifted Schur functions $S_μ^\star$, as well as a new family of shifted symmetric functions $\mathfrak{K}_μ$ linked to Kostka numbers. We prove that both are polynomials in multi-rectangular coordinates, with nonnegative coefficients when written in terms of falling factorials. We then propose a conjectural generalization to the Jack setting. This conjecture is a lifting of Knop and Sahi's positivity result for usual Jack polynomials and resembles recent conjectures of Lassalle. We prove our conjecture for one-part partitions.
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.
We extend the family non-symmetric Macdonald polynomials and define general-basement Macdonald polynomials. We show that these also satisfy a triangularity property with respect to the monomials bases and behave well under the Demazure-Lusztig operators. The symmetric Macdonald polynomials $J_λ$ are expressed as a sum of general-basement Macdonald polynomials via an explicit formula. By letting $q=0$, we obtain $t$-deformations of key polynomials and Demazure atoms and we show that the Hall--Littlewood polynomials expand positively into these. This generalizes a result by Haglund, Luoto, Mason and van Willigenburg. As a corollary, we prove that Schur polynomials decompose with non-negative coefficients into $t$-deformations of general Demazure atoms and thus generalizing the $t=0$ case which was previously known. This gives a unified formula for the classical expansion of Schur polynomials in Hall-Littlewood polynomials and the expansion of Schur polynomials into Demazure atoms.
Let $P$ be the Gelfand--Tsetlin polytope defined by the skew shape $λ/μ$ and weight $w$. In the case corresponding to a standard Young tableau, we completely characterize for which shapes $λ/μ$ the polytope $P$ is integral. Furthermore, we show that $P$ is a compressed polytope whenever it is integral and corresponds to a standard Young tableau. We conjecture that a similar property hold for arbitrary $w$, namely that $P$ has the integer decomposition property whenever it is integral. Finally, a natural partial ordering on GT-polytopes is introduced that provides information about integrality and the integer decomposition property, which implies the conjecture for certain shapes.
We show that several families of polynomials defined via fillings of diagrams satisfy linear recurrences under a natural operation on the shape of the diagram. We focus on key polynomials, (also known as Demazure characters), and Demazure atoms. The same technique can be applied to Hall-Littlewood polynomials and dual Grothendieck polynomials. The motivation behind this is that such recurrences are strongly connected with other nice properties, such as interpretations in terms of lattice points in polytopes and divided difference operators.
We give a combinatorial proof of the skew Kostka analogue of the K-saturation theorem. More precisely, for any positive integer k, we give an explicit injection from the set of skew semistandard Young tableaux with skew shape kλ/kμ and type kν to the set of skew semistandard Young tableaux of shape λ/μ and type ν. Based on this method, we pose some natural conjectural refinements on related problems.
Given an arbitrary complex-valued infinite matrix A and a positive integer n we introduce a naturally associated polynomial basis B_A of C[x0...xn]. We discuss some properties of the locus of common zeros of all polynomials in B_A having a given degree m; the latter locus can be interpreted as the spectrum of the m*(m+n)-submatrix of A formed by its m first rows and m+n first columns. We initiate the study of the asymptotics of these spectra when m goes to infinity in the case when A is a banded Toeplitz matrix. In particular, we present and partially prove a conjectural multivariate analog of the well-known Schmidt-Spitzer theorem which describes the spectral asymptotics for the sequence of principal minors of an arbitrary banded Toeplitz matrix. Finally, we discuss relations between polynomial bases B_A and multivariate orthogonal polynomials.
We show that sequences of skew Schur polynomials obtained from stretched semi-standard Young tableaux satisfy a linear recurrence, which we give explicitly. Using this, we apply this to finding certain asymptotic behavior of these Schur polynomials and present conjectures on minimal recurrences for stretched Schur polynomials.
We prove that for arbitrary partitions $\mathbfλ \subseteq \mathbfκ,$ and integers $0\leq c<r\leq n,$ the sequence of Schur polynomials $S_{(\mathbfκ + k\cdot \mathbf{1}^c)/(\mathbfλ + k\cdot \mathbf{1}^r)}(x_1,...,x_n)$ for $k$ sufficiently large, satisfy a linear recurrence. The roots of the characteristic equation are given explicitly. These recurrences are also valid for certain sequences of minors of banded Toeplitz matrices. In addition, we show that Widom's determinant formula from 1958 is a special case of a well-known identity for Schur polynomials.
Here we present certificates for 5 classes of 6-edged multigraphs whose symmetrized graph monomials may be represented as sum of squares, but not as linear combinations of partition square graphs. This is a complement to the results presented in Discriminants, symmetrized graph monomials, and sums of squares.
In this paper, we generalize several results of the article "Analytic continuation of eigenvalues of a quartic oscillator" of A. Eremenko and A. Gabrielov. We consider a family of eigenvalue problems for a Schrödinger equation with even polynomial potentials of arbitrary degree d with complex coefficients, and k<(d+2)/2 boundary conditions. We show that the spectral determinant in this case consists of two components, containing even and odd eigenvalues respectively. In the case with k=(d+2)/2 boundary conditions, we show that the corresponding parameter space consists of infinitely many connected components.
Motivated by the necessities of the invariant theory of binary forms J. J. Sylvester constructed in 1878 for each graph with possible multiple edges but without loops its symmetrized graph monomial which is a polynomial in the vertex labels of the original graph. In the 20-th century this construction was studied by several authors. We pose the question for which graphs this polynomial is a non-negative resp. a sum of squares. This problem is motivated by a recent conjecture of F. Sottile and E. Mukhin on discriminant of the derivative of a univariate polynomial, and an interesting example of P. and A. Lax of a graph with 4 edges whose symmetrized graph monomial is non-negative but not a sum of squares. We present detailed information about symmetrized graph monomials for graphs with four and six edges, obtained by computer calculations.