TOPICS
Search

Search Results for ""


2971 - 2980 of 13134 for Extremal graph theorySearch Results
A set S together with a relation >= which is both transitive and reflexive such that for any two elements a,b in S, there exists another element c in S with c>=a and c>=b. In ...
The Dirichlet kernel D_n^M is obtained by integrating the number theoretic character e^(i<xi,x>) over the ball |xi|<=M, D_n^M=-1/(2pir)d/(dr)D_(n-2)^M.
Two sets A_1 and A_2 are disjoint if their intersection A_1 intersection A_2=emptyset, where emptyset is the empty set. n sets A_1, A_2, ..., A_n are disjoint if A_i ...
A quantity that is divided by another quantity.
An even number N for which N=0 (mod 4). The first few positive doubly even numbers are 4, 8, 12, 16, ... (OEIS A008586).
The ending of a game in which neither of two players wins, sometimes also called a "tie." A game in which no draw is possible is called a categorical game.
A dual number is a number x+epsilony, where x,y in R and epsilon is a matrix with the property that epsilon^2=0 (such as epsilon=[0 1; 0 0]).
Let Jones and Smith be the only two contestants in an election that will end in a deadlock when all votes for Jones (J) and Smith (S) are counted. What is the expectation ...
136·2^(256) approx 1.575×10^(79). According to Eddington, the exact number of protons in the universe, where 136 was the reciprocal of the fine structure constant as best as ...
Let (X,B,mu) be a measure space and let E be a measurable set with mu(E)<infty. Let {f_n} be a sequence of measurable functions on E such that each f_n is finite almost ...
1 ... 295|296|297|298|299|300|301 ... 1314 Previous Next

...