相关论文: Algorithmische Konstruktionen von Gittern
Many challenging Graver bases computations, like for multi-way tables in statistics, have a highly symmetric problem structure that is not exploited so far computationally. In this paper we present a Graver basis algorithm for sublattices…
In this paper we give a complete classification of totally-reflective, primitive genera in dimension 3 and 4. Our method breaks up into two parts. The first part consists of classifying the square free, totally-reflective, primitive genera…
We propose two new techniques for training Generative Adversarial Networks (GANs). Our objectives are to alleviate mode collapse in GAN and improve the quality of the generated samples. First, we propose neighbor embedding, a manifold…
We discuss an algorithm for the approximate solution of Schrodinger's equation for lattice gauge theory, using lattice SU(3) as an example. A basis is generated by repeatedly applying an effective Hamiltonian to a ``starting state.'' The…
We develop cluster algorithms for a broad class of loop models on two-dimensional lattices, including several standard O(n) loop models at n \ge 1. We show that our algorithm has little or no critical slowing-down when 1 \le n \le 2. We use…
We use Kneser's neighbor method and isometry testing for lattices due to Plesken and Souveigner to compute systems of Hecke eigenvalues associated to definite forms of classical reductive algebraic groups.
We investigate the lattice of machine invariant classes. This is an infinite completely distributive lattice but it is not a Boolean lattice. We show the subword complexity and the growth function create machine invariant classes. So the…
This work presents an extension of the Construction $\pi_A$ lattices proposed in \cite{huang2017construction}, to Hurwitz quaternion integers. This construction is provided by using an isomorphism from a version of the Chinese remainder…
We develop a strategy for tensor network algorithms that allows to deal very efficiently with lattices of high connectivity. The basic idea is to fine-grain the physical degrees of freedom, i.e., decompose them into more fundamental units…
We study the algebras of modular forms on type IV symmetric domains for simple lattices; that is, lattices for which every Heegner divisor occurs as the divisor of a Borcherds product. For every simple lattice $L$ of signature $(n,2)$ with…
This paper investigates the construction of space-filling designs for computer experiments. The space-filling property is characterized by the covering and separation radii of a design, which are integrated through the unified criterion of…
Motivated by the structural analogies between point lattices and linear error-correcting codes, and by the mature theory on locally testable codes, we initiate a systematic study of local testing for membership in lattices. Testing…
The purpose of this paper is twofold. Firstly, to emphasise that the class of Lie algebras with chain lattices of ideals are elementary blocks in the embedding or decomposition of Lie algebras with finite lattice of ideals. Secondly, to…
We give a novel algorithm for enumerating lattice points in any convex body, and give applications to several classic lattice problems, including the Shortest and Closest Vector Problems (SVP and CVP, respectively) and Integer Programming…
We consider the set of all linear combinations with integer coefficients of the vectors of a unit tight equiangular $(k,n)$ frame and are interested in the question whether this set is a lattice, that is, a discrete additive subgroup of the…
We prove upper bounds on the order of convergence of lattice based algorithms for numerical integration in function spaces of dominating mixed smoothness on the unit cube with homogeneous boundary condition. More precisely, we study…
Quadratic form reduction and lattice reduction are fundamental tools in computational number theory and in computer science, especially in cryptography. The celebrated Lenstra-Lenstra-Lov\'asz reduction algorithm (so-called LLL) has been…
We introduce a class of ${\mathbb{Z}}_N$ graded discrete Lax pairs, with $N\times N$ matrices, linear in the spectral parameter. We give a classification scheme for such Lax pairs and the associated discrete integrable systems. We present…
This paper treats certain integral lattices with respect to ternary quadratic forms, which are obtained from the data of a non-zero element and a maximal lattice in a quaternary quadratic space. Such a lattice can be described by means of…
This work concerns representations of a finite flat group scheme $G$, defined over a noetherian commutative ring $R$. The focus is on lattices, namely, finitely generated $G$-modules that are projective as $R$-modules, and on the full…