Polynomial Methods in Combinatorics

DOWNLOAD NOW »

Author: Larry Guth

Publisher: American Mathematical Soc.

ISBN: 1470428903

Category: Combinatorial geometry

Page: 273

View: 5202

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.

A Journey Through Discrete Mathematics

A Tribute to Jiří Matoušek

DOWNLOAD NOW »

Author: Martin Loebl,Jaroslav Nešetřil,Robin Thomas

Publisher: Springer

ISBN: 3319444794

Category: Computers

Page: 810

View: 2749

This collection of high-quality articles in the field of combinatorics, geometry, algebraic topology and theoretical computer science is a tribute to Jiří Matoušek, who passed away prematurely in March 2015. It is a collaborative effort by his colleagues and friends, who have paid particular attention to clarity of exposition – something Jirka would have approved of. The original research articles, surveys and expository articles, written by leading experts in their respective fields, map Jiří Matoušek’s numerous areas of mathematical interest.

Handbook of Discrete and Computational Geometry, Third Edition

DOWNLOAD NOW »

Author: Csaba D. Toth,Joseph O'Rourke,Jacob E. Goodman

Publisher: CRC Press

ISBN: 1351645919

Category: Computers

Page: 1928

View: 4921

The Handbook of Discrete and Computational Geometry is intended as a reference book fully accessible to nonspecialists as well as specialists, covering all major aspects of both fields. The book offers the most important results and methods in discrete and computational geometry to those who use them in their work, both in the academic world—as researchers in mathematics and computer science—and in the professional world—as practitioners in ?elds as diverse as operations research, molecular biology, and robotics. Discrete geometry has contributed signi?cantly to the growth of discrete mathematics in recent years. This has been fueled partly by the advent of powerful computers and by the recent explosion of activity in the relatively young ?eld of computational geometry. This synthesis between discrete and computational geometry lies at the heart of this Handbook. A growing list of application fields includes combinatorial optimization, computer-aided design, computer graphics, crystallography, data analysis, error-correcting codes, geographic information systems, motion planning, operations research, pattern recognition, robotics, solid modeling, and tomography.

Surveys in Combinatorics, 1991

DOWNLOAD NOW »

Author: A. D. Keedwell,N. J. Hitchin

Publisher: Cambridge University Press

ISBN: 9780521407663

Category: Mathematics

Page: 300

View: 732

This volume contains the invited papers presented at the British Combinatorial Conference, held at the University of Surrey in July 1991.

Recent Trends in Combinatorics

DOWNLOAD NOW »

Author: Andrew Beveridge,Jerrold R. Griggs,Leslie Hogben,Gregg Musiker,Prasad Tetali

Publisher: Springer

ISBN: 3319242989

Category: Mathematics

Page: 778

View: 6633

This volume presents some of the research topics discussed at the 2014-2015 Annual Thematic Program Discrete Structures: Analysis and Applications at the Institute for Mathematics and its Applications during Fall 2014, when combinatorics was the focus. Leading experts have written surveys of research problems, making state of the art results more conveniently and widely available. The three-part structure of the volume reflects the three workshops held during Fall 2014. In the first part, topics on extremal and probabilistic combinatorics are presented; part two focuses on additive and analytic combinatorics; and part three presents topics in geometric and enumerative combinatorics. This book will be of use to those who research combinatorics directly or apply combinatorial methods to other fields.

Graphs for Pattern Recognition

Infeasible Systems of Linear Inequalities

DOWNLOAD NOW »

Author: Damir Gainanov

Publisher: Walter de Gruyter GmbH & Co KG

ISBN: 3110481065

Category: Mathematics

Page: 158

View: 523

Data mining and pattern recognition are areas based on the mathematical constructions discussed in this monograph. By using combinatorial and graph theoretical techniques, it is shown how to tackle infeasible systems of linear inequalities. These are, in turn, building blocks of geometric decision rules for pattern recognition.

Combinatorial Methods in Density Estimation

DOWNLOAD NOW »

Author: Luc Devroye,Gabor Lugosi

Publisher: Springer Science & Business Media

ISBN: 9780387951171

