Search Results for ""

A graph that can be reduced to another graph with the same degree sequence by edge-switching is known as a switchable graph. Conversely, a graph that cannot be reduced to ...

A fundamental structural result in extremal graph theory due to Szemerédi (1978). The regularity lemma essentially says that every graph can be well-approximated by the union ...

A recursive function devised by I. Takeuchi in 1978 (Knuth 1998). For integers x, y, and z, it is defined by (1) This can be described more simply by t(x,y,z)={y if x<=y; {z ...

In the tabu search category of meta-heuristics, the essential idea is to 'forbid' search moves to points already visited in the (usually discrete) search space, at least for ...

Let T(x,y,z) be the number of times "otherwise" is called in the TAK function, then the Takeuchi numbers are defined by T_n(n,0,n+1). A recursive formula for T_n is given by ...

Let (L,<=) be any complete lattice. Suppose f:L->L is monotone increasing (or isotone), i.e., for all x,y in L, x<=y implies f(x)<=f(y). Then the set of all fixed points of f ...

The tau conjecture, also known as Ramanujan's hypothesis after its proposer, states that tau(n)∼O(n^(11/2+epsilon)), where tau(n) is the tau function. This was proven by ...

In category theory, a tensor category (C, tensor ,I,a,r,l) consists of a category C, an object I of C, a functor tensor :C×C->C, and a natural isomorphism a = a_(UVW):(U ...

Let R be a commutative ring. A tensor category (C, tensor ,I,a,r,l) is said to be a tensor R-category if C is an R-category and if the tensor product functor is an R-bilinear ...

In logic, a term is a variable, constant, or the result of acting on variables and constants by function symbols. In algebra, a term is a product of the form x^n (in the ...