Andrii Arman

activity

20242026

collaborators

Showing math.MGShow all

9 papers · 1 filter

math.MG2026

On Grünbaum's problem for symmetric configurations

Andrii Arman, Andriy Bondarenko, Andriy Prymak +1

Let $g_{n}$ be the largest number of Euclidean balls of diameter $1$ which may be needed to cover a set of diameter $1$ in $R^{n}$ . We study this problem for finite sets invar…

math.MG2025

On asymptotic Lebesgue's universal covering problem

Andrii Arman, Andriy Bondarenko, Andriy Prymak +1

Universal cover in $E^{n}$ is a measurable set that contains a congruent copy of any set of diameter 1. Lebesgue's universal covering problem, posed in 1914, asks for the…

math.MG2025

Hadwiger's conjecture for cap bodies

Andrii Arman, Jaskaran Singh Kaire, Andriy Prymak

Hadwiger's covering conjecture states that every $n$ -dimensional convex body can be covered by at most $2^{n}$ of its smaller positive homothetic translates, with $2^{n}$ copies requir…

math.MG2025

Illumination number of 3-dimensional cap bodies

Andrii Arman, Jaskaran Singh Kaire, Andriy Prymak

The illumination conjecture asserts that any convex body in $n$ -dimensional Euclidean space can be illuminated by at most $2^{n}$ external light sources or parallel beams of light. D…

math.MG2024

On a Gallai-type problem and illumination of spiky balls and cap bodies

Andrii Arman, Andriy Bondarenko, Andriy Prymak +1

We show that any finite family of pairwise intersecting balls in $E^{n}$ can be pierced by $(3/2 + o (1))^{n}$ points improving the previously known estimate of $(2+o(1))^…

math.MG2024

Minimal dispersion on the cube and the torus

Andrii Arman, Alexander E. Litvak

We improve some upper bounds for minimal dispersion on the cube and torus. /Our new ingredient is an improvement of a probabilistic lemma used to obtain upper bounds for dispersion…