Algebraic enumeration

Algebraic enumeration

Algebraic enumeration is a subfield of enumeration that deals with counting algebraic objects. Algebraic properties and symmetries of the objects being counted can be taken advantage of to simplify the counting process.


Wikimedia Foundation. 2010.

Игры ⚽ Нужно сделать НИР?

Look at other dictionaries:

  • 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. It is one of the… …   Wikipedia

  • Discriminant of an algebraic number field — A fundamental domain of the ring of integers of the field K obtained from Q by adjoining a root of x3 − x2 − 2x + 1. This fundamental domain sits inside K ⊗QR. The discriminant of K is 49 = 72.… …   Wikipedia

  • List of mathematics articles (A) — NOTOC A A Beautiful Mind A Beautiful Mind (book) A Beautiful Mind (film) A Brief History of Time (film) A Course of Pure Mathematics A curious identity involving binomial coefficients A derivation of the discrete Fourier transform A equivalence A …   Wikipedia

  • List of combinatorics topics — This is a list of combinatorics topics.A few decades ago it might have been said that combinatorics is little more than a way to classify poorly understood problems, and some standard remedies. Great progress has been made since 1960.This page is …   Wikipedia

  • Multiset — This article is about the mathematical concept. For the computer science data structure, see Set (computer science)#Multiset. In mathematics, the notion of multiset (or bag) is a generalization of the notion of set in which members are allowed to …   Wikipedia

  • Word problem for groups — In mathematics, especially in the area of abstract algebra known as combinatorial group theory, the word problem for a recursively presented group G is the algorithmic problem of deciding whether two words represent the same element. Although it… …   Wikipedia

  • combinatorics — /keuhm buy neuh tawr iks, tor , kom beuh /, n. (used with singular v.) See combinatorial analysis. * * * Branch of mathematics concerned with the selection, arrangement, and combination of objects chosen from a finite set. The number of possible… …   Universalium

  • Enumerated type — In computer programming, an enumerated type is a data type (usually user defined) consisting of a set of named constants called enumerators . The act of creating an enumerated type defines an enumeration. When an identifier such as a variable is… …   Wikipedia

  • Combinatorics — is a branch of mathematics concerning the study of finite or countable discrete structures. Aspects of combinatorics include counting the structures of a given kind and size (enumerative combinatorics), deciding when certain criteria can be met,… …   Wikipedia

  • Problem of Apollonius — In Euclidean plane geometry, Apollonius problem is to construct circles that are tangent to three given circles in a plane (Figure 1); two circles are tangent if they touch at a single point. Apollonius of Perga (ca. 262 BC ndash; ca. 190 BC)… …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”