Search Results for ""

Given a weighted, undirected graph G=(V,E) and a graphical partition of V into two sets A and B, the cut of G with respect to A and B is defined as cut(A,B)=sum_(i in A,j in ...

The cut elimination theorem, also called the "Hauptsatz" (Gentzen 1969), states that every sequent calculus derivation can be transformed into another derivation with the ...

A chord of a graph cycle C is an edge not in the edge set of C whose endpoints lie in the vertex set C (West 2000, p. 225). For example, in the diamond graph as labeled ...

A sophisticated checksum (often abbreviated CRC), which is based on the algebra of polynomials over the integers (mod 2). It is substantially more reliable in detecting ...

A plane partition whose solid Ferrers diagram is invariant under the rotation which cyclically permutes the x-, y-, and z-axes. Macdonald's plane partition conjecture gives a ...

The polar curve r=1+2cos(2theta) (1) that can be used for angle trisection. It was devised by Ceva in 1699, who termed it the cycloidum anomalarum (Loomis 1968, p. 29). It ...

The maximum number of pieces into which a cylinder can be divided by n oblique cuts is given by f(n) = (n+1; 3)+n+1 (1) = 1/6(n+1)(n^2-n+6) (2) = 1/6(n^3+5n+6), (3) where (a; ...

The Danzer configuration is a 35_4 self-dual configuration of 35 lines and 35 points in which 4 points lie on each line and 4 lines pass through each point. The Levi graph of ...

Given binomial coefficient (N; k), write N-k+i=a_ib_i, for 1<=i<=k, where b_i contains only those prime factors >k. Then the number of i for which b_i=1 (i.e., for which all ...

A deletable prime is a prime number which has the property that deleting digits one at a time in some order gives a prime at each step. For example, 410256793 is a deletable ...