Related papers: VPSPACE and a Transfer Theorem over the Reals

In a previous paper, we have shown that any Boolean formula can be encoded as a linear programming problem in the framework of Bayesian probability theory. When applied to NP-complete algorithms, this leads to the fundamental conclusion…

We compute new polynomials with Galois group $M_{11}$ over $\mathbb{Q}(t)$. These polynomials stem from various families of covers of $\mathbb{P}^1\mathbb{C}$ ramified over at least 4 points. Each of these families has features that make a…

Low-degree polynomials have emerged as a powerful paradigm for providing evidence of statistical-computational gaps across a variety of high-dimensional statistical models [Wein25]. For detection problems -- where the goal is to test a…

The paper studies the complex 1-dimensional polynomial vector fields with real coefficients under topological orbital equivalence preserving the separatrices of the pole at infinity. The number of generic strata is determined, and a…

We introduce a family of univariate polynomials indexed by integer partitions. At prime powers, they count the number of subspaces in a finite vector space that transform under a regular diagonal matrix in a specified manner. This…

In this paper, we define vector bundles within the framework of almost mathematics (referred to as almost vector bundles) and establish the $v$-descent theorem together with a structure theorem for these bundles over perfectoid spaces. The…

This is a straightforward introduction to the properties of polynomials in many variables that do not vanish in the open upper half plane. Such polynomials generalize many of the well-known properties of polynomials with all real roots.

For the family of polynomials in one variable $P:=x^n+a_1x^{n-1}+\cdots +a_n$ we ask the questions at which points its discriminant set can be considered as the graph of a function of all coefficients $a_j$ but one and how its subset of…

Let $P(x) \in \mathbb{Z}[x]$ be a polynomial. We give an easy and new proof of the fact that the set of primes $p$ such that $p \mid P(n)$, for some $n \in \mathbb{Z}$, is infinite. We also get analog of this result for some special…

We determine the group of linear transformations on a vector space $V$ that preserve a polynomial function $f$ on $V$ for several interesting pairs $(V,f)$, using the theory of semisimple algebraic groups.

We study the pullback of the apolarity invariant of complex polynomials in one variable under a polynomial map on the complex plane. As a consequence, we obtain variations of the classical results of Grace and Walsh in which the unit disk,…

The Galois group of a parameterized polynomial system of equations encodes the structure of the solutions. This monodromy group acts on the set of solutions for a general set of parameters, that is, on the fiber of a projection from the…

In pattern classification, polynomial classifiers are well-studied methods as they are capable of generating complex decision surfaces. Unfortunately, the use of multivariate polynomials is limited to kernels as in support vector machines,…

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…

In this paper we explore the noncommutative analogues, $\mathrm{VP}_{nc}$ and $\mathrm{VNP}_{nc}$, of Valiant's algebraic complexity classes and show some striking connections to classical formal language theory. Our main results are the…

To compute solutions of sparse polynomial systems efficiently we have to exploit the structure of their Newton polytopes. While the application of polyhedral methods naturally excludes solutions with zero components, an irreducible…

Finding the solutions to a system of multivariate polynomial equations is a fundamental problem in mathematics and computer science. It involves evaluating the polynomials at many points, often chosen from a grid. In most current methods,…

We consider systems of strict multivariate polynomial inequalities over the reals. All polynomial coefficients are parameters ranging over the reals, where for each coefficient we prescribe its sign. We are interested in the existence of…

This paper studies the computational difficulty of clustering problems that are defined directly on a continuous probability density. Rather than working with finite samples, we assume the density is given as a polynomial and ask whether it…

In this paper, we consider the {\it tensor absolute value equations} (TAVEs), which is a newly introduced problem in the context of multilinear systems. Although the system of TAVEs is an interesting generalization of matrix {\it absolute…