Search Results for ""

A partition whose conjugate partition is equivalent to itself. The Ferrers diagrams corresponding to the self-conjugate partitions for 3<=n<=10 are illustrated above. The ...

Intuitively, a d-dimensional discrete percolation model is said to be long-range if direct flow is possible between pairs of graph vertices or graph edges which are "very ...

A self-isotomic cubic us a triangle cubic that is invariant under isotomic conjugation. The term is commonly applied to mean a pivotal isotomic cubic, in which points P lying ...

A self-isogonal cubic us a triangle cubic that is invariant under isogonal conjugation. The term is commonly applied to mean a pivotal isogonal cubic, in which points P lying ...

A self-avoiding walk is a path from one point to another which never intersects itself. Such paths are usually considered to occur on lattices, so that steps are only allowed ...

A point process N is called self-correcting if cov(N(s,t),N(t,u))<0 for s<t<u where here, cov denotes the covariance of the two quantities. Intuitively, a process is ...

A point process N is called self-exciting if cov(N(s,t),N(t,u))>0 for s<t<u where here, cov denotes the covariance of the two quantities. Intuitively, a process is ...

J. Tupper concocted the amazing formula 1/2<|_mod(|_y/(17)_|2^(-17|_x_|-mod(|_y_|,17)),2)_|, where |_x_| is the floor function and mod(b,m) is the mod function, which, when ...

Let the number of random walks on a d-D hypercubic lattice starting at the origin which never land on the same lattice point twice in n steps be denoted c_d(n). The first few ...

A plane partition which is invariant under permutation of the three axes and which is equal to its complement (i.e., the collection of cubes that are in a given box but do ...