Algebraic Combinatorics Pdf

[Francisco Raya]

Algebraiccombinatorics is an area of mathematics that employs methods of abstract algebra, notably group theory and representation theory, in various combinatorial contexts and, conversely, applies combinatorial techniques to problems in algebra.

The term "algebraic combinatorics" was introduced in the late 1970s.[1] Through the early or mid-1990s, typical combinatorial objects of interest in algebraic combinatorics either admitted a lot of symmetries (association schemes, strongly regular graphs, posets with a group action) or possessed a rich algebraic structure, frequently of representation theoretic origin (symmetric functions, Young tableaux). This period is reflected in the area 05E, Algebraic combinatorics, of the AMS Mathematics Subject Classification, introduced in 1991.

Algebraic combinatorics has come to be seen more expansively as an area of mathematics where the interaction of combinatorial and algebraic methods is particularly strong and significant. Thus the combinatorial topics may be enumerative in nature or involve matroids, polytopes, partially ordered sets, or finite geometries. On the algebraic side, besides group theory and representation theory, lattice theory and commutative algebra are commonly used.

The ring of symmetric functions is a specific limit of the rings of symmetric polynomials in n indeterminates, as n goes to infinity. This ring serves as universal structure in which relations between symmetric polynomials can be expressed in a way independent of the number n of indeterminates (but its elements are neither polynomials nor functions). Among other things, this ring plays an important role in the representation theory of the symmetric groups.

An association scheme is a collection of binary relations satisfying certain compatibility conditions. Association schemes provide a unified approach to many topics, for example combinatorial designs and coding theory.[2][3] In algebra, association schemes generalize groups, and the theory of association schemes generalizes the character theory of linear representations of groups.[4][5][6]

Some authors exclude graphs which satisfy the definition trivially, namely those graphs which are the disjoint union of one or more equal-sized complete graphs,[7][8] and their complements, the Turn graphs.

A Young tableau (pl.: tableaux) is a combinatorial object useful in representation theory and Schubert calculus. It provides a convenient way to describe the group representations of the symmetric and general linear groups and to study their properties. Young tableaux were introduced by Alfred Young, a mathematician at Cambridge University, in 1900. They were then applied to the study of the symmetric group by Georg Frobenius in 1903. Their theory was further developed by many mathematicians, including Percy MacMahon, W. V. D. Hodge, G. de B. Robinson, Gian-Carlo Rota, Alain Lascoux, Marcel-Paul Schtzenberger and Richard P. Stanley.

A matroid is a structure that captures and generalizes the notion of linear independence in vector spaces. There are many equivalent ways to define a matroid, the most significant being in terms of independent sets, bases, circuits, closed sets or flats, closure operators, and rank functions.

Matroid theory borrows extensively from the terminology of linear algebra and graph theory, largely because it is the abstraction of various notions of central importance in these fields. Matroids have found applications in geometry, topology, combinatorial optimization, network theory and coding theory.[9][10]

A finite geometry is any geometric system that has only a finite number of points.The familiar Euclidean geometry is not finite, because a Euclidean line contains infinitely many points. A geometry based on the graphics displayed on a computer screen, where the pixels are considered to be the points, would be a finite geometry. While there are many systems that could be called finite geometries, attention is mostly paid to the finite projective and affine spaces because of their regularity and simplicity. Other significant types of finite geometry are finite Mbius or inversive planes and Laguerre planes, which are examples of a general type called Benz planes, and their higher-dimensional analogs such as higher finite inversive geometries.

Finite geometries may be constructed via linear algebra, starting from vector spaces over a finite field; the affine and projective planes so constructed are called Galois geometries. Finite geometries can also be defined purely axiomatically. Most common finite geometries are Galois geometries, since any finite projective space of dimension three or greater is isomorphic to a projective space over a finite field (that is, the projectivization of a vector space over a finite field). However, dimension two has affine and projective planes that are not isomorphic to Galois geometries, namely the non-Desarguesian planes. Similar results hold for other kinds of finite geometries.

