Related papers: Finitely presented groups with transcendental spec…

We prove that every finitely generated group with recursive aspherical presentation embeds into a group with finite aspherical presentation. This and several known facts about groups and manifolds imply that there exists a 4-dimensional…

Let $\pi$ be a finite dimensional unitary representation of a group $G$ with a generating symmetric $n$-element set $S\subset G$. Fix $\vp>0$. Assume that the spectrum of $|S|^{-1}\sum_{s\in S} \pi(s) \otimes \overline{\pi(s)}$ is included…

In this work, we provide the first example of an infinite family of branch groups in the class of non-contracting self-similar groups. We show that these groups are very strongly fractal, not regular branch, and of exponential growth.…

In this paper we study the joint/generalized spectral radius of a finite set of matrices in terms of its rank-one approximation by singular value decomposition. In the first part of the paper, we show that any finite set of matrices with at…

In this document we achieve exact and asymptotic enumeration of words, compositions over a finite group, and/or integer compositions characterized by local restrictions and, separately, subsequence pattern avoidance. We also count…

We investigate joint spectral characteristics of a family of matrices $\mathcal F $, associated with products in the semigroup generated by $\mathcal F$. In the literature, extremal measures such as the well-known joint spectral radius and…

We show that group C*-algebras of finitely generated, nilpotent groups have finite nuclear dimension. It then follows, from a string of deep results, that the C*-algebra $A$ generated by an irreducible representation of such a group has…

In this paper we explicitly compute finite bases of disjunctive identities and finite bases of regular representations for a number of interesting finite groups.

One of the great miracles of random matrix theory is that, in the $N \to \infty$ limit, many otherwise intractable matrix problems with horrendously complicated finite-$N$ expressions admit remarkably simple and elegant asymptotic…

We study the impact of certain identities and probabilistic identities on the structure of finite groups. More specifically, let $w$ be a nontrivial word in $d$ distinct variables and let $G$ be a finite group for which the word map…

We study large deviations for some non-local parabolic type equations. We show that, under some assumptions on the non-local term, problems defined in a bounded domain converge with an exponential rate to the solution of the problem defined…

Resolvent degree is an invariant measuring the complexity of algebraic and geometric phenomena, including the complexity of finite groups. To date, the resolvent degree of a finite simple group $G$ has only been investigated when $G$ is a…

Using a new definition of rank for representations of semisimple groups sharp results are proved for the decay of matrix coefficients of unitary representations of two types of non-split $p$-adic simple algebraic groups of exceptional type.…

In the following we are interested in the spectral gaps of discrete quasiperiodic Schr\"odinger operators when the frequency is Diophantine, the potential is analytic, and in the subcritical regime. The gap-labelling theorem asserts in this…

This paper studies effective separability for subgroups of finitely generated nilpotent groups and more broadly effective subgroup separability of finitely generated nilpotent groups. We provide upper and lower bounds that are polynomial…

We introduce the concept of quantifying the extent to which a finitely generated group is residually finite. The quantification is carried out for some examples including free groups, the first Grigorchuk group, finitely generated nilpotent…

We develop a systematic theory of eventually positive semigroups of linear operators mainly on spaces of continuous functions. By eventually positive we mean that for every positive initial condition the solution to the corresponding Cauchy…

The residual finiteness growth of a group quantifies how well approximated the group is by its finite quotients. In this paper, we construct groups with arbitrarily large residual finiteness growth. We also demonstrate a new relationship…

We present a theoretical algorithm which, given any finite presentation of a group as input, will terminate with answer yes if and only if the group is large. We then implement a practical version of this algorithm using Magma and apply it…

We construct an uncountable family of 3-generated residually finite just-infinite groups with isomorphic profinite completions. We also show that word growth rate is not a profinite property.