id stringlengths 14 14 | text stringlengths 9 3.55k | source stringlengths 1 250 |
|---|---|---|
c_ojockvof030a | In mathematics, a Costas array can be regarded geometrically as a set of n points, each at the center of a square in an n×n square tiling such that each row or column contains only one point, and all of the n(n − 1)/2 displacement vectors between each pair of dots are distinct. This results in an ideal "thumbtack" auto... | Costas array |
c_ie70dpx2wjig | Costas arrays are named after John P. Costas, who first wrote about them in a 1965 technical report. Independently, Edgar Gilbert also wrote about them in the same year, publishing what is now known as the logarithmic Welch method of constructing Costas arrays. The general enumeration of Costas arrays is an open proble... | Costas array |
c_wltm8tva84s7 | In mathematics, a Coulomb wave function is a solution of the Coulomb wave equation, named after Charles-Augustin de Coulomb. They are used to describe the behavior of charged particles in a Coulomb potential and can be written in terms of confluent hypergeometric functions or Whittaker functions of imaginary argument. | Coulomb functions |
c_olm4sq39qhvt | In mathematics, a Countryman line (named after Roger Simmons Countryman Jr.) is an uncountable linear ordering whose square is the union of countably many chains. The existence of Countryman lines was first proven by Shelah. Shelah also conjectured that, assuming PFA, every Aronszajn line contains a Countryman line. Th... | Countryman line |
c_kl9uvq5sszql | In mathematics, a Coxeter group, named after H. S. M. Coxeter, is an abstract group that admits a formal description in terms of reflections (or kaleidoscopic mirrors). Indeed, the finite Coxeter groups are precisely the finite Euclidean reflection groups; the symmetry groups of regular polyhedra are an example. Howeve... | Coxeter system |
c_qz6aq01gy09a | Coxeter groups find applications in many areas of mathematics. Examples of finite Coxeter groups include the symmetry groups of regular polytopes, and the Weyl groups of simple Lie algebras. Examples of infinite Coxeter groups include the triangle groups corresponding to regular tessellations of the Euclidean plane and... | Coxeter system |
c_pp6liw8vvkpu | In mathematics, a Cullen number is a member of the integer sequence C n = n ⋅ 2 n + 1 {\displaystyle C_{n}=n\cdot 2^{n}+1} (where n {\displaystyle n} is a natural number). Cullen numbers were first studied by James Cullen in 1905. The numbers are special cases of Proth numbers. | Cullen number |
c_2m3v3ov5xumm | In mathematics, a Cunningham chain is a certain sequence of prime numbers. Cunningham chains are named after mathematician A. J. C. Cunningham. They are also called chains of nearly doubled primes. | Cunningham chain |
c_220mc6bf0qhl | In mathematics, a D-module is a module over a ring D of differential operators. The major interest of such D-modules is as an approach to the theory of linear partial differential equations. Since around 1970, D-module theory has been built up, mainly as a response to the ideas of Mikio Sato on algebraic analysis, and ... | D-module |
c_3pwefzebwram | The methods of D-module theory have always been drawn from sheaf theory and other techniques with inspiration from the work of Alexander Grothendieck in algebraic geometry. The approach is global in character, and differs from the functional analysis techniques traditionally used to study differential operators. The st... | D-module |
c_26nvzth4d2p9 | In mathematics, a De Morgan algebra (named after Augustus De Morgan, a British mathematician and logician) is a structure A = (A, ∨, ∧, 0, 1, ¬) such that: (A, ∨, ∧, 0, 1) is a bounded distributive lattice, and ¬ is a De Morgan involution: ¬(x ∧ y) = ¬x ∨ ¬y and ¬¬x = x. (i.e. an involution that additionally satisfies ... | Kleene algebra (with involution) |
c_jmm3say44anv | Thus ¬ is a dual automorphism of (A, ∨, ∧, 0, 1). If the lattice is defined in terms of the order instead, i.e. (A, ≤) is a bounded partial order with a least upper bound and greatest lower bound for every pair of elements, and the meet and join operations so defined satisfy the distributive law, then the complementati... | Kleene algebra (with involution) |
c_v5k3c7c09sg8 | (i-lattice being an abbreviation for lattice with involution.) They have been further studied in the Argentinian algebraic logic school of Antonio Monteiro.De Morgan algebras are important for the study of the mathematical aspects of fuzzy logic. The standard fuzzy algebra F = (, max(x, y), min(x, y), 0, 1, 1 − x) is a... | Kleene algebra (with involution) |
c_4ogalsqonq8a | In mathematics, a Delannoy number D {\displaystyle D} describes the number of paths from the southwest corner (0, 0) of a rectangular grid to the northeast corner (m, n), using only single steps north, northeast, or east. The Delannoy numbers are named after French army officer and amateur mathematician Henri Delannoy.... | Delannoy number |
c_ofbv1l03s5h7 | In mathematics, a Delzant polytope is a convex polytope in R n {\displaystyle \mathbb {R} ^{n}} such for each vertex v {\displaystyle v} , exactly n {\displaystyle n} edges meet at v {\displaystyle v} , and these edges form a collection of vectors that form a Z {\displaystyle \mathbb {Z} } -basis of Z n {\displaystyle ... | Delzant's theorem |
c_tbijk5uc1ovs | In mathematics, a Demazure module, introduced by Demazure (1974a, 1974b), is a submodule of a finite-dimensional representation generated by an extremal weight space under the action of a Borel subalgebra. The Demazure character formula, introduced by Demazure (1974b, theorem 2), gives the characters of Demazure module... | Demazure module |
c_96twyi6vu0e3 | In mathematics, a Diophantine equation is an equation of the form P(x1, ..., xj, y1, ..., yk) = 0 (usually abbreviated P(x, y) = 0) where P(x, y) is a polynomial with integer coefficients, where x1, ..., xj indicate parameters and y1, ..., yk indicate unknowns. A Diophantine set is a subset S of N j {\displaystyle \mat... | Matiyasevich's theorem |
c_ry8g7xgiwm1y | The use of natural numbers both in S and the existential quantification merely reflects the usual applications in computability and model theory. It does not matter whether natural numbers refer to the set of nonnegative integers or positive integers since the two definitions for Diophantine set are equivalent. We can ... | Matiyasevich's theorem |
c_mfrcun5fqny1 | Also it is sufficient to assume P is a polynomial over Q {\displaystyle \mathbb {Q} } and multiply P by the appropriate denominators to yield integer coefficients. However, whether quantification over rationals can also be substituted for quantification over the integers is a notoriously hard open problem.The MRDP theo... | Matiyasevich's theorem |
c_daeuvml1ebvh | This means that the concept of general Diophantine set, apparently belonging to number theory, can be taken rather in logical or recursion-theoretic terms. This is far from obvious, however, and represented the culmination of some decades of work. Matiyasevich's completion of the MRDP theorem settled Hilbert's tenth pr... | Matiyasevich's theorem |
c_wmshpqqfeici | In mathematics, a Diophantine equation is an equation, typically a polynomial equation in two or more unknowns with integer coefficients, such that the only solutions of interest are the integer ones. A linear Diophantine equation equates to a constant the sum of two or more monomials, each of degree one. An exponentia... | Diophantine equation |
c_19qdyy5kril0 | Diophantine problems have fewer equations than unknowns and involve finding integers that solve simultaneously all equations. As such systems of equations define algebraic curves, algebraic surfaces, or, more generally, algebraic sets, their study is a part of algebraic geometry that is called Diophantine geometry. The... | Diophantine equation |
c_kwn9p32esek4 | In mathematics, a Dirac comb (also known as sha function, impulse train or sampling function) is a periodic function with the formula for some given period T {\displaystyle T} . Here t is a real variable and the sum extends over all integers k. The Dirac delta function δ {\displaystyle \delta } and the Dirac comb are t... | Dirac comb |
c_0tn3htog0evv | This implies Because the Dirac comb function is periodic, it can be represented as a Fourier series based on the Dirichlet kernel: The Dirac comb function allows one to represent both continuous and discrete phenomena, such as sampling and aliasing, in a single framework of continuous Fourier analysis on tempered distr... | Dirac comb |
c_sapfndxcuop4 | In mathematics, a Dirac measure assigns a size to a set based solely on whether it contains a fixed element x or not. It is one way of formalizing the idea of the Dirac delta function, an important tool in physics and other technical fields. | Dirac measure |
c_o6n03f8s0ymv | In mathematics, a Dirac spectrum, named after Paul Dirac, is the spectrum of eigenvalues of a Dirac operator on a Riemannian manifold with a spin structure. The isospectral problem for the Dirac spectrum asks whether two Riemannian spin manifolds have identical spectra. The Dirac spectrum depends on the spin structure ... | Dirac spectrum |
c_bmq8f6zwgmeo | In mathematics, a Dirichlet L-series is a function of the form L ( s , χ ) = ∑ n = 1 ∞ χ ( n ) n s . {\displaystyle L(s,\chi )=\sum _{n=1}^{\infty }{\frac {\chi (n)}{n^{s}}}.} where χ {\displaystyle \chi } is a Dirichlet character and s a complex variable with real part greater than 1. | Dirichlet L-function |
c_2r462kaia6e7 | It is a special case of a Dirichlet series. By analytic continuation, it can be extended to a meromorphic function on the whole complex plane, and is then called a Dirichlet L-function and also denoted L(s, χ). These functions are named after Peter Gustav Lejeune Dirichlet who introduced them in (Dirichlet 1837) to pro... | Dirichlet L-function |
c_1kncwhnj7iox | In the course of the proof, Dirichlet shows that L(s, χ) is non-zero at s = 1. Moreover, if χ is principal, then the corresponding Dirichlet L-function has a simple pole at s = 1. Otherwise, the L-function is entire. | Dirichlet L-function |
c_61i7zps53ycz | In mathematics, a Dirichlet algebra is a particular type of algebra associated to a compact Hausdorff space X. It is a closed subalgebra of C(X), the uniform algebra of bounded continuous functions on X, whose real parts are dense in the algebra of bounded continuous real functions on X. The concept was introduced by A... | Dirichlet algebra |
c_e6uz06chi7nj | In mathematics, a Dirichlet problem is the problem of finding a function which solves a specified partial differential equation (PDE) in the interior of a given region that takes prescribed values on the boundary of the region. The Dirichlet problem can be solved for many PDEs, although originally it was posed for Lapl... | Dirichlet's problem |
c_fxa3woz03a7i | In mathematics, a Dirichlet series is any series of the form where s is complex, and a n {\displaystyle a_{n}} is a complex sequence. It is a special case of general Dirichlet series. Dirichlet series play a variety of important roles in analytic number theory. The most usually seen definition of the Riemann zeta funct... | Formal Dirichlet series |
c_6x6us22vjxxu | In mathematics, a Ditkin set, introduced by (Ditkin 1939), is a closed subset of the circle such that a function f vanishing on the set can be approximated by functions φnf with φ vanishing in a neighborhood of the set. | Ditkin set |
c_g9l9jwofecxj | In mathematics, a Dold manifold is one of the manifolds P ( m , n ) = ( S m × C P n ) / τ {\displaystyle P(m,n)=(S^{m}\times \mathbb {CP} ^{n})/\tau } , where τ {\displaystyle \tau } is the involution that acts as −1 on the m-sphere S m {\displaystyle S^{m}} and as complex conjugation on the complex projective space C ... | Dold manifold |
c_xrto23qov8mi | In mathematics, a Drinfeld module (or elliptic module) is roughly a special kind of module over a ring of functions on a curve over a finite field, generalizing the Carlitz module. Loosely speaking, they provide a function field analogue of complex multiplication theory. A shtuka (also called F-sheaf or chtouca) is a s... | Drinfeld module |
c_fku1lu8z2psp | He later invented shtukas and used shtukas of rank 2 to prove the remaining cases of the Langlands conjectures for GL2. Laurent Lafforgue proved the Langlands conjectures for GLn of a function field by studying the moduli stack of shtukas of rank n. "Shtuka" is a Russian word штука meaning "a single copy", which comes ... | Drinfeld module |
c_tnvh7wj5ef4m | In mathematics, a Dupin cyclide or cyclide of Dupin is any geometric inversion of a standard torus, cylinder or double cone. In particular, these latter are themselves examples of Dupin cyclides. They were discovered c. | Dupin cyclide |
c_2mhpbzh6eb05 | 1802 by (and named after) Charles Dupin, while he was still a student at the École polytechnique following Gaspard Monge's lectures. The key property of a Dupin cyclide is that it is a channel surface (envelope of a one-parameter family of spheres) in two different ways. This property means that Dupin cyclides are natu... | Dupin cyclide |
c_9fvtr8c1289k | Dupin cyclides are often simply known as cyclides, but the latter term is also used to refer to a more general class of quartic surfaces which are important in the theory of separation of variables for the Laplace equation in three dimensions. Dupin cyclides were investigated not only by Dupin, but also by A. Cayley, J... | Dupin cyclide |
c_7hqvhqtmtke0 | In mathematics, a Euclidean distance matrix is an n×n matrix representing the spacing of a set of n points in Euclidean space. For points x 1 , x 2 , … , x n {\displaystyle x_{1},x_{2},\ldots ,x_{n}} in k-dimensional space ℝk, the elements of their Euclidean distance matrix A are given by squares of distances between t... | Euclidean distance matrix |
c_o5pt9crys9ba | However, in the Euclidean case, squares of distances are used to avoid computing square roots and to simplify relevant theorems and algorithms. Euclidean distance matrices are closely related to Gram matrices (matrices of dot products, describing norms of vectors and angles between them). The latter are easily analyzed... | Euclidean distance matrix |
c_65v6ez40j8da | This allows to characterize Euclidean distance matrices and recover the points x 1 , x 2 , … , x n {\displaystyle x_{1},x_{2},\ldots ,x_{n}} that realize it. A realization, if it exists, is unique up to rigid transformations, i.e. distance-preserving transformations of Euclidean space (rotations, reflections, translati... | Euclidean distance matrix |
c_b7ic3o7vyvcp | The goal may be to visualize such data by points in Euclidean space whose distance matrix approximates a given dissimilarity matrix as well as possible — this is known as multidimensional scaling. Alternatively, given two sets of data already represented by points in Euclidean space, one may ask how similar they are in... | Euclidean distance matrix |
c_7w22rpk74wa1 | In mathematics, a Euclidean field is an ordered field K for which every non-negative element is a square: that is, x ≥ 0 in K implies that x = y2 for some y in K. The constructible numbers form a Euclidean field. It is the smallest Euclidean field, as every Euclidean field contains it as an ordered subfield. In other w... | Euclidean field |
c_wm2inhy8egei | In mathematics, a Euclidean group is the group of (Euclidean) isometries of a Euclidean space E n {\displaystyle \mathbb {E} ^{n}} ; that is, the transformations of that space that preserve the Euclidean distance between any two points (also called Euclidean transformations). The group depends only on the dimension n o... | Indirect isometry |
c_h480bn7kaiv8 | A Euclidean isometry can be direct or indirect, depending on whether it preserves the handedness of figures. The direct Euclidean isometries form a subgroup, the special Euclidean group, often denoted SE(n), whose elements are called rigid motions or Euclidean motions. They comprise arbitrary combinations of translatio... | Indirect isometry |
c_srhq25nsymg2 | In mathematics, a Euclidean plane is a Euclidean space of dimension two, denoted E2. It is a geometric space in which two real numbers are required to determine the position of each point. It is an affine space, which includes in particular the concept of parallel lines. It has also metrical properties induced by a dis... | Euclidean plane |
c_sqp8kgdh0ldq | In mathematics, a Fatou–Bieberbach domain is a proper subdomain of C n {\displaystyle \mathbb {C} ^{n}} , biholomorphically equivalent to C n {\displaystyle \mathbb {C} ^{n}} . That is, an open set Ω ⊊ C n {\displaystyle \Omega \subsetneq \mathbb {C} ^{n}} is called a Fatou–Bieberbach domain if there exists a bijective... | Fatou–Bieberbach domain |
c_eekkusjmsjsq | In mathematics, a Fedosov manifold is a symplectic manifold with a compatible torsion-free connection, that is, a triple (M, ω, ∇), where (M, ω) is a symplectic manifold (that is, ω {\displaystyle \omega } is a symplectic form, a non-degenerate closed exterior 2-form, on a C ∞ {\displaystyle C^{\infty }} -manifold M), ... | Fedosov manifold |
c_8k2u5h19cctl | In other words, the symplectic form is parallel with respect to the connection, i.e., its covariant derivative vanishes.) Note that every symplectic manifold admits a symplectic torsion-free connection. Cover the manifold with Darboux charts and on each chart define a connection ∇ with Christoffel symbol Γ j k i = 0 {\... | Fedosov manifold |
c_nwwrsb010p7r | In mathematics, a Fekete polynomial is a polynomial f p ( t ) := ∑ a = 0 p − 1 ( a p ) t a {\displaystyle f_{p}(t):=\sum _{a=0}^{p-1}\left({\frac {a}{p}}\right)t^{a}\,} where ( ⋅ p ) {\displaystyle \left({\frac {\cdot }{p}}\right)\,} is the Legendre symbol modulo some integer p > 1. These polynomials were known in nine... | Fekete polynomial |
c_4mk3np189b5p | In mathematics, a Feller-continuous process is a continuous-time stochastic process for which the expected value of suitable statistics of the process at a given time in the future depend continuously on the initial condition of the process. The concept is named after Croatian-American mathematician William Feller. | Feller-continuous process |
c_6r5mvr3qhn1h | In mathematics, a Fermat number, named after Pierre de Fermat, the first known to have studied them, is a positive integer of the form F n = 2 2 n + 1 , {\displaystyle F_{n}=2^{2^{n}}+1,} where n is a non-negative integer. The first few Fermat numbers are: 3, 5, 17, 257, 65537, 4294967297, 18446744073709551617, ... (se... | Fermat numbers |
c_bs8012pjf8tu | In mathematics, a Fermat quintic threefold is a special quintic threefold, in other words a degree 5, dimension 3 hypersurface in 4-dimensional complex projective space, given by the equation V 5 + W 5 + X 5 + Y 5 + Z 5 = 0 {\displaystyle V^{5}+W^{5}+X^{5}+Y^{5}+Z^{5}=0} .This threefold, so named after Pierre de Fermat... | Fermat quintic threefold |
c_cutmxl62bckk | In mathematics, a Ford circle is a circle in the Euclidean plane, in a family of circles that are all tangent to the x {\displaystyle x} -axis at rational points. For each rational number p / q {\displaystyle p/q} , expressed in lowest terms, there is a Ford circle whose center is at the point ( p / q , 1 / ( 2 q 2 ) )... | Ford circle |
c_rpq02dexs5u5 | In mathematics, a Fredholm kernel is a certain type of a kernel on a Banach space, associated with nuclear operators on the Banach space. They are an abstraction of the idea of the Fredholm integral equation and the Fredholm operator, and are one of the objects of study in Fredholm theory. Fredholm kernels are named in... | Fredholm kernel |
c_z5eochaocc2y | In mathematics, a Frey curve or Frey–Hellegouarch curve is the elliptic curve y 2 = x ( x − a ℓ ) ( x + b ℓ ) {\displaystyle y^{2}=x(x-a^{\ell })(x+b^{\ell })} associated with a (hypothetical) solution of Fermat's equation a ℓ + b ℓ = c ℓ . {\displaystyle a^{\ell }+b^{\ell }=c^{\ell }.} The curve is named after Gerhard... | Frey curve |
c_7dpcmvjwrfli | In mathematics, a Fricke involution is the involution of the modular curve X0(N) given by τ → –1/Nτ. It is named after Robert Fricke. The Fricke involution also acts on other objects associated with the modular curve, such as spaces of modular forms and the Jacobian J0(N) of the modular curve. | Fricke involution |
c_2tdqc161pw6x | In mathematics, a Frink ideal, introduced by Orrin Frink, is a certain kind of subset of a partially ordered set. | Frink ideal |
c_rsbq6ivcmdtm | In mathematics, a Frobenius group is a transitive permutation group on a finite set, such that no non-trivial element fixes more than one point and some non-trivial element fixes a point. They are named after F. G. Frobenius. | Frobenius kernel |
c_8oc48snj58iw | In mathematics, a Frobenius splitting, introduced by Mehta and Ramanathan (1985), is a splitting of the injective morphism OX→F*OX from a structure sheaf OX of a characteristic p > 0 variety X to its image F*OX under the Frobenius endomorphism F*. Brion & Kumar (2005) give a detailed discussion of Frobenius splittings.... | Frobenius splitting |
c_9jwo0rkwii09 | In mathematics, a Fréchet surface is an equivalence class of parametrized surfaces in a metric space. In other words, a Fréchet surface is a way of thinking about surfaces independently of how they are "written down" (parametrized). The concept is named after the French mathematician Maurice Fréchet. | Fréchet surface |
c_4ydnsjhv6co4 | In mathematics, a Fuchsian group is a discrete subgroup of PSL(2,R). The group PSL(2,R) can be regarded equivalently as a group of orientation-preserving isometries of the hyperbolic plane, or conformal transformations of the unit disc, or conformal transformations of the upper half plane, so a Fuchsian group can be re... | Fuchsian group |
c_edpkoibcbq21 | In this case, the group may be called the Fuchsian group of the surface. In some sense, Fuchsian groups do for non-Euclidean geometry what crystallographic groups do for Euclidean geometry. Some Escher graphics are based on them (for the disc model of hyperbolic geometry). General Fuchsian groups were first studied by ... | Fuchsian group |
c_ji8pihro0hcb | In mathematics, a Fuchsian model is a representation of a hyperbolic Riemann surface R as a quotient of the upper half-plane H by a Fuchsian group. Every hyperbolic Riemann surface admits such a representation. The concept is named after Lazarus Fuchs. | Fuchsian model |
c_jkd3jlbxft3z | In mathematics, a Følner sequence for a group is a sequence of sets satisfying a particular condition. If a group has a Følner sequence with respect to its action on itself, the group is amenable. A more general notion of Følner nets can be defined analogously, and is suited for the study of uncountable groups. Følner ... | Følner sequence |
c_8vv27aos4v1x | In mathematics, a G-measure is a measure μ {\displaystyle \mu } that can be represented as the weak-∗ limit of a sequence of measurable functions G = ( G n ) n = 1 ∞ {\displaystyle G=\left(G_{n}\right)_{n=1}^{\infty }} . A classic example is the Riesz product G n ( t ) = ∏ k = 1 n ( 1 + r cos ( 2 π m k t ) ) {\displa... | G-measure |
c_caoc6l2ig2dr | In mathematics, a GCD domain is an integral domain R with the property that any two elements have a greatest common divisor (GCD); i.e., there is a unique minimal principal ideal containing the ideal generated by two given elements. Equivalently, any two elements of R have a least common multiple (LCM).A GCD domain gen... | GCD domain |
c_3sntfxfo0wfa | In mathematics, a Galois extension is an algebraic field extension E/F that is normal and separable; or equivalently, E/F is algebraic, and the field fixed by the automorphism group Aut(E/F) is precisely the base field F. The significance of being a Galois extension is that the extension has a Galois group and obeys th... | Galois field extension |
c_rc8tof5bb04f | In mathematics, a Galois module is a G-module, with G being the Galois group of some extension of fields. The term Galois representation is frequently used when the G-module is a vector space over a field or a free module over a ring in representation theory, but can also be used as a synonym for G-module. The study of... | Normal integral basis |
c_0gmwokxbn8us | In mathematics, a Garside element is an element of an algebraic structure such as a monoid that has several desirable properties. Formally, if M is a monoid, then an element Δ of M is said to be a Garside element if the set of all right divisors of Δ, { r ∈ M ∣ for some x ∈ M , Δ = x r } , {\displaystyle \{r\in M\mid {... | Garside element |
c_yco7pvepqpam | In mathematics, a Gaussian function, often simply referred to as a Gaussian, is a function of the base form and with parametric extension for arbitrary real constants a, b and non-zero c. It is named after the mathematician Carl Friedrich Gauss. The graph of a Gaussian is a characteristic symmetric "bell curve" shape. ... | Error curve |
c_z384ywtw5e6r | In mathematics, a Gaussian rational number is a complex number of the form p + qi, where p and q are both rational numbers. The set of all Gaussian rationals forms the Gaussian rational field, denoted Q(i), obtained by adjoining the imaginary number i to the field of rationals Q. | Gaussian rational |
c_cztytxcq1iw1 | In mathematics, a Gelfand pair is a pair (G,K) consisting of a group G and a subgroup K (called an Euler subgroup of G) that satisfies a certain property on restricted representations. The theory of Gelfand pairs is closely related to the topic of spherical functions in the classical theory of special functions, and to... | Gelfand pair |
c_g9694hzodljn | In mathematics, a Gelfand ring is an associative ring R with identity such that if I and J are distinct right ideals then there are elements i and j such that iRj=0, i is not in I, and j is not in J. Mulvey (1979) introduced them as rings for which one could prove a generalization of Gelfand duality, and named them aft... | Gelfand ring |
c_fm8w57ve91x0 | In mathematics, a Generalized Clifford algebra (GCA) is a unital associative algebra that generalizes the Clifford algebra, and goes back to the work of Hermann Weyl, who utilized and formalized these clock-and-shift operators introduced by J. J. Sylvester (1882), and organized by Cartan (1898) and Schwinger.Clock and ... | Generalized Clifford algebra |
c_jva8qapn5g4j | In mathematics, a Goldman domain or G-domain is an integral domain A whose field of fractions is a finitely generated algebra over A. They are named after Oscar Goldman. An overring (i.e., an intermediate ring lying between the ring and its field of fractions) of a Goldman domain is again a Goldman domain. There exists... | Goldman domain |
c_bm8l2wt3vv9a | A Goldman ideal is thus prime, but not necessarily maximal. In fact, a commutative ring is a Jacobson ring if and only if every Goldman ideal in it is maximal. The notion of a Goldman ideal can be used to give a slightly sharpened characterization of a radical of an ideal: the radical of an ideal I is the intersection ... | Goldman domain |
c_6g1zefjf9mem | In mathematics, a Golomb ruler is a set of marks at integer positions along a ruler such that no two pairs of marks are the same distance apart. The number of marks on the ruler is its order, and the largest distance between two of its marks is its length. Translation and reflection of a Golomb ruler are considered tri... | Golomb ruler |
c_dtux3tvrc2vg | The Golomb ruler was named for Solomon W. Golomb and discovered independently by Sidon (1932) and Babcock (1953). Sophie Piccard also published early research on these sets, in 1939, stating as a theorem the claim that two Golomb rulers with the same distance set must be congruent. This turned out to be false for six-p... | Golomb ruler |
c_gu9z9lqwzjm0 | It has been proved that no perfect Golomb ruler exists for five or more marks. A Golomb ruler is optimal if no shorter Golomb ruler of the same order exists. Creating Golomb rulers is easy, but proving the optimal Golomb ruler (or rulers) for a specified order is computationally very challenging. | Golomb ruler |
c_1az8bpmw4f0l | Distributed.net has completed distributed massively parallel searches for optimal order-24 through order-28 Golomb rulers, each time confirming the suspected candidate ruler.Currently, the complexity of finding optimal Golomb rulers (OGRs) of arbitrary order n (where n is given in unary) is unknown. In the past there w... | Golomb ruler |
c_0eilwftc94zt | In mathematics, a Grassmann–Cayley algebra is the exterior algebra with an additional product, which may be called the shuffle product or the regressive product. It is the most general structure in which projective properties are expressed in a coordinate-free way. The technique is based on work by German mathematician... | Grassmann–Cayley algebra |
c_s2b8243snxlh | In mathematics, a Green's function is the impulse response of an inhomogeneous linear differential operator defined on a domain with specified initial conditions or boundary conditions. This means that if L {\displaystyle \operatorname {L} } is the linear differential operator, then the Green's function G {\displaystyl... | Green’s function |
c_r8emtmp0zgze | In mathematics, a Gregory number, named after James Gregory, is a real number of the form: G x = ∑ i = 0 ∞ ( − 1 ) i 1 ( 2 i + 1 ) x 2 i + 1 {\displaystyle G_{x}=\sum _{i=0}^{\infty }(-1)^{i}{\frac {1}{(2i+1)x^{2i+1}}}} where x is any rational number greater or equal to 1. Considering the power series expansion for arc... | Gregory number |
c_xrcuy9x89nzx | In mathematics, a Grothendieck category is a certain kind of abelian category, introduced in Alexander Grothendieck's Tôhoku paper of 1957 in order to develop the machinery of homological algebra for modules and for sheaves in a unified manner. The theory of these categories was further developed in Pierre Gabriel's se... | Grothendieck category |
c_sexb3va07el3 | In mathematics, a Grothendieck space, named after Alexander Grothendieck, is a Banach space X {\displaystyle X} in which every sequence in its continuous dual space X ′ {\displaystyle X^{\prime }} that converges in the weak-* topology σ ( X ′ , X ) {\displaystyle \sigma \left(X^{\prime },X\right)} (also known as the to... | Grothendieck space |
c_q2rmx4wi4dxs | In mathematics, a Grothendieck universe is a set U with the following properties: If x is an element of U and if y is an element of x, then y is also an element of U. (U is a transitive set.) If x and y are both elements of U, then { x , y } {\displaystyle \{x,y\}} is an element of U. If x is an element of U, then P(x)... | Grothendieck universe |
c_q2azn9tbjgb2 | (In fact, uncountable Grothendieck universes provide models of set theory with the natural ∈-relation, natural powerset operation etc.). Elements of a Grothendieck universe are sometimes called small sets. The idea of universes is due to Alexander Grothendieck, who used them as a way of avoiding proper classes in algeb... | Grothendieck universe |
c_82td9uy6nwod | The existence of a nontrivial Grothendieck universe goes beyond the usual axioms of Zermelo–Fraenkel set theory; in particular it would imply the existence of strongly inaccessible cardinals. Tarski–Grothendieck set theory is an axiomatic treatment of set theory, used in some automatic proof systems, in which every set... | Grothendieck universe |
c_r30rtygqx5oa | In mathematics, a Gödel code was the basis for the proof of Gödel's incompleteness theorem. Here, the idea was to map mathematical notation to a natural number (using a Gödel numbering). | Data encoding |
c_ufukg9lw8bw3 | In mathematics, a Gödel numbering for sequences provides an effective way to represent each finite sequence of natural numbers as a single natural number. While a set theoretical embedding is surely possible, the emphasis is on the effectiveness of the functions manipulating such representations of sequences: the opera... | Gödel numbering for sequences |
c_4zzy9b4wyna6 | In mathematics, a Hadamard manifold, named after Jacques Hadamard — more often called a Cartan–Hadamard manifold, after Élie Cartan — is a Riemannian manifold ( M , g ) {\displaystyle (M,g)} that is complete and simply connected and has everywhere non-positive sectional curvature. By Cartan–Hadamard theorem all Cartan–... | Hadamard manifold |
c_j4jeu2oaigw7 | In mathematics, a Hadamard matrix, named after the French mathematician Jacques Hadamard, is a square matrix whose entries are either +1 or −1 and whose rows are mutually orthogonal. In geometric terms, this means that each pair of rows in a Hadamard matrix represents two perpendicular vectors, while in combinatorial t... | Hadamard matrix |
c_a5pifice7y6p | The n-dimensional parallelotope spanned by the rows of an n×n Hadamard matrix has the maximum possible n-dimensional volume among parallelotopes spanned by vectors whose entries are bounded in absolute value by 1. Equivalently, a Hadamard matrix has maximal determinant among matrices with entries of absolute value less... | Hadamard matrix |
c_ueoobfl26yok | In mathematics, a Haefliger structure on a topological space is a generalization of a foliation of a manifold, introduced by André Haefliger in 1970. Any foliation on a manifold induces a special kind of Haefliger structure, which uniquely determines the foliation. | Haefliger structure |
c_pvl5czmwjwdc | In mathematics, a Haken manifold is a compact, P²-irreducible 3-manifold that is sufficiently large, meaning that it contains a properly embedded two-sided incompressible surface. Sometimes one considers only orientable Haken manifolds, in which case a Haken manifold is a compact, orientable, irreducible 3-manifold tha... | Haken hierarchy |
c_4y9gqk2dxi8n | This conjecture was proven by Ian Agol.Haken manifolds were introduced by Wolfgang Haken (1961). Haken (1962) proved that Haken manifolds have a hierarchy, where they can be split up into 3-balls along incompressible surfaces. Haken also showed that there was a finite procedure to find an incompressible surface if the ... | Haken hierarchy |
c_dc100ikuy9hk | In mathematics, a Hall plane is a non-Desarguesian projective plane constructed by Marshall Hall Jr. (1943). There are examples of order p2n for every prime p and every positive integer n provided p2n > 4. | Hall plane of order 9 |
c_5q1w8vtghnos | In mathematics, a Hamiltonian matrix is a 2n-by-2n matrix A such that JA is symmetric, where J is the skew-symmetric matrix J = {\displaystyle J={\begin{bmatrix}0_{n}&I_{n}\\-I_{n}&0_{n}\\\end{bmatrix}}} and In is the n-by-n identity matrix. In other words, A is Hamiltonian if and only if (JA)T = JA where ()T denotes ... | Hamiltonian matrix |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.