Descargar Libros y Ebooks (PDF / EPUB)

La mejor selección de ebooks gratis en español

Busca tu ebook....

Hemos encontrado un total de 36 libros disponibles para descargar
Mastering Discrete Mathematics

Mastering Discrete Mathematics

Autor: Gautami Devar

Número de Páginas: 160

"Mastering Discrete Mathematics" is a comprehensive and accessible resource designed to provide readers with a thorough understanding of the fundamental concepts, techniques, and applications of discrete mathematics. Written for students, educators, researchers, and practitioners, we offer a detailed overview of discrete mathematics, a field that deals with countable, distinct objects and structures. We cover a wide range of topics, including sets, logic, proof techniques, combinatorics, graph theory, recurrence relations, and generating functions. Our clear and concise language makes complex mathematical concepts accessible to readers with varying levels of mathematical background. Each concept is illustrated with examples and applications to demonstrate its relevance and practical significance in various domains. Emphasizing the practical applications of discrete mathematics, we explore its use in computer science, cryptography, optimization, network theory, and other scientific disciplines. Each chapter includes exercises and problems to reinforce learning, test understanding, and encourage further exploration of the material. Additional resources, including supplementary...

Combinatorial and Algorithmic Mathematics

Combinatorial and Algorithmic Mathematics

Autor: Baha Alzalg

Número de Páginas: 551

This book provides an insightful and modern treatment of combinatorial and algorithmic mathematics, with an elegant transition from mathematical foundations to optimization. It is designed for mathematics, computer science, and engineering students. The book is crowned with modern optimization methodologies. Without the optimization part, the book can be used as a textbook in a one- or two-term undergraduate course in combinatorial and algorithmic mathematics. The optimization part can be used in a one-term high-level undergraduate course, or a low- to medium-level graduate course. The book spans xv+527 pages across 12 chapters, featuring 391 LaTeX pictures, 108 tables, and 218 illustrative examples. There are also 159 nontrivial exercises included at the end of the chapters, with complete solutions included at the end of the book. Complexity progressively grows, building upon previously introduced concepts. The book includes traditional topics as well as cutting-edge topics in modern optimization.

Conjuntos, Lógica y Funciones

Conjuntos, Lógica y Funciones

Autor: Manuel López Mateos

Número de Páginas: 235

Conjuntos, Lógica y Fun­cio­nes, temas que alguna vez fue­ron con­si­de­ra­dos de alta es­pe­cia­li­dad, van ubi­cán­do­se en gra­dos cada vez más ele­men­ta­les de la for­ma­ción es­co­lar, por lo pron­to se exi­ge fa­mi­lia­ri­dad con esos temas en casi cual­quier pos­gra­do y ni qué decir en las li­cen­cia­tu­ras de matemáticas, fí­sica, in­ge­nie­rías, cómputo, eco­no­mía, fi­nan­zas, ad­mi­nis­tra­ción e incluso leyes y fi­lo­so­fía. El te­ma de Fun­cio­nes, que se presenta como obli­ga­da ex­ten­sión de las Re­la­cio­nes de­fi­ni­das en con­jun­tos, es fun­da­men­tal para el estudio del Cálculo di­fe­ren­cial e integral y de temas avan­zados como el A­ná­li­sis ma­te­má­ti­co, la To­po­lo­gía y otros. La tercera edición es una nueva compilación con LuaLaTeX, se ha mejorado el formato y actualizado las ligas a las fuentes en la Bibliografía.

Discrete and Combinatorial Mathematics

Discrete and Combinatorial Mathematics

Autor: Ralph P. Grimaldi

Número de Páginas: 968

Discrete and Combinatorial Mathematics continues to improve upon the features that have made it the market leader. The Fourth Edition has added more elementary problems, and features numerous science applications -- making this the ideal book for preparing students for advanced study.

Key Concepts in Discrete Mathematics

Key Concepts in Discrete Mathematics

Autor: Udayan Bhattacharya

Número de Páginas: 123

