Filter

Refine by Access

Refine By Collections

  • Mathematics and Statistics (5)

Refine by Type

Refine by Date

—
  • Print
  • Save

Search Results

You are looking at 1 - 5 of 5 items for :

  • Mathematics and Statistics x
  • All content x
Clear All

Incenter iterations in 3-space

Periodica Mathematica Hungarica
Volume/Issue:
Volume 55: Issue 1
DOI:
https://doi.org/10.1007/s10998-007-3113-0
Authors: Gergely Ambrus and András Bezdek

Abstract  

Consider a 3-dimensional point set

\documentclass{aastex} \usepackage{amsbsy} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{bm} \usepackage{mathrsfs} \usepackage{pifont} \usepackage{stmaryrd} \usepackage{textcomp} \usepackage{upgreek} \usepackage{portland,xspace} \usepackage{amsmath,amsxtra} \pagestyle{empty} \DeclareMathSizes{10}{9}{7}{6} \begin{document} $$\mathcal{P}$$ \end{document}
which contains the incenters of all the nondegenerate tetrahedra with vertices from
\documentclass{aastex} \usepackage{amsbsy} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{bm} \usepackage{mathrsfs} \usepackage{pifont} \usepackage{stmaryrd} \usepackage{textcomp} \usepackage{upgreek} \usepackage{portland,xspace} \usepackage{amsmath,amsxtra} \pagestyle{empty} \DeclareMathSizes{10}{9}{7}{6} \begin{document} $$\mathcal{P}$$ \end{document}
. In this paper we prove that then
\documentclass{aastex} \usepackage{amsbsy} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{bm} \usepackage{mathrsfs} \usepackage{pifont} \usepackage{stmaryrd} \usepackage{textcomp} \usepackage{upgreek} \usepackage{portland,xspace} \usepackage{amsmath,amsxtra} \pagestyle{empty} \DeclareMathSizes{10}{9}{7}{6} \begin{document} $$\mathcal{P}$$ \end{document}
is dense in its convex hull. This settles the last unsolved variation in a sequence of similar questions initiated by D. Ismailescu, where he required to include other simplex centers, e.g. the orthocenters or the circumcenters. Our method allows us to generalize the planar incenter problem, showing that the denseness follows from a much weaker assumption for planar point sets.

Restricted access

A Krasnosel’skii-type result for planar sets starshaped via orthogonally convex paths

Periodica Mathematica Hungarica
Volume/Issue:
Volume 55: Issue 2
DOI:
https://doi.org/10.1007/s10998-007-4169-8
Author: Marilyn Breen

Abstract  

A Krasnosel’skii-type theorem for compact sets that are starshaped via staircase paths may be extended to compact sets that are starshaped via orthogonally convex paths: Let S be a nonempty compact planar set having connected complement. If every two points of S are visible via orthogonally convex paths from a common point of S, then S is starshaped via orthogonally convex paths. Moreover, the associated kernel Ker S has the expected property that every two of its points are joined in Ker S by an orthogonally convex path. If S is an arbitrary nonempty planar set that is starshaped via orthogonally convex paths, then for each component C of Ker S, every two of points of C are joined in C by an orthogonally convex path.

Restricted access

The strip of minimum width covering a centrally symmetric set of points

Periodica Mathematica Hungarica
Volume/Issue:
Volume 58: Issue 1
DOI:
https://doi.org/10.1007/s10998-009-9047-7
Authors: Mario Huicochea and Jesús Jerónimo-Castro

Abstract  

In this paper the following is proved: let

\documentclass{aastex} \usepackage{amsbsy} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{bm} \usepackage{mathrsfs} \usepackage{pifont} \usepackage{stmaryrd} \usepackage{textcomp} \usepackage{upgreek} \usepackage{portland,xspace} \usepackage{amsmath,amsxtra} \pagestyle{empty} \DeclareMathSizes{10}{9}{7}{6} \begin{document} $$\mathcal{P}$$ \end{document}
be a centrally symmetric set of points, such that the distance between any pair of points is at least 1 and every three of them can be covered by a strip of width 1. Then there is a strip of width √2 covering
\documentclass{aastex} \usepackage{amsbsy} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{bm} \usepackage{mathrsfs} \usepackage{pifont} \usepackage{stmaryrd} \usepackage{textcomp} \usepackage{upgreek} \usepackage{portland,xspace} \usepackage{amsmath,amsxtra} \pagestyle{empty} \DeclareMathSizes{10}{9}{7}{6} \begin{document} $$\mathcal{P}$$ \end{document}
.

