東華大學圖書館 |

Language: English

Help

回圖書館首頁

手機版館藏查詢

Back

Switch To: Labeled | MARC Mode | ISBD

Sumsets, zero-sums and extremal comb...

Grynkiewicz, David J.

Linked to FindBook

Google Book

Amazon

博客來

Sumsets, zero-sums and extremal combinatorics.

Record Type:	Electronic resources : Monograph/item
Title/Author:	Sumsets, zero-sums and extremal combinatorics./
Author:	Grynkiewicz, David J.
Description:	209 p.
Notes:	Source: Dissertation Abstracts International, Volume: 66-11, Section: B, page: 6011.
Contained By:	Dissertation Abstracts International66-11B.
Subject:	Mathematics. -
Online resource:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3197383
ISBN:	9780542429033

Sumsets, zero-sums and extremal combinatorics.
Grynkiewicz, David J.

Sumsets, zero-sums and extremal combinatorics. - 209 p.

Source: Dissertation Abstracts International, Volume: 66-11, Section: B, page: 6011.

Thesis (Ph.D.)--California Institute of Technology, 2006.

This thesis develops and applies a method of tackling zero-sum additive questions---especially those related to the Erdo&huml;s-Ginzburg-Ziv Theorem (EGZ)---through the use of partitioning sequences into sets, i.e., set partitions. Much of the research can alternatively be found in the literature spread across nine separate articles, but is here collected into one cohesive work augmented by additional exposition. Highlights include a new combinatorial proof of Kneser's Theorem (not currently located elsewhere); a proof of Caro's conjectured weighted Erdo&huml;s-Ginzburg-Ziv Theorem; a partition analog of the Cauchy-Davenport Theorem that encompasses several results of Mann, Olson, Bollobas and Leader, and Hamidoune; a refinement of EGZ showing that an essentially dichromatic sequence of 2m-1 terms from an abelian group of order m contains a mostly monochromatic m-term zero-sum subsequence; an interpretation of Kemperman's Structure Theorem (KST) for critical pairs (i.e., those finite subsets A and B of an abelian group with |A + B| < |A| + |B|) through quasi-periodic decompositions, which establishes certain canonical aspects of KST and facilitates its use in practice; a draining theorem for set partitions showing that a set partition of large cardinality sumset can have several elements removed from its terms and still have the sumset remain of large cardinality; a proof of a subsequence sum conjecture of Hamidoune; the determination of the g( m,k) function introduced by Bialostocki and Lotspeich (defined as the least n so that a sequence of terms from Z/msZ of length n with at least k distinct terms must contain an m-term zero-sum subsequence) for m large with respect to k; the determination of g(m,5) for m ≥ 5, including the details to the abbreviated proof found in the literature; various zero-sum results concerning modifications to the nondecreasing diameter problem of Bialostocki, Erdo&huml;s, and Lefmann; an extension of EGZ to a class of hypergraphs; and a lower bound on the number of zero-sum m-term subsequences in a sequence of n terms from an abelian group of order m that establishes Bialostocki's conjectured value for small n ≤ 6&frac13;m.

ISBN: 9780542429033Subjects--Topical Terms:

515831
Mathematics.

Sumsets, zero-sums and extremal combinatorics.
LDR:03053nmm 2200265 4500 001 1825404
005 20061211074621.5
008 130610s2006 eng d
020 $a 9780542429033
035 $a (UnM)AAI3197383
035 $a AAI3197383
040 $a UnM $c UnM
100 1 $a Grynkiewicz, David J. $3 1914417
245 1 0 $a Sumsets, zero-sums and extremal combinatorics.
300 $a 209 p.
500 $a Source: Dissertation Abstracts International, Volume: 66-11, Section: B, page: 6011.
500 $a Adviser: Richard Wilson.
502 $a Thesis (Ph.D.)--California Institute of Technology, 2006.
520 $a This thesis develops and applies a method of tackling zero-sum additive questions---especially those related to the Erdo&huml;s-Ginzburg-Ziv Theorem (EGZ)---through the use of partitioning sequences into sets, i.e., set partitions. Much of the research can alternatively be found in the literature spread across nine separate articles, but is here collected into one cohesive work augmented by additional exposition. Highlights include a new combinatorial proof of Kneser's Theorem (not currently located elsewhere); a proof of Caro's conjectured weighted Erdo&huml;s-Ginzburg-Ziv Theorem; a partition analog of the Cauchy-Davenport Theorem that encompasses several results of Mann, Olson, Bollobas and Leader, and Hamidoune; a refinement of EGZ showing that an essentially dichromatic sequence of 2m-1 terms from an abelian group of order m contains a mostly monochromatic m-term zero-sum subsequence; an interpretation of Kemperman's Structure Theorem (KST) for critical pairs (i.e., those finite subsets A and B of an abelian group with |A + B| < |A| + |B|) through quasi-periodic decompositions, which establishes certain canonical aspects of KST and facilitates its use in practice; a draining theorem for set partitions showing that a set partition of large cardinality sumset can have several elements removed from its terms and still have the sumset remain of large cardinality; a proof of a subsequence sum conjecture of Hamidoune; the determination of the g( m,k) function introduced by Bialostocki and Lotspeich (defined as the least n so that a sequence of terms from Z/msZ of length n with at least k distinct terms must contain an m-term zero-sum subsequence) for m large with respect to k; the determination of g(m,5) for m ≥ 5, including the details to the abbreviated proof found in the literature; various zero-sum results concerning modifications to the nondecreasing diameter problem of Bialostocki, Erdo&huml;s, and Lefmann; an extension of EGZ to a class of hypergraphs; and a lower bound on the number of zero-sum m-term subsequences in a sequence of n terms from an abelian group of order m that establishes Bialostocki's conjectured value for small n ≤ 6&frac13;m.
590 $a School code: 0037.
650 4 $a Mathematics. $3 515831
690 $a 0405
710 2 0 $a California Institute of Technology. $3 726902
773 0 $t Dissertation Abstracts International $g 66-11B.
790 1 0 $a Wilson, Richard, $e advisor
790 $a 0037
791 $a Ph.D.
792 $a 2006
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3197383