id stringlengths 14 14 | text stringlengths 9 3.55k | source stringlengths 1 250 |
|---|---|---|
c_e1mm6bqgv2zq | In mathematics, a Swiss cheese is a compact subset of the complex plane obtained by removing from a closed disc some countable union of open discs, usually with some restriction on the centres and radii of the removed discs. Traditionally the deleted discs should have pairwise disjoint closures which are subsets of the... | Swiss cheese (mathematics) |
c_z1ufcjswsbys | In mathematics, a Sylvester domain, named after James Joseph Sylvester by Dicks & Sontag (1978), is a ring in which Sylvester's law of nullity holds. This means that if A is an m by n matrix, and B is an n by s matrix over R, then ρ(AB) ≥ ρ(A) + ρ(B) – nwhere ρ is the inner rank of a matrix. The inner rank of an m by n... | Sylvester domain |
c_89fqkevfvlrk | In mathematics, a Sylvester matrix is a matrix associated to two univariate polynomials with coefficients in a field or a commutative ring. The entries of the Sylvester matrix of two polynomials are coefficients of the polynomials. The determinant of the Sylvester matrix of two polynomials is their resultant, which is ... | Sylvester matrix |
c_uw3zp957xx3e | In mathematics, a Szegő polynomial is one of a family of orthogonal polynomials for the Hermitian inner product ⟨ f | g ⟩ = ∫ − π π f ( e i θ ) g ( e i θ ) ¯ d μ {\displaystyle \langle f|g\rangle =\int _{-\pi }^{\pi }f(e^{i\theta }){\overline {g(e^{i\theta })}}\,d\mu } where dμ is a given positive measure on . Writing ... | Szegő polynomial |
c_uhy6tg4lalc6 | In mathematics, a Takiff algebra is a Lie algebra over a truncated polynomial ring. More precisely, a Takiff algebra of a Lie algebra g over a field k is a Lie algebra of the form g/(xn+1) = g⊗kk/(xn+1) for some positive integer n. Sometimes these are called generalized Takiff algebras, and the name Takiff algebra is u... | Takiff algebra |
c_4d1l2vdh4er9 | In mathematics, a Tamari lattice, introduced by Dov Tamari (1962), is a partially ordered set in which the elements consist of different ways of grouping a sequence of objects into pairs using parentheses; for instance, for a sequence of four objects abcd, the five possible groupings are ((ab)c)d, (ab)(cd), (a(bc))d, a... | Tamari lattice |
c_ga9fdssls4bg | In this partial order, any two groupings g1 and g2 have a greatest common predecessor, the meet g1 ∧ g2, and a least common successor, the join g1 ∨ g2. Thus, the Tamari lattice has the structure of a lattice. The Hasse diagram of this lattice is isomorphic to the graph of vertices and edges of an associahedron. | Tamari lattice |
c_1vd42i5se1um | The number of elements in a Tamari lattice for a sequence of n + 1 objects is the nth Catalan number Cn. The Tamari lattice can also be described in several other equivalent ways: It is the poset of sequences of n integers a1, ..., an, ordered coordinatewise, such that i ≤ ai ≤ n and if i ≤ j ≤ ai then aj ≤ ai (Huang &... | Tamari lattice |
c_bocuecnmsg7b | In mathematics, a Tannakian category is a particular kind of monoidal category C, equipped with some extra structure relative to a given field K. The role of such categories C is to approximate, in some sense, the category of linear representations of an algebraic group G defined over K. A number of major applications ... | Tannakian duality |
c_v4p8bp3tn0l7 | The pattern of the theory is that of Grothendieck's Galois theory, which is a theory about finite permutation representations of groups G which are profinite groups. The gist of the theory is that the fiber functor Φ of the Galois theory is replaced by a tensor functor T from C to K-Vect. The group of natural transform... | Tannakian duality |
c_xy5nqlpsxg6v | In mathematics, a Tate module of an abelian group, named for John Tate, is a module constructed from an abelian group A. Often, this construction is made in the following situation: G is a commutative group scheme over a field K, Ks is the separable closure of K, and A = G(Ks) (the Ks-valued points of G). In this case,... | Tate module of a number field |
c_m6wqy29uf34f | In mathematics, a Tate vector space is a vector space obtained from finite-dimensional vector spaces in a way that makes it possible to extend concepts such as dimension and determinant to an infinite-dimensional situation. Tate spaces were introduced by Alexander Beilinson, Boris Feigin, and Barry Mazur (1991), who na... | Tate vector space |
c_0bjrfw8hdky8 | In mathematics, a Teichmüller modular form is an analogue of a Siegel modular form on Teichmüller space. | Teichmüller modular form |
c_3knbjbpbryw9 | In mathematics, a Thue equation is a Diophantine equation of the form ƒ(x,y) = r,where ƒ is an irreducible bivariate form of degree at least 3 over the rational numbers, and r is a nonzero rational number. It is named after Axel Thue, who in 1909 proved that a Thue equation can have only finitely many solutions in inte... | Thue equation |
c_5v1h3pklu4sr | In mathematics, a Tschirnhaus transformation, also known as Tschirnhausen transformation, is a type of mapping on polynomials developed by Ehrenfried Walther von Tschirnhaus in 1683.Simply, it is a method for transforming a polynomial equation of degree n ≥ 2 {\displaystyle n\geq 2} with some nonzero intermediate coeff... | Tschirnhaus transformation |
c_7rw1zj55afhy | , a n − 1 {\displaystyle a_{1},...,a_{n-1}} , such that some or all of the transformed intermediate coefficients, a 1 ′ , . . . | Tschirnhaus transformation |
c_n93d2339ny40 | , a n − 1 ′ {\displaystyle a'_{1},...,a'_{n-1}} , are exactly zero. For example, finding a substitutionfor a cubic equation of degree n = 3 {\displaystyle n=3} ,such that substituting x = x ( y ) {\displaystyle x=x(y)} yields a new equationsuch that a 1 ′ = 0 {\displaystyle a'_{1}=0} , a 2 ′ = 0 {\displaystyle a'_{2}=0... | Tschirnhaus transformation |
c_huh8bu18vr0a | In mathematics, a Tutte–Grothendieck (TG) invariant is a type of graph invariant that satisfies a generalized deletion–contraction formula. Any evaluation of the Tutte polynomial would be an example of a TG invariant. | Tutte–Grothendieck invariant |
c_k7gjyg52yfq1 | In mathematics, a V-ring is a ring R such that every simple R-module is injective. The following three conditions are equivalent: Every simple left (resp. right) R-module is injective The radical of every left (resp. right) R-module is zero Every left (resp. | V-ring (ring theory) |
c_ea1omk1cbolp | right) ideal of R is an intersection of maximal left (resp. right) ideals of RA commutative ring is a V-ring if and only if it is Von Neumann regular. == References == | V-ring (ring theory) |
c_9wwcvr9fjkzv | In mathematics, a Verlinde algebra is a finite-dimensional associative algebra introduced by Erik Verlinde (1988), with a basis of elements φλ corresponding to primary fields of a rational two-dimensional conformal field theory, whose structure constants Nνλμ describe fusion of primary fields. | Verlinde formula |
c_4a0a73fqn7ag | In mathematics, a Vitali set is an elementary example of a set of real numbers that is not Lebesgue measurable, found by Giuseppe Vitali in 1905. The Vitali theorem is the existence theorem that there are such sets. There are uncountably many Vitali sets, and their existence depends on the axiom of choice. In 1970, Rob... | Vitali set |
c_5wjz5ud6tlps | In mathematics, a Vogan diagram, named after David Vogan, is a variation of the Dynkin diagram of a real semisimple Lie algebra that indicates the maximal compact subgroup. Although they resemble Satake diagrams they are a different way of classifying simple Lie algebras. | Vogan diagram |
c_seqbuxtl7ozv | In mathematics, a Voronoi diagram is a partition of a plane into regions close to each of a given set of objects. In the simplest case, these objects are just finitely many points in the plane (called seeds, sites, or generators). For each seed there is a corresponding region, called a Voronoi cell, consisting of all p... | Voronoi decomposition |
c_dbsz8xzs9qpv | The Voronoi diagram is named after mathematician Georgy Voronoy, and is also called a Voronoi tessellation, a Voronoi decomposition, a Voronoi partition, or a Dirichlet tessellation (after Peter Gustav Lejeune Dirichlet). Voronoi cells are also known as Thiessen polygons. Voronoi diagrams have practical and theoretical... | Voronoi decomposition |
c_4y13mu01wzzn | In mathematics, a Voronoi formula is an equality involving Fourier coefficients of automorphic forms, with the coefficients twisted by additive characters on either side. It can be regarded as a Poisson summation formula for non-abelian groups. The Voronoi (summation) formula for GL(2) has long been a standard tool for... | Voronoi formula |
c_dy0dtvdqf2oa | In mathematics, a Waldhausen category is a category C equipped with some additional data, which makes it possible to construct the K-theory spectrum of C using a so-called S-construction. It's named after Friedhelm Waldhausen, who introduced this notion (under the term category with cofibrations and weak equivalences) ... | Waldhausen category |
c_6ke902vf89ol | In mathematics, a Wall polynomial is a polynomial studied by Wall (1963) in his work on conjugacy classes in classical groups, and named by Andrews (1984). | Wall polynomial |
c_9wkeoos1as5r | In mathematics, a Walsh matrix is a specific square matrix of dimensions 2n, where n is some particular natural number. The entries of the matrix are either +1 or −1 and its rows as well as columns are orthogonal, i.e. dot product is zero. The Walsh matrix was proposed by Joseph L. Walsh in 1923. Each row of a Walsh ma... | Walsh matrix |
c_raw7botuodxu | The Walsh matrices are a special case of Hadamard matrices. The naturally ordered Hadamard matrix is defined by the recursive formula below, and the sequency-ordered Hadamard matrix is formed by rearranging the rows so that the number of sign changes in a row is in increasing order. Confusingly, different sources refer... | Walsh matrix |
c_00fgvsgktwui | In mathematics, a Weierstrass point P {\displaystyle P} on a nonsingular algebraic curve C {\displaystyle C} defined over the complex numbers is a point such that there are more functions on C {\displaystyle C} , with their poles restricted to P {\displaystyle P} only, than would be predicted by the Riemann–Roch theore... | Weierstrass point |
c_7iceumj1jr9e | In fact if g {\displaystyle g} is the genus of C {\displaystyle C} , the dimension from the k {\displaystyle k} -th term is known to be l ( k P ) = k − g + 1 , {\displaystyle l(kP)=k-g+1,} for k ≥ 2 g − 1. {\displaystyle k\geq 2g-1.} Our knowledge of the sequence is therefore 1 , ? | Weierstrass point |
c_aae2eokn0f29 | , ? , … , ? | Weierstrass point |
c_i4bqri85zoyj | , g , g + 1 , g + 2 , … . {\displaystyle 1,?,?,\dots ,?,g,g+1,g+2,\dots .} What we know about the ? | Weierstrass point |
c_s6d612uqv8m1 | entries is that they can increment by at most 1 each time (this is a simple argument: L ( n P ) / L ( ( n − 1 ) P ) {\displaystyle L(nP)/L((n-1)P)} has dimension as most 1 because if f {\displaystyle f} and g {\displaystyle g} have the same order of pole at P {\displaystyle P} , then f + c g {\displaystyle f+cg} will h... | Weierstrass point |
c_dw1wlfi9x7my | There will be g − 1 {\displaystyle g-1} steps up, and g − 1 {\displaystyle g-1} steps where there is no increment. A non-Weierstrass point of C {\displaystyle C} occurs whenever the increments are all as far to the right as possible: i.e. the sequence looks like 1 , 1 , … , 1 , 2 , 3 , 4 , … , g − 1 , g , g + 1 , … . {... | Weierstrass point |
c_cddlbgzgohai | Any other case is a Weierstrass point. A Weierstrass gap for P {\displaystyle P} is a value of k {\displaystyle k} such that no function on C {\displaystyle C} has exactly a k {\displaystyle k} -fold pole at P {\displaystyle P} only. The gap sequence is 1 , 2 , … , g {\displaystyle 1,2,\dots ,g} for a non-Weierstrass p... | Weierstrass point |
c_0reibt9xxidp | For a Weierstrass point it contains at least one higher number. (The Weierstrass gap theorem or Lückensatz is the statement that there must be g {\displaystyle g} gaps.) For hyperelliptic curves, for example, we may have a function F {\displaystyle F} with a double pole at P {\displaystyle P} only. | Weierstrass point |
c_qp91yxi4inza | Its powers have poles of order 4 , 6 {\displaystyle 4,6} and so on. Therefore, such a P {\displaystyle P} has the gap sequence 1 , 3 , 5 , … , 2 g − 1. {\displaystyle 1,3,5,\dots ,2g-1.} | Weierstrass point |
c_ysjoqsi7r01b | In general if the gap sequence is a , b , c , … {\displaystyle a,b,c,\dots } the weight of the Weierstrass point is ( a − 1 ) + ( b − 2 ) + ( c − 3 ) + … . {\displaystyle (a-1)+(b-2)+(c-3)+\dots .} This is introduced because of a counting theorem: on a Riemann surface the sum of the weights of the Weierstrass points is... | Weierstrass point |
c_3z4rdh6v65hr | {\displaystyle g(g^{2}-1).} For example, a hyperelliptic Weierstrass point, as above, has weight g ( g − 1 ) / 2. {\displaystyle g(g-1)/2.} | Weierstrass point |
c_3av6eibbs87k | Therefore, there are (at most) 2 ( g + 1 ) {\displaystyle 2(g+1)} of them. The 2 g + 2 {\displaystyle 2g+2} ramification points of the ramified covering of degree two from a hyperelliptic curve to the projective line are all hyperelliptic Weierstrass points and these exhausts all the Weierstrass points on a hyperellipt... | Weierstrass point |
c_2jspdj878lc2 | Multiplication of functions gives the non-gaps a numerical semigroup structure, and an old question of Adolf Hurwitz asked for a characterization of the semigroups occurring. A new necessary condition was found by R.-O. Buchweitz in 1980 and he gave an example of a subsemigroup of the nonnegative integers with 16 gaps ... | Weierstrass point |
c_j7s5ipchmac0 | In mathematics, a Weierstrass ring, named by Nagata after Karl Weierstrass, is a commutative local ring that is Henselian, pseudo-geometric, and such that any quotient ring by a prime ideal is a finite extension of a regular local ring. | Weierstrass ring |
c_31ryeq50uxll | In mathematics, a Weil group, introduced by Weil (1951), is a modification of the absolute Galois group of a local or global field, used in class field theory. For such a field F, its Weil group is generally denoted WF. There also exists "finite level" modifications of the Galois groups: if E/F is a finite extension, t... | Weil group of a class formation |
c_x81n1f699ru4 | In mathematics, a Weyl sequence is a sequence from the equidistribution theorem proven by Hermann Weyl:The sequence of all multiples of an irrational α, 0, α, 2α, 3α, 4α, ... is equidistributed modulo 1.In other words, the sequence of the fractional parts of each term will be uniformly distributed in the interval [0, 1... | Weyl sequence |
c_bd2313tkpdo7 | In mathematics, a Whittaker function is a special solution of Whittaker's equation, a modified form of the confluent hypergeometric equation introduced by Whittaker (1903) to make the formulas involving the solutions more symmetric. More generally, Jacquet (1966, 1967) introduced Whittaker functions of reductive groups... | Whittaker function |
c_dw69uj1minwf | {\displaystyle {\frac {d^{2}w}{dz^{2}}}+\left(-{\frac {1}{4}}+{\frac {\kappa }{z}}+{\frac {1/4-\mu ^{2}}{z^{2}}}\right)w=0.} It has a regular singular point at 0 and an irregular singular point at ∞. Two solutions are given by the Whittaker functions Mκ,μ(z), Wκ,μ(z), defined in terms of Kummer's confluent hypergeometr... | Whittaker function |
c_u17smw0qymkx | {\displaystyle W_{\kappa ,\mu }\left(z\right)=\exp \left(-z/2\right)z^{\mu +{\tfrac {1}{2}}}U\left(\mu -\kappa +{\tfrac {1}{2}},1+2\mu ,z\right).} The Whittaker function W κ , μ ( z ) {\displaystyle W_{\kappa ,\mu }(z)} is the same as those with opposite values of μ, in other words considered as a function of μ at fixe... | Whittaker function |
c_fwbiuqv27cfa | In mathematics, a Wieferich pair is a pair of prime numbers p and q that satisfy pq − 1 ≡ 1 (mod q2) and qp − 1 ≡ 1 (mod p2)Wieferich pairs are named after German mathematician Arthur Wieferich. Wieferich pairs play an important role in Preda Mihăilescu's 2002 proof of Mihăilescu's theorem (formerly known as Catalan's ... | Wieferich pair |
c_dntt52vw0hk8 | In mathematics, a Witt group of a field, named after Ernst Witt, is an abelian group whose elements are represented by symmetric bilinear forms over the field. | Witt–Grothendieck ring |
c_lb4iqubnjxfl | In mathematics, a Young symmetrizer is an element of the group algebra of the symmetric group, constructed in such a way that, for the homomorphism from the group algebra to the endomorphisms of a vector space V ⊗ n {\displaystyle V^{\otimes n}} obtained from the action of S n {\displaystyle S_{n}} on V ⊗ n {\displayst... | Young symmetrizer |
c_h0cw0djxzllv | In mathematics, a Young tableau (; plural: tableaux) is a combinatorial object useful in representation theory and Schubert calculus. It provides a convenient way to describe the group representations of the symmetric and general linear groups and to study their properties. Young tableaux were introduced by Alfred Youn... | Young tableau |
c_8n397fvct1c9 | In mathematics, a Zariski geometry consists of an abstract structure introduced by Ehud Hrushovski and Boris Zilber, in order to give a characterisation of the Zariski topology on an algebraic curve, and all its powers. The Zariski topology on a product of algebraic varieties is very rarely the product topology, but ri... | Zariski geometry |
c_oe3zmci5rfwc | In mathematics, a Zimmert set is a set of positive integers associated with the structure of quotients of hyperbolic three-space by a Bianchi group. | Zimmert set |
c_47b5p5sij4da | In mathematics, a Zinbiel algebra or dual Leibniz algebra is a module over a commutative ring with a bilinear product satisfying the defining identity: ( a ∘ b ) ∘ c = a ∘ ( b ∘ c ) + a ∘ ( c ∘ b ) . {\displaystyle (a\circ b)\circ c=a\circ (b\circ c)+a\circ (c\circ b).} Zinbiel algebras were introduced by Jean-Louis Lo... | Zinbiel algebra |
c_8rhzzz637537 | The name was proposed by Jean-Michel Lemaire as being "opposite" to Leibniz algebra.In any Zinbiel algebra, the symmetrised product a ⋆ b = a ∘ b + b ∘ a {\displaystyle a\star b=a\circ b+b\circ a} is associative. A Zinbiel algebra is the Koszul dual concept to a Leibniz algebra. The free Zinbiel algebra over V is the t... | Zinbiel algebra |
c_mp0jesdp6vwk | In mathematics, a Zorn ring is an alternative ring in which for every non-nilpotent x there exists an element y such that xy is a non-zero idempotent (Kaplansky 1968, pages 19, 25). Kaplansky (1951) named them after Max August Zorn, who studied a similar condition in (Zorn 1941). For associative rings, the definition o... | Zorn ring |
c_3fyigyq4k8hu | In mathematics, a Zuckerman functor is used to construct representations of real reductive Lie groups from representations of Levi subgroups. They were introduced by Gregg Zuckerman (1978). The Bernstein functor is closely related. | Zuckerman functor |
c_el5voiuuv9qx | In mathematics, a balanced matrix is a 0-1 matrix (a matrix where every entry is either zero or one) that does not contain any square submatrix of odd order having all row sums and all column sums equal to 2. Balanced matrices are studied in linear programming. The importance of balanced matrices comes from the fact th... | Balanced matrix |
c_ubu5ysflgrf1 | In mathematics, a ball is the solid figure bounded by a sphere; it is also called a solid sphere. It may be a closed ball (including the boundary points that constitute the sphere) or an open ball (excluding them). These concepts are defined not only in three-dimensional Euclidean space but also for lower and higher di... | 4-ball (mathematics) |
c_gtr9p5pp4sxw | Thus, for example, a ball in the Euclidean plane is the same thing as a disk, the area bounded by a circle. In Euclidean 3-space, a ball is taken to be the volume bounded by a 2-dimensional sphere. | 4-ball (mathematics) |
c_x1gta5vjho4v | In a one-dimensional space, a ball is a line segment. In other contexts, such as in Euclidean geometry and informal use, sphere is sometimes used to mean ball. In the field of topology the closed n {\displaystyle n} -dimensional ball is often denoted as B n {\displaystyle B^{n}} or D n {\displaystyle D^{n}} while the o... | 4-ball (mathematics) |
c_5m848l7fflcg | In mathematics, a band (also called idempotent semigroup) is a semigroup in which every element is idempotent (in other words equal to its own square). Bands were first studied and named by A. H. Clifford (1954). The lattice of varieties of bands was described independently in the early 1970s by Biryukov, Fennemore and... | Band (algebra) |
c_rf72q6xhafbi | In mathematics, a base (or basis; PL: bases) for the topology τ of a topological space (X, τ) is a family B {\displaystyle {\mathcal {B}}} of open subsets of X such that every open set of the topology is equal to the union of some sub-family of B {\displaystyle {\mathcal {B}}} . For example, the set of all open interva... | Countable base |
c_g9j8s922cods | Many important topological definitions such as continuity and convergence can be checked using only basic open sets instead of arbitrary open sets. Some topologies have a base of open sets with specific useful properties that may make checking such topological definitions easier. Not all families of subsets of a set X ... | Countable base |
c_g3bbobzfpa9y | Under some conditions detailed below, a family of subsets will form a base for a (unique) topology on X {\displaystyle X} , obtained by taking all possible unions of subfamilies. Such families of sets are very frequently used to define topologies. A weaker notion related to bases is that of a subbase for a topology. Ba... | Countable base |
c_mkrlme9qdc7f | In mathematics, a base-orderable matroid is a matroid that has the following additional property, related to the bases of the matroid. For any two bases A {\displaystyle A} and B {\displaystyle B} there exists a feasible exchange bijection, defined as a bijection f {\displaystyle f} from A {\displaystyle A} to B {\disp... | Base-orderable matroid |
c_e9uu0wumxuxw | In mathematics, a basic algebraic operation is any one of the common operations of arithmetic, which include addition, subtraction, multiplication, division, raising to a whole number power, and taking roots (fractional power). These operations may be performed on numbers, in which case they are often called arithmetic... | Algebraic operation |
c_hy4yvo4p8gs0 | An algebraic operation may also be defined simply as a function from a Cartesian power of a set to the same set.The term algebraic operation may also be used for operations that may be defined by compounding basic algebraic operations, such as the dot product. In calculus and mathematical analysis, algebraic operation ... | Algebraic operation |
c_ix3myd84re2f | In mathematics, a basic semialgebraic set is a set defined by polynomial equalities and polynomial inequalities, and a semialgebraic set is a finite union of basic semialgebraic sets. A semialgebraic function is a function with a semialgebraic graph. Such sets and functions are mainly studied in real algebraic geometry... | Semi-algebraic sets |
c_j454flcwzvze | In mathematics, a basis function is an element of a particular basis for a function space. Every function in the function space can be represented as a linear combination of basis functions, just as every vector in a vector space can be represented as a linear combination of basis vectors. In numerical analysis and app... | Blending function |
c_5rhhreklez8p | In mathematics, a basis of a matroid is a maximal independent set of the matroid—that is, an independent set that is not contained in any other independent set. | Basis of a matroid |
c_y2ktqycw1g2r | In mathematics, a bi-directional delay line is a numerical analysis technique used in computer simulation for solving ordinary differential equations by converting them to hyperbolic equations. In this way an explicit solution scheme is obtained with highly robust numerical properties. It was introduced by Auslander in... | Bi-directional delay line |
c_30287krpg3cz | It was then found that it could be used as an efficient numerical technique for numerically insulating different parts of a simulation model in each times step. It is used in the HOPSAN simulation package (Krus et al. 1990). It is also known as the Transmission Line Modelling (TLM) from an independent development by Jo... | Bi-directional delay line |
c_63c90h6bck8u | In mathematics, a bialgebra over a field K is a vector space over K which is both a unital associative algebra and a counital coassociative coalgebra. The algebraic and coalgebraic structures are made compatible with a few more axioms. Specifically, the comultiplication and the counit are both unital algebra homomorphi... | Bialgebra |
c_oqo0spwvtj8k | Similar bialgebras are related by bialgebra homomorphisms. A bialgebra homomorphism is a linear map that is both an algebra and a coalgebra homomorphism. As reflected in the symmetry of the commutative diagrams, the definition of bialgebra is self-dual, so if one can define a dual of B (which is always possible if B is... | Bialgebra |
c_cg6h4kv9cw5f | In mathematics, a biased graph is a graph with a list of distinguished circles (edge sets of simple cycles), such that if two circles in the list are contained in a theta graph, then the third circle of the theta graph is also in the list. A biased graph is a generalization of the combinatorial essentials of a gain gra... | Biased graph |
c_4jdpk7c01u0e | For instance, a circle belonging to B is balanced and one that does not belong to B is unbalanced. Biased graphs are interesting mostly because of their matroids, but also because of their connection with multiary quasigroups. See below. | Biased graph |
c_d4vs0mik86ab | In mathematics, a bicategory (or a weak 2-category) is a concept in category theory used to extend the notion of category to handle the cases where the composition of morphisms is not (strictly) associative, but only associative up to an isomorphism. The notion was introduced in 1967 by Jean Bénabou. Bicategories may b... | Bicategory |
c_2ilm61giq1ft | In mathematics, a bidiagonal matrix is a banded matrix with non-zero entries along the main diagonal and either the diagonal above or the diagonal below. This means there are exactly two non-zero diagonals in the matrix. When the diagonal above the main diagonal has the non-zero entries the matrix is upper bidiagonal. | Bidiagonal matrix |
c_4lmzi7buwc7a | When the diagonal below the main diagonal has the non-zero entries the matrix is lower bidiagonal. For example, the following matrix is upper bidiagonal: ( 1 4 0 0 0 4 1 0 0 0 3 4 0 0 0 3 ) {\displaystyle {\begin{pmatrix}1&4&0&0\\0&4&1&0\\0&0&3&4\\0&0&0&3\\\end{pmatrix}}} and the following matrix is lower bidiagonal: (... | Bidiagonal matrix |
c_3ek1g2hp2wav | In mathematics, a bijection, also known as a bijective function, one-to-one correspondence, or invertible function, is a function between the elements of two sets, where each element of one set is paired with exactly one element of the other set, and each element of the other set is paired with exactly one element of t... | Bijective relation |
c_d16uwvis2f73 | For infinite sets, the picture is more complicated, leading to the concept of cardinal number—a way to distinguish the various sizes of infinite sets. A bijective function from a set to itself is also called a permutation, and the set of all permutations of a set forms the symmetric group. Bijective functions are essen... | Bijective relation |
c_605osq3ugiq1 | In mathematics, a bilinear form is a bilinear map V × V → K on a vector space V (the elements of which are called vectors) over a field K (the elements of which are called scalars). In other words, a bilinear form is a function B: V × V → K that is linear in each argument separately: B(u + v, w) = B(u, w) + B(v, w) and... | Radical of a quadratic space |
c_oe6i6xrmwg7b | In mathematics, a bilinear map is a function combining elements of two vector spaces to yield an element of a third vector space, and is linear in each of its arguments. Matrix multiplication is an example. | Separate continuity |
c_vo3wz8tta3h6 | In mathematics, a bilinear program is a nonlinear optimization problem whose objective or constraint functions are bilinear. An example is the pooling problem. | Bilinear program |
c_gg2t7buuvll4 | In mathematics, a binary function (also called bivariate function, or function of two variables) is a function that takes two inputs. Precisely stated, a function f {\displaystyle f} is binary if there exists sets X , Y , Z {\displaystyle X,Y,Z} such that f: X × Y → Z {\displaystyle \,f\colon X\times Y\rightarrow Z} wh... | Binary functions |
c_q0pftw3ip655 | In mathematics, a binary operation is commutative if changing the order of the operands does not change the result. It is a fundamental property of many binary operations, and many mathematical proofs depend on it. Most familiar as the name of the property that says something like "3 + 4 = 4 + 3" or "2 × 5 = 5 × 2", th... | Commutative operation |
c_ucw3j772iie2 | The idea that simple operations, such as the multiplication and addition of numbers, are commutative was for many years implicitly assumed. Thus, this property was not named until the 19th century, when mathematics started to become formalized. A similar property exists for binary relations; a binary relation is said t... | Commutative operation |
c_zpbqtuvka3l5 | In mathematics, a binary operation or dyadic operation is a rule for combining two elements (called operands) to produce another element. More formally, a binary operation is an operation of arity two. More specifically, an internal binary operation on a set is a binary operation whose two domains and the codomain are ... | Binary operation |
c_5b36ku9g6tcv | Other examples are readily found in different areas of mathematics, such as vector addition, matrix multiplication, and conjugation in groups. An operation of arity two that involves several sets is sometimes also called a binary operation. For example, scalar multiplication of vector spaces takes a scalar and a vector... | Binary operation |
c_9momlracah68 | In mathematics, a binary quadratic form is a quadratic homogeneous polynomial in two variables q ( x , y ) = a x 2 + b x y + c y 2 , {\displaystyle q(x,y)=ax^{2}+bxy+cy^{2},\,} where a, b, c are the coefficients. When the coefficients can be arbitrary complex numbers, most results are not specific to the case of two va... | Binary quadratic form |
c_ebvnx6dzerzi | This choice is motivated by their status as the driving force behind the development of algebraic number theory. Since the late nineteenth century, binary quadratic forms have given up their preeminence in algebraic number theory to quadratic and more general number fields, but advances specific to binary quadratic for... | Binary quadratic form |
c_cewz78y4gpj6 | x 2 + y 2 , x 2 + 2 y 2 , x 2 − 3 y 2 {\displaystyle x^{2}+y^{2},x^{2}+2y^{2},x^{2}-3y^{2}} and so on are quadratic forms, and the theory of quadratic forms gives a unified way of looking at and proving these theorems. Another instance of quadratic forms is Pell's equation x 2 − n y 2 = 1 {\displaystyle x^{2}-ny^{2}=1}... | Binary quadratic form |
c_xghl81qv53ln | In mathematics, a binary relation R is called well-founded (or wellfounded or foundational) on a class X if every non-empty subset S ⊆ X has a minimal element with respect to R, that is, an element m ∈ S not related by s R m (for instance, "s is not smaller than m") for any s ∈ S. In other words, a relation is well fou... | Well-founded order |
c_xfqdpw7g2o8v | In set theory, a set x is called a well-founded set if the set membership relation is well-founded on the transitive closure of x. The axiom of regularity, which is one of the axioms of Zermelo–Fraenkel set theory, asserts that all sets are well-founded. A relation R is converse well-founded, upwards well-founded or No... | Well-founded order |
c_oe22u08a25wu | In mathematics, a binary relation R on a set X is reflexive if it relates every element of X to itself.An example of a reflexive relation is the relation "is equal to" on the set of real numbers, since every real number is equal to itself. A reflexive relation is said to have the reflexive property or is said to posses... | Irreflexive kernel |
c_0cxpzhxxxwd0 | In mathematics, a binary relation R {\displaystyle R} on a set X {\displaystyle X} is antisymmetric if there is no pair of distinct elements of X {\displaystyle X} each of which is related by R {\displaystyle R} to the other. More formally, R {\displaystyle R} is antisymmetric precisely if for all a , b ∈ X , {\display... | Anti-symmetric relation |
c_mypfax4iwaqw | In mathematics, a binary relation R ⊆ X×Y between two sets X and Y is total (or left total) if the source set X equals the domain {x: there is a y with xRy }. Conversely, R is called right total if Y equals the range {y: there is an x with xRy }. When f: X → Y is a function, the domain of f is all of X, hence f is a to... | Left-total relation |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.