Related papers: Chain lengths in the type $B$ Tamari lattice
We study the multiplicative lattices L which satisfy the condition a = (a : (a : b))(a : b) for all a,b in L.
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…
After mentioning some of the difficulties arising in lattice gauge theory from chiral symmetry, I discuss one of the recent attempts to resolve these issues using fermionic surface states in an extra space-time dimension. This picture can…
The sets of the integrable lattice equations, which generalize the Toda lattice, are considered. The hierarchies of the first integrals and infinitesimal symmetries are found. The properties of the multi-soliton solutions are discussed.
There exist as many index-$k$ sublattices of the hexagonal lattice up to isometry as there exist lattice triangles with normalized volume $k$ up to unimodular equivalence, which can be explained using orbifolds. In dimension 3, it was noted…
We generalize Toda--like integrable lattice systems to non--symmetric case. We show that they possess the bi--Hamiltonian structure.
We present a short proof of the Jordan-H\"older theorem with uniqueness for semimodular semilattice: Given two maximal chains in a semimodular semilattice of finite height, they both have the same length. Moreover there is a unique…
The possibility of creating different geometries with the help of an extra synthetic dimension in optical lattices is studied. Additional linear potential and Raman assisted tunnelings are used to engineer well controlled tunnelings between…
Labyrinth fractals are self-similar dendrites in the unit square that are defined with the help of a labyrinth set or a labyrinth pattern. In the case when the fractal is generated by a horizontally and vertically blocked pattern, the arc…
We consider the problem of determining whether the union of two infinite matroids is a matroid. We introduce a superclass of the finitary matroids, the nearly finitary matroids, and prove that the union of two nearly finitary matroids is a…
We introduce the Ungarian Markov chain ${\bf U}_L$ associated to a finite lattice $L$. The states of this Markov chain are the elements of $L$. When the chain is in a state $x\in L$, it transitions to the meet of $\{x\}\cup T$, where $T$ is…
Using a new technique, we prove a rich family of special cases of the matroid intersection conjecture. Roughly, we prove the conjecture for pairs of tame matroids which have a common decomposition by 2-separations into finite parts.
In this paper we give the generalization of lifted codes over any finite chain ring. This has been done by using the construction of finite chain rings from $p$-adic fields. Further we propose a lattice construction from linear codes over…
We examine the relation between supersymmetric lattice gauge theories constructed by the link approach and by orbifolding and show that they are equivalent. We discuss the number of preserved supersymmetries.
The paper shows that there is a deep structure on certain sets of bisimilar Probabilistic Automata (PA). The key prerequisite for these structures is a notion of compactness of PA. It is shown that compact bisimilar PA form lattices. These…
We present refined enumeration formulas for lattice paths in $\mathbb{Z}^2$ with two kinds of steps, by keeping track of the number of descents (i.e., turns in a given direction), the major index (i.e., the sum of the positions of the…
The lattice size of a lattice polytope is a geometric invariant which was formally introduced in the context of simplification of the defining equation of an algebraic curve, but appeared implicitly earlier in geometric combinatorics.…
There are $k$ kinds of length $k$ hooks with different arm length. Actually, this $k$ kinds appear uniformly in Young diagrams of size $n$. The property ``appear uniformly'' is called super symmetric. We give a combinatorial proof of the…
We characterize all residuated lattices that have height equal to $3$ and show that the variety they generate has continuum-many subvarieties. More generally, we study unilinear residuated lattices: their lattice is a union of disjoint…
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…