Related papers: VPSPACE and a Transfer Theorem over the Reals
Vertically parametrised polynomial systems are a particular nice class of parametrised polynomial systems for which a lot of interesting algebraic information is encoded in its combinatorics. Given a fixed polynomial system, we empirically…
We consider the concept of a local set of inference rules. A local rule set can be automatically transformed into a rule set for which bottom-up evaluation terminates in polynomial time. The local-rule-set transformation gives…
The purpose of this article is to examine and limit the conditions in which the P complexity class could be equivalent to the NP complexity class. Proof is provided by demonstrating that as the number of clauses in a NP-complete problem…
We develop a complexity theory for approximate real computations. We first produce a theory for exact computations but with condition numbers. The input size depends on a condition number, which is not assumed known by the machine. The…
NP complete problem is one of the most challenging issues. The question of whether all problems in NP are also in P is generally considered one of the most important open questions in mathematics and theoretical computer science as it has…
A problem that is frequently encountered in a variety of mathematical contexts, is to find the common invariant subspaces of a single, or set of matrices. A new method is proposed that gives a definitive answer to this problem. The key idea…
We consider each of the three classes of representations of cyclic groups that arise in the study of rational sphere maps. We study the possible number of terms for invariant polynomials with non-negative coefficients that are constant on…
By considering a discrete tape where each cell corresponds to an integer, thus to a possible sum, a pseudo-polynomial solution can be given to subset sum problem, which is an NP-complete problem and a cornerstone application for this study,…
We study several variants of decomposing a symmetric matrix into a sum of a low-rank positive semidefinite matrix and a diagonal matrix. Such decompositions have applications in factor analysis and they have been studied for many decades.…
We study classes $P_{g,T}(\alpha;\beta)$ on the moduli space of stable, genus g curves with rational tails defined by pushing forward the virtual fundamental classes of spaces of relative stable maps to an unparameterized projective line. A…
Subclasses of TFNP (total functional NP) are usually defined by specifying a complete problem, which is necessarily in TFNP, and including all problems many-one reducible to it. We study two notions of how a TFNP problem can be reducible to…
Let $k$ be a field and $V$ an $k$-vector space. For a family $\bar P=\{ P_i\}_{1\leq i\leq c}, $ of polynomials on $V$, we denote by $\mathbb X _{\bar P}\subset V$ the subscheme defined by the ideal generated by $ \bar P$. We show the…
The input of the popular roommates problem consists of a graph $G = (V, E)$ and for each vertex $v\in V$, strict preferences over the neighbors of $v$. Matching $M$ is more popular than $M'$ if the number of vertices preferring $M$ to $M'$…
It is proved that each of compact linear groups of one special type admits a polynomial factorization map onto a real vector space. More exactly, the group is supposed to be non-commutative one-dimensional and to have two connected…
Fix any algebraic extension $\mathbb K$ of the field $\mathbb Q$ of rationals. In this article we study exponential sets $V\subset \mathbb R^n$. Such sets are described by the vanishing of so called exponential polynomials, i.e.,…
The class $\mathcal{UP}$ of `ultimate polynomial time' problems over $\mathbb C$ is introduced; it contains the class $\mathcal P$ of polynomial time problems over $\mathbb C$. The $\tau$-Conjecture for polynomials implies that…
A central question in mathematics and computer science is the question of determining whether a given ideal $I$ is prime, which geometrically corresponds to the zero set of $I$, denoted $Z(I)$, being irreducible. The case of principal…
We consider polynomials with integer coefficients and discuss their factorization properties in Z[[x]], the ring of formal power series over Z. We treat polynomials of arbitrary degree and give sufficient conditions for their reducibility…
In this paper, we prove several theorems on systems of polynomials with at least one positive real zero based on the theory of conceive polynomials. These theorems provide sufficient conditions for systems of multivariate polynomials…
This work is divided into three parts. The first part concerns polynomials in one variable with all real roots. We consider linear transformations that preserve real rootedness, as well as matrices that preserve interlacing. The second part…