Search Results for ""

Computational number theory is the branch of number theory concerned with finding and implementing efficient computer algorithms for solving various problems in number ...

Combinatorial matrix theory is a rich branch of mathematics that combines combinatorics, graph theory, and linear algebra. It includes the theory of matrices with prescribed ...

The term discrete percolation is used to describe models of percolation theory whose media are discrete sets like sets of regular lattice points (e.g., bond percolation and ...

Hilbert-Schmidt theory is the study of linear integral equations of the Fredholm type with symmetric integral kernels K(x,t)=K(t,x).

Krohn-Rhodes theory is a mathematical approach that seeks to decompose finite semigroups in terms of finite aperiodic semigroups and finite groups.

The study of a finite group G using the local subgroups of G. Local group theory plays a critical role in the classification theorem of finite groups.

A theory of constructing initial conditions that provides safe convergence of a numerical root-finding algorithm for an equation f(z)=0. Point estimation theory treats ...

The theory of analyzing a decision between a collection of alternatives made by a collection of n voters with separate opinions. Any choice for the entire group should ...

An axiomatic theory (such as a geometry) is said to be complete if each valid statement in the theory is capable of being proven true or false.

The problem of maximizing a linear function over a convex polyhedron, also known as operations research or optimization theory. The general problem of convex optimization is ...