Tags
A tag is a keyword or label that categorizes your question with other, similar questions.
A monoid is an algebraic structure with a single associative binary operation and an identity element.
861 questions
A random graph is a graph - a set of vertices and edges - that is chosen according to some probability distribution. In the most common model, $G_{n, p}$, a graph has $n$ vertices, and edges are present independently with probability $p$. Use (graphing-functions) instead if your question is about graphing or plotting functions.
860 questions
For questions about CW complexes (topological spaces which are built up using balls of varying dimensions known as cells).
852 questions
Perturbation theory describes a range of tools and techniques to find approximate solutions to problems containing small parameters.
849 questions
The Hessian matrix of function is used to second derivative test when $f$ has a critical point $x$. If the Hessian is positive definite at $x$, then $f$ attains a local minimum at $x$. If the Hessian is negative definite at $x$, then $f$ attains a local maximum at $x$. If the Hessian has both positive and negative eigenvalues then $x$ is a saddle point for $f$.
845 questions
For questions about proofs within a formal system, such as natural deduction or Hilbert system.
844 questions
For questions about functions $f$ defined on an interval $[a,b]$ such that there exists a constant $M>0$, such that if $a=x_0
838 questions
For questions about the mathematics of artificial neural networks: their underlying multilayered graph object or their use as a data structure in machine learning algorithms. Consider also using the tags (machine-learning) or (graph-theory).
836 questions
For questions about the geometry, complex-analytic, and group-theoretic properties of the Möbius transformations (linear fractional transformations) $z \mapsto \frac{az + b}{cz + d}$ of the complex plane, which can be identified with the group $PGL(2, \mathbb{C})$, or certain subgroups thereof.
834 questions
Stability of solutions of differential equations and of trajectories of dynamical systems under small perturbations of initial conditions.
819 questions
Transcendental numbers are numbers that cannot be the root of a nonzero polynomial with rational coefficients (i.e., not an algebraic number). Examples of such numbers are $\pi$ and $e$.
818 questions
Questions related to the mathematical aspects of Einstein's theory of relativity. For the physics and its interpretations, please ask at the physics.SE. You may also consider the tags (differential-geometry) and (pde).
815 questions
A method in numerical analysis which consists of approximating the derivatives of a solution of an ordinary or a partial differential equation. This leads to the solution of a linear system.
815 questions
GAP (Groups, Algorithms and Programming) is a system for computational discrete algebra, with particular emphasis on Computational Group Theory. It provides a programming language, a library of thousands of functions implementing algebraic algorithms, and large data libraries of algebraic objects.
Please note that GAP Forum or GAP Support may be more suitable places for questions about GAP: see http://www.gap-system.org/Contacts/Forum/forum.html
810 questions
An integer $a$ is a quadratic residue modulo $p$ if $a \equiv x^2 \pmod p$ for some integer $x$. If $a$ is not a quadratic residue modulo $p$, it is said to be a quadratic nonresidue modulo $p$.
808 questions
For questions about pointwise convergence, a common mode of convergence in which a sequence of functions converges to a particular function. This tag should be used with the tag [convergence].
808 questions
For questions about Borel sets. Please, add also other tags indicating the area, e.g., (measure-theory), (general-topology), (descriptive-set-theory), etc.
808 questions
For questions on the $n$-simplex, an $n$-dimensional polytope with $n+1$ points.
803 questions
In mathematics, sheaf cohomology is the aspect of sheaf theory, concerned with sheaves of abelian groups, that applies homological algebra to make possible effective calculation of the global sections of a sheaf F. (Def: http://en.m.wikipedia.org/wiki/Sheaf_cohomology)
802 questions
Questions on Monte Carlo methods, methods that require the repeated generation of pseudo- or quasi-random numbers for computing their results.
799 questions
This tag is for questions regarding the Newton–Raphson method. In numerical analysis the Newton–Raphson method is a method for finding successively better approximations to the roots (or zeroes) of a real-valued function.
798 questions
Operations Research, sometimes known as Management Science or Decision Science, is the discipline of applying appropriate analytical methods to help those who run organisations make better decisions.
794 questions
For questions related to projective modules, their structures, and properties.
790 questions
For questions regarding finitely generated groups, modules, and other algebraic structures. A structure is called finitely generated if there exists a finite subset that generates it.
789 questions
In statistics, a confidence interval (CI) is a type of interval estimate (of a population parameter) that is computed from the observed data.
789 questions
In elementary geometry, a polytope is a geometric object with flat sides, which may exist in any general number of dimensions $n$ as an $n$-dimensional polytope or $n$-polytope.
786 questions
Questions on various generalizations of the Riemann zeta function (e.g. Dedekind zeta, Hasse–Weil zeta, L-functions, multiple zeta). Consider using the tag (riemann-zeta) instead if your question is specifically about Riemann's function.
785 questions
For questions related to the Lambert W or product log function, the inverse of $f(z)=ze^z$.
784 questions
The implicit function theorem gives sufficient conditions to solve a given equation for one or more of the variables as functions of the remaining variables. The basic form of the theorem is that of an existence theorem. However, the contraction mapping proof of the theorem provides an error estimate for a sequence of approximating maps. Sometimes it is also termed the implicit mapping theorem. See http://en.wikipedia.org/wiki/Implicit_function_theorem
783 questions
For questions about the uses of the Euclidean algorithm, Extended Euclidean algorithm, and related algorithms in integers, polynomials, or general Euclidean domains. This is **not** about Euclidean geometry.
780 questions
Questions on quadratic programming, the optimization of a quadratic objective function subject to affine constraints.
776 questions
This tag is for questions concerning the smoothness of weak solutions to partial differential equations.
774 questions