Search Results for ""

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 ...

The R graph is the graph on 6 vertices illustrated above. It is implemented in the Wolfram Language as GraphData["RGraph"].

A public-key cryptography algorithm which uses prime factorization as the trapdoor one-way function. Define n=pq (1) for p and q primes. Also define a private key d and a ...

In algebraic topology, the Reidemeister torsion is a notion originally introduced as a topological invariant of 3-manifolds which has now been widely adapted to a variety of ...

Let G be a graph, and suppose each edge of G is independently deleted with fixed probability 0<=p<=1. Then the probability that no connected component of G is disconnected as ...

The Riemann tensor (Schutz 1985) R^alpha_(betagammadelta), also known the Riemann-Christoffel curvature tensor (Weinberg 1972, p. 133; Arfken 1985, p. 123) or Riemann ...

The rising sun graph is the graph on 7 vertices illustrated above. It is implemented in the Wolfram Language as GraphData["RisingSunGraph"].

The score sequence of a tournament is a monotonic nondecreasing sequence of the outdegrees of the graph vertices of the corresponding tournament graph. Elements of a score ...

A set of 15 open problems on Schrödinger operators proposed by mathematical physicist Barry Simon (2000). This set of problems follows up a 1984 list of open problems in ...

A method for finding recurrence relations for hypergeometric polynomials directly from the series expansions of the polynomials. The method is effective and easily ...