Related papers: A Polynomial Time Test to Detect Number with Many …
We define and study when a polynomial mapping has a local or global time average. We conjecture that a polynomial f in the complex plane has a time average near a point z if and only if z is eventually mapped into a Siegel-disc of f. We…
In this paper, we study the many-to-many matching problem on planar point sets with integer coordinates: Given two disjoint sets $R,B \subset [\Delta]^2$ with $|R|+|B|=n$, the goal is to select a set of edges between $R$ and $B$ so that…
The extremal index $\theta$, a number in the interval $[0,1]$, is known to be a measure of primal importance for analyzing the extremes of a stationary time series. New rank-based estimators for $\theta$ are proposed which rely on the…
It is well known that many problems in interval computation are intractable, which restricts our attempts to solve large problems in reasonable time. This does not mean, however, that all problems are computationally hard. Identifying…
We consider the following problem: Given a rational matrix $A \in \setQ^{m \times n}$ and a rational polyhedron $Q \subseteq\setR^{m+p}$, decide if for all vectors $b \in \setR^m$, for which there exists an integral $z \in \setZ^p$ such…
Given a set of points $P$ and axis-aligned rectangles $\mathcal{R}$ in the plane, a point $p \in P$ is called \emph{exposed} if it lies outside all rectangles in $\mathcal{R}$. In the \emph{max-exposure problem}, given an integer parameter…
We describe algorithms for computing eigenpairs (eigenvalue-eigenvector pairs) of a complex $n\times n$ matrix $A$. These algorithms are numerically stable, strongly accurate, and theoretically efficient (i.e., polynomial-time). We do not…
The Strong Exponential Time Hypothesis (SETH) asserts that for every $\varepsilon>0$ there exists $k$ such that $k$-SAT requires time $(2-\varepsilon)^n$. The field of fine-grained complexity has leveraged SETH to prove quite tight…
We consider systems of polynomial equations and inequalities in $\mathbb{Q}[\boldsymbol{y}][\boldsymbol{x}]$ where $\boldsymbol{x} = (x_1, \ldots, x_n)$ and $\boldsymbol{y} = (y_1, \ldots,y_t)$. The $\boldsymbol{y}$ indeterminates are…
It is well known that the most challenging question in optimization and discrete geometry is whether there is a strongly polynomial time simplex algorithm for linear programs (LPs). This paper gives a positive answer to this question by…
We describe algorithms for computing eigenpairs (eigenvalue--eigenvector) of a complex $n\times n$ matrix $A$. These algorithms are numerically stable, strongly accurate, and theoretically efficient (i.e., polynomial-time). We do not…
We present a simple and at the same time fficient algorithm to compute all nondominated extreme points in the outcome set of multi-objective mixed integer linear programmes in any dimension. The method generalizes the well-known dichotomic…
We describe a genetic algorithm to find extreme examples in the arithmetic of dynamical systems. The algorithm is applied to four problems: small (non-zero) canonical heights, many rational preperiodic points, long rational cycles, and long…
We describe an algorithm to count the number of distinct real zeros of a polynomial (square) system f. The algorithm performs O(n D kappa(f)) iterations where n is the number of polynomials (as well as the dimension of the ambient space), D…
The algebras considered in this paper are commutative rings of which the additive group is a finite-dimensional vector space over the field of rational numbers. We present deterministic polynomial-time algorithms that, given such an…
We prove a complex polynomial of degree $n$ has at most $\lceil n/2 \rceil$ attractive fixed points lying on a line. We also consider the general case.
It is a classical result of Mahler that for any rational number $\alpha$ > 1 which is not an integer and any real 0 < c < 1, the set of positive integers n such that $\alpha$ n < c n is necessarily finite. Here for any real x, x denotes the…
We present a numerical algorithm for finding real non-negative solutions to polynomial equations. Our methods are based on the expectation maximization and iterative proportional fitting algorithms, which are used in statistics to find…
In the number partitioning problem (NPP) one aims to partition a given set of $N$ real numbers into two subsets with approximately equal sum. The NPP is a well-studied optimization problem and is famous for possessing a…
The multiplier $\lambda_n$ of a periodic orbit of period $n$ can be viewed as a (multiple-valued) algebraic function on the space of all complex quadratic polynomials $p_c(z)=z^2+c$. We provide a numerical algorithm for computing critical…