Search Results for ""

The logical axiom R(x,y)=!(!(x v y) v !(x v !y))=x, where !x denotes NOT and x v y denotes OR, that, when taken together with associativity and commutativity, is equivalent ...

The Rudvalis group is the sporadic group Ru of order |Ru| = 145926144000 (1) = 2^(14)·3^3·5^3·7·13·29. (2) It is implemented in the Wolfram Language as RudvalisGroupRu[].

A specification of elements in a list as a list of pairs giving the element and number of times it occurs in a run. For example, given the list ...

Scalar multiplication refers to the multiplication of a vector by a constant s, producing a vector in the same (for s>0) or opposite (for s<0) direction but of different ...

A shuffle-exchange graph is a nonsimple graph (due to the existence of graph loops) whose vertices are length n binary strings with an edge from w to w^' if 1. w^' differs ...

Two nodes connected to the same node which are same distance from the root vertex in a rooted tree are called siblings. A function to return the siblings of a vertex v in a ...

A finite set of equations in the same unknowns of which the common solutions have to be determined. Solution of simultaneous equations in implemented in the Wolfram Language ...

A stack is a data structure which is a special kind of list in which elements may be added to or removed from the top only. These actions are called a push or a pop, ...

A stack F on a topological space X is said to be a stack of groupoids if for each open subset U subset= X, the category F(U) is a groupoid.

A subsequence of {a} is a sequence {b} defined by b_k=a_(n_k), where n_1<n_2<... is an increasing sequence of indices (D'Angelo and West 2000). For example, the prime numbers ...