Results 11 to 20 of about 143,013 (228)
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 +6 more sources
Combinatorics and connectionism
Discrete Mathematics, 1994 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Norman Biggs
openalex +4 more sources
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
openalex +3 more sources
Combinatorics of Multicompositions [PDF]
, 2021 13 ...
Hopkins, Brian, Ouvry, Stéphane
openaire +3 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. Results: We analyze the sparsification of a particular decomposition rule, $ ^*$, that splits an interval for RNA secondary and ...
Huang, Fenix Wenda, reidys, Christian
openaire +7 more sources
Topics in Cognitive Science, EarlyView., 2023 Abstract Over the past several decades, research in the cognitive sciences has foregrounded the importance of active bodies and their continuous dependence on the changing environment, strengthening the relevance of dynamical models. These models have been steadily developed within the ecological psychology approach to cognition, which arguably ...
Joanna Rączaszek‐Leonardi
wiley +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.
Hector Blandin, Rafael Diaz
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 +2 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 +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 ...
openaire +4 more sources