中文
相关论文

相关论文: Extremal product-one free sequences over $C_n \rti…

200 篇论文

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…

数论 · 数学 2017-02-01 Fabio Enrique Brochero Martínez , Sávio Ribas

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…

数论 · 数学 2017-02-01 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…

数论 · 数学 2012-11-13 A. Geroldinger , D. J. Grynkiewicz

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…

组合数学 · 数学 2019-05-06 Jun Seok Oh , Qinghai Zhong

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…

数论 · 数学 2012-11-13 D. J. Grynkiewicz

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…

组合数学 · 数学 2018-11-27 Dongchun Han , Hanbin Zhang

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…

组合数学 · 数学 2025-02-20 Guoqing Wang , Yang Zhao

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

群论 · 数学 2025-06-25 Jun Seok Oh

Let $G$ be a finite group. A sequence over $G$ is a finite multiset of elements of $G$, and it is called product-one if its terms can be ordered so that their product is the identity of $G$. The large Davenport constant $\D(G)$ is the…

Let $G$ be a group and $A\subseteq [1,\exp(G)-1]$. We define the constant ${\sf C}_A(G),$ which is the least positive integer $\ell$ such that every sequence over $G$ of length at least $\ell$ has an $A$-weighted consecutive product-one…

数论 · 数学 2024-04-18 A. Lemos , A. O. Moura , S. Ribas , A. T. Silva

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…

组合数学 · 数学 2021-07-21 Yongke Qu , Yuanlin Li

For a finite group $G,$ $\mathsf{D}(G)$ is defined as the least positive integer $k$ such that for every sequence $S=g_1\bdot g_2\bdot \dotsc \bdot g_k$ of length $k$ over $G$, there exist $1 \le i_1 < i_2 <\cdots < i_m \le k $ such that…

组合数学 · 数学 2025-11-25 Naveen K. Godara , Renu Joshi , Eshita Mazumdar

Let $G = C_{n_1} \oplus ... \oplus C_{n_r}$ with $1 < n_1 \t ... \t n_r$ be a finite abelian group, $\mathsf d^* (G) = n_1 + ... + n_r - r$, and let $\mathsf d (G)$ denote the maximal length of a zero-sum free sequence over $G$. Then…

组合数学 · 数学 2010-09-30 Alfred Geroldinger , Manfred Liebmann , Andreas Philipp

Let $G$ be a finite abelian group and let $\varnothing \neq A \subset \mathbb Z$. The $A$-weighted Davenport constant of $G$ is the smallest positive integer ${\sf D}_A(G)$ such that every sequence $x_1 \boldsymbol{\cdot} {\dots}…

数论 · 数学 2021-07-19 Fabio Enrique Brochero Martínez , Sávio Ribas

Let $G$ be a finite group. A finite collection of elements from $G$, where the order is disregarded and repetitions are allowed, is said to be a product-one sequence if its elements can be ordered such that their product in $G$ equals the…

组合数学 · 数学 2026-05-01 Jun Seok Oh , Sávio Ribas , Kevin Zhao , Qinghai Zhong

$G$ be an additive finite abelian group. The Davenport constant $\mathsf D(G)$ is the smallest integer $t$ such that every sequence (multiset) $S$ over $G$ of length $|S|\ge t$ has a non-empty zero-sum subsequence. Recently, B. Girard…

组合数学 · 数学 2018-03-01 Dongchun Han

For a finite group $G$, we denote by ${\sf d}(G)$ and by ${\sf E}(G)$, respectively, the small Davenport constant and the Gao constant of $G$. Let $C_n$ be the cyclic group of order $n$ and let $G_{m,n,s} = C_n \rtimes_s C_m$ be a…

The small Davenport constant ${\mathsf{d}}(G)$ of a finite group $G$ is defined to be the maximal length of a sequence over $G$ which has no non-trivial product-one subsequence. In this paper, we prove that ${\mathsf{d}}(G) = 6$ for the…

群论 · 数学 2024-04-03 Naveen K. Godara , Siddhartha Sarkar

Let $G$ be a finite abeilian group. A sequence $S$ with terms from $G$ is zero-sum if the sum of terms in $S$ equals zero. It is a minimal zero-sum sequence if no proper, nontrivial subsequence is zero-sum. The maximal length of a minimal…

数论 · 数学 2008-01-25 Weidong Gao , Alfred Geroldinger , David J. Grynkiewicz

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…

‹ 上一页 1 2 3 10 下一页 ›