Search arXivSearch

arXiv · 2511.10548

Outline Rectangles, Allocations, and Latin Young Diagrams

Abstract

A Young diagram is \emph{Latin} if there is an assignment of integers to its cells so that each row $i$ of length $l_i$ is populated by the numbers $1,\ldots,l_i$, and the numbers in each column are distinct. A Young diagram is called \emph{wide} if any subdiagram, formed by a subset of its rows, dominates its conjugate. Chow et al. [Advances in Applied Mathematics, 31, 2003] conjectured that any wide Young diagram is Latin. We introduce a notion of an \emph{allocation} which can be thought of as a coarse attempt at finding a Latin filling for a Young diagram. Using a theorem of Hilton, we prove that a Young diagram has an allocation if and only if it is Latin. This enables us to prove Chow et al.'s conjecture for Young diagrams with three distinct row lengths.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jack Allsop, Daniel Kotlar, Ian Wanless. 2025-11-13. Outline Rectangles, Allocations, and Latin Young Diagrams. https://arxiv.org/abs/2511.10548

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

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO