Search Results for ""
1751 - 1760 of 3024 for Well Ordered SetSearch Results
An order-n Costas array is a permutation on {1,...,n} such that the distances in each row of the triangular difference table are distinct. For example, the permutation ...
The complex lattice Lambda_6^omega corresponding to real lattice K_(12) having the densest hypersphere packing (kissing number) in twelve dimensions. The associated ...
A curve of order n is generally determined by n(n+3)/2 points. So a conic section is determined by five points and a cubic curve should require nine. But the Maclaurin-Bézout ...
A cyclic group is a group that can be generated by a single element X (the group generator). Cyclic groups are Abelian. A cyclic group of finite group order n is denoted C_n, ...
The cyclic group C_(11) is unique group of group order 11. An example is the integers modulo 11 under addition (Z_(11)). No modulo multiplication group is isomorphic to ...
The group C_2 is the unique group of group order 2. C_2 is both Abelian and cyclic. Examples include the point groups C_s, C_i, and C_2, the integers modulo 2 under addition ...
The cyclic group C_9 is one of the two Abelian groups of group order 9 (the other order-9 Abelian group being C_3×C_3; there are no non-Abelian groups of order 9). An example ...
The Danzer graph is the Levi graph of the Danzer configuration (Boben et al. 2015). It has 70 vertices and 140 edges and is quartic, bipartite, self-dual, and unit-distance. ...
The Davenport constant of a finite Abelian group G is defined to be the length of the longest minimal zero-system of G and is denoted D(G). Symbolically, ...
The dihedral group D_3 is a particular instance of one of the two distinct abstract groups of group order 6. Unlike the cyclic group C_6 (which is Abelian), D_3 is ...
...
View search results from all Wolfram sites (37299 matches)

