The theory of numbers continues to occupy a central place in modern mathematics because of both its long history over many centuries as well as its many diverse applications to other fields such as discrete mathematics, cryptography, and coding theory. The proof by Andrew Wiles (with Richard Taylor) of Fermat's last theorem published in 1995 illustrates the high level of difficulty of problems encountered in number-theoretic research as well as the usefulness of the new ideas arising from its proof. The thirteenth conference of the Canadian Number Theory Association was held at Carleton University, Ottawa, Ontario, Canada from June 16 to 20, 2014. Ninety-nine talks were presented at the conference on the theme of advances in the theory of numbers. Topics of the talks reflected the diversity of current trends and activities in modern number theory. These topics included modular forms, hypergeometric functions, elliptic curves, distribution of prime numbers, diophantine equations, L-functions, Diophantine approximation, and many more. This volume contains some of the papers presented at the conference. All papers were refereed. The high quality of the articles and their contribution to current research directions make this volume a must for any mathematics library and is particularly relevant to researchers and graduate students with an interest in number theory. The editors hope that this volume will serve as both a resource and an inspiration to future generations of researchers in the theory of numbers.

Key problems and conjectures have played an important role in promoting the development of Ramsey theory, a field where great progress has been made during the past two decades, with some old problems solved and many new problems proposed. The present book will be helpful to readers who wish to learn about interesting problems in Ramsey theory, to see how they are interconnected, and then to study them in depth. This book is the first problem book of such scope in Ramsey theory. Many unsolved problems, conjectures and related partial results in Ramsey theory are presented, in areas such as extremal graph theory, additive number theory, discrete geometry, functional analysis, algorithm design, and in other areas. Most presented problems are easy to understand, but they may be difficult to solve. They can be appreciated on many levels and by a wide readership, ranging from undergraduate students majoring in mathematics to research mathematicians. This collection is an essential reference for mathematicians working in combinatorics and number theory, as well as for computer scientists studying algorithms. Contents Some definitions and notations Ramsey theory Bi-color diagonal classical Ramsey numbers Paley graphs and lower bounds for R(k, k) Bi-color off-diagonal classical Ramsey numbers Multicolor classical Ramsey numbers Generalized Ramsey numbers Folkman numbers The Erdos-Hajnal conjecture Other Ramsey-type problems in graph theory On van der Waerden numbers and Szemeredi's theorem More problems of Ramsey type in additive number theory Sidon-Ramsey numbers Games in Ramsey theory Local Ramsey theory Set-coloring Ramsey theory Other problems and conjectures

This proceedings volume is based on papers presented at the Workshops on Combinatorial and Additive Number Theory (CANT), which were held at the Graduate Center of the City University of New York in 2011 and 2012. The goal of the workshops is to survey recent progress in combinatorial number theory and related parts of mathematics. The workshop attracts researchers and students who discuss the state-of-the-art, open problems and future challenges in number theory.

This monograph describes and implements partially homomorphic encryption functions using a unified notation. After introducing the appropriate mathematical background, the authors offer a systematic examination of the following known algorithms: Rivest-Shamir-Adleman; Goldwasser-Micali; ElGamal; Benaloh; Naccache-Stern; Okamoto-Uchiyama; Paillier; Damgaard-Jurik; Boneh-Goh-Nissim; and Sander-Young-Yung. Over recent years partially and fully homomorphic encryption algorithms have been proposed and researchers have addressed issues related to their formulation, arithmetic, efficiency and security. Formidable efficiency barriers remain, but we now have a variety of algorithms that can be applied to various private computation problems in healthcare, finance and national security, and studying these functions may help us to understand the difficulties ahead. The book is valuable for researchers and graduate students in Computer Science, Engineering, and Mathematics who are engaged with Cryptology.

In his Master Plan Cai Chen (1167-1230) created an original divination manual based on the Yijing and keyed it to an intricate series of 81 matrixes with the properties of "magic squares." Previously unrecognized, Cai's work is a milestone in the history of mathematics, and, in introducing it, this book dramatically expands our understanding of the Chinese number theory practiced by the "Image and Number" school within Confucian philosophy. Thinkers of that leaning devised graphic arrays of the binary figures called "trigrams" and "hexagrams" in the Yijing as a way of exploring the relationship between the random draws of divination and the classic's readings. Cai adapted this perspective to his 81 matrix series, which he saw as tracing the recurring temporal cycles of the natural world. The architecture of the matrix series is echoed in the language of his divination texts, which he called "number names"-hence, the book's title. This book will appeal to those interested in philosophy, the history of science and mathematics, and Chinese intellectual history. The divination text has significant literary as well as philosophical dimensions, and its audience lies both among specialists in these fields and with a general readership interested in recreational mathematics and topics like divination, Taiji, and Fengshui.

