English
Related papers

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

200 papers

Programs that combine I/O and countable probabilistic choice, modulo either bisimilarity or trace equivalence, can be seen as describing a probabilistic strategy. For well-founded programs, we might expect to axiomatize bisimilarity via a…

Logic in Computer Science · Computer Science 2025-08-22 Nathan Bowler , Sergey Goncharov , Paul Blain Levy

We classify transcendental entire functions that are compositions of a polynomial and the exponential for which all singular values escape on disjoint rays. We focus on the case where the escape is degenerate in the sense that points from…

Dynamical Systems · Mathematics 2021-04-27 Konstantin Bogdanov

An important yet challenging problem in numerical linear algebra is finding a principal submatrix with maximum determinant from a given symmetric positive semidefinite matrix. This problem arises in experimental design, statistics, and…

Optimization and Control · Mathematics 2026-05-26 Hao Hu , Stefan Sremac , Hugo J. Woerdeman , Henry Wolkowicz

In this paper, we analyze the fundamental conditions for low-rank tensor completion given the separation or tensor-train (TT) rank, i.e., ranks of unfoldings. We exploit the algebraic structure of the TT decomposition to obtain the…

Machine Learning · Computer Science 2017-03-23 Morteza Ashraphijuo , Xiaodong Wang

There is an interesting potential theory associated to each degenerate elliptic, fully nonlinear equation $f(D^2u) = 0$. These include all the potential theories attached to calibrated geometries. This paper begins the study of tangents to…

Analysis of PDEs · Mathematics 2016-06-20 F. Reese Harvey , H. Blaine Lawson

Let T be a general complex tensor of format $(n_1,...,n_d)$. When the fraction $\prod_in_i/[1+\sum_i(n_i-1)]$ is an integer, and a natural inequality (called balancedness) is satisfied, it is expected that T has finitely many minimal…

Algebraic Geometry · Mathematics 2025-10-17 Jonathan D. Hauenstein , Luke Oeding , Giorgio Ottaviani , Andrew J. Sommese

We consider the problem of low canonical polyadic (CP) rank tensor completion. A completion is a tensor whose entries agree with the observed entries and its rank matches the given CP rank. We analyze the manifold structure corresponding to…

Machine Learning · Computer Science 2017-04-03 Morteza Ashraphijuo , Xiaodong Wang

Given a real cubic form f(x,y,z), there is a pseudo-Riemannian metric given by its Hessian matrix, defined on the open subset of R^3 where the Hessian determinant h is non-zero. We determine the full curvature tensor of this metric in terms…

Algebraic Geometry · Mathematics 2007-05-23 P. M. H. Wilson

Suppose we are given an $n$-dimensional order-3 symmetric tensor $T \in (\mathbb{R}^n)^{\otimes 3}$ that is the sum of $r$ random rank-1 terms. The problem of recovering the rank-1 components is possible in principle when $r \lesssim n^2$…

Computational Complexity · Computer Science 2023-03-28 Alexander S. Wein

In some significant applications such as data forecasting, the locations of missing entries cannot obey any non-degenerate distributions, questioning the validity of the prevalent assumption that the missing data is randomly chosen…

Information Theory · Computer Science 2019-09-09 Guangcan Liu , Qingshan Liu , Xiao-Tong Yuan , Meng Wang

An important building block in all current asymptotically fast algorithms for matrix multiplication are tensors with low border rank, that is, tensors whose border rank is equal or very close to their size. To find new asymptotically fast…

Computational Complexity · Computer Science 2016-08-25 Markus Bläser , Vladimir Lysikov

The degeneracy of central configurations in the planar $N$-body problem makes their enumeration problem hard and the related dynamics appealing. To truly understand the bifurcations of central configurations, we should work in the FULL…

Dynamical Systems · Mathematics 2026-02-12 Shanzhong Sun , Zhifu Xie , Peng You

We introduce a new consistency-based approach for defining and solving nonnegative/positive matrix and tensor completion problems. The novelty of the framework is that instead of artificially making the problem well-posed in the form of an…

Information Retrieval · Computer Science 2023-10-18 Tung Nguyen , Jeffrey Uhlmann

This paper has been withdrawn. Consider an isolated complex hypersurface singularity, f(x_1,..,x_n)=0. For Newton-non-degenerate singularities the local topology is completely determined by an associated polyhedral object, the Newton…

Algebraic Geometry · Mathematics 2014-01-29 Anna Gourevitch , Dmitry Kerner

We obtain the first polynomial-time algorithm for exact tensor completion that improves over the bound implied by reduction to matrix completion. The algorithm recovers an unknown 3-tensor with $r$ incoherent, orthogonal components in…

Machine Learning · Computer Science 2017-06-27 Aaron Potechin , David Steurer

We present a spectral theory of hypergraphs that closely parallels Spectral Graph Theory. A number of recent developments building upon classical work has led to a rich understanding of "hyperdeterminants" of hypermatrices, a.k.a.…

Combinatorics · Mathematics 2011-10-27 Joshua Cooper , Aaron Dutle

We survey the complexity class $\exists \mathbb{R}$, which captures the complexity of deciding the existential theory of the reals. The class $\exists \mathbb{R}$ has roots in two different traditions, one based on the Blum-Shub-Smale model…

Computational Complexity · Computer Science 2024-07-26 Marcus Schaefer , Jean Cardinal , Tillmann Miltzow

This paper shows that an arbitrary generic submanifold in a complex manifold can be deformed into a 1-parameter family of generic submanifolds satisfying strong nondegeneracy conditions. The proofs use a careful analysis of the jet spaces…

Complex Variables · Mathematics 2007-05-23 M. S. Baouendi , L. P. Rothschild , D. Zaitsev

We consider the problem of recovering a unitary eigendecomposition of a complex unitary matrix from that of its embedded real-valued formulation. Such formulations arise naturally in scientific computing workflows that employ…

Numerical Analysis · Mathematics 2026-05-20 Stefanie Günther , N. Anders Petersson

This doctoral thesis covers several topics related to the construction and study of maximal determinant matrices with complex entries. The first three chapters are devoted to number-theoretic tools to prove the non-solvability of Gram…

Combinatorics · Mathematics 2026-02-25 Guillermo Nuñez Ponasso