Related papers: The Systematic Normal Form of Lattices
A lattice of integers is the collection of all linear combinations of a set of vectors for which all entries of the vectors are integers and all coefficients in the linear combinations are also integers. Lattice reduction refers to the…
In this article, we focus on extending the notion of lattice linearity to self-stabilizing programs. Lattice linearity allows a node to execute its actions with old information about the state of other nodes and still preserve correctness.…
Lattices with minimal normalized second moments are designed using a new numerical optimization algorithm. Starting from a random lower-triangular generator matrix and applying stochastic gradient descent, all elements are updated towards…
As software systems become more complex, there is an increasing need for new static analyses. Thanks to the declarative style, logic programming is an attractive formalism for specifying them. However, prior work on using logic programming…
The sampling of probability distributions specified up to a normalization constant is an important problem in both machine learning and statistical mechanics. While classical stochastic sampling methods such as Markov Chain Monte Carlo…
Separable nonlinear least squares (SNLS)problem is a special class of nonlinear least squares (NLS)problems, whose objective function is a mixture of linear and nonlinear functions. It has many applications in many different areas,…
Lattices are a commonly used structure for the representation and analysis of relational and ontological knowledge. In particular, the analysis of these requires a decomposition of a large and high-dimensional lattice into a set of…
We introduce a novel stochastic regularization technique for deep neural networks, which decomposes a layer into multiple branches with different parameters and merges stochastically sampled combinations of the outputs from the branches…
We introduce a new class of "random" subsets of natural numbers, WM sets. This class contains normal sets (sets whose characteristic function is a normal binary sequence). We establish necessary and sufficient conditions for solvability of…
A notion of {\em normal submonoid} of a monoid $M$ is introduced that generalizes the normal subgroups of a group. When ordered by inclusion, the set $\mathsf{NorSub}(M)$ of normal submonoids of $M$ is a complete lattice. Joins are…
The main objective of this thesis is a classification project for integral lattices. Using Kneser's neighbour method we have developed the computer program tn to classify complete genera of integral lattices. Main results are detailed…
We begin with a short exposition of the theory of lattice varieties. This includes a description of their orbit structure and smooth locus. We construct a flat cover of the lattice variety and show that it is a complete intersection. We…
The pseudo likelihood method of Besag(1974), has remained a popular method for estimating Markov random field on a very large lattice, despite various documented deficiencies. This is partly because it remains the only computationally…
Potts models, which can be used to analyze dependent observations on a lattice, have seen widespread application in a variety of areas, including statistical mechanics, neuroscience, and quantum computing. To address the intractability of…
We develop a new method called affine facial reduction (FR) for recovering Slater's condition for semidefinite programming (SDP) relaxations of combinatorial optimization (CO) problems. Affine FR is a user-friendly method, as it is fully…
In this note, we will present a specially designed deep neural network (DNN), which will target components of the solution of different time rate individually through perspective of the Laplace s-transform of the solution. Each segment of…
A new renormalization group approach that maps lattice problems to tensor networks may hold the key to solving seemingly intractable models of strongly correlated systems in any dimension. A Physics Viewpoint on arXiv:0903.1069
The finite Pfaff lattice is given by commuting Lax pairs involving a finite matrix L (zero above the first subdiagonal) and a projection onto Sp(N). The lattice admits solutions such that the entries of the matrix L are rational in the time…
Given a full column rank matrix $A \in \mathbb{R}^{m\times n}$ ($m\geq n$), we consider a special class of linear systems of the form $A^\top Ax=A^\top b+c$ with $x, c \in \mathbb{R}^{n}$ and $b \in \mathbb{R}^{m}$. The occurrence of $c$ in…
The scalar difference equation $x_{n+1}=f_{n}(x_{n},x_{n-1},...,x_{n-k})$ may exhibit symmetries in its form that allow for reduction of order through substitution or a change of variables. Such form symmetries can be defined generally…