相关论文: Minimal generating sets of transfer systems for mo…

For a finite group $G$, the notion of a $G$-transfer system provides homotopy theorists with a combinatorial way to study equivariant objects. In this paper, we focus on the properties of transfer systems for non-abelian groups. We…

For a finite group $G$, $G$-transfer systems are combinatorial objects which encode the homotopy category of $G$-$N_\infty$ operads, whose algebras in $G$-spectra are $E_\infty$ $G$-spectra with a specified collection of multiplicative…

We refer to $d(G)$ as the minimal cardinality of a generating set of a finite group $G$, and say that $G$ is $d$-generated if $d(G)\leq d$. A transitive permutation group $G$ is called $\frac{3}{2}$-transitive if a point stabilizer…

Although degree bounds and algorithms for the generators of various invariant rings have been known for decades, little is known about the cardinality of minimal generating sets. Estimates of such would provide lower bounds for the runtime…

Global transfer systems are equivalent to global $N_\infty$-operads, which parametrize different levels of commutativity in globally equivariant homotopy theory, where objects have compatible actions by all compact Lie groups. In this paper…

The diameter of a finite group $G$ with respect to a generating set $A$ is the smallest non-negative integer $n$ such that every element of $G$ can be written as a product of at most $n$ elements of $A \cup A^{-1}$. We denote this invariant…

In this article, we apply the recently developed theory of transfer systems to study the relationship between $G$-equivariant linear isometries and infinite little discs operads, for a finite group $G$. This framework allows us to reduce…

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 present a development in the computational suite for the study of $N_\infty$ operads for a finite group $G$. This progress is achieved using the simple yet powerful observation that Rubin's generation algorithm can be interpreted as a…

Let $G$ be a group. A subset $S$ of $G$ is said to normally generate $G$ if $G$ is the normal closure of $S$ in $G.$ In this case, any element of $G$ can be written as a product of conjugates of elements of $S$ and their inverses. If $g\in…

So far, it has been proven that if $G$ is an abelian group , then the diameter of $G^n$ with respect to any generating set is $O(n)$; and if $G$ is nilpotent, symmetric or dihedral, then there exists a generating set of minimum size, for…

We investigate the extent to which the exchange relation holds in finite groups $G$. We define a new equivalence relation $\equiv_{\mathrm{m}}$, where two elements are equivalent if each can be substituted for the other in any generating…

A generating set for a finite group $G$ is said to be minimal if no proper subset generates $G$, and $m(G)$ denotes the maximal size of a minimal generating set for $G$. We prove a conjecture of Lucchini, Moscatiello and Spiga by showing…

In this paper we give a complete classification of minimal generating systems in a very general class of Fuchsian groups G. This class includes for example any G which has at least seven non-conjugate cyclic subgroups of order greater than…

It is a classical problem to compute a minimal set of invariant polynomial generating the invariant ring of a finite group as an algebra. We present here an algorithm for the computation of minimal generating sets in the non-modular case.…

A zig-zag order is like a directed path, only with alternating directions. A generating set of minimal size for the semigroup of all full transformations on a finite set preserving the zig-zag order was determined by Fenandes et al. in…

Let $G$ be a finite abelian group with $\exp(G)$ the exponent of $G$. Then $\mathsf W(G)$ denotes the set of cross numbers of minimal zero-sum sequences over $G$ and $\mathsf w(G)$ denotes the set of all cross numbers of non-trivial…

A group in which every element commutes with its endomorphic images is called an $E$-group. If $p$ is a prime number, a $p$-group $G$ which is an $E$-group is called a $pE$-group. Every abelian group is obviously an $E$-group. We prove that…

Let $G =<S>$ be a solvable permutation group of the symmetric group $S_n$ given as input by the generating set $S$. We give a deterministic polynomial-time algorithm that computes an \emph{expanding generating set} of size $\tilde{O}(n^2)$…

A minimal permutation representation of a finite group G is a faithful G-set with the smallest possible size. We study the structure of such representations and show that for certain groups they may be obtained by a greedy construction. In…