相关论文: Efficiently Detecting Torsion Points and Subtori

We consider the average-case complexity of some otherwise undecidable or open Diophantine problems. More precisely, consider the following: (I) Given a polynomial f in Z[v,x,y], decide the sentence \exists v \forall x \exists y f(v,x,y)=0,…

We report an ongoing work on clustering algorithms for complex roots of a univariate polynomial $p$ of degree $d$ with real or complex coefficients. As in their previous best subdivision algorithms our root-finders are robust even for…

Sendov's conjecture states that if all the zeroes of a complex polynomial $P(z)$ of degree at least two lie in the unit disk, then within a unit distance of each zero lies a critical point of $P(z)$. In a paper that appeared in 2014,…

We consider the problem of deciding whether a polygonal knot in 3-dimensional Euclidean space is unknotted, capable of being continuously deformed without self-intersection so that it lies in a plane. We show that this problem, {\sc…

We use tools of additive combinatorics for the study of subvarieties defined by {\it high rank} families of polynomials in high dimensional $\mathbb{F} _q$-vector spaces. In the first, analytic part of the paper we prove a number properties…

We prove a rigidity theorem for the Poisson automorphisms of the function fields of tori with quadratic Poisson structures over fields of characteristic 0. It gives an effective method for classifying the full Poisson automorphism groups of…

A family of $k$ point sets in $d$ dimensions is well-separated if the convex hulls of any two disjoint subfamilies can be separated by a hyperplane. Well-separation is a strong assumption that allows us to conclude that certain kinds of…

Let $\mathbb{P}= \{P_1, \cdots, P_{k}\in \mathbb{R}[y]\}$ be a collection of polynomials with distinct degrees and zero constant terms. We proved that there exists $\epsilon=\epsilon(\mathbb{P})>0$ such that, for any compact set $E \subset…

We systematically study the computational complexity of a broad class of computational problems in phylogenetic reconstruction. The class contains for example the rooted triple consistency problem, forbidden subtree problems, the quartet…

For a class of polynomials $f \in \mathbb{Z}[X]$, which in particular includes all quadratic polynomials, and also trinomials of some special form, we show that, under some natural conditions (necessary for quadratic polynomials), the set…

We prove a generalization of the Shapiro-Shapiro conjecture on Wronskians of polynomials, allowing the Wronskian to have complex conjugate roots. We decompose the real Schubert cell according to the number of real roots of the Wronski map,…

We show how to construct sparse polynomial systems that have non-trivial lower bounds on their numbers of real solutions. These are unmixed systems associated to certain polytopes. For the order polytope of a poset P this lower bound is the…

We obtain a polynomial upper bound in the finite-field version of the multidimensional polynomial Szemer\'{e}di theorem for distinct-degree polynomials. That is, if $P_1, ..., P_t$ are nonconstant integer polynomials of distinct degrees and…

The problem of when a given digraph contains a subdivision of a fixed digraph $F$ is considered. Bang-Jensen et al. laid out foundations for approaching this problem from the algorithmic point of view. In this paper we give further support…

A precise tie between a univariate spline's knots and its zeros abundance and dissemination is formulated. As an application, a conjecture formulated by De Concini and Procesi is shown to be true in the special univariate, unimodular case.…

We investigate Newton's method for complex polynomials of arbitrary degree $d$, normalized so that all their roots are in the unit disk. For each degree $d$, we give an explicit set $\mathcal{S}_d$ of $3.33d\log^2 d(1 + o(1))$ points with…

We show that several sets of interest arising from the study of partition regularity and density Ramsey theory of polynomial equations over integral domains are undecidable. In particular, we show that the set of homogeneous polynomials $p…

Suppose you have an uncomputable set $X$ and you want to find a set $A$, all of whose infinite subsets compute $X$. There are several ways to do this, but all of them seem to produce a set $A$ which is fairly sparse. We show that this is…

The computational complexity of the partition, 0-1 subset sum, unbounded subset sum, 0-1 knapsack and unbounded knapsack problems and their multiple variants were studied in numerous papers in the past where all the weights and profits were…

The computation of the sparse principal component of a matrix is equivalent to the identification of its principal submatrix with the largest maximum eigenvalue. Finding this optimal submatrix is what renders the problem…