Search Results for ""

A mathematical structure first introduced by Kolyvagin (1990) and defined as follows. Let T be a finite-dimensional p-adic representation of the Galois group of a number ...

There are (at least) three types of Euler transforms (or transformations). The first is a set of transformations of hypergeometric functions, called Euler's hypergeometric ...

The Euler triangle of a triangle DeltaABC is the triangle DeltaE_AE_BE_C whose vertices are the midpoints of the segments joining the orthocenter H with the respective ...

Let O and I be the circumcenter and incenter of a triangle with circumradius R and inradius r. Let d be the distance between O and I. Then d^2=R(R-2r) (Mackay 1886-1887; ...

The number of alternating permutations for n elements is sometimes called an Euler zigzag number. Denote the number of alternating permutations on n elements for which the ...

An Eulerian cycle, also called an Eulerian circuit, Euler circuit, Eulerian tour, or Euler tour, is a trail which starts and ends at the same graph vertex. In other words, it ...

An Eulerian graph is a graph containing an Eulerian cycle. The numbers of Eulerian graphs with n=1, 2, ... nodes are 1, 1, 2, 3, 7, 15, 52, 236, ... (OEIS A133736), the first ...

Legendre and Whittaker and Watson's (1990) term for the beta integral int_0^1x^p(1-x)^qdx, whose solution is the beta function B(p+1,q+1).

For R[n]>-1 and R[z]>0, Pi(z,n) = n^zint_0^1(1-x)^nx^(z-1)dx (1) = (n!)/((z)_(n+1))n^z (2) = B(z,n+1), (3) where (z)_n is the Pochhammer symbol and B(p,q) is the beta ...

The Eulerian number <n; k> gives the number of permutations of {1,2,...,n} having k permutation ascents (Graham et al. 1994, p. 267). Note that a slightly different ...