scholarly journals Monochromatic and Zero-Sum Sets of Nondecreasing Modified Diameter

10.37236/1054 ◽  
2006 ◽  
Vol 13 (1) ◽  
Author(s):  
David Grynkiewicz ◽  
Rasheed Sabar

Let $m$ be a positive integer whose smallest prime divisor is denoted by $p$, and let ${\Bbb Z}_m$ denote the cyclic group of residues modulo $m$. For a set $B=\{x_1,x_2,\ldots,x_m\}$ of $m$ integers satisfying $x_1 < x_2 < \cdots < x_m$, and an integer $j$ satisfying $2\leq j \leq m$, define $g_j(B)=x_j-x_1$. Furthermore, define $f_j(m,2)$ (define $f_j(m,{\Bbb Z}_m)$) to be the least integer $N$ such that for every coloring $\Delta : \{1,\ldots,N\}\rightarrow \{0,1\}$ (every coloring $\Delta : \{1,\ldots,N\}\rightarrow {\Bbb Z}_m$), there exist two $m$-sets $B_1,B_2\subset \{1,\ldots,N\}$ satisfying: (i) $\max(B_1) < \min(B_2)$, (ii) $g_j(B_1)\leq g_j(B_2)$, and (iii) $|\Delta (B_i)|=1$ for $i=1,2$ (and (iii) $\sum_{x\in B_i}\Delta (x)=0$ for $i=1,2$). We prove that $f_j(m,2)\leq 5m-3$ for all $j$, with equality holding for $j=m$, and that $f_j(m,{\Bbb Z}_m)\leq 8m+{m\over p}-6$. Moreover, we show that $f_j(m,2)\ge 4m-2+(j-1)k$, where $k=\left\lfloor\left(-1+\sqrt{{8m-9+j\over j-1}}\right){/2}\right\rfloor$, and, if $m$ is prime or $j\geq{m\over p}+p-1$, that $f_j(m,{\Bbb Z}_m)\leq 6m-4$. We conclude by showing $f_{m-1}(m,2)=f_{m-1}(m,{\Bbb Z}_m)$ for $m\geq 9$.

2016 ◽  
Vol 12 (04) ◽  
pp. 979-993 ◽  
Author(s):  
Pingzhi Yuan ◽  
Yuanlin Li

Let [Formula: see text] be an additively written finite cyclic group of order [Formula: see text] and let [Formula: see text] be a minimal zero-sum sequence with elements of [Formula: see text], i.e. the sum of elements of [Formula: see text] is zero, but no proper nontrivial subsequence of [Formula: see text] has sum zero. [Formula: see text] is called unsplittable if there do not exist an element [Formula: see text] in [Formula: see text] and two elements [Formula: see text] in [Formula: see text] such that [Formula: see text] and the new sequence [Formula: see text] is still a minimal zero-sum sequence. In this paper, we investigate long unsplittable minimal zero-sum sequences over [Formula: see text]. Our main result characterizes the structures of all such sequences [Formula: see text] and shows that the index of [Formula: see text] is at most 2, provided that the length of [Formula: see text] is greater than or equal to [Formula: see text] where [Formula: see text] is a positive integer with least prime divisor greater than [Formula: see text].


10.37236/1147 ◽  
2006 ◽  
Vol 13 (1) ◽  
Author(s):  
Hui-Qin Cao

Let $n>1$ be a positive integer and $p$ be the smallest prime divisor of $n$. Let $S$ be a sequence of elements from ${\Bbb Z}_n={\Bbb Z}/n{\Bbb Z}$ of length $n+k$ where $k\geq {n\over p}-1$. If every element of ${\Bbb Z}_n$ appears in $S$ at most $k$ times, we prove that there must be a subsequence of $S$ of length $n$ whose sum is zero when $n$ has only two distinct prime divisors.


2021 ◽  
Author(s):  
Ryszard Mazurek

AbstractFor any commutative semigroup S and positive integer m the power function $$f: S \rightarrow S$$ f : S → S defined by $$f(x) = x^m$$ f ( x ) = x m is an endomorphism of S. We partly solve the Lesokhin–Oman problem of characterizing the commutative semigroups whose all endomorphisms are power functions. Namely, we prove that every endomorphism of a commutative monoid S is a power function if and only if S is a finite cyclic group, and that every endomorphism of a commutative ACCP-semigroup S with an idempotent is a power function if and only if S is a finite cyclic semigroup. Furthermore, we prove that every endomorphism of a nontrivial commutative atomic monoid S with 0, preserving 0 and 1, is a power function if and only if either S is a finite cyclic group with zero adjoined or S is a cyclic nilsemigroup with identity adjoined. We also prove that every endomorphism of a 2-generated commutative semigroup S without idempotents is a power function if and only if S is a subsemigroup of the infinite cyclic semigroup.


1999 ◽  
Vol 22 (3) ◽  
pp. 655-658 ◽  
Author(s):  
Safwan Akbik

For a positive integern, letP(n)denotes the largest prime divisor ofnand define the set:𝒮(x)=𝒮={n≤x:n   does not divide   P(n)!}. Paul Erdös has proposed that|S|=o(x)asx→∞, where|S|is the number ofn∈S. This was proved by Ilias Kastanas. In this paper we will show the stronger result that|S|=O(xe−1/4logx).


1980 ◽  
Vol 79 ◽  
pp. 187-190 ◽  
Author(s):  
Shizuo Endo ◽  
Takehiko Miyata

