Commentationes Mathematicae Universitatis Carolinae

Similar documents
TILING ABELIAN GROUPS WITH A SINGLE TILE

Commentationes Mathematicae Universitatis Carolinae

Acta Universitatis Carolinae. Mathematica et Physica

arxiv:math/ v1 [math.ca] 8 Apr 2001

Commentationes Mathematicae Universitatis Carolinae

10 KHALID AMIN 1. Introduction A famous theorem of Hajos [4] is the following: If G = A 1 :::A n is a factorization of a group G, where each of the su

#A45 INTEGERS 9 (2009), BALANCED SUBSET SUMS IN DENSE SETS OF INTEGERS. Gyula Károlyi 1. H 1117, Hungary

Commentationes Mathematicae Universitatis Carolinae

Czechoslovak Mathematical Journal

Acta Universitatis Carolinae. Mathematica et Physica

Commentationes Mathematicae Universitatis Carolinae

Commentationes Mathematicae Universitatis Carolinae

Czechoslovak Mathematical Journal

Czechoslovak Mathematical Journal

Acta Mathematica et Informatica Universitatis Ostraviensis

xy xyy 1 = ey 1 = y 1 i.e.

Acta Universitatis Carolinae. Mathematica et Physica

Mathematica Slovaca. Jaroslav Hančl; Péter Kiss On reciprocal sums of terms of linear recurrences. Terms of use:

ACO Comprehensive Exam 19 March Graph Theory

Acta Universitatis Palackianae Olomucensis. Facultas Rerum Naturalium. Mathematica

Mathematica Bohemica

Mathematica Bohemica

Commentationes Mathematicae Universitatis Carolinae

Applications of Mathematics

Mathematica Bohemica

Research Methods in Mathematics Homework 4 solutions

Mathematica Slovaca. Zbigniew Piotrowski Somewhat continuity on linear topological spaces implies continuity

Section II.1. Free Abelian Groups

Mathematica Slovaca. Antonín Dvořák; David Jedelský; Juraj Kostra The fields of degree seven over rationals with a normal basis generated by a unit

Mathematica Slovaca. Ján Jakubík On the α-completeness of pseudo MV-algebras. Terms of use: Persistent URL:

Commentationes Mathematicae Universitatis Carolinae

Fuchs Problem When Torsion-Free Abelian Rank-One Groups are Slender

Periodic decomposition of measurable integer valued functions

Matematický časopis. Bedřich Pondělíček A Note on Classes of Regularity in Semigroups. Terms of use: Persistent URL:

CHAPTER 8: EXPLORING R

Written Homework # 2 Solution

Prove proposition 68. It states: Let R be a ring. We have the following

MA441: Algebraic Structures I. Lecture 18

Acta Mathematica Universitatis Ostraviensis

Discrete Mathematics 22 (1978) North-Holland Publishing Company ON ADDITIVE PARTITIONS OF INTEGERS K. ALLADI University of California, Los A

Partitions of the set of nonnegative integers with the same representation functions

Commentationes Mathematicae Universitatis Carolinae

Section III.15. Factor-Group Computations and Simple Groups

Nowhere-zero flows in signed series-parallel graphs arxiv: v1 [math.co] 6 Nov 2014

Downloaded 03/01/17 to Redistribution subject to SIAM license or copyright; see

First online - August 26, Draft version - August 26, 2016

. As the binomial coefficients are integers we have that. 2 n(n 1).

Groups and Symmetries

Časopis pro pěstování matematiky

Climbing an Infinite Ladder

Math 120 HW 9 Solutions

Acta Universitatis Palackianae Olomucensis. Facultas Rerum Naturalium. Mathematica

Czechoslovak Mathematical Journal

Archivum Mathematicum

a + b = b + a and a b = b a. (a + b) + c = a + (b + c) and (a b) c = a (b c). a (b + c) = a b + a c and (a + b) c = a c + b c.

Properties of the Integers

Mathematica Slovaca. Dragan Marušič; Tomaž Pisanski The remarkable generalized Petersen graph G(8, 3) Terms of use:

