Related papers: Truncated Groebner fans and lattice ideals
In this note, we extend modular techniques for computing Gr\"obner bases from the commutative setting to the vast class of noncommutative $G$-algebras. As in the commutative case, an effective verification test is only known to us in the…
We describe a version of the FGLM algorithm that can be used to compute generic fibers of positive-dimensional polynomial ideals. It combines the FGLM algorithm with a Hensel lifting strategy. In analogy with Hensel lifting, we show that…
Standard noncommutative Gr\"obner basis procedures are used for computing ideals of free noncommutative polynomial rings over fields. This paper describes Gr\"obner basis procedures for one-sided ideals in finitely presented noncommutative…
Prime-based ordering which is proved to be admissible, is the encoding of indeterminates in power-products with prime numbers and ordering them by using the natural number order. Using Eiffel, four versions of Buchberger's improved…
Border basis schemes are open subschemes of Hilbert schemes parametrizing 0-dimensional subschemes of $\mathbb{P}^n$ of given length. They yield open coverings and are easy to describe and to compute with. Our topic is to find re-embeddings…
Let F be a global function field with constant field $\mathbb{F}_q$. Let G be a reductive group over $\mathbb{F}_q$. We establish a variant of Arthur's truncated kernel for G and for its Lie algebra which generalizes Arthur's original…
Polytropes are both ordinary and tropical polytopes. We show that tropical types of polytropes in $\mathbb{TP}^{n-1}$ are in bijection with cones of a certain Gr\"{o}bner fan $\mathcal{GF}_n$ in $\mathbb{R}^{n^2 - n}$ restricted to a small…
In this paper, we give decision criteria for normal binomial difference polynomial ideals in the univariate difference polynomial ring F{y} to have finite difference Groebner bases and an algorithm to compute the finite difference Groebner…
The microcanonical statistical mechanics of a set of self-gravitating particles is analyzed in mean-field approach. In order to deal with an upper bounded entropy functional, a softened gravitational potential is used. The softening is…
We deal with the efficient parallelization of Bayesian global optimization algorithms, and more specifically of those based on the expected improvement criterion and its variants. A closed form formula relying on multivariate Gaussian…
We study truncated objects using elementary methods. Concretely, we use universes and the resulting natural number object to define internal truncation levels and prove they behave similar to standard truncated objects. Moreover, we take an…
Quantum many-body systems involving bosonic modes or gauge fields have infinite-dimensional local Hilbert spaces which must be truncated to perform simulations of real-time dynamics on classical or quantum computers. To analyze the…
Dotsenko and Vallette discovered an extension to nonsymmetric operads of Buchberger's algorithm for Gr\"obner bases of polynomial ideals. In the free nonsymmetric operad with one ternary operation $({\ast}{\ast}{\ast})$, we compute a…
Degenerate Hubbard models are studied using the Generalized-Gutzwiller-Approximation. It is found that the metal-insulator transition occurs at a finite correlation $U_c$ when the average number of electrons per lattice site is an integer.…
Let $I = ( f_1, \dots, f_n )$ be a homogeneous ideal in the polynomial ring $K[x_1, \dots,x_n]$ over a field $K$ generated by generic polynomials. Using an incremental approach based on a method by Gao, Guan and Volny, and properties of the…
In the first part of this article, we consider a Groebner basis of the differential ideal {x_1^2} with respect to "the" weighted lexicographical monomial order and show that its computation is related with an identity involving the…
Quantum walks provide a framework for understanding and designing quantum algorithms that is both intuitive and universal. To leverage the computational power of these walks, it is important to be able to programmably modify the graph a…
For a given monomial ideal $J \subset k[x_1, \ldots, x_n]$ and a given monomial order $\prec$, the moduli functor of all reduced Gr\"obner bases with respect to $\prec$ whose initial ideal is $J$ is determined. In some cases, such a functor…
We present a formalization of Gr\"obner basis theory in Lean 4, built on top of Mathlib's infrastructure for multivariate polynomials and monomial orders. Our development covers the core foundations of Gr\"obner basis theory, including…
We suggest an approach to solve the problem of matching fans in interaction net implementations of optimal reduction for the pure untyped lambda calculus without use of any additional agent types. Our implementation supports a wider class…