Search Results for ""

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. ...

A graph is claw-free iff it does not contain the complete bipartite graph K_(1,3) (known as the "claw graph"; illustrated above) as a forbidden induced subgraph. The line ...

Define a cell in R^1 as an open interval or a point. A cell in R^(k+1) then has one of two forms, {(x,y):x in C, and f(x)<y<g(x)} (1) or {(x,y):x in C, and y=f(x)}, (2) where ...

Seeks to obtain the best numerical estimate of an integral by picking optimal abscissas x_i at which to evaluate the function f(x). The fundamental theorem of Gaussian ...

There are a number of point processes which are called Hawkes processes and while many of these notions are similar, some are rather different. There are also different ...

A quadratic map is a quadratic recurrence equation of the form x_(n+1)=a_2x_n^2+a_1x_n+a_0. (1) While some quadratic maps are solvable in closed form (for example, the three ...

A Riemann surface is a surface-like configuration that covers the complex plane with several, and in general infinitely many, "sheets." These sheets can have very complicated ...

The word "rigid" has two different meaning when applied to a graph. Firstly, a rigid graph may refer to a graph having a graph automorphism group containing a single element. ...

The Smarandache function mu(n) is the function first considered by Lucas (1883), Neuberg (1887), and Kempner (1918) and subsequently rediscovered by Smarandache (1980) that ...

The term analysis is used in two ways in mathematics. It describes both the discipline of which calculus is a part and one form of abstract logic theory. Analysis is the ...