English
Related papers

Related papers: On a generalization of the plank problem

200 papers

We characterize the largest point sets in the plane which define at most 1, 2, and 3 angles. For $P(k)$ the largest size of a point set admitting at most $k$ angles, we prove $P(2)=5$ and $P(3)=5$. We also provide the general bounds of $k+2…

Combinatorics · Mathematics 2022-10-18 Henry L. Fleischmann , Steven J. Miller , Eyvindur A. Palsson , Ethan Pesikoff , Charles Wolf

Let's have $n$ points in the space such that the maximum distance between any of them is $a$. We prove that there exists a sphere of radius $r \leq a \frac{\sqrt(6)}{4}$ that contains in its interior or on its surface all these points.…

General Mathematics · Mathematics 2011-11-09 Florentin Smarandache

For k >= 3, a k-angulation is a 2-connected plane graph in which every internal face is a k-gon. We say that a point set P admits a plane graph G if there is a straight-line drawing of G that maps V(G) onto P and has the same facial cycles…

Combinatorics · Mathematics 2013-01-24 Michael S. Payne , Jens M. Schmidt , David R. Wood

Let $k$ be a global field, let $A$ be a Dedekind domain with $\text{Quot}(A) = k$, and let $K$ be a finitely generated field. Using a unified approach for both elliptic curves and Drinfeld modules $M$ defined over $K$ and having a trivial…

Number Theory · Mathematics 2020-02-21 Alina Carmen Cojocaru , Nathan Jones

Let $K$ be a compact convex domain in the Euclidean plane. The mixed area $A(K,-K)$ of $K$ and $-K$ can be bounded from above by $1/(6\sqrt{3})L(K)^2$, where $L(K)$ is the perimeter of $K$. This was proved by Ulrich Betke and Wolfgang Weil…

Metric Geometry · Mathematics 2021-03-23 Ferenc A. Bartha , Ferenc Bencs , Károly J. Böröczky , Daniel Hug

We study angles of multipliers of repelling cycles for hyperbolic rational maps in $\mathbb C(z)$. For a fixed $K \gg 1$, we show that almost all intervals of length $2\pi/K$ in $(-\pi,\pi]$ contain a multiplier angle with the property that…

Dynamical Systems · Mathematics 2021-01-01 Yan Mary He , Hongming Nie

Planetary orbits, being conic sections, may be obtained as the locus of intersection of planes and cones. The planes involved are familiar to anyone who has studied the classical Kepler problem. We focus here on the cones.

Classical Physics · Physics 2012-01-24 Terry R. McConnell

We compute the number of triangulations of a convex $k$-gon each of whose sides is subdivided by $r-1$ points. We find explicit formulas and generating functions, and we determine the asymptotic behaviour of these numbers as $k$ and/or $r$…

Combinatorics · Mathematics 2017-02-06 Andrei Asinowski , Christian Krattenthaler , Toufik Mansour

A problem originating with Erd\H{o}s and Silverman in the 1970s asks for the minimum integer $r(k)$ such that any set of $n \ge r(k)$ points in the plane has some $k$-subset with no right angles. The case $k=4$ has an interesting gap…

Combinatorics · Mathematics 2026-05-05 Peter J. Dukes

We consider a generalized angle in complex normed vector spaces. Its definition corresponds to the definition of the well known Euclidean angle in real inner product spaces. Not surprisingly it yields complex values as `angles'. This…

Functional Analysis · Mathematics 2015-06-17 Volker W. Thürey

There are two problems Analytical Geometry with facing anyone who studies this discipline: define the nature of the locus represented by the general equation 2do degree in two or three variables: That curve represents the plane? What…

History and Overview · Mathematics 2013-03-22 Jaime Chica , Jonathan Taborda

The Rolling Ball Theorem asserts that given a convex body K in Euclidean space and having a smooth surface bd(K) with all principal curvatures not exceeding c>0 at all boundary points, K necessarily has the property that to each boundary…

Differential Geometry · Mathematics 2009-03-30 Sz. Gy. Re've'sz

In this paper we consider several instances of the k-center on a line problem where the goal is, given a set of points S in the plane and a parameter k >= 1, to find k disks with centers on a line l such that their union covers S and the…

Computational Geometry · Computer Science 2009-02-20 Peter Brass , Christian Knauer , Hyeon-Suk Na , Chan-Su Shin , Antoine Vigneron

Let K be a d-dimensional convex body, and let $K^{(n)}$ be the intersection of n halfspaces containing $K$ whose bounding hyperplanes are independent and identically distributed. Under suitable distributional assumptions, we prove an…

Metric Geometry · Mathematics 2014-10-15 Károly J. Böröczky , Ferenc Fodor , Daniel Hug

Let $K$ be a set of $q^2+2q+1$ points in $PG(4,q)$. We show that if every 3-space meets $K$ in either one, two or three lines, a line and a non-degenerate conic, or a twisted cubic, then $K$ is a ruled cubic surface. Moreover, $K$…

Combinatorics · Mathematics 2019-06-12 S. G. Barwick , Wen-Ai Jackson

If $\mathcal{B}\subset \mathbb{R}^d$ ($d\geqslant 2$) is a compact convex domain with a smooth boundary of finite type, we prove that for almost every rotation $\theta\in SO(d)$ the remainder of the lattice point problem, $P_{\theta…

Number Theory · Mathematics 2013-03-19 Jingwei Guo

Let $K_0$ be a compact convex subset of the plane $\mathbb R^2$, and assume that $K_1\subseteq \mathbb R^2$ is similar to $K_0$, that is, $K_1$ is the image of $K_0$ with respect to a similarity transformation $\mathbb R^2\to\mathbb R^2$.…

Metric Geometry · Mathematics 2017-07-25 Gábor Czédli

Let $k$ and $i_1,\ldots,i_n$ be natural numbers. Place $k$ balls into a multidimensional box of $i_1\times\cdots \times i_n$ cells, no more than one ball to each cell, such that the projections to each of the coordinate axes have…

Combinatorics · Mathematics 2017-02-14 Jason Gibson

Positive solutions of homogeneous Dirichlet boundary value problems or initial-value problems for certain elliptic or parabolic equations must be radially symmetric and monotone in the radial direction if just one of their level surfaces is…

Analysis of PDEs · Mathematics 2013-07-05 Giulio Ciraolo , Rolando Magnanini , Shigeru Sakaguchi

A planar set $P$ is said to be cover-decomposable if there is a constant $k=k(P)$ such that every $k$-fold covering of the plane with translates of $P$ can be decomposed into two coverings. It is known that open convex polygons are…

Metric Geometry · Mathematics 2014-03-12 István Kovács , Géza Tóth