Searcharxiv⌕ Search

arXiv subjects

Laura Colmenarejo

Publications and source records attributed to Laura Colmenarejo.

At least 19 recordsLinked to original sources
arXiv2026

Formulas for Koornwinder polynomials

This paper provides formulas for Koornwinder polynomials in analogy with the creation formula, the alcove walk formula and the non-attacking fillings formula for the type $GL_n$ Macdonald polynomials. We state the creation formula in terms of the divided-difference operators used in Schubert calculus, and we use a box-greedy reduced word to reformulate the alcove walk formula in terms of uncompressed set-valued tableaux. Then two types of compression, ``around-the-end compression'' and ``across-the-$0$-gap compression'', are used to derive a formula for Koornwinder polynomials in terms of compressed set-valued tableaux. Throughout we work in the full generality of relative Koornwinder polynomials, which are the analogues of the permuted basement Macdonald polynomials used in the type $GL_n$ case.

math.CO↗
arXiv2026

Cyclic sieving for a class of rectangular domino tableaux

The cyclic sieving phenomenon (CSP) provides valuable data about symmetry classes of cyclic actions, and has applications to representation theory. In this paper, we enumerate domino tableaux of shape 2-by-n, and use this result to prove a new CSP on these objects. We then enumerate the rectangular domino tableaux of any dimensions, and conjecture a more general CSP on rectangular domino tableaux. As a consequence of the enumerative results, we obtain several identities involving Fibonacci and Catalan numbers.

math.CO↗
arXiv2026

The Total Chromatic Quasisymmetric Functions of a Graph

In this paper, we introduce and study two variants of the chromatic quasisymmetric function of a graph: the total chromatic quasisymmetric function via vertex labeling and via acyclic orientations. The original definition of the chromatic quasisymmetric function of a graph by Shareshian and Wachs depends on a labeling of the vertices of the graph, which directly affects the properties of the coefficients appearing in the decomposition of the chromatic quasisymmetric function of a graph into different bases. Motivated by this, we construct the first variant of the chromatic quasisymmetric function of a graph by normalizing it with respect to all the labelings of the vertices. The second variant is motivated by the \emph{tree isomorphism conjecture} and is constructed in terms of acyclic orientations. We investigate the properties of the coefficients in the expansion in the monomial quasisymmetric basis for both variants and provide a comparative analysis. Furthermore, we derive explicit formulas for the coefficients in the monomial decomposition of the two variants for the star graph. For the labeling-based variant, these coefficients arise from a binomial identity for which we provide a combinatorial proof.

math.CO↗
arXiv2026

The quantum k-Bruhat order

In this paper, we extend the study of the quantum $k$-Bruhat order initiated in the work of Benedetti, Bergeron, Colmenarejo, Saliola, and Sottile concerning the quantum Murnaghan-Nakayama rule. Specifically, identifying maximal chains in intervals of the quantum $k$-Bruhat order with sequences of transpositions, we investigate a naturally associated free monoid $F_n^{\mathbf{q}}$ with an action on a $q$-extension of $S_n$, denoted $S_n[\mathbf{q}]$, which encodes the chain structure of the quantum $k$-Bruhat order. Aside from numerous structural results, our main contribution is an identification of a large family of equivalences satisfied by the elements of $F_n^{\mathbf{q}}$ as operators on $S_n[\mathbf{q}]$. In fact, we conjecture that our list of equivalences is complete. As a consequence of the quantum Monk's rule, a complete understanding of such equivalences can be used to gain information about the multiplicative structure of quantum Schubert polynomials.

math.CO↗
arXiv2024

$c$-functions and Koornwinder polynomials

This paper develops the theory of Macdonald-Koornwinder polynomials in parallel analogy with the work done for the $GL_n$ case in [CR22]. In the context of the type $CC_n$ affine root system the Macdonald polynomials of other root systems of classical type are specializations of the Koornwinder polynomials. We derive $c$-function formulas for symmetrizers and use them to give $E$-expansions, principal specializations and norm formulas for bosonic, mesonic and fermionic Koornwinder polynomials. Finally, we explain the proof of the norm conjectures and constant term conjectures for the Koornwinder case.

math.CO↗
arXiv2024

A quantum Murnaghan--Nakayama rule for the flag manifold

In this paper, we give a rule for the multiplication of a Schubert class by a tautological class in the (small) quantum cohomology ring of the flag manifold. As an intermediate step, we establish a formula for the multiplication of a Schubert class by a quantum Schur polynomial indexed by a hook partition. This entails a detailed analysis of chains and intervals in the quantum Bruhat order. This analysis allows us to use results of Leung--Li and of Postnikov to reduce quantum products by hook Schur polynomials to the (known) classical product.

