algebraic combinatorics

From late 1970s.

algebraic combinatorics (uncountable)

1. (algebra, combinatorics) A branch of mathematics in which techniques from abstract algebra are applied to problems in combinatorics, and vice versa.
   • 1982, Trevor Evans, Finite Representations of Two-variable Identities, E. Mendelsohn, Algebraic and Geometric Combinatorics, North-Holland, page 135,

     It is part of the folklore of algebraic combinatorics that “most' two-variable groupoid identities have non-trivial models in finite fields, the groupoid operation being represented by a linear function ${\displaystyle ax+by}$.

   • 1993, I. A. Faradžev, A. A. Ivanov, M. Klin, A. J. Woldar, editors, Investigations in Algebraic Theory of Combinatorial Objects, Kluwer Academic, page vii:

     This volume arose through the initiative of Kluwer Academic Publishers in an attempt to introduce some areas of research in algebraic combinatorics which originally appeared in Russian to a wider mathematical community.

   • 2013, Richard P. Stanley, Algebraic Combinatorics, 2nd edition, Springer, page xi:

     This book is intended primarily as a one-semester undergraduate text for a course in algebraic combinatorics. […] Algebraic combinatorics is a huge subject, so some selection process was necessary to obtain the present text.