Möbius transformationIn geometry and complex analysis, a Möbius transformation of the complex plane is a rational function of the form of one complex variable z; here the coefficients a, b, c, d are complex numbers satisfying ad − bc ≠ 0. Geometrically, a Möbius transformation can be obtained by first performing stereographic projection from the plane to the unit two-sphere, rotating and moving the sphere to a new location and orientation in space, and then performing stereographic projection (from the new position of the sphere) to the plane.
FactorizationIn mathematics, factorization (or factorisation, see English spelling differences) or factoring consists of writing a number or another mathematical object as a product of several factors, usually smaller or simpler objects of the same kind. For example, 3 × 5 is an integer factorization of 15, and (x – 2)(x + 2) is a polynomial factorization of x2 – 4. Factorization is not usually considered meaningful within number systems possessing division, such as the real or complex numbers, since any can be trivially written as whenever is not zero.
Hyperbolic geometryIn mathematics, hyperbolic geometry (also called Lobachevskian geometry or Bolyai–Lobachevskian geometry) is a non-Euclidean geometry. The parallel postulate of Euclidean geometry is replaced with: For any given line R and point P not on R, in the plane containing both line R and point P there are at least two distinct lines through P that do not intersect R. (Compare the above with Playfair's axiom, the modern version of Euclid's parallel postulate.) The hyperbolic plane is a plane where every point is a saddle point.
Linear fractional transformationIn mathematics, a linear fractional transformation is, roughly speaking, an invertible transformation of the form The precise definition depends on the nature of a, b, c, d, and z. In other words, a linear fractional transformation is a transformation that is represented by a fraction whose numerator and denominator are linear. In the most basic setting, a, b, c, d, and z are complex numbers (in which case the transformation is also called a Möbius transformation), or more generally elements of a field.
Möbius stripIn mathematics, a Möbius strip, Möbius band, or Möbius loop is a surface that can be formed by attaching the ends of a strip of paper together with a half-twist. As a mathematical object, it was discovered by Johann Benedict Listing and August Ferdinand Möbius in 1858, but it had already appeared in Roman mosaics from the third century CE. The Möbius strip is a non-orientable surface, meaning that within it one cannot consistently distinguish clockwise from counterclockwise turns.
Fixed point (mathematics)hatnote|1=Fixed points in mathematics are not to be confused with other uses of "fixed point", or stationary points where math|1=f(x) = 0. In mathematics, a fixed point (sometimes shortened to fixpoint), also known as an invariant point, is a value that does not change under a given transformation. Specifically for functions, a fixed point is an element that is mapped to itself by the function. Formally, c is a fixed point of a function f if c belongs to both the domain and the codomain of f, and f(c) = c.
August Ferdinand MöbiusAugust Ferdinand Möbius (UKˈmɜːbiəs, USˈmeɪ-,_ˈmoʊ-; ˈmøːbi̯ʊs; 17 November 1790 – 26 September 1868) was a German mathematician and theoretical astronomer. Möbius was born in Schulpforta, Electorate of Saxony, and was descended on his mother's side from religious reformer Martin Luther. He was home-schooled until he was 13, when he attended the college in Schulpforta in 1803, and studied there, graduating in 1809. He then enrolled at the University of Leipzig, where he studied astronomy under the mathematician and astronomer Karl Mollweide.
Fixed-point iterationIn numerical analysis, fixed-point iteration is a method of computing fixed points of a function. More specifically, given a function defined on the real numbers with real values and given a point in the domain of , the fixed-point iteration is which gives rise to the sequence of iterated function applications which is hoped to converge to a point . If is continuous, then one can prove that the obtained is a fixed point of , i.e., More generally, the function can be defined on any metric space with values in that same space.
Hyperbolic orthogonalityIn geometry, the relation of hyperbolic orthogonality between two lines separated by the asymptotes of a hyperbola is a concept used in special relativity to define simultaneous events. Two events will be simultaneous when they are on a line hyperbolically orthogonal to a particular time line. This dependence on a certain time line is determined by velocity, and is the basis for the relativity of simultaneity. Two lines are hyperbolic orthogonal when they are reflections of each other over the asymptote of a given hyperbola.
Factorization of polynomialsIn mathematics and computer algebra, factorization of polynomials or polynomial factorization expresses a polynomial with coefficients in a given field or in the integers as the product of irreducible factors with coefficients in the same domain. Polynomial factorization is one of the fundamental components of computer algebra systems. The first polynomial factorization algorithm was published by Theodor von Schubert in 1793. Leopold Kronecker rediscovered Schubert's algorithm in 1882 and extended it to multivariate polynomials and coefficients in an algebraic extension.
Fixed-point theoremIn mathematics, a fixed-point theorem is a result saying that a function F will have at least one fixed point (a point x for which F(x) = x), under some conditions on F that can be stated in general terms. The Banach fixed-point theorem (1922) gives a general criterion guaranteeing that, if it is satisfied, the procedure of iterating a function yields a fixed point.
Aurifeuillean factorizationIn number theory, an aurifeuillean factorization, named after Léon-François-Antoine Aurifeuille, is factorization of certain integer values of the cyclotomic polynomials. Because cyclotomic polynomials are irreducible polynomials over the integers, such a factorization cannot come from an algebraic factorization of the polynomial. Nevertheless, certain families of integers coming from cyclotomic polynomials have factorizations given by formulas applying to the whole family, as in the examples below.
Geometric transformationIn mathematics, a geometric transformation is any bijection of a set to itself (or to another such set) with some salient geometrical underpinning. More specifically, it is a function whose domain and range are sets of points — most often both or both — such that the function is bijective so that its inverse exists. The study of geometry may be approached by the study of these transformations. Geometric transformations can be classified by the dimension of their operand sets (thus distinguishing between, say, planar transformations and spatial transformations).
Hyperbolic 3-manifoldIn mathematics, more precisely in topology and differential geometry, a hyperbolic 3-manifold is a manifold of dimension 3 equipped with a hyperbolic metric, that is a Riemannian metric which has all its sectional curvatures equal to −1. It is generally required that this metric be also complete: in this case the manifold can be realised as a quotient of the 3-dimensional hyperbolic space by a discrete group of isometries (a Kleinian group).
Kakutani fixed-point theoremIn mathematical analysis, the Kakutani fixed-point theorem is a fixed-point theorem for set-valued functions. It provides sufficient conditions for a set-valued function defined on a convex, compact subset of a Euclidean space to have a fixed point, i.e. a point which is mapped to a set containing it. The Kakutani fixed point theorem is a generalization of the Brouwer fixed point theorem. The Brouwer fixed point theorem is a fundamental result in topology which proves the existence of fixed points for continuous functions defined on compact, convex subsets of Euclidean spaces.
Uniform tilings in hyperbolic planeIn hyperbolic geometry, a uniform hyperbolic tiling (or regular, quasiregular or semiregular hyperbolic tiling) is an edge-to-edge filling of the hyperbolic plane which has regular polygons as faces and is vertex-transitive (transitive on its vertices, isogonal, i.e. there is an isometry mapping any vertex onto any other). It follows that all vertices are congruent, and the tiling has a high degree of rotational and translational symmetry.
Integer factorizationIn number theory, integer factorization is the decomposition, when possible, of a positive integer into a product of smaller integers. If the factors are further restricted to be prime numbers, the process is called prime factorization, and includes the test whether the given integer is prime (in this case, one has a "product" of a single factor). When the numbers are sufficiently large, no efficient non-quantum integer factorization algorithm is known. However, it has not been proven that such an algorithm does not exist.
Split-complex numberIn algebra, a split complex number (or hyperbolic number, also perplex number, double number) is based on a hyperbolic unit j satisfying A split-complex number has two real number components x and y, and is written The conjugate of z is Since the product of a number z with its conjugate is an isotropic quadratic form. The collection D of all split complex numbers for x,y \in \R forms an algebra over the field of real numbers. Two split-complex numbers w and z have a product wz that satisfies This composition of N over the algebra product makes (D, +, ×, *) a composition algebra.
Fermat's factorization methodFermat's factorization method, named after Pierre de Fermat, is based on the representation of an odd integer as the difference of two squares: That difference is algebraically factorable as ; if neither factor equals one, it is a proper factorization of N. Each odd number has such a representation. Indeed, if is a factorization of N, then Since N is odd, then c and d are also odd, so those halves are integers. (A multiple of four is also a difference of squares: let c and d be even.
Squeeze mappingIn linear algebra, a squeeze mapping, also called a squeeze transformation, is a type of linear map that preserves Euclidean area of regions in the Cartesian plane, but is not a rotation or shear mapping. For a fixed positive real number a, the mapping is the squeeze mapping with parameter a. Since is a hyperbola, if u = ax and v = y/a, then uv = xy and the points of the image of the squeeze mapping are on the same hyperbola as (x,y) is.
