Results 71 to 80 of about 211,771 (176)

Invariants of Combinatorial Line Arrangements and Rybnikov's Example

open access: yes, 2004
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]

open access: yesarXiv, 2004
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  

Software for enumerative and analytic combinatorics [PDF]

open access: yesarXiv, 2016
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]

open access: yesarXiv, 2019
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  

How Joe Gillis Discovered Combinatorial Special Function Theory [PDF]

open access: yesMath. Intell. 17(2), 65-66, 1994
How Enumerative Combinatorics met Special Functions, thanks to Joe ...
arxiv  

Home - About - Disclaimer - Privacy