Related papers: Dedekind Zeta Zeroes and Faster Complex Dimension …
In this paper, the results in [Singular Hessians, J. Algebra 282 (2004), no. 1, 195--204], for polynomial Hessians with determinant zero in small dimensions $r+1$, are generalized to similar results in arbitrary dimension, for polynomial…
The construction of $r$-nets offers a powerful tool in computational and metric geometry. We focus on high-dimensional spaces and present a new randomized algorithm which efficiently computes approximate $r$-nets with respect to Euclidean…
The Generalized Riemann Problems (GRP) for nonlinear hyperbolic systems of balance laws in one space dimension are now well-known and can be formulated as follows: Given initial-data which are smooth on two sides of a discontinuity,…
We study the minimization of fixed-degree polynomials over the simplex. This problem is well-known to be NP-hard, as it contains the maximum stable set problem in graph theory as a special case. In this paper, we consider a rational…
We show that the decision problem of determining whether a given (abstract simplicial) $k$-complex has a geometric embedding in $\mathbb R^d$ is complete for the Existential Theory of the Reals for all $d\geq 3$ and $k\in\{d-1,d\}$. This…
Solutions to vacuum Einstein field equations with cosmological constant, such as the de Sitter space and the anti-de Sitter space, are basic in different cosmological and theoretical developments. It is also well known that complex…
The Nyman-Beurling criterion, equivalent to the Riemann hypothesis (RH), is an approximation problem in the space of square integrable functions on $(0,\infty)$, involving dilations of the fractional part function by factors…
Efficient algorithms for many problems in optimization and computational algebra often arise from casting them as systems of polynomial equations. Blum, Shub, and Smale formalized this as Hilbert's Nullstellensatz Problem $HN_R$: given…
De Bruijn and Newman introduced a deformation of the Riemann zeta function $\zeta(s)$, and found a real constant $\Lambda$ which encodes the movement of the zeros of $\zeta(s)$ under the deformation. The Riemann hypothesis (RH) is…
Motivated by the concept of Euclidean Distance Degree, which measures the complexity of finding the nearest point to an algebraic set in Euclidean space, we introduce the notion of Grassmann Distance Complexity (GDC). This concept…
In 1987 Hiroshi Maehara conjectured that a graph can be represented by vectors considered adjacent when not orthogonal (a faithful orthogonal representation) in codimension the minimum degree of the graph. Without settling the conjecture,…
The gravitational field equations in general relativity (GR) consist of a sophisticated system of nonlinear partial differential equations. Solving such equations in some generic off-diagonal forms is usually a hard analytic or numeric…
Assuming that the Generalized Riemann Hypothesis (GRH) holds, we prove an explicit formula for the number of representations of an integer as a sum of $k\geq 5$ primes. Our error terms in such a formula improve by some logarithmic factors…
Assuming GRH, we prove an explicit upper bound for the number of zeros of a Dedekind zeta function having imaginary part in $[T-a,T+a]$. We also prove a bound for the multiplicity of the zeros.
In the present paper we show a dichotomy theorem for the complexity of polynomial evaluation. We associate to each graph H a polynomial that encodes all graphs of a fixed size homomorphic to H. We show that this family is computable by…
Let $X$ be a smooth projective variety over an algebraically closed field of arbitrary characteristic, and $f$ a dynamical correspondence of $X$. In 2016, the second author conjectured that the dynamical degrees of $f$ defined by the…
The NP-hard Metric Dimension problem is to decide for a given graph G and a positive integer k whether there is a vertex subset of size at most k that separates all vertex pairs in G. Herein, a vertex v separates a pair {u,w} if the…
We develop a theory for the existence of perfect matchings in hypergraphs under quite general conditions. Informally speaking, the obstructions to perfect matchings are geometric, and are of two distinct types: 'space barriers' from convex…
We consider the simplicial de Rham complex and the \v{C}ech-de Rham complex, two bigraded Hilbert complexes whose Hodge-Laplace problems govern spatially coupled problems in mixed dimension and homogeneous dimension, respectively. The…
We introduce a general notion of "genericity" for countable subsets of a space with Borel measure, and apply it to the set of vertices in the curve complex of a surface S, interpreted as subset of the space of projective measured…