The Major Counting Of Nonintersecting Lattice Paths And Generating Functions For Tableaux

This work develops a theory for counting nonintersecting lattice paths by the major index and generalizations of it. As applications, Krattenthaler computes certain tableaux and plane partition generating functions. In particular, he derives refinements of the Bender-Knuth and McMahon conjectures, thereby giving new proofs of these conjectures. Providing refinements of famous results in plane partition theory, this work combines in an effective and nontrivial way classical tools from bijective combinatorics and the theory of special functions.

Proceedings of the Conference on Algebra and Algebraic Geometry with Applications, July 19 – 26, 2000, at Purdue University to honor Professor Shreeram S. Abhyankar on the occasion of his seventieth birthday. Eighty-five of Professor Abhyankar's students, collaborators, and colleagues were invited participants. Sixty participants presented papers related to Professor Abhyankar's broad areas of mathematical interest. Sessions were held on algebraic geometry, singularities, group theory, Galois theory, combinatorics, Drinfield modules, affine geometry, and the Jacobian problem. This volume offers an outstanding collection of papers by expert authors.

Sri Gopal Mohanty has made pioneering contributions to lattice path counting and its applications to probability and statistics. This is clearly evident from his lifetime publications list and the numerous citations his publications have received over the past three decades. My association with him began in 1982 when I came to McMaster Univer sity. Since then, I have been associated with him on many different issues at professional as well as cultural levels; I have benefited greatly from him on both these grounds. I have enjoyed very much being his colleague in the statistics group here at McMaster University and also as his friend. While I admire him for his honesty, sincerity and dedication, I appreciate very much his kindness, modesty and broad-mindedness. Aside from our common interest in mathematics and statistics, we both have great love for Indian classical music and dance. We have spent numerous many different subjects associated with the Indian music and hours discussing dance. I still remember fondly the long drive (to Amherst, Massachusetts) I had a few years ago with him and his wife, Shantimayee, and all the hearty discussions we had during that journey. Combinatorics and applications of combinatorial methods in probability and statistics has become a very active and fertile area of research in the recent past.

A sub-Riemannian manifold ([italic capitals]M, E, G) consists of a finite-dimensional manifold [italic capital]M, a rank-two bracket generating distribution [italic capital]E on [italic capital]M, and a Riemannian metric [italic capital]G on [italic capital]E. All length-minimizing arcs on ([italic capitals]M, E, G) are either normal extremals or abnormal extremals. Normal extremals are locally optimal, i.e., every sufficiently short piece of such an extremal is a minimizer. The question whether every length-minimizer is a normal extremal was recently settled by R. G. Montgomery, who exhibited a counterexample. The present work proves that regular abnormal extremals are locally optimal, and, in the case that [italic capital]E satisfies a mild additional restriction, the abnormal minimizers are ubiquitous rather than exceptional. All the topics of this research report (historical notes, examples, abnormal extremals, Hamiltonians, nonholonomic distributions, sub-Riemannian distance, the relations between minimality and extremality, regular abnormal extremals, local optimality of regular abnormal extremals, etc.) are presented in a very clear and effective way.

Presenting the state of the art, the Handbook of Enumerative Combinatorics brings together the work of today's most prominent researchers. The contributors survey the methods of combinatorial enumeration along with the most frequent applications of these methods.This important new work is edited by Miklos Bona of the University of Florida where he

Vector Partitions, Visible Points and Ramanujan Functions offers a novel theory of Vector Partitions, though very much grounded in the long-established work of others, that could be developed as an extension to the existing theory of Integer Partitions. The book is suitable for graduate students in physics, applied mathematics, number theory and computational mathematics. It takes the reader up to research level, presenting new results alongside known classical results from integer partitions and areas of vector and multipartite partition theory. It also sets forth new directions for research for the more advanced reader. Above all, the intention of the book is to bring new inspiration to others who study mathematics and related areas. It is hoped that some new ideas will be launched to add value and insight into many of the classical and new theories surrounding partitions. The book is an appreciation of the many gifted authors of research into partitions over the past century and before, in the hope that more may come of this for future generations. Features Provides a step-by-step guide through the known literature on Integer and Vector Partitions, and a focus on the not so well-known Visible Point Vector identities Serves as a reference for graduate students and researchers in physics, applied mathematics, number theory and computational mathematics Offers a variety of practical examples as well as sets of exercises suitable for students and researchers Geoffrey B. Campbell completed his PhD at Australian National University in 1998 under the esteemed physicist Professor Rodney Baxter. His affiliation with the Australian National University Mathematical Sciences Institute has continued for over 30 years. Within that time frame, Geoffrey also served eight years as an Honorary Research Fellow at LaTrobe University Mathematics and Statistics Department in Melbourne. Currently he writes ongoing articles for the Australian Mathematical Society Gazette. Within the international scope, Geoffrey currently serves as a PhD external committee member for a mathematics graduate student at Washington State University in America. Geoffrey has built a career within Australian Commonwealth and State government departments, including as an Advisor at the Department of Prime Minister and Cabinet; as Analyst Researcher for a Royal Commission. Geoffrey specializes in complex data, machine learning including data analytics. He is also a published poet in Australian anthologies and literary magazines.

Currently, new trends in mathematics are emerging from the fruitful interaction between signal processing, image processing, and classical analysis. One example is given by ``wavelets'', which incorporate both the know-how of the Calderon-Zygmund school and the efficiency of some fast algorithms developed in signal processing (quadrature mirror filters and pyramidal algorithms.) A second example is ``multi-fractal analysis''. The initial motivation was the study of fully developed turbulence and the introduction by Frisch and Parisi of the multi-fractal spectrum. Multi-fractal analysis provides a deeper insight into many classical functions in mathematics. A third example--``chirps''--is studied in this book. Chirps are used in modern radar or sonar technology. Once given a precise mathematical definition, chirps constitute a powerful tool in classical analysis. In this book, wavelet analysis is related to the 2-microlocal spaces discovered by J. M. Bony. The authors then prove that a wavelet based multi-fractal analysis leads to a remarkable improvement of Sobolev embedding theorem. In addition, they show that chirps were hidden in a celebrated Riemann series. Features: Provides the reader with some basic training in new lines of research. Clarifies the relationship between pointwise behavior and size properties of wavelet coefficents.