Category: Mathematics

Page: 208

View: 3023

Density estimation has evolved enormously since the days of bar plots and histograms, but researchers and users are still struggling with the problem of the selection of the bin widths. This text explores a new paradigm for the data-based or automatic selection of the free parameters of density estimates in general so that the expected error is within a given constant multiple of the best possible error. The paradigm can be used in nearly all density estimates and for most model selection problems, both parametric and nonparametric. It is the first book on this topic. The text is intended for first-year graduate students in statistics and learning theory, and offers a host of opportunities for further research and thesis topics. Each chapter corresponds roughly to one lecture, and is supplemented with many classroom exercises. A one year course in probability theory at the level of Feller's Volume 1 should be more than adequate preparation. Gabor Lugosi is Professor at Universitat Pompeu Fabra in Barcelona, and Luc Debroye is Professor at McGill University in Montreal. In 1996, the authors, together with Lászlo Györfi, published the successful text, A Probabilistic Theory of Pattern Recognition with Springer-Verlag. Both authors have made many contributions in the area of nonparametric estimation.

Frontiers In Orthogonal Polynomials And Q-series

DOWNLOAD NOW »

Author: Nashed M Zuhair,Li Xin

Publisher: World Scientific

ISBN: 981322889X

Category: Mathematics

Page: 576

View: 4606

This volume aims to highlight trends and important directions of research in orthogonal polynomials, q-series, and related topics in number theory, combinatorics, approximation theory, mathematical physics, and computational and applied harmonic analysis. This collection is based on the invited lectures by well-known contributors from the International Conference on Orthogonal Polynomials and q-Series, that was held at the University of Central Florida in Orlando, on May 10–12, 2015. The conference was dedicated to Professor Mourad Ismail on his 70th birthday. The editors strived for a volume that would inspire young researchers and provide a wealth of information in an engaging format. Theoretical, combinatorial and computational/algorithmic aspects are considered, and each chapter contains many references on its topic, when appropriate. Contents: Mourad Ismail (Richard Askey)Binomial Andrews–Gordon–Bressoud Identities (Dennis Stanton)Symmetric Expansions of Very Well-Poised Basic Hypergeometric Series (George E Andrews)A Sturm–Liouville Theory for Hahn Difference Operator (M H Annaby, A E Hamza and S D Makharesh)Solvability of the Hankel Determinant Problem for Real Sequences (Andrew Bakan and Christian Berg)Convolution and Product Theorems for the Special Affine Fourier Transform (Ayush Bhandari and Ahmed I Zayed)A Further Look at Time-and-Band Limiting for Matrix Orthogonal Polynomials (M Castro, F A Grünbaum, I Pacharoni and I Zurrián)The Orthogonality of Al–Salam–Carlitz Polynomials for Complex Parameters (Howard S Cohl, Roberto S Costas-Santos and Wenqing Xu)Crouching AGM, Hidden Modularity (Shaun Cooper, Jesús Guillera, Armin Straub and Wadim Zudilin)Asymptotics of Orthogonal Polynomials and the Painlevé Transcendents (Dan Dai)From the Gaussian Circle Problem to Multivariate Shannon Sampling (Willi Freeden and M Zuhair Nashed)Weighted Partition Identities and Divisor Sums (F G Garvan)On the Ismail–Letessier–Askey Monotonicity Conjecture for Zeros of Ultraspherical Polynomials (Walter Gautschi)A Discrete Top-Down Markov Problem in Approximation Theory (Walter Gautschi)Supersymmetry of the Quantum Rotor (Vincent X Genest, Luc Vinet, Guo-Fu Yu and Alexei Zhedanov)The Method of Brackets in Experimental Mathematics (Ivan Gonzalez, Karen Kohl, Lin Jiu and Victor H Moll)Balanced Modular Parameterizations (Tim Huber, Danny Lara and Esteban Melendez)Some Smallest Parts Functions from Variations of Bailey's Lemma (Chris Jennings-Shaffer)Dual Addition Formulas Associated with Dual Product Formulas (Tom H Koornwinder)Holonomic Tools for Basic Hypergeometric Functions (Christoph Koutschan and Peter Paule)A Direct Evaluation of an Integral of Ismail and Valent (Alexey Kuznetsov)Algebraic Generating Functions for Gegenbauer Polynomials (Robert S Maier)q-Analogues of Two Product Formulas of Hypergeometric Functions by Bailey (Michael J Schlosser)Summation Formulae for Noncommutative Hypergeometric Series (Michael J Schlosser)Asymptotics of Generalized Hypergeometric Functions (Y Lin and R Wong)Mock Theta-Functions of the Third Order of Ramanujan in Terms of Appell–Lerch Series (Changgui Zhang)On Certain Positive Semidefinite Matrices of Special Functions (Ruiming Zhang) Readership: Graduate students and researchers interested in orthogonal polynomials and

