Diskret matematik

Auf breiter fachlicher Ebene werden in dem Lehrbuch einfache elementare zahlentheoretische Inhalte besprochen, aber auch Stoffkomplexe aus der analytischen und algebraischen Zahlentheorie dargestellt. Das Buch bietet so auf uberschaubaren mathematischen Niveau einen Einstieg in ausgewahlte Themen der Zahlentheorie. Samtliche Kapitel enthalten umfassend Beispiele, Ubungsaufgaben mit Losungen, Abbildungen und ausfuhrlich durchgerechnete Beweise, so dass es sich sehr gut zur Prufungsvorbereitung eignet.

Das Kompendium prasentiert die fur ein Mathematik- oder Informatikstudium benotigten Grundlagen der diskreten Mathematik in kompakter Form. Alle wichtigen Themen wie Mengen, Relationen und Funktionen, Logik, Graphen, abstrakte und lineare Algebra sowie diskrete Wahrscheinlichkeitstheorie werden abgedeckt. Damit erweist sich das Buch als nutzlicher Begleiter fur viele Vorlesungen im Studium.

This book focuses on the creative elements of algorithmic design by delving into the phases involved in algorithm creation. The conceptual underpinnings of this creative process are analogous to the invention and development of mathematical theorems that result in the induction of combinatorial algorithms. Numerous issue examples are included in the book. It is intended to enhance readers' problem-solving abilities by imparting a grasp of the fundamental ideas behind algorithmic design. This book summarizes the most widely used computer algorithms and provides a comprehensive overview of algorithms and data structures for searching, sorting, and graph processing. The algorithms presented in this book represent a body of knowledge that has developed over the previous five decades and has become critical not just for professional programmers and computer scientists, but also for all students interested in mathematics, data science, and engineering. The reader of this book is meant to get knowledge about known ways for successfully resolving difficulties. They will become acquainted with various cutting-edge data structures and novel methods for utilizing data structures to improve the efficacy of algorithms. Because the book is virtually self-contained, it may be used as a course book, reference book, or self-study resource.

This stimulating textbook presents a broad and accessible guide to the fundamentals of discrete mathematics, highlighting how the techniques may be applied to various exciting areas in computing. The text is designed to motivate and inspire the reader, encouraging further study in this important skill. Features: provides an introduction to the building blocks of discrete mathematics, including sets, relations and functions; describes the basics of number theory, the techniques of induction and recursion, and the applications of mathematical sequences, series, permutations, and combinations; presents the essentials of algebra; explains the fundamentals of automata theory, matrices, graph theory, cryptography, coding theory, language theory, and the concepts of computability and decidability; reviews the history of logic, discussing propositional and predicate logic, as well as advanced topics; examines the field of software engineering, describing formal methods; investigates probability and statistics.

Fundamentals of Data Science: Theory and Practice presents basic and advanced concepts in data science along with real-life applications. The book provides students, researchers and professionals at different levels a good understanding of the concepts of data science, machine learning, data mining and analytics. Users will find the authors' research experiences and achievements in data science applications, along with in-depth discussions on topics that are essential for data science projects, including pre-processing, that is carried out before applying predictive and descriptive data analysis tasks and proximity measures for numeric, categorical and mixed-type data. The book's authors include a systematic presentation of many predictive and descriptive learning algorithms, including recent developments that have successfully handled large datasets with high accuracy. In addition, a number of descriptive learning tasks are included.

This book presents the mathematics of quantum computation. The purpose is to introduce the topic of quantum computing to students in computer science, physics and mathematics who have no prior knowledge of this field.

Reachable Sets of Dynamic Systems: Uncertainty, Sensitivity, and Complex Dynamics introduces differential inclusions, providing an overview as well as multiple examples of its interdisciplinary applications. The design of dynamic systems of any type is an important issue as is the influence of uncertainty in model parameters and model sensitivity. The possibility of calculating the reachable sets may be a powerful additional tool in such tasks. This book can help graduate students, researchers, and engineers working in the field of computer simulation and model building, in the calculation of reachable sets of dynamic models.

This book constitutes the refereed proceedings of the 18th European Conference on Genetic Programming, EuroGP 2015, held in Copenhagen, Spain, in April 2015 co-located with the Evo 2015 events, EvoCOP, Evo MUSART and Evo Applications. The 12 revised full papers presented together with 6 poster papers were carefully reviewed and selected form 36 submissions. The wide range of topics in this volume reflects the current state of research in the field. Thus, we see topics as diverse as semantic methods, recursive programs, grammatical methods, coevolution, Cartesian GP, feature selection, initialisation procedures, ensemble methods and search objectives; and applications including text processing, cryptography, numerical modelling, software parallelisation, creation and optimisation of circuits, multi-class classification, scheduling and artificial intelligence.

