首页/论文/2012.04600

arXiv 2012.046002020-12math.GR

On product-one sequences over subsets of groups

Victor Fadinger, Qinghai Zhong

备注：: To appear in Periodica Mathematica Hungarica

英文摘要：

Let $G$ be a group and $G_0 \subseteq G$ be a subset. A sequence over $G_0$ means a finite sequence of terms from $G_0$, where the order of elements is disregarded and the repetition of elements is allowed. A product-one sequence is a sequence whose elements can be ordered such that their product equals the identity element of the group. We study algebraic and arithmetic properties of monoids of product-one sequences over finite subsets of $G$ and over the whole group $G$, with a special emphasis on infinite dihedral groups.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

On Products of Closed Subsets in Free Groups

We present examples of closed subsets of a free group such that their product is not closed in the profinite topology. We discuss how to characterize a subset of a free group which is closed in the profinite topology and its product with any finitely generated subgroup of a free group is also closed in the profinite topology.

2019-06-11math.GR

有限单群中子集乘积的增长

Growth of products of subsets in finite simple groups

本文研究有限非阿贝尔单群中子集与正规子集乘积的增长，证明在两者均不过大时满足 $|AB|\geq|A||B|^{1-\epsilon}$，强化了 Liebeck、Schul、Shalev 的定理。

2024-01-22math.GR

Products of normal subsets and derangements

In recent years there has been significant progress in the study of products of subsets of finite groups and of finite simple groups in particular. In this paper we consider which families of finite simple groups $G$ have the property that for each $ε> 0$ there exists $N > 0$ such that, if $|G| \ge N$ and $S, T$ are normal subsets of $G$ with at least $ε|G|$ elements each, then every non-trivial element of $G$ is the product of an element of $S$ and an element of $T$. We show that this holds in a strong sense for finite simple groups of Lie type of bounded rank, while it does not hold for alte…

2020-07-15math.GR

Product decompositions in finite simple groups

We propose a general conjecture on decompositions of finite simple groups as products of conjugates of an arbitrary subset. We prove this conjecture for bounded subsets of arbitrary finite simple groups, and for large subsets of groups of Lie type of bounded rank. Some of our arguments apply recent advances in the theory of growth in finite simple groups of Lie type, and provide a variety of new product decompositions of these groups.

2011-07-07math.GR

Rational Subsets and Submonoids of Wreath Products

It is shown that membership in rational subsets of wreath products H \wr V with H a finite group and V a virtually free group is decidable. On the other hand, it is shown that there exists a fixed finitely generated submonoid in the wreath product Z \wr Z with an undecidable membership problem.

2013-02-11cs.FLmath.GR

Generalizations of product-free subsets

For any group G of order n, a subset A of G is said to be product-free if there is no solution of the equation ab=c with a,b,c in A. Previous results of Gowers showed that the size of any product-free subset of G is at most n/d^(1/3), where d is the smallest dimension of a nontrivial representation of G. However, this upper bound does not match the best lower bound. We will generalize the upper bound to the case of product-poor subsets A, in which the equation ab=c is allowed to have a few solutions with a,b,c in A. We prove that the upper bound for the size of product-poor subsets matches the…

2008-04-04math.COmath.GR

更多相关论文收起更多论文

On the rational subset problem for groups

We use language theory to study the rational subset problem for groups and monoids. We show that the decidability of this problem is preserved under graph of groups constructions with finite edge groups. In particular, it passes through free products amalgamated over finite subgroups and HNN extensions with finite associated subgroups. We provide a simple proof of a result of Grunschlag showing that the decidability of this problem is a virtual property. We prove further that the problem is decidable for a direct product of a group G with a monoid M if and only if membership is uniformly decid…

2006-02-21math.GR

关于满足三元积性质的三组群子集的不交条件的简短说明

A Short Note on Disjointness Conditions for Triples of Group Subsets Satisfying the Triple Product Property

本文研究了满足三元积性质的三组群子集的不交条件，并推导了其大小之和的上下界。

