Related papers: Algorithmische Konstruktionen von Gittern
Firms earning prediction plays a vital role in investment decisions, dividends expectation, and share price. It often involves multiple tensor-compatible datasets with non-linear multi-way relationships, spatiotemporal structures, and…
The general solution of the two-dimensional integrable generalization of the f-Toda chain with fixed ends is explicitly presented in terms of matrix elements of various fundamental representations of the SL(n|n-1) supergroup. The dominant…
We provide an algorithm to compute generators of the orthogonal group of the discriminant group associated to an integral quadratic lattice over the integers. We give a closed formula for its order.
With the growing maturity of additive manufacturing, the fabrication of architected or lattice-based metamaterials has become a reality for industrial applications. These materials combine lightweight design with tailored mechanical…
We give an enumeration of all positive definite primitive Z-lattices in dimension >= 3 whose genus consists of a single isometry class. This is achieved by using bounds obtained from the Smith-Minkowski-Siegel mass formula to…
Euclidean lattices occupy a central position in number theory, the geometry of numbers, and modern cryptography. In the present article, the theory of Euclidean lattices is employed to investigate normed $\mathbb{Z}$-modules of finite rank.…
We investigate an integrable property and observables of 2 dimensional N=(4,4) topological field theory defined on a discrete lattice by using the "orbifolding" and "deconstruction" methods. We show that our lattice model possesses the…
We study the problem of determining the probability that m vectors selected uniformly at random from the intersection of the full-rank lattice L in R^n and the window [0,B)^n generate $\Lambda$ when B is chosen to be appropriately large.…
Clustering is a fundamental primitive in unsupervised learning which gives rise to a rich class of computationally-challenging inference tasks. In this work, we focus on the canonical task of clustering d-dimensional Gaussian mixtures with…
The Flatness theorem states that the maximum lattice width ${\rm Flt}(d)$ of a $d$-dimensional lattice-free convex set is finite. It is the key ingredient for Lenstra's algorithm for integer programming in fixed dimension, and much work has…
We construct several families of perfect sublattices with minimum $4$ of $\mathbb Z^d$. In particular, the number of $d-$dimensional perfect integral lattices with minimum $4$ grows faster than $d^k$ for every exponent $k$.
The optimal lattice quantizer is the lattice which minimizes the (dimensionless) second moment $G$. In dimensions $1$ to $8$, it has been proven that the optimal lattice quantizer is one of the classical lattices, or there is good evidence…
We consider a variation of Construction A of lattices from linear codes based on two classes of number fields, totally real and CM Galois number fields. We propose a generic construction with explicit generator and Gram matrices, then focus…
We consider the problem of fast zeta and M\"obius transforms in finite posets, particularly in lattices. It has previously been shown that for a certain family of lattices, zeta and M\"obius transforms can be computed in $O(e)$ elementary…
In [1], K\"otter and Kschischang presented a new model for error correcting codes in network coding. The alphabet in this model is the subspace lattice of a given vector space, a code is a subset of this lattice and the used metric on this…
Our aim is to find a complex continued fraction algorithm finding all the best Diophantine approximations to a complex number. Using the sequence of minimal vectors in a two dimensional lattice over Gaussian integers, we obtain an algorithm…
We consider the approximate recovery of multivariate periodic functions from a discrete set of function values taken on a rank-$s$ integration lattice. The main result is the fact that any (non-)linear reconstruction algorithm taking…
A lattice reduction is an algorithm that transforms the given basis of the lattice to another lattice basis such that problems like finding a shortest vector and closest vector become easier to solve. Some of the famous lattice reduction…
Our goal is to develop a more general scheme for constructing integrable lattice regularisations of integrable quantum field theories. Considering the affine Toda theories as examples, we show how to construct such lattice regularisations…
It is well known by analysts that a concept lattice has an exponential size in the data. Thus, as soon as he works with real data, the size of the concept lattice is a fundamental problem. In this chapter, we propose to investigate factor…