<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN"
	"http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
	<title>On Short Zero-sum Subsequences of Zero-sum Sequences | Fan | The Electronic Journal of Combinatorics</title>
	<meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
	<meta name="description" content="On Short Zero-sum Subsequences of Zero-sum Sequences" />
			<meta name="keywords" content="Zero-sum sequence; short zero-sum sequence; short free sequence; zero-sum short free sequence; Davenport constant" />
	
	<link rel="icon" href="../../../../public/journals/1/journalFavicon_en_US.ico" />
	<link rel="schema.DC" href="http://purl.org/dc/elements/1.1/" />

	<meta name="DC.Creator.PersonalName" content="Yushuang Fan"/>
	<meta name="DC.Creator.PersonalName" content="Weidong Gao"/>
	<meta name="DC.Creator.PersonalName" content="Guoqing Wang"/>
	<meta name="DC.Creator.PersonalName" content="Qinghai Zhong"/>
	<meta name="DC.Creator.PersonalName" content="Jujuan Zhuang"/>
	<meta name="DC.Date.created" scheme="ISO8601" content="2012-09-06"/>
	<meta name="DC.Date.dateSubmitted" scheme="ISO8601" content="2012-08-03"/>
	<meta name="DC.Date.issued" scheme="ISO8601" content="2012-07-12"/>
	<meta name="DC.Date.modified" scheme="ISO8601" content="2012-09-06"/>
	<meta name="DC.Description" xml:lang="en" content="Let $G$ be a finite abelian group of exponent $\exp(G)$. By $D(G)$ we denote the smallest integer $d\in \mathbb N$ such that every sequence over $G$ of length at least $d$ contains a nonempty zero-sum subsequence. By $\eta(G)$ we denote the smallest integer $d\in \mathbb N$ such that every sequence over $G$ of length at least $d$ contains a zero-sum subsequence $T$ with length $|T|\in [1,\exp(G)]$, such a sequence $T$ will be called a short zero-sum sequence. Let $C_0(G)$ denote the set consists of all integer $t\in [D(G)+1,\eta(G)-1]$ such that every zero-sum sequence of length exactly $t$ contains a short zero-sum subsequence. In this paper, we investigate the question whether $C_0(G)\neq \emptyset$ for all non-cyclic finite abelian groups $G$. Previous results showed that $C_0(G)\neq \emptyset$ for the groups $C_n^2$ ($n\geq 3$) and $C_3^3$. We show that more groups including the groups $C_m\oplus C_n$ with $3\leq m\mid n$, $C_{3^a5^b}^3$, $C_{3\times 2^a}^3$, $C_{3^a}^4$ and $C_{2^b}^r$ ($b\geq 2$) have this property. We also determine $C_0(G)$ completely  for some groups including the groups of rank two, and some special groups with large exponent."/>
	<meta name="DC.Format" scheme="IMT" content="application/pdf"/>		
	<meta name="DC.Identifier" content="v19i3P31"/>
	<meta name="DC.Identifier.pageNumber" content="P31"/>
		<meta name="DC.Identifier.URI" content="http://www.combinatorics.org/ojs/index.php/eljc/article/view/v19i3P31"/>
	<meta name="DC.Language" scheme="ISO639-1" content=""/>
	<meta name="DC.Rights" content=" The copyright of published papers remains with the authors.  We only require your agreement that we publish it, as described in the following publication release agreement:    This is an agreement between the Electronic Journal of Combinatorics (the &quot;Journal&quot;), and the copyright owner (the &quot;Owner&quot;)     of a work (the &quot;Work&quot;) to be published in the Journal.  The Owner warrants that s/he has the full power and authority     to enter into this Agreement and to grant the rights granted in this     Agreement.   The Owner hereby grants to the Journal a worldwide, irrevocable,     royalty free license to publish or distribute the Work, to enter into            arrangements with others to publish or distribute the Work, and to     archive the Work.   The Owner agrees that further publication of the Work,     with the same or substantially the same content as appears in the     Journal, will include an acknowledgement of prior publication     in the Journal.  "/>
	<meta name="DC.Source" content="The Electronic Journal of Combinatorics"/>
	<meta name="DC.Source.ISSN" content="1077-8926"/>
	<meta name="DC.Source.Issue" content="3"/>
	<meta name="DC.Source.URI" content="http://www.combinatorics.org/ojs/index.php/eljc"/>
	<meta name="DC.Source.Volume" content="19"/>
						<meta name="DC.Subject" xml:lang="en" content="Zero-sum sequence"/>
								<meta name="DC.Subject" xml:lang="en" content="short zero-sum sequence"/>
								<meta name="DC.Subject" xml:lang="en" content="short free sequence"/>
								<meta name="DC.Subject" xml:lang="en" content="zero-sum short free sequence"/>
								<meta name="DC.Subject" xml:lang="en" content="Davenport constant"/>
				<meta name="DC.Title" content="On Short Zero-sum Subsequences of Zero-sum Sequences"/>
		<meta name="DC.Type" content="Text.Serial.Journal"/>
	<meta name="DC.Type.articleType" content="Papers"/>	
		<meta name="gs_meta_revision" content="1.1" />
	<meta name="citation_journal_title" content="The Electronic Journal of Combinatorics"/>
	<meta name="citation_issn" content="1077-8926"/>
	<meta name="citation_authors" content="Fan, Yushuang; Gao, Weidong; Wang, Guoqing; Zhong, Qinghai; Zhuang, Jujuan"/>
	<meta name="citation_title" content="On Short Zero-sum Subsequences of Zero-sum Sequences"/>

	<meta name="citation_date" content="06/09/2012"/>

	<meta name="citation_volume" content="19"/>
	<meta name="citation_issue" content="3"/>
	<meta name="citation_firstpage" content="P31"/>
		<meta name="citation_abstract_html_url" content="http://www.combinatorics.org/ojs/index.php/eljc/article/view/v19i3P31"/>
						<meta name="citation_keywords" xml:lang="en" content="Zero-sum sequence"/>
								<meta name="citation_keywords" xml:lang="en" content="short zero-sum sequence"/>
								<meta name="citation_keywords" xml:lang="en" content="short free sequence"/>
								<meta name="citation_keywords" xml:lang="en" content="zero-sum short free sequence"/>
								<meta name="citation_keywords" xml:lang="en" content="Davenport constant"/>
				<meta name="citation_pdf_url" content="http://www.combinatorics.org/ojs/index.php/eljc/article/view/v19i3P31/pdf"/>
	

	<link rel="stylesheet" href="../../../../lib/pkp/styles/pkp.css" type="text/css" />
	<link rel="stylesheet" href="../../../../lib/pkp/styles/common.css" type="text/css" />
	<link rel="stylesheet" href="../../../../styles/common.css" type="text/css" />
	<link rel="stylesheet" href="../../../../styles/articleView.css" type="text/css" />
			<link rel="stylesheet" href="../../../../lib/pkp/styles/rtEmbedded.css" type="text/css" />
	
	
	
	<link rel="stylesheet" href="../../../../styles/sidebar.css" type="text/css" />		<link rel="stylesheet" href="../../../../styles/rightSidebar.css" type="text/css" />	
			<link rel="stylesheet" href="../../../../public/journals/1/journalStyleSheet.css" type="text/css" />
	
	<!-- Base Jquery -->
	<script type="text/javascript" src="http://www.google.com/jsapi"></script>
	<script type="text/javascript">
		// Provide a local fallback if the CDN cannot be reached
		if (typeof google == 'undefined') {
			document.write(unescape("%3Cscript src='http://www.combinatorics.org/ojs/lib/pkp/js/lib/jquery/jquery.min.js' type='text/javascript'%3E%3C/script%3E"));
			document.write(unescape("%3Cscript src='http://www.combinatorics.org/ojs/lib/pkp/js/lib/jquery/plugins/jqueryUi.min.js' type='text/javascript'%3E%3C/script%3E"));
		} else {
			google.load("jquery", "1.4.2");
			google.load("jqueryui", "1.8.1");
		}
	
