Searcharxiv⌕ Search

arXiv subjects

Martin Kassabov

Publications and source records attributed to Martin Kassabov.

At least 19 recordsLinked to original sources
arXiv2026

Disjoint and nearly disjoint sums of matrix multiplication tensors and their centroids

This paper addresses centroids, which are fundamental invariants of tensors. Our main results are as follows: (i) The construction of explicit tensors with very large centroids, whereas previously it had been conjectured that none such exist. (ii) An upper bound on the dimension of the centroid that is essentially attained by our examples. (iii) The development of a geometric technique to write down border rank decomposition of tensors using centroids and "extended centroids". (iv) The technique is applied to tensors of this paper to prove they are of minimal border rank. The technique is versatile and enables us to geometrically derive and improve upon previous ad hoc decompositions. (v) The construction of symmetric tensors with large centroids and proof that they are wild in the sense of Buczy\'nska-Buczy\'nski. Our results also pave the way for new upper bounds on the exponent of matrix multiplication. The geometric technique also constructs new "better" tensors for Strassen's laser method from old, and we apply this to the tensors of Strassen and Sch\"onhage to get better tensors in the sense that they give better upper bounds on the exponent than the original tensors.

math.AG↗
arXiv2026

Expander graphs are globally synchronizing

The Kuramoto model is fundamental to the study of synchronization. It consists of a collection of oscillators with interactions given by a network, which we identify respectively with vertices and edges of a graph. In this paper, we show that a graph with sufficient expansion must be globally synchronizing, meaning that a homogeneous Kuramoto model of identical oscillators on such a graph will converge to the fully synchronized state with all the oscillators having the same phase, for every initial state up to a set of measure zero. In particular, we show that for any $\varepsilon > 0$ and $p \geq (1 + \varepsilon) (\log n) / n$, the homogeneous Kuramoto model on the Erdős-Rényi random graph $G(n, p)$ is globally synchronizing with probability tending to one as $n$ goes to infinity. This improves on a previous result of Kassabov, Strogatz, and Townsend and solves a conjecture of Ling, Xu, and Bandeira. We also show that the model is globally synchronizing on any $d$-regular Ramanujan graph, and on typical $d$-regular graphs, for large enough degree $d$.

math.CO↗
arXiv2024

Monotone parameters on Cayley graphs of finitely generated groups

We construct a new large family of finitely generated groups with continuum many values of the following monotone parameters: spectral radius, critical percolation, and asymptotic entropy. We also present several open problems on other monotone parameters.

math.GR↗
arXiv2023

Property (T) and Many Quotients

We prove that, for the free algebra over a sufficiently rich operad, a large subgroup of its group of tame automorphisms has Kazhdan's property (T). We deduce that there exists a group with property (T) that maps onto large powers of alternating groups.

math.GR↗
arXiv2023

Tame automorphism groups of polynomial rings with property (T) and infinitely many alternating group quotients

We construct new families of groups with property (T) and infinitely many alternating group quotients. One of those consists of subgroups of $\mathrm{Aut}(\mathbf F_{p}[x_1, \dots, x_n])$ generated by a suitable set of tame automorphisms. Finite quotients are constructed using the natural action of $\mathrm{Aut}(\mathbf F_{p}[x_1, \dots, x_n])$ on the $n$-dimensional affine spaces over finite extensions of $\mathbf F_p$. As a consequence, we obtain explicit presentations of Gromov hyperbolic groups with property (T) and infinitely many alternating group quotients. Our construction also yields an explicit infinite family of expander Cayley graphs of degree $4$ for alternating groups of degree $p^7-1$ for any odd prime $p$.

math.GR↗
arXiv2022

A global synchronization theorem for oscillators on a random graph

Consider $n$ identical Kuramoto oscillators on a random graph. Specifically, consider \ER random graphs in which any two oscillators are bidirectionally coupled with unit strength, independently and at random, with probability $0\leq p\leq 1$. We say that a network is globally synchronizing if the oscillators converge to the all-in-phase synchronous state for almost all initial conditions. Is there a critical threshold for $p$ above which global synchrony is extremely likely but below which it is extremely rare? It is suspected that a critical threshold exists and is close to the so-called connectivity threshold, namely, $p\sim \log(n)/n$ for $n \gg 1$. Ling, Xu, and Bandeira made the first progress toward proving a result in this direction: they showed that if $p\gg \log(n)/n^{1/3}$, then \ER networks of Kuramoto oscillators are globally synchronizing with high probability as $n\rightarrow\infty$. Here we improve that result by showing that $p\gg \log^2(n)/n$ suffices. Our estimates are explicit: for example, we can say that there is more than a $99.9996\%$ chance that a random network with $n = 10^6$ and $p>0.01117$ is globally synchronizing.

