Results 161 to 170 of about 11,862 (202)
Some of the next articles are maybe not open access.
What Is Enumerative Combinatorics?
1986The 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
Enumerative combinatorics on words
2015Combinatorics on words is a field which has both historical roots and a substantial growth. Its roots are to be found in the early results of Axel Thue on square free words and the development of combinatorial group theory. The present interest in the field is pushed by its links with several connexions with other topics external to pure mathematics ...
Perrin, Dominique, Restivo, Antonio
openaire +1 more source
Enumerative combinatorics and algebraic languages
2006We 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
Enumerative Combinatorics and Computer Science
1990This short paper is a summary of a survey talk given on the interplay between enumerative Combinatorics and Computer Science.
openaire +1 more source
Symmetry, Combinatorics, Artificial Intelligence, Music and Spectroscopy
Symmetry, 2021Krishnan Balasubramanian
exaly