Related papers: The Lattice Problem for Models of $\mathsf{PA}$
We first briefly review the role of lattice paths in the derivation of fermionic expressions for the M(p,p') minimal model characters of the Virasoro Lie algebra. We then focus on the recently introduced half-lattice paths for the…
In this paper we study the representation theory for certain ``half lattice vertex algebras.'' In particular we construct a large class of irreducible modules for these vertex algebras. We also discuss how the representation theory of these…
Lattice theoretical generalizations of some classical linear algebra results are formulated. A vector space is replaced by its subspace lattice and a linear map is replaced by the induced lattice map. This map is a complete join…
An \emph{antilattice} is an algebraic structure based on the same set of axioms as a lattice except that the two commutativity axioms for $\land$ and $\lor$ are replaced by anticommutative counterparts. In this paper we study certain…
A lattice is a set of all the integer linear combinations of certain linearly independent vectors. One of the most important concepts on lattice is the successive minima which is of vital importance from both theoretical and practical…
Lattice discretization of the supersymmetric Yang-Mills quantum mechanics is dis cussed. First results of the quenched Monte Carlo simulations, for D=4 and with higher g auge groups (3 <= N <= 8), are presented. We confirm an earlier (N=2)…
We discuss initial value problems for time evolution equations in one dimensional space which are expressed by the lattice operators and propose some new equations to which complexity of solutions is of polynomial class. Novel type of…
In this paper, we use a simple discrete dynamical model to study integer partitions and their lattice. The set of reachable configurations of the model, with the order induced by the transition rule defined on it, is the lattice of all…
We introduce a solvable lattice model for supersymmetric LLT polynomials, also known as super LLT polynomials, based upon particle interactions in super n-ribbon tableaux. Using operators on a Fock space, we prove a Cauchy identity for…
In the standard approach to lattice proteins the models based on nearest neighbor interaction are used. In this kind of models it is difficult to explain the existence of secondary structures --- special preferred conformations of protein…
We study a model of machine teaching where the teacher mapping is constructed from a size function on both concepts and examples. The main question in machine teaching is the minimum number of examples needed for any concept, the so-called…
In this paper we show that subsumption problems in lightweight description logics (such as $\mathcal{EL}$ and $\mathcal{EL}^+$) can be expressed as uniform word problems in classes of semilattices with monotone operators. We use…
When $\mathbb{Z}^d$ is represented as a finite disjoint union of translated integer sublattices, the translated sublattices must possess some special properties. Such a representation is called a \emph{lattice tiling}. We develop a…
Bayesian inference provides a rigorous framework to encapsulate our knowledge and uncertainty regarding various physical quantities in a well-defined and self-contained manner. Utilising modern tools, such Bayesian models can be constructed…
I discuss some of the difficulties with formulating chiral symmetry on the lattice and review a recently proposed scheme for a fully finite and exactly gauge invariant lattice regularization of the standard model.
This paper studies the combinatorics of lattice congruences of the weak order on a finite Weyl group $W$, using representation theory of the corresponding preprojective algebra $\Pi$. Natural bijections are constructed between important…
We study a hermitian $(n+1)$-matrix model with plaquette interaction, $\sum_{i=1}^n MA_iMA_i$. By means of a conformal transformation we rewrite the model as an $O(n)$ model on a random lattice with a non polynomial potential. This allows…
In a capacitated directed graph, it is known that the set of all min-cuts forms a distributive lattice [1], [2]. Here, we describe this lattice as a regular predicate whose forbidden elements can be advanced in constant parallel time after…
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…
The states in the irreducible modules of the minimal models can be represented by infinite lattice paths arising from consideration of the corresponding RSOS statistical models. For the M(p,2p+1) models, a completely different path…