We are working to restore the Unionpedia app on the Google Play Store
OutgoingIncoming
🌟We've simplified our design for better navigation!
Instagram Facebook X LinkedIn
Your own Unionpedia with your logo and domain, from 9.99 USD/month
Create my Unionpedia

Algebraic combinatorics

Index 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. [1]

Table of Contents

  1. 81 relations: Abstract algebra, Affine space, Alain Lascoux, Alfred Young (mathematician), Algebraic Combinatorics (journal), Algebraic graph theory, American Mathematical Society, Association scheme, Banff International Research Station, Benz plane, Binary relation, Cambridge University Press, Cameron–Fon-Der-Flaass IBIS theorem, Character theory, Coding theory, Combinatorial commutative algebra, Combinatorial design, Combinatorial optimization, Combinatorics, Commutative algebra, Complement graph, Enumerative combinatorics, Euclidean geometry, Ferdinand Georg Frobenius, Finite field, Finite geometry, Finite set, Galois geometry, General linear group, Geometry, Gian-Carlo Rota, Gilbert de Beauregard Robinson, Graduate Texts in Mathematics, Graph theory, Group (mathematics), Group action, Group representation, Group theory, Integer, Internet Archive, Inversive geometry, Isomorphism, Journal of Algebraic Combinatorics, Laguerre plane, Lattice (order), Linear algebra, Linear independence, Marcel-Paul Schützenberger, Mathematician, Mathematics, ... Expand index (31 more) »

Abstract algebra

In mathematics, more specifically algebra, abstract algebra or modern algebra is the study of algebraic structures, which are sets with specific operations acting on their elements.

See Algebraic combinatorics and Abstract algebra

Affine space

In mathematics, an affine space is a geometric structure that generalizes some of the properties of Euclidean spaces in such a way that these are independent of the concepts of distance and measure of angles, keeping only the properties related to parallelism and ratio of lengths for parallel line segments.

See Algebraic combinatorics and Affine space

Alain Lascoux

Alain Lascoux (17 October 1944 – 20 October 2013) was a French mathematician at Université de Paris VII, University of Marne la Vallée and Nankai University.

See Algebraic combinatorics and Alain Lascoux

Alfred Young (mathematician)

Alfred Young, FRS (16 April 1873 – 15 December 1940) was a British mathematician.

See Algebraic combinatorics and Alfred Young (mathematician)

Algebraic Combinatorics (journal)

Algebraic Combinatorics is a peer-reviewed diamond open access mathematical journal specializing in the field of algebraic combinatorics.

See Algebraic combinatorics and Algebraic Combinatorics (journal)

Algebraic graph theory

Algebraic graph theory is a branch of mathematics in which algebraic methods are applied to problems about graphs.

See Algebraic combinatorics and Algebraic graph theory

American Mathematical Society

The American Mathematical Society (AMS) is an association of professional mathematicians dedicated to the interests of mathematical research and scholarship, and serves the national and international community through its publications, meetings, advocacy and other programs.

See Algebraic combinatorics and American Mathematical Society

Association scheme

The theory of association schemes arose in statistics, in the theory of experimental design for the analysis of variance.

See Algebraic combinatorics and Association scheme

Banff International Research Station

The Banff International Research Station (BIRS) for Mathematical Innovation and Discovery was established in 2003.

See Algebraic combinatorics and Banff International Research Station

Benz plane

In mathematics, a Benz plane is a type of 2-dimensional geometrical structure, named after the German mathematician Walter Benz.

See Algebraic combinatorics and Benz plane

Binary relation

In mathematics, a binary relation associates elements of one set, called the domain, with elements of another set, called the codomain.

See Algebraic combinatorics and Binary relation

Cambridge University Press

Cambridge University Press is the university press of the University of Cambridge.

See Algebraic combinatorics and Cambridge University Press

Cameron–Fon-Der-Flaass IBIS theorem

In mathematics, Cameron–Fon-Der-Flaass IBIS theorem arises in the dynamical algebraic combinatorics.

See Algebraic combinatorics and Cameron–Fon-Der-Flaass IBIS theorem

Character theory

In mathematics, more specifically in group theory, the character of a group representation is a function on the group that associates to each group element the trace of the corresponding matrix.

See Algebraic combinatorics and Character theory

Coding theory

Coding theory is the study of the properties of codes and their respective fitness for specific applications.

See Algebraic combinatorics and Coding theory

Combinatorial commutative algebra

Combinatorial commutative algebra is a relatively new, rapidly developing mathematical discipline.

See Algebraic combinatorics and Combinatorial commutative algebra

Combinatorial design

Combinatorial design theory is the part of combinatorial mathematics that deals with the existence, construction and properties of systems of finite sets whose arrangements satisfy generalized concepts of balance and/or symmetry.

