Related papers: The Pop-stack-sorting Operator on Tamari Lattices

A covering with dominoes of a rectilinear region is called \emph{tatami} if no four dominoes meet at any point. We describe a reduction from planar 3SAT to Domino Tatami Covering. As a consequence it is NP-complete to decide whether there…

For a monoid $M$, we denote by $\mathbb G(M)$ the group of units, $\mathbb E(M)$ the submonoid generated by the idempotents, and $\mathbb G_L(M)$ and $\mathbb G_R(M)$ the submonoids consisting of all left or right units. Writing $\mathcal…

Motivated by the Lagrange top coupled to an oscillator, we consider the quasi-periodic Hamiltonian Hopf bifurcation. To this end, we develop the normal linear stability theory of an invariant torus with a generic (i.e., non-semisimple)…

The Fuss-Catalan numbers are a generalization of the Catalan numbers. They enumerate a large class of objects and in particular m-Dyck paths and m+1-ary trees. Recently, F. Bergeron defined an analogue for generic m of the Tamari order on…

The Cambrian lattices, introduced in (Reading, 2006), generalize the Tamari lattice to any choice of Coxeter element in any finite Coxeter group. They are further generalized to the m-Cambrian lattices (Stump, Thomas, Williams, 2015).…

We introduce a novel combinatorial structure called pointed building sets, which can be viewed as families of lattices equipped with compatibility relations. To each pointed building set $\mathsf{B}$, we associate a complete lattice…

Let $G$ be a Lie group, $H$ a closed subgroup and $M$ the homogeneous space $G/H$. Each representation $\Psi$ of $H$ determines a $G$-equivariant principal bundle ${\mathcal P}$ on $M$ endowed with a $G$-invariant connection. We consider…

A lattice is called well-rounded if its minimal vectors span the corresponding Euclidean space. In this paper we completely describe well-rounded full-rank sublattices of ${\mathbb Z}^2$, as well as their determinant and minima sets. We…

A sock sequence is a sequence of elements, which we will refer to as socks, from a finite alphabet. A sock sequence is sorted if all occurrences of a sock appear consecutively. We define equivalence classes of sock sequences called sock…

A polynomial optimization problem (POP) asks for minimizing a polynomial function given a finite set of polynomial constraints (equations and inequalities). This problem is well-known to be hard in general, as it encodes many hard…

Let $M$ be a compact smooth manifold equipped with a positive smooth density $\mu$ and $H$ be a smooth distribution endowed with a fiberwise inner product $g$. We define the Laplacian $\Delta_H$ associated with $(H,\mu,g)$ and prove that it…

In a series of recent papers, W. M. Schmidt and L. Summerer developed a new theory by which they recover all major generic inequalities relating exponents of Diophantine approximation to a point in $\mathbb{R}^n$, and find new ones. Given a…

Let $P$ be a simple polytope of dimension $n$ with $m$ facets. In this paper we pay our attention on those elementary symmetric polynomials in the Stanley--Reisner face ring of $P$ and study how the decomposability of the $n$-th elementary…

We compute the lattice operations for the (pairwise) stable set in many-to-many matching markets when only path-independence on agents' choice functions is imposed. To do this, we first show that the sets of firm-quasi-stable and…

We construct relative moduli spaces of semistable pairs on a family of projective Deligne-Mumford stacks. We define moduli stacks of stable orbifold Pandharipande-Thomas pairs on stacks of expanded degenerations and pairs, and then show…

The Tamari lattices have been intensely studied since their introduction by Dov Tamari around 1960. However oddly enough, a formula for the number of maximal chains is still unknown. This is due largely to the fact that maximal chains in…

Permutations in the image of the pop-stack operator are said to be pop-stacked. We give a polynomial-time algorithm to count pop-stacked permutations up to a fixed length and we use it to compute the first 1000 terms of the corresponding…

A dynamical version of the Bourgain-Fremlin-Talagrand dichotomy shows that the enveloping semigroup of a dynamical system is either very large and contains a topological copy of $\beta \N$, or it is a "tame" topological space whose topology…

For a many-to-many matching market, we study the lattice structure of the set of random stable matchings. We define a partial order on the random stable set and present two intuitive binary operations to compute the least upper bound and…

The \emph{generalized sorting problem} is a restricted version of standard comparison sorting where we wish to sort $n$ elements but only a subset of pairs are allowed to be compared. Formally, there is some known graph $G = (V, E)$ on the…