Search Results for ""
1211 - 1220 of 2001 for Dominating Unique GraphsSearch Results
Given a number field K, there exists a unique maximal unramified Abelian extension L of K which contains all other unramified Abelian extensions of K. This finite field ...
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 ...
A linear system of equations is a set of n linear equations in k variables (sometimes called "unknowns"). Linear systems can be represented in matrix form as the matrix ...
A map is a way of associating unique objects to every element in a given set. So a map f:A|->B from A to B is a function f such that for every a in A, there is a unique ...
A principal ideal domain is an integral domain in which every proper ideal can be generated by a single element. The term "principal ideal domain" is often abbreviated P.I.D. ...
A theorem, also called a unicity theorem, stating the uniqueness of a mathematical object, which usually means that there is only one object fulfilling given properties, or ...
A Ramsey number of the form R(k,k;2).
It is conjectured that every tree with e edges whose nodes are all trivalent or monovalent can be given a "magic" labeling such that the integers 1, 2, ..., e can be assigned ...
If G^' is a subgraph of G, then G is said to be a supergraph of G^'.
Given n matches (i.e., rigid unit line segments), find the number of topologically distinct planar arrangements which can be made (Gardner 1991). In this problem, two matches ...
...
View search results from all Wolfram sites (10564 matches)

