tag
stringlengths 1
78
| name
stringlengths 1
78
| description
stringlengths 39
2.42k
| url
stringlengths 31
108
| name_descr
stringlengths 56
2.44k
|
|---|---|---|---|---|
non_inertial_reference_frame
|
Non Inertial Reference Frame
|
A non-inertial reference frame (also known as an accelerated reference frame) is a frame of reference that undergoes acceleration with respect to an inertial frame. An accelerometer at rest in a non-inertial frame will, in general, detect a non-zero acceleration. While the laws of motion are the same in all inertial frames, they vary in non-inertial frames, with apparent motion depending on the acceleration.
|
https://en.wikipedia.org/wiki/Non-inertial_reference_frame
|
Non Inertial Reference Frame: A non-inertial reference frame (also known as an accelerated reference frame) is a frame of reference that undergoes acceleration with respect to an inertial frame. An accelerometer at rest in a non-inertial frame will, in general, detect a non-zero acceleration. While the laws of motion are the same in all inertial frames, they vary in non-inertial frames, with apparent motion depending on the acceleration.
|
non_measurable_set
|
Non Measurable Set
|
In mathematics, a non-measurable set is a set which cannot be assigned a meaningful "volume". The existence of such sets is construed to provide information about the notions of length, area and volume in formal set theory. In ZermeloβFraenkel set theory, the axiom of choice entails that non-measurable subsets of R {\displaystyle \mathbb {R} } exist.
|
https://en.wikipedia.org/wiki/Non-measurable_set
|
Non Measurable Set: In mathematics, a non-measurable set is a set which cannot be assigned a meaningful "volume". The existence of such sets is construed to provide information about the notions of length, area and volume in formal set theory. In ZermeloβFraenkel set theory, the axiom of choice entails that non-measurable subsets of R {\displaystyle \mathbb {R} } exist.
|
non_integer_base_of_numeration
|
Non Integer Base Of Numeration
|
A non-integer representation uses non-integer numbers as the radix, or base, of a positional numeral system. For a non-integer radix Ξ² > 1, the value of
|
https://en.wikipedia.org/wiki/Non-integer_base_of_numeration
|
Non Integer Base Of Numeration: A non-integer representation uses non-integer numbers as the radix, or base, of a positional numeral system. For a non-integer radix Ξ² > 1, the value of
|
non_positive_curvature
|
Non Positive Curvature
|
In mathematics, spaces of non-positive curvature occur in many contexts and form a generalization of hyperbolic geometry. In the category of Riemannian manifolds, one can consider the sectional curvature of the manifold and require that this curvature be everywhere less than or equal to zero. The notion of curvature extends to the category of geodesic metric spaces, where one can use comparison triangles to quantify the curvature of a space; in this context, non-positively curved spaces are known as (locally) CAT(0) spaces.
|
https://en.wikipedia.org/wiki/Non-positive_curvature
|
Non Positive Curvature: In mathematics, spaces of non-positive curvature occur in many contexts and form a generalization of hyperbolic geometry. In the category of Riemannian manifolds, one can consider the sectional curvature of the manifold and require that this curvature be everywhere less than or equal to zero. The notion of curvature extends to the category of geodesic metric spaces, where one can use comparison triangles to quantify the curvature of a space; in this context, non-positively curved spaces are known as (locally) CAT(0) spaces.
|
nonagon
|
Nonagon
|
In geometry, a nonagon (/ΛnΙnΙΙ‘Ιn/) or enneagon (/ΛΙniΙΙ‘Ιn/) is a nine-sided polygon or 9-gon.
|
https://en.wikipedia.org/wiki/Nonagon
|
Nonagon: In geometry, a nonagon (/ΛnΙnΙΙ‘Ιn/) or enneagon (/ΛΙniΙΙ‘Ιn/) is a nine-sided polygon or 9-gon.
|
non_uniform_random_numbers
|
Non Uniform Random Numbers
|
Non-uniform random variate generation or pseudo-random number sampling is the numerical practice of generating pseudo-random numbers (PRN) that follow a given probability distribution. Methods are typically based on the availability of a uniformly distributed PRN generator. Computational algorithms are then used to manipulate a single random variate, X, or often several such variates, into a new random variate Y such that these values have the required distribution. The first methods were developed for Monte-Carlo simulations in the Manhattan Project,[citation needed] published by John von Neumann in the early 1950s.
|
https://en.wikipedia.org/wiki/Non-uniform_random_variate_generation
|
Non Uniform Random Numbers: Non-uniform random variate generation or pseudo-random number sampling is the numerical practice of generating pseudo-random numbers (PRN) that follow a given probability distribution. Methods are typically based on the availability of a uniformly distributed PRN generator. Computational algorithms are then used to manipulate a single random variate, X, or often several such variates, into a new random variate Y such that these values have the required distribution. The first methods were developed for Monte-Carlo simulations in the Manhattan Project,[citation needed] published by John von Neumann in the early 1950s.
|
noncommutative_geometry
|
Noncommutative Geometry
|
Noncommutative geometry (NCG) is a branch of mathematics concerned with a geometric approach to noncommutative algebras, and with the construction of spaces that are locally presented by noncommutative algebras of functions, possibly in some generalized sense. A noncommutative algebra is an associative algebra in which the multiplication is not commutative, that is, for which x y {\displaystyle xy} does not always equal y x {\displaystyle yx} ; or more generally an algebraic structure in which one of the principal binary operations is not commutative; one also allows additional structures, e.g. topology or norm, to be possibly carried by the noncommutative algebra of functions.
|
https://en.wikipedia.org/wiki/Noncommutative_geometry
|
Noncommutative Geometry: Noncommutative geometry (NCG) is a branch of mathematics concerned with a geometric approach to noncommutative algebras, and with the construction of spaces that are locally presented by noncommutative algebras of functions, possibly in some generalized sense. A noncommutative algebra is an associative algebra in which the multiplication is not commutative, that is, for which x y {\displaystyle xy} does not always equal y x {\displaystyle yx} ; or more generally an algebraic structure in which one of the principal binary operations is not commutative; one also allows additional structures, e.g. topology or norm, to be possibly carried by the noncommutative algebra of functions.
|
noncommutative_algebraic_geometry
|
Noncommutative Algebraic Geometry
|
Noncommutative algebraic geometry is a branch of mathematics, and more specifically a direction in noncommutative geometry, that studies the geometric properties of formal duals of non-commutative algebraic objects such as rings as well as geometric objects derived from them (e.g. by gluing along localizations or taking noncommutative stack quotients).
|
https://en.wikipedia.org/wiki/Noncommutative_algebraic_geometry
|
Noncommutative Algebraic Geometry: Noncommutative algebraic geometry is a branch of mathematics, and more specifically a direction in noncommutative geometry, that studies the geometric properties of formal duals of non-commutative algebraic objects such as rings as well as geometric objects derived from them (e.g. by gluing along localizations or taking noncommutative stack quotients).
|
noncommutative_logic
|
Noncommutative Logic
|
Noncommutative logic is an extension of linear logic that combines the commutative connectives of linear logic with the noncommutative multiplicative connectives of the Lambek calculus. Its sequent calculus relies on the structure of order varieties (a family of cyclic orders that may be viewed as a species of structure), and the correctness criterion for its proof nets is given in terms of partial permutations. It also has a denotational semantics in which formulas are interpreted by modules over some specific Hopf algebras.
|
https://en.wikipedia.org/wiki/Noncommutative_logic
|
Noncommutative Logic: Noncommutative logic is an extension of linear logic that combines the commutative connectives of linear logic with the noncommutative multiplicative connectives of the Lambek calculus. Its sequent calculus relies on the structure of order varieties (a family of cyclic orders that may be viewed as a species of structure), and the correctness criterion for its proof nets is given in terms of partial permutations. It also has a denotational semantics in which formulas are interpreted by modules over some specific Hopf algebras.
|
noncommutative_ring
|
Noncommutative Ring
|
In mathematics, a noncommutative ring is a ring whose multiplication is not commutative; that is, there exist a and b in the ring such that ab and ba are different. Equivalently, a noncommutative ring is a ring that is not a commutative ring.
|
https://en.wikipedia.org/wiki/Noncommutative_ring
|
Noncommutative Ring: In mathematics, a noncommutative ring is a ring whose multiplication is not commutative; that is, there exist a and b in the ring such that ab and ba are different. Equivalently, a noncommutative ring is a ring that is not a commutative ring.
|
noncrossing_partition
|
Noncrossing Partition
|
In combinatorial mathematics, the topic of noncrossing partitions has assumed some importance because of (among other things) its application to the theory of free probability. The number of noncrossing partitions of a set of n elements is the nth Catalan number. The number of noncrossing partitions of an n-element set with k blocks is found in the Narayana number triangle.
|
https://en.wikipedia.org/wiki/Noncrossing_partition
|
Noncrossing Partition: In combinatorial mathematics, the topic of noncrossing partitions has assumed some importance because of (among other things) its application to the theory of free probability. The number of noncrossing partitions of a set of n elements is the nth Catalan number. The number of noncrossing partitions of an n-element set with k blocks is found in the Narayana number triangle.
|
nonelementary_integral
|
Nonelementary Integral
|
In mathematics, a nonelementary antiderivative of a given elementary function is an antiderivative (or indefinite integral) that is, itself, not an elementary function. A theorem by Liouville in 1835 provided the first proof that nonelementary antiderivatives exist. This theorem also provides a basis for the Risch algorithm for determining (with difficulty) which elementary functions have elementary antiderivatives.
|
https://en.wikipedia.org/wiki/Nonelementary_integral
|
Nonelementary Integral: In mathematics, a nonelementary antiderivative of a given elementary function is an antiderivative (or indefinite integral) that is, itself, not an elementary function. A theorem by Liouville in 1835 provided the first proof that nonelementary antiderivatives exist. This theorem also provides a basis for the Risch algorithm for determining (with difficulty) which elementary functions have elementary antiderivatives.
|
nondeterministic_finite_automaton
|
Nondeterministic Finite Automaton
|
In automata theory, a finite-state machine is called a deterministic finite automaton (DFA), if
|
https://en.wikipedia.org/wiki/Nondeterministic_finite_automaton
|
Nondeterministic Finite Automaton: In automata theory, a finite-state machine is called a deterministic finite automaton (DFA), if
|
nonequilibrium_partition_identity
|
Nonequilibrium Partition Identity
|
The nonequilibrium partition identity (NPI) is a remarkably simple and elegant consequence of the fluctuation theorem previously known as the Kawasaki identity:
|
https://en.wikipedia.org/wiki/Nonequilibrium_partition_identity
|
Nonequilibrium Partition Identity: The nonequilibrium partition identity (NPI) is a remarkably simple and elegant consequence of the fluctuation theorem previously known as the Kawasaki identity:
|
nonlinear_functional_analysis
|
Nonlinear Functional Analysis
|
Nonlinear functional analysis is a branch of mathematical analysis that deals with nonlinear mappings.
|
https://en.wikipedia.org/wiki/Nonlinear_functional_analysis
|
Nonlinear Functional Analysis: Nonlinear functional analysis is a branch of mathematical analysis that deals with nonlinear mappings.
|
nonlinear_partial_differential_equation
|
Nonlinear Partial Differential Equation
|
In mathematics, a partial differential equation (PDE) is an equation which involves a multivariable function and one or more of its partial derivatives.
|
https://en.wikipedia.org/wiki/Partial_differential_equation
|
Nonlinear Partial Differential Equation: In mathematics, a partial differential equation (PDE) is an equation which involves a multivariable function and one or more of its partial derivatives.
|
nonnegative_matrix
|
Nonnegative Matrix
|
is a matrix in which all the elements are equal to or greater than zero, that is,
|
https://en.wikipedia.org/wiki/Nonnegative_matrix
|
Nonnegative Matrix: is a matrix in which all the elements are equal to or greater than zero, that is,
|
nonlinear_programming
|
Nonlinear Programming
|
In mathematics, nonlinear programming (NLP) is the process of solving an optimization problem where some of the constraints are not linear equalities or the objective function is not a linear function. An optimization problem is one of calculation of the extrema (maxima, minima or stationary points) of an objective function over a set of unknown real variables and conditional to the satisfaction of a system of equalities and inequalities, collectively termed constraints. It is the sub-field of mathematical optimization that deals with problems that are not linear.
|
https://en.wikipedia.org/wiki/Nonlinear_programming
|
Nonlinear Programming: In mathematics, nonlinear programming (NLP) is the process of solving an optimization problem where some of the constraints are not linear equalities or the objective function is not a linear function. An optimization problem is one of calculation of the extrema (maxima, minima or stationary points) of an objective function over a set of unknown real variables and conditional to the satisfaction of a system of equalities and inequalities, collectively termed constraints. It is the sub-field of mathematical optimization that deals with problems that are not linear.
|
nonobtuse_mesh
|
Nonobtuse Mesh
|
In computer graphics, a nonobtuse triangle mesh is a polygon mesh composed of a set of triangles in which no angle is obtuse, i.e. greater than 90Β°. If each (triangle) face angle is strictly less than 90Β°, then the triangle mesh is said to be acute. Every polygon with n {\displaystyle n} sides has a nonobtuse triangulation with O ( n ) {\displaystyle O(n)} triangles (expressed in big O notation), allowing some triangle vertices to be added to the sides and interior of the polygon. These nonobtuse triangulations can be further refined to produce acute triangulations with O ( n ) {\displaystyle O(n)} triangles.
|
https://en.wikipedia.org/wiki/Nonobtuse_mesh
|
Nonobtuse Mesh: In computer graphics, a nonobtuse triangle mesh is a polygon mesh composed of a set of triangles in which no angle is obtuse, i.e. greater than 90Β°. If each (triangle) face angle is strictly less than 90Β°, then the triangle mesh is said to be acute. Every polygon with n {\displaystyle n} sides has a nonobtuse triangulation with O ( n ) {\displaystyle O(n)} triangles (expressed in big O notation), allowing some triangle vertices to be added to the sides and interior of the polygon. These nonobtuse triangulations can be further refined to produce acute triangulations with O ( n ) {\displaystyle O(n)} triangles.
|
nonstandard_analysis
|
Nonstandard Analysis
|
The history of calculus is fraught with philosophical debates about the meaning and logical validity of fluxions or infinitesimal numbers. The standard way to resolve these debates is to define the operations of calculus using limits rather than infinitesimals. Nonstandard analysis instead reformulates the calculus using a logically rigorous notion of infinitesimal numbers.
|
https://en.wikipedia.org/wiki/Nonstandard_analysis
|
Nonstandard Analysis: The history of calculus is fraught with philosophical debates about the meaning and logical validity of fluxions or infinitesimal numbers. The standard way to resolve these debates is to define the operations of calculus using limits rather than infinitesimals. Nonstandard analysis instead reformulates the calculus using a logically rigorous notion of infinitesimal numbers.
|
normal_coordinates
|
Normal Coordinates
|
In differential geometry, normal coordinates at a point p in a differentiable manifold equipped with a symmetric affine connection are a local coordinate system in a neighborhood of p obtained by applying the exponential map to the tangent space at p. In a normal coordinate system, the Christoffel symbols of the connection vanish at the point p, thus often simplifying local calculations. In normal coordinates associated to the Levi-Civita connection of a Riemannian manifold, one can additionally arrange that the metric tensor is the Kronecker delta at the point p, and that the first partial derivatives of the metric at p vanish.
|
https://en.wikipedia.org/wiki/Normal_coordinates
|
Normal Coordinates: In differential geometry, normal coordinates at a point p in a differentiable manifold equipped with a symmetric affine connection are a local coordinate system in a neighborhood of p obtained by applying the exponential map to the tangent space at p. In a normal coordinate system, the Christoffel symbols of the connection vanish at the point p, thus often simplifying local calculations. In normal coordinates associated to the Levi-Civita connection of a Riemannian manifold, one can additionally arrange that the metric tensor is the Kronecker delta at the point p, and that the first partial derivatives of the metric at p vanish.
|
norm_mathematics
|
Norm Mathematics
|
In mathematics, a norm is a function from a real or complex vector space to the non-negative real numbers that behaves in certain ways like the distance from the origin: it commutes with scaling, obeys a form of the triangle inequality, and zero is only at the origin. In particular, the Euclidean distance in a Euclidean space is defined by a norm on the associated Euclidean vector space, called the Euclidean norm, the 2-norm, or, sometimes, the magnitude or length of the vector. This norm can be defined as the square root of the inner product of a vector with itself.
|
https://en.wikipedia.org/wiki/Norm_(mathematics)
|
Norm Mathematics: In mathematics, a norm is a function from a real or complex vector space to the non-negative real numbers that behaves in certain ways like the distance from the origin: it commutes with scaling, obeys a form of the triangle inequality, and zero is only at the origin. In particular, the Euclidean distance in a Euclidean space is defined by a norm on the associated Euclidean vector space, called the Euclidean norm, the 2-norm, or, sometimes, the magnitude or length of the vector. This norm can be defined as the square root of the inner product of a vector with itself.
|
normal_extension
|
Normal Extension
|
In abstract algebra, a normal extension is an algebraic field extension L/K for which every irreducible polynomial over K that has a root in L splits into linear factors over L. This is one of the conditions for an algebraic extension to be a Galois extension. Bourbaki calls such an extension a quasi-Galois extension. For finite extensions, a normal extension is identical to a splitting field.
|
https://en.wikipedia.org/wiki/Normal_extension
|
Normal Extension: In abstract algebra, a normal extension is an algebraic field extension L/K for which every irreducible polynomial over K that has a root in L splits into linear factors over L. This is one of the conditions for an algebraic extension to be a Galois extension. Bourbaki calls such an extension a quasi-Galois extension. For finite extensions, a normal extension is identical to a splitting field.
|
normal_family
|
Normal Family
|
A Normal Family (Korean: 보ν΅μ κ°μ‘±) is a 2023 South Korean drama film directed by Hur Jin-ho and written by Park Eun-kyo and Park Joon-seok, based on the 2009 novel The Dinner by Herman Koch. It is the fourth film adaptation of the novel, following the 2013 Dutch film Het Diner, the 2014 Italian film I nostri ragazzi, and the 2017 American film The Dinner. The film stars Sul Kyung-gu, Jang Dong-gun, Kim Hee-ae, and Claudia Kim. It centres on two wealthy families who meet for dinner to discuss and decide how to handle a violent crime committed by their children.
|
https://en.wikipedia.org/wiki/A_Normal_Family
|
Normal Family: A Normal Family (Korean: 보ν΅μ κ°μ‘±) is a 2023 South Korean drama film directed by Hur Jin-ho and written by Park Eun-kyo and Park Joon-seok, based on the 2009 novel The Dinner by Herman Koch. It is the fourth film adaptation of the novel, following the 2013 Dutch film Het Diner, the 2014 Italian film I nostri ragazzi, and the 2017 American film The Dinner. The film stars Sul Kyung-gu, Jang Dong-gun, Kim Hee-ae, and Claudia Kim. It centres on two wealthy families who meet for dinner to discuss and decide how to handle a violent crime committed by their children.
|
normal_geometry
|
Normal Geometry
|
In geometry, a normal is an object (e.g. a line, ray, or vector) that is perpendicular to a given object. For example, the normal line to a plane curve at a given point is the infinite straight line perpendicular to the tangent line to the curve at the point.
|
https://en.wikipedia.org/wiki/Normal_(geometry)
|
Normal Geometry: In geometry, a normal is an object (e.g. a line, ray, or vector) that is perpendicular to a given object. For example, the normal line to a plane curve at a given point is the infinite straight line perpendicular to the tangent line to the curve at the point.
|
normal_matrix
|
Normal Matrix
|
In mathematics, a complex square matrix A is normal if it commutes with its conjugate transpose A*:
|
https://en.wikipedia.org/wiki/Normal_matrix
|
Normal Matrix: In mathematics, a complex square matrix A is normal if it commutes with its conjugate transpose A*:
|
normal_distribution
|
Normal Distribution
|
I ( ΞΌ , Ο ) = ( 1 / Ο 2 0 0 2 / Ο 2 ) {\displaystyle {\mathcal {I}}(\mu ,\sigma )={\begin{pmatrix}1/\sigma ^{2}&0\\0&2/\sigma ^{2}\end{pmatrix}}}
|
https://en.wikipedia.org/wiki/Normal_distribution
|
Normal Distribution: I ( ΞΌ , Ο ) = ( 1 / Ο 2 0 0 2 / Ο 2 ) {\displaystyle {\mathcal {I}}(\mu ,\sigma )={\begin{pmatrix}1/\sigma ^{2}&0\\0&2/\sigma ^{2}\end{pmatrix}}}
|
normal_mode
|
Normal Mode
|
A normal mode of a dynamical system is a pattern of motion in which all parts of the system move sinusoidally with the same frequency and with a fixed phase relation. The free motion described by the normal modes takes place at fixed frequencies. These fixed frequencies of the normal modes of a system are known as its natural frequencies or resonant frequencies. A physical object, such as a building, bridge, or molecule, has a set of normal modes and their natural frequencies that depend on its structure, materials and boundary conditions.
|
https://en.wikipedia.org/wiki/Normal_mode
|
Normal Mode: A normal mode of a dynamical system is a pattern of motion in which all parts of the system move sinusoidally with the same frequency and with a fixed phase relation. The free motion described by the normal modes takes place at fixed frequencies. These fixed frequencies of the normal modes of a system are known as its natural frequencies or resonant frequencies. A physical object, such as a building, bridge, or molecule, has a set of normal modes and their natural frequencies that depend on its structure, materials and boundary conditions.
|
normal_number
|
Normal Number
|
In mathematics, a real number is said to be simply normal in an integer base b[Note 1] if its infinite sequence of digits is distributed uniformly in the sense that each of the b digit values has the same natural density 1/b. A number is said to be normal in base b if, for every positive integer n, all possible strings n digits long have density bβn.
|
https://en.wikipedia.org/wiki/Normal_number
|
Normal Number: In mathematics, a real number is said to be simply normal in an integer base b[Note 1] if its infinite sequence of digits is distributed uniformly in the sense that each of the b digit values has the same natural density 1/b. A number is said to be normal in base b if, for every positive integer n, all possible strings n digits long have density bβn.
|
normal_operator
|
Normal Operator
|
In mathematics, especially functional analysis, a normal operator on a complex Hilbert space H {\displaystyle H} is a continuous linear operator N : H β H {\displaystyle N\colon H\rightarrow H} that commutes with its Hermitian adjoint N β {\displaystyle N^{\ast }} , that is: N β N = N N β {\displaystyle N^{\ast }N=NN^{\ast }} .
|
https://en.wikipedia.org/wiki/Normal_operator
|
Normal Operator: In mathematics, especially functional analysis, a normal operator on a complex Hilbert space H {\displaystyle H} is a continuous linear operator N : H β H {\displaystyle N\colon H\rightarrow H} that commutes with its Hermitian adjoint N β {\displaystyle N^{\ast }} , that is: N β N = N N β {\displaystyle N^{\ast }N=NN^{\ast }} .
|
normal_p_complement
|
Normal P Complement
|
In group theory, a branch of mathematics, a normal p-complement of a finite group for a prime p is a normal subgroup of order coprime to p and index a power of p. In other words the group is a semidirect product of the normal p-complement and any Sylow p-subgroup. A group is called p-nilpotent if it has a normal p-complement.
|
https://en.wikipedia.org/wiki/Normal_p-complement
|
Normal P Complement: In group theory, a branch of mathematics, a normal p-complement of a finite group for a prime p is a normal subgroup of order coprime to p and index a power of p. In other words the group is a semidirect product of the normal p-complement and any Sylow p-subgroup. A group is called p-nilpotent if it has a normal p-complement.
|
normal_plane_geometry
|
Normal Plane Geometry
|
In geometry, a normal plane is any plane containing the normal vector of a surface at a particular point.
|
https://en.wikipedia.org/wiki/Normal_plane_(geometry)
|
Normal Plane Geometry: In geometry, a normal plane is any plane containing the normal vector of a surface at a particular point.
|
normal_space
|
Normal Space
|
In topology and related branches of mathematics, a normal space is a topological space in which any two disjoint closed sets have disjoint open neighborhoods. Such spaces need not be Hausdorff in general. A normal Hausdorff space is called a T4 space. Strengthenings of these concepts are detailed in the article below and include completely normal spaces and perfectly normal spaces, and their Hausdorff variants: T5 spaces and T6 spaces. All these conditions are examples of separation axioms.
|
https://en.wikipedia.org/wiki/Normal_space
|
Normal Space: In topology and related branches of mathematics, a normal space is a topological space in which any two disjoint closed sets have disjoint open neighborhoods. Such spaces need not be Hausdorff in general. A normal Hausdorff space is called a T4 space. Strengthenings of these concepts are detailed in the article below and include completely normal spaces and perfectly normal spaces, and their Hausdorff variants: T5 spaces and T6 spaces. All these conditions are examples of separation axioms.
|
normal_surface
|
Normal Surface
|
In mathematics, a normal surface is a surface inside a triangulated 3-manifold that intersects each tetrahedron in several components called normal disks. Each normal disk is either a triangle which cuts off a vertex of the tetrahedron, or a quadrilateral which separates pairs of vertices. In a given tetrahedron there cannot be two quadrilaterals separating different pairs of vertices, since such quadrilaterals would intersect in a line, causing the surface to be self-intersecting.
|
https://en.wikipedia.org/wiki/Normal_surface
|
Normal Surface: In mathematics, a normal surface is a surface inside a triangulated 3-manifold that intersects each tetrahedron in several components called normal disks. Each normal disk is either a triangle which cuts off a vertex of the tetrahedron, or a quadrilateral which separates pairs of vertices. In a given tetrahedron there cannot be two quadrilaterals separating different pairs of vertices, since such quadrilaterals would intersect in a line, causing the surface to be self-intersecting.
|
normal_subgroup
|
Normal Subgroup
|
In abstract algebra, a normal subgroup (also known as an invariant subgroup or self-conjugate subgroup) is a subgroup that is invariant under conjugation by members of the group of which it is a part. In other words, a subgroup N {\displaystyle N} of the group G {\displaystyle G} is normal in G {\displaystyle G} if and only if g n g β 1 β N {\displaystyle gng^{-1}\in N} for all g β G {\displaystyle g\in G} and n β N . {\displaystyle n\in N.} The usual notation for this relation is N β G . {\displaystyle N\triangleleft G.}
|
https://en.wikipedia.org/wiki/Normal_subgroup
|
Normal Subgroup: In abstract algebra, a normal subgroup (also known as an invariant subgroup or self-conjugate subgroup) is a subgroup that is invariant under conjugation by members of the group of which it is a part. In other words, a subgroup N {\displaystyle N} of the group G {\displaystyle G} is normal in G {\displaystyle G} if and only if g n g β 1 β N {\displaystyle gng^{-1}\in N} for all g β G {\displaystyle g\in G} and n β N . {\displaystyle n\in N.} The usual notation for this relation is N β G . {\displaystyle N\triangleleft G.}
|
normalization_statistics
|
Normalization Statistics
|
In statistics and applications of statistics, normalization can have a range of meanings. In the simplest cases, normalization of ratings means adjusting values measured on different scales to a notionally common scale, often prior to averaging. In more complicated cases, normalization may refer to more sophisticated adjustments where the intention is to bring the entire probability distributions of adjusted values into alignment. In the case of normalization of scores in educational assessment, there may be an intention to align distributions to a normal distribution. A different approach to normalization of probability distributions is quantile normalization, where the quantiles of the different measures are brought into alignment.
|
https://en.wikipedia.org/wiki/Normalization_(statistics)
|
Normalization Statistics: In statistics and applications of statistics, normalization can have a range of meanings. In the simplest cases, normalization of ratings means adjusting values measured on different scales to a notionally common scale, often prior to averaging. In more complicated cases, normalization may refer to more sophisticated adjustments where the intention is to bring the entire probability distributions of adjusted values into alignment. In the case of normalization of scores in educational assessment, there may be an intention to align distributions to a normal distribution. A different approach to normalization of probability distributions is quantile normalization, where the quantiles of the different measures are brought into alignment.
|
normed_algebra
|
Normed Algebra
|
In mathematics, a normed algebra A is an algebra over a field which has a sub-multiplicative norm:
|
https://en.wikipedia.org/wiki/Normed_algebra
|
Normed Algebra: In mathematics, a normed algebra A is an algebra over a field which has a sub-multiplicative norm:
|
notation_for_differentiation
|
Notation For Differentiation
|
In differential calculus, there is no single standard notation for differentiation. Instead, several notations for the derivative of a function or a dependent variable have been proposed by various mathematicians, including Leibniz, Newton, Lagrange, and Arbogast. The usefulness of each notation depends on the context in which it is used, and it is sometimes advantageous to use more than one notation in a given context. For more specialized settingsβsuch as partial derivatives in multivariable calculus, tensor analysis, or vector calculusβother notations, such as subscript notation or the β operator are common. The most common notations for differentiation (and its opposite operation, antidifferentiation or indefinite integration) are listed below.
|
https://en.wikipedia.org/wiki/Notation_for_differentiation
|
Notation For Differentiation: In differential calculus, there is no single standard notation for differentiation. Instead, several notations for the derivative of a function or a dependent variable have been proposed by various mathematicians, including Leibniz, Newton, Lagrange, and Arbogast. The usefulness of each notation depends on the context in which it is used, and it is sometimes advantageous to use more than one notation in a given context. For more specialized settingsβsuch as partial derivatives in multivariable calculus, tensor analysis, or vector calculusβother notations, such as subscript notation or the β operator are common. The most common notations for differentiation (and its opposite operation, antidifferentiation or indefinite integration) are listed below.
|
normed_vector_space
|
Normed Vector Space
|
In mathematics, a normed vector space or normed space is a vector space, typically over the real or complex numbers, on which a norm is defined. A norm is a generalization of the intuitive notion of "length" in the physical world. If V {\displaystyle V} is a vector space over K {\displaystyle K} , where K {\displaystyle K} is a field equal to R {\displaystyle \mathbb {R} } or to C {\displaystyle \mathbb {C} } , then a norm on V {\displaystyle V} is a map V β R {\displaystyle V\to \mathbb {R} } , typically denoted by β β
β {\displaystyle \lVert \cdot \rVert } , satisfying the following four axioms:
|
https://en.wikipedia.org/wiki/Normed_vector_space
|
Normed Vector Space: In mathematics, a normed vector space or normed space is a vector space, typically over the real or complex numbers, on which a norm is defined. A norm is a generalization of the intuitive notion of "length" in the physical world. If V {\displaystyle V} is a vector space over K {\displaystyle K} , where K {\displaystyle K} is a field equal to R {\displaystyle \mathbb {R} } or to C {\displaystyle \mathbb {C} } , then a norm on V {\displaystyle V} is a map V β R {\displaystyle V\to \mathbb {R} } , typically denoted by β β
β {\displaystyle \lVert \cdot \rVert } , satisfying the following four axioms:
|
nowhere_dense_set
|
Nowhere Dense Set
|
In mathematics, a subset of a topological space is called nowhere dense or rare if its closure has empty interior. In a very loose sense, it is a set whose elements are not tightly clustered (as defined by the topology on the space) anywhere. For example, the integers are nowhere dense among the reals, whereas the interval (0, 1) is not nowhere dense.
|
https://en.wikipedia.org/wiki/Nowhere_dense_set
|
Nowhere Dense Set: In mathematics, a subset of a topological space is called nowhere dense or rare if its closure has empty interior. In a very loose sense, it is a set whose elements are not tightly clustered (as defined by the topology on the space) anywhere. For example, the integers are nowhere dense among the reals, whereas the interval (0, 1) is not nowhere dense.
|
np_co_np_problem
|
Np Co Np Problem
|
In computational complexity theory, NP-complete problems are the hardest of the problems to which solutions can be verified quickly. Somewhat more precisely, a problem is NP-complete when:
|
https://en.wikipedia.org/wiki/NP-completeness
|
Np Co Np Problem: In computational complexity theory, NP-complete problems are the hardest of the problems to which solutions can be verified quickly. Somewhat more precisely, a problem is NP-complete when:
|
nowhere_continuous_function
|
Nowhere Continuous Function
|
In mathematics, a nowhere continuous function, also called an everywhere discontinuous function, is a function that is not continuous at any point of its domain. If f {\displaystyle f} is a function from real numbers to real numbers, then f {\displaystyle f} is nowhere continuous if for each point x {\displaystyle x} there is some Ξ΅ > 0 {\displaystyle \varepsilon >0} such that for every Ξ΄ > 0 , {\displaystyle \delta >0,} we can find a point y {\displaystyle y} such that | x β y | < Ξ΄ {\displaystyle |x-y|<\delta } and | f ( x ) β f ( y ) | β₯ Ξ΅ {\displaystyle |f(x)-f(y)|\geq \varepsilon } . Therefore, no matter how close it gets to any fixed point, there are even closer points at which the function takes not-nearby values.
|
https://en.wikipedia.org/wiki/Nowhere_continuous_function
|
Nowhere Continuous Function: In mathematics, a nowhere continuous function, also called an everywhere discontinuous function, is a function that is not continuous at any point of its domain. If f {\displaystyle f} is a function from real numbers to real numbers, then f {\displaystyle f} is nowhere continuous if for each point x {\displaystyle x} there is some Ξ΅ > 0 {\displaystyle \varepsilon >0} such that for every Ξ΄ > 0 , {\displaystyle \delta >0,} we can find a point y {\displaystyle y} such that | x β y | < Ξ΄ {\displaystyle |x-y|<\delta } and | f ( x ) β f ( y ) | β₯ Ξ΅ {\displaystyle |f(x)-f(y)|\geq \varepsilon } . Therefore, no matter how close it gets to any fixed point, there are even closer points at which the function takes not-nearby values.
|
np_completeness
|
Np Completeness
|
In computational complexity theory, NP-complete problems are the hardest of the problems to which solutions can be verified quickly. Somewhat more precisely, a problem is NP-complete when:
|
https://en.wikipedia.org/wiki/NP-completeness
|
Np Completeness: In computational complexity theory, NP-complete problems are the hardest of the problems to which solutions can be verified quickly. Somewhat more precisely, a problem is NP-complete when:
|
np_hardness
|
Np Hardness
|
In computational complexity theory, a computational problem H is called NP-hard if, for every problem L which can be solved in non-deterministic polynomial-time, there is a polynomial-time reduction from L to H. That is, assuming a solution for H takes 1 unit time, H's solution can be used to solve L in polynomial time. As a consequence, finding a polynomial time algorithm to solve a single NP-hard problem would give polynomial time algorithms for all the problems in the complexity class NP. As it is suspected, but unproven, that Pβ NP, it is unlikely that any polynomial-time algorithms for NP-hard problems exist.
|
https://en.wikipedia.org/wiki/NP-hardness
|
Np Hardness: In computational complexity theory, a computational problem H is called NP-hard if, for every problem L which can be solved in non-deterministic polynomial-time, there is a polynomial-time reduction from L to H. That is, assuming a solution for H takes 1 unit time, H's solution can be used to solve L in polynomial time. As a consequence, finding a polynomial time algorithm to solve a single NP-hard problem would give polynomial time algorithms for all the problems in the complexity class NP. As it is suspected, but unproven, that Pβ NP, it is unlikely that any polynomial-time algorithms for NP-hard problems exist.
|
nth_root
|
Nth Root
|
In mathematics, an nth root of a number x is a number r which, when raised to the power of n, yields x: r n = r Γ r Γ β― Γ r β n factors = x . {\displaystyle r^{n}=\underbrace {r\times r\times \dotsb \times r} _{n{\text{ factors}}}=x.}
|
https://en.wikipedia.org/wiki/Nth_root
|
Nth Root: In mathematics, an nth root of a number x is a number r which, when raised to the power of n, yields x: r n = r Γ r Γ β― Γ r β n factors = x . {\displaystyle r^{n}=\underbrace {r\times r\times \dotsb \times r} _{n{\text{ factors}}}=x.}
|
null_graph
|
Null Graph
|
In the mathematical field of graph theory, the term "null graph" may refer either to the order-zero graph, or alternatively, to any edgeless graph (the latter is sometimes called an "empty graph").
|
https://en.wikipedia.org/wiki/Null_graph
|
Null Graph: In the mathematical field of graph theory, the term "null graph" may refer either to the order-zero graph, or alternatively, to any edgeless graph (the latter is sometimes called an "empty graph").
|
null_hypothesis
|
Null Hypothesis
|
The null hypothesis (often denoted H0) is the claim in scientific research that the effect being studied does not exist.[note 1] The null hypothesis can also be described as the hypothesis in which no relationship exists between two sets of data or variables being analyzed. If the null hypothesis is true, any experimentally observed effect is due to chance alone, hence the term "null". In contrast with the null hypothesis, an alternative hypothesis (often denoted HA or H1) is developed, which claims that a relationship does exist between two variables.
|
https://en.wikipedia.org/wiki/Null_hypothesis
|
Null Hypothesis: The null hypothesis (often denoted H0) is the claim in scientific research that the effect being studied does not exist.[note 1] The null hypothesis can also be described as the hypothesis in which no relationship exists between two sets of data or variables being analyzed. If the null hypothesis is true, any experimentally observed effect is due to chance alone, hence the term "null". In contrast with the null hypothesis, an alternative hypothesis (often denoted HA or H1) is developed, which claims that a relationship does exist between two variables.
|
nth_term_test
|
Nth Term Test
|
In mathematics, the nth-term test for divergence is a simple test for the divergence of an infinite series:
|
https://en.wikipedia.org/wiki/Nth-term_test
|
Nth Term Test: In mathematics, the nth-term test for divergence is a simple test for the divergence of an infinite series:
|
null_set
|
Null Set
|
In mathematical analysis, a null set is a Lebesgue measurable set of real numbers that has measure zero. This can be characterized as a set that can be covered by a countable union of intervals of arbitrarily small total length.
|
https://en.wikipedia.org/wiki/Null_set
|
Null Set: In mathematical analysis, a null set is a Lebesgue measurable set of real numbers that has measure zero. This can be characterized as a set that can be covered by a countable union of intervals of arbitrarily small total length.
|
null_vector
|
Null Vector
|
In mathematics, given a vector space X with an associated quadratic form q, written (X, q), a null vector or isotropic vector is a non-zero element x of X for which q(x) = 0.
|
https://en.wikipedia.org/wiki/Null_vector
|
Null Vector: In mathematics, given a vector space X with an associated quadratic form q, written (X, q), a null vector or isotropic vector is a non-zero element x of X for which q(x) = 0.
|
nullity_theorem
|
Nullity Theorem
|
The rankβnullity theorem is a theorem in linear algebra, which asserts:
|
https://en.wikipedia.org/wiki/Rank%E2%80%93nullity_theorem
|
Nullity Theorem: The rankβnullity theorem is a theorem in linear algebra, which asserts:
|
nullspace_property
|
Nullspace Property
|
In compressed sensing, the nullspace property gives necessary and sufficient conditions on the reconstruction of sparse signals using the techniques of β 1 {\displaystyle \ell _{1}} -relaxation. The term "nullspace property" originates from Cohen, Dahmen, and DeVore. The nullspace property is often difficult to check in practice, and the restricted isometry property is a more modern condition in the field of compressed sensing.
|
https://en.wikipedia.org/wiki/Nullspace_property
|
Nullspace Property: In compressed sensing, the nullspace property gives necessary and sufficient conditions on the reconstruction of sparse signals using the techniques of β 1 {\displaystyle \ell _{1}} -relaxation. The term "nullspace property" originates from Cohen, Dahmen, and DeVore. The nullspace property is often difficult to check in practice, and the restricted isometry property is a more modern condition in the field of compressed sensing.
|
number
|
Number
|
A number is a mathematical object used to count, measure, and label. The most basic examples are the natural numbers 1, 2, 3, 4, and so forth. Individual numbers can be represented in language with number words or by dedicated symbols called numerals; for example, "five" is a number word and "5" is the corresponding numeral. As only a relatively small number of symbols can be memorized, basic numerals are commonly arranged in a numeral system, which is an organized way to represent any number. The most common numeral system is the HinduβArabic numeral system, which allows for the representation of any non-negative integer using a combination of ten fundamental numeric symbols, called digits.[a] In addition to their use in counting and measuring, numerals are often used for labels (as with telephone numbers), for ordering (as with serial numbers), and for codes (as with ISBNs). In common usage, a numeral is not clearly distinguished from the number that it represents.
|
https://en.wikipedia.org/wiki/Number
|
Number: A number is a mathematical object used to count, measure, and label. The most basic examples are the natural numbers 1, 2, 3, 4, and so forth. Individual numbers can be represented in language with number words or by dedicated symbols called numerals; for example, "five" is a number word and "5" is the corresponding numeral. As only a relatively small number of symbols can be memorized, basic numerals are commonly arranged in a numeral system, which is an organized way to represent any number. The most common numeral system is the HinduβArabic numeral system, which allows for the representation of any non-negative integer using a combination of ten fundamental numeric symbols, called digits.[a] In addition to their use in counting and measuring, numerals are often used for labels (as with telephone numbers), for ordering (as with serial numbers), and for codes (as with ISBNs). In common usage, a numeral is not clearly distinguished from the number that it represents.
|
number_line
|
Number Line
|
A number line is a graphical representation of a straight line that serves as spatial representation of numbers, usually graduated like a ruler with a particular origin point representing the number zero and evenly spaced marks in either direction representing integers, imagined to extend infinitely. The association between numbers and points on the line links arithmetical operations on numbers to geometric relations between points, and provides a conceptual framework for learning mathematics.
|
https://en.wikipedia.org/wiki/Number_line
|
Number Line: A number line is a graphical representation of a straight line that serves as spatial representation of numbers, usually graduated like a ruler with a particular origin point representing the number zero and evenly spaced marks in either direction representing integers, imagined to extend infinitely. The association between numbers and points on the line links arithmetical operations on numbers to geometric relations between points, and provides a conceptual framework for learning mathematics.
|
number_partitioning
|
Number Partitioning
|
In computer science, multiway number partitioning is the problem of partitioning a multiset of numbers into a fixed number of subsets, such that the sums of the subsets are as similar as possible. It was first presented by Ronald Graham in 1969 in the context of the identical-machines scheduling problem.: sec.5 The problem is parametrized by a positive integer k, and called k-way number partitioning. The input to the problem is a multiset S of numbers (usually integers), whose sum is k*T.
|
https://en.wikipedia.org/wiki/Multiway_number_partitioning
|
Number Partitioning: In computer science, multiway number partitioning is the problem of partitioning a multiset of numbers into a fixed number of subsets, such that the sums of the subsets are as similar as possible. It was first presented by Ronald Graham in 1969 in the context of the identical-machines scheduling problem.: sec.5 The problem is parametrized by a positive integer k, and called k-way number partitioning. The input to the problem is a multiset S of numbers (usually integers), whose sum is k*T.
|
numeral_system
|
Numeral System
|
A numeral system is a writing system for expressing numbers; that is, a mathematical notation for representing numbers of a given set, using digits or other symbols in a consistent manner.
|
https://en.wikipedia.org/wiki/Numeral_system
|
Numeral System: A numeral system is a writing system for expressing numbers; that is, a mathematical notation for representing numbers of a given set, using digits or other symbols in a consistent manner.
|
number_theory
|
Number Theory
|
Number theory is a branch of pure mathematics devoted primarily to the study of the integers and arithmetic functions. Number theorists study prime numbers as well as the properties of mathematical objects constructed from integers (for example, rational numbers), or defined as generalizations of the integers (for example, algebraic integers).
|
https://en.wikipedia.org/wiki/Number_theory
|
Number Theory: Number theory is a branch of pure mathematics devoted primarily to the study of the integers and arithmetic functions. Number theorists study prime numbers as well as the properties of mathematical objects constructed from integers (for example, rational numbers), or defined as generalizations of the integers (for example, algebraic integers).
|
numeral_systems
|
Numeral Systems
|
A numeral system is a writing system for expressing numbers; that is, a mathematical notation for representing numbers of a given set, using digits or other symbols in a consistent manner.
|
https://en.wikipedia.org/wiki/Numeral_system
|
Numeral Systems: A numeral system is a writing system for expressing numbers; that is, a mathematical notation for representing numbers of a given set, using digits or other symbols in a consistent manner.
|
numerals
|
Numerals
|
A numeral is a figure (symbol), word, or group of figures (symbols) or words denoting a number. It may refer to:
|
https://en.wikipedia.org/wiki/Numeral
|
Numerals: A numeral is a figure (symbol), word, or group of figures (symbols) or words denoting a number. It may refer to:
|
numerical_equivalence
|
Numerical Equivalence
|
In algebraic geometry, a branch of mathematics, an adequate equivalence relation is an equivalence relation on algebraic cycles of smooth projective varieties used to obtain a well-working theory of such cycles, and in particular, well-defined intersection products. Pierre Samuel formalized the concept of an adequate equivalence relation in 1958. Since then it has become central to theory of motives. For every adequate equivalence relation, one may define the category of pure motives with respect to that relation.
|
https://en.wikipedia.org/wiki/Adequate_equivalence_relation
|
Numerical Equivalence: In algebraic geometry, a branch of mathematics, an adequate equivalence relation is an equivalence relation on algebraic cycles of smooth projective varieties used to obtain a well-working theory of such cycles, and in particular, well-defined intersection products. Pierre Samuel formalized the concept of an adequate equivalence relation in 1958. Since then it has become central to theory of motives. For every adequate equivalence relation, one may define the category of pure motives with respect to that relation.
|
numerical_differentiation
|
Numerical Differentiation
|
In numerical analysis, numerical differentiation algorithms estimate the derivative of a mathematical function or subroutine using values of the function and perhaps other knowledge about the function.
|
https://en.wikipedia.org/wiki/Numerical_differentiation
|
Numerical Differentiation: In numerical analysis, numerical differentiation algorithms estimate the derivative of a mathematical function or subroutine using values of the function and perhaps other knowledge about the function.
|
numerical_error
|
Numerical Error
|
In software engineering and mathematics, numerical error is the error in the numerical computations.
|
https://en.wikipedia.org/wiki/Numerical_error
|
Numerical Error: In software engineering and mathematics, numerical error is the error in the numerical computations.
|
numerical_integration
|
Numerical Integration
|
In analysis, numerical integration comprises a broad family of algorithms for calculating the numerical value of a definite integral. The term numerical quadrature (often abbreviated to quadrature) is more or less a synonym for "numerical integration", especially as applied to one-dimensional integrals. Some authors refer to numerical integration over more than one dimension as cubature; others take "quadrature" to include higher-dimensional integration.
|
https://en.wikipedia.org/wiki/Numerical_integration
|
Numerical Integration: In analysis, numerical integration comprises a broad family of algorithms for calculating the numerical value of a definite integral. The term numerical quadrature (often abbreviated to quadrature) is more or less a synonym for "numerical integration", especially as applied to one-dimensional integrals. Some authors refer to numerical integration over more than one dimension as cubature; others take "quadrature" to include higher-dimensional integration.
|
numerical_method
|
Numerical Method
|
Numerical analysis is the study of algorithms that use numerical approximation (as opposed to symbolic manipulations) for the problems of mathematical analysis (as distinguished from discrete mathematics). It is the study of numerical methods that attempt to find approximate solutions of problems rather than the exact ones. Numerical analysis finds application in all fields of engineering and the physical sciences, and in the 21st century also the life and social sciences like economics, medicine, business and even the arts. Current growth in computing power has enabled the use of more complex numerical analysis, providing detailed and realistic mathematical models in science and engineering. Examples of numerical analysis include: ordinary differential equations as found in celestial mechanics (predicting the motions of planets, stars and galaxies), numerical linear algebra in data analysis, and stochastic differential equations and Markov chains for simulating living cells in medicine and biology.
|
https://en.wikipedia.org/wiki/Numerical_analysis
|
Numerical Method: Numerical analysis is the study of algorithms that use numerical approximation (as opposed to symbolic manipulations) for the problems of mathematical analysis (as distinguished from discrete mathematics). It is the study of numerical methods that attempt to find approximate solutions of problems rather than the exact ones. Numerical analysis finds application in all fields of engineering and the physical sciences, and in the 21st century also the life and social sciences like economics, medicine, business and even the arts. Current growth in computing power has enabled the use of more complex numerical analysis, providing detailed and realistic mathematical models in science and engineering. Examples of numerical analysis include: ordinary differential equations as found in celestial mechanics (predicting the motions of planets, stars and galaxies), numerical linear algebra in data analysis, and stochastic differential equations and Markov chains for simulating living cells in medicine and biology.
|
numerical_methods_for_differential_equations
|
Numerical Methods For Differential Equations
|
Numerical methods for ordinary differential equations are methods used to find numerical approximations to the solutions of ordinary differential equations (ODEs). Their use is also known as "numerical integration", although this term can also refer to the computation of integrals.
|
https://en.wikipedia.org/wiki/Numerical_methods_for_ordinary_differential_equations
|
Numerical Methods For Differential Equations: Numerical methods for ordinary differential equations are methods used to find numerical approximations to the solutions of ordinary differential equations (ODEs). Their use is also known as "numerical integration", although this term can also refer to the computation of integrals.
|
numerical_methods_for_ordinary_differential_equations
|
Numerical Methods For Ordinary Differential Equations
|
Numerical methods for partial differential equations is the branch of numerical analysis that studies the numerical solution of partial differential equations (PDEs).
|
https://en.wikipedia.org/wiki/Numerical_methods_for_partial_differential_equations
|
Numerical Methods For Ordinary Differential Equations: Numerical methods for partial differential equations is the branch of numerical analysis that studies the numerical solution of partial differential equations (PDEs).
|
numerical_sign_problem
|
Numerical Sign Problem
|
In applied mathematics, the numerical sign problem is the problem of numerically evaluating the integral of a highly oscillatory function of a large number of variables. Numerical methods fail because of the near-cancellation of the positive and negative contributions to the integral. Each has to be integrated to very high precision in order for their difference to be obtained with useful accuracy.
|
https://en.wikipedia.org/wiki/Numerical_sign_problem
|
Numerical Sign Problem: In applied mathematics, the numerical sign problem is the problem of numerically evaluating the integral of a highly oscillatory function of a large number of variables. Numerical methods fail because of the near-cancellation of the positive and negative contributions to the integral. Each has to be integrated to very high precision in order for their difference to be obtained with useful accuracy.
|
numerical_stability
|
Numerical Stability
|
In the mathematical subfield of numerical analysis, numerical stability is a generally desirable property of numerical algorithms. The precise definition of stability depends on the context: one important context is numerical linear algebra, and another is algorithms for solving ordinary and partial differential equations by discrete approximation.
|
https://en.wikipedia.org/wiki/Numerical_stability
|
Numerical Stability: In the mathematical subfield of numerical analysis, numerical stability is a generally desirable property of numerical algorithms. The precise definition of stability depends on the context: one important context is numerical linear algebra, and another is algorithms for solving ordinary and partial differential equations by discrete approximation.
|
oblique_reflection
|
Oblique Reflection
|
In Euclidean geometry, oblique reflections generalize ordinary reflections by not requiring that reflection be done using perpendiculars. If two points are oblique reflections of each other, they will still stay so under affine transformations.
|
https://en.wikipedia.org/wiki/Oblique_reflection
|
Oblique Reflection: In Euclidean geometry, oblique reflections generalize ordinary reflections by not requiring that reflection be done using perpendiculars. If two points are oblique reflections of each other, they will still stay so under affine transformations.
|
octagon
|
Octagon
|
In geometry, an octagon (from Ancient Greek α½ΞΊΟάγΟΞ½ΞΏΞ½ (oktΓ‘gΕnon) 'eight angles') is an eight-sided polygon or 8-gon.
|
https://en.wikipedia.org/wiki/Octagon
|
Octagon: In geometry, an octagon (from Ancient Greek α½ΞΊΟάγΟΞ½ΞΏΞ½ (oktΓ‘gΕnon) 'eight angles') is an eight-sided polygon or 8-gon.
|
occupancy_frequency_distribution
|
Occupancy Frequency Distribution
|
In macroecology and community ecology, an occupancy frequency distribution (OFD) is the distribution of the numbers of species occupying different numbers of areas. It was first reported in 1918 by the Danish botanist Christen C. Raunkiær in his study on plant communities. The OFD is also known as the species-range size distribution in literature.
|
https://en.wikipedia.org/wiki/Occupancy_frequency_distribution
|
Occupancy Frequency Distribution: In macroecology and community ecology, an occupancy frequency distribution (OFD) is the distribution of the numbers of species occupying different numbers of areas. It was first reported in 1918 by the Danish botanist Christen C. Raunkiær in his study on plant communities. The OFD is also known as the species-range size distribution in literature.
|
octagonal_prism
|
Octagonal Prism
|
In geometry, the octagonal prism is a prism comprising eight rectangular sides joining two regular octagon caps.
|
https://en.wikipedia.org/wiki/Octagonal_prism
|
Octagonal Prism: In geometry, the octagonal prism is a prism comprising eight rectangular sides joining two regular octagon caps.
|
octahedral_graph
|
Octahedral Graph
|
In geometry, a regular octahedron is a highly symmetrical type of octahedron (eight-sided polyhedron) with eight equilateral triangles as its faces, four of which meet at each vertex. It is a type of square bipyramid or triangular antiprism with equal-length edges. Regular octahedra occur in nature as crystal structures. Other types of octahedra also exist, with various amounts of symmetry.
|
https://en.wikipedia.org/wiki/Regular_octahedron
|
Octahedral Graph: In geometry, a regular octahedron is a highly symmetrical type of octahedron (eight-sided polyhedron) with eight equilateral triangles as its faces, four of which meet at each vertex. It is a type of square bipyramid or triangular antiprism with equal-length edges. Regular octahedra occur in nature as crystal structures. Other types of octahedra also exist, with various amounts of symmetry.
|
octahedral_symmetry
|
Octahedral Symmetry
|
A regular octahedron has 24 rotational (or orientation-preserving) symmetries, and 48 symmetries altogether. These include transformations that combine a reflection and a rotation. A cube has the same set of symmetries, since it is the polyhedron that is dual to an octahedron.
|
https://en.wikipedia.org/wiki/Octahedral_symmetry
|
Octahedral Symmetry: A regular octahedron has 24 rotational (or orientation-preserving) symmetries, and 48 symmetries altogether. These include transformations that combine a reflection and a rotation. A cube has the same set of symmetries, since it is the polyhedron that is dual to an octahedron.
|
octahedron
|
Octahedron
|
In geometry, an octahedron (pl.: octahedra or octahedrons) is any polyhedron with eight faces. One special case is the regular octahedron, a Platonic solid composed of eight equilateral triangles, four of which meet at each vertex. Many types of irregular octahedra also exist, including both convex and non-convex shapes.
|
https://en.wikipedia.org/wiki/Octahedron
|
Octahedron: In geometry, an octahedron (pl.: octahedra or octahedrons) is any polyhedron with eight faces. One special case is the regular octahedron, a Platonic solid composed of eight equilateral triangles, four of which meet at each vertex. Many types of irregular octahedra also exist, including both convex and non-convex shapes.
|
octal_game
|
Octal Game
|
Octal games are a subclass of heap games that involve removing tokens (game pieces or stones) from heaps of tokens. They have been studied in combinatorial game theory as a generalization of Nim, Kayles, and similar games.
|
https://en.wikipedia.org/wiki/Octal_game
|
Octal Game: Octal games are a subclass of heap games that involve removing tokens (game pieces or stones) from heaps of tokens. They have been studied in combinatorial game theory as a generalization of Nim, Kayles, and similar games.
|
octant_of_a_sphere
|
Octant Of A Sphere
|
In geometry, an octant of a sphere is a spherical triangle with three right angles and three right sides. It is sometimes called a trirectangular (spherical) triangle. It is one face of a spherical octahedron.
|
https://en.wikipedia.org/wiki/Octant_of_a_sphere
|
Octant Of A Sphere: In geometry, an octant of a sphere is a spherical triangle with three right angles and three right sides. It is sometimes called a trirectangular (spherical) triangle. It is one face of a spherical octahedron.
|
octant_solid_geometry
|
Octant Solid Geometry
|
An octant in solid geometry is one of the eight divisions of a Euclidean three-dimensional coordinate system defined by the signs of the coordinates. It is analogous to the two-dimensional quadrant and the one-dimensional ray. The generalization of an octant is called orthant or hyperoctant.
|
https://en.wikipedia.org/wiki/Octant_(solid_geometry)
|
Octant Solid Geometry: An octant in solid geometry is one of the eight divisions of a Euclidean three-dimensional coordinate system defined by the signs of the coordinates. It is analogous to the two-dimensional quadrant and the one-dimensional ray. The generalization of an octant is called orthant or hyperoctant.
|
octic_function
|
Octic Function
|
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 polynomial is simply the highest exponent occurring in the polynomial. 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)).
|
https://en.wikipedia.org/wiki/Degree_of_a_polynomial
|
Octic Function: 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 polynomial is simply the highest exponent occurring in the polynomial. 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)).
|
octonion
|
Octonion
|
In mathematics, the octonions are a normed division algebra over the real numbers, a kind of hypercomplex number system. The octonions are usually represented by the capital letter O, using boldface O or blackboard bold O {\displaystyle \mathbb {O} } . Octonions have eight dimensions; twice the number of dimensions of the quaternions, of which they are an extension. They are noncommutative and nonassociative, but satisfy a weaker form of associativity; namely, they are alternative. They are also power associative.
|
https://en.wikipedia.org/wiki/Octonion
|
Octonion: In mathematics, the octonions are a normed division algebra over the real numbers, a kind of hypercomplex number system. The octonions are usually represented by the capital letter O, using boldface O or blackboard bold O {\displaystyle \mathbb {O} } . Octonions have eight dimensions; twice the number of dimensions of the quaternions, of which they are an extension. They are noncommutative and nonassociative, but satisfy a weaker form of associativity; namely, they are alternative. They are also power associative.
|
odd_number
|
Odd Number
|
In mathematics, parity is the property of an integer of whether it is even or odd. An integer is even if it is divisible by 2, and odd if it is not. For example, β4, 0, and 82 are even numbers, while β3, 5, 23, and 67 are odd numbers.
|
https://en.wikipedia.org/wiki/Parity_(mathematics)
|
Odd Number: In mathematics, parity is the property of an integer of whether it is even or odd. An integer is even if it is divisible by 2, and odd if it is not. For example, β4, 0, and 82 are even numbers, while β3, 5, 23, and 67 are odd numbers.
|
odd_number_theorem
|
Odd Number Theorem
|
The odd number theorem is a theorem in strong gravitational lensing which comes directly from differential topology.
|
https://en.wikipedia.org/wiki/Odd_number_theorem
|
Odd Number Theorem: The odd number theorem is a theorem in strong gravitational lensing which comes directly from differential topology.
|
odd_perfect_number
|
Odd Perfect Number
|
In number theory, a perfect number is a positive integer that is equal to the sum of its positive proper divisors, that is, divisors excluding the number itself. For instance, 6 has proper divisors 1, 2, and 3, and 1 + 2 + 3 = 6, so 6 is a perfect number. The next perfect number is 28, because 1 + 2 + 4 + 7 + 14 = 28.
|
https://en.wikipedia.org/wiki/Perfect_number
|
Odd Perfect Number: In number theory, a perfect number is a positive integer that is equal to the sum of its positive proper divisors, that is, divisors excluding the number itself. For instance, 6 has proper divisors 1, 2, and 3, and 1 + 2 + 3 = 6, so 6 is a perfect number. The next perfect number is 28, because 1 + 2 + 4 + 7 + 14 = 28.
|
odds
|
Odds
|
In probability theory, odds provide a measure of the probability of a particular outcome. Odds are commonly used in gambling and statistics. For example for an event that is 40% probable, one could say that the odds are "2 in 5", "2 to 3 in favor", "2 to 3 on", or "3 to 2 against".
|
https://en.wikipedia.org/wiki/Odds
|
Odds: In probability theory, odds provide a measure of the probability of a particular outcome. Odds are commonly used in gambling and statistics. For example for an event that is 40% probable, one could say that the odds are "2 in 5", "2 to 3 in favor", "2 to 3 on", or "3 to 2 against".
|
omega_constant
|
Omega Constant
|
The omega constant is a mathematical constant defined as the unique real number that satisfies the equation
|
https://en.wikipedia.org/wiki/Omega_constant
|
Omega Constant: The omega constant is a mathematical constant defined as the unique real number that satisfies the equation
|
one_and_two_tailed_tests
|
One And Two Tailed Tests
|
In statistical significance testing, a one-tailed test and a two-tailed test are alternative ways of computing the statistical significance of a parameter inferred from a data set, in terms of a test statistic. A two-tailed test is appropriate if the estimated value is greater or less than a certain range of values, for example, whether a test taker may score above or below a specific range of scores. This method is used for null hypothesis testing and if the estimated value exists in the critical areas, the alternative hypothesis is accepted over the null hypothesis. A one-tailed test is appropriate if the estimated value may depart from the reference value in only one direction, left or right, but not both. An example can be whether a machine produces more than one-percent defective products. In this situation, if the estimated value exists in one of the one-sided critical areas, depending on the direction of interest (greater than or less than), the alternative hypothesis is accepted over the null hypothesis. Alternative names are one-sided and two-sided tests; the terminology "tail" is used because the extreme portions of distributions, where observations lead to rejection of the null hypothesis, are small and often "tail off" toward zero as in the normal distribution, colored in yellow, or "bell curve", pictured on the right and colored in green.
|
https://en.wikipedia.org/wiki/One-_and_two-tailed_tests
|
One And Two Tailed Tests: In statistical significance testing, a one-tailed test and a two-tailed test are alternative ways of computing the statistical significance of a parameter inferred from a data set, in terms of a test statistic. A two-tailed test is appropriate if the estimated value is greater or less than a certain range of values, for example, whether a test taker may score above or below a specific range of scores. This method is used for null hypothesis testing and if the estimated value exists in the critical areas, the alternative hypothesis is accepted over the null hypothesis. A one-tailed test is appropriate if the estimated value may depart from the reference value in only one direction, left or right, but not both. An example can be whether a machine produces more than one-percent defective products. In this situation, if the estimated value exists in one of the one-sided critical areas, depending on the direction of interest (greater than or less than), the alternative hypothesis is accepted over the null hypothesis. Alternative names are one-sided and two-sided tests; the terminology "tail" is used because the extreme portions of distributions, where observations lead to rejection of the null hypothesis, are small and often "tail off" toward zero as in the normal distribution, colored in yellow, or "bell curve", pictured on the right and colored in green.
|
on_line_encyclopedia_of_integer_sequences
|
On Line Encyclopedia Of Integer Sequences
|
The On-Line Encyclopedia of Integer Sequences (OEIS) is an online database of integer sequences. It was created and maintained by Neil Sloane while researching at AT&T Labs. He transferred the intellectual property and hosting of the OEIS to the OEIS Foundation in 2009, and is its chairman.
|
https://en.wikipedia.org/wiki/On-Line_Encyclopedia_of_Integer_Sequences
|
On Line Encyclopedia Of Integer Sequences: The On-Line Encyclopedia of Integer Sequences (OEIS) is an online database of integer sequences. It was created and maintained by Neil Sloane while researching at AT&T Labs. He transferred the intellectual property and hosting of the OEIS to the OEIS Foundation in 2009, and is its chairman.
|
one_dimensional_space
|
One Dimensional Space
|
A one-dimensional space (1D space) is a mathematical space in which location can be specified with a single coordinate. An example is the number line, each point of which is described by a single real number. Any straight line or smooth curve is a one-dimensional space, regardless of the dimension of the ambient space in which the line or curve is embedded. Examples include the circle on a plane, or a parametric space curve. In physical space, a 1D subspace is called a "linear dimension" (rectilinear or curvilinear), with units of length (e.g., metre).
|
https://en.wikipedia.org/wiki/One-dimensional_space
|
One Dimensional Space: A one-dimensional space (1D space) is a mathematical space in which location can be specified with a single coordinate. An example is the number line, each point of which is described by a single real number. Any straight line or smooth curve is a one-dimensional space, regardless of the dimension of the ambient space in which the line or curve is embedded. Examples include the circle on a plane, or a parametric space curve. In physical space, a 1D subspace is called a "linear dimension" (rectilinear or curvilinear), with units of length (e.g., metre).
|
one_half
|
One Half
|
One half is the multiplicative inverse of 2. It is an irreducible fraction with a numerator of 1 and a denominator of 2. It often appears in mathematical equations, recipes and measurements.
|
https://en.wikipedia.org/wiki/One_half
|
One Half: One half is the multiplicative inverse of 2. It is an irreducible fraction with a numerator of 1 and a denominator of 2. It often appears in mathematical equations, recipes and measurements.
|
one_parameter_group
|
One Parameter Group
|
In mathematics, a one-parameter group or one-parameter subgroup usually means a continuous group homomorphism
|
https://en.wikipedia.org/wiki/One-parameter_group
|
One Parameter Group: In mathematics, a one-parameter group or one-parameter subgroup usually means a continuous group homomorphism
|
one_pass_algorithm
|
One Pass Algorithm
|
In computing, a one-pass algorithm or single-pass algorithm is a streaming algorithm which reads its input exactly once. It does so by processing items in order, without unbounded buffering; it reads a block into an input buffer, processes it, and moves the result into an output buffer for each step in the process. A one-pass algorithm generally requires O(n) (see 'big O' notation) time and less than O(n) storage (typically O(1)), where n is the size of the input. An example of a one-pass algorithm is the Sondik partially observable Markov decision process.
|
https://en.wikipedia.org/wiki/One-pass_algorithm
|
One Pass Algorithm: In computing, a one-pass algorithm or single-pass algorithm is a streaming algorithm which reads its input exactly once. It does so by processing items in order, without unbounded buffering; it reads a block into an input buffer, processes it, and moves the result into an output buffer for each step in the process. A one-pass algorithm generally requires O(n) (see 'big O' notation) time and less than O(n) storage (typically O(1)), where n is the size of the input. An example of a one-pass algorithm is the Sondik partially observable Markov decision process.
|
one_seventh_area_triangle
|
One Seventh Area Triangle
|
In plane geometry, a triangle ABC contains a triangle having one-seventh of the area of ABC, which is formed as follows: the sides of this triangle lie on cevians p, q, r where
|
https://en.wikipedia.org/wiki/One-seventh_area_triangle
|
One Seventh Area Triangle: In plane geometry, a triangle ABC contains a triangle having one-seventh of the area of ABC, which is formed as follows: the sides of this triangle lie on cevians p, q, r where
|
one_sided_limit
|
One Sided Limit
|
In calculus, a one-sided limit refers to either one of the two limits of a function f ( x ) {\displaystyle f(x)} of a real variable x {\displaystyle x} as x {\displaystyle x} approaches a specified point either from the left or from the right.
|
https://en.wikipedia.org/wiki/One-sided_limit
|
One Sided Limit: In calculus, a one-sided limit refers to either one of the two limits of a function f ( x ) {\displaystyle f(x)} of a real variable x {\displaystyle x} as x {\displaystyle x} approaches a specified point either from the left or from the right.
|
open_addressing
|
Open Addressing
|
Open addressing, or closed hashing, is a method of collision resolution in hash tables. With this method a hash collision is resolved by probing, or searching through alternative locations in the array (the probe sequence) until either the target record is found, or an unused array slot is found, which indicates that there is no such key in the table. Well-known probe sequences include:
|
https://en.wikipedia.org/wiki/Open_addressing
|
Open Addressing: Open addressing, or closed hashing, is a method of collision resolution in hash tables. With this method a hash collision is resolved by probing, or searching through alternative locations in the array (the probe sequence) until either the target record is found, or an unused array slot is found, which indicates that there is no such key in the table. Well-known probe sequences include:
|
ones_complement
|
Ones Complement
|
The ones' complement of a binary number is the value obtained by inverting (flipping) all the bits in the binary representation of the number. The name "ones' complement" refers to the fact that such an inverted value, if added to the original, would always produce an "all ones" number (the term "complement" refers to such pairs of mutually additive inverse numbers, here in respect to a non-0 base number). This mathematical operation is primarily of interest in computer science, where it has varying effects depending on how a specific computer represents numbers.
|
https://en.wikipedia.org/wiki/Ones%27_complement
|
Ones Complement: The ones' complement of a binary number is the value obtained by inverting (flipping) all the bits in the binary representation of the number. The name "ones' complement" refers to the fact that such an inverted value, if added to the original, would always produce an "all ones" number (the term "complement" refers to such pairs of mutually additive inverse numbers, here in respect to a non-0 base number). This mathematical operation is primarily of interest in computer science, where it has varying effects depending on how a specific computer represents numbers.
|
open_and_closed_maps
|
Open And Closed Maps
|
In mathematics, more specifically in topology, an open map is a function between two topological spaces that maps open sets to open sets. That is, a function f : X β Y {\displaystyle f:X\to Y} is open if for any open set U {\displaystyle U} in X , {\displaystyle X,} the image f ( U ) {\displaystyle f(U)} is open in Y . {\displaystyle Y.} Likewise, a closed map is a function that maps closed sets to closed sets. A map may be open, closed, both, or neither; in particular, an open map need not be closed and vice versa.
|
https://en.wikipedia.org/wiki/Open_and_closed_maps
|
Open And Closed Maps: In mathematics, more specifically in topology, an open map is a function between two topological spaces that maps open sets to open sets. That is, a function f : X β Y {\displaystyle f:X\to Y} is open if for any open set U {\displaystyle U} in X , {\displaystyle X,} the image f ( U ) {\displaystyle f(U)} is open in Y . {\displaystyle Y.} Likewise, a closed map is a function that maps closed sets to closed sets. A map may be open, closed, both, or neither; in particular, an open map need not be closed and vice versa.
|
open_book_decomposition
|
Open Book Decomposition
|
In mathematics, an open book decomposition (or simply an open book) is a decomposition of a closed oriented 3-manifold M into a union of surfaces (necessarily with boundary) and solid tori. Open books have relevance to contact geometry, with a famous theorem of Emmanuel Giroux (given below) that shows that contact geometry can be studied from an entirely topological viewpoint.
|
https://en.wikipedia.org/wiki/Open_book_decomposition
|
Open Book Decomposition: In mathematics, an open book decomposition (or simply an open book) is a decomposition of a closed oriented 3-manifold M into a union of surfaces (necessarily with boundary) and solid tori. Open books have relevance to contact geometry, with a famous theorem of Emmanuel Giroux (given below) that shows that contact geometry can be studied from an entirely topological viewpoint.
|
open_formula
|
Open Formula
|
An open formula is a formula that contains at least one free variable.[citation needed]
|
https://en.wikipedia.org/wiki/Open_formula
|
Open Formula: An open formula is a formula that contains at least one free variable.[citation needed]
|
open_mapping_theorem_complex_analysis
|
Open Mapping Theorem Complex Analysis
|
In complex analysis, the open mapping theorem states that if U {\displaystyle U} is a domain of the complex plane C {\displaystyle \mathbb {C} } and f : U β C {\displaystyle f:U\to \mathbb {C} } is a non-constant holomorphic function, then f {\displaystyle f} is an open map (i.e. it sends open subsets of U {\displaystyle U} to open subsets of C {\displaystyle \mathbb {C} } , and we have invariance of domain.).
|
https://en.wikipedia.org/wiki/Open_mapping_theorem_(complex_analysis)
|
Open Mapping Theorem Complex Analysis: In complex analysis, the open mapping theorem states that if U {\displaystyle U} is a domain of the complex plane C {\displaystyle \mathbb {C} } and f : U β C {\displaystyle f:U\to \mathbb {C} } is a non-constant holomorphic function, then f {\displaystyle f} is an open map (i.e. it sends open subsets of U {\displaystyle U} to open subsets of C {\displaystyle \mathbb {C} } , and we have invariance of domain.).
|
open_set
|
Open Set
|
In mathematics, an open set is a generalization of an open interval in the real line.
|
https://en.wikipedia.org/wiki/Open_set
|
Open Set: In mathematics, an open set is a generalization of an open interval in the real line.
|
End of preview. Expand
in Data Studio
README.md exists but content is empty.
- Downloads last month
- 14