Closing the gap on path-kipas Ramsey numbers

1 Lecture 1 (1/5/2009)

1 Lecture 1 (1/5/2009)

Linear Differential Transformations of the Second Order

Acta Universitatis Carolinae. Mathematica et Physica

Maximal perpendicularity in certain Abelian groups

#A67 INTEGERS 18 (2018) ON THE NESTED LOCAL POSTAGE STAMP PROBLEM

arxiv: v1 [math.ca] 24 Sep 2011

Decomposing planar cubic graphs

D-MATH Algebra I HS 2013 Prof. Brent Doran. Solution 3. Modular arithmetic, quotients, product groups

Section I.6. Symmetric, Alternating, and Dihedral Groups

The Reduction of Graph Families Closed under Contraction

On sofic groups. arxiv:math/ v1 [math.gr] 25 May 2003

Math 3121, A Summary of Sections 0,1,2,4,5,6,7,8,9

Climbing an Infinite Ladder

ON UNIVERSAL SUMS OF POLYGONAL NUMBERS

Recognition of Some Symmetric Groups by the Set of the Order of Their Elements

AN ADDITIVE PROBLEM IN FINITE FIELDS WITH POWERS OF ELEMENTS OF LARGE MULTIPLICATIVE ORDER

Commentationes Mathematicae Universitatis Carolinae

Solutions for Chapter Solutions for Chapter 17. Section 17.1 Exercises

MATH 201 Solutions: TEST 3-A (in class)

Citation for pulished version (APA): Henning, M. A., & Yeo, A. (2016). Transversals in 4-uniform hypergraphs. Journal of Combinatorics, 23(3).

Notes for Math 290 using Introduction to Mathematical Proofs by Charles E. Roberts, Jr.

CLIQUES IN THE UNION OF GRAPHS

Archivum Mathematicum

Toposym Kanpur. T. Soundararajan Weakly Hausdorff spaces and the cardinality of topological spaces

PLAYING END-NIM WITH A MULLER TWIST

THE STRUCTURE OF RAINBOW-FREE COLORINGS FOR LINEAR EQUATIONS ON THREE VARIABLES IN Z p. Mario Huicochea CINNMA, Querétaro, México

Baltic Way 2003 Riga, November 2, 2003

Mathematica Bohemica

MATH 324 Summer 2011 Elementary Number Theory. Notes on Mathematical Induction. Recall the following axiom for the set of integers.

We want to show P (n) is true for all integers

Ch 3.2: Direct proofs

Czechoslovak Mathematical Journal

On Anti-Elite Prime Numbers

OVER for SOLUTIONS SOLUTIONS TO REVIEW SHEET FOR EXAM I. The first Math 5a midterm will be Friday, February 9th from 2 4 p.m. Location: Goldsmith 300

Standard forms for writing numbers

MATH 220 (all sections) Homework #12 not to be turned in posted Friday, November 24, 2017

Computing the Norm A,1 is NP-Hard

Časopis pro pěstování matematiky

Aplikace matematiky. Gene Howard Golub Numerical methods for solving linear least squares problems

Unique Difference Bases of Z

MINIMAL GENERATING SETS OF GROUPS, RINGS, AND FIELDS

Transcription:

Commentationes Mathematicae Universitatis Carolinae Keresztély Corrádi; Sándor Szabó A Hajós type result on factoring finite abelian groups by subsets. II Commentationes Mathematicae Universitatis Carolinae, Vol. 51 (2010), No. 1, 1--8 Persistent URL: http://dml.cz/dmlcz/140082 Terms of use: Charles University in Prague, Faculty of Mathematics and Physics, 2010 Institute of Mathematics of the Academy of Sciences of the Czech Republic provides access to digitized documents strictly for personal use. Each copy of any part of this document must contain these Terms of use. This paper has been digitized, optimized for electronic delivery and stamped with digital signature within the project DML-CZ: The Czech Digital Mathematics Library http://project.dml.cz

