Search arXiv⌕ Search

arXiv · 2609.03881

Eulerian insertion operators and an Eulerian form of the Pieri rule

Abstract

We study the operators obtained by inserting copies of a new largest letter into multiset permutations. Let $G_r$ denote the operator which inserts $r$ copies of a new largest letter. After the change of variables $δ=y-x$, $u=x/y$, and $E=u\partial_u$, we find that $$G_r=\frac{δ^r}{r!}E(E+1)\cdots(E+r-1).$$ Its generating series acts by a rational substitution, which yields the composition law. Our main result gives a common symmetric-function explanation for the ordinary and major-index operators. For $N\geq 0$, define $Φ_N(F_{N,S})=x^{|S|+1}y^{N-|S|}$. We prove that multiplication by the complete homogeneous symmetric function $h_r$ becomes the ordinary insertion operator: $Φ_{N+r}(h_r f)=G_rΦ_N(f)$, where $f\in\mathrm{QSym}_N$. There is a parallel specialization for the major index. A reverse finite principal specialization sends multiplication by $h_r$ to an operator $Q_r$, which is a polynomial in the $q$-shift $Θ_qf(t)=f(qt)$. Thus the ordinary and major-index operators arise from the same multiplication operator $f\mapsto h_r f$. Since the functions $h_r$ freely generate the ring of symmetric functions, the assignment $h_r\mapsto G_r$ extends to an algebra homomorphism. We determine the kernel of this homomorphism and the image of every homogeneous component. The images of Schur functions satisfy the Littlewood--Richardson multiplication identities, and the one-row case gives an Eulerian form of the Pieri rule.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Shi-Mei Ma. 2026-09-03. Eulerian insertion operators and an Eulerian form of the Pieri rule. https://arxiv.org/abs/2609.03881

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

On nut graphs with two vertex and three edge orbits

Nut graphs are graphs whose adjacency matrix is singular with one-dimensional null space spanned by a vector with no zero entries. In a recent paper, Bašić, Fowler and Pisanski proved that the automorphism group of a nut graph has more orbits on the edge set than on the vertex set. They classified all orders for which a vertex-transitive nut graph with precisely two edge orbits exists, and conjectured that a nut graph with two vertex and three edge orbits exists for each non-prime order $n \ge 9$. Motivated by this conjecture, we introduce a very general construction that provides graphs with the desired symmetry properties, and we determine some sufficient spectral and structural conditions under which they are nut graphs. The construction yields infinite families of examples and confirms the above conjecture for all odd non-prime orders up to $2\,500$ and for at least $99.8$ percent of all odd non-prime orders up to a million. Finally, we present some additional interesting examples of nut graphs with two vertex and three edge orbits that do not arise from this construction.

math.CO↗

On vertex-minimal simplicial maps to the sphere

For positive integers $n,d$, let $λ(n,d)$ be the minimal number of vertices of a triangulation of the $n$-sphere which admits a degree $d$ simplicial map onto the boundary of the $(n+1)$-simplex. We show that for $h=\lfloor\frac{n+1}2\rfloor$, the function $λ(n,d)^h$ has linear order of growth in $d$, answering a question of O. Musin. All triangulations we obtained are isomorphic to boundaries of convex polytopes in $\mathbb{R}^{n+1}$.

math.CO↗