Related papers: Two bijections on Tamari intervals
We have extended classical pattern avoidance to a new structure: multiple task-precedence posets whose Hasse diagrams have three levels, which we will call diamonds. The vertices of each diamond are assigned labels which are compatible with…
From Smyth's classification, modular compactifications of pointed smooth rational curves are indexed by combinatorial data, so-called extremal assignments. We explore their combinatorial structures and show that any extremal assignment is a…
We continue our earlier study of the phase structure of a SU(2) gauge theory whose action contains additional chirally invariant four fermion interactions. Our lattice theory uses a reduced staggered fermion formalism to generate two Dirac…
Relational lattice reduces the set of six classic relational algebra operators to two binary lattice operations: natural join and inner union. We give an introduction to this theory with emphasis on formal algebraic laws. New results…
We describe a special bijection between the indecomposable summands of two basic $\tau$-tilting modules.
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…
Rauzy-type dynamics are group actions on a collection of combinatorial objects. The first and best known example (the Rauzy dynamics) concerns an action on permutations, associated to interval exchange transformations (IET) for the…
The Jacobian group ${\rm Jac}(G)$ of a finite graph $G$ is a group whose cardinality is the number of spanning trees of $G$. $G$ also has a tropical Jacobian which has the structure of a real torus; using the notion of break divisors, An et…
We demonstrate that ultracold interacting bosonic atoms in an optical lattice show sub-Poissonian on-site and inter-site atom number fluctuations. The experimental observations agree with numerical predictions of the truncated Wigner…
Automatic presentations, also called FA-presentations, were introduced to extend finite model theory to infinite structures whilst retaining the solubility of fundamental decision problems. A particular focus of research has been the…
The two-dimensional d-p model (or extended Hubbard model) on a square lattice is investigated for fermion pairing by a slave boson method. The inter-site d-fermion interaction is introduced additionally. The momentum space counterpart of…
Tiered trees were introduced as a combinatorial object for counting absolutely indecomposable representation of certain quivers and torus orbit of certain homogeneous variety. In this paper, we define a bijection between the set of…
Extending the notion of geometric bijections for regular matroids, introduced by the first and third author with Matthew Baker, we describe a family of bijections between bases of an oriented matroid and special orientations. These…
A barcode is a finite multiset of intervals on the real line, $B = \{ (b_i, d_i)\}_{i=1}^n$. Barcodes are important objects in topological data analysis, where they serve as summaries of the persistent homology groups of a filtration. The…
The study of superconductivity with unconventional order is complicated in condensed matter systems by their extensive complexity. Optical lattices with their exceptional precision and control allow one to emulate superfluidity avoiding…
Following a remark of Lawvere, we explicitly exhibit a particularly elementary bijection between the set T of finite binary trees and the set T^7 of seven-tuples of such trees. "Particularly elementary" means that the application of the…
In this series of articles we study connections between combinatorics of multidimensional generalizations of Cauchy identity and continuous objects such as multidimensional Brownian motions and Brownian bridges. In Part I of the series we…
There are two bijections from unit interval orders on $n$ elements to Dyck paths from $(0,0)$ to $(n,n)$. One is to consider the pairs of incomparable elements, which form the set of boxes between some Dyck path and the diagonal. Another is…
The interval poset of a permutation catalogues the intervals that appear in its one-line notation, according to set inclusion. We study this poset, describing its structural, characterizing, and enumerative properties.
The rowmotion action on order ideals or on antichains of a finite partially ordered set has been studied (under a variety of names) by many authors. Depending on the poset, one finds unexpectedly interesting orbit structures, instances of…