The largest small hexagon
نویسندگان
چکیده
منابع مشابه
The Largest Small Hexagon
Given any n-gon of unit diameter in the plane, it is natural to inquire how large an area it can have. In 1922, Reinhardt [8] showed that for odd II, the obvious configuration is optimal, namely, among all n-gons of diameter 1, the regular n-gon has the maximum area. It was noted, however, that this is not the case for n even.l In particular, H. Lenz [7] raised the question of finding the large...
متن کاملThe largest small Polytopes
The aim of this paper is the determination of the largest n-dimensional polytope with n+3 vertices of unit diameter. This is a special case of a more general problem Graham proposes in [2].
متن کاملA small embedding for partial hexagon systems
Although these necessary conditions are sufficient for all n ::; 50 [3], as well as several infinite classes [1, 4, 5, 7, 8, 11], the existence problem is far from settled in general. This will be of no consequence here since we will be considering 6-cycle systems only. It is a well-known Folk Theorem that the spectrum for 6-cycle systems (i.e, the set of all n such that a 6-cycle system of ord...
متن کاملThe Classical Aristotelian Hexagon Versus the Modern Duality Hexagon
1 Aristotelian versus Duality Square (1) Piaget (1949) inversion réciprocation corrélation Gottschalk (1953) complement contradual dual Löbner (1990) negation (NEG) subnegation (SNEG) dual (DUAL) Westerstahl (2010) outer negation inner negation dual Quantifier (domain/restrictor, predicate/nuclear scope) 2-place second-order predicates All (children , be asleep) <,,t> (3) All children a...
متن کاملGraphs with small second largest Laplacian eigenvalue
Let L(G) be the Laplacian matrix of G. In this paper, we characterize all of the connected graphs with second largest Laplacian eigenvalue no more than l; where l . = 3.2470 is the largest root of the equation μ3 − 5μ2 + 6μ − 1 = 0. Moreover, this result is used to characterize all connected graphs with second largest Laplacian eigenvalue no more than three. © 2013 Elsevier Ltd. All rights rese...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series A
سال: 1975
ISSN: 0097-3165
DOI: 10.1016/0097-3165(75)90004-7