Do you want to publish a course? Click here

On the number of non-hexagons in a planar tiling

237   0   0.0 ( 0 )
 Added by Arseniy Akopyan
 Publication date 2018
  fields
and research's language is English




Ask ChatGPT about the research

We give a simple proof of T. Stehlings result, that in any normal tiling of the plane with convex polygons with number of sides not less than six, all tiles except the finite number are hexagons.



rate research

Read More

Identity-homotopic self-homeomorphisms of a space of non-periodic 1-dimensional tiling are generalizations of orientation-preserving self-homeomorphisms of circles. We define the analogue of rotation numbers for such maps. In constrast to the classical situation, additional assumptions are required to make rotation numbers globally well-defined and independent of initial conditions. We prove that these conditions are sufficient, and provide counterexamples when these conditions are not met.
We prove that for every $N e 4$ there is only one right triangle that tiles the regular $N$-gon.
130 - Nicolas Bonichon 2016
The number of planar Eulerian maps with n edges is well-known to have a simple expression. But what is the number of planar Eulerian orientations with n edges? This problem appears to be difficult. To approach it, we define and count families of subsets and supersets of planar Eulerian orientations, indexed by an integer k, that converge to the set of all planar Eulerian orientations as k increases. The generating functions of our subsets can be characterized by systems of polynomial equations, and are thus algebraic. The generating functions of our supersets are characterized by polynomial systems involving divided differences, as often occurs in map enumeration. We prove that these series are algebraic as well. We obtain in this way lower and upper bounds on the growth rate of planar Eulerian orientations, which appears to be around 12.5.
185 - Vuong Bui , Roman Karasev 2018
We give an improvement of the Caratheodory theorem for strong convexity (ball convexity) in $mathbb R^n$, reducing the Caratheodory number to $n$ in several cases; and show that the Caratheodory number cannot be smaller than $n$ for an arbitrary gauge body $K$. We also give an improved topological criterion for one convex body to be a Minkowski summand of another.
136 - Alexey Glazyrin 2020
In this note, we give a short solution of the kissing number problem in dimension three.
comments
Fetching comments Fetching comments
mircosoft-partner

هل ترغب بارسال اشعارات عن اخر التحديثات في شمرا-اكاديميا