相关论文: On the intrinsic complexity of elimination problem…

Arithmetic combinatorics is often concerned with the problem of bounding the behaviour of arbitrary finite sets in a group or ring with respect to arithmetic operations such as addition or multiplication. Similarly, combinatorial geometry…

We make use of the complex implicit representation in order to provide a deterministic algorithm for checking whether or not two implicit algebraic curves are related by a similarity, a central question in Pattern Recognition and Computer…

Cylindrical Algebraic Decomposition (CAD) is an important tool within computational real algebraic geometry, capable of solving many problems for polynomial systems over the reals. It has long been studied by the Symbolic Computation…

We describe an algorithm for splitting permutation representations of finite group over fields of characteristic zero into irreducible components. The algorithm is based on the fact that the components of the invariant inner product in…

We propose an algebraic model of computation which formally relates symbolic listings, complexity of Boolean functions, and low depth arithmetic circuit complexity. In this model algorithms are arithmetic formula expressing symbolic…

Many methods solve Poisson equations by using grid techniques which discretize the problem in each dimension. Most of these algorithms are subject to the curse of dimensionality, so that they need exponential runtime. In the paper "Quantum…

Numerical Algebraic Geometry uses numerical data to describe algebraic varieties. It is based on the methods of numerical polynomial homotopy continuation, an alternative to the classical symbolic approaches of computational algebraic…

The analysis of observable phenomena (for instance, in biology or physics) allows the detection of dynamical behaviors and, conversely, starting from a desired behavior allows the design of objects exhibiting that behavior in engineering.…

Researchers working with mathematical models are often confronted by the related problems of parameter estimation, model validation, and model selection. These are all optimization problems, well-known to be challenging due to…

We present our public-domain software for the following tasks in sparse (or toric) elimination theory, given a well-constrained polynomial system. First, C code for computing the mixed volume of the system. Second, Maple code for defining…

We present an algebraic algorithm to detect the existence of and to list all indecomposable even circuits in a given graph. We also discuss an application of our work to the study of directed cycles in digraphs.

This survey paper was primarily written as as the support for a course pesented at the JNCF2025: it aims to present some material that illustrates the kind of estimates one can obtain in effective algebraic geometry, for affine polynomial…

The purpose of this paper is to explore the question "to what extent could we produce formal, machine-verifiable, proofs in real algebraic geometry?" The question has been asked before but as yet the leading algorithms for answering such…

We describe an approach to the question of finding real solutions to problems of enumerative geometry, in particular the question of whether a problem of enumerative geometry can have all of its solutions be real. We give some methods to…

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…

Many fundamental questions in theoretical computer science are naturally expressed as special cases of the following problem: Let $G$ be a complex reductive group, let $V$ be a $G$-module, and let $v,w$ be elements of $V$. Determine if $w$…

In this paper we present an algorithmic procedure that transforms, if possible, a given system of ordinary or partial differential equations with radical dependencies in the unknown function and its derivatives into a system with polynomial…

Symbolic computation, powered by modern computer algebra systems, has important applications in mathematical reasoning through exact deep computations. The efficiency of symbolic computation is largely constrained by such deep computations…

Probabilistic circuits compute multilinear polynomials that represent multivariate probability distributions. They are tractable models that support efficient marginal inference. However, various polynomial semantics have been considered in…

In this article we show how to compute a matrix representation and the implicit equation by means of the method developed in [Botbol: arXiv:1007.3437], using the computer algebra system Macaulay2 \cite{M2}. As it is probably the most…