English
Related papers

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

200 papers

We prove lower bounds of order $n\log n$ for both the problem to multiply polynomials of degree $n$, and to divide polynomials with remainder, in the model of bounded coefficient arithmetic circuits over the complex numbers. These lower…

Computational Complexity · Computer Science 2007-05-23 Peter Buergisser , Martin Lotz

We consider the algebra of invariants of $d$-tuples of $n\times n$ matrices under the action of the orthogonal group by simultaneous conjugation over an infinite field of characteristic $p$ different from two. It is well-known that this…

Rings and Algebras · Mathematics 2021-11-16 Artem Lopatin

We give upper bounds on limit multiplicities of certain non-tempered representations of unitary groups $U(a,b)$. These include some cohomological representations, and we give applications to the growth of cohomology of cocompact arithmetic…

Representation Theory · Mathematics 2023-10-11 Mathilde Gerbelli-Gauthier

Let G:=SO(n,1)^\circ and \Gamma be a geometrically finite Zariski dense subgroup with critical exponent delta bigger than (n-1)/2. Under a spectral gap hypothesis on L^2(\Gamma \ G), which is always satisfied for delta>(n-1)/2 for n=2,3 and…

Number Theory · Mathematics 2013-06-18 Amir Mohammadi , Hee Oh

We study the complexity of multiplication in noncommutative group algebras which is closely related to the complexity of matrix multiplication. We characterize such semisimple group algebras of the minimal bilinear complexity and show…

Computational Complexity · Computer Science 2010-03-25 Alexey Pospelov

We establish basic information about border rank algorithms for the matrix multiplication tensor and other tensors with symmetry. We prove that border rank algorithms for tensors with symmetry (such as matrix multiplication and the…

Algebraic Geometry · Mathematics 2016-02-01 J. M. Landsberg , Mateusz Michałek

The breakthrough paper of Croot, Lev, Pach \cite{CLP} on progression-free sets in $\Z_4^n$ introduced a polynomial method that has generated a wealth of applications, such as Ellenberg and Gijswijt's solutions to the cap set problem…

Combinatorics · Mathematics 2017-01-26 Pierre-Yves Bienvenu

Let G be a semisimple Lie group with associated symmetric space D, and let Gamma subset G be a cocompact arithmetic group. Let L be a lattice inside a Z Gamma-module arising from a rational finite-dimensional complex representation of G.…

Number Theory · Mathematics 2016-08-23 Avner Ash , Paul E. Gunnells , Mark McConnell , Dan Yasaki

Recently, the first two authors proved the Alon-Jaeger-Tarsi conjecture on non-vanishing linear maps, for large primes. We extend their ideas to address several other related conjectures. We prove the weak Additive Basis conjecture proposed…

Combinatorics · Mathematics 2021-11-29 János Nagy , Péter Pál Pach , István Tomon

In 2016, Ellenberg and Gijswijt established a new upper bound on the size of subsets of $\mathbb{F}^n_q$ with no three-term arithmetic progression. This problem has received much mathematical attention, particularly in the case $q = 3$,…

Logic in Computer Science · Computer Science 2019-07-03 Sander R. Dahmen , Johannes Hölzl , Robert Y. Lewis

Motivated by fast matrix multiplication and recent connections between asymptotic tensor rank and fine-grained complexity, we revisit classical tools from the matrix multiplication literature and develop a framework for obtaining improved…

Computational Complexity · Computer Science 2026-05-22 Josh Alman , Baitian Li

Generalising Solomon's theorem, C. Gordon and F. Rodriguez-Villegas have proven recently that, in any group, the number of solutions to a system of coefficient-free equations is divisible by the order of this group whenever the rank of the…

Group Theory · Mathematics 2017-05-02 Anton A. Klyachko , Anna A. Mkrtchyan

For a fixed finite solvable group $G$ and number field $K$, we prove an upper bound for the number of $G$-extensions $L/K$ with restricted local behavior (at infinitely many places) and ${\rm inv}(L/K)<X$ for a general invariant $"{\rm…

Number Theory · Mathematics 2019-12-13 Brandon Alberts

We obtain a non--trivial upper bound for the multiplicative energy of any sufficiently large subset of a subvariety of a finite algebraic group. We also find some applications of our results to growth of conjugates classes, estimates of…

Combinatorics · Mathematics 2021-01-26 Ilya D. Shkredov

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 will introduce a family $\Gamma_\beta, 1 < \beta \in {\mathbb{R}}$ of infinite non-amenable discrete groups as an interpolation of the Higman-Thompson groups $V_n, 1 < n \in {\mathbb{N}}$ by using the topological full groups of the…

Operator Algebras · Mathematics 2019-02-20 Kengo Matsumoto , Hiroki Matui

We study the topos of sets equipped with an action of the monoid of regular $2 \times 2$ matrices over the integers. In particular, we show that the topos-theoretic points are given by the double quotient $\left. GL_2(\hat{\mathbb{Z}})…

Algebraic Geometry · Mathematics 2019-08-07 Jens Hemelaer

Let K/Q be Galois, and let eta in K* whose conjugates are multiplicatively independent. For a prime p, unramified, prime to eta, let np be the residue degree of p and gp the number of P I p, then let o\_P(eta) and o\_p(eta) be the orders of…

Number Theory · Mathematics 2021-08-06 Georges Gras

A group is irreducibly represented if it has a faithful irreducible unitary representation. For countable groups, a criterion for irreducible representability is given, which generalises a result obtained for finite groups by W. Gasch\"utz…

Group Theory · Mathematics 2015-02-04 Bachir Bekka , Pierre de la Harpe

We study the number of $s$-element subsets $J$ of a given abelian group $G$, such that $|J+J|\leq K|J|$. Proving a conjecture of Alon, Balogh, Morris and Samotij, and improving a result of Green and Morris, who proved the conjecture for $K$…

Combinatorics · Mathematics 2019-05-06 Marcelo Soares Campos