Related papers: $\exists\mathbb{R}$-Completeness of Tensor Degener…

Mather and Yau showed that an isolated complex hypersurface singularity is completely determined by its moduli algebra. It is shown, for the simple elliptic singularities, how to construct continuous invariants from the moduli algebras and,…

This paper is concerned with certifying that a given point is near an exact root of an overdetermined or singular polynomial system with rational coefficients. The difficulty lies in the fact that consistency of overdetermined systems is…

Nonuniformity is a central concept in computational complexity with powerful connections to circuit complexity and randomness. Nonuniform reductions have been used to study the isomorphism conjecture for NP and completeness for larger…

Let $\mathbb{R}$ be the field of real numbers. We consider the problem of computing the real isolated points of a real algebraic set in $\mathbb{R}^n$ given as the vanishing set of a polynomial system. This problem plays an important role…

We introduce two generalizations of Newton-non-degenerate (Nnd) singularities of hypersurfaces. Roughly speaking, an isolated hypersurface singularity is called topologically Newton-non-degenerate (tNnd) if the local embedded topological…

A "tensor space" is a vector space equipped with a finite collection of multi-linear forms. In previous work, we showed that (for each signature) there exists a universal homogeneous tensor space, which is unique up to isomorphism. Here we…

This work studies the problem of maximizing a higher degree real homogeneous multivariate polynomial over the unit sphere. This problem is equivalent to finding the leading eigenvalue of the associated symmetric tensor of higher order,…

Motivated by questions arising in signal processing, computational complexity, and other areas, we study the ranks and border ranks of symmetric tensors using geometric methods. We provide improved lower bounds for the rank of a symmetric…

We study integer-valued matrices with bounded determinants. Such matrices appear in the theory of integer programs (IP) with bounded determinants. For example, Artmann et al. showed that an IP can be solved in strongly polynomial time if…

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…

We deploy algebraic complexity theoretic techniques for constructing symmetric determinantal representations of for00504925mulas and weakly skew circuits. Our representations produce matrices of much smaller dimensions than those given in…

A real symmetric matrix (resp., tensor) is said to be copositive if the associated quadratic (resp., homogeneous) form is greater than or equal to zero over the nonnegative orthant. The problem of detecting their copositivity is NP-hard.…

In this article, we consider a class of degenerate singular problems. The degeneracy is captured by the presence of a class of $p$-admissible weights, which may vanish or blow up near the origin. Further, the singularity is allowed to vary…

Motivated by a recent result of Elberfeld, Jakoby and Tantau showing that $\mathsf{MSO}$ properties are Logspace computable on graphs of bounded tree-width, we consider the complexity of computing the determinant of the adjacency matrix of…

The problem of determining whether a diagonally dominant matrix is singular or nonsingular is a classical topic in matrix theory. This paper develops necessary and sufficient conditions for the singularity or nonsingularity of diagonally…

Let M be ternary, homogeneous and simple. We prove that if M is finitely constrained, then it is supersimple with finite SU-rank and dependence is $k$-trivial for some $k < \omega$ and for finite sets of real elements. Now suppose that, in…

In this work, the determinants of matrices constructed by evaluating homogeneous bivariate polynomials at pairs of vectors are investigated. For a polynomial $p(x,y)=\sum\limits_{i=0}^k \alpha_i x^{k-i}y^i$, an explicit factorization of the…

In this work we provide a definition of the constraint tensor of a null hypersurface data which is completely explicit in the extrinsic geometry of the hypersurface. The definition is fully covariant and applies for any topology of the…

We present a rigorous mathematical treatment of Ruppeiner geometry, by considering degenerate Hessian metrics defined on radiant manifolds. A manifold $M$ is said to be radiant if it is endowed with a symmetric, flat connection $\bar\nabla$…

One of the great miracles of random matrix theory is that, in the $N \to \infty$ limit, many otherwise intractable matrix problems with horrendously complicated finite-$N$ expressions admit remarkably simple and elegant asymptotic…