Related papers: Generating Sets of Mathieu Groups

A Sidon set is a subset of an Abelian group with the property that each sum of two distinct elements is distinct. We construct a small maximal Sidon set of size $O((n \cdot 2^n)^{1/3})$ in the group $\mathbb{Z}_2^n$, generalizing a result…

We provide optimal upper bounds on the growth of iterated sumsets $hA=A+\dots+A$ for finite subsets $A$ of abelian semigroups. More precisely, we show that the new upper bounds recently derived from Macaulay's theorem in commutative algebra…

This paper explores the problem of generative modeling, aiming to simulate diverse examples from an unknown distribution based on observed examples. While recent studies have focused on quantifying the statistical precision of popular…

We obtain tight bounds for the minimal number of generators of an ideal with bounded-degree generators in a polynomial ring $K[X_1,\dots,X_n],$ as well as a sharp quantification of the maximum possible size of a minimal generating set of…

We show that the Julia set of a non-elementary rational semigroup G is uniformly perfect when there is a uniform bound on the Lipschitz constants of the generators of G. This also proves that the limit set of a non-elementary Moebius group…

We construct a family of finite special 2-groups which have commuting graph of increasing diameter

Let $\mathcal{F}_1$ and $\mathcal{F}_2$ be two families of subsets of an $n$-element set. We say that $\mathcal{F}_1$ and $\mathcal{F}_2$ are multiset-union-free if for any $A,B\in \mathcal{F}_1$ and $C,D\in \mathcal{F}_2$ the multisets…

In this paper we show that if $G$ is a primitive subgroup of $S_{n}$ that is not large base, then any irredundant base for $G$ has size at most $5 \log n$. This is the first logarithmic bound on the size of an irredundant base for such…

In this paper, we investigate behaviors of Maximal Dimension, a group invariant involving certain configuration of maximal subgroups, which we denote by MaxDim. We prove that in some special cases, MaxDim(G\times H) = MaxDim(G) + MaxDim(H).…

This article is concerned with the number of generators of perfect ideals J in regular local rings (R,m). If J is sufficiently large modulo $m^n$, a bound is established depending only on n and the projective dimension of J. More ambitious…

The problem of determining the maximum number of maximal independent sets in certain graph classes dates back to a paper of Miller and Muller and a question of Erd\H{o}s and Moser from the 1960s. The minimum was always considered to be less…

We determine whether each known generating set of arbitrary oriented Reidemeister moves is minimal. We then provide a complete classification of minimal generating sets that include a coherent Reidemeister move of type II. We also classify…

Let $\lambda(G)$ be the maximum number of subgroups in an irredundant covering of a finite group $G$. We prove that the finite groups with $\lambda(G)=|G|-t$, where $t\leq 5$, are solvable, and classify such groups.

Let S = S(n) denote the infinite surface with n ends, n \in N, accumulated by genus. For n \geq 6, we show that the mapping class group of S is topologically generated by five involutions. When n \geq 3, it is topologically generated by six…

We show that for any finitely generated group of matrices that is not virtually solvable, there is an integer m such that, given an arbitrary finite generating set for the group, one may find two elements a and b that are both products of…

Let $d(G)$ be the smallest cardinality of a generating set of a finite group $G.$ We give a complete classification of the finite groups with the property that, whenever $ \langle x_1, \dots, x_{d(G)} \rangle = \langle y_1, \dots, y_{d(G)}…

We give an arithmetic criterion which is sufficient to imply the discreteness of various two-generator subgroups of $PSL(2,{\bold C})$. We then examine certain two-generator groups which arise as extremals in various geometric problems in…

We prove that the generic maximal independent family obtained by iteratively forcing with the Mathias forcing relative to diagonalization filters is densely maximal. Moreover, by choosing the filters with some care one can ensure the family…

Let S=Sym(\Omega) be the group of all permutations of an infinite set \Omega. Extending an argument of Macpherson and Neumann, it is shown that if U is a generating set for S as a group, respectively as a monoid, then there exists a…

Let $w = w(x_1,..., x_n)$ be a word, i.e. an element of the free group $F =<x_1,...,x_n>$ on $n$ generators $x_1,..., x_n$. The verbal subgroup $w(G)$ of a group $G$ is the subgroup generated by the set $\{w (g_1,...,g_n)^{\pm 1} | g_i \in…