"Key Concepts in Discrete Mathematics" offers a comprehensive introduction to the fascinating realm of discrete mathematics, covering a diverse array of topics essential for students and professionals in computer science, mathematics, engineering, and related fields. Through clear explanations, illustrative examples, and engaging exercises, we provide readers with a solid foundation in discrete mathematics and its practical applications. Our book covers a wide range of topics, from fundamental concepts like sets, relations, and functions to advanced topics such as graph theory, combinatorics, and algorithm analysis. We present complex concepts in a clear and accessible manner, with detailed explanations and step-by-step examples guiding readers through each topic. We emphasize practical applications and real-world examples that demonstrate the relevance of discrete mathematics in various fields, including computer science, cryptography, network theory, and optimization. Abundant exercises and problems, ranging from basic to challenging, allow readers to practice and reinforce their understanding of key concepts and techniques. Additional online resources, including solutions to...

Discrete Mathematics with Applications

Discrete Mathematics with Applications

Autor: Thomas Koshy

Número de Páginas: 1079

This approachable text studies discrete objects and the relationsips that bind them. It helps students understand and apply the power of discrete math to digital computer systems and other modern applications. It provides excellent preparation for courses in linear algebra, number theory, and modern/abstract algebra and for computer science courses in data structures, algorithms, programming languages, compilers, databases, and computation.* Covers all recommended topics in a self-contained, comprehensive, and understandable format for students and new professionals * Emphasizes problem-solving techniques, pattern recognition, conjecturing, induction, applications of varying nature, proof techniques, algorithm development and correctness, and numeric computations* Weaves numerous applications into the text* Helps students learn by doing with a wealth of examples and exercises: - 560 examples worked out in detail - More than 3,700 exercises - More than 150 computer assignments - More than 600 writing projects* Includes chapter summaries of important vocabulary, formulas, and properties, plus the chapter review exercises* Features interesting anecdotes and biographies of 60...

Discrete Algorithmic Mathematics

Discrete Algorithmic Mathematics

Autor: Stephen B. Maurer , Anthony Ralston

Número de Páginas: 793

Thoroughly revised for a one-semester course, this well-known and highly regarded book is an outstanding text for undergraduate discrete mathematics. It has been updated with new or extended discussions of order notation, generating functions, chaos, aspects of statistics, and computational biology. Written in a lively, clear style, the book is unique in its emphasis on algorithmics and the inductive and recursive paradigms as central mathematical themes. It includes a broad variety of applications, not just to mathematics and computer science, but to natural and social science as well.

Handbook of Discrete and Combinatorial Mathematics

Handbook of Discrete and Combinatorial Mathematics

Autor: Kenneth H. Rosen

Número de Páginas: 1611

Handbook of Discrete and Combinatorial Mathematics provides a comprehensive reference volume for mathematicians, computer scientists, engineers, as well as students and reference librarians. The material is presented so that key information can be located and used quickly and easily. Each chapter includes a glossary. Individual topics are covered in sections and subsections within chapters, each of which is organized into clearly identifiable parts: definitions, facts, and examples. Examples are provided to illustrate some of the key definitions, facts, and algorithms. Some curious and entertaining facts and puzzles are also included. Readers will also find an extensive collection of biographies. This second edition is a major revision. It includes extensive additions and updates. Since the first edition appeared in 1999, many new discoveries have been made and new areas have grown in importance, which are covered in this edition.

Elementos de economía matemática

Elementos de economía matemática

Autor: Ramón Lacayo

Número de Páginas: 139

"Elementos de Economía Matemáticaes" un libro de texto para la asignatura Economía Matemática que cursan los estudiantes de economía en el nivel de pregrado universitario. La obra incluye una descripción de los números reales y subconjuntos tales como los racionales, irracionales, trascendentes y algebraicos. Se hace énfasis en las operaciones aritméticas y el lenguaje de las matemáticas. Se abordan nociones sobre los números complejos, su descripción geométrica, propiedades y la fórmula de Euler, así como las principales funciones elementales y el cálculo diferencial e integral aplicado a estas funciones. Se incorporan conceptos conocidos de álgebra lineal tales como matrices y determinantes. Dentro de los conceptos trabajados, destacan, por ejemplo, el estudio de las series de Taylor, la expansión de Laplace para el cálculo de determinantes, y los valores y vectores propios de una matriz. El núcleo del libro lo constituyen los capítulos de optimización, las ecuaciones recurrentes y las ecuaciones diferenciales.

