Search Results for ""

The square root method is an algorithm which solves the matrix equation Au=g (1) for u, with A a p×p symmetric matrix and g a given vector. Convert A to a triangular matrix ...

There are a number of interesting results related to the tiling of squares. For example, M. Laczkovich has shown that there are exactly three shapes of non-right triangles ...

Squarefree factorization is a first step in many factoring algorithms. It factors nonsquarefree polynomials in terms of squarefree factors that are relatively prime. It can ...

That part of a positive integer left after all square factors are divided out. For example, the squarefree part of 24=2^3·3 is 6, since 6·2^2=24. For n=1, 2, ..., the first ...

A number is squareful, also called nonsquarefree, if it contains at least one square in its prime factorization. The first few are 4, 8, 9, 12, 16, 18, 20, 24, 25, ... (OEIS ...

Let G be a permutation group on a set Omega and x be an element of Omega. Then G_x={g in G:g(x)=x} (1) is called the stabilizer of x and consists of all the permutations of G ...

Stable distributions are a class of probability distributions allowing skewness and heavy tails (Rimmer and Nolan 2005). They are described by an index of stability (also ...

Given a set of n men and n women, marry them off in pairs after each man has ranked the women in order of preference from 1 to n, {w_1,...,w_n} and each women has done ...

A stack polyomino is a self-avoiding convex polyomino containing two adjacent corners of its minimal bounding rectangle. The number of stack polyominoes with perimeter 2n+4 ...

The stacked book graph of order (m,n) is defined as the graph Cartesian product S_(m+1) square P_n, where S_m is a star graph and P_n is the path graph on n nodes. It is ...