Algebra, geometry and topology cover a variety of different, but intimately related research fields in modern mathematics. This book focuses on specific aspects of this interaction. The present volume contains refereed papers which were presented at the International Conference "Experimental and Theoretical Methods in Algebra, Geometry and Topology", held in Eforie Nord (near Constanta), Romania, during 20-25 June 2013. The conference was devoted to the 60th anniversary of the distinguished Romanian mathematicians Alexandru Dimca and Stefan Papadima. The selected papers consist of original research work and a survey paper. They are intended for a large audience, including researchers and graduate students interested in algebraic geometry, combinatorics, topology, hyperplane arrangements and commutative algebra. The papers are written by well-known experts from different fields of mathematics, affiliated to universities from all over the word, they cover a broad range of topics and explore the research frontiers of a wide variety of contemporary problems of modern mathematics.

This book constitutes the proceedings of the 4th International Conference on Mathematical Software, ICMS 2014, held in Seoul, South Korea, in August 2014. The 108 papers included in this volume were carefully reviewed and selected from 150 submissions. The papers are organized in topical sections named: invited; exploration; group; coding; topology; algebraic; geometry; surfaces; reasoning; special; Groebner; triangular; parametric; interfaces and general.

Differential equations with impulses arise as models of many evolving processes that are subject to abrupt changes, such as shocks, harvesting, and natural disasters. These phenomena involve short-term perturbations from continuous and smooth dynamics, whose duration is negligible in comparison with the duration of an entire evolution. In models involving such perturbations, it is natural to assume these perturbations act instantaneously or in the form of impulses. As a consequence, impulsive differential equations have been developed in modeling impulsive problems in physics, population dynamics, ecology, biotechnology, industrial robotics, pharmacokinetics, optimal control, and so forth. There are also many different studies in biology and medicine for which impulsive differential equations provide good models. During the last 10 years, the authors have been responsible for extensive contributions to the literature on impulsive differential inclusions via fixed point methods. This book is motivated by that research as the authors endeavor to bring under one cover much of those results along with results by other researchers either affecting or affected by the authors' work. The questions of existence and stability of solutions for different classes of initial value problems for impulsive differential equations and inclusions with fixed and variable moments are considered in detail. Attention is also given to boundary value problems. In addition, since differential equations can be viewed as special cases of differential inclusions, significant attention is also given to relative questions concerning differential equations. This monograph addresses a variety of side issues that arise from its simpler beginnings as well.

This is a monograph that details the use of Siegel's method and the classical results of homotopy groups of spheres and Lie groups to determine some Gottlieb groups of projective spaces or to give the lower bounds of their orders. Making use of the properties of Whitehead products, the authors also determine some Whitehead center groups of projective spaces that are relevant and new within this monograph.

This book constitutes the refereed proceedings of the 7th International Workshop on Probabilistic Graphical Models, PGM 2014, held in Utrecht, The Netherlands, in September 2014. The 38 revised full papers presented in this book were carefully reviewed and selected from 44 submissions. The papers cover all aspects of graphical models for probabilistic reasoning, decision making, and learning.

Taking into account the various criss-crossing among mathematical subject, Physical Combinatorics presents new results and exciting ideas from three viewpoints; representation theory, integrable models, and combinatorics. This work is concerned with combinatorial aspects arising in the theory of exactly solvable models and representation theory. Recent developments in integrable models reveal an unexpected link between representation theory and statistical mechanics through combinatorics.

This festschrift volume, published in honor of Jürgen Dassow on the occasion of his 65th birthday, contains 19 contributions by leading researchers, colleagues, and friends. Covering topics on picture languages, cooperating distributed systems of automata, quantum automata, grammar systems, online computation, word equations, biologically motivated formal systems, controlled derivations, descriptional complexity, as well as 'classical' topics of automata and language theory, the articles presented span the range of the scientific work of Jürgen Dassow.

This book constitutes the refereed proceedings of the 23rd Annual Symposium on Combinatorial Pattern Matching, CPM 2012, held in Helsinki, Finland, in July 2012. The 33 revised full papers presented together with 2 invited talks were carefully reviewed and selected from 60 submissions. The papers address issues of searching and matching strings and more complicated patterns such as trees, regular expressions, graphs, point sets, and arrays. The goal is to derive non-trivial combinatorial properties of such structures and to exploit these properties in order to either achieve superior performance for the corresponding computational problems or pinpoint conditions under which searches cannot be performed efficiently. The meeting also deals with problems in computational biology, data compression and data mining, coding, information retrieval, natural language processing, and pattern recognition.

This book constitutes the refereed proceedings of the Turing Centenary Conference and the 8th Conference on Computability in Europe, CiE 2012, held in Cambridge, UK, in June 2012. The 53 revised papers presented together with 6 invited lectures were carefully reviewed and selected with an acceptance rate of under 29,8%. The CiE 2012 Turing Centenary Conference will be remembered as a historic event in the continuing development of the powerful explanatory role of computability across a wide spectrum of research areas. The papers presented at CiE 2012 represent the best of current research in the area, and forms a fitting tribute to the short but brilliant trajectory of Alan Mathison Turing. Both the conference series and the association promote the development of computability-related science, ranging over mathematics, computer science and applications in various natural and engineering sciences such as physics and biology, and also including the promotion of related non-scientific fields such as philosophy and history of computing.

