Search Results for ""

Minkowski's conjecture states that every lattice tiling of R^n by unit hypercubes contains two hypercubes that meet in an (n-1)-dimensional face. Minkowski first considered ...

An alkane graph is a tree in which vertices correspond to atoms and edges to carbon-carbon or hydrogen-carbon bonds in a chemical alkane. In chemistry, an alkane is an ...

The antipedal triangle DeltaA^'B^'C^' of a reference triangle DeltaABC with respect to a given point P is the triangle of which DeltaABC is the pedal triangle with respect to ...

The arf invariant is a link invariant that always has the value 0 or 1. A knot has Arf invariant 0 if the knot is "pass equivalent" to the unknot and 1 if it is pass ...

Vince and Bóna (2012) define an assembly tree T for a connected simple graph G on n nodes as a binary rooted tree with n leavesTree Leaf and n-1 internal nodes and satisfying ...

An automorphic graph is a distance-transitive graph Gamma for which the automorphism group Aut(Gamma) acts primitively on the vertices of Gamma and is not a complete graph or ...

What is the probability that a chord drawn at random on a circle of radius r (i.e., circle line picking) has length >=r (or sometimes greater than or equal to the side length ...

An incidence system (v, k, lambda, r, b) in which a set X of v points is partitioned into a family A of b subsets (blocks) in such a way that any two points determine lambda ...

A colossally abundant number is a positive integer n for which there is a positive exponent epsilon such that (sigma(n))/(n^(1+epsilon))>=(sigma(k))/(k^(1+epsilon)) for all ...

The study of efficient algorithms for solving geometric problems. Examples of problems treated by computational geometry include determination of the convex hull and Voronoi ...