There are some errors in Theorems 3.3 and 4.2 in [2]. In this note we would like to correct them.1) In Theorem 3.3 (and [IV]), the condition (1) must be replaced by the following one;(1) П is (i) a cyclic group, (ii) a dihedral group of order 2m, m odd, (iii) a direct product of a cyclic group of order qf, q an odd prime, f ≧ 1, and a dihedral group of order 2m, m odd, where each prime divisor of m is a primitive qf-1(q — 1)-th root of unity modulo qf, or (iv) a generalized quaternion group of order 4m, m odd, where each prime divisor of m is congruent to 3 modulo 4.


2012 ◽  
Vol 08 (02) ◽  
pp. 299-309 ◽  
Author(s):  
OTHMAN ECHI ◽  
NEJIB GHANMI

Let α ∈ ℤ\{0}. A positive integer N is said to be an α-Korselt number (Kα-number, for short) if N ≠ α and N - α is a multiple of p - α for each prime divisor p of N. By the Korselt set of N, we mean the set of all α ∈ ℤ\{0} such that N is a Kα-number; this set will be denoted by [Formula: see text]. Given a squarefree composite number, it is not easy to provide its Korselt set and Korselt weight both theoretically and computationally. The simplest kind of squarefree composite number is the product of two distinct prime numbers. Even for this kind of numbers, the Korselt set is far from being characterized. Let p, q be two distinct prime numbers. This paper sheds some light on [Formula: see text].


2017 ◽  
Vol 16 (03) ◽  
pp. 1750051 ◽  
Author(s):  
Jiangtao Shi ◽  
Wei Meng ◽  
Cui Zhang

Let [Formula: see text] be a finite group and [Formula: see text] any divisor of [Formula: see text], the order of [Formula: see text]. Let [Formula: see text], Frobenius’ theorem states that [Formula: see text] for some positive integer [Formula: see text]. We call [Formula: see text] a Frobenius quotient of [Formula: see text] for [Formula: see text]. Let [Formula: see text] be the set of all Frobenius quotients of [Formula: see text], we call [Formula: see text] the Frobenius spectrum of [Formula: see text]. In this paper, we give a complete classification of finite groups [Formula: see text] with [Formula: see text] for [Formula: see text] being the smallest prime divisor of [Formula: see text]. Moreover, let [Formula: see text] be a finite group of even order, [Formula: see text] the set of all Frobenius quotients of [Formula: see text] for even divisors of [Formula: see text] and [Formula: see text] the maximum Frobenius quotient in [Formula: see text], we prove that [Formula: see text] is always solvable if [Formula: see text] or [Formula: see text] and [Formula: see text] is not a composition factor of [Formula: see text].


2017 ◽  
Vol 14 (01) ◽  
pp. 167-191 ◽  
Author(s):  
Dongchun Han ◽  
Hanbin Zhang

Let [Formula: see text] be an additive finite abelian group with exponent [Formula: see text]. For any positive integer [Formula: see text], let [Formula: see text] be the smallest positive integer [Formula: see text] such that every sequence [Formula: see text] in [Formula: see text] of length at least [Formula: see text] has a zero-sum subsequence of length [Formula: see text]. Let [Formula: see text] be the Davenport constant of [Formula: see text]. In this paper, we prove that if [Formula: see text] is a finite abelian [Formula: see text]-group with [Formula: see text] then [Formula: see text] for every [Formula: see text], which confirms a conjecture by Gao et al. recently, where [Formula: see text] is a prime.


10.37236/3503 ◽  
2014 ◽  
Vol 21 (1) ◽  
Author(s):  
Yair Caro ◽  
Asaf Shapira ◽  
Raphael Yuster

One of the most basic results in graph theory states that every graph with at least two vertices has two vertices with the same degree. Since there are graphs without $3$ vertices of the same degree, it is natural to ask if for any fixed $k$, every graph $G$ is "close" to a graph $G'$ with  $k$ vertices of the same degree. Our main result in this paper is that this is indeed the case. Specifically, we show that for any positive integer $k$, there is a constant $C=C(k)$, so that given any graph $G$, one can remove from $G$ at most $C$ vertices and thus obtain a new graph $G'$ that contains at least $\min\{k,|G|-C\}$ vertices of the same degree.Our main tool is a multidimensional zero-sum theorem for integer sequences, which we prove using an old geometric approach of Alon and Berman.


2020 ◽  
Vol 30 (1) ◽  
pp. 15-25
Author(s):  
T. Banakh ◽  
◽  
A. Ravsky ◽  

A subset D of an abelian group is decomposable if ∅≠D⊂D+D. In the paper we give partial answers to an open problem asking whether every finite decomposable subset D of an abelian group contains a non-empty subset Z⊂D with ∑Z=0. For every n∈N we present a decomposable subset D of cardinality |D|=n in the cyclic group of order 2n−1 such that ∑D=0, but ∑T≠0 for any proper non-empty subset T⊂D. On the other hand, we prove that every decomposable subset D⊂R of cardinality |D|≤7 contains a non-empty subset T⊂D of cardinality |Z|≤12|D| with ∑Z=0. For every n∈N we present a subset D⊂Z of cardinality |D|=2n such that ∑Z=0 for some subset Z⊂D of cardinality |Z|=n and ∑T≠0 for any non-empty subset T⊂D of cardinality |T|<n=12|D|. Also we prove that every finite decomposable subset D of an Abelian group contains two non-empty subsets A,B such that ∑A+∑B=0.


Sign in / Sign up

Export Citation Format

Share Document