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 ...

Given a general quadratic curve Ax^2+Bxy+Cy^2+Dx+Ey+F=0, (1) the quantity X is known as the discriminant, where X=B^2-4AC, (2) and is invariant under rotation. Using the ...

The blossom algorithm (Edmonds 1965) finds a maximum independent edge set in a (possibly weighted) graph. While a maximum independent edge set can be found fairly easily for ...

An Abelian differential is an analytic or meromorphic differential on a compact or closed Riemann surface.

The portion of number theory concerned with expressing an integer as a sum of integers from some given set.

The set E of edges of a loopless graph (V,E), being a set of unordered pairs of elements of V, constitutes an adjacency relation on V. Formally, an adjacency relation is any ...

In a graph G, two graph vertices are adjacent if they are joined by a graph edge.

A nonhomogeneous linear equation or system of nonhomogeneous linear systems of equations is said to be affine.

A convex body in Euclidean space that is centrally symmetric with center at the origin is determined among all such bodies by its brightness function (the volume of each ...

A term in logic meaning pertaining to truth and falsehood.