相关论文: Computing generating sets of lattice ideals

For a finite index sublattice $L$ of the root lattice $A_{n}$, we construct a deterministic algorithm to deform the lattice ideal $I_L$ to a nearby generic lattice ideal, answering a question posed by Miller and Sturmfels. Our algorithm is…

Numerous math benchmarks exist to evaluate LLMs' mathematical capabilities. However, most involve extensive manual effort and are difficult to scale. Consequently, they cannot keep pace with LLM development or easily provide new instances…

In this paper we describe an algorithm that quickly computes a maximal a-valued lattice in an F-vector space equipped with a non-degenerate bilinear form, where a is a fractional ideal in a number field F. We then apply this construction to…

Recent lattice calculations of hadron structure functions are described.

Synthetic text generation is challenging and has limited success. Recently, a new architecture, called Transformers, allow machine learning models to understand better sequential data, such as translation or summarization. BERT and GPT-2,…

In this article, we present an algorithm to compute the 9th Dedekind Number. The key aspects are the use of matrix multiplication and symmetries in the free distributive lattice, which are detected with techniques from Formal Concept…

We develop an algorithm computing the transcendental lattice and the Mordell--Weil group of an extremal elliptic surface. As an example, we compute the lattices of four exponentially large series of surfaces

We describe a general approach for computing generators for elimination ideals associated with matrix and hypermatrix spectral decomposition constraints. We derive from these generators iterative procedures for approximating the spectral…

Complex networks have become powerful mechanisms for studying a variety of realworld systems. Consequently, many human-designed network models are proposed that reproduce nontrivial properties of complex networks, such as long-tail degree…

In this paper, we use a simple discrete dynamical model to study integer partitions and their lattice. The set of reachable configurations of the model, with the order induced by the transition rule defined on it, is the lattice of all…

Despite significant recent progress on generative models, controlled generation of images depicting multiple and complex object layouts is still a difficult problem. Among the core challenges are the diversity of appearance a given object…

We investigate new methods for generating Lagrangian cuts to solve two-stage stochastic integer programs. Lagrangian cuts can be added to a Benders reformulation, and are derived from solving single scenario integer programming subproblems…

Let $I_{L, \rho}$ be a lattice ideal. We provide a necessary and sufficient criterion under which a set of binomials in $I_{L, \rho}$ generate the radical of $I_{L, \rho}$ up to radical. We apply our results to the problem of determining…

This paper presents an automatic layout generation framework in advanced CMOS technologies. The framework extends the template-and-grid-based layout generation methodology with the following additional techniques applied to produce optimal…

This work presents a novel lattice-based methodology for incorporating multidimensional constraints into continuous decision variables within a genetic algorithm (GA) framework. The proposed approach consolidates established transcription…

As a typical application, the Lenstra-Lenstra-Lovasz lattice basis reduction algorithm (LLL) is used to compute a reduced basis of the orthogonal lattice for a given integer matrix, via reducing a special kind of lattice bases. With such…

The research community continues to seek increasingly more advanced synthetic data generators to reliably evaluate the strengths and limitations of machine learning methods. This work aims to increase the availability of datasets…

This paper explores the use of Column Generation (CG) techniques in constructing univariate binary decision trees for classification tasks. We propose a novel Integer Linear Programming (ILP) formulation, based on root-to-leaf paths in…

The recent surge in research focused on generating synthetic data from large language models (LLMs), especially for scenarios with limited data availability, marks a notable shift in Generative Artificial Intelligence (AI). Their ability to…

We have implemented different algorithms for generating Poissonian and vectorizable random lattices. The random lattices fulfil the Voronoi/Delaunay construction. We measure the performance of our algorithms for the two types of random…