中文
相关论文

相关论文: Enumeration of idempotent-sum subsequences in fini…

200 篇论文

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…

组合数学 · 数学 2020-06-02 Guoqing Wang

Let $G$ be a finite abelian group, and let $\eta(G)$ be the smallest integer $d$ such that every sequence over $G$ of length at least $d$ contains a zero-sum subsequence $T$ with length $|T|\in [1,\exp(G)]$. In this paper, we investigate…

数论 · 数学 2011-08-16 Yushuang Fan , Weidong Gao , Guoqing Wang , Qinghai Zhong , Jujuan Zhuang

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…

组合数学 · 数学 2025-09-24 Guoqing Wang

Let $C_n$ be a cyclic group of order $n$. A sequence $S$ of length $\ell$ over $C_n$ is a sequence $S = a_1\boldsymbol\cdot a_2\boldsymbol\cdot \ldots\boldsymbol\cdot a_{\ell}$ of $\ell$ elements in $C_n$, where a repetition of elements is…

组合数学 · 数学 2024-09-04 Sang June Lee , Jun Seok Oh

Let $G$ be a finite cyclic group. Every sequence $S$ over $G$ can be written in the form $S=(n_1g)\cdot\ldots\cdot(n_lg)$ where $g\in G$ and $n_1, \ldots, n_l\in[1, \ord(g)]$, and the index $\ind(S)$ of $S$ is defined to be the minimum of…

组合数学 · 数学 2013-03-08 Yuanlin Li , Jiangtao Peng

Let $\mathbb Z_n$ be the cyclic group of order $n \ge 3$ additively written. S. Savchev \& F. Chen (2007) proved that for each zero-sum free sequence $S = a_1 \bullet \dots \bullet a_t$ over $\mathbb Z_n$ of length $t > n/2$, there is an…

数论 · 数学 2018-11-12 Sávio Ribas

Let $G$ be a finite cyclic group. Every sequence $S$ over $G$ can be written in the form $S=(n_1g)\cdot...\cdot(n_kg)$ where $g\in G$ and $n_1,\cdots,n_k\in[1,{\hbox{\rm ord}}(g)]$, and the index $\ind S$ of $S$ is defined to be the minimum…

数论 · 数学 2014-02-03 Li-meng Xia , Caixia Shen

Let $G$ be a finite cyclic group. Every sequence $S$ of length $l$ over $G$ can be written in the form $S=(n_1g)\cdot\ldots\cdot(n_lg)$ where $g\in G$ and $n_1, \ldots, n_l\in[1, \ord(g)]$, and the index $\ind(S)$ of $S$ is defined to be…

组合数学 · 数学 2013-03-08 Jiangtao Peng , Yuanlin Li

The purpose of this paper is to begin studying the computation of the nonzero determinant of semigroups within the class of finite semigroups that possesses a pair of non-commutative idempotents. This paper focuses on a class of these…

群论 · 数学 2025-02-18 M. H. Shahzamanian

Let $\mathcal{S}$ be a finite semigroup, and let $E(\mathcal{S})$ be the set of all idempotents of $\mathcal{S}$. Gillam, Hall and Williams proved in 1972 that every $\mathcal{S}$-valued sequence $T$ of length at least…

组合数学 · 数学 2016-04-05 Guoqing Wang

Let $G$ be a finite cyclic group. Every sequence $S$ over $G$ can be written in the form $S=(n_1g)\cdot\ldots\cdot(n_lg)$ where $g\in G$ and $n_1, \ldots, n_l\in[1, \ord(g)]$, and the index $\ind(S)$ of $S$ is defined to be the minimum of…

数论 · 数学 2014-02-04 Caixia Shen , Li-meng Xia , Yuanlin Li

Let $G$ be a finite cyclic group of order $n \ge 2$. Every sequence $S$ over $G$ can be written in the form $S=(n_1g)\cdot ... \cdot (n_lg)$ where $g\in G$ and $n_1,..., n_l \in [1,\ord(g)]$, and the index $\ind (S)$ of $S$ is defined as…

组合数学 · 数学 2011-03-14 Weidong Gao , Yuanlin Li , Jiangtao Peng , Chris Plyley , Guoqing Wang

Let $G$ be a finite cyclic group. Every sequence $S$ over $G$ can be written in the form $S=(n_1g)\cdot...\cdot(n_lg)$ where $g\in G$ and $n_1,\cdots,n_l\in[1,{\hbox{\rm ord}}(g)]$, and the index $\ind S$ of $S$ is defined to be the minimum…

数论 · 数学 2014-01-31 Caixia Shen , Li-meng Xia

By using the structure and some properties of extraspecial and generalized/almost extraspecial $p$-groups, we explicitly determine the number of elements of specific orders in such groups. As a consequence, one may find the number of cyclic…

群论 · 数学 2024-05-08 Mihai-Silviu Lazorec

A sequence in the additive group ${\mathbb Z}_n$ of integers modulo $n$ is called $n$-zero-free if it does not contain subsequences with length $n$ and sum zero. The article characterizes the $n$-zero-free sequences in ${\mathbb Z}_n$ of…

组合数学 · 数学 2007-05-23 Svetoslav Savchev , Fang Chen

The number of subgroups and the number of cyclic subgroups are natural combinatorial invariants of a finite group. We investigate how restrictions on these quantities, together with the number of distinct prime divisors of $|G|$, enforce…

群论 · 数学 2026-04-10 Angsuman Das , Hiranya Kishore Dey , Khyati Sharma

In this note, we show that among finite nilpotent groups of a given order or finite groups of a given odd order, the cyclic group of that order has the minimum number of edges in its cyclic subgroup graph. We also conjecture that this holds…

群论 · 数学 2023-02-14 Marius Tărnăuceanu

The purpose of the article is to provide an unified way to formulate zero-sum invariants. Let $G$ be a finite additive abelian group. Let $B(G)$ denote the set consisting of all nonempty zero-sum sequences over G. For $\Omega \subset B(G$),…

组合数学 · 数学 2017-02-06 Weidong Gao , Yuanlin Li , Jiangtao Peng , Guoqing Wang

Let $G$ be an additive finite abelian group, and let $\mathrm{disc}(G)$ denote the smallest positive integer $t$ with the property that every sequence $S$ over $G$ with length $|S|\geq t $ contains two nonempty zero-sum subsequences of…

组合数学 · 数学 2025-10-17 Wanzhen Hui , Xue Li

Let $G$ be a finite abelian group, and let $S$ be a sequence over $G$. Let $f(S)$ denote the number of elements in $G$ which can be expressed as the sum over a nonempty subsequence of $S$. In this paper, we determine all the sequences $S$…

数论 · 数学 2009-09-14 Pingzhi Yuan
‹ 上一页 1 2 3 10 下一页 ›