Search Results for ""

The ruliad may be defined as the entangled limit of everything that is computationally possible, i.e., the result of following all possible computational rules in all ...

The logarithmic integral is defined as the Cauchy principal value li(x) = PVint_0^x(dt)/(lnt) (1) = ...

The Spieker center is the center Sp of the Spieker circle, i.e., the incenter of the medial triangle of a reference triangle DeltaABC. It is also the center of the excircles ...

The n-sunlet graph is the graph on 2n vertices obtained by attaching n pendant edges to a cycle graph C_n (ISGCI), i.e., the coronas C_n circledot K_1 (Frucht 1979). Sunlet ...

A group action G×X->X is transitive if it possesses only a single group orbit, i.e., for every pair of elements x and y, there is a group element g such that gx=y. In this ...

A twin prime cluster of order n is a collection of 2n consecutive prime numbers such that consecutive pairs form twin primes. Twin prime clusters were discussed by Mudge ...

Multiple series generalizations of basic hypergeometric series over the unitary groups U(n+1). The fundamental theorem of U(n) series takes c_1, ..., c_n and x_1, ..., x_n as ...

Universal algebra studies common properties of all algebraic structures, including groups, rings, fields, lattices, etc. A universal algebra is a pair A=(A,(f_i^A)_(i in I)), ...

von Neumann-Bernays-Gödel set theory (abbreviated "NBG") is a version of set theory which was designed to give the same results as Zermelo-Fraenkel set theory, but in a more ...

The Doyle graph, sometimes also known as the Holt graph (Marušič et al. 2005), is the quartic symmetric graph on 27 nodes illustrated above in several embeddings. It is ...