Related papers: Critical Point Computations on Smooth Varieties: D…
The problem of computing spectra of operators is arguably one of the most investigated areas of computational mathematics. However, the problem of computing spectra of general bounded infinite matrices has only recently been solved. We…
Let $G$ be a connected graph on $n$ vertices with adjacency matrix $A_G$. Associated to $G$ is a polynomial $d_G(x_1,\dots, x_n)$ of degree $n$ in $n$ variables, obtained as the determinant of the matrix $M_G(x_1,\dots,x_n)$, where…
The Zariski closure of the central path which interior point algorithms track in convex optimization problems such as linear, quadratic, and semidefinite programs is an algebraic curve. The degree of this curve has been studied in relation…
Phase transitions in combinatorial problems have recently been shown to be useful in locating "hard" instances of combinatorial problems. The connection between computational complexity and the existence of phase transitions has been…
Nisan and Szegedy (CC 1994) showed that any Boolean function $f:\{0,1\}^n\rightarrow \{0,1\}$ that depends on all its input variables, when represented as a real-valued multivariate polynomial $P(x_1,\ldots,x_n)$, has degree at least $\log…
The study of proper rational mappings between balls in complex Euclidean spaces naturally leads to the relationship between the degree and imbedding dimension of such a mapping. The special case for monomial mappings is equivalent to the…
In a previous paper {GN2} an effective solution of the lattice point counting problem in general domains in semisimple S-algebraic groups and affine symmetric varieties was established. The method relies on the mean ergodic theorem for the…
The modular curves in the family $X_1(N)$ for natural numbers $N$ parametrize elliptic curves over the complex numbers with a distinguished point of order $N$. The purpose of this paper is to better understand how to calculate the degrees…
It is well known that, using fast algorithms for polynomial multiplication and division, evaluation of a polynomial $F \in \mathbb{C}[x]$ of degree $n$ at $n$ complex-valued points can be done with $\tilde{O}(n)$ exact field operations in…
A new algorithms for computing discrete logarithms on elliptic curves defined over finite fields is suggested. It is based on a new method to find zeroes of summation polynomials. In binary elliptic curves one is to solve a cubic system of…
Linear projections from P^k to P^h appear in computer vision as models of images of dynamic or segmented scenes. Given multiple projections of the same scene, the identification of many enough correspondences between the images allows, in…
We study character varieties arising as moduli of representations of an orientable surface group into a reductive group $G$. We first show that if $G/Z$ acts freely on the representation variety, then both the representation variety and the…
The paper presents an algebraic framework for optimization problems expressible as Valued Constraint Satisfaction Problems. Our results generalize the algebraic framework for the decision version (CSPs) provided by Bulatov et al. [SICOMP…
We present a probabilistic Las Vegas algorithm for computing the local zeta function of a hyperelliptic curve of genus $g$ defined over $\mathbb{F}_q$. It is based on the approaches by Schoof and Pila combined with a modeling of the…
Let $X$ be a smooth projective hypersurface defined over $\mathbb{Q}$. We provide new bounds for rational points of bounded height on $X$. In particular, we show that if $X$ is a smooth projective hypersurface in $\mathbb{P}^n$ with $n\geq…
Let f be a degree d polynomial defined over the nonarchimedean field C_p, normalized so f is monic and f(0)=0. We say f is post-critically bounded, or PCB, if all of its critical points have bounded orbit under iteration of f. It is known…
In this note we obtain the surjectivity of smooth maps into Euclidean spaces under mild conditions. As application we give a new proof of the Fundamental Theorem of Algebra. We also observe that any $C^1$-map from a compact manifold into…
There are several numerical methods for computing approximate zeros of a given univariate polynomial. In this paper, we develop a simple and novel method for determining sharp upper bounds on errors in approximate zeros of a given…
In this note, we investigate the measure of singular sets and critical sets of real-valued solutions of elliptic equations in two dimensions. These singular sets and critical sets are finitely many points in the plane. Adapting the Carleman…
We study critical and stationary, i.e. critical with respect to both inner and outer variations, points of polyconvex functionals of the form $f(X) = g(\det(X))$, for $X \in \mathbb{R}^{2\times 2}$. In particular, we show that critical…