Search Results for ""

A problem listed in a fall issue of Gazeta Matematică in the mid-1970s posed the question if x_1>0 and x_(n+1)=(1+1/(x_n))^n (1) for n=1, 2, ..., then are there any values ...

The fast Fourier transform (FFT) is a discrete Fourier transform algorithm which reduces the number of computations needed for N points from 2N^2 to 2NlgN, where lg is the ...

The Coxeter graph is a nonhamiltonian cubic symmetric graph on 28 vertices and 42 edges which can be constructed as illustrated above. It can also be constructed as the graph ...

The biconnected graph theta_0 on seven nodes and seven edges illustrated above. It has chromatic polynomial pi_(theta_0)(z)=z^7-8z^6+28z^5-56z^4+68z^3-47z^2+14z and chromatic ...

Grünbaum conjectured that for every m>1, n>2, there exists an m-regular, m-chromatic graph of girth at least n. This result is trivial for n=2 or m=2,3, but only a small ...

If k|n, then the complete k-uniform hypergraph on n vertices decomposes into 1-factors, where a 1-factor is a set of n/k pairwise disjoint k-sets. Brouwer and Schrijver ...

Generally speaking, a Green's function is an integral kernel that can be used to solve differential equations from a large number of families including simpler examples such ...

The number of representations of n by k squares, allowing zeros and distinguishing signs and order, is denoted r_k(n). The special case k=2 corresponding to two squares is ...

The Beatty sequence is a spectrum sequence with an irrational base. In other words, the Beatty sequence corresponding to an irrational number theta is given by |_theta_|, ...

A (0,1)-matrix is an integer matrix in which each element is a 0 or 1. It is also called a logical matrix, binary matrix, relation matrix, or Boolean matrix. The number of ...