See Algebraic combinatorics and Combinatorial design

Combinatorial optimization

Combinatorial optimization is a subfield of mathematical optimization that consists of finding an optimal object from a finite set of objects, where the set of feasible solutions is discrete or can be reduced to a discrete set.

See Algebraic combinatorics and Combinatorial optimization

Combinatorics

Combinatorics is an area of mathematics primarily concerned with the counting, selecting and arranging of objects, both as a means and as an end in itself.

See Algebraic combinatorics and Combinatorics

Commutative algebra

Commutative algebra, first known as ideal theory, is the branch of algebra that studies commutative rings, their ideals, and modules over such rings.

See Algebraic combinatorics and Commutative algebra

Complement graph

In the mathematical field of graph theory, the complement or inverse of a graph is a graph on the same vertices such that two distinct vertices of are adjacent if and only if they are not adjacent in.

See Algebraic combinatorics and Complement graph

Enumerative combinatorics

Enumerative combinatorics is an area of combinatorics that deals with the number of ways that certain patterns can be formed.

See Algebraic combinatorics and Enumerative combinatorics

Euclidean geometry

Euclidean geometry is a mathematical system attributed to ancient Greek mathematician Euclid, which he described in his textbook on geometry, Elements.

See Algebraic combinatorics and Euclidean geometry

Ferdinand Georg Frobenius

Ferdinand Georg Frobenius (26 October 1849 – 3 August 1917) was a German mathematician, best known for his contributions to the theory of elliptic functions, differential equations, number theory, and to group theory.

See Algebraic combinatorics and Ferdinand Georg Frobenius

Finite field

In mathematics, a finite field or Galois field (so-named in honor of Évariste Galois) is a field that contains a finite number of elements.

See Algebraic combinatorics and Finite field

Finite geometry

A finite geometry is any geometric system that has only a finite number of points.

See Algebraic combinatorics and Finite geometry

Finite set

In mathematics, particularly set theory, a finite set is a set that has a finite number of elements.

See Algebraic combinatorics and Finite set

Galois geometry

Galois geometry (so named after the 19th-century French mathematician Évariste Galois) is the branch of finite geometry that is concerned with algebraic and analytic geometry over a finite field (or Galois field).

See Algebraic combinatorics and Galois geometry

General linear group

In mathematics, the general linear group of degree n is the set of invertible matrices, together with the operation of ordinary matrix multiplication.

See Algebraic combinatorics and General linear group

Geometry

Geometry is a branch of mathematics concerned with properties of space such as the distance, shape, size, and relative position of figures.

See Algebraic combinatorics and Geometry

Gian-Carlo Rota

Gian-Carlo Rota (April 27, 1932 – April 18, 1999) was an Italian-American mathematician and philosopher.

See Algebraic combinatorics and Gian-Carlo Rota

Gilbert de Beauregard Robinson

Gilbert de Beauregard Robinson, MBE (3 June 1906 – 8 April 1992) was a Canadian mathematician most famous for his work on combinatorics and representation theory of the symmetric groups, including the Robinson-Schensted algorithm.

See Algebraic combinatorics and Gilbert de Beauregard Robinson

Graduate Texts in Mathematics

Graduate Texts in Mathematics (GTM) is a series of graduate-level textbooks in mathematics published by Springer-Verlag.

See Algebraic combinatorics and Graduate Texts in Mathematics

Graph theory

In mathematics, graph theory is the study of graphs, which are mathematical structures used to model pairwise relations between objects.

See Algebraic combinatorics and Graph theory

Group (mathematics)

In mathematics, a group is a set with an operation that associates an element of the set to every pair of elements of the set (as does every binary operation) and satisfies the following constraints: the operation is associative, it has an identity element, and every element of the set has an inverse element.

See Algebraic combinatorics and Group (mathematics)

Group action

In mathematics, many sets of transformations form a group under function composition; for example, the rotations around a point in the plane.

See Algebraic combinatorics and Group action

Group representation

In the mathematical field of representation theory, group representations describe abstract groups in terms of bijective linear transformations of a vector space to itself (i.e. vector space automorphisms); in particular, they can be used to represent group elements as invertible matrices so that the group operation can be represented by matrix multiplication.

See Algebraic combinatorics and Group representation

Group theory

In abstract algebra, group theory studies the algebraic structures known as groups.

See Algebraic combinatorics and Group theory

Integer

An integer is the number zero (0), a positive natural number (1, 2, 3,...), or the negation of a positive natural number (−1, −2, −3,...). The negations or additive inverses of the positive natural numbers are referred to as negative integers.

See Algebraic combinatorics and Integer

