20/05/14 07:39:00.45 xfdjzzyp.net
あんまり関係ないが、メモ貼る
URLﾘﾝｸ(en.wikipedia.org)
Algebraic combinatorics
(抜粋)
Algebraic combinatorics 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.
Contents
1 History
2 Scope
3 Important topics
3.1 Symmetric functions
3.2 Association schemes
3.3 Strongly regular graphs
3.4 Young tableaux
3.5 Matroids
3.6 Finite geometries
History
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.
Scope
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 and representation theory, lattice theory and commutative algebra are common.