Restricted access

Analogues of Horn’s theorem for finite unions of starshaped sets in ℝ d

Periodica Mathematica Hungarica
Volume/Issue:
Volume 59: Issue 1
DOI:
https://doi.org/10.1007/s10998-009-9100-7
Author: Marilyn Breen

Abstract  

Fix k, d, 1 ≤ k ≤ d + 1. Let

\documentclass{aastex} \usepackage{amsbsy} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{bm} \usepackage{mathrsfs} \usepackage{pifont} \usepackage{stmaryrd} \usepackage{textcomp} \usepackage{upgreek} \usepackage{portland,xspace} \usepackage{amsmath,amsxtra} \pagestyle{empty} \DeclareMathSizes{10}{9}{7}{6} \begin{document} $$\mathcal{F}$$ \end{document}
be a nonempty, finite family of closed sets in ℝd, and let L be a (d − k + 1)-dimensional flat in ℝd. The following results hold for the set T ≡ ∪{F: F in
\documentclass{aastex} \usepackage{amsbsy} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{bm} \usepackage{mathrsfs} \usepackage{pifont} \usepackage{stmaryrd} \usepackage{textcomp} \usepackage{upgreek} \usepackage{portland,xspace} \usepackage{amsmath,amsxtra} \pagestyle{empty} \DeclareMathSizes{10}{9}{7}{6} \begin{document} $$\mathcal{F}$$ \end{document}
}. Assume that, for every k (not necessarily distinct) members F 1, …, F k of
\documentclass{aastex} \usepackage{amsbsy} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{bm} \usepackage{mathrsfs} \usepackage{pifont} \usepackage{stmaryrd} \usepackage{textcomp} \usepackage{upgreek} \usepackage{portland,xspace} \usepackage{amsmath,amsxtra} \pagestyle{empty} \DeclareMathSizes{10}{9}{7}{6} \begin{document} $$\mathcal{F}$$ \end{document}
,∪{F i: 1 ≤ i ≤ k} is starshaped and the corresponding kernel contains a translate of L. Then T is starshaped, and its kernel also contains a translate of L. Assume that, for every k (not necessarily distinct) members F 1, …, F k of
\documentclass{aastex} \usepackage{amsbsy} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{bm} \usepackage{mathrsfs} \usepackage{pifont} \usepackage{stmaryrd} \usepackage{textcomp} \usepackage{upgreek} \usepackage{portland,xspace} \usepackage{amsmath,amsxtra} \pagestyle{empty} \DeclareMathSizes{10}{9}{7}{6} \begin{document} $$\mathcal{F}$$ \end{document}
,∪{F i: 1 ≤ i ≤ k} is starshaped and there is a translate of L meeting each set ker F i, 1 ≤ i ≤ k − 1. Then there is a translate L 0 of L such that every point of T sees via T some point of L 0. If k = 2 or d = 2, improved results hold.

Restricted access

Kirchberger-type theorems for separation by convex domains

Periodica Mathematica Hungarica
Volume/Issue:
Volume 57: Issue 2
DOI:
https://doi.org/10.1007/s10998-008-8185-6
Authors: Zsolt Lángi and Márton Naszódi

Abstract  

We say that a convex set K in ℝd strictly separates the set A from the set B if A ⊂ int(K) and B ⋂ cl K = ø. The well-known Theorem of Kirchberger states the following. If A and B are finite sets in ℝd with the property that for every T ⊂ A⋃B of cardinality at most d + 2, there is a half space strictly separating T ⋂ A and T ⋂ B, then there is a half space strictly separating A and B. In short, we say that the strict separation number of the family of half spaces in ℝd is d + 2. In this note we investigate the problem of strict separation of two finite sets by the family of positive homothetic (resp., similar) copies of a closed, convex set. We prove Kirchberger-type theorems for the family of positive homothets of planar convex sets and for the family of homothets of certain polyhedral sets. Moreover, we provide examples that show that, for certain convex sets, the family of positive homothets (resp., the family of similar copies) has a large strict separation number, in some cases, infinity. Finally, we examine how our results translate to the setting of non-strict separation.

Restricted access