Comment.Math.Univ.Carolin. 51,1(2010) 1 8 1 A Hajós type result on factoring finite abelian groups by subsets II Keresztély Corrádi, Sándor Szabó Abstract. It is proved that if a finite abelian group is factored into a direct product of lacunary cyclic subsets, then at least one of the factors must be periodic. This result generalizes Hajós s factorization theorem. Keywords: factorization of finite abelian groups, periodic subset, cyclic subset, Hajós s theorem Classification: Primary 20K01; Secondary 05B45, 52C22, 68R05 1. Introduction Let G be a finite abelian group written multiplicatively with identity element e. Let A 1,..., A n be subsets of G. We form the list of elements (1) a 1 a n, a 1 A 1,...,a n A n. This list contains A 1 A n elements. The product A 1 A n is defined to be the set of all elements on the list (1). If the elements on the list (1) are distinct, that is, if a 1 a n = a 1 a n, a 1, a 1 A 1,..., a n, a n A n always implies a 1 = a 1,..., a n = a n, then we say that the product A 1 A n is direct. If the product A 1 A n is direct and it is equal to G, then we say that G is factored into subsets A 1,..., A n. We also express this fact by saying that the equation G = A 1 A n is a factorization of G. Clearly, G = A 1 A n is a factorization of G if and only if each element g of G is uniquely expressible in the form g = a 1 a n, a 1 A 1,..., a n A n. A subset A of G is called normalized if e A. A factorization G = A 1 A n is called normalized if each A i is a normalized subset of G. In this paper mainly normalized factorizations will appear. If G = A 1 A n is a normalized factorization of G and A n = {e}, then clearly G = A 1 A n 1 is also a normalized factorization of G. In other words the factors that are equal to {e} can be cancelled from each normalized factorization of G unless G = {e}. Throughout this note we assume that G {e} and that in each

2 K. Corrádi, S. Szabó normalized factorization of G there is no factor equal to {e}. Plainly A i = is not possible and so we may assume that A i 2. Let a be an element of G and let r be a nonnegative integer. We form the list of elements (2) e, a, a 2,..., a r 1. We assume that a r since otherwise there are repetition among the elements (2). In other words we assume that the elements on the list (2) are distinct. The set of elements on the list (2) of G is called a cyclic subset of G. We will use the bracket notation [a, r] for this subset of G. If r = 1, then [a, r] = {e} independently of the choice of the element a. If r = 0, then [a, r] = independently of the choice of the element a. In order to solve a long standing geometric conjecture of H. Minkowski, G. Hajós [2] proved the following theorem. Theorem 1. Let G be a finite abelian group and let G = A 1 A n be a factorization of G, where each A i is a cyclic subset of G. Then at least one of the factors A 1,..., A n is a subgroup of G. This note deals with possible extensions of this theorem. Let a, d be elements of G and let i, r be positive integers. We form the list of elements (3) e, a, a 2,..., a i 1, a i d, a i+1,..., a r 1. We assume that a r and 1 i r 1 and further we assume that a i d / {e, a, a 2,..., a i 1 } {a i+1,..., a r 1 }. The set of elements on the list (3) is called a distorted cyclic subset of G. In this note distorted cyclic subsets in the form {e, a, a 2,...,a r 2, a r 1 d} will mainly appear. The following result has been proved by Sands [3]. In fact he proved a more general result but we cite only a special case. Theorem 2. Let G be a finite abelian group and let G = A 1 A n be a factorization of G, where each A i is a distorted cyclic subset of G. Then at least one of the factors A 1,...,A n is a subgroup of G. As a cyclic subset is always a distorted cyclic subset, Theorem 2 can be considered to be an extension of Theorem 1. Let g be an element of G and let [a, r], [a, s] be cyclic subsets of G. A subset of G in the form [a, r] g[a, s] is called a lacunary cyclic subset of G. If [a, r] g[a, s], then a i = ga j for some i, j, 0 i r 1, 0 j s 1 and so g a. In this case the lacunary cyclic