FUNDAMENTALS OF DISCRETE MATHEMATICAL STRUCTURES, THIRD EDITION

FUNDAMENTALS OF DISCRETE MATHEMATICAL STRUCTURES, THIRD EDITION

Autor: Chowdhary, K. R.

Número de Páginas: 361

This updated text, now in its Third Edition, continues to provide the basic concepts of discrete mathematics and its applications at an appropriate level of rigour. The text teaches mathematical logic, discusses how to work with discrete structures, analyzes combinatorial approach to problem-solving and develops an ability to create and understand mathematical models and algorithms essentials for writing computer programs. Every concept introduced in the text is first explained from the point of view of mathematics, followed by its relation to Computer Science. In addition, it offers excellent coverage of graph theory, mathematical reasoning, foundational material on set theory, relations and their computer representation, supported by a number of worked-out examples and exercises to reinforce the students’ skill. Primarily intended for undergraduate students of Computer Science and Engineering, and Information Technology, this text will also be useful for undergraduate and postgraduate students of Computer Applications. New to this Edition Incorporates many new sections and subsections such as recurrence relations with constant coefficients, linear recurrence relations with and ...

Discrete Mathematics

Discrete Mathematics

Autor: Rowan Garnier , John Taylor

Número de Páginas: 847

Taking an approach to the subject that is suitable for a broad readership, Discrete Mathematics: Proofs, Structures, and Applications, Third Edition provides a rigorous yet accessible exposition of discrete mathematics, including the core mathematical foundation of computer science. The approach is comprehensive yet maintains an easy-to-follow prog

The Discrete Math Workbook

The Discrete Math Workbook

Autor: Sergei Kurgalin , Sergei Borzunov

Número de Páginas: 491

This practically-oriented textbook presents an accessible introduction to discrete mathematics through a substantial collection of classroom-tested exercises. Each chapter opens with concise coverage of the theory underlying the topic, reviewing the basic concepts and establishing the terminology, as well as providing the key formulae and instructions on their use. This is then followed by a detailed account of the most common problems in the area, before the reader is invited to practice solving such problems for themselves through a varied series of questions and assignments. Topics and features: provides an extensive set of exercises and examples of varying levels of complexity, suitable for both laboratory practical training and self-study; offers detailed solutions to many problems, applying commonly-used methods and computational schemes; introduces the fundamentals of mathematical logic, the theory of algorithms, Boolean algebra, graph theory, sets, relations, functions, and combinatorics; presents more advanced material on the design and analysis of algorithms, including asymptotic analysis, and parallel algorithms; includes reference lists of trigonometric and finite...

Discrete Mathematics Foundations and Applications

Discrete Mathematics Foundations and Applications

Autor: Dr. Mohd Shadab Alam

Número de Páginas: 447

Discrete Mathematics is a systematically structured academic textbook that provides a rigorous exploration of fundamental mathematical concepts essential for various disciplines, particularly computer science and engineering. The book comprehensively covers key topics, including set theory, relations, propositional calculus, functions, Boolean algebra, recurrence relations, graph theory, trees, planar graphs, combinatorial counting principles, algebraic systems, and matrix algebra. The text is designed to facilitate a progressive understanding of discrete mathematical structures, beginning with foundational principles and advancing toward more complex theoretical frameworks. Each chapter presents clearly defined concepts, supplemented with illustrative examples, well-structured exercises, and relevant diagrams to reinforce comprehension and analytical reasoning. A distinguishing feature of this book is its emphasis on the practical applicability of discrete mathematics in computational and algorithmic problem-solving. Topics such as graph theory, Boolean algebra, and recurrence relations play a pivotal role in the design and analysis of algorithms, data structures, and digital...

Mathematical Combinatorics, Vol. 3/2009

Mathematical Combinatorics, Vol. 3/2009

Autor: Linfan Mao

Número de Páginas: 123

