Search arXivSearch

arXiv · 2509.17064

A bijection between symmetric plane partitions and quasi transpose complementary plane partitions

Abstract

We resolve the explicit bijection problem between symmetric plane partitions (SPPs) and quasi transpose complementary plane partitions (QTCPPs), introduced by Schreier-Aigner, who proved their equinumerosity. First, we relate this problem to Proctor's parallel equinumerosities for SPPs, even SPPs, staircase plane partitions, and parity staircase plane partitions, by constructing several bijections. As a result, we reduce the task to constructing a compatible bijection between even SPPs and staircase plane partitions. We then provide non-intersecting lattice path configurations for these objects, apply the LGV lemma, and transform the resulting path configurations. This process leads us to new combinatorial objects, $I_m$ and $J_m$, and the task is further reduced to constructing a compatible sijection (signed bijection) between $I_m$ and $J_m$, which is carried out in the final part of this paper. Our construction also answers the 35-year-old open problem posed by Proctor: constructing an explicit bijection between even SPPs and staircase plane partitions.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Takuya Inoue. 2026-01-05. A bijection between symmetric plane partitions and quasi transpose complementary plane partitions. https://arxiv.org/abs/2509.17064

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