- The
longest uncrossed (or
nonintersecting) knight's path is a
mathematical problem involving a
knight on the
standard 8×8
chessboard or, more generally...
-
number of
nonequivalent dissections of an 22-gon into 19
polygons by
nonintersecting diagonals up to
rotation 2,887,174,368 = 785 2,971,215,073 = 11th Fibonacci...
- 51, 127, 323, 835, ... The
number of ways of
drawing any
number of
nonintersecting chords joining n (labeled)
points on a circle. A001006 Jordan–Pólya...
- OEIS Foundation. Sloane, N. J. A. (ed.). "Sequence A007764 (Number of
nonintersecting (or self-avoiding) rook
paths joining opposite corners of an n X n...
-
number of
nonequivalent dissections of an
hendecagon into 8
polygons by
nonintersecting diagonals up to
rotation 1769 =
maximal number of
pieces that can be...
-
David A. Huse,
Stanislas Leibler.
Phase behaviour of an
ensemble of
nonintersecting random fluid films.
Journal de Physique, 1988, 49 (4), pp.605-621....
- simplicity. This
model ****umes that
pores have the
shape of parallel,
nonintersecting cylindrical capillaries. But in
reality a
typical pore is a random...
-
formal power series, and the sum over
nonintersecting path
tuples now
becomes a sum over
collections of
nonintersecting and non-self-intersecting
paths and...
- {\vec {X}}} (which can be
interpreted as a
family or
congruence of
nonintersecting world lines via the
integral curve, not
necessarily geodesics), Raychaudhuri's...
- 44..616F. doi:10.1063/1.1726734. OEIS
sequence A007764 (Number of
nonintersecting (or self-avoiding) rook
paths joining opposite corners of an n X n...
