Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2505.10763

Odd Shifted Parking Functions

Zachary Hamaker·Jesse Kim
View original source ↗Read source document ↗Export metadata ↓

Abstract

Stanley recently introduced the shifted parking function symmetric function $SH_n$, which is the shiftification of Haiman's parking function symmetric function $PF_n$. The function $SH_n$ lives in the subalgebra of symmetric functions generated by odd power sums. Stanley showed how to expand $SH_n$ into the $V-$basis of this algebra, which is indexed by partitions with all parts odd and is analogous to the complete homogeneous (or elementary) basis of symmetric functions. We introduce odd shifted parking functions to give combinatorial and representation-theoretic realizations of the $V-$expansion of $SH_n$, resolving the main open problem in his paper. Further, we present two representation-theoretic realizations of shiftification allowing us to interpret $SH_n$ as the spin character of a projective representation. We conclude with further directions, including a relationship between $SH_n$ and Haglund's $(q,t)-$Schröder theorem.

Explore related subjects

math.CO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Zachary Hamaker, Jesse Kim. 2025-05-16. Odd Shifted Parking Functions. https://arxiv.org/abs/2505.10763

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

KEEP EXPLORING

Related papers

arXiv2026

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↗
arXiv2026

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↗