Related papers: Avoiding conjugacy classes on the 5-letter alphabe…

Let $n$ be a positive integer and let $G$ be a group. We denote by $\nu(G)$ a certain extension of the non-abelian tensor square $G \otimes G$ by $G \times G$. Set $T_{\otimes}(G) = \{g \otimes h \mid g,h \in G\}$. We prove that if the size…

We consider the factorization of permutations into bandwidth 1 permutations, which are products of mutually nonadjacent simple transpositions. We exhibit an upper bound on the minimal number of such factors and thus prove a conjecture of…

We establish factoriality of $q$-Araki-Woods von Neumann algebras (with the number of generators at least two) in full generality, exploiting the approach via conjugate variables developed recently in the tracial case by Akihiro Miyagawa…

Given a group-word $w$ and a group $G$, the set of $w$-values in $G$ is denoted by $G_w$ and the verbal subgroup $w(G)$ is the one generated by $G_w$. The word $w$ is concise if $w(G)$ is finite for all groups $G$ in which $G_w$ is finite.…

We prove that for every integer $n > 0$ and for every alphabet $\Sigma_k$ of size $k \geq 3$, there exists a necklace of length $n$ whose Burrows-Wheeler Transform (BWT) is completely unclustered, i.e., it consists of exactly $n$ runs with…

We present an impossibility result, called a theorem about facts and words, which pertains to a general communication system. The theorem states that the number of distinct words used in a finite text is roughly greater than the number of…

A square is a factor $S = (S_1; S_2)$ where $S_1$ and $S_2$ have the same pattern, and a permutation is said to be square-free if it contains no non-trivial squares. The permutation is further said to be bicrucial if every extension to the…

We discuss the notion of privileged word, recently introduced by Peltomaki. A word w is privileged if it is of length <=1, or has a privileged border that occurs exactly twice in w. We prove the following results: (1) if w^k is privileged…

A set X of partial words over a finite alphabet A is called unavoidable if every two-sided infinite word over A has a factor compatible with an element of X. Unlike the case of a set of words without holes, the problem of deciding whether…

An element w in the free group on r letters defines a map f from G^r to G for each group G. In this note, we show that whenever w is non-trivial and G is a semisimple algebraic group, f is dominant. When G is a finite simple group, the…

The recently confirmed Dejean's conjecture about the threshold between avoidable and unavoidable powers of words gave rise to interesting and challenging problems on the structure and growth of threshold words. Over any finite alphabet with…

We establish several new bounds for the number of conjugacy classes of a finite group, all of which involve the maximal number c of conjugacy classes of a normal subgroup fixed by some element of a suitable subset of the group. To apply…

We prove that outer commutator words are uniformly concise, i.e. if an outer commutator word w takes m different values in a group G, then the order of the verbal subgroup w(G) is bounded by a function depending only on m and not on w or G.…

We describe an easy way how to find supercharacter theories for a finite group, if its character table is known. Namely, we show how an arbitrary partition of the conjugacy classes or of the irreducible characters can be refined to the…

We characterize the group property of being with infinite conjugacy classes (or icc, i.e. infinite and of which all conjugacy classes except {1} are infinite) for groups which are defined by an extension of groups. We give characterizations…

We prove the Arad-Herzog conjecture for various families of finite simple groups- if A and B are nontrivial conjugacy classes, then AB is not a conjugacy class. We also prove that if G is a finite simple group of Lie type and A and B are…

The work takes another look at the number of runs that a string might contain and provides an alternative proof for the bound. We also propose another stronger conjecture that states that, for a fixed order on the alphabet, within every…

Motivated by the recent proof of the Stanley-Wilf conjecture, we study the asymptotic behavior of the number of permutations avoiding a generalized pattern. Generalized patterns allow the requirement that some pairs of letters must be…

In this paper, we study the structure of finite groups with a large number of conjugacy classes of $p$-elements for some prime $p$. As consequences, we obtain some new criteria for the existence of normal $p$-complements in finite groups.

We focus on infinite words with languages closed under reversal. If frequencies of all factors are well defined, we show that the number of different frequencies of factors of length n+1 does not exceed 2C(n+1)-2C(n)+1.