Related papers: Efficient algorithms for computing the Euler-Poinc…
We develop a probabilistic algorithm of Kronecker type for computing a Kronecker representation of a zero-dimensional linear section of an algebraic variety $V$ defined over a perfect field $k$. The variety $V$ is the Zariski closure of the…
Simon's problem plays an important role in the history of quantum algorithms, as it inspired Shor to discover the celebrated quantum algorithm solving integer factorization in polynomial time. Besides, the quantum algorithm for Simon's…
The Poincare series of a multi-index filtration on the ring of germs of functions can be written as a certain integral with respect to the Euler characteristic over the projectivization of the ring. Here this integral is considered with…
Connected components of real algebraic sets are semi-algebraic, i.e. they are described by a boolean formula whose atoms are polynomial constraints with real coefficients. Computing such descriptions finds topical applications in optical…
There exists a well established differential topological theory of singularities of ordinary differential equations. It has mainly studied scalar equations of low order. We propose an extension of the key concepts to arbitrary systems of…
The Unbounded Subset-Sum Problem (USSP) is defined as: given sum $s$ and a set of integers $W\leftarrow \{p_1,\dots,p_n\}$ output a set of non-negative integers $\{y_1,\dots,y_n\}$ such that $p_1y_1+\dots+p_ny_n=s$. The USSP is an…
Ritt-Wu's algorithm of characteristic sets is the most representative for triangularizing sets of multivariate polynomials. Pseudo-division is the main operation used in this algorithm. In this paper we present a new algorithmic scheme for…
The works presented in this habilitation concern the algorithmics of polynomials. This is a central topic in computer algebra, with numerous applications both within and outside the field - cryptography, error-correcting codes, etc. For…
This paper defines mixed multiplicity systems; the Euler-Poincare characteristic and the mixed multiplicity symbol of $\mathbb{N}^d$-graded modules with respect to a mixed multiplicity system, and proves that the Euler-Poincare…
We describe some "unrestricted" algorithms which are useful for the computation of elementary and special functions when the precision required is not known in advance. Several general classes of algorithms are identified and illustrated by…
We advocate a new approach of addressing hidden structure problems and finding efficient quantum algorithms. We introduce and investigate the Hidden Symmetry Subgroup Problem (HSSP), which is a generalization of the well-studied Hidden…
This paper studies the problem of enumerating all maximal collinear subsets of size at least three in a given set of $n$ points. An algorithm for this problem, besides solving degeneracy testing and the exact fitting problem, can also help…
Global polynomial optimization is an important tool across applied mathematics, with many applications in operations research, engineering, and physical sciences. In various settings, the polynomials depend on external parameters that may…
We give an algorithm for deciding whether a planar polynomial differential system has a first integral which factorizes as a product of defining polynomials of curves with only one place at infinity. In the affirmative case, our algorithm…
We prove that for any $\ell \geq 0$, there exists an algorithm which takes as input a description of a semi-algebraic subset $S \subset \mathbb{R}^k$ given by a quantifier-free first order formula $\phi$ in the language of the reals, and…
In [Trace identities and $\bf {Z}/2\bf {Z}$-graded invariants, {\it Trans. Amer. Math. Soc. \bf309} (1988), 581--589] we generalized the first and second fundamental theorems of invariant theory from the general linear group to the general…
$\renewcommand{\Re}{\mathbb{R}}$ We develop a general randomized technique for solving "implic it" linear programming problems, where the collection of constraints are defined implicitly by an underlying ground set of elements. In many…
When a computer algebra system fails to solve an Ordinary Differential Equation, is this a limitation of its implementation, or a genuine computational barrier? Three traditions bear on the question. Modern computer algebra algorithms can…
We give a highly efficient "semi-agnostic" algorithm for learning univariate probability distributions that are well approximated by piecewise polynomial density functions. Let $p$ be an arbitrary distribution over an interval $I$ which is…
In this paper, we tackle the following problem: compute the gcd for several univariate polynomials with parametric coefficients. It amounts to partitioning the parameter space into ``cells'' so that the gcd has a uniform expression over…