English
Related papers

Related papers: On the geometry of stack-sorting simplices

200 papers

For a positive integer n, we denote by SUB (resp., SUBn) the class of all lattices that can be embedded into the lattice Co(P) of all order-convex subsets of a partially ordered set P (resp., P of length at most n). We prove the following…

General Mathematics · Mathematics 2007-05-23 Marina V. Semenova , Friedrich Wehrung

We introduce a lifting of West's stack-sorting map $s$ to partition diagrams, which are combinatorial objects indexing bases of partition algebras. Our lifting $\mathscr{S}$ of $s$ is such that $\mathscr{S}$ behaves in the same way as $s$…

Combinatorics · Mathematics 2023-07-26 John M. Campbell

We generalize Ehrhart's idea of counting lattice points in dilated rational polytopes: Given a rational simplex, that is, an n-dimensional polytope with n+1 rational vertices, we use its description as the intersection of n+1 halfspaces,…

Combinatorics · Mathematics 2007-05-23 Matthias Beck

There is currently a growing interest in understanding which lattice simplices have unimodal local $h^\ast$-polynomials (sometimes called box polynomials); specifically in light of their potential applications to unimodality questions for…

Combinatorics · Mathematics 2020-01-14 Liam Solus

We introduce the Tesler polytope Tes_n(a_1,a_2,...,a_n), whose integer points are the Tesler matrices of size n with nonnegative integer hook sums a_1,a_2,...,a_n. We show that Tes_n(a) is a flow polytope and therefore the number of Tesler…

Combinatorics · Mathematics 2017-05-09 Karola Mészáros , Alejandro H. Morales , Brendon Rhoades

We discuss generalizations of some results on lattice polygons to certain piecewise linear loops which may have a self-intersection but have vertices in the lattice $\mathbb{Z}^2$. We first prove a formula on the rotation number of a…

Combinatorics · Mathematics 2018-02-21 Akihiro Higashitani , Mikiya Masuda

Given a finite set of lattice points, we compare its sumsets and lattice points in its dilated convex hulls. Both of these are known to grow as polynomials. Generally, the former are subsets of the latter. In this paper, we will see that…

Number Theory · Mathematics 2007-05-23 Jaewoo Lee

Generalized permutahedra are the polytopes obtained from the permutahedron by changing the edge lengths while preserving the edge directions, possibly identifying vertices along the way. We introduce a "lifting" construction for these…

Combinatorics · Mathematics 2013-02-25 Federico Ardila , Jeffrey Doker

We exhibit a bijection between recently-introduced combinatorial objects known as valid hook configurations and certain weighted set partitions. When restricting our attention to set partitions that are matchings, we obtain three new…

Combinatorics · Mathematics 2020-06-02 Colin Defant , Michael Engen , Jordan A. Miller

We extend the results of Bey, Hen, and Wills (http://arxiv.org/abs/math/0606089). In this paper, we show that, up to equivalence under unimodular transformations, there is exactly one class of $d$-simplices having $k \ge 1$ interior lattice…

Combinatorics · Mathematics 2008-04-21 Han Duong

We examine the lattice of all order congruences of a finite poset from the viewpoint of combinatorial algebraic topology. We will prove that the order complex of the lattice of all nontrivial order congruences (or order-preserving…

Combinatorics · Mathematics 2016-12-30 Gejza Jenča , Peter Sarkoci

We prove that a space whose topological complexity equals 1 is homotopy equivalent to some odd-dimensional sphere. We prove a similar result, although not in complete generality, for spaces X whose higher topological complexity TC_n(X) is…

Algebraic Topology · Mathematics 2012-07-20 Mark Grant , Gregory Lupton , John Oprea

We prove new upper and lower bounds on transversal numbers of several classes of simplicial complexes. Specifically, we establish an upper bound on the transversal numbers of pure simplicial complexes in terms of the number of vertices and…

Combinatorics · Mathematics 2025-10-09 Isabella Novik , Hailun Zheng

Let P be a lattice polytope in R^n, and let P \cap Z^n = {v_1,...,v_N}. If the N + \binom N2 points 2v_1,...,2v_N; v_1+v_2,...v_{N-1}+v_N are distinct, we say that P is a "distinct pair-sum" or "dps" polytope. We show that, if P is a dsp…

Combinatorics · Mathematics 2007-05-23 M. D. Choi , T. Y. Lam , Bruce Reznick

Toric log del Pezzo surfaces correspond to convex lattice polygons containing the origin in their interior and having only primitive vertices. An upper bound on the volume and on the number of boundary lattice points of these polygons is…

Algebraic Geometry · Mathematics 2010-05-02 Alexander M. Kasprzyk , Maximilian Kreuzer , Benjamin Nill

Given a finite directed acyclic graph, the space of non-negative unit flows is a lattice polytope called the flow polytope of the graph. We consider the volumes of flow polytopes for directed acyclic graphs on $n+1$ vertices with a fixed…

Combinatorics · Mathematics 2024-05-30 Benjamin Braun , James Ford McElroy

In this paper we motivate some new directions of research regarding the lattice width of convex bodies. We show that convex bodies of sufficiently large width contain a unimodular copy of a standard simplex. This implies that every lattice…

Combinatorics · Mathematics 2019-11-12 Gennadiy Averkov , Johannes Hofscheier , Benjamin Nill

For each dimension $d$, $d$-dimensional integral simplices with exactly one interior integral point have bounded volume. This was first shown by Hensley. Explicit volume bounds were determined by Hensley, Lagarias and Ziegler, Pikhurko, and…

Combinatorics · Mathematics 2014-12-16 Gennadiy Averkov , Jan Krümpelmann , Benjamin Nill

We show that there are simple 4-dimensional polytopes with n vertices such that all separators of the graph have size at least $\Omega(n/\log n)$. This establishes a strong form of a claim by Thurston, for which the construction and proof…

Metric Geometry · Mathematics 2017-08-23 Lauri Loiskekoski , Günter M. Ziegler

We consider the set of permutations that are sorted after two passes through a pop stack. We characterize these permutations in terms of forbidden patterns (classical and barred) and enumerate them according to the ascent statistic. Then we…

Combinatorics · Mathematics 2019-06-25 Lara Pudwell , Rebecca Smith