Results 1 to 10 of about 169,932 (295)
Transactions of the American Mathematical Society, 2004 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 ...
Vassiliki Farmaki, S. Negrepontis
openalex +6 more sources
Advanced Materials, 2020 Artificial scent screening systems (known as electronic noses, E‐noses) have been researched extensively. A portable, automatic, and accurate, real‐time E‐nose requires both robust cross‐reactive sensing and fingerprint pattern recognition.
Ting Wang, Jianwu Wang, Ming Wang
exaly +2 more sources
Combinatorics and topology of Kawai-Lewellen-Tye relations [PDF]
Journal of High Energy Physics, 2017 A bstractWe revisit the relations between open and closed string scattering amplitudes discovered by Kawai, Lewellen, and Tye (KLT). We show that they emerge from the un-derlying algebro-topological identities known as the twisted period relations.
Sebastian Mizera
exaly +2 more sources
Bicycle or Unicycle?, 1981 We compare two generalisations of the notion of hook lengths for partitions. We apply this in the context of the modular representation theory of Arike–Koike algebras. We show that the Schur element of a simple module is divisible by the Schur element of
Peter Keevash +2 more
openaire +2 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
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
Graph Theory and Additive Combinatorics
, 2023 Using the dichotomy of structure and pseudorandomness as a central theme, this accessible text provides a modern introduction to extremal graph theory and additive combinatorics.
Yufei Zhao
semanticscholar +1 more source