</script>
	
	<script type="text/javascript" src="../../../../lib/pkp/js/jquery.cookie.js"></script>
	<script type="text/javascript" src="../../../../lib/pkp/js/fontController.js" ></script>
	<script type="text/javascript">
		$(function(){
			fontSize("#sizer", "body", 9, 16, 32, "/ojs"); // Initialize the font sizer
		});
	
</script>


	<script type="text/javascript" src="../../../../lib/pkp/js/general.js"></script>
	
	<!-- MathJax plugin -->
		<script type="text/javascript"
			src="http://cdn.mathjax.org/mathjax/latest/MathJax.js?config=TeX-AMS-MML_HTMLorMML">
                    MathJax.Hub.Config({
                       tex2jax: {
                        inlineMath: [ ["$","$"], ["\\(","\\)"] ],
                        displayMath: [ ["$$","$$"], ["\\[","\\]"] ],
                        processEscapes: true,
                        processEnvironments: true }
                       });
		</script>
	<!-- / MathJax plugin -->
	<script language="javascript" type="text/javascript" src="../../../../js/articleView.js"></script>
	<script language="javascript" type="text/javascript" src="../../../../js/pdfobject.js"></script>

</head>
<body>

<div id="container">
<div id="fade" class="black_overlay"></div>
<div id="header">
<div id="headerTitle">
<h1>
	<img src="../../../../public/journals/1/pageHeaderTitleImage_en_US.png" width="744" height="137" alt="The Electronic Journal of Combinatorics" />
