Diskret matematik

Dieses Buch ist die erste fachübergreifende Einführung in die Kombinatorik in deutscher Sprache und umfasst Gesetzmäßigkeiten, Rechenregeln, Anwendungen sowie 50 Übungsaufgaben mit Lösungen. Es zeigt, wie dieses oft unterschätzte Fachgebiet zahlreiche Entwicklungen in Linguistik und Lyrik, Mathematik und Informatik, Chemie, Musik, Psychologie, Soziologie und Ökonomie beeinflusste.

This book constitutes the proceedings of the 30th International Symposium on Graph Drawing and Network Visualization, GD 2022, held in Tokyo, Japan, during September 13-16, 2022. The 25 full papers, 7 short papers, presented together with 2 invited talks, one report on graph drawing contest, and one obituary in these proceedings were carefully reviewed and selected from 70 submissions. The abstracts of 5 posters presented at the conference can be found in the back matter of the volume. The contributions were organized in topical sections as follows: properties of drawings of complete graphs; stress-based visualizations of graphs; planar and orthogonal drawings; drawings and properties of directed graphs; beyond planarity; dynamic graph visualization; linear layouts; and contact and visibility graph representations.

This book is a thoroughly revised result, updated to mid-1995, of the NATO Advanced Research Workshop on "Intelligent Learning Environments: the case of geometry", held in Grenoble, France, November 13-16, 1989. The main aim of the workshop was to foster exchanges among researchers who were concerned with the design of intelligent learning environments for geometry. The problem of student modelling was chosen as a central theme of the workshop, insofar as geometry cannot be reduced to procedural knowledge and because the significance of its complexity makes it of interest for intelligent tutoring system (ITS) development. The workshop centred around the following themes: modelling the knowledge domain, modelling student knowledge, design­ ing "didactic interaction", and learner control. This book contains revised versions of the papers presented at the workshop. All of the chapters that follow have been written by participants at the workshop. Each formed the basis for a scheduled presentation and discussion. Many are suggestive of research directions that will be carried out in the future. There are four main issues running through the papers presented in this book: ¿ knowledge about geometry is not knowledge about the real world, and materialization of geometrical objects implies a reification of geometry which is amplified in the case of its implementation in a computer, since objects can be manipulated directly and relations are the results of actions (Laborde, Schumann). This aspect is well exemplified by research projects focusing on the design of geometric microworlds (Guin, Laborde).

Machine Learning: A Constraint-Based Approachprovides readers with a refreshing look at the basic models and algorithms of machine learning, with an emphasis on current topics of interest that includes neural networks and kernel machines. The book presents the information in a truly unified manner that is based on the notion of learning from environmental constraints. For example, most resources present regularization when discussing kernel machines, but only Gori demonstrates that regularization is also of great importance in neural nets. This book presents a simpler unified notion of regularization, which is strictly connected with the parsimony principle, and includes many solved exercises that are classified according to the Donald Knuth ranking of difficulty, which essentially consists of a mix of warm-up exercises that lead to deeper research problems. A software simulator is also included. Presents fundamental machine learning concepts, such as neural networks and kernel machines in a unified mannerProvides in-depth coverage of unsupervised and semi-supervised learningIncludes a software simulator for kernel machines and learning from constraints that also includes exercises to facilitate learningContains 250 solved examples and exercises chosen particularly for their progression of difficulty from simple to complex

This book constitutes the refereed proceedings of the 17th Annual Conference on Theory and Applications of Models of Computation, TAMC 2022, held as a virtual event, in September 2022.The 33 full papers were carefully reviewed and selected from 75 submissions. The main themes of the selected papers are computability, complexity, algorithms, information theory and their extensions to machine learning theory, and foundations of artificial intelligence.

