Results 11 to 20 of about 145,190 (272)
Supersymmetry and Combinatorics [PDF]
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
Integrable Combinatorics [PDF]
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
Combinatorics and connectionism
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Norman Biggs
openalex +4 more sources
The combinatorics of splittability
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
On the Combinatorics of Cumulants
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Gian‐Carlo Rota, Jianhong Shen
openalex +3 more sources
Senior High School Students’ Higher Order Thinking Skills in Solving Combinatorics Problems
Higher Order Thinking Skills (HOTS) refer to students' ability to solve problems by analyzing, evaluating, and creating. HOTS are essential for 21st century learning. Solving combinatorics problem troubleshooting requires HOTS.
Arif Fatahillah+2 more
exaly +3 more sources
Combinatorics of Positroids [PDF]
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.
Suho Oh
doaj +4 more sources
The background of this research is that there are still many prospective teacher students who still experience difficulties in solving addition and multiplication rules in combinatorics.
Friska Mahatri+3 more
exaly +3 more sources
On BMRN*-colouring of planar digraphs [PDF]
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
Enumeration of bilaterally symmetric 3-noncrossing partitions [PDF]
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