Search Results for ""
1661 - 1670 of 13134 for Extremal graph theorySearch Results
The disjoint union of two sets A and B is a binary operator that combines all distinct elements of a pair of given sets, while retaining the original set membership as a ...
There are infinitely many primes m which divide some value of the partition function P.
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 ...
The finite group T is one of the three non-Abelian groups of order 12 (out of a total of fives groups of order 12), the other two being the alternating group A_4 and the ...
Successive points dividing a golden rectangle into squares lie on a logarithmic spiral (Wells 1991, p. 39; Livio 2002, p. 119) which is sometimes known as the golden spiral. ...
An apodization function chosen to minimize the height of the highest sidelobe (Hamming and Tukey 1949, Blackman and Tukey 1959). The Hamming function is given by ...
The Janko groups are the four sporadic groups J_1, J_2, J_3 and J_4. The Janko group J_2 is also known as the Hall-Janko group. The Janko groups are implemented in the ...
A finite sequence of real numbers {a_k}_(k=1)^n is said to be logarithmically concave (or log-concave) if a_i^2>=a_(i-1)a_(i+1) holds for every a_i with 1<=i<=n-1. A ...
A minor M_(ij) is the reduced determinant of a determinant expansion that is formed by omitting the ith row and jth column of a matrix A. So, for example, the minor M_(22) of ...
By way of analogy with the eban numbers, oban numbers are defined as numbers whose English names do not contain the letter "o" (i.e., "o" is banned). Note that this ...
...
View search results from all Wolfram sites (34319 matches)

