Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2501.11073

Poset probability in two-row partition posets

Albin Jaldevik·Jan Snellman
View original source ↗Read source document ↗Export metadata ↓

Abstract

We find explicit formulae for poset probabilities \(\mathbf{Prob}(P_λ; α< β)\) in partition posets (cell posets) \(P_λ\) when \(λ=(λ_{1},λ_{2})\) is a two-row partition. These probabilities are given as rational expressions in \(f^{σ/ τ}\), where \(τ\subseteq σ\subseteq λ\). We then use well-known formulae, such as the hook-length formula for \(f^λ\), the number of standard Young tableaux on a partition \(λ\), and the corresponding determinantal formula by Jacobi-Trudi-Aitken for \(f^{λ/ μ}\), the number of standard Young tableaux on a skew partition \(λ/ μ\), to make the aforementioned expressions explicit. We also calculate the limit probabilities of \(\mathbf{Prob}(P_λ; α< β)\) when the elements \(α,β\) are fixed cells, but the arm-lengths of \(λ=(λ_{1},λ_{2})\) tend to infinity with bounded difference \(λ_{1} - λ_{2}\).

Explore related subjects

math.CO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Albin Jaldevik, Jan Snellman. 2026-06-16. Poset probability in two-row partition posets. https://arxiv.org/abs/2501.11073

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↗