相关论文: Noncrossing partitions in surprising locations
We construct a set of noncommuting translation operators in two and high-dimensional lattices. The algebras they close are $w_{\infty}$-algebras. The construction is based on the introduction of noncommmuting elementary link operators which…
We introduce a new type of partitions that consists of partitions whose different parts alternate in parity (e.g., $3+2+2+1+1$). Various properties of this partition function are studied. In particular, we obtain its asymptotic behavior by…
For coprime positive integers $a<b$, Armstrong, Rhoades, and Williams (2013) defined a set $NC(a,b)$ of rational noncrossing partitions, a subset of the ordinary noncrossing partitions of $\{1, \ldots, b-1\}$. Bodnar and Rhoades (2015)…
We discuss how lattice calculations can be a useful tool for the study of structure functions. Particular emphasis is given to the perturbative renormalization of the operators.
Recently, it was realized that anomalies can be completely classified by topological orders, symmetry protected topological (SPT) orders, and symmetry enriched topological orders in one higher dimension. The anomalies that people used to…
A mixed lattice is a lattice-type structure consisting of a set with two partial orderings, and generalizing the notion of a lattice. Mixed lattice theory has previously been studied in various algebraic structures, such as groups and…
We prove new bijections between different variants of Dyck paths and integer compositions, which give combinatorial explanations of their simple counting formula $4^{n-1}$. These give relations between different statistics, such as the…
We introduce a new pair of mutually dual bases of noncommutative symmetric functions and quasi-symmetric functions, and use it to derive generalizations of several results on the reduced incidence algebra of the lattice of noncrossing…
Most comparisons of preferences are instances of single-crossing dominance. We examine the lattice structure of single-crossing dominance, proving characterisation, existence and uniqueness results for minimum upper bounds of arbitrary sets…
Patience Sorting is a combinatorial algorithm that can be viewed as an iterated, non-recursive form of the Schensted Insertion Algorithm. In recent work the authors have shown that Patience Sorting provides an algorithmic description for…
In this paper we consider a model of particles jumping on a row of cells, called in physics the one dimensional totally asymmetric exclusion process (TASEP). More precisely we deal with the TASEP with open or periodic boundary conditions…
The collection of reflecting hyperplanes of a finite Coxeter group is called a reflection arrangement and it appears in many subareas of combinatorics and representation theory. We focus on the problem of counting regions of reflection…
Several articles deal with tilings with various shapes, and also a very frequent type of combinatorics is to examine the walks on graphs or on grids. We combine these two things and give the numbers of the shortest walks crossing the tiled…
The structure of the coincidence symmetry group of an arbitrary $n$-dimensional lattice in the $n$-dimensional Euclidean space is considered by describing a set of generators. Particular attention is given to the coincidence isometry…
This work proposes an alternative approach to the so-called lattice of embedded subsets, which is included in the product of the subset and partition lattices of a finite set, and whose elements are pairs consisting of a subset and a…
Over the past twenty years, lecture hall partitions have emerged as fundamental combinatorial structures, leading to new generalizations and interpretations of classical theorems and new results. In recent years, geometric approaches to…
We show the existence of regular combinatorial objects which previously were not known to exist. Specifically, for a wide range of the underlying parameters, we show the existence of non-trivial orthogonal arrays, t-designs, and t-wise…
We provide a naturally isomorphic description of the persistence map from merge trees to barcodes in terms of a monotone map from the partition lattice to the subset lattice. Our description is local, which offers the potential to speed up…
For a Catalan state $C$ of a lattice crossing $L\left( m,n\right) $ with no returns on one side, we find its coefficient $C\left( A\right) $ in the Relative Kauffman Bracket Skein Module expansion of $L\left( m,n\right) $. We show, in…
We investigate certain nonassociative binary operations that satisfy a four-parameter generalization of the associative law. From this we obtain variations of the ubiquitous Catalan numbers and connections to many interesting combinatorial…