Surveys in Combinatorics, 1995

DOWNLOAD NOW »

Author: Peter Rowlinson

Publisher: Cambridge University Press

ISBN: 9780521497978

Category: Mathematics

Page: 231

View: 4884

This volume provides an up-to-date survey of current research activity in several areas of combinatorics and its applications. These include distance-regular graphs, combinatorial designs, coding theory, spectra of graphs, and randomness and computation. The articles give an overview of combinatorics that will be extremely useful to both mathematicians and computer scientists.

Surveys in Combinatorics, 1999

DOWNLOAD NOW »

Author: J. D. Lamb,D. A. Preece,Donald Arthur Preece,N. J. Hitchin

Publisher: Cambridge University Press

ISBN: 9780521653763

Category: Mathematics

Page: 298

View: 2346

This volume, first published in 1999, is a valuable resource on combinatorics for graduate students and researchers.

Surveys in Combinatorics 2003

DOWNLOAD NOW »

Author: C. D. Wensley

Publisher: Cambridge University Press

ISBN: 9780521540124

Category: Mathematics

Page: 370

View: 4713

The British Combinatorial Conference is held every two years and is a key event for mathematicians worldwide working in combinatorics. In June 2003 the conference was held at the University of Wales, Bangor. The papers contained here are surveys contributed by the invited speakers and are of the high quality that befits the event. There is also a tribute to Bill Tutte who had a long-standing association with the BCC. The papers cover topics currently attracting significant research interest as well as some less traditional areas such as the combinatorics of protecting digital content. They will form an excellent resource for established researchers as well as graduate students who will find much here to inspire future work.

Surveys in Combinatorics 2005

DOWNLOAD NOW »

Author: Bridget S. Webb

Publisher: Cambridge University Press

ISBN: 9780521615235

Category: Mathematics

Page: 258

View: 1644

This volume provides an up-to-date overview of current research across combinatorics,.

Topics in Geometric Group Theory

DOWNLOAD NOW »

Author: Pierre de la Harpe

Publisher: University of Chicago Press

ISBN: 9780226317212

Category: Mathematics

Page: 310

View: 6893

In this book, Pierre de la Harpe provides a concise and engaging introduction to geometric group theory, a new method for studying infinite groups via their intrinsic geometry that has played a major role in mathematics over the past two decades. A recognized expert in the field, de la Harpe adopts a hands-on approach, illustrating key concepts with numerous concrete examples. The first five chapters present basic combinatorial and geometric group theory in a unique and refreshing way, with an emphasis on finitely generated versus finitely presented groups. In the final three chapters, de la Harpe discusses new material on the growth of groups, including a detailed treatment of the "Grigorchuk group." Most sections are followed by exercises and a list of problems and complements, enhancing the book's value for students; problems range from slightly more difficult exercises to open research problems in the field. An extensive list of references directs readers to more advanced results as well as connections with other fields.

Surveys in Combinatorics 2013

DOWNLOAD NOW »

Author: Simon R. Blackburn,Stefanie Gerke,Mark Wildon

Publisher: Cambridge University Press

ISBN: 1107651956

Category: Computers

Page: 384

View: 7892

Surveys of recent important developments in combinatorics covering a wide range of areas in the field.

Surveys in Combinatorics

Invited Papers for the ... British Combinatorial Conference

