Search Results for ""
481 - 490 of 701 for Abhyankar's conjectureSearch Results
A function tau(n) related to the divisor function sigma_k(n), also sometimes called Ramanujan's tau function. It is defined via the Fourier series of the modular discriminant ...
A triangle-replaced graph T(G) is a cubic graph in which each vertex is replaced by a triangle graph such that each vertex of the triangle is connected to one of the ...
A unit fraction is a fraction with numerator 1. Examples of unit fractions include 1/2, 1/3, 1/12, and 1/123456. The famous Rhind papyrus, dated to around 1650 BC, discusses ...
A vector field is a map f:R^n|->R^n that assigns each x a vector f(x). Several vector fields are illustrated above. A vector field is uniquely specified by giving its ...
Vizing's theorem states that a graph can be edge-colored in either Delta or Delta+1 colors, where Delta is the maximum vertex degree of the graph. This partitions graphs into ...
Two polygons are congruent by dissection iff they have the same area. In particular, any polygon is congruent by dissection to a square of the same area. Laczkovich (1988) ...
First published in Riemann's groundbreaking 1859 paper (Riemann 1859), the Riemann hypothesis is a deep mathematical conjecture which states that the nontrivial Riemann zeta ...
A (0,1)-matrix is an integer matrix in which each element is a 0 or 1. It is also called a logical matrix, binary matrix, relation matrix, or Boolean matrix. The number of ...
Archimedes' cattle problem, also called the bovinum problema, or Archimedes' reverse, is stated as follows: "The sun god had a herd of cattle consisting of bulls and cows, ...
The Barnette-Bosák-Lederberg graph is a graph on 38 vertices which is the smallest known example of a planar 3-connected nonhamiltonian graph, i.e., the smallest known ...
...
View search results from all Wolfram sites (1476 matches)

