Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2003.04134

Some natural extensions of the parking space

Matjaž Konvalinka·Vasu Tewari
View original source ↗Read source document ↗Export metadata ↓

Abstract

We construct a family of $S_n$ modules indexed by $c\in\{1,\dots,n\}$ with the property that upon restriction to $S_{n-1}$ they recover the classical parking function representation of Haiman. The construction of these modules relies on an $S_n$-action on a set that is closely related to the set of parking functions. We compute the characters of these modules and use the resulting description to classify them up to isomorphism. In particular, we show that the number of isomorphism classes is equal to the number of divisors $d$ of $n$ satisfying $ d\neq 2 \: (\!\!\!\!\mod 4)$. In the cases $c=n$ and $c=1$, we compute the number of orbits. Based on empirical evidence, we conjecture that when $c=1$, our representation is $h$-positive and is in fact the (ungraded) extension of the parking function representation constructed by Berget and Rhoades.

Explore related subjects

math.CO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Matjaž Konvalinka, Vasu Tewari. 2020-03-09. Some natural extensions of the parking space. https://arxiv.org/abs/2003.04134

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

KEEP EXPLORING

Related papers

arXiv2026

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO↗
arXiv2026

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO↗