Search Results for ""

A univariate function f(x) is said to be odd provided that f(-x)=-f(x). Geometrically, such functions are symmetric about the origin. Examples of odd functions include x, ...

Ono (1914) conjectured that the inequality 27(b^2+c^2-a^2)^2(a^2+c^2-b^2)^2(a^2+b^2-c^2)^2<=(4K)^6 holds true for all triangles, where a, b, and c are the lengths of the ...

Given a set X, a set function mu^*:2^X->[0,infty] is said to be an outer measure provided that mu^*(emptyset)=0 and that mu^* is countably monotone, where emptyset is the ...

The pathwidth of a graph G, also called the interval thickness, vertex separation number, and node searching number, is one less than the size of the largest set in a path ...

The Perkel graph is a weakly regular graph on 57 vertices and 171 edges, shown above in several embeddings. It is the unique distance-regular graph with intersection array ...

If isosceles triangles with apex angles 2kpi/n are erected on the sides of an arbitrary n-gon A_0, and if this process is repeated with the n-gon A_1 formed by the free ...

For the rational curve of an unperturbed system with rotation number r/s under a map T (for which every point is a fixed point of T^s), only an even number of fixed points ...

Dirac (1952) proved that if the minimum vertex degree delta(G)>=n/2 for a graph G on n>=3 nodes, then G contains a Hamiltonian cycle (Bollobás 1978, Komlós et al. 1996). In ...

A Poulet number is a Fermat pseudoprime to base 2, denoted psp(2), i.e., a composite number n such that 2^(n-1)=1 (mod n). The first few Poulet numbers are 341, 561, 645, ...

A primitive right triangle is a right triangle having integer sides a, b, and c such that GCD(a,b,c)=1, where GCD(a,b,c) is the greatest common divisor. The set of values ...