This volume is dedicated to Robert F. Tichy on the occasion of his 60th birthday. Presenting 22 research and survey papers written by leading experts in their respective fields, it focuses on areas that align with Tichy's research interests and which he significantly shaped, including Diophantine problems, asymptotic counting, uniform distribution and discrepancy of sequences (in theory and application), dynamical systems, prime numbers, and actuarial mathematics. Offering valuable insights into recent developments in these areas, the book will be of interest to researchers and graduate students engaged in number theory and its applications.

This book gathers nineteen papers presented at the first NLAGA-BIRS Symposium, which was held at the Cheikh Anta Diop University in Dakar, Senegal, on June 24-28, 2019. The four-day symposium brought together African experts on nonlinear analysis and geometry and their applications, as well as their international partners, to present and discuss mathematical results in various areas. The main goal of the NLAGA project is to advance and consolidate the development of these mathematical fields in West and Central Africa with a focus on solving real-world problems such as coastal erosion, pollution, and urban network and population dynamics problems. The book addresses a range of topics related to partial differential equations, geometrical analysis of optimal shapes, geometric structures, optimization and optimal transportation, control theory, and mathematical modeling.

Architecture of Mathematics describes the logical structure of Mathematics from its foundations to its real-world applications. It describes the many interweaving relationships between different areas of mathematics and its practical applications, and as such provides unique reading for professional mathematicians and nonmathematicians alike. This book can be a very important resource both for the teaching of mathematics and as a means to outline the research links between different subjects within and beyond the subject. Features All notions and properties are introduced logically and sequentially, to help the reader gradually build understanding. Focusses on illustrative examples that explain the meaning of mathematical objects and their properties. Suitable as a supplementary resource for teaching undergraduate mathematics, and as an aid to interdisciplinary research. Forming the reader's understanding of Mathematics as a unified science, the book helps to increase his general mathematical culture.

This is the second in a series of three volumes dealing with important topics in algebra. Volume 2 is an introduction to linear algebra (including linear algebra over rings), Galois theory, representation theory, and the theory of group extensions. The section on linear algebra (chapters 1-5) does not require any background material from Algebra 1, except an understanding of set theory. Linear algebra is the most applicable branch of mathematics, and it is essential for students of science and engineering As such, the text can be used for one-semester courses for these students. The remaining part of the volume discusses Jordan and rational forms, general linear algebra (linear algebra over rings), Galois theory, representation theory (linear algebra over group algebras), and the theory of extension of groups follow linear algebra, and is suitable as a text for the second and third year students specializing in mathematics.

The book provides an introduction to modern abstract algebra and its applications. It covers all major topics of classical theory of numbers, groups, rings, fields and finite dimensional algebras. The book also provides interesting and important modern applications in such subjects as Cryptography, Coding Theory, Computer Science and Physics. In particular, it considers algorithm RSA, secret sharing algorithms, Diffie-Hellman Scheme and ElGamal cryptosystem based on discrete logarithm problem. It also presents Buchberger's algorithm which is one of the important algorithms for constructing Groebner basis. Key Features: Covers all major topics of classical theory of modern abstract algebra such as groups, rings and fields and their applications. In addition it provides the introduction to the number theory, theory of finite fields, finite dimensional algebras and their applications. Provides interesting and important modern applications in such subjects as Cryptography, Coding Theory, Computer Science and Physics. Presents numerous examples illustrating the theory and applications. It is also filled with a number of exercises of various difficulty. Describes in detail the construction of the Cayley-Dickson construction for finite dimensional algebras, in particular, algebras of quaternions and octonions and gives their applications in the number theory and computer graphics.

This collaborative book presents recent trends on the study of sequences, including combinatorics on words and symbolic dynamics, and new interdisciplinary links to group theory and number theory. Other chapters branch out from those areas into subfields of theoretical computer science, such as complexity theory and theory of automata. The book is built around four general themes: number theory and sequences, word combinatorics, normal numbers, and group theory. Those topics are rounded out by investigations into automatic and regular sequences, tilings and theory of computation, discrete dynamical systems, ergodic theory, numeration systems, automaton semigroups, and amenable groups. This volume is intended for use by graduate students or research mathematicians, as well as computer scientists who are working in automata theory and formal language theory. With its organization around unified themes, it would also be appropriate as a supplemental text for graduate level courses.

Written for graduate students and researchers alike, this set of lectures provides a structured introduction to the concept of equidistribution in number theory. This concept is of growing importance in many areas, including cryptography, zeros of L-functions, Heegner points, prime number theory, the theory of quadratic forms, and the arithmetic aspects of quantum chaos. The volume brings together leading researchers from a range of fields, whose accessible presentations reveal fascinating links between seemingly disparate areas."

