相关论文: Computing Groebner Fans

In this work, we extend modular techniques for computing Gr\"obner bases involving rational coefficients to (two-sided) ideals in free algebras. We show that the infinite nature of Gr\"obner bases in this setting renders the classical…

The division operation is important for many areas of data processing. Especially considering today's demand for hardware accelerators for machine learning algorithms, there is a high demand for an efficient calculation of the division…

A perfect Euler cuboid is a rectangular parallelepiped with integer edges, with integer face diagonals, and with integer space diagonal as well. Finding such parallelepipeds or proving their non-existence is an old unsolved mathematical…

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…

A cofactor representation of an ideal element, that is, a representation in terms of the generators, can be considered as a certificate for ideal membership. Such a representation is typically not unique, and some can be a lot more…

A surprising 'converse to the polynomial method' of Aaronson et al. (CCC'16) shows that any bounded quadratic polynomial can be computed exactly in expectation by a 1-query algorithm up to a universal multiplicative factor related to the…

In this paper we study the geometry and combinatorics of the possible rational polyhedral fans with a given set of rays. The main questions we consider are when such fans are projective, complete, or simplicial. To answer these questions we…

Programmable linear optical interferometers are important for classical and quantum information technologies, as well as for building hardware-accelerated artificial neural networks. Recent results showed the possibility of constructing…

We discuss the problem of determining reduction number of a polynomial ideal I in n variables. We present two algorithms based on parametric computations. The first one determines the absolute reduction number of I and requires computation…

We propose new algorithms for computing triangular decompositions of polynomial systems incrementally. With respect to previous works, our improvements are based on a {\em weakened} notion of a polynomial GCD modulo a regular chain, which…

Recently Hashemi and Kapur published an algorithm [1] for Groebner basis conversion by truncating polynomials according to a source and a target monomial order. Here we present a counterexample to this algorithm.

This is the continuation of Montes' paper "On the canonical discussion of polynomial systems with parameters". In this paper we define the Minimal Canonical Comprehensive Groebner System (MCCGS) of a parametric ideal and fix under which…

Cylindrical algebraic decomposition (CAD) is an important tool for working with polynomial systems, particularly quantifier elimination. However, it has complexity doubly exponential in the number of variables. The base algorithm can be…

Motivated by the authors' work on permuto-associahedra, which can be considered as a symmetrization of the associahedron using the symmetric group, we introduce and study the $\mathfrak{G}$-symmetrization of an arbitrary polytope $P$ for…

We present a $p$-adic algorithm to recover the lexicographic Gr\"obner basis $\mathcal G$ of an ideal in $\mathbb Q[x,y]$ with a generating set in $\mathbb Z[x,y]$, with a complexity that is less than cubic in terms of the dimension of…

This note which can be viewed as a complement to Alex Postnikov's paper math.CO/0507163, presents a self-contained overview of basic properties of nested complexes and their two dual polyhedral realizations: as complete simplicial fans, and…

We present an implementation of the algorithm for computing Groebner bases for operads due to the first author and A. Khoroshkin. We discuss the actual algorithms, the choices made for the implementation platform and the data…

We develop a probabilistic algorithm for computing elimination ideals of likelihood equations, which is for larger models by far more efficient than directly computing Groebner bases or the interpolation method proposed in the first…

We consider ideals involving the maximal minors of a polynomial matrix. For example, those arising in the computation of the critical values of a polynomial restricted to a variety for polynomial optimisation. Gr\"obner bases are a…

We present a new algorithm to decompose generic spinor polynomials into linear factors. Spinor polynomials are certain polynomials with coefficients in the geometric algebra of dimension three that parametrize rational conformal motions.…