Related papers: Efficient algorithms for computing the Euler-Poinc…
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…
We introduce a framework of the equivariant convolutional quantum algorithms which is tailored for a number of machine-learning tasks on physical systems with arbitrary SU$(d)$ symmetries. It allows us to enhance a natural model of quantum…
Suppose we are given an $n$-dimensional order-3 symmetric tensor $T \in (\mathbb{R}^n)^{\otimes 3}$ that is the sum of $r$ random rank-1 terms. The problem of recovering the rank-1 components is possible in principle when $r \lesssim n^2$…
The problem of minimizing a polynomial over a set of polynomial inequalities is an NP-hard non-convex problem. Thanks to powerful results from real algebraic geometry, one can convert this problem into a nested sequence of…
Gr{\"o}bner bases is one the most powerful tools in algorithmic non-linear algebra. Their computation is an intrinsically hard problem with a complexity at least single exponential in the number of variables. However, in most of the cases,…
We propose a taxonomy for quantum algorithms grounded in the fundamental symmetries, both continuous and discrete, underlying quantum state spaces, oracles, and circuit dynamics. By organizing algorithms according to their symmetry groups…
What polynomial in the coefficients of a system of algebraic equations should be called its discriminant? We prove a package of facts that provide a possible answer. Let us call a system typical, if the homeomorphic type of its set of…
We introduce the notion of semi-characteristic polynomial for a semi-linear map of a finite- dimensional vector space over a field of characteristic p. This polynomial has some properties in common with the classical characteristic…
In this paper we study the generalized Erdos-Falconer distance problems in the finite field setting. The generalized distances are defined in terms of polynomials, and various formulas for sizes of distance sets are obtained. In particular,…
We provide an angular parametrization of the special unitary group $\textrm{SU}(2^{n})$ generalizing Euler angles for $\textrm{SU}(2)$ by successively applying the KAK decomposition. We then determine constraint equations for the parametric…
In this article we consider the inversion problem for polynomially computable discrete functions. These functions describe behavior of many discrete systems and are used in model checking, hardware verification, cryptanalysis, computer…
A semi-algebraic set is a subset of $\mathbb{R}^n$ defined by a finite collection of polynomial equations and inequalities. In this paper, we investigate the problem of determining whether two points in such a set belong to the same…
We introduce and study symmetric polynomials, which as very special cases include polynomials related to the supersymmetric eight-vertex model, and other elliptic lattice models with $\Delta=\pm 1/2$. There is also a close relation to…
We propose a semiclassical version of Shor's quantum algorithm to factorize integer numbers, based on spin-1/2 SU(2) generalized coherent states. Surprisingly, we find evidences that the algorithm's success probability is not too severely…
DR-submodular functions encompass a broad class of functions which are generally non-convex and non-concave. We study the problem of minimizing any DR-submodular function, with continuous and general integer variables, under box constraints…
We have developed in the past several algorithms with intrinsic complexity bounds for the problem of point finding in real algebraic varieties. Our aim here is to give a comprehensive presentation of the geometrical tools which are…
We present a polynomial time algorithm to compute any fixed number of the highest coefficients of the Ehrhart quasi-polynomial of a rational simplex. Previously such algorithms were known for integer simplices and for rational polytopes of…
In the paper, the author elementarily unifies and generalizes eight identities involving the functions $\frac{\pm1}{e^{\pm t}-1}$ and their derivatives. By one of these identities, the author establishes two explicit formulae for computing…
Optimizing and certifying the positivity of polynomials are fundamental primitives across mathematics and engineering applications, from dynamical systems to operations research. However, solving these problems in practice requires large…
The Euler-Poincare characteristic, or Euler characteristic in short, is a fundamental topological invariant of compact manifolds that plays a crucial role in a variety of geometric and topological situations. From this point of view, we…