Congruences are ubiquitous in computer science, engineering, mathematics, and related areas. Developing techniques for finding (the number of) solutions of congruences is an important problem. But there are many scenarios in which we are interested in only a subset of the solutions; in other words, there are some restrictions. What do we know about these restricted congruences, their solutions, and applications? This book introduces the tools that are needed when working on restricted congruences and then systematically studies a variety of restricted congruences. Restricted Congruences in Computing defines several types of restricted congruence, obtains explicit formulae for the number of their solutions using a wide range of tools and techniques, and discusses their applications in cryptography, information security, information theory, coding theory, string theory, quantum field theory, parallel computing, artificial intelligence, computational biology, discrete mathematics, number theory, and more. This is the first book devoted to restricted congruences and their applications. It will be of interest to graduate students and researchers across computer science, electrical engineering, and mathematics.

This is the first in a series of three volumes dealing with important topics in algebra. It offers an introduction to the foundations of mathematics together with the fundamental algebraic structures, namely groups, rings, fields, and arithmetic. Intended as a text for undergraduate and graduate students of mathematics, it discusses all major topics in algebra with numerous motivating illustrations and exercises to enable readers to acquire a good understanding of the basic algebraic structures, which they can then use to find the exact or the most realistic solutions to their problems.

Linear Algebra: Algorithms, Applications, and Techniques, Fourth Edition offers a modern and algorithmic approach to computation while providing clear and straightforward theoretical background information. The book guides readers through the major applications, with chapters on properties of real numbers, proof techniques, matrices, vector spaces, linear transformations, eigen values, and Euclidean inner products. Appendices on Jordan canonical forms and Markov chains are included for further study. This useful textbook presents broad and balanced views of theory, with key material highlighted and summarized in each chapter. To further support student practice, the book also includes ample exercises with answers and hints.

Number Theory and its Applications is a textbook for students pursuing mathematics as major in undergraduate and postgraduate courses. Please note: Taylor & Francis does not sell or distribute the print book in India, Pakistan, Nepal, Bhutan, Bangladesh and Sri Lanka.

In this monograph, we study recent results on some categories of trigonometric/exponential sums along with various of their applications in Mathematical Analysis and Analytic Number Theory. Through the two chapters of this monograph, we wish to highlight the applicability and breadth of techniques of trigonometric/exponential sums in various problems focusing on the interplay of Mathematical Analysis and Analytic Number Theory. We wish to stress the point that the goal is not only to prove the desired results, but also to present a plethora of intermediate Propositions and Corollaries investigating the behaviour of such sums, which can also be applied in completely different problems and settings than the ones treated within this monograph.In the present work we mainly focus on the applications of trigonometric/exponential sums in the study of Ramanujan sums - which constitute a very classical domain of research in Number Theory - as well as the study of certain cotangent sums with a wide range of applications, especially in the study of Dedekind sums and a facet of the research conducted on the Riemann Hypothesis. For example, in our study of the cotangent sums treated within the second chapter, the methods and techniques employed reveal unexpected connections with independent and very interesting problems investigated in the past by R de la Breteche and G Tenenbaum on trigonometric series, as well as by S Marmi, P Moussa and J-C Yoccoz on Dynamical Systems.Overall, a reader who has mastered fundamentals of Mathematical Analysis, as well as having a working knowledge of Classical and Analytic Number Theory, will be able to gradually follow all the parts of the monograph. Therefore, the present monograph will be of interest to advanced undergraduate and graduate students as well as researchers who wish to be informed on the latest developments on the topics treated.

In recent years, extensive research has been conducted by eminent mathematicians and engineers whose results and proposed problems are presented in this new volume. It is addressed to graduate students, research mathematicians, physicists, and engineers. Individual contributions are devoted to topics of approximation theory, functional equations and inequalities, fixed point theory, numerical analysis, theory of wavelets, convex analysis, topology, operator theory, differential operators, fractional integral operators, integro-differential equations, ternary algebras, super and hyper relators, variational analysis, discrete mathematics, cryptography, and a variety of applications in interdisciplinary topics. Several of these domains have a strong connection with both theories and problems of linear and nonlinear optimization. The combination of results from various domains provides the reader with a solid, state-of-the-art interdisciplinary reference to theory and problems. Some of the works provide guidelines for further research and proposals for new directions and open problems with relevant discussions.

Features Uses techniques from widely diverse areas of mathematics, including number theory, calculus, set theory, complex analysis, linear algebra, and the theory of computation. Suitable as a primary textbook for advanced undergraduate courses in number theory, or as supplementary reading for interested postgraduates. Each chapter concludes with an appendix setting out the basic facts needed from each topic, so that the book is accessible to readers without any specific specialist background.

