Related papers: The Minimum Generating Set Problem

Suppose that $k\geq 2$ and $A$ is a non-empty subset of a finite abelian group $G$ with $|G|>1$. Then the cardinality of the restricted sumset $$ k^\wedge A:=\{a_1+\cdots+a_k:\,a_1,\ldots,a_k\in A,\ a_i\neq a_j\text{ for }i\neq j\} $$ is at…

In a given graph $G$, a set $S$ of vertices with an assignment of colors is a {\sf defining set of the vertex coloring of $G$}, if there exists a unique extension of the colors of $S$ to a $\Cchi(G)$-coloring of the vertices of $G$. A…

Does there exist for any $\sigma$-algebra a minimal (with respect to inclusion) generating set? We formulate this problem and answer it in the very special instance of partition generated and standard measurable spaces, the general case…

A finite non-abelian group $H$ is hamiltonian if all of its subgroups are normal. We compute the minimal orders of graphs having a hamiltonian group as their automorphism group. The fixing number of a graph $\Gamma$ is the minimum…

The topology of a separable metrizable space $M$ is \emph{generated} by a family $\mathcal{C}$ of its subsets provided that a set $A\subseteq M$ is closed in $M$ if and only if $A\cap C$ is closed in $C$ for each $C\in \mathcal{C}$. The…

Let $G=(V,E)$ be a graph. A subset $D$ of $V(G)$ is called a super dominating set if for every $v \in V(G)-D$ there exists an external private neighbour of $v$ with respect to $V(G)-D.$ The minimum cardinality of a super dominating set is…

Given a nonempty finite multiset $S$ of positive integers, we wish to find a partially ordered set $P$ of minimal cardinality such that the multiset of cardinalities of all maximal chains in $P$ equals $S$. This paper establishes upper and…

Let $G=(V,E)$ be a graph. A subset $D\subseteq V$ is a dominating set if every vertex not in $D$ is adjacent to a vertex in $D$. A dominating set $D$ is called a total dominating set if every vertex in $D$ is adjacent to a vertex in $D$.…

For a group $G$ and a set $A$, let $\text{End}(A^G)$ be the monoid of all cellular automata over $A^G$, and let $\text{Aut}(A^G)$ be its group of units. By establishing a characterisation of surjunctuve groups in terms of the monoid…

A procedure for generating non-differentiable, continuously differentiable, and twice continuously differentiable classes of test functions for multiextremal multidimensional box-constrained global optimization and a corresponding package…

We consider the group isomorphism problem: given two finite groups G and H specified by their multiplication tables, decide if G cong H. For several decades, the n^(log_p n + O(1)) generator-enumeration bound (where p is the smallest prime…

We demonstrate how virtually all common cardinal invariants associated to a von Neumann algebra M can be computed from the decomposability number, dec(M), and the minimal cardinality of a generating set, gen(M). Applications include the…

It is currently an unsolved problem to determine whether a $\triangle$-free planar graph $G$ contains an independent set $A$ such that $G[V_G\setminus A]$ is $2$-choosable. However, in this paper, we take a slightly different approach by…

In this note we give an alternative proof of a theorem of Linnell and Warhurst that the number of generators d(G) of a polycyclic group G is at most d(\hat G), where d(\hat G) is the number of generators of the profinite completion of G.…

Let $S(n)$ be the infinite-type surface with infinite genus and $n \in \mathbb{N}$ ends, all of which are accumulated by genus. The mapping class group of this surface, $\mod(S(n))$, is a Polish group that is not countably generated, but it…

We present a formulation of the problem of finding the smallest T -Count circuit that implements a given unitary as a binary search over a sequence of continuous minimization problems, and demonstrate that these problems are numerically…

Let $G$ be a finite group generated by $k$ elements. The well-known product replacement algorithm provides an effective method for sampling generating sets of $G$. We study a refinement of this algorithm that is designed to output…

In order to study how well a finite group might be generated by repeated random multiplications, P. Diaconis suggested the following urn model. An urn contains some balls labeled by elements which generate a group G. Two are drawn at random…

It is now known that for any prime p and any finite semiabelian p-group G, there exists a (tame) realization of G as a Galois group over the rationals Q with exactly d = d(G) ramified primes, where d(G) is the minimal number of generators…

Let $G$ be a finite group. Let $k(G)$ denote the number of conjugacy classes of $G$ and let $m(G)$ denote the least positive integer $n$ such that the union of any $n$ distinct non-trivial conjugacy classes of $G$ together with the identity…