Results 1 to 10 of about 144,238 (180)
Integrable Combinatorics [PDF]
Proceedings of the International Congress of Mathematicians (ICM 2018), 2012 We review various combinatorial problems with underlying classical or quantum integrable structures. (Plenary talk given at the International Congress of Mathematical Physics, Aalborg, Denmark, August 10, 2012.)Comment: 21 pages, 16 figures, proceedings ...
Di Francesco, Philippe
core +4 more sources
The combinatorics of splittability
Annals of Pure and Applied Logic, 2004 Marion Scheepers, in his studies of the combinatorics of open covers, introduced the property Split(U,V) asserting that a cover of type U can be split into two covers of type V. In the first part of this paper we give an almost complete classification of
Bartoszyński +13 more
core +5 more sources
On the combinatorics of sparsification [PDF]
Algorithms for Molecular Biology, 2012 Background: We study the sparsification of dynamic programming folding algorithms of RNA structures. Sparsification applies to the mfe-folding of RNA structures and can lead to a significant reduction of time complexity.
Christian M Reidys +2 more
core +12 more sources
Integrability and Combinatorics
We 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.
Paul Zinn-Justin
exaly +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
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
The Real-rootedness of Eulerian Polynomials via the Hermite–Biehler Theorem [PDF]
Discrete Mathematics & Theoretical Computer Science, 2015 Based on the Hermite–Biehler theorem, we simultaneously prove the real-rootedness of Eulerian polynomials of type $D$ and the real-rootedness of affine Eulerian polynomials of type $B$, which were first obtained by Savage and Visontai by using the ...
Arthur L.B. Yang, Philip B. Zhang
doaj +1 more source
More on the Rainbow Disconnection in Graphs
Discussiones Mathematicae Graph Theory, 2022 Let G be a nontrivial edge-colored connected graph. An edge-cut R of G is called a rainbow-cut if no two of its edges are colored the same. An edge-colored graph G is rainbow disconnected if for every two vertices u and v of G, there exists a u-v-rainbow-
Bai Xuqing +3 more
doaj +1 more source
Oriented diameter and rainbow connection number of a graph [PDF]
Discrete Mathematics & Theoretical Computer Science, 2014 Graph ...
Xiaolong Huang +3 more
doaj +1 more source