math.CO↗
arXiv2024

The $e$-positivity of the chromatic symmetric function for twinned paths and cycles

The operation of twinning a graph at a vertex was introduced by Foley, Ho\`ang, and Merkel (2019), who conjectured that twinning preserves $e$-positivity of the chromatic symmetric function. A counterexample to this conjecture was given by Li, Li, Wang, and Yang (2021). In this paper, we prove that $e$-positivity is preserved by the twinning operation on cycles, by giving an $e$-positive generating function for the chromatic symmetric function, as well as an $e$-positive recurrence. We derive similar $e$-positive generating functions and recurrences for twins of paths. Our methods make use of the important triple deletion formulas of Orellana and Scott (2014), as well as new symmetric function identities.

math.CO↗
arXiv2024

On the Lucky and Displacement Statistics of Stirling Permutations

Stirling permutations are parking functions, and we investigate two parking function statistics in the context of these objects: lucky cars and displacement. Among our results, we consider two extreme cases: extremely lucky Stirling permutations (those with maximally many lucky cars) and extremely unlucky Stirling permutations (those with exactly one lucky car). We show that the number of extremely lucky Stirling permutations of order $n$ is the Catalan number $C_n$, and the number of extremely unlucky Stirling permutations is $(n-1)!$. We also give some results for luck that lies between these two extremes. Further, we establish that the displacement of any Stirling permutation of order $n$ is $n^2$, and we prove several results about displacement composition vectors. We conclude with directions for further study.

math.CO↗
arXiv2023

On ranked and bounded Kohnert posets

In this paper, we explore combinatorial properties of the posets associated with Kohnert polynomials. In particular, we determine a sufficient condition guaranteeing when such ``Kohnert posets'' are bounded and two necessary conditions for when they are ranked. Moreover, we apply the aforementioned conditions to find complete characterizations of when Kohnert posets are bounded and when they are ranked in special cases, including those associated with Demazure characters.

math.CO↗
arXiv2022

c-functions and Macdonald polynomials

This is a paper about $c$-functions and Macdonald polynomials. There are $c$-function formulas for $E$-expansions of $P_\lambda$ and $A_{\lambda+\rho}$, principal specializations of $P_\lambda$ and $E_\mu$, for Macdonald's constant term formulas, and for the norms of Macdonald polynomials. Most of these follow from the creation formulas for Macdonald polynomials, providing alternative proofs to several results from Macdonald (2003). In addition, we prove the Boson-Fermion correspondence in the Macdonald polynomial setting and the Weyl character formula for Macdonald polynomials.

math.CO↗
arXiv2021

Chromatic symmetric functions of Dyck paths and q-rook theory

The chromatic symmetric function (CSF) of Dyck paths of Stanley and its Shareshian-Wachs $q$-analogue have important connections to Hessenberg varieties, diagonal harmonics and LLT polynomials. In the, so called, abelian case they are also curiously related to placements of non-attacking rooks by results of Stanley-Stembridge (1993) and Guay-Paquet (2013). For the $q$-analogue, these results have been generalized by Abreu-Nigro (2020) and Guay-Paquet (private communication), using $q$-hit numbers. Among our main results is a new proof of Guay-Paquet's elegant identity expressing the $q$-CSFs in a CSF basis with $q$-hit coefficients. We further show its equivalence to the Abreu-Nigro identity expanding the $q$-CSF in the elementary symmetric functions. In the course of our work we establish that the $q$-hit numbers in these expansions differ from the originally assumed Garsia-Remmel $q$-hit numbers by certain powers of $q$. We prove new identities for these $q$-hit numbers, and establish connections between the three different variants.

math.CO↗
arXiv2020

Chromatic symmetric functions of Dyck paths and q-rook theory (extended abstract)

The chromatic symmetric function (CSF) of Dyck paths of Stanley and its Shareshian-Wachs $q$-analogue have important connections to Hessenberg varieties, diagonal harmonics, and LLT polynomials. In the case of, so-called, abelian Dyck paths they are also curiously related to placements of non-attacking rooks by results of Stanley-Stembridge (1993) and Guay-Paquet (2013). For the $q$-analogue, these results have been generalized by Abreu-Nigro (2020) and Guay-Paquet (private communication), using $q$-hit numbers, which are a variant of the ones introduced by Garsia and Remmel. Among our main results is a new proof of Guay-Paquet's elegant identity expressing the $q$-CSFs in a CSF basis with $q$-hit coefficients. We further show its equivalence to the Abreu-Nigro identity expanding the $q$-CSF in the elementary symmetric functions. This is the FPSAC extended abstract version. The full version is at ArXiv: 2104.07599.

math.CO↗
arXiv2020

Counting $k$-Naples parking functions through permutations and the $k$-Naples area statistic

We recall that the $k$-Naples parking functions of length $n$ (a generalization of parking functions) are defined by requiring that a car which finds its preferred spot occupied must first back up a spot at a time (up to $k$ spots) before proceeding forward down the street. Note that the parking functions are the specialization of $k$ to $0$. For a fixed $0\leq k\leq n-1$, we define a function $\varphi_k$ which maps a $k$-Naples parking function to the permutation denoting the order in which its cars park. By enumerating the sizes of the fibers of the map $\varphi_k$ we give a new formula for the number of $k$-Naples parking functions as a sum over the permutations of length $n$. We remark that our formula for enumerating $k$-Naples parking functions is not recursive, in contrast to the previously known formula of Christensen et al [CHJ+20]. It can be expressed as the product of the lengths of particular subsequences of permutations, and its specialization to $k=0$ gives a new way to describe the number of parking functions of length $n$. We give a formula for the sizes of the fibers of the map $\varphi_0$, and we provide a recurrence relation for its corresponding logarithmic generating function. Furthermore, we relate the $q$-analog of our formula to a new statistic that we denote $\texttt{area}_k$ and call the $k$-Naples area statistic, the specialization of which to $k=0$ gives the $\texttt{area}$ statistic on parking functions.

math.CO↗
arXiv2020

An insertion algorithm on multiset partitions with applications to diagram algebras

We generalize the Robinson-Schensted-Knuth algorithm to the insertion of two row arrays of multisets. This generalization leads to new enumerative results that have representation theoretic interpretations as decompositions of centralizer algebras and the spaces they act on. In addition, restrictions on the multisets lead to further identities and representation theory analogues. For instance, we obtain a bijection between words of length $k$ with entries in $[n]$ and pairs of tableaux of the same shape with one being a standard Young tableau of size $n$ and the other being a standard multiset tableau of content $[k]$. We also obtain an algorithm from partition diagrams to pairs of a standard tableau and a standard multiset tableau of the same shape, which has the remarkable property that it is well-behaved with respect to restricting a representation to a subalgebra. This insertion algorithm matches recent representation-theoretic results of Halverson and Jacobson.

math.CO↗
arXiv2020

Singular Nonsymmetric Macdonald Polynomials and Quasistaircases

Singular nonsymmetric Macdonald polynomials are constructed by use of the representation theory of the Hecke algebras of the symmetric groups. These polynomials are labeled by quasistaircase partitions and are associated to special parameter values $(q,t)$. For $N$ variables, there are singular polynomials for any pair of positive integers $m$ and $n$, with $2\leq n\leq N$, and parameters values $(q,t)$ satisfying $q^{a}t^{b}=1$ exactly when $a=rm$ and $b=rn$, for some integer $r$. The coefficients of nonsymmetric Macdonald polynomials with respect to the basis of monomials $\big\{ x^α\big\}$ are rational functions of $q$ and $t$. In this paper, we present the construction of subspaces of singular nonsymmetric Macdonald polynomials specialized to particular values of $(q,t)$. The key part of this construction is to show the coefficients have no poles at the special values of $(q,t)$. Moreover, this subspace of singular Macdonald polynomials for the special values of the parameters is an irreducible module for the Hecke algebra of type $A_{N-1}$.

math.RT↗
arXiv2020

Signatures of paths transformed by polynomial maps

We characterize the signature of piecewise continuously differentiable paths transformed by a polynomial map in terms of the signature of the original path. For this aim, we define recursively an algebra homomorphism between two shuffle algebras on words. This homomorphism does not depend on the path and behaves well with respect to composition and homogeneous maps. It allows us to describe the relation between the signature of a piecewise continuously differentiable path and the signature of the path obtained by transforming it under a polynomial map. We also study this map as a half-shuffle homomorphism and give a generalization of our main theorem in terms of Zinbiel algebras.

math.RA↗
arXiv2019

A positivity conjecture on the structure constants of shifted Jack functions

We consider Jack polynomials $J_\lambda$ and their shifted analogue $J^#_\lambda$. In 1989, Stanley conjectured that $\langle J_\mu J_\nu, J_\lambda \rangle$ is a polynomial with nonnegative coefficients in the parameter $\alpha$. In this note, we extend this conjecture to the case of shifted Jack polynomials.

math.CO↗