Results 21 to 30 of about 6,526 (216)
On the Combinatorics of Cumulants
Journal of Combinatorial Theory, Series A, 2000 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Gian-Carlo Rota, Jianhong Shen
openaire +1 more source
Advances in Applied Mathematics, 2008 We propose a categorical setting for the study of the combinatorics of rational numbers. We find combinatorial interpretation for the Bernoulli and Euler numbers and polynomials.
Héctor Blandín, Rafael Díaz
openaire +2 more sources
Supersymmetry and Combinatorics [PDF]
Communications in Mathematical Physics, 2007 We show how a recently proposed supersymmetric quantum mechanics model leads to non-trivial results/conjectures on the combinatorics of binary necklaces and linear-feedback shift-registers. Pauli's exclusion principle plays a crucial role: by projecting out certain states/necklaces, it allows to represent the supersymmetry algebra in the resulting ...
ONOFRI, Enrico, G. VENEZIANO, J. WOSIEK
openaire +6 more sources
On the combinatorics of plethysm
Journal of Combinatorial Theory, Series A, 1987 The preceding review of A. Kerber comprises both articles, the one reviewed there and the present one, in a joint review. The reader is therefore kindly requested to read the preceding review.
Oscar, A., Nava, Z.
openaire +2 more sources
Combinatorics of Antiprism Triangulations [PDF]
Discrete & Computational Geometry, 2022 The antiprism triangulation provides a natural way to subdivide a simplicial complex $Δ$, similar to barycentric subdivision, which appeared independently in combinatorial algebraic topology and computer science. It can be defined as the simplicial complex of chains of multi-pointed faces of $Δ$, from a combinatorial point of view, and by successively ...
Christos A. Athanasiadis +2 more
openaire +3 more sources
On the Combinatorics of Smoothing [PDF]
Journal of Mathematical Sciences, 2016 Many invariants of knots rely upon smoothing the knot at its crossings. To compute them, it is necessary to know how to count the number of connected components the knot diagram is broken into after the smoothing. In this paper, it is shown how to use a modification of a theorem of Zulli together with a modification of the spectral theory of graphs to ...
openaire +2 more sources
Transactions of the American Mathematical Society, 2006 In this paper we extend the block combinatorics partition theorems of Hindman and Milliken in the setting of the recursive system of the block Schreier families (B^xi) consisting of families defined for every countable ordinal xi. Results contain (a) a block partition Ramsey theorem for every countable ordinal xi (Hindman's theorem corresponding to xi ...
Farmaki, V., Negrepontis, S.
openaire +4 more sources
The 3-Rainbow Index of a Graph
Discussiones Mathematicae Graph Theory, 2015 Let G be a nontrivial connected graph with an edge-coloring c : E(G) → {1, 2, . . . , q}, q ∈ ℕ, where adjacent edges may be colored the same. A tree T in G is a rainbow tree if no two edges of T receive the same color.
Chen Lily +3 more
doaj +1 more source
Rainbow Connection Number of Graphs with Diameter 3
Discussiones Mathematicae Graph Theory, 2017 A path in an edge-colored graph G is rainbow if no two edges of the path are colored the same. The rainbow connection number rc(G) of G is the smallest integer k for which there exists a k-edge-coloring of G such that every pair of distinct vertices of G
Li Hengzhe, Li Xueliang, Sun Yuefang
doaj +1 more source
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. Results: We analyze the sparsification of a particular decomposition rule, $Λ^*$, that splits an interval for RNA secondary and ...
Huang, Fenix Wenda, reidys, Christian
openaire +6 more sources