Search Results for ""

A row-convex polyomino is a self-avoiding convex polyomino such that the intersection of any horizontal line with the polyomino has at most two connected components. A ...

A partial solution to the Erdős squarefree conjecture which states that the binomial coefficient (2n; n) is never squarefree for all sufficiently large n>=n_0. Sárkőzy (1985) ...

A secant line, also simply called a secant, is a line passing through two points of a curve. As the two points are brought together (or, more precisely, as one is brought ...

The second Fermat point X^' or F_2 (also known as the second isogonic center) can be constructed by drawing equilateral triangles on the inside of a given triangle and ...

The second Napoleon point N^', also called the inner Napoleon point, is the concurrence of lines drawn between polygon vertices of a given triangle DeltaABC and the opposite ...

For K a given knot in S^3, choose a Seifert surface M^2 in S^3 for K and a bicollar M^^×[-1,1] in S^3-K. If x in H_1(M^^) is represented by a 1-cycle in M^^, let x^+ denote ...

The field of semidefinite programming (SDP) or semidefinite optimization (SDO) deals with optimization problems over symmetric positive semidefinite matrix variables with ...

The Stammler circle is the circumcircle of the Stammler triangle. Unexpectedly, it has center at the circumcenter O (X_3) of the reference triangle and radius 2R (Ehrmann and ...

For what value of x is f(x)=x^(1/x) a maximum? The maximum occurs at x=e, where f^'(x)=x^(-2+1/x)(1-lnx)=0, (1) which is zero at x=e and gives a maximum of ...

Stochastic optimization refers to the minimization (or maximization) of a function in the presence of randomness in the optimization process. The randomness may be present as ...