Search Results for ""

Also known as "Laplacian" determinant expansion by minors, expansion by minors is a technique for computing the determinant of a given square matrix M. Although efficient for ...

A.k.a. the pigeonhole principle. Given n boxes and m>n objects, at least one box must contain more than one object. This statement has important applications in number theory ...

A doublecross graph is a graph with graph crossing number 2. The numbers of doublecross simple graphs on n=1 nodes are 0, 0, 0, 0, 0, 1, 39, ..., and the numbers of connected ...

The dual of a regular tessellation is formed by taking the center of each polygon as a vertex and joining the centers of adjacent polygons. The triangular and hexagonal ...

A number n is called an economical number if the number of digits in the prime factorization of n (including powers) uses fewer digits than the number of digits in n. The ...

In mathematics, a small positive infinitesimal quantity, usually denoted epsilon or epsilon, whose limit is usually taken as epsilon->0. The late mathematician P. Erdős also ...

A mathematical structure first introduced by Kolyvagin (1990) and defined as follows. Let T be a finite-dimensional p-adic representation of the Galois group of a number ...

An even permutation is a permutation obtainable from an even number of two-element swaps, i.e., a permutation with permutation symbol equal to +1. For initial set {1,2,3,4}, ...

The generalized diameter is the greatest distance between any two points on the boundary of a closed figure. The diameter of a subset E of a Euclidean space R^n is therefore ...

Given a "good" graph G (i.e., one for which all intersecting graph edges intersect in a single point and arise from four distinct graph vertices), the crossing number is the ...