Search Results for ""

A triangle center function (sometimes simply called a center function) is a nonzero function f(a,b,c) that is homogeneous f(ta,tb,tc)=t^nf(a,b,c) (1) bisymmetry in b and c, ...

There are several different definitions of the term "unital" used throughout various branches of mathematics. In geometric combinatorics, a block design of the form (q^3+1, ...

A vector bundle is special class of fiber bundle in which the fiber is a vector space V. Technically, a little more is required; namely, if f:E->B is a bundle with fiber R^n, ...

The Zernike polynomials are a set of orthogonal polynomials that arise in the expansion of a wavefront function for optical systems with circular pupils. The odd and even ...

Send a Message

A connected graph G is distance-regular if for any vertices x and y of G and any integers i,j=0, 1, ...d (where d is the graph diameter), the number of vertices at distance i ...

The adjacency matrix, sometimes also called the connection matrix, of a simple labeled graph is a matrix with rows and columns labeled by graph vertices, with a 1 or 0 in ...

A binary tree is a tree-like structure that is rooted and in which each vertex has at most two children and each child of a vertex is designated as its left or right child ...

A Chaitin's constant, also called a Chaitin omega number, introduced by Chaitin (1975), is the halting probability of a universal prefix-free (self-delimiting) Turing ...

A chordal graph is a simple graph in which every graph cycle of length four and greater has a cycle chord. In other words, a chordal graph is a graph possessing no chordless ...