中文
相关论文

相关论文: Generation of Iterated Wreath Products Constructed…

200 篇论文

We consider wreath product decompositions for semigroups of triangular matrices. We exhibit an explicit wreath product decomposition for the semigroup of all n-by-n upper triangular matrices over a given field k, in terms of aperiodic…

环与代数 · 数学 2007-05-23 Mark Kambites , Benjamin Steinberg

We obtain new explicit pseudorandom generators for several computational models involving groups. Our main results are as follows: 1. We consider read-once group-products over a finite group $G$, i.e., tests of the form $\prod_{i=1}^n…

计算复杂性 · 计算机科学 2025-06-05 Chin Ho Lee , Emanuele Viola

Let G be a group acting faithfully on a set X. The distinguishing number of the action of G on X is the smallest number of colors such that there exists a coloring of X where no nontrivial group element induces a color-preserving…

组合数学 · 数学 2007-05-23 Melody Chan

In this paper we show how iterate weak crossed products with common monoid. More concretely, if $(A\otimes V, \mu_{A\otimes V})$ and $(A\otimes W, \mu_{A\otimes W})$ are weak crossed products, we find sufficient conditions to obtain a new…

For an odd prime p, we determine a minimal set of topological generators of the pro-p Iwahori subgroup of a split reductive group G over Z\_p. In the simple adjoint case and for any sufficiently large regular prime p, we also construct…

数论 · 数学 2018-01-12 Christophe Cornut , Jishnu Ray

A subset $\left\{x_{1},x_{2},\hdots,x_{d}\right\}$ of a group $G$ \emph{invariably generates} $G$ if $\left\{x_{1}^{g_{1}},x_{2}^{g_{2}},\hdots,x_{d}^{g_{d}}\right\}$ generates $G$ for every $d$-tuple $(g_{1},g_{2}\hdots,g_{d})\in G^{d}$.…

群论 · 数学 2018-01-31 Gareth M. Tracey

Let R be the ring of algebraic integers in a number field K and let L be a maximal order in a semisimple K-algebra B. Building on our previous work, we compute the smallest number of algebra generators of L considered as an R-algebra. This…

环与代数 · 数学 2016-11-25 Rostyslav V. Kravchenko , Marcin Mazur , Bogdan V. Petrenko

We characterise the group property of being with infinite conjugacy classes for wreath products of groups

群论 · 数学 2007-05-23 Jean-Philippe Preaux

We consider a procedure to reduce simply generated trees by iteratively removing all leaves. In the context of this reduction, we study the number of vertices that are deleted after applying this procedure a fixed number of times by using…

组合数学 · 数学 2019-11-11 Benjamin Hackl , Clemens Heuberger , Stephan Wagner

We present a general criterion under which the equality var(A Wr B) = var(A) var(B) holds for finite groups A and B. This continues our previous research on varieties, generated by wreath products of abelian groups, and generalizes some…

群论 · 数学 2015-09-23 Vahagn H. Mikaelian

We describe an effective version of the conjugacy problem and study it for wreath products and free solvable groups. The problem involves estimating the length of short conjugators between two elements of the group, a notion which leads to…

群论 · 数学 2013-07-26 Andrew W. Sale

Given an initial family of sets, we may take unions, intersections and complements of the sets contained in this family in order to form a new collection of sets; our construction process is done recursively until we obtain the last family.…

组合数学 · 数学 2024-09-11 Jorge Garcia , Rosemarie Bongers , Jonathan Detgen , Walter Morales

Let $G$ be a finite group. A sequence over $G$ means a finite sequence of terms from $G$, where repetition is allowed and the order is disregarded. A product-one sequence is a sequence whose elements can be ordered such that their product…

A (2,*)-group is a group that can be generated by two elements, one of which is an involution. We describe the method we have used to produce a census of all (2,*)-groups of order at most 6 000. Various well-known combinatorial structures…

群论 · 数学 2015-05-06 Primož Potočnik , Pablo Spiga , Gabriel Verret

A growing self-avoiding walk (GSAW) is a walk on a graph that is directed, does not visit the same vertex twice, and has a trapped endpoint. We show that the generating function enumerating GSAWs on a half-infinite strip of finite height is…

组合数学 · 数学 2026-02-17 Jay Pantone , Alexander R. Klotz , Everett Sullivan

The anti-van der Waerden number of a graph $G$ is the fewest number of colors needed to guarantee a rainbow $3$-term arithmetic progression in $G$, denoted $\operatorname{aw}(G,3)$. It is known that the anti-van der Waerden number of graph…

组合数学 · 数学 2025-04-02 Zhanar Berikkyzy , Joe Miller , Nathan Warnberg

The group property FW stands in-between the celebrated Kazdhan's property (T) and Serre's property FA. Among many characterizations, it might be defined, for finitely generated groups, as having all Schreier graphs one-ended. It follows…

群论 · 数学 2024-03-20 Paul-Henry Leemann , Grégoire Schneeberger

Given a finite group $G$ acting on a set $X$ let $\delta_k(G,X)$ denote the proportion of elements in $G$ that have exactly $k$ fixed points in $X$. Let $\mathrm{S}_n$ denote the symmetric group acting on $[n]=\{1,2,\dots,n\}$. For…

群论 · 数学 2023-07-18 Vishnuram Arumugam , Heiko Dietrich , S. P. Glasby

We develop a theory of semidirect products of partial groups and localities. Our concepts generalize the notions of direct products of partial groups and localities, and of semidirect products of groups.

群论 · 数学 2019-05-10 Valentina Grazian , Ellen Henke

For a non-cyclic finite group $X$ let $\sigma(X)$ be the least number of proper subgroups of $X$ whose union is $X$. Precise formulas or estimates are given for $\sigma(S \wr C_{m})$ for certain nonabelian finite simple groups $S$ where…

群论 · 数学 2012-11-26 Martino Garonzi , Attila Maroti