TOPICS
Search

Search Results for ""


4491 - 4500 of 13134 for complexity theorySearch Results
A two-regular graph is a regular graph for which all local degrees are 2. A two-regular graph consists of one or more (disconnected) cycles. The numbers a_n of two-regular ...
The term two-sided ideal is used in noncommutative rings to denote a subset that is both a right ideal and a left ideal. In commutative rings, where right and left are ...
Whitehead and Russell (1927) devised a hierarchy of "types" in order to eliminate self-referential statements from Principia Mathematica, which purported to derive all of ...
By way of analogy with the eban numbers, uban numbers are defined as numbers whose English names do not contain the letter "u" (i.e., "u" is banned). Note that this ...
Let G be Gauss's constant and M=1/G be its multiplicative inverse. Then M/sqrt(2)=0.8472130... (OEIS A097057) is sometimes known as the ubiquitous constant (Spanier and ...
An unhappy number is a number that is not happy, i.e., a number n such that iterating this sum-of-squared-digits map starting with n never reaches the number 1. The first few ...
A circuit in which an entire graph is traversed in one route. Examples of curves that can be traced unicursally are the Mohammed sign and unicursal hexagram. The numbers of ...
An apodization function A(x)=1, (1) having instrument function I(k)=2asinc(2pika). (2) The peak of I(k) is 2a. The full width at half maximum of I(k) can found by setting ...
The union of two sets A and B is the set obtained by combining the members of each. This is written A union B, and is pronounced "A union B" or "A cup B." The union of sets ...
A square matrix A is said to be unipotent if A-I, where I is an identity matrix is a nilpotent matrix (defined by the property that A^n is the zero matrix for some positive ...
1 ... 447|448|449|450|451|452|453 ... 1314 Previous Next

...