Narrow your search

Library

KU Leuven (7)

Odisee (7)

Thomas More Kempen (7)

Thomas More Mechelen (7)

UCLL (7)

ULB (7)

ULiège (7)

VIVES (7)

UGent (6)

VUB (2)

More...

Resource type

book (8)

digital (1)


Language

English (8)


Year
From To Submit

2023 (3)

2022 (2)

2021 (2)

2018 (1)

Listing 1 - 8 of 8
Sort by

Book
Synergies in analysis, discrete mathematics, soft computing and modelling
Author:
ISBN: 9811970149 9811970130 Year: 2023 Publisher: Singapore : Springer,

Loading...
Export citation

Choose an application

Bookmark

Abstract

This book contains select papers on mathematical analysis and modeling, discrete mathematics, fuzzy sets, and soft computing. All the papers were presented at the international conference on FIM28-SCMSPS20 virtually held at Sri Sivasubramaniya Nadar (SSN) College of Engineering, Chennai, India, and Stella Maris College (Autonomous), Chennai, from November 23–27, 2020. The conference was jointly held with the support of the Forum for Interdisciplinary Mathematics. Both the invited articles and submitted papers were broadly grouped under three heads: Part 1 on analysis and modeling (six chapters), Part 2 on discrete mathematics and applications (six chapters), and Part 3 on fuzzy sets and soft computing (three chapters).


Multi
Introductory applied statistics : with resampling methods & R
Author:
ISBN: 9783031277412 9783031277405 9783031277429 9783031277436 Year: 2023 Publisher: Cham, Switzerland : Springer,

Loading...
Export citation

Choose an application

Bookmark

Abstract

This book offers an introduction to applied statistics through data analysis, integrating statistical computing methods. It covers robust and non-robust descriptive statistics used in each of four bivariate statistical models that are commonly used in research: ANOVA, proportions, regression, and logistic. The text teaches statistical inference principles using resampling methods (such as randomization and bootstrapping), covering methods for hypothesis testing and parameter estimation. These methods are applied to each statistical model introduced in preceding chapters. Data analytic examples are used to teach statistical concepts throughout, and students are introduced to the R packages and functions required for basic data analysis in each of the four models. The text also includes introductory guidance to the fundamentals of data wrangling, as well as examples of write-ups so that students can learn how to communicate findings. Each chapter includes problems for practice or assessment. Supplemental instructional videos are also available as an additional aid to instructors, or as a general resource to students. This book is intended for an introductory or basic statistics course with an applied focus, or an introductory analytics course, at the undergraduate level in a two-year or four-year institution. This can be used for students with a variety of disciplinary backgrounds, from business, to the social sciences, to medicine. No sophisticated mathematical background is required.


Book
Algebraic Combinatorics : Walks, Trees, Tableaux, and More
Author:
ISBN: 3319771736 3319771728 9783319771724 Year: 2018 Publisher: Cham : Springer International Publishing : Imprint: Springer,

Loading...
Export citation

Choose an application

Bookmark

Abstract

