TOPICS
Search

Search Results for ""


2451 - 2460 of 3715 for One-step equationsSearch Results
An affine geometry is a geometry in which properties are preserved by parallel projection from one plane to another. In an affine geometry, the third and fourth of Euclid's ...
In the algebraic geometry of Grothendieck, a stack refers to a sheaf of categories. In particular, a stack is a presheaf of categories in which the following descent ...
The algebraic unknotting number of a knot K in S^3 is defined as the algebraic unknotting number of the S-equivalence class of a Seifert matrix of K. The algebraic unknotting ...
Call a projection of a link an almost alternating projection if one crossing change in the projection makes it an alternating projection. Then an almost alternating link is a ...
A function representable as a generalized Fourier series. Let R be a metric space with metric rho(x,y). Following Bohr (1947), a continuous function x(t) for (-infty<t<infty) ...
For some constant alpha_0, alpha(f,z)<alpha_0 implies that z is an approximate zero of f, where alpha(f,z)=(|f(z)|)/(|f^'(z)|)sup_(k>1)|(f^((k))(z))/(k!f^'(z))|^(1/(k-1)). ...
In a game proposed by J. H. Conway, a devil chases an angel on an infinite chessboard. At each move, the devil can eliminate one of the squares, and the angel can make a leap ...
An Anosov diffeomorphism is a C^1 diffeomorphism phi of a manifold M to itself such that the tangent bundle of M is hyperbolic with respect to phi. Very few classes of Anosov ...
An antelope graph (Jelliss 2019) is a graph formed by all possible moves of a hypothetical chess piece called an "antelope" which moves analogously to a knight except that it ...
Define an antipode of a given graph vertex v_i as a vertex v_j at greatest possible graph distance from v_i. Then an antipodal graph is a connected graph in which each vertex ...
1 ... 243|244|245|246|247|248|249 ... 372 Previous Next

...