Search Results for ""
901 - 910 of 2406 for Elliptic Curve Group LawSearch Results
![](/common/images/search/spacer.gif)
The Maclaurin trisectrix is a curve first studied by Colin Maclaurin in 1742. It was studied to provide a solution to one of the geometric problems of antiquity, in ...
A ruled surface is a surface that can be swept out by moving a line in space. It therefore has a parameterization of the form x(u,v)=b(u)+vdelta(u), (1) where b is called the ...
There are two incompatible definitions of the squircle. The first defines the squircle as the quartic plane curve which is special case of the superellipse with a=b and r=4, ...
The term "loop" has a number of meanings in mathematics. Most simply, a loop is a closed curve whose initial and final points coincide in a fixed point p known as the ...
The lower central series of a Lie algebra g is the sequence of subalgebras recursively defined by g_(k+1)=[g,g_k], (1) with g_0=g. The sequence of subspaces is always ...
The Gray graph is a cubic semisymmetric graph on 54 vertices. It was discovered by Marion C. Gray in 1932, and was first published by Bouwer (1968). Malnič et al. (2002) ...
An ideal is a subset I of elements in a ring R that forms an additive group and has the property that, whenever x belongs to R and y belongs to I, then xy and yx belong to I. ...
The Meringer graph is one of the four (5,5)-cage graphs, discovered by Meringer (1999) after it had long been thought that only three such cages existed. Like the other ...
Let F(n,sigma) denote the number of permutations on the symmetric group S_n which avoid sigma in S_k as a subpattern, where "tau contains sigma as a subpattern" is ...
The word "rigid" has two different meaning when applied to a graph. Firstly, a rigid graph may refer to a graph having a graph automorphism group containing a single element. ...
![](/common/images/search/spacer.gif)
...