Search Results for ""

Let L be a language of first-order predicate logic, let I be an indexing set, and for each i in I, let A_i be a structure of the language L. Let u be an ultrafilter in the ...

A symmetric polynomial on n variables x_1, ..., x_n (also called a totally symmetric polynomial) is a function that is unchanged by any permutation of its variables. In other ...

A labeled graph whose nodes are indexed by the generators of a Coxeter group having (P_i,P_j) as an graph edge labeled by M_(ij) whenever M_(ij)>2, where M_(ij) is an element ...

The l^2-norm (also written "l^2-norm") |x| is a vector norm defined for a complex vector x=[x_1; x_2; |; x_n] (1) by |x|=sqrt(sum_(k=1)^n|x_k|^2), (2) where |x_k| on the ...

A mathematical property P holds locally if P is true near every point. In many different areas of mathematics, this notion is very useful. For instance, the sphere, and more ...

A multidimensional point process is a measurable function from a probability space (Omega,A,P) into (X,Sigma) where X is the set of all finite or countable subsets of R^d not ...

In simple algebra, multiplication is the process of calculating the result when a number a is taken b times. The result of a multiplication is called the product of a and b, ...

A random closed set (RACS) in R^d is a measurable function from a probability space (Omega,A,P) into (F,Sigma) where F is the collection of all closed subsets of R^d and ...

Coding theory, sometimes called algebraic coding theory, deals with the design of error-correcting codes for the reliable transmission of information across noisy channels. ...

In December 1920, M. Schönfinkel presented in a report to the Mathematical Society in Göttingen a new type of formal logic based on the concept of a generalized function ...