Results 71 to 80 of about 35,860 (197)

Algebraic and Geometric Methods in Enumerative Combinatorics [PDF]

, 2015
A survey written for the upcoming "Handbook of Enumerative Combinatorics".
openaire   +2 more sources

Introduction to enumerative analytic combinatorics

Introduction to Enumerative and Analytic Combinatorics fills the gap between introductory texts in discrete mathematics and advanced graduate texts in enumerative combinatorics.
Bona, Miklos
core  

Coinductive counting : bisimulation in enumerative combinatorics [PDF]

, 2001
The recently developed coinductive calculus of streams finds here a further application in enumerative combinatorics. A general methodology is developed to solve a wide variety of basic counting problems in a uniform way: (1) the objects to be counted ...
Rutten, J.J.M.M. (Jan)
core  

The number of (0,1) - Matrices with fixed row and column sums [PDF]

, 2013
Let R and S be non-negative and non-increasing vectors of order m and n respectively. We consider the set A(R, S) of all m x n matrices with entries restricted to {0, 1}.
Pule, Solomone Tahamano
core  

Highly sorted permutations with respect to a 312-avoiding stack [PDF]

Enumerative Combinatorics and Applications, 2023
Yuji Choi, Yunseo Choi
doaj   +1 more source

Enumerative combinatorics

, 2011
"Richard Stanley's two-volume basic introduction to enumerative combinatorics has become the standard guide to the topic for students and experts alike.
Stanley, Richard P
core  

Restricted Grassmannian permutations [PDF]

Enumerative Combinatorics and Applications, 2022
Juan B. Gil, Jessica A. Tomasko
doaj   +1 more source

Enumeration of binary trees compatible with a perfect phylogeny. [PDF]

J Math Biol, 2022
Palacios JA, Bhaskar A, Disanto F, Rosenberg NA.   +3 more
europepmc   +1 more source

Spectral Decomposition of Discrepancy Kernels on the Euclidean Ball, the Special Orthogonal Group, and the Grassmannian Manifold. [PDF]

Constr Approx, 2023
Dick J, Ehler M, Gräf M, Krattenthaler C.   +3 more
europepmc   +1 more source

Cyclic Derangements [PDF]

, 2010
A classic problem in enumerative combinatorics is to count the number of derangements, that is, permutations with no fixed point. Inspired by a recent generalization to facet derangements of the hypercube by Gordon and McMahon, we generalize this problem
Sami H. Assaf, Assaf, Sami H.
core