The Combinatorics of Polynomial Sequences
Title | The Combinatorics of Polynomial Sequences PDF eBook |
Author | David Lawrence Reiner |
Publisher | |
Pages | 266 |
Release | 1975 |
Genre | |
ISBN |
Unimodal Log-Concave and Polya Frequency Sequences in Combinatorics
Title | Unimodal Log-Concave and Polya Frequency Sequences in Combinatorics PDF eBook |
Author | Francesco Brenti |
Publisher | American Mathematical Soc. |
Pages | 118 |
Release | 1989 |
Genre | Combinatorial analysis |
ISBN | 0821824767 |
Many sequences of combinatorial interest are known to be unimodal or log-concave and there has been a considerable amount of interest devoted to this topic. The main object of this work is to point out another branch of mathematics that can be successfully used to attack these kinds of problems, namely, the theory of total positivity.
Algebraic Combinatorics
Title | Algebraic Combinatorics PDF eBook |
Author | Chris Godsil |
Publisher | Routledge |
Pages | 382 |
Release | 2017-10-19 |
Genre | Mathematics |
ISBN | 1351467506 |
This graduate level text is distinguished both by the range of topics and the novelty of the material it treats--more than half of the material in it has previously only appeared in research papers. The first half of this book introduces the characteristic and matchings polynomials of a graph. It is instructive to consider these polynomials together because they have a number of properties in common. The matchings polynomial has links with a number of problems in combinatorial enumeration, particularly some of the current work on the combinatorics of orthogonal polynomials. This connection is discussed at some length, and is also in part the stimulus for the inclusion of chapters on orthogonal polynomials and formal power series. Many of the properties of orthogonal polynomials are derived from properties of characteristic polynomials. The second half of the book introduces the theory of polynomial spaces, which provide easy access to a number of important results in design theory, coding theory and the theory of association schemes. This book should be of interest to second year graduate text/reference in mathematics.
Discrete Mathematics
Title | Discrete Mathematics PDF eBook |
Author | Oscar Levin |
Publisher | Createspace Independent Publishing Platform |
Pages | 238 |
Release | 2018-07-30 |
Genre | |
ISBN | 9781724572639 |
Note: This is a custom edition of Levin's full Discrete Mathematics text, arranged specifically for use in a discrete math course for future elementary and middle school teachers. (It is NOT a new and updated edition of the main text.)This gentle introduction to discrete mathematics is written for first and second year math majors, especially those who intend to teach. The text began as a set of lecture notes for the discrete mathematics course at the University of Northern Colorado. This course serves both as an introduction to topics in discrete math and as the "introduction to proof" course for math majors. The course is usually taught with a large amount of student inquiry, and this text is written to help facilitate this.Four main topics are covered: counting, sequences, logic, and graph theory. Along the way proofs are introduced, including proofs by contradiction, proofs by induction, and combinatorial proofs.While there are many fine discrete math textbooks available, this text has the following advantages: - It is written to be used in an inquiry rich course.- It is written to be used in a course for future math teachers.- It is open source, with low cost print editions and free electronic editions.
Elliptic Polynomials
Title | Elliptic Polynomials PDF eBook |
Author | J.S. Lomont |
Publisher | CRC Press |
Pages | 328 |
Release | 2000-08-31 |
Genre | Mathematics |
ISBN | 9781584882107 |
A remarkable interplay exists between the fields of elliptic functions and orthogonal polynomials. In the first monograph to explore their connections, Elliptic Polynomials combines these two areas of study, leading to an interesting development of some basic aspects of each. It presents new material about various classes of polynomials and about the odd Jacobi elliptic functions and their inverses. The term elliptic polynomials refers to the polynomials generated by odd elliptic integrals and elliptic functions. In studying these, the authors consider such things as orthogonality and the construction of weight functions and measures, finding structure constants and interesting inequalities, and deriving useful formulas and evaluations. Although some of the material may be familiar, it establishes a new mathematical field that intersects with classical subjects at many points. Its wealth of information on important properties of polynomials and clear, accessible presentation make Elliptic Polynomials valuable to those in real and complex analysis, number theory, and combinatorics, and will undoubtedly generate further research.
Polynomial Methods in Combinatorics
Title | Polynomial Methods in Combinatorics PDF eBook |
Author | Larry Guth |
Publisher | American Mathematical Soc. |
Pages | 287 |
Release | 2016-06-10 |
Genre | Mathematics |
ISBN | 1470428903 |
This book explains some recent applications of the theory of polynomials and algebraic geometry to combinatorics and other areas of mathematics. One of the first results in this story is a short elegant solution of the Kakeya problem for finite fields, which was considered a deep and difficult problem in combinatorial geometry. The author also discusses in detail various problems in incidence geometry associated to Paul Erdős's famous distinct distances problem in the plane from the 1940s. The proof techniques are also connected to error-correcting codes, Fourier analysis, number theory, and differential geometry. Although the mathematics discussed in the book is deep and far-reaching, it should be accessible to first- and second-year graduate students and advanced undergraduates. The book contains approximately 100 exercises that further the reader's understanding of the main themes of the book.
Combinatorics and Number Theory of Counting Sequences
Title | Combinatorics and Number Theory of Counting Sequences PDF eBook |
Author | Istvan Mezo |
Publisher | CRC Press |
Pages | 480 |
Release | 2019-08-19 |
Genre | Computers |
ISBN | 1351346385 |
Combinatorics and Number Theory of Counting Sequences is an introduction to the theory of finite set partitions and to the enumeration of cycle decompositions of permutations. The presentation prioritizes elementary enumerative proofs. Therefore, parts of the book are designed so that even those high school students and teachers who are interested in combinatorics can have the benefit of them. Still, the book collects vast, up-to-date information for many counting sequences (especially, related to set partitions and permutations), so it is a must-have piece for those mathematicians who do research on enumerative combinatorics. In addition, the book contains number theoretical results on counting sequences of set partitions and permutations, so number theorists who would like to see nice applications of their area of interest in combinatorics will enjoy the book, too. Features The Outlook sections at the end of each chapter guide the reader towards topics not covered in the book, and many of the Outlook items point towards new research problems. An extensive bibliography and tables at the end make the book usable as a standard reference. Citations to results which were scattered in the literature now become easy, because huge parts of the book (especially in parts II and III) appear in book form for the first time.