Algebraic combinatorics is a large branch of mathematics that combines tools and techniques from both algebra and combinatorics to study discrete structures and their properties. It has strong ties to many areas including representation theory, computing, knot theory, mathematical physics, symmetric functions, and invariant theory. The goals of the MRC-Algebraic Combinatorics program are: to advance the frontiers of cutting-edge algebraic combinatorics, including through explicit computations and experimentation, and to strengthen the research networks of those working in algebraic combinatorics.

The MRC-Algebraic Combinatorics will bring together postdocs and sufficiently advanced graduate student researchers to work in small groups. Applicants who identify as members of underrepresented groups and gender minorities are particularly encouraged to apply.

Applicants should have a background in algebra and/or combinatorics. Successful applicants will be provided resources to prepare before the MRC. At the workshop, participants will attend introductory lectures and will be assigned to a group based on their research interests. The groups will receive hands-on guidance and will work on open problems in algebraic combinatorics and closely related areas, including representation theory, special functions, and enumerative combinatorics. Note that several of the proposed projects will extensively involve experimentation and computation, which will increase the likelihood that concrete progress is made over the course of the initial workshop and provide useful training in computational mathematics. Although not required to apply, we encourage those with programming experience to identify this in their application statement.

AMS, American Mathematical Society, the tri-colored AMS logo, and Advancing research, Creating connections, are trademarks and services marks of the American Mathematical Society and registered in the U.S. Patent and Trademark Office.

2) I want to know how much of EC 1,2 does a regular algebraic combinatorics researcher know? Do I try to solve the vast breadth of problems (at least the ones with difficulty level less equal 3- let's say) in those two books? How about attempting at reading and solving Bourbaki's Lie Groups and Lie Algebras chapters 4-6? This seems like the most read book of Bourbaki, and a treasure trove of Coxeter Group-Root System material. How do I go about studying Macdonald's Symmetric Functions and Hall Polynomials? I mention these books because they appear to be listed as a reference in many of the papers I see. But these are enormous, and reading and solving problems from cover to cover is probably impractical (Is it?).

3) Can someone point out if there is a list of topics-books/notes/videos (similar to -level-combinatorics-texts-easier-than-stanleys-enumerative-combinator but with topics such as matroid theory, Coxeter groups, crystal bases included)?

When you are mature and confident enough, you start working on a problem. The problem will guide you to tools, ideas and concepts that you don't yet know. If they are from a chapter of EC that you have not studied, you read it and go through some exercises which seem relevant. If they are from a different area altogether (say, from commutative algebra), you read up on that. Then go back to the problem and hope your newly acquired tools will prove helpful.

It can happen that once you learn the true nature of the new tools you realize that they are inapplicable or too weak/general to be used for your purposes. You are then back to square one, enriched with some new knowledge which you might find useful later in your work. But it doesn't mean you have to study the whole area before starting to work on a problem.

I would suggest that much of what I said in my answer to another MO question applies here, in spades. To a first approximation, the canon is the empty set. Start with a problem, and learn what you need as you go along.

Scope: Algebraic Combinatorics is dedicated to publishing high-quality papers in which algebra and combinatorics interact in interesting ways. There are no limitations on the kind of algebra or combinatorics: the algebra involved could be commutative algebra, group theory, representation theory, algebraic geometry, linear algebra, Galois theory, associative or Lie algebras, among other possibilities. The combinatorics could be enumerative, coding theory, root systems, design theory, graph theory, incidence geometry or other topics. The key requirement is not a particular subject matter, but rather the active interplay between combinatorics and algebra.

This special issue of the Journal of Algebraic Combinatorics is dedicated to Professor Vyjayanthi Chari in recognition of her research contributions as well as her extensive service to the mathematical community. Professor Chari's work has had a tremendous influence on the research in representation theory and related fields. The special issue is intended to be a collection of papers reflecting the intersections of the mathematics of Professor Chari and the areas of interest of the Journal of Algebraic Combinatorics. We are soliciting submissions reporting on current research in the appropriate areas. Authors who are interested to submit a survey article are kindly asked to contact the guest editors in advance. Articles on areas in which progress has been reported at the Conference "Algebraic and Combinatorial Methods in Representation Theory, held during 13-24 November 2023 at ICTS, Bengaluru, India" are most appropriate. All papers will be strictly refereed according to the standards of the Journal of Algebraic Combinatorics.

3a8082e126