Search arXivSearch

arXiv · 2312.12615

Some frustrating questions on dimensions of products of posets

Abstract

For $P$ a poset, the dimension of $P$ is defined to be the least cardinal $κ$ such that $P$ is embeddable in a direct product of $κ$ totally ordered sets. We study the behavior of this function on finite-dimensional (not necessarily finite) posets. In general, the dimension dim($P$ x $Q$) of a product of two posets can be smaller than dim($P$) + dim($Q$), though no cases are known where the discrepancy is greater than 2. We obtain a result that gives upper bounds on the dimensions of certain products of posets, including cases where the discrepancy 2 is achieved. But the paper is mainly devoted to stating questions, old and new, about dimensions of product posets, noting implications among their possible answers, and introducing some related concepts that might be helpful in tackling these questions.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

George M. Bergman. 2025-12-29. Some frustrating questions on dimensions of products of posets. https://doi.org/10.1016/j.disc.2026.115002

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