Related papers: On the Descriptive Complexity of Groups without Ab…

In 1993, Brou\'{e}, Malle and Michel initiated the study of spetses on the Greek island bearing the same name. These are mysterious objects attached to non-real Weyl groups. In algebraic topology, a $p$-compact group $\mathbf{X}$ is a space…

We show that superreflexivity can be characterized in terms of bilipschitz embeddability of word hyperbolic groups. We compare characterizations of superreflexivity in terms of diamond graphs and binary trees. We show that there exist…

We strengthen non-structure theorems for almost free Abelian groups by studying long Ehrenfeucht-Fraisse games between a fixed group of cardinality lambda and a free Abelian group. A group is called epsilon-game-free if the isomorphism…

The $k$-dimensional Weisfeiler-Leman ($k$-WL) algorithm is a simple combinatorial algorithm that was originally designed as a graph isomorphism heuristic. It naturally finds applications in Babai's quasipolynomial time isomorphism…

For $N \geq 2$, we study the structure of definable abelian group extensions of the additive group $(\mathbb{R}^N,+)$ by countable abelian (Borel) groups $G$. Given an extension $H$ of $(\mathbb{R}^N,+)$ by $G$, we measure the definability…

Combinatorial games are widely used in finite model theory, constraint satisfaction, modal logic and concurrency theory to characterize logical equivalences between structures. In particular, Ehrenfeucht-Fraisse games, pebble games, and…

We show that on graphs with n vertices, the 2-dimensional Weisfeiler-Leman algorithm requires at most O(n^2/log(n)) iterations to reach stabilization. This in particular shows that the previously best, trivial upper bound of O(n^2) is…

Combinatorial games played between two players, called Spoiler and Duplicator, have often been used to capture syntactic properties of formal logical languages. For instance, the widely used Ehrenfeucht-Fra\"iss\'e (EF) game captures the…

We study homological multiplicities of spherical varieties of reductive group $G$ over a $p$-adic field $F$. Based on Bernstein's decomposition of the category of smooth representations of a $p$-adic group, we introduce a sheaf that…

We prove Clifford theoretic results on the representations of finite groups which only hold in characteristic $2$. Let $G$ be a finite group, let $N$ be a normal subgroup of $G$ and let $\varphi$ be an irreducible $2$-Brauer character of…

In this paper we study higher level Deligne--Lusztig representations of reductive groups over discrete valuation rings, with finite residue field $\mathbb{F}_q$. In previous work we proved that, at even levels, these geometrically…

Let $G$ be a finite group. Denote by $\textrm{Irr}(G)$ the set of all irreducible complex characters of $G.$ Let $\textrm{cd}(G)=\{\chi(1)\;|\;\chi\in \textrm{Irr}(G)\}$ be the set of all irreducible complex character degrees of $G$…

We investigate the notion of complexity for finitely presented groups and the related notion of complexity for three-dimensional manifolds. We give two-sided estimates on the complexity of all the Milnor groups (the finite groups with free…

Pebble games are single-player games on DAGs involving placing and moving pebbles on nodes of the graph according to a certain set of rules. The goal is to pebble a set of target nodes using a minimum number of pebbles. In this paper, we…

We introduce a new class of $\mathfrak{sl}_2$-triples in a complex simple Lie algebra $\mathfrak{g}$, which we call magical. Such an $\mathfrak{sl}_2$-triple canonically defines a real form and various decompositions of $\mathfrak{g}$.…

We study the Prime Graph Question for integral group rings. This question can be reduced to almost simple groups by a result of Kimmerle and Konovalov. We prove that the Prime Graph Question has an affirmative answer for all almost simple…

We give an 'arithmetic regularity lemma' for groups definable in finite fields, analogous to Tao's 'algebraic regularity lemma' for graphs definable in finite fields. More specifically, we show that, for any $M>0$, any finite field…

We study closed, connected, spin 4-manifolds up to stabilisation by connected sums with copies of $S^2 \times S^2$. For a fixed fundamental group, there are primary, secondary and tertiary obstructions, which together with the signature…

In this work we investigate the computational complexity of the satisfiability problem of sub-fragments of the Bernays-Schoenfinkel class of first-order logic, also known as EPR (Effectively Propositional). While Bernays-Schoenfinkel is…

By finite quantum groups we mean Lusztig's finite-dimensional pointed Hopf algebras called quantum Frobenius Kernels [9, 10], and their natural generalizations due to Andruskiewitsch and Schneider [2, 3]. For a Hopf algebra $H$ in a special…