A Hajós type result on factoring finite abelian groups by subsets II 3 subset [a, r] g[a, s] can be written in the form [a, r ] a k [a, s ] for some integers r, s, k. In addition we may choose these integers such that [a, r ] a k [a, s ] =. In the rest of this note we will choose the notation such that for the lacunary cyclic subset [a, r] g[a, s], [a, r] g[a, s] = holds. As a consequence the number of the elements of the lacunary cyclic subset [a, r] g[a, s] is r + s. If s = 0, then [a, r] g[a, s] reduces to the cyclic subset [a, r]. If s = 1, then [a, r] g[a, s] reduces to the distorted cyclic subset {e, a, a 2,...,a r 1, a r d}. Corrádi and Szabó [1] have proved the following theorem. Theorem 3. Let G be a finite abelian group of odd order and let G = A 1 A n be a factorization of G, where each A i is a lacunary cyclic subset of G. Then at least one of the factors A 1,..., A n is a subgroup of G. From the remarks before Theorem 3 it follows that Theorem 3 is an extension of Theorem 2 for finite abelian groups of odd order. However, examples exhibited in [1] show that Theorem 3 cannot be extended for finite abelian groups of even order. A subset A of G is defined to be periodic if there is an element g of G such that g e and Ag = A. Sands [3] established the following about periodic distorted cyclic subsets. Theorem 4. Let G be a finite abelian group and let G = AB be a factorization of G, where A is a distorted cyclic subset of G. If A is periodic, then A must be a subgroup of G. This result implies that the next theorem is an equivalent formulation of Theorem 2. Theorem 5. Let G be a finite abelian group and let G = A 1 A n be a factorization of G, where each A i is a distorted cyclic subset of G. Then at least one of the factors A 1,...,A n is a periodic subset of G. We will prove the following variant of Theorem 5. Theorem 6. Let G be a finite abelian group and let G = A 1 A n be a factorization of G, where each A i is a lacunary cyclic subset of G. Then at least one of the factors A 1,...,A n is a periodic subset of G. 2. The result In this section we present a proof of Theorem 6. Proof: Assume on the contrary that there is a finite abelian group G and a factorization G = A 1 A n, where each A i is a non-periodic lacunary cyclic subset of G. Of course we assume that neither G nor any of the factor is equal to {e}.

4 K. Corrádi, S. Szabó Our goal is to prove that if there exists a counter-example G = A 1 A n, then there exists a counter-example G = A 1 A m such that each A i is a distorted cyclic subset of G that is not periodic. Such an example would contradict Theorem 5, and hence there can be no counter-example at all. We thus need to demonstrate that each A i that is not a distorted cyclic subset can be factored into a direct product of such subsets or can be replaced by such a subset. The replacing subsets should not be periodic. To verify that it suffices, by Theorem 4, to verify that they do not form a subgroup. When n 2 with no loss of generality we can choose i = 1 and set A = A 1 and B = A 2 A n. Let us turn to the details. If n = 1, then G = A 1. As G {e}, A 1 is periodic. This contradiction gives that n 2. The factorization G = A 1 A n can be written in the form G = AB, where A = A 1 and B = A 2 A n. We have assumed that A i 2 and so A 2 and B 2. If A = 2, then A = A 1 is a cyclic subset of G. In this case we do nothing with A 1. For the remaining part of the proof we assume that A 3. Let A = [a, r] g[a, s]. Multiplying the factorization G = AB by g 1 we get the factorization G = Gg 1 = (Ag 1 )B. Note that Ag 1 = [a, s] g 1 [a, r] is also a lacunary cyclic subset of G. Clearly, if Ag 1 is periodic, then A is periodic too. This shows that the roles of r and s can be reversed in a counter-example. In the remaining part of the proof we assume that r s. In the r = s case the computation A = [a, r] g[a, s] = [a, r] g[a, r] = {e, g}[a, r] = [g, 2][a, r] shows that A is a direct product of two cyclic subsets. If [g, 2] is a subgroup of G, then we get the contradiction that A = A 1 is periodic. Similarly, if [a, r] is a subgroup of G, then we get the contradiction that A = A 1 is periodic. Therefore, in the r = s special case the factor A = A 1 is a direct product of two non-subgroup cyclic subsets. Thus for the remaining part of the proof we assume that r > s. Let us turn to the A = 3 case. Now r+s = 3, r > s 0 and so either s = 0 or s = 1. If s = 0, then A = A 1 is a non-periodic cyclic subset of G. By Theorem 4, A = A 1 is a non-subgroup cyclic subset of G. In this case we do nothing with A 1. If s = 1, then A = A 1 is a non-periodic distorted cyclic subset of G. By Theorem 4, A = A 1 is a non-subgroup distorted cyclic subset of G. In this case again we do nothing with A 1. The A = 4 case is similar. The factor A = A 1 is either a non-subgroup cyclic subset of G or a non-subgroup distorted cyclic subset of G and we do nothing with A 1. For the remaining part of the proof we assume that A 5.

