相关论文: A note on construction of the Leech lattice
In this article, we present two methods to construct 2-uninorms on bounded lattices by using additive generators, which are further used for inducing uninorms, nullnorms, uni-nullnorms and null-uninorms, respectively. We also provide some…
Lattice models are popular methods for simulating deformation of solids by discretizing continuum structures into spring networks. Despite the simplicity and efficiency, most lattice models only rigorously converge to continuum models for…
We generalize Conway-Sloane's constructions of the Leech lattice from Niemeier lattices using Lorentzian lattice to holomorphic vertex operator algebras (VOA) of central charge 24. It provides a tool for analyzing the structures and…
We introduce an algorithm for computing closure systems derived from a family of implications on a set. Semilattices presentations are explored and used in conjunction with the algorithm to compute various types of lattices freely generated…
In this paper, we present a fast algorithm for constructing a concept (Galois) lattice of a binary relation, including computing all concepts and their lattice order. We also present two efficient variants of the algorithm, one for…
The simplest way to generate a lattice of convex sets is to consider an initial set of points and draw segments, triangles, and any convex hull from it, then intersect them to obtain new points, and so forth. The result is an infinite…
A new method is proposed to generate nonlinear integrable systems by starting with existing Lax pair and a new form of Kr\"onecker product. It is observed that such equation can be generated with the help of a Hamiltonian structure.…
This is a survey of results in the enumeration of lattice paths.
We extend two of the methods previously introduced to find discrete symmetries of differential equations to the case of difference and differential-difference equations. As an example of the application of the methods, we construct the…
Complemented lattices and uniquely complemented lattices are very important, not only in mathematics, but also in physics, biology, and even in social sciences. They have been investigated for a long time, especially by Huntington,…
We construct a Lax pair for the $E^{(1)}_6 $ $q$-Painlev\'e system from first principles by employing the general theory of semi-classical orthogonal polynomial systems characterised by divided-difference operators on discrete, quadratic…
After an introduction in which we review the fundamental difficulty in constructing lattice chiral gauge theories, we summarize the analytic and numerical evidence that abelian lattice chiral gauge theories can be nonperturbatively…
New perspective form of equations for geodesic lines in Riemann Geometry was found. This method is based on the use of differential forms in differential equations as arguments of differentiation. At that, these forms do not have a…
In general it is a difficult problem to construct the lattice of submodules $L(M)$ of a given module $M$. In \cite{St} R. P. Stanley outlined a method for constucting a distributive lattice from a knowledge of its join irreducibles. However…
This paper studies the structure of Lax pairs associated with integrable lattice systems (where space is a one-dimensional lattice, and time is continuous). It describes a procedure for generating examples of such systems, and emphasizes…
The standard method for constructing generating vectors for good lattice point sets is the component-by-component construction. Numerical experiments have shown that the generating vectors found by these constructions sometimes tend to have…
After an introduction in which we review the fundamental difficulty in constructing lattice chiral gauge theories, we discuss the analytic and numerical evidence that abelian lattice chiral gauge theories can be non-perturbatively…
In this talk we highlight recent lattice calculations of the nucleon form factors and structure functions.
Alternative approaches to Lebesgue integration are considered.
In this paper we propose a general ternary construction of lattices from three rows and ternary codes. Most laminated lattices and Kappa lattices in ${\bf R}^n$, $n\leq 24$ can be recovered from our tenary construction naturally. This…