Author : Louis J. Billera
Publisher : American Mathematical Soc.
Page : 210 pages
File Size : 40,33 MB
Release : 1996
Category : Mathematics
ISBN : 0821803247
Because of the interplay among many fields of mathematics and science, algebraic combinatorics is an area in which a wide variety of ideas and methods come together. The papers in this volume reflect the most interesting aspects of this rich interaction, and will be of interest to researchers in discrete mathematics and combinatorial systems.
Author : Louis J. Billera
Publisher : American Mathematical Soc.
Page : 212 pages
File Size : 28,80 MB
Release :
Category : Mathematics
ISBN : 9780821870709
Because of the inteplay among many fields of mathematics and science, algebraic combinatorics is an area in which a wide variety of ideas and methods come together. The papers in this volume reflect the most interesting aspects of this rich interaction and will be of interest to researchers in discrete mathematics and combinatorial systems.
Author : Daniel Krob
Publisher : Springer Science & Business Media
Page : 815 pages
File Size : 27,93 MB
Release : 2013-03-09
Category : Mathematics
ISBN : 3662041669
This book contains the extended abstracts presented at the 12th International Conference on Power Series and Algebraic Combinatorics (FPSAC '00) that took place at Moscow State University, June 26-30, 2000. These proceedings cover the most recent trends in algebraic and bijective combinatorics, including classical combinatorics, combinatorial computer algebra, combinatorial identities, combinatorics of classical groups, Lie algebra and quantum groups, enumeration, symmetric functions, young tableaux etc...
Author : Jianxun Hu
Publisher : Springer Nature
Page : 367 pages
File Size : 26,13 MB
Release : 2020-10-24
Category : Mathematics
ISBN : 9811574510
This book gathers research papers and surveys on the latest advances in Schubert Calculus, presented at the International Festival in Schubert Calculus, held in Guangzhou, China on November 6–10, 2017. With roots in enumerative geometry and Hilbert's 15th problem, modern Schubert Calculus studies classical and quantum intersection rings on spaces with symmetries, such as flag manifolds. The presence of symmetries leads to particularly rich structures, and it connects Schubert Calculus to many branches of mathematics, including algebraic geometry, combinatorics, representation theory, and theoretical physics. For instance, the study of the quantum cohomology ring of a Grassmann manifold combines all these areas in an organic way. The book is useful for researchers and graduate students interested in Schubert Calculus, and more generally in the study of flag manifolds in relation to algebraic geometry, combinatorics, representation theory and mathematical physics.
Author : Saugata Basu
Publisher : American Mathematical Soc.
Page : 234 pages
File Size : 15,15 MB
Release : 2003
Category : Mathematics
ISBN : 0821828630
Algorithmic and quantitative aspects in real algebraic geometry are becoming increasingly important areas of research because of their roles in other areas of mathematics and computer science. The papers in this volume collectively span several different areas of current research. The articles are based on talks given at the DIMACS Workshop on ``Algorithmic and Quantitative Aspects of Real Algebraic Geometry''. Topics include deciding basic algebraic properties of real semi-algebraic sets, application of quantitative results in real algebraic geometry towards investigating the computational complexity of various problems, algorithmic and quantitative questions in real enumerative geometry, new approaches towards solving decision problems in semi-algebraic geometry, as well as computing algebraic certificates, and applications of real algebraic geometry to concrete problems arising in robotics and computer graphics. The book is intended for researchers interested in computational methods in algebra.
Author : Alexei Ashikhmin
Publisher : American Mathematical Soc.
Page : 192 pages
File Size : 18,42 MB
Release : 2005
Category : Computers
ISBN : 0821836269
In these papers associated with the workshop of December 2003, contributors describe their work in fountain codes for lossless data compression, an application of coding theory to universal lossless source coding performance bounds, expander graphs and codes, multilevel expander codes, low parity check lattices, sparse factor graph representations of Reed-Solomon and related codes. Interpolation multiplicity assignment algorithms for algebraic soft- decision decoding of Reed-Solomon codes, the capacity of two- dimensional weight-constrained memories, networks of two-way channels, and a new approach to the design of digital communication systems. Annotation :2005 Book News, Inc., Portland, OR (booknews.com).
Author : Sandeep Nautam Bhatt
Publisher : American Mathematical Soc.
Page : 184 pages
File Size : 46,80 MB
Release : 1997-01-01
Category : Computers
ISBN : 9780821870754
This volume is the result of the Third DIMACS Implementation Challenge that was conducted as part of the 1993-94 Special year on Parallel Algorithms. The Implementation Challenge was formulated in order to provide a forum for a concerted effort to study effective algorithms for combinatorial problems and to investigate opportunities for massive speed-ups on parallel computers. The challenge invluded two problem areas for research study: tree searching, algorithms, used in game search and combinatorial optimization, for example, and algorithms for sparse graphs. Participants at sites in the US and Europe undertook projects from November 1993 through October 1994. The workshop was held at DIMACS in November 1994. Participants were encouraged to share test results, to rework their implementations considering feedback at the workshop, and to submit a final report for the proceedings. Nine papers were selected for this volume.
Author : Martin Farach-Colton
Publisher : American Mathematical Soc.
Page : 308 pages
File Size : 39,92 MB
Release : 1999
Category : Mathematics
ISBN : 9780821808269
This volume features highlights from the DIMACS Special Year on "Mathematical Support for Molecular Biology". Top researchers presented both new research results and comprehensive overviews on the use of mathematics (especially discrete mathematics) and theoretical computer science in molecular biology. The book provides a unique "snapshot" of this growing area of study. It will be of interest to both experts and novices seeking information on the state of the research.
Author : Jaroslav Nešetřil
Publisher : American Mathematical Soc.
Page : 218 pages
File Size : 41,45 MB
Release : 2004
Category : Mathematics
ISBN : 0821835513
Based on a March 2001 workshop, this collection explores connections between random graphs and percolation, between slow mixing and phase transition, and between graph morphisms and hard-constraint models. Topics of the 14 papers include efficient local search near phase transitions in combinatorial optimization, graph homomorphisms and long range action, recent results on parameterized H-colorings, the satisfiability of random k-Horn formulae, a discrete non-Pfaffian approach to the Ising problem, and chromatic numbers of products of tournaments. No indexes are provided. Annotation : 2004 Book News, Inc., Portland, OR (booknews.com).
Author : Larry Finkelstein, William M. Kantor
Publisher : American Mathematical Soc.
Page : 404 pages
File Size : 27,13 MB
Release :
Category : Algebra
ISBN : 9780821885772
The workshop "Groups and Computations" took place at the Center for Discrete Mathematics and Theoretical Computer Science (DIMACS) at Rutgers University in June 1995. This and an earlier workshop held in October 1991 was aimed at merging theory and practice within the broad area of computation with groups. The primary goal of the previous workshop was to foster a dialogue between researchers studying the computational complexity of group algorithms and those engaged in the development of practical software. It was expected that this would lead to a deeper understanding of the mathematical issues underlying group computation and that this understanding would lead, in turn, to faster algorithms. Comments and subsequent work indicated that this goal had been achieved beyond expectations. The second workshop was designed to reinforce the progress in these directions. The scientific program consisted of invited lectures and research announcements, as well as informal discussions and software demonstrations. The eight extended talks discussed randomization, permutation groups, matrix groups, software systems, fast Fourier transforms and their applications to signal processing and data analysis, computations with finitely presented groups, and implementation and complexity questions. As in the previous workshop, speakers ranged from established researchers to graduate students.
