Search arXivSearch

arXiv · 2406.10927

Ungar Games on the Young-Fibonacci and the Shifted Staircase Lattices

Abstract

In 2023, Defant and Li introduced the Ungar move, which sends an element $v$ of a finite meet-semilattice $L$ to the meet of some subset of the elements covered by $v$. More recently, Defant, Kravitz, and Williams introduced the Ungar game on $L$, in which two players take turns making Ungar moves starting from an element of $L$ until the player that cannot make a nontrivial Ungar move loses. In this note, we settle two conjectures by Defant, Kravitz, and Williams on the Ungar games on the Young-Fibonacci lattice and the lattices of the order ideals of shifted staircases.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Yunseo Choi, Katelyn Gan. 2024-06-16. Ungar Games on the Young-Fibonacci and the Shifted Staircase Lattices. https://arxiv.org/abs/2406.10927

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