Search Results for ""
6361 - 6370 of 13135 for Combinatorial AnalysisSearch Results
A unit in a ring is an element u such that there exists u^(-1) where u·u^(-1)=1.
A ringoid is a set R with two binary operators, conventionally denoted addition (+) and multiplication (×), where × distributes over + left and right: a(b+c)=ab+ac and ...
The logical axiom R(x,y)=!(!(x v y) v !(x v !y))=x, where !x denotes NOT and x v y denotes OR, that, when taken together with associativity and commutativity, is equivalent ...
A pseudocylindrical map projection which distorts shape, area, scale, and distance to create attractive average projection properties.
An estimation technique which is insensitive to small departures from the idealized assumptions which have been used to optimize the algorithm. Classes of such techniques ...
|_n]={n for n!=0; 1 for n=0. (1)
The m×n rook complement graph K_m square K_n^_ is the graph complement of the m×n rook graph. It has vertex count mn and edge count 2(m; 2)(n; 2), where (n; k) is a binomial ...
A graph G whose line graph is L(G) is called the root graph R(L(G)) of L(G). In order words, R(L(G))=G. The root graph of a connected graph is unique except for K_3=C_3 (the ...
The root lattice of a semisimple Lie algebra is the discrete lattice generated by the Lie algebra roots in h^*, the dual vector space to the Cartan subalgebra.
There is a one-to-one correspondence between the sets of equivalent correspondences (not of value 0) on an irreducible curve of curve genus p, and the rational collineations ...
...
View search results from all Wolfram sites (195209 matches)

