Results 71 to 80 of about 211,771 (176)
Combinatorics of Partial Sums with Applications to Limit Theorems [PDF]
Hermann Dinges
openalex +1 more source
Invariants of Combinatorial Line Arrangements and Rybnikov's Example
Following the general strategy proposed by G.Rybnikov, we present a proof of his well-known result, that is, the existence of two arrangements of lines having the same combinatorial type, but non-isomorphic fundamental groups.
Artal, E.+3 more
core
Combinatorics and geometry of Littlewood-Richardson cones [PDF]
We present several direct bijections between different combinatorial interpretations of the Littlewood-Richardson coefficients. The bijections are defined by explicit linear maps which have other applications.
arxiv
Invariants of finite groups and their applications to combinatorics [PDF]
Richard P. Stanley
openalex +1 more source
Software for enumerative and analytic combinatorics [PDF]
We survey some general-purpose symbolic software packages that implement algorithms from enumerative and analytic combinatorics. Software for the following areas is covered: basic combinatorial objects, symbolic combinatorics, P\'olya theory, combinatorial species, and asymptotics. We describe the capabilities that the packages offer as well as some of
arxiv
A Note on the Frankl Conjecture [PDF]
The Frankl conjecture (called also union-closed sets conjecture) is one of the famous unsolved conjectures in combinatorics of finite sets. In this short note, we introduce and to some extent justify some variants of the Frankl conjecture.
arxiv
Book Review: Infinitary combinatorics and the axiom of determinateness [PDF]
John R. Steel
openalex +1 more source
T. P. McDonough and V. C. Mavron (editors), Combinatorics (London Mathematical Society Lecture Note Series No. 13, Cambridge University Press, 1974), v + 204 pp., £3·20. [PDF]
Donald Monk
openalex +1 more source
How Joe Gillis Discovered Combinatorial Special Function Theory [PDF]
How Enumerative Combinatorics met Special Functions, thanks to Joe ...
arxiv