TOPICS
Search

Search Results for ""


5181 - 5190 of 13134 for Descriptive set theorySearch Results
The Komornik-Loreti constant is the value q such that 1=sum_(n=1)^infty(t_k)/(q^k), (1) where {t_k} is the Thue-Morse sequence, i.e., t_k is the parity of the number of 1's ...
The Kreisel conjecture is a conjecture in proof theory that postulates that, if phi(x) is a formula in the language of arithmetic for which there exists a nonnegative integer ...
The Kuratowski reduction theorem states that very nonplanar graph contains either the utility graph UG=K_(3,3) or the pentatope graph K_5 as a graph minor. The graphs K_(3,3) ...
Let P(N) denote the number of primes of the form n^2+1 for 1<=n<=N, then P(N)∼0.68641li(N), (1) where li(N) is the logarithmic integral (Shanks 1960, pp. 321-332). Let Q(N) ...
For n>=1, let u and v be integers with u>v>0 such that the Euclidean algorithm applied to u and v requires exactly n division steps and such that u is as small as possible ...
The Laplacian polynomial is the characteristic polynomial of the Laplacian matrix. The second smallest root of the Laplacian polynomial of a graph g (counting multiple values ...
The Laplacian spectral radius of a finite graph is defined as the largest value of its Laplacian spectrum, i.e., the largest eigenvalue of the Laplacian matrix (Lin et al. ...
A "law of large numbers" is one of several theorems expressing the idea that as the number of trials of a random process increases, the percentage difference between the ...
A nonnegative measurable function f is called Lebesgue integrable if its Lebesgue integral intfdmu is finite. An arbitrary measurable function is integrable if f^+ and f^- ...
Given a map f:S->T between sets S and T, the map g:T->S is called a left inverse to f provided that g degreesf=id_S, that is, composing f with g from the left gives the ...
1 ... 516|517|518|519|520|521|522 ... 1314 Previous Next

...