This book constitutes the refereed proceedings of the 7th International Conference on Sequences and Their Applications, SETA 2012, held in Waterloo, Canada, in June 2012. The 28 full papers presented together with 2 invited papers in this volume were carefully reviewed and selected from 48 submissions. The papers are grouped in topical sections on perfect sequences; finite fields; boolean functions; Golomb 80th birthday session; linear complexity; frequency hopping; correlation of sequences; bounds on sequences, cryptography; aperiodic correlation; and Walsh transform.

This book constitutes the refereed proceedings of the 9th International Workshop on Algorithms and Models for the Web-Graph, WAW 2012, held in Halifax, Nova Scotia, Canada, in June 2012. The 13 papers presented were carefully reviewed and selected for inclusion in this volume. They address a number of topics related to the complex networks such hypergraph coloring games and voter models; algorithms for detecting nodes with large degrees; random Appolonian networks; and a sublinear algorithm for Pagerank computations.

This book constitutes the refereed proceedings of the 30th Annual International Conference on the Theory and Applications of Cryptographic Techniques, EUROCRYPT 2011, held in Tallinn, Estonia, in May 2011.The 31 papers, presented together with 2 invited talks, were carefully reviewed and selected from 167 submissions. The papers are organized in topical sections on lattice-base cryptography, implementation and side channels, homomorphic cryptography, signature schemes, information-theoretic cryptography, symmetric key cryptography, attacks and algorithms, secure computation, composability, key dependent message security, and public key encryption.

This book constitutes the refereed proceedings of the 11th Theory of Cryptography Conference, TCC 2014, held in San Diego, CA, USA, in February 2014. The 30 revised full papers presented were carefully reviewed and selected from 90 submissions. The papers are organized in topical sections on obfuscation, applications of obfuscation, zero knowledge, black-box separations, secure computation, coding and cryptographic applications, leakage, encryption, hardware-aided secure protocols, and encryption and signatures.

This volume contains the courses given at the Sixth Summer School on Complex Systems held at Facultad de Ciencias Fisicas y Maternaticas, Universidad de Chile at Santiago, Chile, from 14th to 18th December 1998. This school was addressed to graduate students and researchers working on areas related with recent trends in Complex Systems, including dynamical systems, cellular automata, complexity and cutoff in Markov chains. Each contribution is devoted to one of these subjects. In some cases they are structured as surveys, presenting at the same time an original point of view and showing mostly new results. The paper of Pierre Arnoux investigates the relation between low complex systems and chaotic systems, showing that they can be put into relation by some re­ normalization operations. The case of quasi-crystals is fully studied, in particular the Sturmian quasi-crystals. The paper of Franco Bagnoli and Raul Rechtman establishes relations be­ tween Lyapunov exponents and synchronization processes in cellular automata. The principal goal is to associate tools, usually used in physical problems, to an important problem in cellularautomata and computer science, the synchronization problem. The paper of Jacques Demongeot and colleagues gives a presentation of at­ tractors of dynamical systems appearing in biological situations. For instance, the relation between positive or negative loops and regulation systems.

This book constitutes the refereed proceedings of the 19th International Colloquium on Structural Information and Communication Complexity, SIROCCO 2012, held in Reykjavik, Iceland for 3 days starting June 30, 2012. The 28 revised full papers presented were carefully reviewed and selected from 54 submissions. SIROCCO is devoted to the study of communication and knowledge in distributed systems. Special emphasis is given to innovative approaches and fundamental understanding, in addition to efforts to optimize current designs. The typical areas include distributed computing, communication networks, game theory, parallel computing, social networks, mobile computing (including autonomous robots), peer to peer systems, communication complexity, fault tolerant graph theories, and randomized/probabilistic issues in networks.

This book constitutes the joint refereed proceedings of the 14th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2011, and the 15th International Workshop on Randomization and Computation, RANDOM 2011, held in Princeton, New Jersey, USA, in August 2011. The volume presents 29 revised full papers of the APPROX 2011 workshop, selected from 66 submissions, and 29 revised full papers of the RANDOM 2011 workshop, selected from 64 submissions. They were carefully reviewed and selected for inclusion in the book. In addition two abstracts of invited talks are included.APPROX focuses on algorithmic and complexity issues surrounding the development of efficient approximate solutions to computationally difficult problems. RANDOM is concerned with applications of randomness to computational and combinatorial problems.

This book constitutes the refereed proceedings of the 7th Conference on Computability in Europe, CiE 2011, held in Sofia, Bulgaria, in June/July 2011. The 22 revised papers presented together with 11 invited lectures were carefully reviewed and selected with an acceptance rate of under 40%.The papers cover the topics computability in analysis, algebra, and geometry; classical computability theory; natural computing; relations between the physical world and formal models of computability; theory of transfinite computations; and computational linguistics.