Pełnotekstowe zasoby PLDML oraz innych baz dziedzinowych są już dostępne w nowej Bibliotece Nauki.
Zapraszamy na https://bibliotekanauki.pl
Preferencje help
Widoczny [Schowaj] Abstrakt
Liczba wyników

Znaleziono wyników: 5

Liczba wyników na stronie
first rewind previous Strona / 1 next fast forward last

Wyniki wyszukiwania

help Sortuj według:

help Ogranicz wyniki do:
first rewind previous Strona / 1 next fast forward last
1
Content available remote

On the index of length four minimal zero-sum sequences

100%
EN
Let G be a finite cyclic group. Every sequence S over G can be written in the form $S = (n₁g)·...·(n_{l}g)$ where g ∈ G and $n₁,..., n_{l}i ∈ [1,ord(g)]$, and the index ind(S) is defined to be the minimum of $(n₁+ ⋯ +n_{l})/ord(g)$ over all possible g ∈ G such that ⟨g⟩ = G. A conjecture says that every minimal zero-sum sequence of length 4 over a finite cyclic group G with gcd(|G|,6) = 1 has index 1. This conjecture was confirmed recently for the case when |G| is a product of at most two prime powers. However, the general case is still open. In this paper, we make some progress towards solving the general case. We show that if G = ⟨g⟩ is a finite cyclic group of order |G| = n such that gcd(n,6) = 1 and S = (x₁g)·(x₂g)·(x₃g)·(x₄g) is a minimal zero-sum sequence over G such that x₁,...,x₄ ∈ [1,n-1] with gcd(n,x₁,x₂,x₃,x₄) = 1, and $gcd(n,x_{i}) > 1$ for some i ∈ [1,4], then ind(S) = 1. By using a new method, we give a much shorter proof to the index conjecture for the case when |G| is a product of two prime powers.
2
Content available remote

On a conjecture of Lemke and Kleitman

100%
EN
Let G be a finite cyclic group of order n ≥ 2. Every sequence S over G can be written in the form $S = (n_1 g)· ... · (n_lg)$ where g ∈ G and $n_1, ..., n_l ∈ [1,ord(g)]$, and the index ind(S) of S is defined as the minimum of $(n_1 + ⋯ + n_l )/ord(g)$ over all g ∈ G with ord(g) = n. In this paper it is shown that any sequence S over G of length |S| ≥ n ≥ 5, 2 ∤ n, having an element with multiplicity at least n/3 has a subsequence T with ind(T) = 1. On the other hand, if n,d ≥ 2 are positive integers with d|n and $n > d²(d³-d²+d+1), we provide an example of a sequence S of length |S| ≥ n having an element with multiplicity l = n/d - d(d-1) - 1 such that S has no subsequence T with ind(T) = 1, giving a general counterexample to a conjecture of Lemke and Kleitman.
3
Content available remote

A quantitative aspect of non-unique factorizations: the Narkiewicz constants II

100%
EN
Let K be an algebraic number field with non-trivial class group G and $𝓞_{K}$ be its ring of integers. For k ∈ ℕ and some real x ≥ 1, let $F_{k}(x)$ denote the number of non-zero principal ideals $a𝓞_{K}$ with norm bounded by x such that a has at most k distinct factorizations into irreducible elements. It is well known that $F_{k}(x)$ behaves, for x → ∞, asymptotically like $x(log x)^{1/|G|-1} (loglogx)^{𝖭_{k}(G)}$. In this article, it is proved that for every prime p, $𝖭₁(C_{p}⊕ C_{p}) = 2p$, and it is also proved that $𝖭₁ (C_{mp}⊕ C_{mp}) = 2mp$ if $𝖭₁ (C_{m}⊕ C_{m}) = 2m$ and m is large enough. In particular, it is shown that for each positive integer n there is a positive integer m such that $𝖭₁(C_{mn}⊕ C_{mn}) = 2mn$. Our results partly confirm a conjecture given by W. Narkiewicz thirty years ago, and improve the known results substantially.
4
100%
EN
Let G be an additive finite abelian group. For every positive integer ℓ, let $disc_{ℓ}(G)$ be the smallest positive integer t such that each sequence S over G of length |S| ≥ t has a nonempty zero-sum subsequence of length not equal to ℓ. In this paper, we determine $disc_{ℓ}(G)$ for certain finite groups, including cyclic groups, the groups $G = C₂ ⊕ C_{2m}$ and elementary abelian 2-groups. Following Girard, we define disc(G) as the smallest positive integer t such that every sequence S over G with |S| ≥ t has nonempty zero-sum subsequences of distinct lengths. We shall prove that $disc(G) = max{disc_{ℓ}(G) | ℓ ≥ 1}$ and determine disc(G) for finite abelian p-groups G, where p ≥ r(G) and r(G) is the rank of G.
5
Content available remote

On the index of sequences over cyclic groups

88%
first rewind previous Strona / 1 next fast forward last
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.