2025-12-29math.COmath.GR

Product-free subsets of groups, then and now

A subset of a group is product-free if it does not contain elements a, b, c such that ab = c. We review progress on the problem of determining the size of the largest product-free subset of an arbitrary finite group, including a lower bound due to the author, and a recent upper bound due to Gowers. The bound of Gowers is more general; it allows three different sets A, B, C such that one cannot solve ab = c with a in A, b in B, c in C. We exhibit a refinement of the lower bound construction which shows that for this broader question, the bound of Gowers is essentially optimal.

2007-11-07math.COmath.GR

On product-one sequences over dihedral groups

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 equals the identity element of the group. The set of all product-one sequences over $G$ (with concatenation of sequences as the operation) is a finitely generated C-monoid. Product-one sequences over dihedral groups have a variety of extremal properties. This article provides a detailed investigation, with methods from arithmetic combinatorics, of the arithme…

2020-11-16math.ACmath.COmath.GR

Invertible unital bimodules over rings with local units, and related exact sequences of groups

Given an extension $R \subseteq S$ of rings with same set of local units, inspired by the works of Miyashita, we construct four exact sequences of groups relating Picard's groups of $R$ and $S$.

2009-03-26math.GRmath.RA

树乘积中随机子集的拟等距刚性

Quasi-isometric rigidity for random subsets in products of trees

School of Mathematical Sciences & Beijing International Center for Mathematical Research, Peking University（北京大学数学科学学院与北京国际数学研究中心）；School of Mathematical Sciences, Peking University（北京大学数学科学学院）；Department of Mathematics, University of California, San Diego（加州大学圣地亚哥分校数学系）

本文证明了从两棵正则树的乘积空间中的随机子集到其自身的拟等距嵌入的刚性结果，推广了Eskin的高秩非均匀格点的拟等距刚性，并描述了随机样本的自拟等距嵌入，同时证明两个独立样本几乎必然非拟等距。

2026-06-03math.GRmath.MGmath.PR

半群中的全局乘积交集

Global Product Intersection Sets in Semigroups

School of Mathematics and Statistics, Xi’an Jiaotong University（西安交通大学数学与统计学院）

本文研究了半群中乘积交集的性质，证明了当Q的大小大于等于2时，任何包含1的子集均可作为乘积交集出现，解决了Nathanson提出的问题。

2026-04-27math.COmath.GRmath.NT

Productivity of sequences with respect to a given weight function

Given a function f: N --> (omega+1)-{0}, we say that a faithfully indexed sequence {a_n: n in N} of elements of a topological group G is: (i) f-Cauchy productive (f-productive) provided that the sequence {prod_{n=0}^m a_n^{z(n)}: m in N} is left Cauchy (converges to some element of G, respectively) for each function z: N --> Z such that |z(n)| <= f(n) for every n in N; (ii) unconditionally f-Cauchy productive (unconditionally f-productive) provided that the sequence {a_{s(n)}: n in N\} is (f\circ s)-Cauchy productive (respectively, (f\circ s)-productive) for every bijection s: N --> N. (Biject…

2010-11-05math.FAmath.GNmath.GR

关于半群中乘积集和和集交集的问题与结果

Problems and results on intersections of product sets and sumsets in semigroups

Lehman College (CUNY)（莱曼学院（城市大学系统））

研究半群中乘积集与和集交集的性质，探讨乘积交集集H(A_q)的结构与特性。

2026-04-10math.COmath.GRmath.NT

On compactifications and product-free sets

A subset of a group is said to be product-free if it does not contain three elements satisfying the equation $xy=z$. We give a negative answer to a question of Babai and Sós on the existence of large product-free sets by model theoretic means. This question was originally answered by Gowers. Furthermore, we give a natural and sufficient model theoretic condition for a group to have a large product-free subset, as well as a model theoretic account of a result of Nikolov and Pyber on triple products.

2019-03-04math.COmath.GRmath.LO