相关论文: The Pop-Stack Operator on Ornamentation Lattices
As a classical object, the Tamari lattice has many generalizations, including $\nu$-Tamari lattices and parabolic Tamari lattices. In this article, we unify these generalizations in a bijective fashion. We first prove that parabolic Tamari…
We introduce new combinatorial objects, the interval- posets, that encode intervals of the Tamari lattice. We then find a combinatorial interpretation of the bilinear operator that appears in the functional equation of Tamari intervals…
In this work, we study the composition operators on the little Lipschitz space ${\mathcal L}_0$ of a rooted tree $T$, defined as the subspace of the Lipschitz space ${\mathcal L}$ consisting of the complex-valued functions $f$ on $T$ such…
The poset of maximal tubings of a graph generalizes several well-known and remarkable partial orders. Notable examples include the weak Bruhat order and the Tamari lattice, posets of maximal tubings for the complete graph and the path…
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 Tamari lattice, defined on Catalan objects such as binary trees and Dyck paths, is a well-studied poset in combinatorics. It is thus natural to try to extend it to other families of lattice paths. In this article, we fathom such a…
Given any finite subset $A$ of order $n$ of a distributive lattice and $k\in\{1,...,n\}$, there is a natural extension of the median operation to $n$ variables which generalizes the notion of the $k$th smallest element of $A$. By applying…
Via mechanisms not accessible at equilibrium, self-propelled particles can form phases with positional order, such as crystals, and with orientational order, such as polar flocks. However, the interplay between these two types of order…
We analyze the properties of a class of improved lattice topological charge density operators, constructed by a smearing-like procedure. By optimizing the choice of the parameters introduced in their definition, we find operators having (i)…
An extension of the Tamari lattice to the multiplihedra is discussed, along with projections to the composihedra and the Boolean lattice. The multiplihedra and composihedra are sequences of polytopes that arose in algebraic topology and…
Given a complete modular meet-continuous lattice $A$, an inflator on $A$ is a monotone function $d\colon A\rightarrow A$such that $a\leq d(a)$ for all $a\in A$. If $I(A)$ is the set of all inflators on $A$, then $I(A)$ is a complete…
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…
We analyze the properties of a class of improved lattice topological charge density operators, constructed by a smearing-like procedure. By optimizing the choice of the parameters introduced in their definition, we find operators having (i)…
We elaborate on the notion of a filtration of an operad defined in terms of a lattice-valued operad serving as an indexing object. That covers ordinary integer-indexed filtrations of associative algebras and operads as a special case, yet…
Let $d\geq2$ be an integer. The set $\mathbf{F}(d)$ of foliations of degree $d$ on the complex projective plane can be identified with a Zariski's open set of a projective space of dimension $d^2+4d+2$ on which $\mathrm{Aut}(\mathbb…
For a presentation $\mathcal{A}$ of a transversal matroid $M$, we study the set $T_{\mathcal{A}}$ of single-element transversal extensions of $M$ that have presentations that extend $\mathcal{A}$; we order these extensions by the weak…
We introduce the concept of a bounded below set in a lattice. This can be used to give a generalization of Rota's broken circuit theorem to any finite lattice. We then show how this result can be used to compute and combinatorially explain…
Time series are ubiquitous in domains ranging from medicine to marketing and finance. Frequent Pattern Mining (FPM) from a time series has thus received much attention. Recently, it has been studied under the order-preserving (OP) matching…
The top-k operation, i.e., finding the k largest or smallest elements from a collection of scores, is an important model component, which is widely used in information retrieval, machine learning, and data mining. However, if the top-k…
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…