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

Let $\mathscr{M}$ be a $II_1$ factor acting on the Hilbert space $\mathscr{H}$, and $\mathscr{M}_{\textrm{aff}}$ be the Murray-von Neumann algebra of closed densely-defined operators affiliated with $\mathscr{M}$. Let $\tau$ denote the…

In this paper we consider $m$ ($m \geq 1$)conjunctions of Max-atoms that is atoms of the form $\max(z,y) + r \geq x$, where the offset $r$ is a real constant and $x,y,z$ are variables. We show that the Max-atom problem (MAP) belongs to…

Let $M(N_{h,n})$ denote the mapping class group of a compact nonorientable surface of genus $h\ge 7$ and $n\le 1$ boundary components, and let $T(N_{h,n})$ be the subgroup of $M(N_{h,n})$ generated by all Dehn twists. It is known that…

This paper first gives a necessary and sufficient condition that a lattice $L$ can be represented as the collection of all up-sets of a poset. Applying the condition, it obtains a necessary and sufficient condition that a lattice can be…

We introduce new partial order structures on the underlying sets of free nonsymmetric operads. These posets involve decorated ordered rooted trees, and their terminal intervals are lattices. These lattices are not graded, not self-dual, and…

Partially ordered patterns (POPs) generalize the classical notion of permutation patterns within the framework of pattern avoidance. Building on recent work by Burstein, Han, Kitaev, and Zhang, which introduced the concept of…

We consider the variety of $(p+1)$-tuples of matrices $M_j$ from given conjugacy classes from $GL(n,{\bf C})$ such that $M_1... M_{p+1}=I$. This variety is connected with the Deligne-Simpson problem and the matrices $M_j$ are interpreted as…

Modular lattices, introduced by R. Dedekind, are an important subvariety of lattices that includes all distributive lattices. Heitzig and Reinhold developed an algorithm to enumerate, up to isomorphism, all finite lattices up to size 18.…

We show how the Tutte polynomial of a matroid $M$ can be computed from its condensed configuration, which is a statistic of its lattice of cyclic flats. The results imply that the Tutte polynomial of $M$ is already determined by the…

We introduce natural binary set-theoretical products on the set of all $m$-Dyck paths, which led us to define a non-symmetric algebraic operad $\Dy^m$, described on the vector space spanned by $m$-Dyck paths. Our construction is closely…

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…

In this paper we present algorithmic considerations and theoretical results about the relation between the orders of certain groups associated to the components of a polynomial and the order of the group that corresponds to the polynomial,…

Often in mathematics it is useful to summarize a multivariate phenomenon with a single number and in fact, the determinant -- which is represented by det -- is one of the simplest cases. In fact, this number it is defined only for square…

Recently MV18 identified and initiated work on the new problem of understanding structural relationships between the lattices of solutions of two "nearby" instances of stable matching. They also gave an application of their work to finding…

Let $\mathbf{a} = (a_{i})_{i \geq 1}$ be a sequence in a field $\mathbb{F}$, and $f \colon \mathbb{F} \times \mathbb{F} \to \mathbb{F}$ be a function such that $f(a_{i},a_{i}) \neq 0$ for all $i \geq 1$. For any tournament $T$ over $[n]$,…

Let $M \in M_n (\mathbb Z)$ denote any matrix. Thinking of $M$ as a linear map $M:{\mathbb Z}^n \to {\mathbb Z}^n$, we denote by ${\Image}(M)$ the $\mathbb Z$-span of the column vectors of $M$. Let $e_1, ..., e_n,$ denote the standard basis…

We deduce a simple representation and the invariant factor decompositions of the subgroups of the group $\Bbb{Z}_m \times \Bbb{Z}_n$, where $m$ and $n$ are arbitrary positive integers. We obtain formulas for the total number of subgroups…

We study the limiting distribution of dense orbits of a lattice subgroup $\Gamma\le \text{SL}(m+1,\mathbb{R})$ acting on $H\backslash\text{SL}(m+1,\mathbb{R})$, with respect to a filtration of growing norm balls. The novelty of our work is…

We use methods from combinatorics and algebraic statistics to study analogues of birth-and-death processes that have as their state space a finite subset of the $m$-dimensional lattice and for which the $m$ matrices that record the…

Finite (upper) nearlattices are essentially the same mathematical entities as finite semilattices, finite commutative idempotent semigroups, finite join-enriched meet semilattices, and chopped lattices. We prove that if an $n$-element…