Related papers: Word Length Formulae and Normal Forms of Conjugacy…

Although the conjugacy classes of the general linear group are known, it is not obvious (from the canonic form of matrices) that two permutation matrices are similar if and only if they are conjugate as permutations in the symmetric group,…

We develop general formulae for the numbers of conjugacy classes and irreducible complex characters of finite p-groups of nilpotency class less than p. This allows us to unify and generalize a number of existing enumerative results, and to…

A {\it $k$-involution} is an involution with a fixed point set of codimension $k$. The conjugacy class of such an involution, denoted $S_k$, generates $\text{M\"ob}(n)$-the the group of isometries of hyperbolic $n$-space-if $k$ is odd, and…

Oriented loops on an orientable surface are, up to equivalence by free homotopy, in one-to-one correspondence with the conjugacy classes of the surface's fundamental group. These conjugacy classes can be expressed (not uniquely in the case…

For the free group $F_r$ on $r>1$ generators (respectively, the free product $G_1 * G_2$ of two nontrivial finite groups $G_1$ and $G_2$), we obtain the asymptotic for the number of conjugacy classes of commutators in $F_r$ (respectively,…

We extend to alternating groups $A_n$ several results about symmetric groups asserting that under various conditions on a conjugacy class, or more generally, a normal subset, $C$ of $S_n$, we have $C^2 \supseteq A_n\setminus\{1\}$

The word problem for products of symmetric groups (WPPSG) is a well-known NP-complete problem. An input instance of this problem consists of ``specification sets'' $X_1,\ldots,X_m \seq \{1,\ldots,n\}$ and a permutation $\tau$ on…

Consider the Deligne-Simpson problem: {\em give necessary and sufficient conditions for the choice of the conjugacy classes $C_j\subset GL(n,{\bf C})$ (resp. $c_j\subset gl(n,{\bf C})$) so that there exist irreducible $(p+1)$-tuples of…

In this thesis, we study the place of regular languages within the communication complexity setting. In particular, we are interested in the non-deterministic communication complexity of regular languages. We show that a regular language…

For a prime number $p$ and a free pro-$p$ group $G$ on a totally ordered basis $X$, we consider closed normal subgroups $G^\Phi$ of $G$ which are generated by $p$-powers of iterated commutators associated with Lyndon words in the alphabet…

Given a semigroup $S$ and $s,t \in S$, write $s \sim_p^1 t$ if $s=pr$ and $t=rp$, for some $p,r \in S \cup \{1\}$. This relation, known as "primary conjugacy", along with its transitive closure $\sim_p$, has been extensively used and…

Using generating functions, we enumerate regular semisimple conjugacy classes in the finite classical groups. For the general linear, unitary, and symplectic groups this gives a different approach to known results; for the special…

For any odd prime $p$ we consider representations of a group of order $p$ in the symplectic group $Sp(p-1,Z[1/n])$ of $(p-1)\times(p-1)$-matrices over the ring $Z[1/n]$, $0\neq n\in N$. We construct a relation between the conjugacy classes…

Let $\mathbb{C}$ be the field of complex numbers. Let $k$ be natural number with $k \geq 2$ and let $p$ be a rational prime. In this paper we count the number of conjugacy classes of admissible cyclic subgroups of…

We give elementary applications of quasi-homomorphisms to growth problems in groups. A particular case concerns the number of torsion elements required to factorise a given element in the mapping class group of a surface.

We analyze here a particular kind of linguistic network where vertices representwords and edges stand for syntactic relationships between words. The statisticalproperties of these networks have been recently studied and various features…

In this work, we consider the satisfiability problem in a logic that combines word equations over string variables denoting words of unbounded lengths, regular languages to which words belong and Presburger constraints on the length of…

We prove a result that relates the number of homomorphisms from the fundamental group of a compact nonorientable surface to a finite group $G$, where conjugacy classes of the boundary components of the surface must map to prescribed…

While utilizing syntactic tools such as parts-of-speech (POS) tagging has helped us understand sentence structures and their distribution across diverse corpora, it is quite complex and poses a challenge in natural language processing…

We study the formula complexity of the word problem $\mathsf{Word}_{S_n,k} : \{0,1\}^{kn^2} \to \{0,1\}$: given $n$-by-$n$ permutation matrices $M_1,\dots,M_k$, compute the $(1,1)$-entry of the matrix product $M_1\cdots M_k$. An important…