Papers on Open Distance-Pattern Uniform Graphs, Some Results on Super Mean Graphs, Achromatic Coloring on Double Star Graph Families, Functions Preserving Convergence of Series in Fuzzy n-Normed Spaces, Smarandachely k-Constrained Number of Paths and Cycles, A Spacetime Geodesics of the Schwarzschild Space and Its Deformation Retract, and other topics. Contributors: Linfan Mao, A. Anitha, S. Arumugam, E. Sampathkumar, Vernold Vivin J., Venkatachalam M., Akbar Ali M.M., Sayed Elagan, Mohamad Rafi Segi Rahmat, Khalil Paryab, Ebrahim Zare, and others.

International Journal of Mathematical Combinatorics, Volume 3, 2009

International Journal of Mathematical Combinatorics, Volume 3, 2009

Autor: Linfan Mao

Número de Páginas: 123

Topics in detail to be covered are: Smarandache multi-spaces with applications to other sciences, such as those of algebraic multi-systems, multi-metric spaces; Smarandache geometries; Differential Geometry; Geometry on manifolds; Topological graphs; Algebraic graphs; Random graphs; Combinatorial maps; Graph and map enumeration; Combinatorial designs; Combinatorial enumeration; Other applications of Smarandache multi-space and combinatorics.

MATHEMATICAL COMBINATORICS (INTERNATIONAL BOOK SERIES), VOLUME 3, 2009

MATHEMATICAL COMBINATORICS (INTERNATIONAL BOOK SERIES), VOLUME 3, 2009

Autor: Linfan Mao

Número de Páginas: 123

Papers by many authors about the Chromatic Polynomial of Smarandache νE-Product of Graphs, Smarandachely k-Constrained Number of Paths and Cycles, Smarandache multi-space, Smarandachely Schwarzschild space, Smarandachely degree equitable k-set, Smarandachely labeling, Smarandachely k − constrained labeling, Smarandache space, Smarandachely achromatic 1-coloring for the central graph, middle graph, total graph and line graph of double star graph, Smarandachely edge m-labeling, Smarandachely super m-mean labeling, etc.

Combinatorial Organic Chemistry

Combinatorial Organic Chemistry

Autor: Sherif El-basil

Número de Páginas: 246

This is a book which considers several isomer-enumeration methods in organic chemistry. Three main topics are exemplified here: viz., theorem of polya, coset representation theory and marks of a group (method of Fujita) and wreath and generalized wreath product groups (method of Balasubramanian). Rigorous proofs have been replaced by an example-oriented, intuitive approach which exposes many problems of real chemical importance.

Combinatorics of Set Partitions

Combinatorics of Set Partitions

Autor: Toufik Mansour

Número de Páginas: 617

Focusing on a very active area of mathematical research in the last decade, Combinatorics of Set Partitions presents methods used in the combinatorics of pattern avoidance and pattern enumeration in set partitions. Designed for students and researchers in discrete mathematics, the book is a one-stop reference on the results and research activities of set partitions from 1500 A.D. to today. Each chapter gives historical perspectives and contrasts different approaches, including generating functions, kernel method, block decomposition method, generating tree, and Wilf equivalences. Methods and definitions are illustrated with worked examples and MapleTM code. End-of-chapter problems often draw on data from published papers and the author’s extensive research in this field. The text also explores research directions that extend the results discussed. C++ programs and output tables are listed in the appendices and available for download on the author’s web page.

Combinatorics of Compositions and Words

Combinatorics of Compositions and Words

Autor: Silvia Heubach , Toufik Mansour

Número de Páginas: 505

A One-Stop Source of Known Results, a Bibliography of Papers on the Subject, and Novel Research Directions Focusing on a very active area of research in the last decade, Combinatorics of Compositions and Words provides an introduction to the methods used in the combinatorics of pattern avoidance and pattern enumeration in compositions and words. It

Essentials of Abstract Algebra

Essentials of Abstract Algebra

Autor: Sachin Nambeesan

Número de Páginas: 212

