Results 171 to 180 of about 45,358 (192)
Some of the next articles are maybe not open access.

ENUMERATIVE COMBINATORICS AND CODING THEORY

1994
The author develops a new method of investigation of combinatorial problems, introducing the value enumerator \(V_ f(T)= \sum_ p T^{f(p)}\in \mathbb{N}[T,T^{-1}]\) \((p\in \{1,-1\}^ n)\) for a certain polynomial \(f\) in \(n\) variables with non-negative integral coefficients. The coefficient of \(T^ v\) is the number of binary points \(p\) such that \(
openaire   +3 more sources

Enumerative combinatorics and algebraic languages

2006
We give a survey of recent works relating algebraic languages with the combinatorics of "planar pictures" (i.e. planar maps, animals, polyominoes, secondary structures,…). Such objects are encoded with words. Applications are in enumeration theory, in connection with statistical Physics, molecular Biology, algorithmic complexity and computer graphics ...
openaire   +1 more source

What Is Enumerative Combinatorics?

1986
The basic problem of enumerative combinatorics is that of counting the number of elements of a finite set. Usually are given an infinite class of finite sets S i where i ranges over some index set I (such as the nonnegative integers ℕ), and we wish to count the number ƒ(i) of elements of each S i “simultaneously.” Immediate philosophical difficulties ...
openaire   +1 more source

Counting: The Art of Enumerative Combinatorics

Undergraduate Texts in Mathematics, 2001
George E Martin
exaly  

Enumerative combinatorics

Choice Reviews Online, 2003
openaire   +1 more source

Inquiry-Based Enumerative Combinatorics

Undergraduate Texts in Mathematics, 2019
Kyle Petersen
exaly  

Home - About - Disclaimer - Privacy