</h1>
</div>
</div>

<div id="body">

	<div id="sidebar">
							<div id="rightSidebar">
				<div class="block" id="sidebarHelp">
	<a class="blockTitle" href="javascript:openHelp('http://www.combinatorics.org/ojs/index.php/eljc/help')">Journal Help</a>
</div><div class="block" id="sidebarUser">
			<span class="blockTitle">User</span>
		
						<form method="post" action="http://www.combinatorics.org/ojs/index.php/eljc/login/signIn">
				<table>
					<tr>
						<td><label for="sidebar-username">Username</label></td>
						<td><input type="text" id="sidebar-username" name="username" value="" size="12" maxlength="32" class="textField" /></td>
					</tr>
					<tr>
						<td><label for="sidebar-password">Password</label></td>
						<td><input type="password" id="sidebar-password" name="password" value="" size="12" maxlength="32" class="textField" /></td>
					</tr>
					<tr>
						<td colspan="2"><input type="checkbox" id="remember" name="remember" value="1" /> <label for="remember">Remember me</label></td>
					</tr>
					<tr>
						<td colspan="2"><input type="submit" value="Log In" class="button" /></td>
					</tr>
				</table>
			</form>
			</div><div class="block" id="sidebarInformation">
	<span class="blockTitle">Information</span>
	<ul>
		<li><a href="../../information/readers">For Readers</a></li>		<li><a href="../../information/authors">For Authors</a></li>		<li><a href="../../information/librarians">For Librarians</a></li>	</ul>
</div>


<div class="block" id="sidebarRTArticleTools">

	<span class="blockTitle">Article Tools</span>
							<div class="articleToolItem">
		<img src="../../../../plugins/blocks/readingTools/icons/editorialPolicies.png" class="articleToolIcon" /> <a href="http://www.combinatorics.org/ojs/index.php/eljc/about/editorialPolicies#peerReviewProcess" target="_parent">Review policy</a>
	</div>
			<div class="articleToolItem">
			<img src="../../../../plugins/blocks/readingTools/icons/emailArticle.png" class="articleToolIcon" />
			Email this article <span style="font-size: 0.8em">(Login required)</span>		</div>
				<div class="articleToolItem">
			<img src="../../../../plugins/blocks/readingTools/icons/emailArticle.png" class="articleToolIcon" />
			Email the author <span style="font-size: 0.8em">(Login required)</span>		</div>
		</div>
 <div class="block" id="notification">
	<span class="blockTitle">Notifications</span>
	<ul>
					<li><a href="../../notification">View</a></li>
			<li><a href="http://www.combinatorics.org/ojs/index.php/eljc/notification/subscribeMailList">Subscribe</a> / <a href="http://www.combinatorics.org/ojs/index.php/eljc/notification/unsubscribeMailList">Unsubscribe</a></li>	
			</ul>
</div>
<div class="block" id="sidebarNavigation">
	<span class="blockTitle">Journal Content</span>
	
	<span class="blockSubtitle">Search</span>
	<form method="post" action="http://www.combinatorics.org/ojs/index.php/eljc/search/results">
	<table>
	<tr>
		<td><input type="text" id="query" name="query" size="15" maxlength="255" value="" class="textField" /></td>
	</tr>
	<tr>
		<td><select name="searchField" size="1" class="selectMenu">
			<option label="All" value="">All</option>
