English
Related papers

Related papers: Structure of the largest idempotent-product free s…

200 papers

Let $\mathcal{S}$ be a finite cyclic semigroup written additively. An element $e$ of $\mathcal{S}$ is said to be idempotent if $e+e=e$. A sequence $T$ over $\mathcal{S}$ is called {\sl idempotent-sum free} provided that no idempotent of…

Combinatorics · Mathematics 2020-06-02 Guoqing Wang

Let $\mathcal{S}$ be a nonempty commutative semigroup written additively. An element $e$ of $\mathcal{S}$ is said to be idempotent if $e+e=e$. The Erd\H{o}s-Burgess constant of the semigroup $\mathcal{S}$ is defined as the smallest positive…

Combinatorics · Mathematics 2020-05-19 Guoqing Wang

For any finite abelian group $G$ and commutative unitary ring $R$, by $R[G]$ we denote the group algebra over $R$. Let $T=(g_1,\ldots,g_{\ell})$ be a sequence over the group $G$. We say $T$ is algebraically zero-sum free over R if…

Combinatorics · Mathematics 2025-09-24 Guoqing Wang

Let $G$ be a multiplicative finite group and $S=a_1\cdot\ldots\cdot a_k$ a sequence over $G$. We call $S$ a product-one sequence if $1=\prod_{i=1}^ka_{\tau(i)}$ holds for some permutation $\tau$ of $\{1,\ldots,k\}$. The small Davenport…

Combinatorics · Mathematics 2018-11-27 Dongchun Han , Hanbin Zhang

The set of idempotents of any semigroup carries the structure of a biordered set, which contains a great deal of information concerning the idempotent generated subsemigroup of the semigroup in question. This leads to the construction of a…

Group Theory · Mathematics 2019-01-11 Yang Dandan , Igor Dolinka , Victoria Gould

The enumeration of zero-sum subsequences of a given sequence over finite cyclic groups is one classical topic, which starts from one question of P. Erd\H{o}s. In this paper, we consider this problem in a more general setting -- finite…

Combinatorics · Mathematics 2025-05-02 Guoqing Wang , Yang Zhao , Xingliang Yi

Let $G$ be a multiplicatively written finite group. We denote by $\mathsf E(G)$ the smallest integer $t$ such that every sequence of $t$ elements in $G$ contains a product-one subsequence of length $|G|$. In 1961, Erd\H{o}s, Ginzburg and…

Combinatorics · Mathematics 2021-07-21 Yongke Qu , Yuanlin Li

Let $G$ be a finite group, written multiplicatively. The Davenport constant of $G$ is the smallest positive integer $D(G)$ such that every sequence of $G$ with $D(G)$ elements has a non-empty subsequence with product $1$. Let $D_{2n}$ be…

Number Theory · Mathematics 2017-02-01 Fabio Enrique Brochero Martínez , Sávio Ribas

Let $G$ be a finite group multiplicatively written. The small Davenport constant of $G$ is the maximum positive integer ${\sf d}(G)$ such that there exists a sequence $S$ of length ${\sf d}(G)$ for which every subsequence of $S$ is…

Number Theory · Mathematics 2021-08-03 Fabio Enrique Brochero Martínez , Sávio Ribas

Let $G$ be a finite group written multiplicatively. By a sequence over $G$, we mean a finite sequence of terms from $G$ which is unordered, repetition of terms allowed, and we say that it is a product-one sequence if its terms can be…

Number Theory · Mathematics 2012-11-13 A. Geroldinger , D. J. Grynkiewicz

Let $G$ be a finite group, written multiplicatively. The Davenport constant of $G$ is the smallest positive integer $d$ such that every sequence of $G$ with $d$ elements has a non-empty subsequence with product $1$. Let $C_n \simeq \mathbb…

Number Theory · Mathematics 2017-02-01 Fabio Enrique Brochero Martínez , Sávio Ribas

Let $\mathcal{S}$ be a commutative semigroup, and let $T$ be a sequence of terms from the semigroup $\mathcal{S}$. We call $T$ an (additively) {\sl irreducible} sequence provided that no sum of its some terms vanishes. Given any element $a$…

Combinatorics · Mathematics 2015-06-25 Guoqing Wang

Let $\mathcal{S}$ be a finite commutative semigroup. The Davenport constant of $\mathcal{S}$, denoted ${\rm D}(\mathcal{S})$, is defined to be the least positive integer $\ell$ such that every sequence $T$ of elements in $\mathcal{S}$ of…

Combinatorics · Mathematics 2015-03-10 Guoqing Wang

Let $\mathcal{S}$ be a finite commutative semigroup written additively, and let $\exp(\mathcal{S})$ be its exponent which is defined as the least common multiple of all periods of the elements in $\mathcal{S}$. For every sequence $T$ of…

Combinatorics · Mathematics 2013-10-22 Sukumar Das Adhikari , Weidong Gao , Guoqing Wang

Let $G$ be a finite group. The small Davenport constant $\mathsf d(G)$ of $G$ is the maximal integer $\ell$ such that there is a sequence of length $\ell$ over $G$ which has no nonempty product-one subsequence. In 2007, Bass conjectured…

Combinatorics · Mathematics 2025-02-20 Guoqing Wang , Yang Zhao

Given an arbitrary group $G$ we construct a semigroup of idempotents (band) $B_G$ with the property that the free idempotent generated semigroup over $B_G$ has a maximal subgroup isomorphic to $G$. If $G$ is finitely presented then $B_G$ is…

Group Theory · Mathematics 2014-03-10 Igor Dolinka , Nik Ruškuc

For each group G which decomposes into a finitary direct product of free groups of finite rank we construct a regular band B such that the free idempotent generated semigroup over B contains a maximal subgroup isomorphic to G. In…

Group Theory · Mathematics 2013-03-26 Igor Dolinka

Let $G$ be a finite group. By a sequence over $G$, we mean a finite unordered sequence of terms from $G$, where repetition is allowed, and we say that it is a product-one sequence if its terms can be ordered such that their product equals…

Combinatorics · Mathematics 2019-05-06 Jun Seok Oh , Qinghai Zhong

We improve on earlier results on the closure under free products of the class of automaton semigroups. We consider partial automata and show that the free product of two self-similar semigroups (or automaton semigroups) is self-similar (an…

Group Theory · Mathematics 2025-09-01 Tara Macalister Brough , Jan Philipp Wächter , Janette Welker

Free idempotent generated semigroups IG$(E)$, where $E$ is a biordered set, have provided a focus of recent research, the majority of the efforts concentrating on the behaviour of the maximal subgroups. Inspired by an example of Brittenham,…

Rings and Algebras · Mathematics 2015-01-06 Yang Dandan , Victoria Gould
‹ Prev 1 2 3 10 Next ›