This book constitutes the proceedings of the International Joint Conference on Theoretical Computer Science-Frontier of Algorithmic Wisdom (IJTCS-FAW 2022), for the 16th International Conference on Frontier of Algorithmic Wisdom (FAW) and the third International Joint Conference on Theoretical Computer Science (IJTCS), held in Hong Kong, China, in August 15-19 2022.FAW started as the Frontiers of Algorithmic Workshop in 2007 at Lanzhou, China, and was held annually from 2007 to 2021 and published archival proceedings. IJTCS, the International joint theoretical Computer Science Conference, started in 2020, aimed to bring in presentations covering active topics in selected tracks in theoretical computer science.To accommodate the diversified new research directions in theoretical computer science, FAW and IJTCS joined their forces together to organize an event for information exchange of new findings and work of enduring value in the field. In addition to four keynote speakers, 26 invited speakers and 19 contributed speakers, IJTCS-FAW2022 organized Forums for undergraduate research, young PhD graduates, young TCS faculty members, female researchers, as well as a forum in Conscious AI and a CSIAM Forum in blockchain.The 19 full papers presented in this book were carefully reviewed and selected from 25 submissions. They were organized in topical sections as follows: Algorithmic Game Theory; Game Theory in Block Chain; Frontiers of Algorithmic Wisdom; Computational and Network Economics.

Chapter(s) ¿Chapter Name or No.¿ is/are available open access under a Creative Commons Attribution 4.0 International License via link.springer.com.

"Emphasizing the creative nature of mathematics, this conversational textbook guides students through the process of discovering a proof as they transition to advanced mathematics. Using several strategies, students will develop the thinking skills needed to tackle mathematics when there is no clear algorithm or recipe to follow"--

This book constitutes selected papers from the refereed proceedings of the 14th International Workshop on Rewriting Logic and Its Applications, WRLA 2022, held in Munich, Germany, in April 2022.The 9 full papers included in this book were carefully reviewed and selected from 13 submissions. They focus on topics in rewriting logic and its applications. The book also contains 2 invited papers, 2 invited tutorials and an experience report.

This book focuses on linear time eigenvalue location algorithms for graphs. This subject relates to spectral graph theory, a field that combines tools and concepts of linear algebra and combinatorics, with applications ranging from image processing and data analysis to molecular descriptors and random walks. It has attracted a lot of attention and has since emerged as an area on its own.Studies in spectral graph theory seek to determine properties of a graph through matrices associated with it. It turns out that eigenvalues and eigenvectors have surprisingly many connections with the structure of a graph. This book approaches this subject under the perspective of eigenvalue location algorithms. These are algorithms that, given a symmetric graph matrix M and a real interval I, return the number of eigenvalues of M that lie in I. Since the algorithms described here are typically very fast, they allow one to quickly approximate the value of any eigenvalue, which is a basic step in most applications of spectral graph theory. Moreover, these algorithms are convenient theoretical tools for proving bounds on eigenvalues and their multiplicities, which was quite useful to solve longstanding open problems in the area. This book brings these algorithms together, revealing how similar they are in spirit, and presents some of their main applications.This work can be of special interest to graduate students and researchers in spectral graph theory, and to any mathematician who wishes to know more about eigenvalues associated with graphs. It can also serve as a compact textbook for short courses on the topic.

This book constitutes the refereed conference proceedings of the 29th International Colloquium on Structural Information and Communication Complexity, SIROCCO 2022, held in Paderborn, Germany, in June 2022. The 16 full papers presented in this book were carefully reviewed and selected from 30 submissions. SIROCCO is devoted to the study of the interplay between structural knowledge, communication, and computing in decentralized systems of multiple communicating entities. Special emphasis is given to innovative approaches leading to better understanding of the relationship between computing and communication.

This book constitutes the refereed proceedings of the 15th International Conference on Graph Transformation, ICGT 2022, which took place Nantes, France in July 2022.The 10 full papers and 1 tool paper presented in this book were carefully reviewed and selected from 19 submissions. The conference focuses on describing new unpublished contributions in the theory and applications of graph transformation as well as tool presentation papers that demonstrate main new features and functionalities of graph-based tools.

