Related papers: Maximal Border Subrank Tensors
We produce an upper bound for the Hausdorff dimension of the graph of a Weierstrass-type function. Whilst strictly weaker than existing results, it has the advantage of being directly computable from the theory of hyperbolic iterated…
We obtain a new upper bound for binary sums with multiplicative characters over variables belong to some sets, having small additive doubling.
Positive semidefinite rank (PSD-rank) is a relatively new quantity with applications to combinatorial optimization and communication complexity. We first study several basic properties of PSD-rank, and then develop new techniques for…
The subrank of tensors is a measure of how much a tensor can be ''diagonalized''. This parameter was introduced by Strassen to study fast matrix multiplication algorithms in algebraic complexity theory and is closely related to many central…
We compute lower bounds on the virtual crossing number and minimal surface genus of virtual knot diagrams from the arrow polynomial. In particular, we focus on several interesting examples.
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…
We prove the lower bound R(M_m) \geq 3/2 m^2 - 2 on the border rank of m x m matrix multiplication by exhibiting explicit representation theoretic (occurence) obstructions in the sense of the geometric complexity theory (GCT) program. While…
We develop deterministic perturbation bounds for singular values and vectors of orthogonally decomposable tensors, in a spirit similar to classical results for matrices such as those due to Weyl, Davis, Kahan and Wedin. Our bounds…
We introduce a method for transforming low-order tensors into higher-order tensors and apply it to tensors defined by graphs and hypergraphs. The transformation proceeds according to a surgery-like procedure that splits vertices, creates…
We establish general bounds on the topology of free boundary minimal surfaces obtained via min-max methods in compact, three-dimensional ambient manifolds with mean convex boundary. We prove that the first Betti number is lower…
In this paper, the boundedness of some sublinear operators is proved on homogeneous Herz-Morrey spaces with variable exponent.
Let K be a field of characteristic different from 2 and let V be a vector space of dimension n over K. Let M be a non-zero subspace of symmetric bilinear forms defined on V x V and let r=rank(M) denote the set of different positive integers…
We prove necessary and sufficient conditions for the weak-$L^p$ boundedness, for $p \in (1,\infty)$, of a maximal operator on the infinite-dimensional torus. In the endpoint case $p=1$ we obtain the same weak-type inequality enjoyed by the…
Due to the explosive growth of large-scale data sets, tensors have been a vital tool to analyze and process high-dimensional data. Different from the matrix case, tensor decomposition has been defined in various formats, which can be…
We bound the number of minimal hypergraph transversals that arise in tri-partite 3-uniform hypergraphs, a class commonly found in applications dealing with data. Let H be such a hypergraph on a set of vertices V. We give a lower bound of…
We write down an explicit sequence of tensors in $C^m\otimes C^m\otimes C^m$, for all $m$ sufficiently large, having border rank at least $2.02m$, overcoming a longstanding barrier. We obtain our lower bounds via the border substitution…
We present a new bound on $A = \max_n |a_{pqr}(n)|$, where $a_{pqr}(n)$ are the coefficients of a ternary cyclotomic polynomial. We also prove that two consecutive coefficients of such a polynomial differ by at most one.
A new proof of the classification for tensor ideal thick subcategories of the bounded derived category, and the stable category, of modular representations of a finite group is obtained. The arguments apply more generally to yield a…
We prove polynomial upper and lower bounds on the expected size of the maximum agreement subtree of two random binary phylogenetic trees under both the uniform distribution and Yule-Harding distribution. This positively answers a question…
In this paper we prove some lower bounds on the Hausdorff dimension of sets of Furstenberg type. Moreover, we extend these results to sets of generalized Furstenberg type, associated to doubling dimension functions. With some additional…