Related papers: The Kakeya problem for circular arcs

In this paper we show how, under surprisingly weak assumptions, one can split a planar curve into three arcs and rearrange them (matching tangent directions) to obtain a closed curve. We also generalize this construction to curves split…

In this paper, we prove, using only elementary geometric arguments and only assuming that the curves are continuous, that the geodesics on a sphere are the minor arcs of the great circles. Our result are valid for any sphere in any inner…

We prove that a Kakeya set in a vector space over a finite field of size $q$ always supports a probability measure whose Fourier transform is bounded by $q^{-1}$ for all non-zero frequencies. We show that this bound is sharp in all…

A Besicovitch set is a subset of $\R^d$ that contains a unit line segment in every direction and the famous Kakeya conjecture states that Besicovitch sets should have full dimension. We provide a number of results in support of this…

We prove that every polynomially convex arc is contained in a polynomially convex simple closed curve. We also establish results about polynomial hulls of arcs and curves that are locally rectifiable outside a polynomially convex subset.

We prove a general counting result for arcs of the same type in compact surfaces. Wealso count infinite arcs in cusped surfaces and arcs in orbifolds. These theorems are derived from aresult that guarantees the convergence of certain…

A subset U of a group G is called k-universal if U contains a translate of every k-element subset of G. We give several nearly optimal constructions of small k-universal sets, and use them to resolve an old question of Erdos and Newman on…

For a finite vector space $V$ and a non-negative integer $r\le\dim V$ we estimate the smallest possible size of a subset of $V$, containing a translate of every $r$-dimensional subspace. In particular, we show that if $K\subset V$ is the…

A two-dimensional Besicovitch set over a finite field is a subset of the finite plane containing a line in each direction. In this paper, we conjecture a sharp lower bound for the size of such a subset and prove some results toward this…

We consider the Keplerian arcs around a fixed Newtonian center joining two prescribed distinct positions in a prescribed flight time. We prove that, putting aside the "opposition case" where infinitely many planes of motion are possible,…

Here we show some results related with Kakeya conjecture which says that for any integer $n\geq 2$, a set containing line segments in every dimension in $\mathbb{R}^n$ has full Hausdorff dimension as well as box dimension. We proved here…

The higher-dimensional version of Kannan and Lipton's Orbit Problem asks whether it is decidable if a target subspace can be reached from a starting point under repeated application of a linear transformation. Similarly, the continuous…

The task of approximating points with circular arcs is performed in many applications, such as polyline compression, noise filtering, and feature recognition. However, the development of algorithms that perform a significant amount of…

The Planar Contraction problem is to test whether a given graph can be made planar by using at most k edge contractions. This problem is known to be NP-complete. We show that it is fixed-parameter tractable when parameterized by k.

For an integer $k\geq 1$, a graph is called a $k$-circulant if its automorphism group contains a cyclic semiregular subgroup with $k$ orbits on the vertices. We show that, if $k$ is even, there exist infinitely many cubic arc-transitive…

Consider the circle $C$ of length 1 and a circular arc $A$ of length $\ell\in (0,1)$. It is shown that there exists $k=k(\ell) \in \mathbb{N}$, and a schedule for $k$ runners along the circle with $k$ constant but distinct positive speeds…

We show the short time existence and uniqueness of solutions to the Cauchy problem for fully nonlinear systems of arbitrary even order on closed manifolds which are strongly parabolic at the initial values. The proof uses a linearization…

In this paper, we study generalized versions of the k-center problem, which involves finding k circles of the smallest possible equal radius that cover a finite set of points in the plane. By utilizing the Minkowski gauge function, we…

We prove that all bounded subsets of $\mathbb{Q}_p^n$ containing a line segment of unit length in every direction have Hausdorff and Minkowski dimension $n$. This is the analogue of the classical Kakeya conjecture with $\mathbb{R}$ replaced…

We prove that a connected graph contains a circuit---a closed walk that repeats no edges---through any $k$ prescribed edges if and only if it contains no odd cut of size at most $k$.