Related papers: The Affine Tamari Lattice
The lattice of noncrossing partitions is well-known for its wide variety of combinatorial appearances and properties. For example, the lattice is rank-symmetric and enumerated by the Catalan numbers. In this article, we introduce a large…
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…
A unified classification and analysis is presented of two dimensional Dirac operators of QCD-like theories in the continuum as well as in a naive lattice discretization. Thereby we consider the quenched theory in the strong coupling limit.…
In this article, we prove that finite semidistributive lattices are dismantlable if and only if they are planar. This extends a well-known result by Kelly and Rival that states the same property for finite distributive lattices. Moreover,…
We initiate the combinatorial study of factorization systems on finite lattices, paying special attention to the role that reflective and coreflective factorization systems play in partitioning the poset of factorization systems on a fixed…
We explore some of the properties of a subposet of the Tamari lattice introduced by Pallo, which we call the comb poset. We show that three binary functions that are not well-behaved in the Tamari lattice are remarkably well-behaved within…
We study tori which are cyclic covers of the standard torus, that is, the deck transformation group of the covering map is cyclic. These covering tori can be parametrized in a natural way and we show that being cyclic is equivalent to…
A consistent formulation of a fully supersymmetric theory on the lattice has been a long standing challenge. In recent years there has been a renewed interest on this problem with different approaches. At the basis of the formulation we…
We show how to construct semi-invariants and integrals of the full symmetric sl(n) Toda lattice for all n. Using the Toda equations for the Lax eigenvector matrix we prove the existence of semi-invariants which are homogeneous coordinates…
We investigate the lattice of machine invariant classes. This is an infinite completely distributive lattice but it is not a Boolean lattice. We show the subword complexity and the growth function create machine invariant classes. So the…
We show there is an uncountable number of parallel total perfect codes in the integer lattice graph ${\Lambda}$ of $\R^2$. In contrast, there is just one 1-perfect code in ${\Lambda}$ and one total perfect code in ${\Lambda}$ restricting to…
We prove that every distributive algebraic lattice with at most $\aleph\_1$ compact elements is isomorphic to the normal subgroup lattice of some group and to the submodule lattice of some right module. The $\aleph\_1$ bound is optimal, as…
To every partial order P, one associates a polynomial $\mathbb{D}_P$ in 4 variables that enumerates the intervals of P according to 4 parameters. Some symmetry properties of this polynomial are obtained for a specific family of posets, the…
We continue our reformulation of free dendriform algebras, dealing this time with the free dendriform trialgebra generated be Y over planar rooted trees. We propose a 'deformation' of a vectorial coding used in Part I, giving a LL-lattice…
Finite (upper) nearlattices are essentially the same mathematical entities as finite semilattices, finite commutative idempotent semigroups, finite join-enriched meet semilattices, and chopped lattices. We prove that if an $n$-element…
A lattice model of critical dense polymers is solved exactly for arbitrary system size on the torus. More generally, an infinite family of lattice loop models is studied on the torus and related to the corresponding Fortuin-Kasteleyn random…
We consider module categories of path algebras of connected acyclic quivers. It is shown in this paper that the set of functorially finite torsion classes form a lattice if and only if the quiver is either Dynkin quiver of type A, D, E, or…
In continuous first-order logic, the union of definable sets is definable but generally the intersection is not. This means that in any continuous theory, the collection of $\varnothing$-definable sets in one variable forms a…
A manifestly supersymmetric nonperturbative matrix regularization for a twisted version of N=(8,8) theory on a curved background (a two-sphere) is constructed. Both continuum and the matrix regularization respect four exact scalar…
We first review some invariant theoretic results about the finite subgroups of SU(2) in a quick algebraic way by using the McKay correspondence and quantum affine Cartan matrices. By the way it turns out that some parameters (a,b,h;p,q,r)…