The Ungar games

DOI10.1007/S00493-024-00083-6MaRDI QIDQ6548025zbMATH OpenFDO

Authors Colin Defant, Noah Kravitz, Nathan Williams

Publication date 31 May 2024

Published in Combinatorica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S00493-024-00083-6

zbMATH Keywords

combinatorial gamelatticeTamari latticeUngar moveweak orderYoung's lattice

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Exact enumeration problems, generating functions (05A15) Asymptotic enumeration (05A16) Combinatorial aspects of partitions of integers (05A17) Combinatorics of partially ordered sets (06A07) Structure theory of lattices (06B05) 2-person games (91A05) Combinatorial games (91A46)

Review text

From the structures of a finite lattice they developed a 2-players combinatorial game defining an Ungar move. They proved results for characterizing issues on the principal order ideals, characterized the winner strategies, among other theoretical results. The computational complexity of these games are also given.

Recommendations

• Lattices of games
• Lattice games without rational strategies
• The lattice structure of n-player games
• Algorithms for lattice games
• The Lattice Structure of Three-Player Games

Cites work

• 2N noncollinear points determine at least 2N directions
• A Curious Nim-Type Game
• Analytic combinatorics
• Associahedra, Tamari lattices and related structures. Tamari memorial Festschrift
• Cambrian lattices.
• Counting Pop-Stacked Permutations in Polynomial Time
• Deciding the Winner of an Arbitrary Finite Poset Game Is PSPACE-Complete
• Differential Posets
• Enumerating permutations sortable by \(k\) passes through a pop-stack
• Flip-sort and combinatorial aspects of pop-stack sorting
• Flipping the winner of a poset game
• Generalized Robinson-Schensted-Knuth correspondence
• scientific article; zbMATH DE number 6016068 (Why is no real title available?)
• scientific article; zbMATH DE number 3178652 (Why is no real title available?)
• scientific article; zbMATH DE number 3779340 (Why is no real title available?)
• Meeting covered elements in -Tamari lattices
• On the complexity of some two-person perfect-information games
• On the dominance partial ordering of Dyck paths
• On the Sets of Directions Determined by n Points
• On uniformity within \(NC^ 1\)
• Pop-stack sorting and its image: permutations with overlapping runs
• Pop-stack-sorting for Coxeter groups
• Proofs from THE BOOK
• Semidistrim Lattices
• The image of the pop operator on various lattices
• The pop-stack-sorting operator on Tamari lattices
• Three-rowed CHOMP
• Two-stack-sorting with pop stacks
• Ungarian Markov chains

This page was built for publication: The Ungar games

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6548025)