Search results

Number theory has a rich history. For many years it was one of the purest areas of pure mathematics, studied because of the intellectual fascination with properties of integers. More recently, it has been an area that also has important applications to subjects such as cryptography. An Introduction to Number Theory with Cryptography presents number theory along with many interesting applications. Designed for an undergraduate-level course, it covers standard number theory topics and gives instru...

The first part of this book introduces the Schubert Cells and varieties of the general linear group Gl (k^(r+1)) over a field k according to Ehresmann geometric way. Smooth resolutions for these varieties are constructed in terms of Flag Configurations in k^(r+1) given by linear graphs called Minimal Galleries. In the second part, Schubert Schemes, the Universal Schubert Scheme and their Canonical Smooth Resolution, in terms of the incidence relation in a Tits relative building are constructed f...

An increased interest in stream ciphers has recently been reflected in a number of applications for securing environments with constrained resources in computing power and energy as well as areas where very high speed is required in software implementations. This book covers the field of symmetric cryptography and provides a basic understanding of stream ciphers and pseudo-random sequences for system design and implementation purposes. The authors discuss key stream ciphers, e-stream competition...

This book provides an exciting history of the discovery of Ramsey Theory, and contains new research along with rare photographs of the mathematicians who developed this theory, including Paul Erdoes, B.L. van der Waerden, and Henry Baudet.

"Integers" is a refereedonline journal devoted to research in the area of combinatorial number theory. It publishes original research articles in combinatorics and number theory. Topics covered by the journal include additive number theory, multiplicative number theory, sequences and sets, extremal combinatorics, Ramsey theory, elementary number theory, classical combinatorial problems, hypergraphs, and probabilistic number theory. Integers also houses a combinatorial games section. This work...

DLT 2005 was the 9th Conference on Developments in Language Theory. It was intended to cover all important areas of language theory, such us gr- mars, acceptors and transducers for strings, trees, graphs, and arrays; e?cient text algorithms; algebraic theories for automata and languages; combinatorial andalgebraicpropertiesofwordsand languages;variable-lengthcodes; symbolic dynamics; decision problems; relations to complexity theory and logic; picture descriptionandanalysis;polyominoesandbidimen...

This volume contains the proceedings of the CIMPA Research School and Conference on Algebra for Secure and Reliable Communication Modeling, held from October 1-13, 2012, in Morelia, State of Michoacan, Mexico. The papers cover several aspects of the theory of coding theory and are gathered into three categories: general theory of linear codes, algebraic geometry and coding theory, and constacyclic codes over rings. The aim of this volume is to fill the gap between the theoretical part of algeb...

Evolutionary computation (EC) involves the study of problem-solving and op- mization techniques inspired by principles of natural evolution and genetics. EC has been able to draw the attention of an increasing number of researchers and practitioners in several ?elds. Evolutionary algorithms have in particular been showntobee?ectivefordi?cultcombinatorialoptimizationproblemsappearing in various industrial, economics, and scienti?c domains. This volume contains the proceedings of EvoCOP 2005, the...

MemComputing is a new computing paradigm that employs time non-locality (memory) to both process and store information. This book, written by the originator of this paradigm, explains the main ideas behind MemComputing, explores its theoretical foundations, and shows its applicability to a wide variety of combinatorial optimization problems, machine learning, and quantum mechanics. The book is ideal for graduate students in Physics, Computer Science, Electrical Engineering, and Mathematics, as w...

This is the proceedings of the SIGAL International Symposium on Algorithms held at CSK Information Education Center, Tokyo, Japan, August 16-18, 1990. SIGAL (Special Interest Group on Algorithms) was organized within the Information Processing Society of Japan in 1988 to encourage research in the field of discrete algorithms, and held 6-8 research meetings each year. This symposium is the first international symposium organized by SIGAL. In response to the call for papers, 88 papers were submitt...

The theory of Petri nets is a part of computer science whose importance is increasingly acknowledged. Many papers and anthologies, whose subject matter is net theory and its applications, have appeared to date. There exist at least seven introductory textbooks on the theory. The present monograph augments this literature by offering a mathematical treatment of one of the central aspects of net theory: the modelling of concur- rency by partially ordered sets. Occurrence nets - which are special n...

There has been considerable interest recently in the subject of patterns in permutations and words, a new branch of combinatorics with its roots in the works of Rotem, Rogers, and Knuth in the 1970s. Consideration of the patterns in question has been extremely interesting from the combinatorial point of view, and it has proved to be a useful language in a variety of seemingly unrelated problems, including the theory of Kazhdan-Lusztig polynomials, singularities of Schubert varieties, interval or...

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...

This volume composed of twenty four research articles which are selected from the keynote speakers and invited lectures presented in the 3rd International Congress in Algebra and Combinatorics (ICAC2017) held on 25-28 August 2017 in Hong Kong and one additional invited article. This congress was specially dedicated to Professor Leonid Bokut on the occasion of his 80th birthday.

While its roots reach back to the third century, diophantine analysis continues to be an extremely active and powerful area of number theory. Many diophantine problems have simple formulations, they can be extremely difficult to attack, and many open problems and conjectures remain. Diophantine Analysis examines the theory of diophantine ap

This book provides an introduction to the beautiful and deep subject of filling Dehn surfaces in the study of topological 3-manifolds. This book presents, for the first time in English and with all the details, the results from the PhD thesis of the first author, together with some more recent results in the subject. It also presents some key ideas on how these techniques could be used on other subjects.Representing 3-Manifolds by Filling Dehn Surfaces is mostly self-contained requiring only bas...