English
Related papers

Related papers: Reading Rational Univariate Representations on lex…

200 papers

Here we study the problem of generalizing one of the main tools of Groebner basis theory, namely the flat deformation to the leading term ideal, to the border basis setting. After showing that the straightforward approach based on the…

Commutative Algebra · Mathematics 2007-10-16 Martin Kreuzer , Lorenzo Robbiano

Given a polynomial $x \in {\mathbb R}^n \mapsto p(x)$ in $n=2$ variables, a symbolic-numerical algorithm is first described for detecting whether the connected component of the plane sublevel set ${\mathcal P} = \{x : p(x) \geq 0\}$…

Optimization and Control · Mathematics 2008-01-24 Didier Henrion

In classical and real algebraic geometry there are several notions of the radical of an ideal I. There is the vanishing radical defined as the set of all real polynomials vanishing on the real zero set of I, and the real radical defined as…

Rings and Algebras · Mathematics 2018-04-27 Jakob Cimprič , J. William Helton , Igor Klep , Scott McCullough , Christopher Nelson

Chordal structure and bounded treewidth allow for efficient computation in numerical linear algebra, graphical models, constraint satisfaction and many other areas. In this paper, we begin the study of how to exploit chordal structure in…

Symbolic Computation · Computer Science 2017-01-03 Diego Cifuentes , Pablo Parrilo

We encode the binomials belonging to the toric ideal $I_A$ associated with an integral $d \times n$ matrix $A$ using a short sum of rational functions as introduced by Barvinok \cite{bar,newbar}. Under the assumption that $d,n$ are fixed,…

Combinatorics · Mathematics 2007-05-23 Jesus De Loera , David Haws , Raymond Hemmecke , Peter Huggins , Bernd Sturmfels , Ruriko Yoshida

A universal analytic Gr{\"o}bner basis (UAGB) of an ideal of a Tate algebra is a set containing a local Gr{\"o}bner basis for all suitable convergence radii. In a previous article, the authors proved the existence of finite UAGB's for…

Symbolic Computation · Computer Science 2024-01-12 Tristan Vaccon , Thibaut Verron

We describe the universal Groebner basis of the ideal of maximal minors and the ideal of $2$-minors of a multigraded matrix of linear forms. Our results imply that the ideals are radical and provide bounds on the regularity. In particular,…

Commutative Algebra · Mathematics 2016-09-01 Aldo Conca , Emanuela De Negri , Elisa Gorla

All rational parametric curves with prescribed polynomial tangent direction form a vector space. Via tangent directions with rational norm, this includes the important case of rational Pythagorean hodograph curves. We study vector subspaces…

Metric Geometry · Mathematics 2023-01-31 Hans-Peter Schröcker , Zbyněk Šír

Border bases arise as a canonical generalization of Gr\"obner bases. We provide a polyhedral characterization of all order ideals (and hence border bases) that are supported by a zero-dimensional ideal: order ideals that support a border…

Commutative Algebra · Mathematics 2016-10-26 Gábor Braun , Sebastian Pokutta

In this paper, we are concerned with the problem of counting the multiplicities of a zero-dimensional regular set's zeros. We generalize the squarefree decomposition of univariate polynomials to the so-called pseudo squarefree decomposition…

Symbolic Computation · Computer Science 2021-03-08 Xiaoliang Li , Wei Niu

When a bilingual student learns to solve word problems in math, we expect the student to be able to solve these problem in both languages the student is fluent in,even if the math lessons were only taught in one language. However, current…

Computation and Language · Computer Science 2018-09-25 Armen Aghajanyan , Xia Song , Saurabh Tiwary

We introduced the package/subsystem GeoGebra Discovery to GeoGebra which supports the automated proving or discovering of elementary geometry inequalities. In this case study, for inequality exploration problems related to isosceles and…

Algebraic Geometry · Mathematics 2022-01-04 Zoltán Kovács , Róbert Vajda

We study the relationship between certain Groebner bases for zero dimensional ideals, and the interpolation condition functionals of ideal interpolation. Ideal interpolation is defined by a linear idempotent projector whose kernel is a…

Symbolic Computation · Computer Science 2024-01-17 Yihe Gong , Xue Jiang

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…

Commutative Algebra · Mathematics 2017-12-11 Juliane Capaverde , Shuhong Gao

In this article we present a parallel modular algorithm to compute all solutions with multiplicities of a given zero-dimensional polynomial system of equations over the rationals. In fact, we compute a triangular decomposition using…

Commutative Algebra · Mathematics 2013-06-12 Deeba Afzal , Faira Kanwal , Gerhard Pfister , Stefan Steidel

Polynomial interpretations are a useful technique for proving termination of term rewrite systems. They come in various flavors: polynomial interpretations with real, rational and integer coefficients. As to their relationship with respect…

Logic in Computer Science · Computer Science 2015-07-01 Friedrich Neurauter , Aart Middeldorp

We establish new measures of linear independence of logarithms on commutative algebraic groups in the so-called \emph{rational case}. More precisely, let k be a number field and v_{0} be an arbitrary place of k. Let G be a commutative…

Number Theory · Mathematics 2009-02-19 Éric Gaudron

Given an associative, not necessarily commutative, ring R with identity, a formal matrix calculus is introduced and developed for pairs of matrices over R. This calculus subsumes the theory of homogeneous systems of linear equations with…

K-Theory and Homology · Mathematics 2009-09-03 Ivo Herzog

We describe a standard form for the elements in the universal field of fractions of free associative algebras (over a commutative field). It is a special version of the normal form provided by Cohn and Reutenauer and enables the use of…

Rings and Algebras · Mathematics 2020-12-09 Konrad Schrempf

Univariate polynomial root-finding is a classical subject, still important for modern computing. Frequently one seeks just the real roots of a polynomial with real coefficients. They can be approximated at a low computational cost if the…

Symbolic Computation · Computer Science 2017-04-14 Victor Y. Pan , Liang Zhao