id stringlengths 14 14 | text stringlengths 9 3.55k | source stringlengths 1 250 |
|---|---|---|
c_bb2zzyk1laxa | It loses area at a constant rate, and its perimeter decreases as quickly as possible for any continuous curve evolution. If the curve is non-convex, its total absolute curvature decreases monotonically, until it becomes convex. Once convex, the isoperimetric ratio of the curve decreases as the curve converges to a circ... | Curve-shortening flow |
c_hj80qgbptwjr | If two disjoint simple smooth closed curves evolve, they remain disjoint until one of them collapses to a point. The circle is the only simple closed curve that maintains its shape under the curve-shortening flow, but some curves that cross themselves or have infinite length keep their shape, including the grim reaper ... | Curve-shortening flow |
c_rjx3mmcuqo87 | An approximation to the curve-shortening flow can be computed numerically, by approximating the curve as a polygon and using the finite difference method to calculate the motion of each polygon vertex. Alternative methods include computing a convolution of polygon vertices and then resampling vertices on the resulting ... | Curve-shortening flow |
c_flw29fm7v25s | Later, it was applied in image analysis to give a multi-scale representation of shapes. It can also model reaction–diffusion systems, and the behavior of cellular automata. The curve-shortening flow can be used to find closed geodesics on Riemannian manifolds, and as a model for the behavior of higher-dimensional flows... | Curve-shortening flow |
c_kighct72bxcq | In mathematics, the cycles of a permutation π of a finite set S correspond bijectively to the orbits of the subgroup generated by π acting on S. These orbits are subsets of S that can be written as { c1, ..., cn }, such that π(ci) = ci + 1 for i = 1, ..., n − 1, and π(cn) = c1.The corresponding cycle of π is written as... | Cycles and fixed points |
c_ad9mxk1a5ewn | For example, let π = ( 1 6 7 2 5 4 8 3 2 8 7 4 5 3 6 1 ) = ( 1 2 3 4 5 6 7 8 2 4 1 3 5 8 7 6 ) {\displaystyle \pi ={\begin{pmatrix}1&6&7&2&5&4&8&3\\2&8&7&4&5&3&6&1\end{pmatrix}}={\begin{pmatrix}1&2&3&4&5&6&7&8\\2&4&1&3&5&8&7&6\end{pmatrix}}} be a permutation that maps 1 to 2, 6 to 8, etc. Then one may write π = ( 1 2 4... | Cycles and fixed points |
c_12ikepkza2kd | In mathematics, the cyclic category or cycle category or category of cycles is a category of finite cyclically ordered sets and degree-1 maps between them. It was introduced by Connes (1983). | Cyclic category |
c_ne8oe4ezr4cr | In mathematics, the cyclotomic identity states that 1 1 − α z = ∏ j = 1 ∞ ( 1 1 − z j ) M ( α , j ) {\displaystyle {1 \over 1-\alpha z}=\prod _{j=1}^{\infty }\left({1 \over 1-z^{j}}\right)^{M(\alpha ,j)}} where M is Moreau's necklace-counting function, M ( α , n ) = 1 n ∑ d | n μ ( n d ) α d , {\displaystyle M(\alpha ,... | Cyclotomic identity |
c_4cmmofvpa4yp | In mathematics, the cylinder sets form a basis of the product topology on a product of sets; they are also a generating family of the cylinder σ-algebra. | Cylinder set |
c_vq9n55dvgqm5 | In mathematics, the cylindrical harmonics are a set of linearly independent functions that are solutions to Laplace's differential equation, ∇ 2 V = 0 {\displaystyle \nabla ^{2}V=0} , expressed in cylindrical coordinates, ρ (radial coordinate), φ (polar angle), and z (height). Each function Vn(k) is the product of thre... | Cylindrical harmonics |
c_vetrf9nd2pmm | In mathematics, the de Franchis theorem is one of a number of closely related statements applying to compact Riemann surfaces, or, more generally, algebraic curves, X and Y, in the case of genus g > 1. The simplest is that the automorphism group of X is finite (see though Hurwitz's automorphisms theorem). More generall... | De Franchis theorem |
c_s3je46w92zwk | In mathematics, the definite integral ∫ a b f ( x ) d x {\displaystyle \int _{a}^{b}f(x)\,dx} is the area of the region in the xy-plane bounded by the graph of f, the x-axis, and the lines x = a and x = b, such that area above the x-axis adds to the total, and that below the x-axis subtracts from the total. The fundame... | List of definite integrals |
c_2c28zxr1mp59 | for example: ∫ a ∞ f ( x ) d x = lim b → ∞ {\displaystyle \int _{a}^{\infty }f(x)\,dx=\lim _{b\to \infty }\left} A constant, such pi, that may be defined by the integral of an algebraic function over an algebraic domain is known as a period. The following is a list of some of the most common or interesting definite in... | List of definite integrals |
c_gfw0hvhk4rzl | In mathematics, the degree of a polynomial is the highest of the degrees of the polynomial's monomials (individual terms) with non-zero coefficients. The degree of a term is the sum of the exponents of the variables that appear in it, and thus is a non-negative integer. For a univariate polynomial, the degree of the po... | Polynomial degree |
c_tfneqaogls4w | The term order has been used as a synonym of degree but, nowadays, may refer to several other concepts (see Order of a polynomial (disambiguation)). For example, the polynomial 7 x 2 y 3 + 4 x − 9 , {\displaystyle 7x^{2}y^{3}+4x-9,} which can also be written as 7 x 2 y 3 + 4 x 1 y 0 − 9 x 0 y 0 , {\displaystyle 7x^{2}y... | Polynomial degree |
c_lmcwghm4vp79 | Therefore, the polynomial has a degree of 5, which is the highest degree of any term. To determine the degree of a polynomial that is not in standard form, such as ( x + 1 ) 2 − ( x − 1 ) 2 {\displaystyle (x+1)^{2}-(x-1)^{2}} , one can put it in standard form by expanding the products (by distributivity) and combining ... | Polynomial degree |
c_x199ejs8inoe | In mathematics, the degree of an affine or projective variety of dimension n is the number of intersection points of the variety with n hyperplanes in general position. For an algebraic set, the intersection points must be counted with their intersection multiplicity, because of the possibility of multiple components. ... | Degree (algebraic geometry) |
c_eqgz56filv7n | This is a generalization of Bézout's theorem (For a proof, see Hilbert series and Hilbert polynomial § Degree of a projective variety and Bézout's theorem). The degree is not an intrinsic property of the variety, as it depends on a specific embedding of the variety in an affine or projective space. The degree of a hype... | Degree (algebraic geometry) |
c_r5db3rt451n8 | A generalization of Bézout's theorem asserts that, if an intersection of n projective hypersurfaces has codimension n, then the degree of the intersection is the product of the degrees of the hypersurfaces. The degree of a projective variety is the evaluation at 1 of the numerator of the Hilbert series of its coordinat... | Degree (algebraic geometry) |
c_jabi31aunq06 | In mathematics, the derivative is a fundamental construction of differential calculus and admits many possible generalizations within the fields of mathematical analysis, combinatorics, algebra, geometry, etc. | Generalized derivative |
c_yc1jsei5r38s | In mathematics, the derivative shows the sensitivity of change of a function's output with respect to the input. Derivatives are a fundamental tool of calculus. For example, the derivative of the position of a moving object with respect to time is the object's velocity: this measures how quickly the position of the obj... | First-order derivative expression |
c_wwekr7sa6s64 | The tangent line is the best linear approximation of the function near that input value. For this reason, the derivative is often described as the "instantaneous rate of change", the ratio of the instantaneous change in the dependent variable to that of the independent variable. Derivatives can be generalized to functi... | First-order derivative expression |
c_456sikvg7v9t | In this generalization, the derivative is reinterpreted as a linear transformation whose graph is (after an appropriate translation) the best linear approximation to the graph of the original function. The Jacobian matrix is the matrix that represents this linear transformation with respect to the basis given by the ch... | First-order derivative expression |
c_467rgu3h2m6k | For a real-valued function of several variables, the Jacobian matrix reduces to the gradient vector. The process of finding a derivative is called differentiation. The reverse process is called antidifferentiation. The fundamental theorem of calculus relates antidifferentiation with integration. Differentiation and int... | First-order derivative expression |
c_cfgfrjvqwgvh | In mathematics, the derived category D(A) of an abelian category A is a construction of homological algebra introduced to refine and in a certain sense to simplify the theory of derived functors defined on A. The construction proceeds on the basis that the objects of D(A) should be chain complexes in A, with two such c... | Derived category |
c_1quu9i32hvki | The development of the derived category, by Alexander Grothendieck and his student Jean-Louis Verdier shortly after 1960, now appears as one terminal point in the explosive development of homological algebra in the 1950s, a decade in which it had made remarkable strides. The basic theory of Verdier was written down in ... | Derived category |
c_pd2up38cdlxg | The original impulse to develop the "derived" formalism came from the need to find a suitable formulation of Grothendieck's coherent duality theory. Derived categories have since become indispensable also outside of algebraic geometry, for example in the formulation of the theory of D-modules and microlocal analysis. R... | Derived category |
c_7i0ag0m6ixjn | In mathematics, the determinant is a scalar value that is a function of the entries of a square matrix. The determinant of a matrix A is commonly denoted det(A), det A, or |A|. Its value characterizes some properties of the matrix and the linear map represented by the matrix. In particular, the determinant is nonzero i... | Determinant (mathematics) |
c_4jchp6hl1zxc | The determinant of a product of matrices is the product of their determinants (which follows directly from the above properties). The determinant of a 2 × 2 matrix is | a b c d | = a d − b c , {\displaystyle {\begin{vmatrix}a&b\\c&d\end{vmatrix}}=ad-bc,} and the determinant of a 3 × 3 matrix is | a b c d e f g h i | = ... | Determinant (mathematics) |
c_8ry345jcrpwe | The determinant of an n × n matrix can be defined in several equivalent ways, the most common being Leibniz formula, which expresses the determinant as a sum of n ! {\displaystyle n!} (the factorial of n) signed products of matrix entries. | Determinant (mathematics) |
c_zy0epg97tyb9 | It can be computed by the Laplace expansion, which expresses the determinant as a linear combination of determinants of submatrices, or with Gaussian elimination, which expresses the determinant as the product of the diagonal entries of a diagonal matrix that is obtained by a succession of elementary row operations. De... | Determinant (mathematics) |
c_6xv0bhdh6m6i | (The above properties relating to rows may be replaced by the corresponding statements with respect to columns.) Determinants occur throughout mathematics. | Determinant (mathematics) |
c_2w89g24oi3h3 | For example, a matrix is often used to represent the coefficients in a system of linear equations, and determinants can be used to solve these equations (Cramer's rule), although other methods of solution are computationally much more efficient. Determinants are used for defining the characteristic polynomial of a matr... | Determinant (mathematics) |
c_941pdfae28n2 | In mathematics, the determinant method is any of a family of techniques in analytic number theory. The name was coined by Roger Heath-Brown and comes from the fact that the center piece of the method is estimating a certain determinant. Its main application is to give an upper bound for the number of rational points of... | Determinant method |
c_qdnr4loq122r | In mathematics, the determinantal conjecture of Marcus (1972) and de Oliveira (1982) asks whether the determinant of a sum A + B of two n by n normal complex matrices A and B lies in the convex hull of the n! points Πi (λ(A)i + λ(B)σ(i)), where the numbers λ(A)i and λ(B)i are the eigenvalues of A and B, and σ is an ele... | Determinantal conjecture |
c_nkgtoi28pul1 | In mathematics, the difference of two squares is a squared (multiplied by itself) number subtracted from another squared number. Every difference of squares may be factored according to the identity a 2 − b 2 = ( a + b ) ( a − b ) {\displaystyle a^{2}-b^{2}=(a+b)(a-b)} in elementary algebra. | Difference of two squares |
c_xc7bspuczi88 | In mathematics, the differential geometry of surfaces deals with the differential geometry of smooth surfaces with various additional structures, most often, a Riemannian metric. Surfaces have been extensively studied from various perspectives: extrinsically, relating to their embedding in Euclidean space and intrinsic... | Differentiable surface |
c_85juovdq1mez | An important role in their study has been played by Lie groups (in the spirit of the Erlangen program), namely the symmetry groups of the Euclidean plane, the sphere and the hyperbolic plane. These Lie groups can be used to describe surfaces of constant Gaussian curvature; they also provide an essential ingredient in t... | Differentiable surface |
c_5795zso222su | In mathematics, the digamma function is defined as the logarithmic derivative of the gamma function: ψ ( z ) = d d z ln Γ ( z ) = Γ ′ ( z ) Γ ( z ) . {\displaystyle \psi (z)={\frac {\mathrm {d} }{\mathrm {d} z}}\ln \Gamma (z)={\frac {\Gamma '(z)}{\Gamma (z)}}.} It is the first of the polygamma functions. This functio... | Gauss's digamma theorem |
c_iryo4hapigvg | In mathematics, the digit sum of a natural number in a given number base is the sum of all its digits. For example, the digit sum of the decimal number 9045 {\displaystyle 9045} would be 9 + 0 + 4 + 5 = 18. {\displaystyle 9+0+4+5=18.} | Digit sum |
c_djdc4fb6i73g | In mathematics, the dimension of a partially ordered set (poset) is the smallest number of total orders the intersection of which gives rise to the partial order. This concept is also sometimes called the order dimension or the Dushnik–Miller dimension of the partial order. Dushnik & Miller (1941) first studied order d... | Order dimension |
c_x20n20f33rjt | In mathematics, the dimension of a vector space V is the cardinality (i.e., the number of vectors) of a basis of V over its base field. It is sometimes called Hamel dimension (after Georg Hamel) or algebraic dimension to distinguish it from other types of dimension. For every vector space there exists a basis, and all ... | Infinite-dimensional vector space |
c_qn3fn1694j4s | We say V {\displaystyle V} is finite-dimensional if the dimension of V {\displaystyle V} is finite, and infinite-dimensional if its dimension is infinite. The dimension of the vector space V {\displaystyle V} over the field F {\displaystyle F} can be written as dim F ( V ) {\displaystyle \dim _{F}(V)} or as , {\disp... | Infinite-dimensional vector space |
c_hgwp5955cq2n | In mathematics, the dimension of an object is, roughly speaking, the number of degrees of freedom of a point that moves on this object. In other words, the dimension is the number of independent parameters or coordinates that are needed for defining the position of a point that is constrained to be on the object. For e... | Multidimensional geometry |
c_27417gzhmjxm | This is independent from the fact that a curve cannot be embedded in a Euclidean space of dimension lower than two, unless it is a line. The dimension of Euclidean n-space En is n. When trying to generalize to other types of spaces, one is faced with the question "what makes En n-dimensional?" One answer is that to cov... | Multidimensional geometry |
c_6t78hszfe07i | This observation leads to the definition of the Minkowski dimension and its more sophisticated variant, the Hausdorff dimension, but there are also other answers to that question. For example, the boundary of a ball in En looks locally like En-1 and this leads to the notion of the inductive dimension. While these notio... | Multidimensional geometry |
c_xmtrcewrv8e5 | A tesseract is an example of a four-dimensional object. Whereas outside mathematics the use of the term "dimension" is as in: "A tesseract has four dimensions", mathematicians usually express this as: "The tesseract has dimension 4", or: "The dimension of the tesseract is 4" or: 4D. Although the notion of higher dimens... | Multidimensional geometry |
c_0r0w9m10eicg | In mathematics, the dimension theorem for vector spaces states that all bases of a vector space have equally many elements. This number of elements may be finite or infinite (in the latter case, it is a cardinal number), and defines the dimension of the vector space. Formally, the dimension theorem for vector spaces st... | Dimension theorem for vector spaces |
c_2xr0gtl6gsw3 | While the proof of the existence of a basis for any vector space in the general case requires Zorn's lemma and is in fact equivalent to the axiom of choice, the uniqueness of the cardinality of the basis requires only the ultrafilter lemma, which is strictly weaker (the proof given below, however, assumes trichotomy, i... | Dimension theorem for vector spaces |
c_r5wckxdq63sm | In mathematics, the direct image functor is a construction in sheaf theory that generalizes the global sections functor to the relative case. It is of fundamental importance in topology and algebraic geometry. Given a sheaf F defined on a topological space X and a continuous map f: X → Y, we can define a new sheaf f∗F ... | Direct image |
c_1gbucs2oetig | In mathematics, the direct image with compact (or proper) support is an image functor for sheaves that extends the compactly supported global sections functor to the relative setting. It is one of Grothendieck's six operations. | Direct image with compact support |
c_40tuheh2hkkh | In mathematics, the direct method in the calculus of variations is a general method for constructing a proof of the existence of a minimizer for a given functional, introduced by Stanisław Zaremba and David Hilbert around 1900. The method relies on methods of functional analysis and topology. As well as being used to p... | Direct method in calculus of variations |
c_24f2rbzx8otl | In mathematics, the discrete Fourier transform (DFT) converts a finite sequence of equally-spaced samples of a function into a same-length sequence of equally-spaced samples of the discrete-time Fourier transform (DTFT), which is a complex-valued function of frequency. The interval at which the DTFT is sampled is the r... | Discrete Fourier Transform |
c_jkatksjcgci2 | The DFT is therefore said to be a frequency domain representation of the original input sequence. If the original sequence spans all the non-zero values of a function, its DTFT is continuous (and periodic), and the DFT provides discrete samples of one cycle. If the original sequence is one cycle of a periodic function,... | Discrete Fourier Transform |
c_w5nx1khsd874 | The DFT is the most important discrete transform, used to perform Fourier analysis in many practical applications. In digital signal processing, the function is any quantity or signal that varies over time, such as the pressure of a sound wave, a radio signal, or daily temperature readings, sampled over a finite time i... | Discrete Fourier Transform |
c_qoe5c71zqn66 | The DFT is also used to efficiently solve partial differential equations, and to perform other operations such as convolutions or multiplying large integers. Since it deals with a finite amount of data, it can be implemented in computers by numerical algorithms or even dedicated hardware. These implementations usually ... | Discrete Fourier Transform |
c_u9nnxx9v90wn | In mathematics, the discrete Fourier transform over a ring generalizes the discrete Fourier transform (DFT), of a function whose values are commonly complex numbers, over an arbitrary ring. | Number-theoretic transform |
c_6kq4atkbtiu7 | In mathematics, the discrete Laplace operator is an analog of the continuous Laplace operator, defined so that it has meaning on a graph or a discrete grid. For the case of a finite-dimensional graph (having a finite number of edges and vertices), the discrete Laplace operator is more commonly called the Laplacian matr... | Discrete Laplace operator |
c_kn83excbdwm3 | In mathematics, the discrete Poisson equation is the finite difference analog of the Poisson equation. In it, the discrete Laplace operator takes the place of the Laplace operator. The discrete Poisson equation is frequently used in numerical analysis as a stand-in for the continuous Poisson equation, although it is al... | Discrete Poisson equation |
c_tne0618sjsty | In mathematics, the discrete exterior calculus (DEC) is the extension of the exterior calculus to discrete spaces including graphs, finite element meshes, and lately also general polygonal meshes (non-flat and non-convex). DEC methods have proved to be very powerful in improving and analyzing finite element methods: fo... | Discrete exterior calculus |
c_rl7bla3yejjd | In mathematics, the discrete q-Hermite polynomials are two closely related families hn(x;q) and ĥn(x;q) of basic hypergeometric orthogonal polynomials in the basic Askey scheme, introduced by Al-Salam and Carlitz (1965). Roelof Koekoek, Peter A. Lesky, and René F. Swarttouw (2010, 14) give a detailed list of their prop... | Discrete q-Hermite polynomials |
c_8pqol6mwdvr0 | In mathematics, the discrete sine transform (DST) is a Fourier-related transform similar to the discrete Fourier transform (DFT), but using a purely real matrix. It is equivalent to the imaginary parts of a DFT of roughly twice the length, operating on real data with odd symmetry (since the Fourier transform of a real ... | Discrete sine transform |
c_uxxnbpw5oth0 | See the DCT article for a general discussion of how the boundary conditions relate the various DCT and DST types. Generally, the DST is derived from the DCT by replacing the Neumann condition at x=0 with a Dirichlet condition. Both the DCT and the DST were described by Nasir Ahmed, T. Natarajan, and K.R. | Discrete sine transform |
c_baykwjmilhxn | Rao in 1974. The type-I DST (DST-I) was later described by Anil K. Jain in 1976, and the type-II DST (DST-II) was then described by H.B. Kekra and J.K. Solanka in 1978. | Discrete sine transform |
c_top3oemlcwsx | In mathematics, the discrete-time Fourier transform (DTFT), also called the finite Fourier transform, is a form of Fourier analysis that is applicable to a sequence of values. The DTFT is often used to analyze samples of a continuous function. The term discrete-time refers to the fact that the transform operates on dis... | Discrete-time Fourier transform |
c_y7rpbdcxcuiw | Under certain theoretical conditions, described by the sampling theorem, the original continuous function can be recovered perfectly from the DTFT and thus from the original discrete samples. The DTFT itself is a continuous function of frequency, but discrete samples of it can be readily calculated via the discrete Fou... | Discrete-time Fourier transform |
c_tfdd0ybsbohz | The inverse DTFT is the original sampled data sequence. The inverse DFT is a periodic summation of the original sequence. The fast Fourier transform (FFT) is an algorithm for computing one cycle of the DFT, and its inverse produces one cycle of the inverse DFT. | Discrete-time Fourier transform |
c_6dgaq2oinip7 | In mathematics, the discriminant of a polynomial is a quantity that depends on the coefficients and allows deducing some properties of the roots without computing them. More precisely, it is a polynomial function of the coefficients of the original polynomial. The discriminant is widely used in polynomial factoring, nu... | Discriminant of a polynomial |
c_z1wk9v8jnm56 | If a ≠ 0 , {\displaystyle a\neq 0,} this discriminant is zero if and only if the polynomial has a double root. In the case of real coefficients, it is positive if the polynomial has two distinct real roots, and negative if it has two distinct complex conjugate roots. Similarly, the discriminant of a cubic polynomial is... | Discriminant of a polynomial |
c_pfssy83y4w4r | In the case of a cubic with real coefficients, the discriminant is positive if the polynomial has three distinct real roots, and negative if it has one real root and two distinct complex conjugate roots. More generally, the discriminant of a univariate polynomial of positive degree is zero if and only if the polynomial... | Discriminant of a polynomial |
c_bu1x4otsl89q | In mathematics, the discriminant of an algebraic number field is a numerical invariant that, loosely speaking, measures the size of the (ring of integers of the) algebraic number field. More specifically, it is proportional to the squared volume of the fundamental domain of the ring of integers, and it regulates which ... | Brill's theorem |
c_ralbqtdxu8b9 | In mathematics, the discussion of vector fields on spheres was a classical problem of differential topology, beginning with the hairy ball theorem, and early work on the classification of division algebras. Specifically, the question is how many linearly independent smooth nowhere-zero vector fields can be constructed ... | Radon–Hurwitz number |
c_xfb4097fls52 | In mathematics, the disintegration theorem is a result in measure theory and probability theory. It rigorously defines the idea of a non-trivial "restriction" of a measure to a measure zero subset of the measure space in question. It is related to the existence of conditional probability measures. In a sense, "disinteg... | Disintegration theorem |
c_8a267ld04l9b | In mathematics, the distortion is a measure of the amount by which a function from the Euclidean plane to itself distorts circles to ellipses. If the distortion of a function is equal to one, then it is conformal; if the distortion is bounded and the function is a homeomorphism, then it is quasiconformal. The distortio... | Distortion (mathematics) |
c_azyaa7qm1klm | Here Df is the weak derivative of ƒ, and |Df| is the Hilbert–Schmidt norm. For functions on a higher-dimensional Euclidean space Rn, there are more measures of distortion because there are more than two principal axes of a symmetric tensor. | Distortion (mathematics) |
c_au0bna2arqf2 | The pointwise information is contained in the distortion tensor G ( x , f ) = { | J ( x , f ) | − 2 / n D T f ( x ) D f ( x ) if J ( x , f ) ≠ 0 I if J ( x , f ) = 0. {\displaystyle G(x,f)={\begin{cases}|J(x,f)|^{-2/n}D^{T}f(x)Df(x)&{\text{if }}J(x,f)\not =0\\I&{\text{if }}J(x,f)=0.\end{cases}}} The outer distortion KO... | Distortion (mathematics) |
c_z3utyl0984pr | In mathematics, the distributive property of binary operations is a generalization of the distributive law, which asserts that the equality is always true in elementary algebra. For example, in elementary arithmetic, one has Therefore, one would say that multiplication distributes over addition. This basic property of ... | Antidistributive |
c_0gxrwtz469dw | In mathematics, the domain of a function is the set of inputs accepted by the function. It is sometimes denoted by dom ( f ) {\displaystyle \operatorname {dom} (f)} or dom f {\displaystyle \operatorname {dom} f} , where f is the function. In layman's terms, the domain of a function can generally be thought of as "w... | Domain (function) |
c_d1g8tu7lahi8 | In this case, the domain is represented on the x-axis of the graph, as the projection of the graph of the function onto the x-axis. For a function f: X → Y {\displaystyle f\colon X\to Y} , the set Y is called the codomain, and the set of values attained by the function (which is a subset of Y) is called its range or im... | Domain (function) |
c_cp4av5op7s4g | In mathematics, the dot product or scalar product is an algebraic operation that takes two equal-length sequences of numbers (usually coordinate vectors), and returns a single number. In Euclidean geometry, the dot product of the Cartesian coordinates of two vectors is widely used. It is often called the inner product ... | Vector dot product |
c_1jt2aohce49n | Geometrically, it is the product of the Euclidean magnitudes of the two vectors and the cosine of the angle between them. These definitions are equivalent when using Cartesian coordinates. In modern geometry, Euclidean spaces are often defined by using vector spaces. In this case, the dot product is used for defining l... | Vector dot product |
c_zklwm3eu8921 | In mathematics, the double Fourier sphere (DFS) method is a simple technique that transforms a function defined on the surface of the sphere to a function defined on a rectangular domain while preserving periodicity in both the longitude and latitude directions. | Double Fourier sphere method |
c_a6zxaz147cki | In mathematics, the double factorial of a number n, denoted by n‼, is the product of all the positive integers up to n that have the same parity (odd or even) as n. That is, Restated, this says that for even n, the double factorial is while for odd n it is For example, 9‼ = 9 × 7 × 5 × 3 × 1 = 945. The zero double fact... | Double factorial |
c_zja02jrjtmz8 | In mathematics, the doubly triangular numbers are the numbers that appear within the sequence of triangular numbers, in positions that are also triangular numbers. That is, if T n = n ( n + 1 ) / 2 {\displaystyle T_{n}=n(n+1)/2} denotes the n {\displaystyle n} th triangular number, then the doubly triangular numbers ar... | Doubly triangular number |
c_eaazrypwy8e3 | In mathematics, the dual Hahn polynomials are a family of orthogonal polynomials in the Askey scheme of hypergeometric orthogonal polynomials. They are defined on a non-uniform lattice x ( s ) = s ( s + 1 ) {\displaystyle x(s)=s(s+1)} and are defined as w n ( c ) ( s , a , b ) = ( a − b + 1 ) n ( a + c + 1 ) n n ! 3 F ... | Dual Hahn polynomials |
c_a6yq3l03squ8 | }}{}_{3}F_{2}(-n,a-s,a+s+1;a-b+a,a+c+1;1)} for n = 0 , 1 , . . . , N − 1 {\displaystyle n=0,1,...,N-1} and the parameters a , b , c {\displaystyle a,b,c} are restricted to − 1 2 < a < b , | c | < 1 + a , b = a + N {\displaystyle -{\frac {1}{2}} | Dual Hahn polynomials |
c_dc7rrlkekahr | In mathematics, the dual bundle is an operation on vector bundles extending the operation of duality for vector spaces. | Dual bundle |
c_9x4xic5t09b6 | In mathematics, the dual module of a left (respectively right) module M over a ring R is the set of module homomorphisms from M to R with the pointwise right (respectively left) module structure. The dual module is typically denoted M∗ or HomR(M, R). If the base ring R is a field, then a dual module is a dual vector sp... | Dual module |
c_ck7n3jdku16k | A reflexive module is one for which the canonical homomorphism is an isomorphism. A torsionless module is one for which the canonical homomorphism is injective. Example: If G = Spec ( A ) {\displaystyle G=\operatorname {Spec} (A)} is a finite commutative group scheme represented by a Hopf algebra A over a commutative... | Dual module |
c_j21fftby3tnb | In mathematics, the dual q-Hahn polynomials are a family of basic hypergeometric orthogonal polynomials in the basic Askey scheme. Roelof Koekoek, Peter A. Lesky, and René F. Swarttouw (2010, 14) give a detailed list of their properties. | Dual q-Hahn polynomials |
c_cyafjyvcwvro | In mathematics, the dual q-Krawtchouk polynomials are a family of basic hypergeometric orthogonal polynomials in the basic Askey scheme. Roelof Koekoek, Peter A. Lesky, and René F. Swarttouw (2010, 14) give a detailed list of their properties. | Dual q-Krawtchouk polynomials |
c_y11i5stcrcyq | In mathematics, the dual quaternions are an 8-dimensional real algebra isomorphic to the tensor product of the quaternions and the dual numbers. Thus, they may be constructed in the same way as the quaternions, except using dual numbers instead of real numbers as coefficients. A dual quaternion can be represented in th... | Dual quaternion |
c_4iylx929vnwp | In mechanics, the dual quaternions are applied as a number system to represent rigid transformations in three dimensions. Since the space of dual quaternions is 8-dimensional and a rigid transformation has six real degrees of freedom, three for translations and three for rotations, dual quaternions obeying two algebrai... | Dual quaternion |
c_kriadol7adtm | In mathematics, the dyadic cubes are a collection of cubes in Rn of different sizes or scales such that the set of cubes of each scale partition Rn and each cube in one scale may be written as a union of cubes of a smaller scale. These are frequently used in mathematics (particularly harmonic analysis) as a way of disc... | Dyadic cubes |
c_e25l2obyi202 | In mathematics, the eccentricity of a conic section is a non-negative real number that uniquely characterizes its shape. One can think of the eccentricity as a measure of how much a conic section deviates from being circular. In particular: The eccentricity of a circle is 0. {\displaystyle 0.} | Eccentricity (geometry) |
c_ysdd3iadjv4t | The eccentricity of an ellipse which is not a circle is between 0 {\displaystyle 0} and 1. {\displaystyle 1.} The eccentricity of a parabola is 1. | Eccentricity (geometry) |
c_iorcyei8c7ak | {\displaystyle 1.} The eccentricity of a hyperbola is greater than 1. {\displaystyle 1.} The eccentricity of a pair of lines is ∞ {\displaystyle \infty } Two conic sections with the same eccentricity are similar. | Eccentricity (geometry) |
c_8rd3epw2dph2 | In mathematics, the effective topos E f f {\displaystyle {\mathsf {Eff}}} introduced by Martin Hyland (1982) captures the mathematical idea of effectivity within the category theoretical framework. | Effective topos |
c_zgq4y8k26odq | In mathematics, the either–or topology is a topological structure defined on the closed interval by declaring a set open if it either does not contain {0} or does contain (−1, 1). | Either–or topology |
c_f4efopfbli3a | In mathematics, the elasticity or point elasticity of a positive differentiable function f of a positive variable (positive input, positive output) at point a is defined as E f ( a ) = a f ( a ) f ′ ( a ) {\displaystyle Ef(a)={\frac {a}{f(a)}}f'(a)} = lim x → a f ( x ) − f ( a ) x − a a f ( a ) = lim x → a f ( x ) − f ... | Elasticity of a function |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.