Internet Archive

The Internet Archive is an American nonprofit digital library founded in 1996 by Brewster Kahle.

See Algebraic combinatorics and Internet Archive

Inversive geometry

In geometry, inversive geometry is the study of inversion, a transformation of the Euclidean plane that maps circles or lines to other circles or lines and that preserves the angles between crossing curves.

See Algebraic combinatorics and Inversive geometry

Isomorphism

In mathematics, an isomorphism is a structure-preserving mapping between two structures of the same type that can be reversed by an inverse mapping.

See Algebraic combinatorics and Isomorphism

Journal of Algebraic Combinatorics

Journal of Algebraic Combinatorics is a peer-reviewed scientific journal covering algebraic combinatorics.

See Algebraic combinatorics and Journal of Algebraic Combinatorics

Laguerre plane

In mathematics, a Laguerre plane is one of the three types of Benz plane, which are the Möbius plane, Laguerre plane and Minkowski plane.

See Algebraic combinatorics and Laguerre plane

Lattice (order)

A lattice is an abstract structure studied in the mathematical subdisciplines of order theory and abstract algebra.

See Algebraic combinatorics and Lattice (order)

Linear algebra

Linear algebra is the branch of mathematics concerning linear equations such as: linear maps such as: and their representations in vector spaces and through matrices.

See Algebraic combinatorics and Linear algebra

Linear independence

In the theory of vector spaces, a set of vectors is said to be if there exists no nontrivial linear combination of the vectors that equals the zero vector.

See Algebraic combinatorics and Linear independence

Marcel-Paul Schützenberger

Marcel-Paul "Marco" Schützenberger (24 October 1920 – 29 July 1996) was a French mathematician and Doctor of Medicine.

See Algebraic combinatorics and Marcel-Paul Schützenberger

Mathematician

A mathematician is someone who uses an extensive knowledge of mathematics in their work, typically to solve mathematical problems.

See Algebraic combinatorics and Mathematician

Mathematics

Mathematics is a field of study that discovers and organizes abstract objects, methods, theories and theorems that are developed and proved for the needs of empirical sciences and mathematics itself.

See Algebraic combinatorics and Mathematics

Mathematics Subject Classification

The Mathematics Subject Classification (MSC) is an alphanumerical classification scheme that has collaboratively been produced by staff of, and based on the coverage of, the two major mathematical reviewing databases, Mathematical Reviews and Zentralblatt MATH.

See Algebraic combinatorics and Mathematics Subject Classification

Matroid

In combinatorics, a branch of mathematics, a matroid is a structure that abstracts and generalizes the notion of linear independence in vector spaces.

See Algebraic combinatorics and Matroid

Möbius plane

In mathematics, the classical Möbius plane (named after August Ferdinand Möbius) is the Euclidean plane supplemented by a single point at infinity.

See Algebraic combinatorics and Möbius plane

Neighbourhood (graph theory)

In graph theory, an adjacent vertex of a vertex in a graph is a vertex that is connected to by an edge.

See Algebraic combinatorics and Neighbourhood (graph theory)

Network theory

In mathematics, computer science and network science, network theory is a part of graph theory.

See Algebraic combinatorics and Network theory

Non-Desarguesian plane

In mathematics, a non-Desarguesian plane is a projective plane that does not satisfy Desargues' theorem (named after Girard Desargues), or in other words a plane that is not a Desarguesian plane.

See Algebraic combinatorics and Non-Desarguesian plane

Partially ordered set

In mathematics, especially order theory, a partial order on a set is an arrangement such that, for certain pairs of elements, one precedes the other.

See Algebraic combinatorics and Partially ordered set

Percy Alexander MacMahon

Percy Alexander MacMahon (26 September 1854 – 25 December 1929) was an English mathematician, especially noted in connection with the partitions of numbers and enumerative combinatorics.

See Algebraic combinatorics and Percy Alexander MacMahon

Pixel

In digital imaging, a pixel (abbreviated px), pel, or picture element is the smallest addressable element in a raster image, or the smallest addressable element in a dot matrix display device.

See Algebraic combinatorics and Pixel

Point (geometry)

In geometry, a point is an abstract idealization of an exact position, without size, in physical space, or its generalization to other kinds of mathematical spaces.

See Algebraic combinatorics and Point (geometry)

Polyhedral combinatorics

Polyhedral combinatorics is a branch of mathematics, within combinatorics and discrete geometry, that studies the problems of counting and describing the faces of convex polyhedra and higher-dimensional convex polytopes.

See Algebraic combinatorics and Polyhedral combinatorics

Polytope

In elementary geometry, a polytope is a geometric object with flat sides (faces).

See Algebraic combinatorics and Polytope

