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

We know that $\mathbb{Z}_n$ is a finite field for a prime number $n$. Let $m,n$ be arbitrary natural numbers and let $\mathbb{Z}^m_n= \mathbb{Z}_n \times\mathbb{Z}_n\times...\times\mathbb{Z}_n$ be the Cartesian product of $m$ rings…

Reading cut the hyperplanes in a real central arrangement $\mathcal H$ into pieces called \emph{shards}, which reflect order-theoretic properties of the arrangement. We show that shards have a natural interpretation as certain generators of…

We study several variants of decomposing a symmetric matrix into a sum of a low-rank positive semidefinite matrix and a diagonal matrix. Such decompositions have applications in factor analysis and they have been studied for many decades.…

Let a polyhedron $P$ be defined by one of the following ways: (i) $P = \{x \in R^n \colon A x \leq b\}$, where $A \in Z^{(n+k) \times n}$, $b \in Z^{(n+k)}$ and $rank\, A = n$; (ii) $P = \{x \in R_+^n \colon A x = b\}$, where $A \in Z^{k…

Let $n$ be an arbitrary integer, let $p$ be a prime factor of $n$. Denote by $\omega_1$ the $p^{th}$ primitive unity root, $\omega_1:=e^{\frac{2\pi i}{p}}$. Define $\omega_i:=\omega_1^i$ for $0\leq i\leq p-1$ and…

We give, as $L$ grows to infinity, an explicit lower bound of order $L^{n/m}$ for the expected Betti numbers of the vanishing locus of a random linear combination of eigenvectors of $P$ with eigenvalues below $L$. Here, $P$ denotes an…

A distributive lattice structure ${\mathbf M}(G)$ has been established on the set of perfect matchings of a plane bipartite graph $G$. We call a lattice {\em matchable distributive lattice} (simply MDL) if it is isomorphic to such a…

The catenary data of a matroid $M$ of rank $r$ on $n$ elements is the vector $(\nu(M;a_0,a_1,\ldots,a_r))$, indexed by compositions $(a_0,a_1,\ldots,a_r)$, where $a_0 \geq 0$,\, $a_i > 0$ for $i \geq 1$, and $a_0+ a_1 + \cdots + a_r = n$,…

In 2022, Defant and Kravitz introduced extended promotion (denoted $\partial$), a map that acts on the set of labelings of a poset. Extended promotion is a generalization of Sch\"{u}tzenberger's promotion operator, a well-studied map that…

We propose and analyze a structure with which to organize the difference between a knot in the 3-sphere bounding a topologically embedded 2-disk in the 4-ball and it bounding a smoothly embedded disk. The n-solvable filtration of the…

Laplante-Anfossi associated to each rooted plane tree a polytope called an operahedron. He also defined a partial order on the vertex set of an operahedron and asked if the resulting poset is a lattice. We answer this question in the…

Suppose $M$ and $N$ are positive integers and let $k = \gcd(M, N)$, $m = M/k$, and $n=N/k$. We define a symmetric function $L_{M,N}$ as a weighted sum over certain tuples of lattice paths. We show that $L_{M,N}$ satisfies a generalization…

This paper introduces modern geometric combinatorial technology from the theory of triangulations in order to derive results in toric symplectic geometry. In the main part of the paper we prove a number of properties of the space…

Let $\mathcal C$ be a category with finite colimits, and let $(\mathcal E,\mathcal M)$ be a factorisation system on $\mathcal C$ with $\mathcal M$ stable under pushouts. Writing $\mathcal C;\mathcal M^{\mathrm{op}}$ for the symmetric…

We introduce a sequent calculus with a simple restriction of Lambek's product rules that precisely captures the classical Tamari order, i.e., the partial order on fully-bracketed words (equivalently, binary trees) induced by a…

The semigroup of weighted composition operators $(W_n)_{n\in \mathbb{N}}$, defined by $$W_nf(z)=(1+z+\cdots +z^n)f(z^n),$$ acts on the classical Hardy-Hilbert space $H^{2}(\mathbb{D})$, and exhibits intriguing connections with both the…

A linear operator $T$ between two lattice-normed spaces is said to be $p$-compact if, for any $p$-bounded net $x_\alpha$, the net $Tx_\alpha$ has a $p$-convergent subnet. $p$-Compact operators generalize several known classes of operators…

We give a novel algorithm for enumerating lattice points in any convex body, and give applications to several classic lattice problems, including the Shortest and Closest Vector Problems (SVP and CVP, respectively) and Integer Programming…

If V(R) is the vertex set of a symmetric cycle R in the tope graph of a simple oriented matroid M, then for any tope T of M there exists a unique inclusion-minimal subset Q(T;R) of V(R) such that T is the sum of the topes of Q(T;R). If…

Let $\mathcal M_{mn}=\mathcal M_{mn}(\mathbb F)$ denote the set of all $m\times n$ matrices over a field $\mathbb F$, and fix some $n\times m$ matrix $A\in\mathcal M_{nm}$. An associative operation $\star$ may be defined on $\mathcal…