Search Results for ""

Elliptic curve primality proving, abbreviated ECPP, is class of algorithms that provide certificates of primality using sophisticated results from the theory of elliptic ...

A linear recurrence equation is a recurrence equation on a sequence of numbers {x_n} expressing x_n as a first-degree polynomial in x_k with k<n. For example ...

For every dimension n>0, the orthogonal group O(n) is the group of n×n orthogonal matrices. These matrices form a group because they are closed under multiplication and ...

Plouffe's constants are numbers arising in summations of series related to r_n=f(2^n) where f is a trigonometric function. Define the Iverson bracket function rho(x)={1 for ...

A series-reduced tree is a tree in which all nodes have degree other than 2 (in other words, no node merely allows a single edge to "pass through"). Series-reduced trees are ...

Transfinite induction, like regular induction, is used to show a property P(n) holds for all numbers n. The essential difference is that regular induction is restricted to ...

A unigraphic graph (or simply a "unigraph") is a graph that is isomorphic to every graph having that degree sequence. All graphs on four are fewer vertices are unigraphic. ...

An additive cellular automaton is a cellular automaton whose rule is compatible with an addition of states. Typically, this addition is derived from modular arithmetic. ...

When the elliptic modulus k has a singular value, the complete elliptic integrals may be computed in analytic form in terms of gamma functions. Abel (quoted in Whittaker and ...

The floor function |_x_|, also called the greatest integer function or integer value (Spanier and Oldham 1987), gives the largest integer less than or equal to x. The name ...