Search Results for ""

A binary bracketing is a bracketing built up entirely of binary operations. The number of binary bracketings of n letters (Catalan's problem) are given by the Catalan numbers ...

The Catalan numbers on nonnegative integers n are a set of numbers that arise in tree enumeration problems of the type, "In how many ways can a regular n-gon be divided into ...

The conjecture made by Belgian mathematician Eugène Charles Catalan in 1844 that 8 and 9 (2^3 and 3^2) are the only consecutive powers (excluding 0 and 1). In other words, ...

Catalan's constant is a constant that commonly appears in estimates of combinatorial functions and in certain classes of sums and definite integrals. It is usually denoted K ...

While the Catalan numbers are the number of p-good paths from (n,n) to (0,0) which do not cross the diagonal line, the super Catalan numbers count the number of lattice paths ...

Find the shape of a soap film (i.e., minimal surface) which will fill two inverted conical funnels facing each other is known as Sinclair's soap film problem (Bliss 1925, p. ...

The partial differential equation (1+f_y^2)f_(xx)-2f_xf_yf_(xy)+(1+f_x^2)f_(yy)=0 (Gray 1997, p. 399), whose solutions are called minimal surfaces. This corresponds to the ...

An area-minimizing surface (rectifiable current) bounded by a smooth curve in R^3 is a smooth submanifold with boundary.

A minimal surface discovered by L. P. M. Jorge and W. Meeks III in 1983 with Enneper-Weierstrass parameterization f = 1/((zeta^3-1)^2) (1) g = zeta^2 (2) (Dickson 1990). ...

For F_n the nth Fibonacci number, F_(n-1)F_(n+1)-F_n^2=(-1)^n. This identity was also discovered by Simson (Coxeter and Greitzer 1967, p. 41; Coxeter 1969, pp. 165-168; Wells ...