English
Related papers

Related papers: $c$-Birkhoff polytopes

200 papers

For a Coxeter element $c$ of a finite Coxeter group, we consider a family of subword complexes parameterized by reduced expressions of the longest element. This family generalizes $c-$cluster complexes. We describe vertices of these…

Combinatorics · Mathematics 2020-11-18 Mikhail Gorsky

Baxter permutations are a class of permutations which are in bijection with a class of floorplans that arise in chip design called mosaic floorplans. We study a subclass of mosaic floorplans called $HFO_k$ defined from mosaic floorplans by…

Discrete Mathematics · Computer Science 2016-03-14 Shankar Balachandran , Sajin Koroth

We show that, for any regular Poisson manifold, there is an injective natural linear map from the first leafwise cohomology space into the first Poisson cohomology space which maps the Reeb class of the symplectic foliation to the modular…

Differential Geometry · Mathematics 2007-05-23 A. Abouqateb , M. Boucetta

A lattice polytope $P$ is called IDP if any lattice point in its $k$th dilate is a sum of $k$ lattice points in $P$. In 1991 Stanley proved a strong inequality in Ehrhart theory for IDP lattice polytopes. We show that his conclusion holds…

Combinatorics · Mathematics 2018-05-07 Johannes Hofscheier , Lukas Katthän , Benjamin Nill

For any finite Coxeter group W, we introduce two new objects: its cutting poset and its biHecke monoid. The cutting poset, constructed using a generalization of the notion of blocks in permutation matrices, almost forms a lattice on W. The…

Combinatorics · Mathematics 2013-10-08 Florent Hivert , Anne Schilling , Nicolas M. Thiéry

Stanley introduced and studied two lattice polytopes, the order polytope and chain polytope, associated to a finite poset. Recently Ohsugi and Tsuchiya introduce an enriched version of them, called the enriched order polytope and enriched…

Combinatorics · Mathematics 2024-03-08 Soichi Okada , Akiyoshi Tsuchiya

Any square matrix can be transformed into a doubly stochastic matrix via Sinkhorn scaling with diagonal matrices or completing to a larger dimensional matrix. Standard Birkhoff-von Neumann and Pauli decompositions represent such matrices as…

Quantum Physics · Physics 2026-05-28 Ammar Daskin

In this note, we derive an asymptotically sharp upper bound on the number of lattice points in terms of the volume of centrally symmetric convex bodies. Our main tool is a generalization of a result of Davenport that bounds the number of…

Metric Geometry · Mathematics 2013-10-25 Matthias Henze

There are well-known examples of dynamical systems for which the Birkhoff averages with respect to a given observable along some or all of the orbits do not converge. It has been suggested that such orbits could be classified using higher…

Dynamical Systems · Mathematics 2011-12-02 Thomas Jordan , Vincent Naudot , Todd Young

A seminal result in the theory of toric varieties, due to Knudsen, Mumford and Waterman (1973), asserts that for every lattice polytope $P$ there is a positive integer $k$ such that the dilated polytope $kP$ has a unimodular triangulation.…

Combinatorics · Mathematics 2014-10-01 Francisco Santos , Günter M. Ziegler

We prove that the restriction of Bruhat order to noncrossing partitions in type $A_n$ for the Coxeter element $c=s_1s_2 ...s_n$ forms a distributive lattice isomorphic to the order ideals of the root poset ordered by inclusion. Motivated by…

Combinatorics · Mathematics 2015-03-03 Thomas Gobet , Nathan Williams

After fixing a canonical ordering (or labeling) of the elements of a finite poset, one can associate each linear extension of the poset with a permutation. Some recent papers consider specific families of posets and ask how many linear…

Combinatorics · Mathematics 2023-06-22 Colin Defant

A matrix $C$ has the Monge property if $c_{ij} + c_{IJ} \leq c_{Ij} + c_{iJ}$ for all $i < I$ and $j < J$. Monge matrices play an important role in combinatorial optimization; for example, when the transportation problem (resp., the…

Combinatorics · Mathematics 2023-11-15 William Q. Erickson , Jan Kretschmann

In a previous work, B\'ona and Pantone studied permutations that avoided all but one pattern of length $k$ that began with a length $k-1$ increasing subsequence. We draw the connection between that idea and distant patterns, first discussed…

Combinatorics · Mathematics 2025-11-27 Nicholas Van Nimwegen

In 2001, Chow developed the theory of the $B_n$ posets $P$ and the type $B$ $P$-partition enumerators $K^B_P$. To provide a representation-theoretic interpretation of $K^B_P$, we define the poset modules $M^B_P$ of the 0-Hecke algebra…

Representation Theory · Mathematics 2026-02-02 Young-Hun Kim , Dominic Searles

We report a diversity of stable gap solitons in a spin-orbit coupled Bose-Einstein condensate subject to a spatially periodic Zeeman field. It is shown that the solitons, can be classified by the main physical symmetries they obey, i.e.…

Quantum Gases · Physics 2015-06-17 Yaroslav V. Kartashov , Vladimir V. Konotop , Fatkhulla Kh. Abdullaev

In a recent project, Castillo, Libedinsky, Plaza, and the author established a deep connection between the size of lower Bruhat intervals in affine Weyl groups and the volume of the permutohedron, showing that the former can be expressed as…

Combinatorics · Mathematics 2025-04-01 Damian de la Fuente

We introduce the poset of biflats of a matroid $M$, a Lagrangian analog of the lattice of flats of $M$, and study the topology of its order complex, which we call the biflats complex. This work continues the study of the Lagrangian…

Combinatorics · Mathematics 2026-03-04 Anastasia Nathanson , Ethan Partida

Stanley introduced in 1986 the order polytope and the chain polytope for a given finite poset. These polytopes contain much information about the poset and have given rise to important examples in polyhedral geometry. In 1993, Reiner…

Combinatorics · Mathematics 2023-11-09 Matthias Beck , Max Hlavacek

Starting from any finite simple graph, one can build a reflexive polytope known as a symmetric edge polytope. The first goal of this paper is to show that symmetric edge polytopes are intrinsically matroidal objects: more precisely, we…

Combinatorics · Mathematics 2023-07-12 Alessio D'Alì , Martina Juhnke-Kubitzke , Melissa Koch