math.DS↗
arXiv2021

Sufficiently dense Kuramoto networks are globally synchronizing

Consider any network of $n$ identical Kuramoto oscillators in which each oscillator is coupled bidirectionally with unit strength to at least $μ(n-1)$ other oscillators. There is a critical value of the connectivity, $μ_c$, such that whenever $μ>μ_c$, the system is guaranteed to converge to the all-in-phase synchronous state for almost all initial conditions, but when $μ<μ_c$, there are networks with other stable states. The precise value of the critical connectivity remains unknown, but it has been conjectured to be $μ_c=0.75$. In 2020, Lu and Steinerberger proved that $μ_c\leq 0.7889$, and Yoneda, Tatsukawa, and Teramae proved in 2021 that $μ_c > 0.6838$. In this paper, we prove that $μ_c\leq 0.75$ and explain why this is the best upper bound that one can obtain by a purely linear stability analysis.

math.DS↗
arXiv2020

Subgroups of simple groups are as diverse as possible

For a finite group $G$, let $σ(G)$ be the number of subgroups of $G$ and $σ_ι(G)$ the number of isomorphism types of subgroups of $G$. Let $L=L_r(p^e)$ denote a simple group of Lie type, rank $r$, over a field of order $p^e$ and characteristic $p$. If $r\neq 1$, $L\not\cong {^2 B_2}(2^{1+2m})$, then there are constants $c,d$, dependent on the Lie type, such that as $re$ grows $$p^{(c-o(1))r^4e^2}\leqσ_ι(L_r(p^e))\leqσ(L_r(p^e)) \leq p^{(d+o(1))r^4e^2}.$$ For type $A$, $c=d=1/64$. For other classical groups $1/64\leq c\leq d\leq 1/4$. For exceptional and twisted groups $1/2^{100}\leq c\leq d\leq 1/4$. Furthermore, $$2^{(1/36-o(1))k^2)}\leqσ_ι(\mathrm{Alt}_k)\leq σ(\mathrm{Alt}_k)\leq 24^{(1/6+o(1))k^2}.$$ For abelian and sporadic simple groups $G$, $σ_ι(G),σ(G)\in O(1)$. In general these bounds are best possible amongst groups of the same orders. Thus with the exception of finite simple groups with bounded ranks and field degrees, the subgroups of finite simple groups are as diverse as possible.

math.GR↗
arXiv2017

Soficity and variations on Higman's group

A group is sofic when every finite subset can be well approximated in a finite symmetric group. No example of a non-sofic group is known. Higman's group, which is a circular amalgamation of four copies of the Baumslag--Solitar group, is a candidate. Here we contribute to the discussion of the problem of its soficity in two ways. We construct variations on Higman's group replacing the Baumslag--Solitar group by other groups $G$. We give an elementary condition on $G$, enjoyed for example by $\mathbb{Z} \wr \mathbb{Z}$ and the integral Heisenberg group, under which the resulting group is sofic. We then use soficity to deduce that there exist permutations of $\mathbb{Z} / n\mathbb{Z}$ that are seemingly pathological in that they have order dividing four and yet locally they behave like exponential functions over most of their domains. Our approach is based on that of Helfgott and Juschenko, who recently showed the soficity of Higman's group would imply some the existence of some similarly pathological functions. Our results call into question their suggestion that this might be a step towards proving the existence of a non-sofic group.

math.GR↗
arXiv2017

Assembling homology classes in automorphism groups of free groups

