Combinatorial Number Theory
eBook - ePub

Combinatorial Number Theory

Proceedings of the Integers Conference 2023

  1. 288 pages
  2. English
  3. ePUB (mobile friendly)
  4. Available on iOS & Android
eBook - ePub

Combinatorial Number Theory

Proceedings of the Integers Conference 2023

About this book

This volume consists of twenty articles stemming from presentations given at the 2023 Integers Conference. They represent a variety of active areas of research in combinatorial number theory, including additive number theory, multiplicative number theory, elementary number theory, the theory of partitions, Ramsey theory, sequences, algebraic combinatorics, enumerative combinatorics, and Diophantine equations.

Frequently asked questions

Yes, you can cancel anytime from the Subscription tab in your account settings on the Perlego website. Your subscription will stay active until the end of your current billing period. Learn how to cancel your subscription.
At the moment all of our mobile-responsive ePub books are available to download via the app. Most of our PDFs are also available to download and we're working on making the final remaining ones downloadable now. Learn more here.
Perlego offers two plans: Essential and Complete
  • Essential is ideal for learners and professionals who enjoy exploring a wide range of subjects. Access the Essential Library with 800,000+ trusted titles and best-sellers across business, personal growth, and the humanities. Includes unlimited reading time and Standard Read Aloud voice.
  • Complete: Perfect for advanced learners and researchers needing full, unrestricted access. Unlock 1.4M+ books across hundreds of subjects, including academic and specialized titles. The Complete Plan also includes advanced features like Premium Read Aloud and Research Assistant.
Both plans are available with monthly, semester, or annual billing cycles.
We are an online textbook subscription service, where you can get access to an entire online library for less than the price of a single book per month. With over 1 million books across 1000+ topics, we’ve got you covered! Learn more here.
Look out for the read-aloud symbol on your next book to see if you can listen to it. The read-aloud tool reads text aloud for you, highlighting the text as it is being read. You can pause it, speed it up and slow it down. Learn more here.
Yes! You can use the Perlego app on both iOS or Android devices to read anytime, anywhere — even offline. Perfect for commutes or when you’re on the go.
Please note we cannot support devices running on iOS 13 and Android 7 or earlier. Learn more about using the app.
Yes, you can access Combinatorial Number Theory by Bruce M. Landman,Florian Luca,Melvyn Nathanson,Aaron Robertson,Jaroslav Nešetřil in PDF and/or ePUB format, as well as other popular books in Mathematics & Counting & Numeration. We have over one million books available in our catalogue for you to explore.

Information

Publisher
De Gruyter
Year
2024
eBook ISBN
9783111395623
Edition
0

Table of contents

  1. Title Page
  2. Copyright
  3. Contents
  4. Computations and observations on congruence covering systems
  5. Balanced N-color compositions
  6. Computing four-term arithmetic progressions of powerful numbers
  7. Combinatorial identities for vacillating tableaux
  8. Odd vector cycles in ℤm
  9. Powered numbers in short intervals
  10. Schreier multisets and the s-step Fibonacci sequences
  11. Tabulating absolute Lucas pseudoprimes
  12. Henrik Eriksson’s Bulgarian Solitaire variant
  13. On a generalization of a theorem of Ibukiyama to evaluate three imprimitive character sums
  14. Composition-theoretic series and false theta functions
  15. On the constants in Mertens’ theorems for primes in arithmetic progressions
  16. Dot product chains
  17. Permutation patterns of the iterated Syracuse function
  18. An upper bound on the inhomogeneous approximation constants
  19. On the minimum number of monochromatic 2-dimensional Schur triples
  20. The Scholz conjecture on addition chains is true for infinitely many integers with ℓ(2n)=ℓ(n)
  21. Digital problems in the theory of partitions
  22. A combinatorial proof of a partition perimeter inequality
  23. Subject Index