The Experts below are selected from a list of 360 Experts worldwide ranked by ideXlab platform

Feng Rong - One of the best experts on this subject based on the ideXlab platform.

Yunus E Zeytuncu - One of the best experts on this subject based on the ideXlab platform.

Steven G Krantz - One of the best experts on this subject based on the ideXlab platform.

Mehmet Celik - One of the best experts on this subject based on the ideXlab platform.

Michael J. Mossinghoff - One of the best experts on this subject based on the ideXlab platform.

  • Most Reinhardt polygons are sporadic
    Geometriae Dedicata, 2019
    Co-Authors: Kevin G. Hare, Michael J. Mossinghoff
    Abstract:

    A Reinhardt polygon is a convex n -gon that, for n not a power of 2, is optimal in three different geometric optimization problems, for example, it has maximal perimeter relative to its diameter. Some such polygons exhibit a particular periodic structure; others are termed sporadic . Prior work has described the periodic case completely, and has shown that sporadic Reinhardt polygons occur for all n of the form $$n=pqr$$ n = p q r with p and q distinct odd primes and $$r\ge 2$$ r ≥ 2 . We show that (dihedral equivalence classes of) sporadic Reinhardt polygons outnumber the periodic ones for almost all n , and find that this first occurs at $$n=105$$ n = 105 . We also determine a formula for the number of sporadic Reinhardt polygons when $$n=2pq$$ n = 2 p q with p and q distinct odd primes.

  • most Reinhardt polygons are sporadic
    arXiv: Metric Geometry, 2014
    Co-Authors: Kevin G. Hare, Michael J. Mossinghoff
    Abstract:

    A \textit{Reinhardt polygon} is a convex $n$-gon that, for $n$ not a power of $2$, is optimal in three different geometric optimization problems, for example, it has maximal perimeter relative to its diameter. Some such polygons exhibit a particular periodic structure; others are termed \textit{sporadic}. Prior work has described the periodic case completely, and has shown that sporadic Reinhardt polygons occur for all $n$ of the form $n=pqr$ with $p$ and $q$ distinct odd primes and $r\geq2$. We show that (dihedral equivalence classes of) sporadic Reinhardt polygons outnumber the periodic ones for almost all $n$, and find that this first occurs at $n=105$. We also determine a formula for the number of sporadic Reinhardt polygons when $n=2pq$ with $p$ and $q$ distinct odd primes.

  • Sporadic Reinhardt Polygons
    Discrete & Computational Geometry, 2013
    Co-Authors: Kevin G. Hare, Michael J. Mossinghoff
    Abstract:

    Let $$n$$ be a positive integer, not a power of two. A Reinhardt polygon is a convex $$n$$-gon that is optimal in three different geometric optimization problems: it has maximal perimeter relative to its diameter, maximal width relative to its diameter, and maximal width relative to its perimeter. For almost all $$n$$, there are many Reinhardt polygons with $$n$$ sides, and many of them exhibit a particular periodic structure. While these periodic polygons are well understood, for certain values of $$n$$, additional Reinhardt polygons exist, which do not possess this structured form. We call these polygons sporadic. We completely characterize the integers $$n$$ for which sporadic Reinhardt polygons exist, showing that these polygons occur precisely when $$n=pqr$$ with $$p$$ and $$q$$ distinct odd primes and $$r\ge 2$$. We also prove that a positive proportion of the Reinhardt polygons with $$n$$ sides is sporadic for almost all integers $$n$$, and we investigate the precise number of sporadic Reinhardt polygons that are produced for several values of $$n$$ by a construction that we introduce.

  • Sporadic Reinhardt polygons
    arXiv: Metric Geometry, 2012
    Co-Authors: Kevin G. Hare, Michael J. Mossinghoff
    Abstract:

    Let $n$ be a positive integer, not a power of two. A \textit{Reinhardt polygon} is a convex $n$-gon that is optimal in three different geometric optimization problems: it has maximal perimeter relative to its diameter, maximal width relative to its diameter, and maximal width relative to its perimeter. For almost all $n$, there are many Reinhardt polygons with $n$ sides, and many of them exhibit a particular periodic structure. While these periodic polygons are well understood, for certain values of $n$, additional Reinhardt polygons exist that do not possess this structured form. We call these polygons \textit{sporadic}. We completely characterize the integers $n$ for which sporadic Reinhardt polygons exist, showing that these polygons occur precisely when $n=pqr$ with $p$ and $q$ distinct odd primes and $r\geq2$. We also prove that a positive proportion of the Reinhardt polygons with $n$ sides are sporadic for almost all integers $n$, and we investigate the precise number of sporadic Reinhardt polygons that are produced for several values of $n$ by a construction that we introduce.