This book constitutes the proceedings of the 15th Latin American Symposium on Theoretical Informatics, LATIN 2022, which took place in Guanajuato, Mexico, in November 2022. The 46 papers presented in this volume were carefully reviewed and selected from 114 submissions. They were organized in topical sections as follows: Algorithms and Data Structures; Approximation Algorithms; Cryptography; Social Choice Theory; Theoretical Machine Learning; Automata Theory and Formal Languages; Combinatorics and Graph Theory; Complexity Theory; Computational Geometry.Chapter "e;Klee's Measure Problem Made Oblivious"e; is available open access under a CC BY 4.0 license.

This book constitutes revised selected papers from the thoroughly refereed workshop proceedings of the 20th International Workshop on Approximation and Online Algorithms, WAOA 2022, which was colocated with ALGO 2022 and took place in Potsdam, Germany, in September 2022.The 12 papers included in these proceedings were carefully reviewed and selected from21 submissions. They focus on topics such as graph algorithms, network design, algorithmic game theory, approximation and online algorithms, etc.

This LNCS 13453 constitutes the thoroughly refereed proceedings of the 48th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2022.The 32 full papers presented in this volume were carefully reviewed and selected from a total of 96 submissions. The WG 2022 workshop aims to merge theory and practice by demonstrating how concepts from Graph Theory can be applied to various areas in Computer Science, or by extracting new graph theoretic problems from applications.

This book provides the foundations for geometric applications of convex cones and presents selected examples from a wide range of topics, including polytope theory, stochastic geometry, and Brunn-Minkowski theory. Giving an introduction to convex cones, it describes their most important geometric functionals, such as conic intrinsic volumes and Grassmann angles, and develops general versions of the relevant formulas, namely the Steiner formula and kinematic formula. In recent years questions related to convex cones have arisen in applied mathematics, involving, for example, properties of random cones and their non-trivial intersections. The prerequisites for this work, such as integral geometric formulas and results on conic intrinsic volumes, were previously scattered throughout the literature, but no coherent presentation was available. The present book closes this gap. It includes several pearls from the theory of convex cones, which should be better known. 

This SpringerBrief provides the first systematic review of the existing works of cohesive subgraph search (CSS) over large heterogeneous information networks (HINs). It also covers the research breakthroughs of this area, including models, algorithms and comparison studies in recent years. This SpringerBrief offers a list of promising future research directions of performing CSS over large HINs.The authors first classify the existing works of CSS over HINs according to the classic cohesiveness metrics such as core, truss, clique, connectivity, density, etc., and then extensively review the specific models and their corresponding search solutions in each group. Note that since the bipartite network is a special case of HINs, all the models developed for general HINs can be directly applied to bipartite networks, but the models customized for bipartite networks may not be easily extended for other general HINs due to their restricted settings. The authors also analyze and compare these cohesive subgraph models (CSMs) and solutions systematically. Specifically, the authors compare different groups of CSMs and analyze both their similarities and differences, from multiple perspectives such as cohesiveness constraints, shared properties, and computational efficiency. Then, for the CSMs in each group, the authors further analyze and compare their model properties and high-level algorithm ideas.This SpringerBrief targets researchers, professors, engineers and graduate students, who are working in the areas of graph data management and graph mining. Undergraduate students who are majoring in computer science, databases, data and knowledge engineering, and data science will also want to read this SpringerBrief.

This handbook focuses on some important topics from Number Theory and Discrete Mathematics. These include the sum of divisors function with the many old and new issues on Perfect numbers; Euler's totient and its many facets; the Mobius function along with its generalizations, extensions, and applications; the arithmetic functions related to the divisors or the digits of a number; the Stirling, Bell, Bernoulli, Euler and Eulerian numbers, with connections to various fields of pure or applied mathematics. Each chapter is a survey and can be viewed as an encyclopedia of the considered field, underlining the interconnections of Number Theory with Combinatorics, Numerical mathematics, Algebra, or Probability Theory.This reference work will be useful to specialists in number theory and discrete mathematics as well as mathematicians or scientists who need access to some of these results in other fields of research.