"Essentials of Abstract Algebra" offers a deep exploration into the fundamental structures of algebraic systems. Authored by esteemed mathematicians, this comprehensive guide covers groups, rings, fields, and vector spaces, unraveling their intricate properties and interconnections. We introduce groups, exploring their diverse types, from finite to infinite and abelian to non-abelian, with concrete examples and rigorous proofs. Moving beyond groups, we delve into rings, explaining concepts like ideals, homomorphisms, and quotient rings. The text highlights the relevance of ring theory in number theory, algebraic geometry, and coding theory. We also navigate fields, discussing field extensions, Galois theory, and algebraic closures, and exploring connections between fields and polynomial equations. Additionally, we venture into vector spaces, examining subspaces, bases, dimension, and linear transformations. Throughout the book, we emphasize a rigorous mathematical foundation and intuitive understanding. Concrete examples, diagrams, and exercises enrich the learning experience, making abstract algebra accessible to students, mathematicians, and researchers. "Essentials of Abstract...

A Practical Approach to High-Performance Computing

A Practical Approach to High-Performance Computing

Autor: Sergei Kurgalin , Sergei Borzunov

Número de Páginas: 210

The book discusses the fundamentals of high-performance computing. The authors combine visualization, comprehensibility, and strictness in their material presentation, and thus influence the reader towards practical application and learning how to solve real computing problems. They address both key approaches to programming modern computing systems: multithreading-based parallelizing in shared memory systems, and applying message-passing technologies in distributed systems. The book is suitable for undergraduate and graduate students, and for researchers and practitioners engaged with high-performance computing systems. Each chapter begins with a theoretical part, where the relevant terminology is introduced along with the basic theoretical results and methods of parallel programming, and concludes with a list of test questions and problems of varying difficulty. The authors include many solutions and hints, and often sample code.

Matemáticas discretas y combinatoria : una introducción con aplicaciones

Matemáticas discretas y combinatoria : una introducción con aplicaciones

Autor: Ralph P. Grimaldi

Número de Páginas: 1046
Write Your Own Proofs

Write Your Own Proofs

Autor: Amy Babich , Laura Person

Número de Páginas: 257

Written by a pair of math teachers and based on their classroom notes and experiences, this introductory treatment of theory, proof techniques, and related concepts is designed for undergraduate courses. No knowledge of calculus is assumed, making it a useful text for students at many levels. The focus is on teaching students to prove theorems and write mathematical proofs so that others can read them. Since proving theorems takes lots of practice, this text is designed to provide plenty of exercises. The authors break the theorems into pieces and walk readers through examples, encouraging them to use mathematical notation and write proofs themselves. Topics include propositional logic, set notation, basic set theory proofs, relations, functions, induction, countability, and some combinatorics, including a small amount of probability. The text is ideal for courses in discrete mathematics or logic and set theory, and its accessibility makes the book equally suitable for classes in mathematics for liberal arts students or courses geared toward proof writing in mathematics.

An Introduction to Real-Time Computing for Mechanical Engineers

An Introduction to Real-Time Computing for Mechanical Engineers

Autor: Rico A. R. Picone , Joseph L. Garbini , Cameron N. Devine

Número de Páginas: 487

A comprehensive introduction to real-time computing for mechanical engineers and engineering students that integrates theory and application. There are many textbooks that cover real-time computing, but none designed specifically for mechanical engineering curricula. Filling this gap, Rico Picone, Joseph Garbini, and Cameron Devine provide mechanical engineers and engineering students with a comprehensive introduction to real-time computing that integrates theory and application. The book presents the key ideas required to realize mechatronic systems that include real-time computers as functional components. Learning is organized around a sequence of nine hands-on laboratory exercises. Topics include scheduling, interrupts, timing, real-time operating systems, computer hardware, C programming, device drivers, algorithms, digital electronics, communication, amplifiers, encoders, finite state machines, discrete dynamic systems, and digital feedback control. Leading readers through the process of designing and implementing real-time systems while applying the architecture and resources of a modern real-time development environment, this text provides an essential foundation that can...

Mathematics Is Not a Spectator Sport

Mathematics Is Not a Spectator Sport

Autor: George Mcartney Phillips

Número de Páginas: 252

Compared to other popular math books, there is more algebraic manipulation, and more applications of algebra in number theory and geometry Presents an exciting variety of topics to motivate beginning students May be used as an introductory course or as background reading

Networked RFID Systems and Lightweight Cryptography

Networked RFID Systems and Lightweight Cryptography

Autor: Peter H. Cole , Damith C. Ranasinghe

Número de Páginas: 350

