Lupa

Show document Help

A- | A+ | Print
Title:Optimal bounds for zero-sum cycles. I. Odd order
Authors:ID Campbell, Rutger (Author)
ID Gollin, J. Pascal (Author)
ID Hendrey, Kevin (Author)
ID Steiner, Raphael (Author)
Files:.pdf RAZ_Campbell_Rutger_2025.pdf (398,18 KB)
MD5: 04D3C761C9D4A49FC0F15D068A107C11
 
URL https://www.sciencedirect.com/science/article/pii/S0095895625000243?via%3Dihub
 
Language:English
Work type:Article
Typology:1.01 - Original Scientific Article
Organization:FAMNIT - Faculty of Mathematics, Science and Information Technologies
Abstract:For a finite (not necessarily abelian) group Γ, let n(Γ) denote the smallest positive integer $n$ such that for each labelling of the arcs of the complete digraph of order n using elements from Γ, there exists a directed cycle such that the arc-labels along the cycle multiply to the identity. Alon and Krivelevich [2] initiated the study of the parameter n(.) on cyclic groups and proved n(Z_q) = O(q log q). This was later improved to a linear bound of n(Γ) <= 8|Γ| for every finite abelian group Γ by Mészáros and the last author [8], and then further to n(Γ) <= 2|Γ|-1 for every non-trivial finite group independently by Berendsohn, Boyadzhiyska and Kozma [3] as well as by Akrami, Alon, Chaudhury, Garg, Mehlhorn and Mehta [1]. In this series of two papers we conclude this line of research by proving that n(Γ) < |Γ|+1 for every finite group Γ, which is the best possible such bound in terms of the group order and precisely determines the value for all cyclic groups as n(Z_q) = q+1. In the present paper we prove the above result for all groups of odd order. The proof for groups of even order needs to overcome substantial additional obstacles and will be presented in the second part of this series.
Keywords:Zero-sum Ramsey theory, directed cycles, Zero-sum cycles
Publication version:Version of Record
Publication date:16.04.2025
Year of publishing:2025
Number of pages:str. 246-256
Numbering:Vol. 173
PID:20.500.12556/RUP-22140 This link opens in a new window
UDC:51
ISSN on article:0095-8956
DOI:10.1016/j.jctb.2025.04.003 This link opens in a new window
COBISS.SI-ID:258490115 This link opens in a new window
Publication date in RUP:24.11.2025
Views:293
Downloads:4
Metadata:XML DC-XML DC-RDF
:
Copy citation
  
Average score:(0 votes)
Your score:Voting is allowed only for logged in users.
Share:Bookmark and Share


Hover the mouse pointer over a document title to show the abstract or click on the title to get all document metadata.

Record is a part of a journal

Title:Journal of combinatorial theory
Shortened title:J. comb. theory, Ser. B
Publisher:Academic Press
ISSN:0095-8956
COBISS.SI-ID:25721600 This link opens in a new window

Licences

License:CC BY 4.0, Creative Commons Attribution 4.0 International
Link:http://creativecommons.org/licenses/by/4.0/
Description:This is the standard Creative Commons license that gives others maximum freedom to do what they want with the work as long as they credit the author.

Secondary language

Language:Slovenian
Title:Optimal bounds for zero-sum cycles
Keywords:Ramseyjeva teorija ničelne vsote, usmerjeni cikli, cikli ničelne vsote


Comments

Leave comment

You must log in to leave a comment.

Comments (0)
0 - 0 / 0
 
There are no comments!

Back
Logos of partners University of Maribor University of Ljubljana University of Primorska University of Nova Gorica