Search arXivSearch

arXiv · 2502.09343

The number of monotone trapezoids with prescribed bottom row

Abstract

We establish an operator formula for the number of monotone trapezoids with prescribed bottom row, generalizing alternating sign matrices. The special case of the formula for monotone triangles previously provided an alternative proof for the enumeration of alternating sign matrices and led to several results on alternating sign triangles and alternating sign trapezoids. The generalization presented in this paper reveals an additional ``hidden operator'' that is annihilated in the special case of monotone triangles, whose discovery was a major challenge. The enumeration formula is conceptually simple: it applies, in addition to the newly discovered hidden operator, an operator ensuring row strictness to the formula for the number of Gelfand--Tsetlin trapezoids. Notably, the top row of the monotone trapezoid is not prescribed. Thus, our result involves a free boundary, which is a novel situation in this area. We also uncover an unexpected relation to the coinvariant algebra and propose a conjecture on its generalization.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Ilse Fischer, Hans Höngesberg. 2025-02-13. The number of monotone trapezoids with prescribed bottom row. https://arxiv.org/abs/2502.09343

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