<option label="Authors" value="1">Authors</option>
<option label="Title" value="2">Title</option>
<option label="Abstract" value="4">Abstract</option>
<option label="Index terms" value="120">Index terms</option>
<option label="Full Text" value="128">Full Text</option>

		</select></td>
	</tr>
	<tr>
		<td><input type="submit" value="Search" class="button" /></td>
	</tr>
	</table>
	</form>
	
	<br />
	
		<span class="blockSubtitle">Browse</span>
	<ul>
		<li><a href="../../issue/archive">By Issue</a></li>
		<li><a href="../../search/authors">By Author</a></li>
		<li><a href="../../search/titles">By Title</a></li>
				<li><a href="../../../index">Other Journals</a></li>
			</ul>
	</div>
<div class="block" id="sidebarFontSize" style="margin-bottom: 4px;">
	<span class="blockTitle">Font Size</span>
	<div id="sizer"></div>
</div>
<br />
			</div>
			</div>

<div id="main">

<div id="navbar">
	<ul class="menu">
		<li id="home"><a href="../../index">Home</a></li>
		<li id="about"><a href="../../about">About</a></li>

					<li id="login"><a href="../../login">Log In</a></li>
							<li id="register"><a href="../../user/register">Register</a></li>
										<li id="search"><a href="../../search/index.html">Search</a></li>
		
					<li id="current"><a href="../../issue/current">Current</a></li>
			<li id="archives"><a href="../../issue/archive">Archives</a></li>
		
				

									<li id="navItem"><a href="../../../../../issue/view/Surveys">SURVEYS</a></li>
											</ul>
</div>

<div id="breadcrumb">
	<a href="../../index" target="_parent">Home</a> &gt;
	<a href="../../issue/view/Volume19-3" target="_parent">Volume 19, Issue 3 (2012)</a> &gt;	<a href="http://www.combinatorics.org/ojs/index.php/eljc/article/view/v19i3P31/0" class="current" target="_parent">P31</a>
</div>

<div id="content">

	<div id="topBar">
					</div>
		
	<div id="articleTitle"><h3>On Short Zero-sum Subsequences of Zero-sum Sequences</h3></div>
	<div id="authorString"><em>Yushuang Fan, Weidong Gao, Guoqing Wang, Qinghai Zhong, Jujuan Zhuang</em></div>
	<br />
			<div id="articleAbstract">
		<h4>Abstract</h4>
		<br />
		<div>Let $G$ be a finite abelian group of exponent $\exp(G)$. By $D(G)$ we denote the smallest integer $d\in \mathbb N$ such that every sequence over $G$ of length at least $d$ contains a nonempty zero-sum subsequence. By $\eta(G)$ we denote the smallest integer $d\in \mathbb N$ such that every sequence over $G$ of length at least $d$ contains a zero-sum subsequence $T$ with length $|T|\in [1,\exp(G)]$, such a sequence $T$ will be called a short zero-sum sequence. Let $C_0(G)$ denote the set consists of all integer $t\in [D(G)+1,\eta(G)-1]$ such that every zero-sum sequence of length exactly $t$ contains a short zero-sum subsequence. In this paper, we investigate the question whether $C_0(G)\neq \emptyset$ for all non-cyclic finite abelian groups $G$. Previous results showed that $C_0(G)\neq \emptyset$ for the groups $C_n^2$ ($n\geq 3$) and $C_3^3$. We show that more groups including the groups $C_m\oplus C_n$ with $3\leq m\mid n$, $C_{3^a5^b}^3$, $C_{3\times 2^a}^3$, $C_{3^a}^4$ and $C_{2^b}^r$ ($b\geq 2$) have this property. We also determine $C_0(G)$ completely  for some groups including the groups of rank two, and some special groups with large exponent.</div>
		<br />
		</div>
	
			<div id="articleSubject">
		<h4>Keywords</h4>
		<br />
		<div>Zero-sum sequence; short zero-sum sequence; short free sequence; zero-sum short free sequence; Davenport constant</div>
		<br />
		</div>
	
	
				
			Full Text:
									<a href="http://www.combinatorics.org/ojs/index.php/eljc/article/view/v19i3P31/pdf" class="file" target="_parent">PDF</a>
													





</div><!-- content -->
</div><!-- main -->
</div><!-- body -->



</div> <!-- container -->
</body>
</html>
