English
Related papers

Related papers: Beyond Bilinear Complexity: What Works and What Br…

200 papers

Low-rank tensors appear to be prosperous in many applications. However, the sets of bounded-rank tensors are non-smooth and non-convex algebraic varieties, rendering the low-rank optimization problems to be challenging. To this end, we…

Optimization and Control · Mathematics 2024-11-22 Bin Gao , Renfeng Peng , Ya-xiang Yuan

Comon's conjecture on the equality of the rank and the symmetric rank of a symmetric tensor, and Strassen's conjecture on the additivity of the rank of tensors are two of the most challenging and guiding problems in the area of tensor…

Algebraic Geometry · Mathematics 2018-10-23 Alex Casarotti , Alex Massarenti , Massimiliano Mella

Higher-order tensors are becoming prevalent in many scientific areas such as computer vision, social network analysis, data mining and neuroscience. Traditional tensor decomposition approaches face three major challenges: model selecting,…

Numerical Analysis · Computer Science 2014-07-08 Fanhua Shang , Yuanyuan Liu , James Cheng

We study the complexity of isomorphism problems for d-way arrays, or tensors, under natural actions by classical groups such as orthogonal, unitary, and symplectic groups. Such problems arise naturally in statistical data analysis and…

Computational Complexity · Computer Science 2024-08-13 Zhili Chen , Joshua A. Grochow , Youming Qiao , Gang Tang , Chuanqi Zhang

In the paper we describe complexes whose homologies are naturally isomorphic to the first term of the Vassiliev spectral sequence computing (co)homology of the spaces of long knots in R^d, d>=3. The first term of the Vassiliev spectral…

Quantum Algebra · Mathematics 2007-05-23 V. Tourtchine

For nonnegative integers $n_2, n_3$ and $d$, let $N(n_2,n_3,d)$ denote the maximum cardinality of a code of length $n_2+n_3$, with $n_2$ binary coordinates and $n_3$ ternary coordinates (in this order) and with minimum distance at least…

Combinatorics · Mathematics 2018-04-03 Bart Litjens

We show that sharp thresholds for Boolean functions directly imply average-case circuit lower bounds. More formally we show that any Boolean function exhibiting a sharp enough threshold at \emph{arbitrary} critical density cannot be…

Computational Complexity · Computer Science 2024-07-17 David Gamarnik , Elchanan Mossel , Ilias Zadik

Tusn\'ady's problem asks to bound the discrepancy of points and axis-parallel boxes in $\mathbb{R}^d$. Algorithmic bounds on Tusn\'ady's problem use a canonical decomposition of Matou\v{s}ek for the system of points and axis-parallel boxes,…

Computational Geometry · Computer Science 2022-02-11 Kunal Dutta

Motivated by topological Tverberg-type problems and by classical results about embeddings (maps without double points), we study the question whether a finite simplicial complex K can be mapped into R^d without triple, quadruple, or, more…

Geometric Topology · Mathematics 2015-08-13 Isaac Mabillard , Uli Wagner

Many datasets in scientific and engineering applications are comprised of objects which have specific geometric structure. A common example is data which inhabits a representation of the group SO$(3)$ of 3D rotations: scalars, vectors,…

Machine Learning · Computer Science 2023-03-21 Chase Shimmin , Zhelun Li , Ema Smith

We prove that if $G$ is the graph of a connected triangulated $(d-1)$-manifold, for $d\geq 3$, then $G$ is generically globally rigid in $\mathbb R^d$ if and only if it is $(d+1)$-connected and, if $d=3$, $G$ is not planar. The special case…

Combinatorics · Mathematics 2024-09-26 James Cruickshank , Bill Jackson , Shin-ichi Tanigawa

Tensor completion recovers a multi-dimensional array from a limited number of measurements. Using the recently proposed tensor ring (TR) decomposition, in this paper we show that a d-order tensor of dimensional size n and TR rank r can be…

Machine Learning · Computer Science 2020-03-17 Huyan Huang , Yipeng Liu , Ce Zhu

We provide guarantees for learning latent variable models emphasizing on the overcomplete regime, where the dimensionality of the latent space can exceed the observed dimensionality. In particular, we consider multiview mixtures, spherical…

Machine Learning · Computer Science 2014-12-18 Animashree Anandkumar , Rong Ge , Majid Janzamin

We introduce a model of three-dimensional (3D) topological order enriched by planar subsystem symmetries. The model is constructed starting from the 3D toric code, whose ground state can be viewed as an equal-weight superposition of…

Strongly Correlated Electrons · Physics 2020-09-09 David T. Stephen , José Garre-Rubio , Arpit Dua , Dominic J. Williamson

Tensors, or multi-linear forms, are important objects in a variety of areas from analytics, to combinatorics, to computational complexity theory. Notions of tensor rank aim to quantify the "complexity" of these forms, and are thus also…

Computational Complexity · Computer Science 2023-06-16 Mandar Juvekar , Arian Nadjimzadah

Let $f$ be a homogeneous polynomial over a field. For many fields, including number fields and function fields, we prove that the strength of $f$ is bounded above by a constant multiple of the Birch rank of $f.$ The constant depends only on…

Number Theory · Mathematics 2025-09-03 Benjamin Baily , Amichai Lampert

A wide and natural class of closed currents - which are differences of positive closed currents - can be constructed by pulling back smooth closed forms using rational maps. These currents are very singular in general, and hence defining…

Complex Variables · Mathematics 2019-01-11 Tuyen Trung Truong

We present tight-binding models of 3D topological superconductors in class DIII that support a variety of winding numbers. We show that gapless Majorana surface states emerge at their boundary in agreement with the bulk-boundary…

Mesoscale and Nanoscale Physics · Physics 2015-06-22 Peter Finch , James de Lisle , Giandomenico Palumbo , Jiannis K. Pachos

Persistent tensors, introduced in [Quantum 8 (2024), 1238], and inspired by quantum information theory, form a recursively defined class of tensors that remain stable under the substitution method and thereby yield nontrivial lower bounds…

Algebraic Geometry · Mathematics 2025-10-10 Masoud Gharahi , Giorgio Ottaviani

For a matrix $M$ and a positive integer $r$, the rank $r$ rigidity of $M$ is the smallest number of entries of $M$ which one must change to make its rank at most $r$. There are many known applications of rigidity lower bounds to a variety…

Data Structures and Algorithms · Computer Science 2021-02-25 Josh Alman
‹ Prev 1 8 9 10 Next ›