Written by one of the foremost experts in the field, Algebraic Combinatorics is a unique undergraduate textbook that will prepare the next generation of pure and applied mathematicians. The combination of the author’s extensive knowledge of combinatorics and classical and practical tools from algebra will inspire motivated students to delve deeply into the fascinating interplay between algebra and combinatorics. Readers will be able to apply their newfound understanding to mathematical, engineering, and business models. Prerequisites include a basic knowledge of linear algebra over a field, existence of finite fields, and rudiments of group theory. The topics in each chapter build on one another and include extensive problem sets as well as hints to selected exercises. Key topics include walks on graphs, cubes and the Radon transform, the Matrix-Tree Theorem, de Bruijn sequences, the Erdős–Moser conjecture, electrical networks, the Sperner property, shellability of simplicial complexes and face rings. There are also three appendices on purely enumerative aspects of combinatorics related to the chapter material: the RSK algorithm, plane partitions, and the enumeration of labeled trees. The new edition contains a bit more content than intended for a one-semester advanced undergraduate course in algebraic combinatorics, enumerative combinatorics, or graph theory. Instructors may pick and choose chapters/sections for course inclusion and students can immerse themselves in exploring additional gems once the course has ended. A chapter on combinatorial commutative algebra (Chapter 12) is the heart of added material in this new edition. The author gives substantial application without requisites needed for algebraic topology and homological algebra. A sprinkling of additional exercises and a new section (13.8) involving commutative algebra, have been added. From reviews of the first edition: “This gentle book provides the perfect stepping-stone up. The various chapters treat diverse topics … . Stanley’s emphasis on ‘gems’ unites all this —he chooses his material to excite students and draw them into further study. … Summing Up: Highly recommended. Upper-division undergraduates and above.” —D. V. Feldman, Choice, Vol. 51(8), April, 2014.


Book
Lessons in enumerative combinatorics
Author:
ISBN: 3030712508 3030712494 9783030712495 9783030712501 Year: 2021 Publisher: Cham, Switzerland : Springer,

Loading...
Export citation

Choose an application

Bookmark

Abstract

This textbook introduces enumerative combinatorics through the framework of formal languages and bijections. By starting with elementary operations on words and languages, the authors paint an insightful, unified picture for readers entering the field. Numerous concrete examples and illustrative metaphors motivate the theory throughout, while the overall approach illuminates the important connections between discrete mathematics and theoretical computer science. Beginning with the basics of formal languages, the first chapter quickly establishes a common setting for modeling and counting classical combinatorial objects and constructing bijective proofs. From here, topics are modular and offer substantial flexibility when designing a course. Chapters on generating functions and partitions build further fundamental tools for enumeration and include applications such as a combinatorial proof of the Lagrange inversion formula. Connections to linear algebra emerge in chapters studying Cayley trees, determinantal formulas, and the combinatorics that lie behind the classical Cayley–Hamilton theorem. The remaining chapters range across the Inclusion-Exclusion Principle, graph theory and coloring, exponential structures, matching and distinct representatives, with each topic opening many doors to further study. Generous exercise sets complement all chapters, and miscellaneous sections explore additional applications. Lessons in Enumerative Combinatorics captures the authors' distinctive style and flair for introducing newcomers to combinatorics. The conversational yet rigorous presentation suits students in mathematics and computer science at the graduate, or advanced undergraduate level. Knowledge of single-variable calculus and the basics of discrete mathematics is assumed; familiarity with linear algebra will enhance the study of certain chapters.


Book
The Riordan group and applications
Author:
ISBN: 3030941507 3030941515 Year: 2022 Publisher: Cham, Switzerland : Springer International Publishing,


Book
Discrete Mathematics with Graph Theory
Author:
ISBN: 3031213211 3031213203 Year: 2023 Publisher: Cham : Springer International Publishing : Imprint: Springer,

Loading...
Export citation

Choose an application

Bookmark

Abstract

This book is designed to meet the requirement of undergraduate and postgraduate students pursuing computer science, information technology, mathematical science, and physical science course. No formal prerequisites are needed to understand the text matter except a very reasonable background in college algebra. The text contains in-depth coverage of all major topics proposed by professional institutions and universities for a discrete mathematics course. It emphasizes on problem-solving techniques, pattern recognition, conjecturing, induction, applications of varying nature, proof technique, algorithmic development, algorithm correctness, and numeric computations. A sufficient amount of theory is included for those who enjoy the beauty in development of the subject and a wealth of applications as well as for those who enjoy the power of problem-solving techniques. Biographical sketches of nearly 25 mathematicians and computer scientists who have played a significant role in the development of the field are threaded into the text to provide a human dimension and attach a human face to major discoveries. Each section of the book contains a generous selection of carefully tailored examples to classify and illuminate various concepts and facts. Theorems are backbone of mathematics. Consequently, this book contains the various proof techniques, explained and illustrated in details. Most of the concepts, definitions, and theorems in the book are illustrated with appropriate examples. Proofs shed additional light on the topic and enable students to sharpen thin problem-solving skills. Each chapter ends with a summary of important vocabulary, formulae, properties developed in the chapter, and list of selected references for further exploration and enrichment.


