English
Related papers

Related papers: Geometric Complexity Theory and Tensor Rank

200 papers

We develop the theory of maximal representations of the fundamental group of a compact connected oriented surface with boundary, into a group of Hermitian type. For any such representation we define the Toledo invariant, for which we…

Differential Geometry · Mathematics 2008-09-15 Marc Burger , Alessandra Iozzi , Anna Wienhard

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…

Algebraic Geometry · Mathematics 2009-09-28 J. M. Landsberg , Zach Teitler

We provide a nontrivial bound on the rank of any tensor $T$ over the quaternions $\mathbb{H}$ in the $n_1\times n_2\times n_3$ cases where $2\leq n_i\leq 3$. We describe a decomposition of $T$ into $3$ simple tensors in the $2\times 2\times…

Rings and Algebras · Mathematics 2021-03-04 YG Liang , Sergio Da Silva , Yang Zhang

In two papers, B\"urgisser and Ikenmeyer (STOC 2011, STOC 2013) used an adaption of the geometric complexity theory (GCT) approach by Mulmuley and Sohoni (Siam J Comput 2001, 2008) to prove lower bounds on the border rank of the matrix…

Computational Complexity · Computer Science 2020-02-04 Nick Fischer , Christian Ikenmeyer

For fixed compact connected Lie groups H \subseteq G, we provide a polynomial time algorithm to compute the multiplicity of a given irreducible representation of H in the restriction of an irreducible representation of G. Our algorithm is…

Computational Complexity · Computer Science 2012-10-31 Matthias Christandl , Brent Doran , Michael Walter

Our purpose is to investigate the local boundedness, the upper semicontinuity, and the stability of the solution map of tensor complementarity problems. To do this, we focus on the set of R$_0$--tensors and show that this set plays an…

Optimization and Control · Mathematics 2018-11-27 Vu Trung Hieu

Using the general framework of polynomial representations defined by Doty and generalizing the definition given by Doty, Nakano and Peters for $G = \mathrm{GL}_n$, we consider polynomial representations of $G_r T$ for an arbitrary closed…

Representation Theory · Mathematics 2017-03-22 Christian Drenkhahn

Let $H$ be a connected reductive subgroup of a complex connected reductive group $G$. Fix maximal tori and Borel subgroups of $H$ and $G$. Consider the pairs $(V,V')$ of irreducible representations of $H$ and $G$ such that $V$ is a…

Algebraic Geometry · Mathematics 2010-09-15 Nicolas Ressayre

Given a finite group $G$ and two unitary $G$-representations $V$ and $W$, possible restrictions on Brouwer degrees of equivariant maps between representation spheres $S(V)$ and $S(W)$ are usually expressed in a form of congruences modulo…

Representation Theory · Mathematics 2017-06-12 Zalman Balanov , Mikhail Muzychuk , Hao-pin Wu

We investigate the computational complexity of tensor rank, a concept that plays fundamental role in different topics of modern applied mathematics. For tensors over any integral domain, we prove that the rank problem is polynomial time…

Combinatorics · Mathematics 2016-11-08 Yaroslav Shitov

In recent studies, the tensor ring (TR) rank has shown high effectiveness in tensor completion due to its ability of capturing the intrinsic structure within high-order tensors. A recently proposed TR rank minimization method is based on…

Computer Vision and Pattern Recognition · Computer Science 2020-05-21 Meng Ding , Ting-Zhu Huang , Xi-Le Zhao , Tian-Hui Ma

This paper lies in the intersection of several fields: number theory, lattice theory, multilinear algebra, and scientific computing. We adapt existing solution algorithms for tensor eigenvalue problems to the tensor-train framework. As an…

Numerical Analysis · Mathematics 2017-10-05 Harri Hakula , Pauliina Ilmonen , Vesa Kaarnioja

A well studied problem in algebraic complexity theory is the determination of the complexity of problems relying on evaluations of bilinear maps. One measure of the complexity of a bilinear map (or 3-tensor) is the optimal number of…

Information Theory · Computer Science 2021-03-23 Eimear Byrne , Giuseppe Cotardo

We consider a series of four subexceptional representations coming from the third line of the Freudenthal-Tits magic square; using Bourbaki notation, these are fundamental representations $(G',X)$ corresponding to $(C_3, \omega_3),\, (A_5,…

Algebraic Geometry · Mathematics 2021-06-24 András C. Lőrincz , Jerzy Weyman

We study the tensor rank of the tensor corresponding to the algebra of n-variate complex polynomials modulo the dth power of each variable. As a result we find a sequence of tensors with a large gap between rank and border rank, and thus a…

Commutative Algebra · Mathematics 2017-03-24 Jeroen Zuiddam

For a subgroup $H$ of a reductive group $G$, let $\mathfrak m\subset \mathfrak g^*$ be the cotangent space of $eH\in G/H$. The linear action $(H:\mathfrak m)$ is the coisotropy representation. It is known that the complexity and rank of…

Representation Theory · Mathematics 2024-12-31 Dmitri I. Panyushev

We construct a lower bound of the tensor rank for a new class of tensors, which we call persistent tensors. We present three specific families of persistent tensors, of which the lower bound is tight. We show that there is a chain of…

Quantum Physics · Physics 2024-02-07 Masoud Gharahi , Vladimir Lysikov

The geometry of the set of restrictions of rank-one tensors to some of their coordinates is studied. This gives insight into the problem of rank-one completion of partial tensors. Particular emphasis is put on the semialgebraic nature of…

Algebraic Geometry · Mathematics 2017-02-22 Thomas Kahle , Kaie Kubjas , Mario Kummer , Zvi Rosen

First, I construct an isomorphism between the categories of (topological) groups of nilpotency class 2 with 2-divisible center and (topological) Lie rings of nilpotency class 2 with 2-divisible center. That isomorphism allows us to…

Representation Theory · Mathematics 2007-05-23 Aleksandrs Mihailovs

In 2003, Cohn and Umans described a framework for proving upper bounds on the exponent $\omega$ of matrix multiplication by reducing matrix multiplication to group algebra multiplication, and in 2005 Cohn, Kleinberg, Szegedy, and Umans…