Related papers: Permuting 2-uniform tolerances on lattices
We classify all one-class genera of admissible lattice chains of length at least 2 in hermitian spaces over number fields.
In this work a lattice formulation of a supersymmetric theory is proposed and tested that preserves the complete supersymmetry on the lattice. The results of a one-dimensional nonperturbative simulation show the realization of the full…
A vertical 2-sum of a two-coatom lattice $L$ and a two-atom lattice $U$ is obtained by removing the top of $L$ and the bottom of $U$, and identifying the coatoms of $L$ with the atoms of $U$. This operation creates one or two nonisomorphic…
We revisit the results on admissible transformations between normal linear systems of second-order ordinary differential equations with an arbitrary number of dependent variables under several appropriate gauges of the arbitrary elements…
We consider uniform random permutations in proper substitution-closed classes and study their limiting behavior in the sense of permutons. The limit depends on the generating series of the simple permutations in the class. Under a mild…
For a partial lattice L the so-called two-point extension is defined in order to extend L to a lattice. We are motivated by the fact that the one-point extension broadly used for partial algebras does not work in this case, i.e. the…
We consider overdetermined systems of difference equations for a single function $u$ which are consistent, and propose a general framework for their analysis. The integrability of such systems is defined as the existence of higher order…
Super-stability and strong stability are properties of a matching in the stable matching problem with ties. In this paper, we introduce a common generalization of super-stability and strong stability, which we call non-uniform stability.…
Different symmetry formalisms for difference equations on lattices are reviewed and applied to perform symmetry reduction for both linear and nonlinear partial difference equations. Both Lie point symmetries and generalized symmetries are…
We prove that an infinite (bounded) involution lattice and even pseudo--Kleene algebra can have any number of congruences between $2$ and its number of elements or equalling its number of subsets, regardless of whether it has as many ideals…
We set up simple harmonic lattice models for elastic fluctuations in bcc and fcc lattices and the excitation of dislocations and disclinations. From these we derive, in a lowest approximation, universal formulas which predict melting…
Two polygons are amicable if the perimeter of one is equal to the area of the other and vice versa. A polygon is a lattice polygon if its vertices are on the integer lattice $\Z^2$. We show that there is one pair of amicable lattice…
We study Euclidean lattice formulations of non-gauge supersymmetric models with up to four supercharges in various dimensions. We formulate the conditions under which the interacting lattice theory can exactly preserve one or more nilpotent…
We propose a new formulation of lattice theory. It is given by a matrix form and suitable for satisfying Leibniz rule on lattice. The theory may be interpreted as a multi-flavor system. By realizing the difference operator as a commutator,…
We show that the transition laws for a 2-connection can be recovered by discretizing the base 2-space of a 2-bundle into an Euclidean hypercubic lattice. The aim of this work is to serve as an example of how important results in higher…
The universality of the continuum limit and the applicability of renormalized perturbation theory are tested in the SU(2) lattice gauge theory by computing two different non-perturbatively defined running couplings over a large range of…
We present data from the ALPHA Collaboration about lattice calculation of SU(2) pure--gauge running coupling constant, obtained with two different definitions of the coupling itself, which show universality of the continuum limit and…
An infinite permutation is a linear order on the set N. We study the properties of infinite permutations generated by fixed points of some uniform binary morphisms, and find the formula for their complexity.
We prove two results concerning an Ulam-type stability problem for homomorphisms between lattices. One of them involves estimates by quite general error functions; the other deals with approximate (join) homomorphisms in terms of certain…
In $\mathcal{N}=1$ superconformal theories in four dimensions the two-point function of superconformal multiplets is known up to an overall constant. A superconformal multiplet contains several conformal primary operators, whose two-point…