A Hajós type result on factoring finite abelian groups by subsets II 5 If s = 0 or s = 1, then A = A 1 is a non-subgroup cyclic or distorted cyclic subset of G and we do nothing with A 1. Suppose s 2 and let Define d G by g = a r d. Then A = {e, a, a 2,..., a r+s 2, a s 1 g}. A = {e, a, a 2,...,a r+s 2, a r+s 1 d}. We claim that in the factorization G = AB the factor A can be replaced by A to get the factorization G = A B. In order to prove the claim note that the factorization G = AB implies that the sets (4) eb, ab,..., a r 1 B, gb, gab,..., ga s 1 B form a partition of G. Multiplying the factorization G = AB by a we get the factorization G = Ga = (Aa)B. (Here Aa is not a normalized subset of G. This is the only factorization in the paper which is not normalized.) Hence the sets (5) ab, a 2 B,..., a r B, gab, ga 2 B,...,ga s B form a partition of G. Comparing partitions (4) and (5) provides that (6) eb gb = a r B ga s B. If gb ga s B, then B a s B. This violates (4) as 2 s < r. Thus gb ga s B =. From (6) it follows that gb a r B. Both sets are of the same size and so gb = a r B. Replacing gb by a r B in (4) in the following way gives that the sets eb, ab,..., a r 1 B, gb, gab }{{}}{{} a r B a r+1 B,..., ga s 2 B, ga s 1 B }{{} a r+s 2 B eb, ab,..., a r 1 B, a r B, a r+1 B,..., a r+s 2 B, ga s 1 B form a partition of G. This means that G = A B is a factorization of G as we claimed. As G = A B is a factorization of G, the elements are distinct. In particular e, a, a 2,..., a r+s 2, a r+s 1 d a r+s 1 d / {e, a, a 2,...,a r+s 2 } and so A is a distorted cyclic subset of G.

6 K. Corrádi, S. Szabó Suppose s 2 and let A = [a, r + s] = {e, a, a 2,..., a r+s 2, a r+s 1 }. We claim that in the factorization G = AB the factor A can be replaced by A to get the factorization G = A B. In order to prove the claim let us replace gb by a r B in (4) in the following way Therefore the sets eb, ab,..., a r 1 B, gb, gab }{{}}{{} a r B a r+1 B,..., ga s 2 B }{{} a r+s 2 B, ga s 1 B }{{} a r+s 1 B eb, ab,...,a r 1 B, a r B, a r+1 B,...,a r+s 2 B, a r+s 1 B form a partition of G. This means that G = A B is a factorization of G as we claimed. In order to simplify the notations we set t = r + s. Now A = {e, a, a 2,...,a t 2, a s 1 g} = {e, a, a 2,...,a t 2, a t 1 d}. We claim that A is not a subgroup of G. To verify the claim first note that from the factorization G = A B, it follows that the elements e, a, a 2,...,a t 1 must be distinct. Next assume on the contrary that A is a subgroup of G. Let us consider the product a a t 2. Either a a t 2 {e, a,...,a t 2 }. or a a t 2 {a t 1 d}. In the first case we get a t 1 = a i for some i, 0 i t 2. Therefore a t 1 i = e. This is contradiction since the elements e, a, a 2,...,a t 1 are distinct. In the second case a t 1 = a t 1 d and so d = e. This means that A = A. It was assumed that A is not periodic. By Theorem 4, A is not a subgroup. Thus A is a not a subgroup of G as we claimed. We may summarize the above argument by saying that in the factorization G = A 1 A 2 A n the factor A 1 is either a direct product of non-subgroup cyclic subsets of G or can be replaced by a non-subgroup distorted cyclic subset of G. It may happen that the distorted cyclic subset is simply a cyclic subset. The essential point is that it is not a subgroup. We may repeat this replacement in connection with each A i factor in the factorization and we get a factorization G = A 1 A m, where each A i is a non-subgroup distorted cyclic subset of G. (The index m is not a typographical error. When we replace the factor A i it may happen that A i is replaced by a product of two

A Hajós type result on factoring finite abelian groups by subsets II 7 cyclic subsets. Therefore the number of the factors may change after the replacements.) The new factorization G = A 1 A m contradicts Theorem 2 and this contradiction completes the proof. 3. An example In her or his report the anonymous referee writes the following. For the sake of completeness I suggest to equip the paper with examples of direct products that do not fulfill the hypothesis of Theorem 6 but are close to the hypothesis. For example, can all the factors be lacunary with the exception of one? Can this be achieved for any n? Can the non-lacunary factor be of a simple structure, say [a, r] g[a, s] h[a, t]? We present an example motivated by these questions. Let G be an abelian group with basis elements x, y, z, where x = y = z = 4. Set A 1 = {e, x 2 y 2 z 2 } xz 2 {e, x 2 } x 2 y{e, y 2 } y 2 z{e, z 2 }, A 2 A 3 A 4 = {e, x}, = {e, y}, = {e, z}. We claim that the product A 1 A 2 A 3 A 4 is direct and it is equal to G. Further none of the factors is periodic. The sets A 2, A 3, A 4 are cyclic and so they are lacunary cyclic subsets too. The factor A 1 can be written in the form [x 2 y 2 z 2, 2] xz 2 [x 2, 2] x 2 y[y 2, 2] y 2 z[z 2, 2]. This is not exactly the example the referee asks for since the elements x 2 y 2 z 2, x 2, y 2, z 2 are not equal. We close this section with an open problem. The credit for this problem goes to the referee. Problem 1. Let G be a finite abelian group and let G = A 1 A 2 A n be a factorization of G such that A 1 is in the form [a, r] g[a, s] h[a, t] and A 2,..., A n are lacunary cyclic subsets. Does it follow that at least one of the factors is periodic? The next problem is a simplified version of Problem 1 and it is motivated by the example above. An answer in the affirmative still would provide a generalization for Hajós s theorem. Problem 2. Let G be a finite abelian group and let G = A 1 A 2 A n be a factorization of G such that A 1 is in the form [a, r] g[a, s] h[a, t] and A 2,..., A n are cyclic subsets. Does it follow that at least one of the factors is periodic?

8 K. Corrádi, S. Szabó References [1] Corrádi K., Szabó S., A Hajós type result on factoring finite abelian groups by subsets, Math. Pannon. 5 (1994), 275 280. [2] Hajós G., Über einfache und mehrfache Bedeckung des n-dimensionalen Raumes mit einem Würfelgitter, Math. Z. 47 (1942), 427 467. [3] Sands A.D., A note on distorted cyclic subsets, Math. Pannon. 20 (2009), 123 127. Department of General Computer Technics, Eötvös L. University, Pázmány P. sétány 1/c, H 1117 Budapest, Hungary Institute of Mathematics and Informatics, University of Pécs, Ifjúság u. 6, 7624 Pécs, Hungary E-mail: sszabo7@hotmail.com (Received July 25, 2009, revised November 6, 2009)