DOWNLOAD NOW »

Author: James William Peter Hirschfeld

Publisher: N.A

ISBN: N.A

Category: Combinatorial analysis

Page: N.A

View: 5736

Graphs, Networks and Algorithms

DOWNLOAD NOW »

Author: Dieter Jungnickel

Publisher: Springer Science & Business Media

ISBN: 3540727809

Category: Mathematics

Page: 650

View: 2477

Revised throughout Includes new chapters on the network simplex algorithm and a section on the five color theorem Recent developments are discussed

Computer Algebra Methods for Equivariant Dynamical Systems

DOWNLOAD NOW »

Author: Karin Gatermann

Publisher: Springer

ISBN: N.A

Category: Computers

Page: 162

View: 5024

This book starts with an overview of the research of Gröbner bases which have many applications in various areas of mathematics since they are a general tool for the investigation of polynomial systems. The next chapter describes algorithms in invariant theory including many examples and time tables. These techniques are applied in the chapters on symmetric bifurcation theory and equivariant dynamics. This combination of different areas of mathematics will be interesting to researchers in computational algebra and/or dynamics.

Graph Theory, Combinatorics and Algorithms

Interdisciplinary Applications

DOWNLOAD NOW »

Author: Martin Charles Golumbic,Irith Ben-Arroyo Hartman

Publisher: Springer Science & Business Media

ISBN: 0387250360

Category: Mathematics

Page: 292

View: 2161

Graph Theory, Combinatorics and Algorithms: Interdisciplinary Applications focuses on discrete mathematics and combinatorial algorithms interacting with real world problems in computer science, operations research, applied mathematics and engineering. The book contains eleven chapters written by experts in their respective fields, and covers a wide spectrum of high-interest problems across these discipline domains. Among the contributing authors are Richard Karp of UC Berkeley and Robert Tarjan of Princeton; both are at the pinnacle of research scholarship in Graph Theory and Combinatorics. The chapters from the contributing authors focus on "real world" applications, all of which will be of considerable interest across the areas of Operations Research, Computer Science, Applied Mathematics, and Engineering. These problems include Internet congestion control, high-speed communication networks, multi-object auctions, resource allocation, software testing, data structures, etc. In sum, this is a book focused on major, contemporary problems, written by the top research scholars in the field, using cutting-edge mathematical and computational techniques.

Orthogonal Polynomials

Theory and Practice

DOWNLOAD NOW »

Author: Paul Nevai

Publisher: Springer Science & Business Media

ISBN: 9400905017

Category: Mathematics

Page: 488

View: 2811

This volume contains the Proceedings of the NATO Advanced Study Institute on "Orthogonal Polynomials and Their Applications" held at The Ohio State University in Columbus, Ohio, U.S.A. between May 22,1989 and June 3,1989. The Advanced Study Institute primarily concentrated on those aspects of the theory and practice of orthogonal polynomials which surfaced in the past decade when the theory of orthogonal polynomials started to experience an unparalleled growth. This progress started with Richard Askey's Regional Confer ence Lectures on "Orthogonal Polynomials and Special Functions" in 1975, and subsequent discoveries led to a substantial revaluation of one's perceptions as to the nature of orthogonal polynomials and their applicability. The recent popularity of orthogonal polynomials is only partially due to Louis de Branges's solution of the Bieberbach conjecture which uses an inequality of Askey and Gasper on Jacobi polynomials. The main reason lies in their wide applicability in areas such as Pade approximations, continued fractions, Tauberian theorems, numerical analysis, probability theory, mathematical statistics, scattering theory, nuclear physics, solid state physics, digital signal processing, electrical engineering, theoretical chemistry and so forth. This was emphasized and convincingly demonstrated during the presentations by both the principal speakers and the invited special lecturers. The main subjects of our Advanced Study Institute included complex orthogonal polynomials, signal processing, the recursion method, combinatorial interpretations of orthogonal polynomials, computational problems, potential theory, Pade approximations, Julia sets, special functions, quantum groups, weighted approximations, orthogonal polynomials associated with root systems, matrix orthogonal polynomials, operator theory and group representations.