Results 1 to 10 of about 240,213 (310)
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 +6 more sources
Supersymmetry and Combinatorics [PDF]
Communications in Mathematical Physics, 2006 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.
Onofri, E., Veneziano, G., Wosiek, J.
core +8 more sources
Advances in Applied Mathematics, 2007 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.Comment: Adv. in Appl. Math.
Baez +12 more
core +9 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
Combinatorics of free cumulants [PDF]
Journal of Combinatorial Theory, Series A, 1999 We derive a formula for expressing free cumulants whose entries are products of random variables in terms of the lattice structure of non-crossing partitions. We show the usefulness of that result by giving direct and conceptually simple proofs for a lot
Krawczyk, Bernadette, Speicher, Roland
core +5 more sources
Combinatorics of Multicompositions [PDF]
, 2021 13 ...
Hopkins, Brian, Ouvry, Stéphane
openaire +4 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
Short proofs of some extremal results [PDF]
, 2013 We prove several results from different areas of extremal combinatorics, giving complete or partial solutions to a number of open problems. These results, coming from areas such as extremal graph theory, Ramsey theory and additive combinatorics, have ...
Beck +11 more
core +5 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