The observation that a graph of rank $n$ can be assembled from graphs of smaller rank $k$ with $s$ leaves by pairing the leaves together leads to a process for assembling homology classes for $Out(F_n)$ and $Aut(F_n)$ from classes for groups $Γ_{k,s}$, where the $Γ_{k,s}$ generalize $Out(F_k)=Γ_{k,0}$ and $Aut(F_k)=Γ_{k,1}$. The symmetric group $Σ_s$ acts on $H_*(Γ_{k,s})$ by permuting leaves, and for trivial rational coefficients we compute the $Σ_s$-module structure on $H_*(Γ_{k,s})$ completely for $k \leq 2$. Assembling these classes then produces all the known nontrivial rational homology classes for $Aut(F_n)$ and $Out(F_n)$ with the possible exception of classes for $n=7$ recently discovered by L. Bartholdi. It also produces an enormous number of candidates for other nontrivial classes, some old and some new, but we limit the number of these which can be nontrivial using the representation theory of symmetric groups. We gain new insight into some of the most promising candidates by finding small subgroups of $Aut(F_n)$ and $Out(F_n)$ which support them and by finding geometric representations for the candidate classes as maps of closed manifolds into the moduli space of graphs. Finally, our results have implications for the homology of the Lie algebra of symplectic derivations.

math.AT↗
arXiv2017

Groups of fast homeomorphisms of the interval and the ping-pong argument

We adapt the Ping-Pong Lemma, which historically was used to study free products of groups, to the setting of the homeomorphism group of the unit interval. As a consequence, we isolate a large class of generating sets for subgroups of $\mathrm{Homeo}_+(I)$ for which certain finite dynamical data can be used to determine the marked isomorphism type of the groups which they generate. As a corollary, we will obtain a criteria for embedding subgroups of $\mathrm{Homeo}_+(I)$ into Richard Thompson's group $F$. In particular, every member of our class of generating sets generates a group which embeds into $F$ and in particular is not a free product. An analogous abstract theory is also developed for groups of permutations of an infinite set.

math.GR↗
arXiv2016

Character varieties as a tensor product

In this short note we show that representation and character varieties of discrete groups can be viewed as tensor products of suitable functors over the PROP of cocommutative Hopf algebras. Such view point has several interesting applications. First, it gives a straightforward way of deriving the functor sending a discrete group to the functions on its representation variety, which leads to representation homology. Second, using a suitable deformation of the functors involved in this construction, one can obtain deformations of the representation and character varieties for the fundamental groups of 3-manifolds, and could lead to better understanding of quantum representations of mapping class groups.

math.RA↗
arXiv2015

Hopf Algebras and Invariants of the Johnson Cokernel

We show that if H is a cocommutative Hopf algebra, then there is a natural action of Aut(F_n) on the nth tensor power of H which induces an Out(F_n) action on a quotient \overline{H^{\otimes n}}. In the case when H=T(V) is the tensor algebra, we show that the invariant Tr^C of the cokernel of the Johnson homomorphism studied in [J. Conant, The Johnson cokernel and the Enomoto-Satoh invariant, Algebraic and Geometric Topology, 15 (2015), no. 2, 801--821.] projects to take values in the top dimensional cohomology of Out(F_n) with coefficients in \overline{H^{\otimes n}}. We analyze the n=2 case, getting large families of obstructions generalizing the abelianization obstructions of [J. Conant, M. Kassabov, K. Vogtmann, Higher hairy graph homology, Journal of Topology, Geom. Dedicata 176 (2015), 345--374.].

math.AT↗
arXiv2014

Property (T) for groups graded by root systems

We introduce and study the class of groups graded by root systems. We prove that if Φ is an irreducible classical root system of rank at least 2 and G is a group graded by Φ, then under certain natural conditions on the grading, the union of the root subgroups is a Kazhdan subset of G. As the main application of this theorem we prove that for any reduced irreducible classical root system Φ of rank at least 2 and a finitely generated commutative ring R with 1, the Steinberg group St_Φ(R) and the elementary Chevalley group E_Φ(R) have property (T). We also show that there exists a group with property (T) which maps onto all finite simple groups of Lie type and rank at least 2, thereby providing a "unified" proof of expansion in these groups.

math.GR↗
arXiv2013

Intersection growth in groups

The intersection growth of a group $G$ is the asymptotic behavior of the index of the intersection of all subgroups of $G$ with index at most $n$, and measures the Hausdorff dimension of $G$ in profinite metrics. We study intersection growth in free groups and special linear groups and relate intersection growth to quantifying residual finiteness.

math.GR↗
arXiv2013

On groups with slow intersection growth

Intersection growth concerns the asymptotic behavior of the index of the intersection of all subgroups of a group that have index at most n. In this note we show that the intersection growth of some groups may not be a nicely behaved function by showing the following seemingly contradictory results: (a) for any group G the intersection growth function i_G(n) is super linear infinitely often; and (b) for any increasing function f there exists a group G such that i_G below f infinitely often.

math.GR↗