Conference 
Integers Conference (2011 : Carrollton, Ga.)

Series 
De Gruyter proceedings 

De Gruyter proceedings.

Subject 
Combinatorial number theory  Congresses.

Alt Name 
Landman, Bruce M., 1951

Description 
1 online resource (ix, 157 pages) : illustrations. 
Bibliography Note 
Includes bibliographical references and index. 
Contents 
Preface; 1 The Misère Monoid of OneHanded Alternating Games; 1.1 Introduction; 1.1.1 Background; 1.2 Equivalences; 1.3 Outcomes; 1.4 The Misère Monoid; 2 Images of CSets and Related Large Sets under Nonhomogeneous Spectra; 2.1 Introduction; 2.2 The Various Notions of Size; 2.3 The Functions fa and ha; 2.4 Preservation of J Sets, CSets, and C*Sets; 2.5 Preservation of Ideals; 3 On the Differences Between Consecutive Prime Numbers, I; 3.1 Introduction and Statement of Results; 3.2 The HardyLittlewood Prime kTuple Conjectures; 3.3 InclusionExclusion for Consecutive Prime Numbers. 

3.4 Proof of the Theorem4 On Sets of Integers Which Are Both SumFree and ProductFree; 4.1 Introduction; 4.2 The Upper Density; 4.3 An Upper Bound for the Density in Z/nZ; 4.4 Examples With Large Density; 5 Four Perspectives on Secondary Terms in the DavenportHeilbronn Theorems; 5.1 Introduction; 5.2 Counting Fields in General; 5.2.1 Counting Torsion Elements in Class Groups; 5.3 DavenportHeilbronn, DeloneFaddeev, and the Main Terms; 5.3.1 TheWork of Belabas, Bhargava, and Pomerance; 5.4 The Four Approaches; 5.5 The Shintani ZetaFunction Approach. 

5.5.1 Nonequidistribution in Arithmetic Progressions5.6 A Refined Geometric Approach; 5.6.1 Origin of the Secondary Term; 5.6.2 A Correspondence for Cubic Forms; 5.7 Equidistribution of Heegner Points; 5.7.1 Heegner Points and Equidistribution; 5.8 Hirzebruch Surfaces and the Maroni Invariant; 5.9 Conclusion; 6 Spotted Tilings and nColor Compositions; 6.1 Background; 6.2 nColor Composition Enumerations; 6.3 Conjugable nColor Compositions; 7 A Class ofWythoffLike Games; 7.1 Introduction; 7.2 Constant Function; 7.2.1 A Numeration System. 

7.2.2 Strategy Tractability and Structure of the PPositions7.3 Superadditive Functions; 7.4 Polynomial; 7.5 Further Work; 8 On the Multiplicative Order of FnC1=Fn Modulo Fm; 8.1 Introduction; 8.2 Preliminary Results; 8.3 Proof of Theorem 8.1; 8.4 Comments and Numerical Results; 9 Outcomes of Partizan Euclid; 9.1 Introduction; 9.2 Game Tree Structure; 9.3 Reducing the Signature; 9.3.1 Algorithm; 9.4 Outcome Observations; 9.5 Open Questions; 10 Lecture Hall Partitions and theWreath Products Ck @"Sn; 10.1 Introduction; 10.2 Lecture Hall Partitions; 10.3 Statistics on Ck @"Sn. 

10.4 Statistics on sInversion Sequences10.5 From Statistics on Ck o Sn to Statistics on In, k; 10.6 Lecture Hall Polytopes and sInversion Sequences; 10.7 Lecture Hall Partitions and the Inversion Sequences In, k; 10.8 A Lecture Hall Statistic on Ck @"Sn; 10.9 Inflated Eulerian Polynomials for Ck @"Sn; 10.10 Concluding Remarks. 
Summary 
These proceedings consist of several articles based on talks given at the ""Integers Conference 2011"" in the area of combinatorial number theory. They present a range of important and modern research topics in the areas of number, partition, combinatorial game, Ramsey, additive number, and multiplicative number theory. 
Note 
In English. 

Print version record. 
ISBN 
3110280612 (electronic bk.) 

9783110280616 (electronic bk.) 

9783110280487 

3110280485 

9783110280623 

3110280620 
ISBN/ISSN 
10.1515/9783110280616 
OCLC # 
902321051 
Additional Format 
9783110280623 

(GyWOH)har130238328 

9783110280616 

(GyWOH)har135019296 

Print version: Integers Conference (2011 : Carrollton, Ga.). Combinatorial number theory. 9783110280487 3110280485 (DLC) 2013022169 