Projective plane

In mathematics, a projective plane is a geometric structure that extends the concept of a plane.

See Algebraic combinatorics and Projective plane

Projective space

In mathematics, the concept of a projective space originated from the visual effect of perspective, where parallel lines seem to meet at infinity.

See Algebraic combinatorics and Projective space

Regular graph

In graph theory, a regular graph is a graph where each vertex has the same number of neighbors; i.e. every vertex has the same degree or valency.

See Algebraic combinatorics and Regular graph

Representation theory

Representation theory is a branch of mathematics that studies abstract algebraic structures by representing their elements as linear transformations of vector spaces, and studies modules over these abstract algebraic structures.

See Algebraic combinatorics and Representation theory

Representation theory of the symmetric group

In mathematics, the representation theory of the symmetric group is a particular case of the representation theory of finite groups, for which a concrete and detailed theory can be obtained.

See Algebraic combinatorics and Representation theory of the symmetric group

Richard P. Stanley

Richard Peter Stanley (born June 23, 1944) is an Emeritus Professor of Mathematics at the Massachusetts Institute of Technology, and an Arts and Sciences Distinguished Scholar at the University of Miami.

See Algebraic combinatorics and Richard P. Stanley

Ring of symmetric functions

In algebra and in particular in algebraic combinatorics, the ring of symmetric functions is a specific limit of the rings of symmetric polynomials in n indeterminates, as n goes to infinity.

See Algebraic combinatorics and Ring of symmetric functions

Schubert calculus

In mathematics, Schubert calculus is a branch of algebraic geometry introduced in the nineteenth century by Hermann Schubert in order to solve various counting problems of projective geometry and, as such, is viewed as part of enumerative geometry.

See Algebraic combinatorics and Schubert calculus

Strongly regular graph

In graph theory, a strongly regular graph (SRG) is a regular graph with vertices and degree such that for some given integers \lambda, \mu \ge 0.

See Algebraic combinatorics and Strongly regular graph

Symmetric function

In mathematics, a function of n variables is symmetric if its value is the same no matter the order of its arguments.

See Algebraic combinatorics and Symmetric function

Symmetric group

In abstract algebra, the symmetric group defined over any set is the group whose elements are all the bijections from the set to itself, and whose group operation is the composition of functions.

See Algebraic combinatorics and Symmetric group

Symmetric polynomial

In mathematics, a symmetric polynomial is a polynomial in variables, such that if any of the variables are interchanged, one obtains the same polynomial.

See Algebraic combinatorics and Symmetric polynomial

Symmetry in mathematics

Symmetry occurs not only in geometry, but also in other branches of mathematics.

See Algebraic combinatorics and Symmetry in mathematics

The Princeton Companion to Mathematics

The Princeton Companion to Mathematics is a book providing an extensive overview of mathematics that was published in 2008 by Princeton University Press.

See Algebraic combinatorics and The Princeton Companion to Mathematics

Topology

Topology (from the Greek words, and) is the branch of mathematics concerned with the properties of a geometric object that are preserved under continuous deformations, such as stretching, twisting, crumpling, and bending; that is, without closing holes, opening holes, tearing, gluing, or passing through itself.

See Algebraic combinatorics and Topology

University of Cambridge

The University of Cambridge is a public collegiate research university in Cambridge, England.

See Algebraic combinatorics and University of Cambridge

Vector space

In mathematics and physics, a vector space (also called a linear space) is a set whose elements, often called ''vectors'', can be added together and multiplied ("scaled") by numbers called ''scalars''.

See Algebraic combinatorics and Vector space

W. V. D. Hodge

Sir William Vallance Douglas Hodge (17 June 1903 – 7 July 1975) was a British mathematician, specifically a geometer.

See Algebraic combinatorics and W. V. D. Hodge

Young tableau

In mathematics, a Young tableau (plural: tableaux) is a combinatorial object useful in representation theory and Schubert calculus.

See Algebraic combinatorics and Young tableau

References

[1] https://en.wikipedia.org/wiki/Algebraic_combinatorics

, Mathematics Subject Classification, Matroid, Möbius plane, Neighbourhood (graph theory), Network theory, Non-Desarguesian plane, Partially ordered set, Percy Alexander MacMahon, Pixel, Point (geometry), Polyhedral combinatorics, Polytope, Projective plane, Projective space, Regular graph, Representation theory, Representation theory of the symmetric group, Richard P. Stanley, Ring of symmetric functions, Schubert calculus, Strongly regular graph, Symmetric function, Symmetric group, Symmetric polynomial, Symmetry in mathematics, The Princeton Companion to Mathematics, Topology, University of Cambridge, Vector space, W. V. D. Hodge, Young tableau.