Search Results for ""

A hypergraph is a graph in which generalized edges (called hyperedges) may connect more than two nodes.

For {M_i}_(i in I) a family of R-modules indexed by a directed set I, let sigma_(ji):M_j->M_i i<=j be an R-module homomorphism. Call (M_i,sigma_(ji)) an inverse system over I ...

Every finite-dimensional Lie algebra of characteristic p!=0 has a faithful finite-dimensional representation.

Approximations to Khinchin's constant include K = -(ln85181832)/(tan8) (1) = 1/(29)sqrt(6065) (2) = 6-sqrt(ln59055) (3) = 18^(27/79), (4) which are correct to 9, 7, 6, and 5 ...

2^(10)=1024 bytes. Although the term kilobyte is sometimes used to refer to 1024 bytes, such usage is deprecated in favor of the standard SI naming convention of 1 kilobyte ...

If R is a ring (commutative with 1), the height of a prime ideal p is defined as the supremum of all n so that there is a chain p_0 subset ...p_(n-1) subset p_n=p where all ...

Given a positive integer n, a labeled n-digraph is a digraph whose vertex set is {1,...,n}.

The conjecture that the Artin L-function of any n-dimensional complex representation of the Galois group of a finite extension of the rational numbers Q is an Artin ...

Any complex measure lambda decomposes into an absolutely continuous measure lambda_a and a singular measure lambda_c, with respect to some positive measure mu. This is the ...

Two curves phi and psi satisfying phi+psi=0 are said to be linearly dependent. Similarly, n curves phi_i, i=1, ..., n are said to be linearly dependent if sum_(i=1)^nphi_i=0.