This is a 2001 account of Algebraic Number Theory, a field which has grown to touch many other areas of pure mathematics. It is written primarily for beginning graduate students in pure mathematics, and encompasses everything that most such students are likely to need; others who need the material will also find it accessible. It assumes no prior knowledge of the subject, but a firm basis in the theory of field extensions at an undergraduate level is required, and an appendix covers other prerequisites. The book covers the two basic methods of approaching Algebraic Number Theory, using ideals and valuations, and includes material on the most usual kinds of algebraic number field, the functional equation of the zeta function and a substantial digression on the classical approach to Fermat's Last Theorem, as well as a comprehensive account of class field theory. Many exercises and an annotated reading list are also included.

The main topics of this volume, dedicated to Lance Littlejohn, are operator and spectral theory, orthogonal polynomials, combinatorics, number theory, and the various interplays of these subjects. Although the event, originally scheduled as the Baylor Analysis Fest, had to be postponed due to the pandemic, scholars from around the globe have contributed research in a broad range of mathematical fields. The collection will be of interest to both graduate students and professional mathematicians. Contributors are: G.E. Andrews, B.M. Brown, D. Damanik, M.L. Dawsey, W.D. Evans, J. Fillman, D. Frymark, A.G. Garcia, L.G. Garza, F. Gesztesy, D. Gomez-Ullate, Y. Grandati, F.A. Grunbaum, S. Guo, M. Hunziker, A. Iserles, T.F. Jones, K. Kirsten, Y. Lee, C. Liaw, F. Marcellan, C. Markett, A. Martinez-Finkelshtein, D. McCarthy, R. Milson, D. Mitrea, I. Mitrea, M. Mitrea, G. Novello, D. Ong, K. Ono, J.L. Padgett, M.M.M. Pang, T. Poe, A. Sri Ranga, K. Schiefermayr, Q. Sheng, B. Simanek, J. Stanfill, L. Velazquez, M. Webb, J. Wilkening, I.G. Wood, M. Zinchenko.

This book contains a complete detailed description of two classes of special numbers closely related to classical problems of the Theory of Primes. There is also extensive discussions of applied issues related to Cryptography.In Mathematics, a Mersenne number (named after Marin Mersenne, who studied them in the early 17-th century) is a number of the form Mn = 2n - 1 for positive integer n.In Mathematics, a Fermat number (named after Pierre de Fermat who first studied them) is a positive integer of the form Fn = 2k+ 1, k=2n, where n is a non-negative integer.Mersenne and Fermat numbers have many other interesting properties. Long and rich history, many arithmetic connections (with perfect numbers, with construction of regular polygons etc.), numerous modern applications, long list of open problems allow us to provide a broad perspective of the Theory of these two classes of special numbers, that can be useful and interesting for both professionals and the general audience.

How do you remember more and forget less? How can you earn more and become more creative just by moving house? And how do you pack a car boot most efficiently? This is your shortcut to the art of the shortcut. Mathematics is full of better ways of thinking, and with over 2,000 years of knowledge to draw on, Oxford mathematician Marcus du Sautoy interrogates his passion for shortcuts in this fresh and fascinating guide. After all, shortcuts have enabled so much of human progress, whether in constructing the first cities around the Euphrates 5,000 years ago, using calculus to determine the scale of the universe or in writing today's algorithms that help us find a new life partner. As well as looking at the most useful shortcuts in history - such as measuring the circumference of the earth in 240 BC to diagrams that illustrate how modern GPS works - Marcus also looks at how you can use shortcuts in investing or how to learn a musical instrument to memory techniques. He talks to, among many, the writer Robert MacFarlane, cellist Natalie Clein and the psychologist Suzie Orbach, asking whether shortcuts are always the best idea and, if so, when they use them. With engaging puzzles and conundrums throughout to illustrate the shortcut's ability to find solutions with speed, Thinking Better offers many clever strategies for daily complex problems.

In today's unsafe and increasingly wired world cryptology plays a vital role in protecting communication channels, databases, and software from unwanted intruders. This revised and extended third edition of the classic reference work on cryptology now contains many new technical and biographical details. The first part treats secret codes and their uses - cryptography. The second part deals with the process of covertly decrypting a secret code - cryptanalysis, where particular advice on assessing methods is given. The book presupposes only elementary mathematical knowledge. Spiced with a wealth of exciting, amusing, and sometimes personal stories from the history of cryptology, it will also interest general readers.

This book deals with several aspects of what is now called "explicit number theory." The central theme is the solution of Diophantine equations, i.e., equations or systems of polynomial equations which must be solved in integers, rational numbers or more generally in algebraic numbers. This theme, in particular, is the central motivation for the modern theory of arithmetic algebraic geometry. In this text, this is considered through three of its most basic aspects. The local aspect, global aspect, and the third aspect is the theory of zeta and L-functions. This last aspect can be considered as a unifying theme for the whole subject.