Results 11 to 20 of about 240,213 (310)
Complexity problems in enumerative combinatorics [PDF]
arXiv, 2018 We give a broad survey of recent results in Enumerative Combinatorics and their complexity aspects.
I. Pak
arxiv +3 more sources
On the Combinatorics of Cumulants
Journal of Combinatorial Theory, Series A, 2000 AbstractWe study cumulants by Umbral Calculus. Various formulae expressing cumulants by umbral functions are established. Links to invariant theory, symmetric functions, and binomial sequences are made.
ShenJianhong, RotaGian-Carlo
openaire +3 more sources
Combinatorics of Positroids [PDF]
Discrete Mathematics & Theoretical Computer Science, 2009 Recently Postnikov gave a combinatorial description of the cells in a totally-nonnegative Grassmannian. These cells correspond to a special class of matroids called positroids. There are many interesting combinatorial objects associated to a positroid. We introduce some recent results, including the generalization and proof of the purity conjecture by ...
Suho Oh
openaire +4 more sources
Combinatorics and connectionism
Discrete Mathematics, 1994 AbstractIn recent years there has been a great deal of interest in ‘connectionism’. This name covers a variety of activities, some of them wholly non-mathematical, concerned with processes which resemble the cognitive functions of the human brain. In this paper I shall use standard graph-theoretic terminology to describe some mathematical aspects of ...
Norman Biggs
openaire +3 more sources
European Journal of Combinatorics, 2000 Note: PRO 2000.01, Academic Press, Special Issue Reference ROSO-ARTICLE-2000-002 Record created on 2006-02-13, modified on 2016-08 ...
Fukuda, K., Ziegler, G.
openaire +3 more sources
Integrability and Combinatorics [PDF]
arXivWe discuss the use of methods coming from integrable systems to study problems of enumerative and algebraic combinatorics, and develop two examples: the enumeration of Alternating Sign Matrices and related combinatorial objects, and the theory of symmetric polynomials.
openaire +3 more sources
On BMRN*-colouring of planar digraphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2021 In a recent work, Bensmail, Blanc, Cohen, Havet and Rocha, motivated by applications for TDMA scheduling problems, have introduced the notion of BMRN*-colouring of digraphs, which is a type of arc-colouring with particular colouring constraints.
Julien Bensmail, Foivos Fioravantes
doaj +1 more source
Oberwolfach Reports, 2023 The Department of Mathematics at Harvey Mudd College will host its 8t annual Mathematics Conference on Saturday, October 7, 2006. Keynote speakers will discuss new developments and applications of enumerative combinatorics. Faculty, postdoctoral fellows
Mireille Bousquet-Mélou +3 more
semanticscholar +1 more source
The generalized 3-connectivity of Cartesian product graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2012 Graph ...
Hengzhe Li, Xueliang Li, Yuefang Sun
doaj +1 more source
Enumeration of bilaterally symmetric 3-noncrossing partitions [PDF]
Discrete Mathematics & Theoretical Computer Science, 2008 Schützenberger's theorem for the ordinary RSK correspondence naturally extends to Chen et. al's correspondence for matchings and partitions. Thus the counting of bilaterally symmetric $k$-noncrossing partitions naturally arises as an analogue for ...
Guoce Xin, Terence Y. J. Zhang
doaj +1 more source