Search Results for ""

In the fields of functional and harmonic analysis, the Littlewood-Paley decomposition is a particular way of decomposing the phase plane which takes a single function and ...

An edge-magic graph is a labeled graph with e graph edges labeled with distinct elements {1,2,...,e} so that the sum of the graph edge labels at each graph vertex is the ...

A maze, also known as a labyrinth, as is a set of passages (with impermeable walls). The goal of the maze is to start at one given point and find a path through the passages ...

The Neuberg A_1-circle is the locus of the polygon vertex A_1 of a triangle on a given base A_2A_3 and with a given Brocard angle omega. From the center N_1, the base A_2A_3 ...

Given a function f(x) of a variable x tabulated at m values y_1=f(x_1), ..., y_m=f(x_m), assume the function is of known analytic form depending on n parameters ...

The pentakis dodecahedral graph is Archimedean dual graph which is the skeleton of the disdyakis triacontahedron. It is implemented in the Wolfram Language as ...

A polyomino tiling is a tiling of the plane by specified types of polyominoes. Tiling by polyominoes has been investigated since at least the late 1950s, particularly by S. ...

Pronic numbers are figurate numbers of the form P_n=2T_n=n(n+1), where T_n is the nth triangular number. The first few are 2, 6, 12, 20, 30, 42, 56, 72, 90, 110, ... (OEIS ...

Find two distinct sets of integers {a_1,...,a_n} and {b_1,...,b_n}, such that for k=1, ..., m, sum_(i=1)^na_i^k=sum_(i=1)^nb_i^k. (1) The Prouhet-Tarry-Escott problem is ...

A notion introduced by R. M. Wilson in 1974. Given a finite graph G with n vertices, puz(G) is defined as the graph whose nodes are the labelings of G leaving one node ...