This book consists of a collection of works on utilizing the automatic identification technology provided by Radio Frequency Identification (RFID) to address the problems of global counterfeiting of goods. The book presents current research, directed to securing supply chains against the efforts of counterfeit operators, carried out at the Auto-ID Labs around the globe. It assumes very little knowledge on the part of the reader on Networked RFID systems as the material provided in the introduction familiarizes the reader with concepts, underlying principles and vulnerabilities of modern RFID systems.

Quantum Computing for Computer Scientists

Quantum Computing for Computer Scientists

Autor: Noson S. Yanofsky , Mirco A. Mannucci

Número de Páginas: 351

The multidisciplinary field of quantum computing strives to exploit some of the uncanny aspects of quantum mechanics to expand our computational horizons. Quantum Computing for Computer Scientists takes readers on a tour of this fascinating area of cutting-edge research. Written in an accessible yet rigorous fashion, this book employs ideas and techniques familiar to every student of computer science. The reader is not expected to have any advanced mathematics or physics background. After presenting the necessary prerequisites, the material is organized to look at different aspects of quantum computing from the specific standpoint of computer science. There are chapters on computer architecture, algorithms, programming languages, theoretical computer science, cryptography, information theory, and hardware. The text has step-by-step examples, more than two hundred exercises with solutions, and programming drills that bring the ideas of quantum computing alive for today's computer science students and researchers.

Two Millennia of Mathematics

Two Millennia of Mathematics

Autor: George M. Phillips

Número de Páginas: 236

This book is intended for those who love mathematics, including under graduate students of mathematics, more experienced students, and the vast number of amateurs, in the literal sense of those who do something for the love of it. I hope it will also be a useful source of material for those who teach mathematics. It is a collection of loosely connected topics in areas of mathematics that particularly interest me, ranging over the two millennia from the work of Archimedes, who died in the year 212 Be, to the Werke of Gauss, who was born in 1777, although there are some references outside this period. In view of its title, I must emphasize that this book is certainly not pretending to be a comprehensive history of the mathematics of this period, or even a complete account of the topics discussed. However, every chapter is written with the history of its topic in mind. It is fascinating, for example, to follow how both Napier and Briggs constructed their log arithms before many of the most relevant mathematical ideas had been discovered. Do I really mean "discovered"? There is an old question, "Is mathematics created or discovered?" Sometimes it seems a shame not to use the word...

CRC Concise Encyclopedia of Mathematics

CRC Concise Encyclopedia of Mathematics

Autor: Eric W. Weisstein

Número de Páginas: 3253

Upon publication, the first edition of the CRC Concise Encyclopedia of Mathematics received overwhelming accolades for its unparalleled scope, readability, and utility. It soon took its place among the top selling books in the history of Chapman & Hall/CRC, and its popularity continues unabated. Yet also unabated has been the d

Ubiquitous Information Technologies and Applications

Ubiquitous Information Technologies and Applications

Autor: Young-sik Jeong , Young-ho Park , Ching-hsien (robert) Hsu , James J. (jong Hyuk) Park

Número de Páginas: 842

The theme of CUTE is focused on the various aspects of ubiquitous computing for advances in ubiquitous computing and provides an opportunity for academic and industry professionals to discuss the latest issues and progress in the area of ubiquitous computing. Therefore this book will be include the various theories and practical applications in ubiquitous computing

Introductory Graph Theory with Applications

Introductory Graph Theory with Applications

Autor: Fred Buckley , Marty Lewinter

Número de Páginas: 381

Graph theory’s practical applications extend not only across multiple areas of mathematics and computer science but also throughout the social sciences, business, engineering, and other subjects. Buckley and Lewinter have written their text with students of all these disciplines in mind. Pedagogically rich, the authors provide hundreds of worked-out examples, figures, and exercises of varying degrees of difficulty. Concepts are presented in a readable and accessible manner, and applications are stressed throughout so the reader never loses sight of the powerful tools graph theory provides to solve real-world problems. Such diverse areas as job assignment, delivery truck routing, location of emergency or service facilities, network reliability, zoo design, exam scheduling, error-correcting codes, facility layout, and the critical path method are covered.

Últimos libros y autores buscados