English
Related papers

Related papers: On cap sets and the group-theoretic approach to ma…

200 papers

Cameron and Erd\H{o}s asked whether the number of \emph{maximal} sum-free sets in $\{1, \dots , n\}$ is much smaller than the number of sum-free sets. In the same paper they gave a lower bound of $2^{\lfloor n/4 \rfloor }$ for the number of…

Combinatorics · Mathematics 2018-05-14 József Balogh , Hong Liu , Maryam Sharifzadeh , Andrew Treglown

In a paper published in 1981, Sch\"onhage showed that large total matrix multiplications can be reduced to powers of partial matrix multiplication tensors, which correspond to the bilinear computation task of multiplying matrices with some…

Computational Complexity · Computer Science 2024-08-29 Péter Vrana

We obtain new uniform upper bounds for the (non necessarily symmetric) tensor rank of the multiplication in the extensions of the finite fields $\F_q$ for any prime or prime power $q\geq2$; moreover these uniform bounds lead to new…

Algebraic Geometry · Mathematics 2015-12-31 Julia Pieltant , Hugues Randriam

T. De Medts, Y. Segev and K. Tent [Special Moufang sets, their root groups and their \mu-maps, Proc. Lond. Math. Soc. (3) 96 (2008), 767-791] proved that the little projective group of a special Moufang set M(U,\tau) is perfect provided…

Group Theory · Mathematics 2011-09-01 Anja Steinbach

Ellenberg and Gijswijt gave the best known asymptotic upper bound for the cardinality of subsets of $\mathbb F_q^n$ without 3-term arithmetic progressions. We improve this bound by a factor $\sqrt{n}$. In the case $q=3$, we also obtain more…

Combinatorics · Mathematics 2023-01-09 Zhi Jiang

A classical result of J\o rgensen and Thurston shows that the set of volumes of finite volume complete hyperbolic $3$-manifolds is a well-ordered subset of the real numbers of order type~$\omega^\omega$; moreover, each volume can only be…

Group Theory · Mathematics 2023-04-11 Clara Loeh

The Multiplicity conjecture of Herzog, Huneke, and Srinivasan states an upper bound for the multiplicity of any graded $k$-algebra as well as a lower bound for Cohen-Macaulay algebras. In this note we extend this conjecture in several…

Commutative Algebra · Mathematics 2007-05-23 Juan Migliore , Uwe Nagel , Tim Roemer

Let V be an n-dimensional vector space and let On be the orthogonal group. Motivated by a question of B. Szegedy (B. Szegedy, Edge coloring models and reflection positivity, Journal of the American Mathematical Society Volume 20, Number 4,…

Combinatorics · Mathematics 2012-09-20 Jan Draisma , Guus Regts

Let $A$ denote the alternation limit algebra, studied by Hopenwasser and Power, and by Poon, which is the closed direct limit of upper triangular matrix algebras determined by refinement embeddings of multiplicity $r_k$ and standard…

funct-an · Mathematics 2016-08-31 S. C. Power

Let $M_{\langle u,v,w\rangle}\in C^{uv}\otimes C^{vw}\otimes C^{wu}$ denote the matrix multiplication tensor (and write $M_n=M_{\langle n,n,n\rangle}$) and let $det_3\in ( C^9)^{\otimes 3}$ denote the determinant polynomial considered as a…

Algebraic Geometry · Mathematics 2019-11-20 Austin Conner , Alicia Harper , J. M. Landsberg

Consider a graph on the non-singular matrices over a finite field, in which two distinct non-singular matrices are joined by an edge whenever their sum is singular. We prove an upper bound for the independence number of this graph. As a…

Combinatorics · Mathematics 2024-05-15 Bogdan Nica

By definition, a rigid graph in $\mathbb{R}^d$ (or on a sphere) has a finite number of embeddings up to rigid motions for a given set of edge length constraints. These embeddings are related to the real solutions of an algebraic system.…

Combinatorics · Mathematics 2021-10-26 Evangelos Bartzos , Ioannis Z. Emiris , Raimundas Vidunas

We consider operator-valued polynomials in Gaussian Unitary Ensemble random matrices and we show that its $L^p$-norm can be upper bounded, up to an asymptotically small error, by the operator norm of the same polynomial evaluated in free…

Probability · Mathematics 2024-10-31 Félix Parraud

We identify a class of smooth Banach *-algebras that are differential subalgebras of commutative C*-algebras whose openness of multiplication is completely determined by the topological stable rank of the target C*-algebra. We then show…

Operator Algebras · Mathematics 2024-11-27 Tomasz Kania , Natalia Maślany

Whereas matrix rank is additive under direct sum, in 1981 Sch\"onhage showed that one of its generalizations to the tensor setting, tensor border rank, can be strictly subadditive for tensors of order three. Whether border rank is additive…

Algebraic Geometry · Mathematics 2021-04-12 Matthias Christandl , Fulvio Gesmundo , Mateusz Michałek , Jeroen Zuiddam

The conjecture of Brown, Erd\H{o}s and S\'os from 1973 states that, for any $k \ge 3$, if a $3$-uniform hypergraph $H$ with $n$ vertices does not contain a set of $k+3$ vertices spanning at least $k$ edges then it has $o(n^2)$ edges. The…

Combinatorics · Mathematics 2019-05-07 Rajko Nenadov , Benny Sudakov , Mykhaylo Tyomkyn

Gaussian graphical models have become a well-recognized tool for the analysis of conditional independencies within a set of continuous random variables. From an inferential point of view, it is important to realize that they are composite…

Statistics Theory · Mathematics 2013-10-30 Jan Draisma , Sonja Kuhnt , Piotr Zwiernik

In this paper, we give strong lower bounds on the size of the sets of products of matrices in some certain groups. More precisely, we prove an analogue of a result due to Chapman and Iosevich for matrices in $SL_2(\mathbb{F}_p)$ with…

Number Theory · Mathematics 2018-03-29 Doowon Koh , Thang Pham , Chun-Yen Shen , Le Anh Vinh

It has been recently proved (by Croot, Lev and Pach and the subsequent work by Ellenberg and Gijswijt) that for a group $G=G_0^n$, where $G_0\ne \{1,-1\}^m$ is a fixed finite Abelian group and $n$ is large, any subset $A$ without…

Combinatorics · Mathematics 2020-04-20 Fedor Petrov

We revisit the main result of Carmosino et al \cite{CILM18} which shows that an $\Omega(n^{\omega/2+\epsilon})$ size noncommutative arithmetic circuit size lower bound (where $\omega$ is the matrix multiplication exponent) for a…

Computational Complexity · Computer Science 2023-08-10 V. Arvind , Abhranil Chatterjee