Book
Combinatorial and additive number theory IV : CANT, New York, USA, 2019 and 2020
Authors: ---
ISBN: 3030679969 3030679950 Year: 2021 Publisher: Cham, Switzerland : Springer,

Loading...
Export citation

Choose an application

Bookmark

Abstract

This is the fourth in a series of proceedings of the Combinatorial and Additive Number Theory (CANT) conferences, based on talks from the 2019 and 2020 workshops at the City University of New York. The latter was held online due to the COVID-19 pandemic, and featured speakers from North and South America, Europe, and Asia. The 2020 Zoom conference was the largest CANT conference in terms of the number of both lectures and participants. These proceedings contain 25 peer-reviewed and edited papers on current topics in number theory. Held every year since 2003 at the CUNY Graduate Center, the workshop surveys state-of-the-art open problems in combinatorial and additive number theory and related parts of mathematics. Topics featured in this volume include sumsets, zero-sum sequences, minimal complements, analytic and prime number theory, Hausdorff dimension, combinatorial and discrete geometry, and Ramsey theory. This selection of articles will be of relevance to both researchers and graduate students interested in current progress in number theory.

Keywords

Number theory. --- Discrete mathematics. --- Group theory. --- Number Theory. --- Discrete Mathematics. --- Group Theory and Generalizations. --- Groups, Theory of --- Substitutions (Mathematics) --- Algebra --- Discrete mathematical structures --- Mathematical structures, Discrete --- Structures, Discrete mathematical --- Numerical analysis --- Number study --- Numbers, Theory of --- Combinatorial number theory --- Combinatorial analysis --- Number theory --- Teoria de nombres --- Matemàtica discreta --- Teoria de grups --- Substitucions (Matemàtica) --- Àlgebra --- Anells de grup --- Automorfismes --- Categories (Matemàtica) --- Cristal·lografia matemàtica --- Endomorfismes (Teoria de grups) --- Esquemes de grups (Matemàtica) --- Grupoides --- Grups abelians --- Grups algebraics diferencials --- Grups algebraics lineals --- Grups continus --- Grups de permutacions --- Grups de transformacions --- Grups discontinus --- Grups d'homotopia --- Grups espacials --- Grups finits --- Grups fonamentals (Matemàtica) --- Grups infinits --- Grups modulars --- Grups ordenats --- Grups quàntics --- Grups resolubles --- Jocs d'estratègia (Matemàtica) --- Representacions de grups --- Semigrups --- Simetria (Matemàtica) --- Subgrups maximals --- Teoria dels reticles --- Teoria geomètrica de grups --- Matemàtica computacional --- Processament de dades (Matemàtica) --- Teoria de la computació --- Teoria dels nombres --- Anàlisi diofàntica --- Arrels de la unitat --- Congruències i residus --- Conjectura de Catalan --- Darrer teorema de Fermat --- Formes automorfes --- Formes quadràtiques --- Fórmula de traça de Selberg --- Funcions aritmètiques --- Funcions L --- Funcions modulars --- Funcions recursives --- Funcions zeta --- Geometria algebraica aritmètica --- Geometria de nombres --- Lleis de reciprocitat --- Nombres de Fermat --- Nombres ordinals --- Nombres p-àdics --- Nombres transfinits --- Numeració --- Particions (Matemàtica) --- Quadrats màgics --- Sedàs (Matemàtica) --- Teorema de Fermat --- Teorema de Gödel --- Teoria algebraica de nombres --- Teoria de Galois --- Cossos algebraics

Listing 1 - 8 of 8
Sort by