Related papers: Sieve methods in group theory I: Powers in Linear …

We extend and reformulate a result of Solomon on the divisibility of the title. We show, for example, that if $\Gamma$ is a finitely generated group, then $|G|$ divides $#\Hom(\Gamma,G)$ for every finite group $G$ if and only if $\Gamma$…

In this paper, we will show that if for every nonlinear complex irreducible character of a finite group G, some multiple of it is induced from an irreducible character of some proper subgroup of G, then G is solvable. This is a…

Generalization in generative modeling is defined as the ability to learn an underlying distribution from a finite dataset and produce novel samples, with evaluation largely driven by held-out performance and perceived sample quality. In…

We introduce a notion of shadowing property for actions of finitely generated groups and study its basic properties. We formulate and prove a shadowing lemma for actions of nilpotent groups. We construct an example of a faithful linear…

Let $\Gamma$ be a group and $r_n(\Gamma)$ the number of its $n$-dimensional irreducible complex representations. We define and study the associated representation zeta function $\calz_\Gamma(s) = \suml^\infty_{n=1} r_n(\Gamma)n^{-s}$. When…

The goal of invariant theory is to find all the generators for the algebra of representations of a group that leave the group invariant. Such generators will be called \emph{basic invariants}. In particular, we set out to find the set of…

In the context of almost complex quantization, a natural generalization of algebro-geometric linear series on a compact symplectic manifold has been proposed. Here we suppose given a compatible action of a finite group and consider the…

A group is said to be C*-simple if its reduced C*-algebra is simple. We establish an intrinsic (group-theoretic) characterization of groups with this property. Specifically, we prove that a discrete group is C*-simple if and only if it has…

We present an algorithm that decides whether a finitely generated linear group over an infinite field is solvable-by-finite: a computationally effective version of the Tits alternative. We also give algorithms to decide whether the group is…

Let K be a field of characteristic 0 and let n be a natural number. Let Gamma be a subgroup of the multiplicative group $(K^\ast)^n$ of finite rank r. Given $A_2,...,a_n\in K^\ast$ write $A(a_1,...,a_n,\Gamma)$ for the number of solutions…

Let $G$ be a finite group and construct a graph $\Delta(G)$ by taking $G\setminus\{1\}$ as the vertex set of $\Delta(G)$ and by drawing an edge between two vertices $x$ and $y$ if $\langle x,y\rangle$ is cyclic. Let $K(G)$ be the set…

The semidirect product $\mathbb{G}=\mathbb{L}\rtimes \mathbb{K}$ attached to a compact-group action on a connected, simply-connected solvable Lie group has a dense set of compact elements precisely when the $s\in \mathbb{K}$ operating on…

Physical properties of matter are tightly related with the kind of symmetry of the medium. Group theory is a systematic tool, though not always easy to handle, to exploit symmetry properties, for instance to find the eigenvectors and…

A countable group is residually finite if every nontrivial element can act nontrivially on a finite set. When a group fails to be residually finite, we might want to measure how drastically it fails - it could be that only finitely many…

We prove that a map onto a nilpotent group $Q$ has finitely generated kernel if and only if the preimage of the positive cone is coarsely connected as a subset of the Cayley graph for every full archimedean partial order on $Q$. In case $Q$…

Given an action of a group $\Gamma$ on a measure space $\Omega$, we provide a sufficient criterion under which two sets $A, B\subseteq \Omega$ are measurably equidecomposable, i.e., $A$ can be partitioned into finitely many measurable…

The equivalence group is determined for systems of linear ordinary differential equations in both the standard form and the normal form. It is then shown that the normal form of linear systems reducible by an invertible point transformation…

Group theory is a particularly fertile field for the design of practical algorithms. Algorithms have been developed across the various branches of the subject and they find wide application. Because of its relative maturity, computational…

We study Morse representations of discrete subgroups in higher rank semi-simple Lie groups defined by M. Kapovich, B. Leeb and J. Porti. We show that, if a sequence of Morse representations $\rho_n : \Gamma \rightarrow G$ is (strongly)…

We introduce a quantitative notion of lawlessness for finitely generated groups, encoded by the "lawlessness growth function" $\mathcal{A}_{\Gamma} : \mathbb{N} \rightarrow \mathbb{N}$. We show that $\mathcal{A}_{\Gamma}$ is bounded iff…