Related papers: Note on some Gromoll filtration groups and fundame…

Every finitely generated self-similar group naturally produces an infinite sequence of finite $d$-regular graphs $\Gamma_n$. We construct self-similar groups, whose graphs $\Gamma_n$ can be represented as an iterated zig-zag product and…

We study the Gram matrix determinants for the groups $S_n,O_n,B_n,H_n$, for their free versions $S_n^+,O_n^+,B_n^+,H_n^+$, and for the half-liberated versions $O_n^*,H_n^*$. We first collect all the known computations of such determinants,…

In this paper we review the properties of families of numbers of the form $6n\pm1$, with $n$ integer (in which there are all prime numbers greater than 3 and other compound numbers with particular properties) to later use them in a new…

Using the computer algebra program GAP, we show that all crystallographic groups in dimensions at most 4 are distinguished from each other by their sets of finite quotients.

The main results in this thesis deal with the representation growth of certain classes of groups. In chapter $1$ we present the required preliminary theory. In chapter $2$ we introduce the Congruence Subgroup Problem for an algebraic group…

Let $G$ be a permutation group of degree $n$ and let $s(G)$ denote the number of set-orbits of $G$. We determine $\inf(\frac {\log_2 s(G)} n)$ over all groups $G$ that satisfy certain restrictions on composition factors (i.e. $Alt(k), k >…

In the setting of a group $\Gamma$ acting faithfully on a set $X$, a $k$-coloring $c: X\rightarrow \{1, 2, ..., k\}$ is called $\Gamma$-distinguishing if the only element of $\Gamma$ that fixes $c$ is the identity element. The…

Let $M$ be an $n\times n$ random i.i.d. matrix. This paper studies the deviation inequality of $s_{n-k+1}(M)$, the $k$-th smallest singular value of $M$. In particular, when the entries of $M$ are subgaussian, we show that for any…

For rational $\alpha$, the fractional partition functions $p_\alpha(n)$ are given by the coefficients of the generating function $(q;q)^\alpha_\infty$. When $\alpha=-1$, one obtains the usual partition function. Congruences of the form…

Let $D$ be a $p$-divisible group over an algebraically closed field $k$ of characteristic $p>0$. Let $n_D$ be the smallest non-negative integer such that $D$ is determined by $D[p^{n_D}]$ within the class of $p$-divisible groups over $k$ of…

Let $G$ be a finite group. The ring $R_\mathbb{K}(G)$ of virtual characters of $G$ over the field $\mathbb{K}$ is a $\lambda$-ring; as such, it is equipped with the so-called $\Gamma$-filtration, first defined by Grothendieck. We explore…

It was previously noted that for 3d SCFTs with $\mathcal{N}\geq 6$ the moduli space has the form of $\mathbb{C}^{4r}/\Gamma$, where $\Gamma$ is a complex reflection group, at least following suitable gauging of finite symmetries. Here we…

Previous work showed that, for $\nu_2(n)$ the number of partitions of $n$ into exactly two part sizes, one has $\nu_2(16n + 14) \equiv 0 \pmod{4}$. The earlier proof required the technology of modular forms, and a combinatorial proof was…

For a group G we consider the set of natural numbers n for which the nth cohomology functor of G commutes with filtered colimit systems of coefficient modules. We find that for the large class of hierarchically decomposable groups there is…

We introduce and characterise grid classes, which are natural generalisations of other well-studied permutation classes. This characterisation allows us to give a new, short proof of the Fibonacci dichotomy: the number of permutations of…

Let k be an algebraically closed field of characteristic p>0. We compute the Weyl filtration multiplicities in indecomposable tilting modules and the decomposition numbers for the general linear group over k in terms of cap diagrams under…

Given a set $I \subseteq \mathbb{N}$, consider the sequences $\{d_n(I)\},\{p_n(I)\}$ where for any $n$, $d_n(I)$ and $p_n(I)$ respectively count the number of permutations in the symmetric group $\mathfrak{S}_n$ whose descent set…

Denote by $A_n$ the set of square $(0,1)$ matrices of order $n$. The set $A_n$, $n\le8$, is partitioned into row/column permutation equivalence classes enabling derivation of various facts by simple counting. For example, the number of…

For any finite group $G$, we give an arithmetic algorithm to compute generalized Discrete Fourier Transforms (DFTs) with respect to $G$, using $O(|G|^{\omega/2 + \epsilon})$ operations, for any $\epsilon > 0$. Here, $\omega$ is the exponent…

Let G be GL_N or SL_N as reductive linear algebraic group over a field k of positive characteristic p. We prove several results that were previously established only when N < 6 or p > 2^N. Let G act rationally on a finitely generated…