Results 91 to 100 of about 246,865 (191)
Edges in the poset of partitions of an integer
Let \(P_ n\) be the poset of partitions of n, ordered by refinement. The author counts the number NE(n,t) of edges in the Hasse diagram of \(P_ n\) between rank levels t and t-1. He presents the recursion formula \[ NE(n,t)=NE(n-1,t)+NE(t+1,2t-n+1). \]
openaire +2 more sources
Strongly intersecting integer partitions
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +4 more sources
This article shows how concrete materials can be used in the context of partitions of integers to develop recursive definitions of concepts amenable to spreadsheet modeling.
Sergei Abramovich
doaj
On the poset of partitions of an integer
Sadek Bouroubi, Nesrine Benyahia Tani
openaire +2 more sources
Casting Light on Integer Partitions
Summary: Integer partitions ofnare viewed as bargraphs (i.e., Young diagrams rotated anticlockwise by 90 degrees) in which theith part of the partition \(x_i\) is given by the \(i\)th column of the bargraph with \(x_i\) cells. The sun is at infinity in the northwest of our two dimensional model and each cell may or may not be lit depending on whether ...
Blecher, Aubrey +2 more
openaire +2 more sources
Integer partitions detect the primes. [PDF]
Craig W, van Ittersum JW, Ono K.
europepmc +1 more source
A central limit theorem for integer partitions into small powers. [PDF]
Lipnik GF, Madritsch MG, Tichy RF.
europepmc +1 more source
Redefining topological robustness in optical polarization fields through a generalized skyrmion number. [PDF]
Wang AA +11 more
europepmc +1 more source
Eigenweights for arithmetic Hirzebruch Proportionality. [PDF]
Feng T.
europepmc +1 more source
Robust policy evaluation from large-scale observational studies. [PDF]
Islam MS +3 more
europepmc +1 more source

