Related papers: Lattice exit models
We discuss the possibility of the existence of finite algorithms that may give distinct knot classes. In particular we present two attempts for such algorithms which seem promising, one based on knot projections on a plane, the other on…
A general class of loop quantizations for anisotropic models is introduced and discussed, which enhances loop quantum cosmology by relevant features seen in inhomogeneous situations. The main new effect is an underlying lattice which is…
Given a positive definite even lattice and a commutative ring, there is a standard construction of a lattice vertex algebra over the commutative ring, and it admits a natural grading by non-negative integers. We describe the groups of…
We study the complexity of locally checkable labeling (LCL) problems on $\mathbb{Z}^n$ from the point of view of descriptive set theory, computability theory, and factors of i.i.d. Our results separate various complexity classes that were…
From the matrix point of view, we use the recursion to discuss four combinatorial numbers in terms of the integer lattice paths, this is different from Andr\'a's method (Andra). We give four tables and matrices, and their relations, and…
In this paper, we introduce the super telescoping formula, a natural generalization of well-known telescoping formula. We explore various aspects of the formula including its origin and the telescoping cancellations emerging from symmetric…
We investigate the definability (reducts) lattice of the order of integers and describe a sublattice generated by relations 'between', 'cycle', 'separation', 'neighbor', '1-codirection', 'order' and equality'. Some open questions are…
In this work, two algorithms are developed related to lattice codes. In the first one, an extended complete Gr\"obner basis is computed for the label code of a lattice. This basis supports all term orderings associated with a total degree…
Technicolor theories provide an elegant mechanism for dynamical electroweak symmetry breaking. We will discuss the use of lattice simulations to study the strongly-interacting dynamics of some of the candidate theories, with matter fields…
Lattice-linearity was introduced as a way to model problems using predicates that induce a lattice among the global states (Garg, SPAA 2020). A key property of \textit{the predicate} representing such problems is that it induces…
We study a new class of matrix models, formulated on a lattice. On each site are $N$ states with random energies governed by a Gaussian random matrix Hamiltonian. The states on different sites are coupled randomly. We calculate the density…
We develope a difference calculus analogous to the differential geometry by translating the forms and exterior derivatives to similar expressions with difference operators, and apply the results to fields theory on the lattice [Ref. 1]. Our…
We enumerate the number of monotonic lattice paths starting at $(0,0)$ and terminating at $(m,n)$ in which $l$ of the first $k$ steps lie below the line $y=x\ (0\leq k\leq m\leq n)$. These closed formulas consist of terms which are a…
We analyse supersymmetric models that show supersymmetry breaking in one and two dimensions using lattice methods. Starting from supersymmetric quantum mechanics we explain the fundamental principles and problems that arise in putting…
We analyze multivariate ordered discrete response models with a lattice structure, modeling decision makers who narrowly bracket choices across multiple dimensions. These models map latent continuous processes into discrete responses using…
The intrinsic connection between lattice theory and topology is fairly well established, For instance, the collection of open subsets of a topological subspace always forms a distributive lattice. Persistent homology has been one of the…
We present and study lattice and off-lattice microscopic models in which particles interact via a local anisotropic rule. The rule induces preferential hopping along one direction, so that a net current sets in if allowed by boundary…
Given a model of a system and an objective, the model-checking question asks whether the model satisfies the objective. We study polynomial-time problems in two classical models, graphs and Markov Decision Processes (MDPs), with respect to…
n this paper I discuss what we can learn about quarkonium dissociation from lattice-potential based models. Special emphasis is given to results obtained in agreement by different models, and to the relevance of lattice QCD for potential…
The scalar and vector Laplacians are basic operators in physics and engineering. In applications, they show up frequently perturbed by lower-order terms. The effect of such perturbations on mixed finite element methods in the scalar case is…