相关论文: Computing generating sets of lattice ideals
We present in this paper a routine which construct the ideal generated by a list of elements in a matrix Lie algebra at any particular characteristic. We have used this algorithm to analyze the problem of the simplicity of some Lie…
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.
We present an algorithm for generating all derivative superstructures--for arbitrary parent structures and for any number of atom types. This algorithm enumerates superlattices and atomic configurations in a geometry-independent way. The…
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…
This article builds on Thurston's height functions. His tiling algorithm is reinterpreted using lattice theory and then generalized in order to generate any tiling of a hole-free region. Combined with a natural encoding of tilings by words,…
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…
In this paper we develop a new technique to compute the Betti table of a monomial ideal. We present a prototype implementation of the resulting algorithm and we perform numerical experiments suggesting a very promising efficiency. On the…
We propose a method for crystal structure prediction based on a new structure generation algorithm and on-lattice machine learning interatomic potentials. Our algorithm generates the atomic configurations assigning atomic species to sites…
The Heatbath Algorithm is commonly used for sampling in local lattice field theories, but performing exact updates or sampling from the local density is challenging when dealing with continuous variables. Heatbath methods rely on…
We give the generating function for the index of integer lattice points, relative to a finite order ideal. The index is an important concept in the theory of border bases, an alternative to Gr\"obner bases. Equivalently, we explicitly solve…
Let $X_{P}$ be the projective toric surface associated to a lattice polytope $P$. If the number of lattice points lying on the boundary of $P$ is at least $4$, it is known that $X_{P}$ is embeddable into a suitable projective space as zero…
Conditional neural text generation models generate high-quality outputs, but often concentrate around a mode when what we really want is a diverse set of options. We present a search algorithm to construct lattices encoding a massive number…
Interpolation is a fundamental technique in scientific computing and is at the heart of many scientific visualization techniques. There is usually a trade-off between the approximation capabilities of an interpolation scheme and its…
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…
We describe a general algorithm for generating various families of ribbon tableaux and computing their spin polynomials. This algorithm is derived from a new matricial coding. An advantage of this new notation lies in the fact that it…
We produce a family of complexes called trimming complexes and explore applications. We study how trimming complexes can be used to deduce the Betti table for the minimal free resolution of the ideal generated by subsets of a generating set…
We present a new efficient algortithm for construction of linear latent structure (LLS) models. This algorithm reduces a problem of estimation of model parameters to a sequence of problems of linear algebra, which assures a low…
We propose a new iterative algorithm for generating a subset of eigenvalues and eigenvectors of large matrices which generalizes the method of optimal relaxations. We also give convergence criteria for the iterative process, investigate its…
Achieving the goals in the title (and others) relies on a cardinality-wise scanning of the ideals of the poset. Specifically, the relevant numbers attached to the k+1 element ideals are inferred from the corresponding numbers of the…
We show that the degree of a graded lattice ideal of dimension 1 is the order of the torsion subgroup of the quotient group of the lattice. This gives an efficient method to compute the degree of this type of lattice ideals.