on%20finite%20point%20sets

SearchAdvancedHelp

(0.005 seconds)

1—10 of 644 matching pages

1: 36.4 Bifurcation Sets

… ►

§36.4(i) Formulas

►

Critical Points for Cuspoids

… ►

Critical Points for Umbilics

… ►This is the codimension-one surface in $𝐱$ space where critical points coalesce, satisfying (36.4.1) and … ►This is the codimension-one surface in $𝐱$ space where critical points coalesce, satisfying (36.4.2) and …

2: 20 Theta Functions

Chapter 20 Theta Functions

…

3: 3.8 Nonlinear Equations

… ► … ►For the computation of zeros of orthogonal polynomials as eigenvalues of finite tridiagonal matrices (§3.5(vi)), see Gil et al. (2007a, pp. 205–207). For the computation of zeros of Bessel functions, Coulomb functions, and conical functions as eigenvalues of finite parts of infinite tridiagonal matrices, see Grad and Zakrajšek (1973), Ikebe (1975), Ikebe et al. (1991), Ball (2000), and Gil et al. (2007a, pp. 205–213). … ►Consider $x=20$ and $j=19$. We have $p^{\prime }(20)=19!$ and $a_{19}=1+2+\mathrm{\cdots }+20=210$. …

4: 8 Incomplete Gamma and Related
Functions

…

5: 28 Mathieu Functions and Hill’s Equation

…

6: 8.26 Tables

… ►

Khamis (1965) tabulates $P(a,x)$ for $a=0.05(.05)10(.1)20(.25)70$, $0.0001\le x\le 250$ to 10D.

… ►

Abramowitz and Stegun (1964, pp. 245–248) tabulates $E_n\left(x\right)$ for $n=2,3,4,10,20$, $x=0(.01)2$ to 7D; also $(x+n){\mathrm{e}}^x{E}_n\left(x\right)$ for $n=2,3,4,10,20$, $x^{-1}=0(.01)0.1(.05)0.5$ to 6S.

… ►

Pagurova (1961) tabulates $E_n\left(x\right)$ for $n=0(1)20$, $x=0(.01)2(.1)10$ to 4-9S; ${\mathrm{e}}^x{E}_n\left(x\right)$ for $n=2(1)10$, $x=10(.1)20$ to 7D; ${\mathrm{e}}^x{E}_p\left(x\right)$ for $p=0(.1)1$, $x=0.01(.01)7(.05)12(.1)20$ to 7S or 7D.

… ►

Zhang and Jin (1996, Table 19.1) tabulates $E_n\left(x\right)$ for $n=1,2,3,5,10,15,20$, $x=0(.1)1,1.5,2,3,5,10,20,30,50,100$ to 7D or 8S.

7: 23 Weierstrass Elliptic and Modular
Functions

…

8: 26.2 Basic Definitions

… ►A permutation is a one-to-one and onto function from a non-empty set to itself. If the set consists of the integers 1 through $n$, a permutation $\sigma$ can be thought of as a rearrangement of these integers where the integer in position $j$ is $\sigma (j)$. … ►Given a finite set $S$ with permutation $\sigma$, a cycle is an ordered equivalence class of elements of $S$ where $j$ is equivalent to $k$ if there exists an $\mathrm{\ell }=\mathrm{\ell }(j,k)$ such that $j={\sigma }^{\mathrm{\ell }}(k)$, where ${\sigma }^1=\sigma$ and ${\sigma }^{\mathrm{\ell }}$ is the composition of $\sigma$ with ${\sigma }^{\mathrm{\ell }-1}$. … ►

Partition

►A partition of a set $S$ is an unordered collection of pairwise disjoint nonempty sets whose union is $S$. …

9: 36 Integrals with Coalescing Saddles

…

10: Gergő Nemes

… ►As of September 20, 2021, Nemes performed a complete analysis and acted as main consultant for the update of the source citation and proof metadata for every formula in Chapter 25 Zeta and Related Functions. …