Related papers: Counting packings of generic subsets in finite gro…

A set $G \subseteq \omega$ is $n$-generic for a positive integer $n$ if and only if every $\Sigma^0_n$ formula of $G$ is decided by a finite initial segment of $G$ in the sense of Cohen forcing. It is shown here that every $n$-generic set…

We generalize the classical notion of packing a set by balls with identical radii to the case where the radii may be different. The largest number of such balls that fit inside the set without overlapping is called its {\em non-uniform…

Let $G$ be a finite group and $\sigma_1(G)=\frac{1}{|G|}\sum_{H\leq G}\,|H|$. Under some restrictions on the number of conjugacy classes of (non-normal) maximal subgroups of $G$, we prove that if $\sigma_1(G)<\frac{117}{20}\,$, then $G$ is…

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…

For a finite group $G$ let $\sigma(G)$ (the "sum" of $G$) be the least number of proper subgroups of $G$ whose set-theoretical union is equal to $G$, and $\sigma(G)=\infty$ if $G$ is cyclic. We say that a group $G$ is $\sigma$-elementary if…

The spectrum $\omega(G)$ of a finite group $G$ is the set of orders of elements of $G$. We present a polynomial-time algorithm that, given a finite set $\mathcal M$ of positive integers, outputs either an empty set or a finite simple group…

We classify those sequences $\langle S_{n} \mid n \in \mathbb{N} \rangle$ of finite simple nonabelian groups such that the full product $\prod_{n} S_{n}$ has property (FA).

For an arbitrary finite permutation group $G$, subgroup of the symmetric group $S_\ell$, we determine the permutations involving only members of $G$ as $\ell$-patterns, i.e., avoiding all patterns in the set $S_\ell \setminus G$. The set of…

We obtain the formula computing the number of isomorphic classes of element systems with characters over finite commutative group $G$.

The generalized Fitting height of a finite group $G$ is the least number $h=h^*(G)$ such that $F^*_h(G)=G$, where the $F^*_i(G)$ is the generalized Fitting series: $F^*_1(G)=F^*(G)$ and $F^*_{i+1}(G)$ is the inverse image of…

A paratopological group $G$ has a {\it suitable set} $S$. The latter means that $S$ is a discrete subspace of $G$, $S\cup \{e\}$ is closed, and the subgroup $\langle S\rangle$ of $G$ generated by $S$ is dense in $G$. Suitable sets in…

Let $\Z_m$ be the group of residue classes modulo $m$. Let $s(m,n)$ and $c(m,n)$ denote the total number of subgroups of the group $\Z_m \times \Z_n$ and the number of its cyclic subgroups, respectively, where $m$ and $n$ are arbitrary…

This Thesis presents a 2-dimensional generalization of Houghtons' groups H_n. H_n is defined to be the group of all permutations p of a disjoint union of copies of the natural numbers N, with the property that each copy of N contains a…

We are looking for the smallest integer k>1 providing the following characterization of the solvable radical R(G) of any finite group G: R(G) coincides with the collection of all g such that for any k elements a_1,a_2,...,a_k the subgroup…

Let $\Bbb P$ be the set of all primes. A subgroup $H$ of a group $G$ is called {\it $\mathbb P$-subnormal} in $G$, if either $H=G$, or there exists a chain of subgroups $H=H_0\le H_1\le \ldots \le H_n=G, \ |H_{i}:H_{i-1}|\in \Bbb P, \…

A group $G$ is invariably generated (IG) if there is a subset $S \subseteq G$ such that for every subset $S' \subseteq G$, obtained from $S$ by replacing each element with a conjugate, $S'$ generates $G$. $G$ is finitely invariably…

We investigate group coding for arbitrary finite groups acting linearly on a vector space. These yield robust codes based on real or complex matrix groups. We give necessary and sufficient conditions for correct subgroup decoding using…

Let $S$ be the numerical semigroup generated by three consecutive numbers $a,a+1,a+2$, where $a\in\mathbb{N}$, $a\geq 3$. We describe the elements of $S$ whose factorizations have all the same length, as well as the set of factorizations of…

A subset S of a finite group G invariably generates G if G = <hsg(s) j s 2 Si > for each choice of g(s) 2 G; s 2 S. We give a tight upper bound on the minimal size of an invariable generating set for an arbitrary finite group G. In response…

We find generating functions the number of strings (words) containing a specified number of occurrences of certain types of order-isomorphic classes of substrings called subword patterns. In particular, we find generating functions for the…