Search Results for ""

Does there exist an algorithm for deciding whether or not a specific mathematical assertion does or does not have a proof? The decision problem is also known as the ...

A real function is said to be differentiable at a point if its derivative exists at that point. The notion of differentiability can also be extended to complex functions ...

As a consequence of Matiyasevich's refutation of Hilbert's 10th problem, it can be proved that there does not exist a general algorithm for solving a general quartic ...

A connected graph G is distance-regular if for any vertices x and y of G and any integers i,j=0, 1, ...d (where d is the graph diameter), the number of vertices at distance i ...

Elliptic geometry is a non-Euclidean geometry with positive curvature which replaces the parallel postulate with the statement "through any point in the plane, there exist no ...

Consider a Lucas sequence with P>0 and Q=+/-1. A Fibonacci pseudoprime is a composite number n such that V_n=P (mod n). There exist no even Fibonacci pseudoprimes with ...

Fisher's exact test is a statistical test used to determine if there are nonrandom associations between two categorical variables. Let there exist two such variables X and Y, ...

A Fredholm integral equation of the first kind is an integral equation of the form f(x)=int_a^bK(x,t)phi(t)dt, (1) where K(x,t) is the kernel and phi(t) is an unknown ...

Frucht's theorem states that every finite group is the automorphism group of a finite undirected graph. This was conjectured by König (1936) and proved by Frucht (1939). In ...

A system of linear differential equations (dy)/(dz)=A(z)y, (1) with A(z) an analytic n×n matrix, for which the matrix A(z) is analytic in C^_\{a_1,...,a_N} and has a pole of ...