Related papers: Notes on the description of join-distributive latt…
We propose a lattice action for two dimensional super Yang-Mills theory with a twisted N=2 supersymmetry. The extended supersymmetry is fully and exactly realized on the lattice. The method employed is quite general and its extension to the…
We introduce the dimension monoid of a lattice L, denoted by Dim L. The monoid Dim L is commutative and conical, the latter meaning that the sum of any two nonzero elements is nonzero. Furthermore, Dim L is given along with the dimension…
We prove an identity for five arguments, valid in the lattice of natural numbers with gcd and lcm as lattice operations. More generally, this identity characterizes arbitrary distributive lattices. Fixing three of the five arguments, we…
Tolerance relations were investigated by several authors in various algebraic structures, see e.g. the monograph by I. Chajda. Recently G. Cz\'edli studied so-called 2-uniform tolerances on lattices, i.e. tolerances that are compatible with…
We devise exact conditions under which a join semilattice with a weak contact relation can be semilattice embedded into a Boolean algebra with an overlap contact relation, equivalently, into a distributive lattice with additive contact…
This paper investigates the theory of lattices, focusing on extending lattices relative to abstract classes, modular lattices, and torsion lattices. Definitions of type-1 and type-2 extending lattices are provided, along with their weakly…
We propose several constructions of commutative or cocommutative Hopf algebras based on various combinatorial structures, and investigate the relations between them. A commutative Hopf algebra of permutations is obtained by a general…
We introduce a Hamiltonian lattice model for the $(1+1)$-dimensional $\text{SU}(N_c)$ gauge theory coupled to one adjoint Majorana fermion of mass $m$. The discretization of the continuum theory uses staggered Majorana fermions. We analyze…
We answer some questions related to multiplicity formulas by Rosenthal and Zelevinsky and by Lakshmibai and Weyman for points on Schubert varieties in Grassmannians. In particular, we give combinatorial interpretations in terms of…
Following the recent proposal made by Bouttier et al [Phys. Rev. E 76, 041140 (2007)], we study analytically the mobility properties of a single vacancy in the close-packed dimer model on the square lattice. Using the spanning web…
We generalize the shuffle theorem and its $(km,kn)$ version, as conjectured by Haglund et al. and Bergeron et al., and proven by Carlsson and Mellit, and Mellit, respectively. In our version the $(km,kn)$ Dyck paths on the combinatorial…
Defant, Engen, and Miller defined a permutation to be uniquely sorted if it has exactly one preimage under West's stack-sorting map. We enumerate classes of uniquely sorted permutations that avoid a pattern of length three and a pattern of…
Birkhoff's representation theorem (Birkhoff, 1937) defines a bijection between elements of a distributive lattice and the family of upper sets of an associated poset. Although not used explicitly, this result is at the backbone of the…
The concept of permutograph is introduced and properties of integral functions on permutographs are established. The central result characterizes the class of integral functions that are representable as lattice polynomials. This result is…
In this paper, we explore some interesting applications of the matrix tree theorem. In particular, we present a combinatorial interpretation of a distribution of $(n-1)^{n-1}$, in the context of uprooted spanning trees of the complete graph…
A permutation is called layered if it consists of the disjoint union of substrings (layers) so that the entries decrease within each layer, and increase between the layers. We find the generating function for the number of permutations on…
In 2003, Deutsch and Elizalde defined a family of bijective maps between the set of Dyck paths to itself which is induced by some particular permutations. In this paper, we extend the construction of the maps by allowing the permutation to…
In 1876 H. J. S. Smith defined an LCM matrix as follows: let S = {x_1, x_2, ..., x_n} be a set of positive integers. The LCM matrix [S] is the n $\times$ n matrix with lcm(x_i , x_j) as its ij entry. During the last 30 years singularity of…
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 two lattice growth models: aggregation of $l$-dimensional boxes and aggregation of partitions with $l$ parts. We describe properties of the models: the parameter set of aggregations, the moments of the random variable of the…