Search Results for ""
681 - 690 of 1668 for Hard Hexagon Entropy ConstantSearch Results
Two lines PQ and RS are said to be antiparallel with respect to the sides of an angle A if they make the same angle in the opposite senses with the bisector of that angle. If ...
The centroid is center of mass of a two-dimensional planar lamina or a three-dimensional solid. The mass of a lamina with surface density function sigma(x,y) is ...
A smooth manifold with a Poisson bracket defined on its function space.
A cyclic polygon is a polygon with vertices upon which a circle can be circumscribed. Since every triangle has a circumcircle, every triangle is cyclic. It is conjectured ...
An isoscelizer of an (interior) angle A in a triangle DeltaABC is a line through points I_(AB)I_(AC) where I_(AB) lies on AB and I_(AC) on AC such that DeltaAI_(AB)I_(AC) is ...
An octic graph is a regular graph of degree eight. The numbers of simple octic graphs on n=9, 10, 11, ... nodes are 1, 6, 94, 10786, 3459386, ... (OEIS A014378). Examples are ...
A sextic graph is a regular graph of degree six. The numbers of simple sextic graphs on n=7, 8, ... nodes are 1, 1, 4, 21, 266, 7846, 367860, ... (OEIS A006822). Examples are ...
A connected graph G is said to be t-tough if, for every integer k>1, G cannot be split into k different connected components by the removal of fewer than tk vertices. The ...
The regular polygon of 17 sides is called the heptadecagon, or sometimes the heptakaidecagon. Gauss proved in 1796 (when he was 19 years old) that the heptadecagon is ...
The sequence a(n) given by the exponents of the highest power of 2 dividing n, i.e., the number of trailing 0s in the binary representation of n. For n=1, 2, ..., the first ...
...
View search results from all Wolfram sites (15943 matches)

