English
Related papers

Related papers: Covering of a rectangle by squares

200 papers

Let $A$ be a polytope in $\mathbb{R}^d$ (not necessarily convex or connected). We say that $A$ is spectral if the space $L^2(A)$ has an orthogonal basis consisting of exponential functions. A result due to Kolountzakis and Papadimitrakis…

Classical Analysis and ODEs · Mathematics 2019-11-05 Nir Lev , Bochen Liu

In this note we prove that, if $S_n$ is the greatest area of a rectangle which can be covered with $n$ unit disks, then $2\leq S_n/n<3 \sqrt{3}/2$, and these are the best constants; moreover, for $\Delta(n):=(3\sqrt{3}/2)n-S_n$, we have…

Computational Geometry · Computer Science 2016-05-12 Emanuele Tron

In the convex covering problem, we are given a convex polygon with holes $P$ and the goal is to cover $P$ using a small number of convex polygons that lie inside $P$. In this paper, we solve the problem using the following strategy. We find…

Computational Geometry · Computer Science 2025-06-23 Guilherme D. da Fonseca

Let $P$ and $Q$ be two convex polytopes both contained in the interior of an Euclidean ball $r\textbf{B}^{d}$. We prove that $P=Q$ provided that their sight cones from any point on the sphere $rS^{d-1}$ are congruent. We also prove an…

Metric Geometry · Mathematics 2018-11-14 Sergii Myroshnychenko

We study three covering problems in the plane. Our original motivation for these problems come from trajectory analysis. The first is to decide whether a given set of line segments can be covered by up to four unit-sized, axis-parallel…

Computational Geometry · Computer Science 2022-05-03 Joachim Gudmundsson , Mees van de Kerkhof , André van Renssen , Frank Staals , Lionov Wiratma , Sampson Wong

It is well-known that for $p=1, 2, 3, 7, 11, 19, 43, 67, 163$, the class number of $\mathbb{Q}(\sqrt{-p})$ is one. We use this fact to determine all the solutions of $x^2+p^m=4y^n$ in non-negative integers $x, y, m$ and $n$.

Number Theory · Mathematics 2020-03-24 Kalyan Chakraborty , Azizul Hoque , Richa Sharma

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

We present an algorithm that covers any given rational ruled surface with two rational parametrizations. In addition, we present an algorithm that transforms any rational surface parametrization into a new rational surface parametrization…

Algebraic Geometry · Mathematics 2014-10-08 J. Rafael Sendra , David Sevilla , Carlos Villarino

We use Ratner's theorem to compute the asymptotics of the number of (cylinders of) periodic trajectories in a rectangle with a barrier, assuming that the location p/q of the barrier is rational. We also show that as q tends to infinity, the…

Dynamical Systems · Mathematics 2007-05-23 Alex Eskin , Howard Masur , Martin Schmoll

Viale introduced covering matrices in his proof that SCH follows from PFA. In the course of the proof amd subsequent work with Sharon, he isolated two reflection principles, CP and S, which, under certain circumstances, are satisfied by all…

Logic · Mathematics 2014-09-15 Chris Lambie-Hanson

Given two finite covers $p: X \to S$ and $q: Y \to S$ of a connected, oriented, closed surface $S$ of genus at least $2$, we attempt to characterize the equivalence of $p$ and $q$ in terms of which curves lift to simple curves. Using…

Geometric Topology · Mathematics 2020-07-01 Tarik Aougab , Max Lahn , Marissa Loving , Yang Xiao

In their 2009 note: \emph{Packing equal squares into a large square}, Chung and Graham proved that the uncovered area of a large square of side length $x$ is $O\left(x^{(3+\sqrt{2})/7}\log x\right)$ after maximum number of non-overlapping…

Combinatorics · Mathematics 2016-04-12 Shuang Wang , Tian Dong , Jiamin Li

Each packing of R^d by translates of the unit cube [0,1)^d admits a decomposition into at most two parts such that if a translate of the unit cube is covered by one of them, then it also belongs to such a part.

Combinatorics · Mathematics 2009-02-12 Andrzej P. Kisielewicz , Krzysztof Przesławski

We analyze the problem of quadrangulating a $n$-sided patch, each side at its boundary subdivided into a given number of edges, using a single irregular vertex (or none, when $n = 4$) that breaks the otherwise fully regular lattice. We…

Graphics · Computer Science 2022-07-15 Marco Tarini

An $m$-$cover$ of lines of a finite projective space ${\rm PG}(r,q)$ (of a finite polar space $\cal P$) is a set of lines $\cal L$ of ${\rm PG}(r,q)$ (of $\cal P$) such that every point of ${\rm PG}(r,q)$ (of $\cal P$) contains $m$ lines of…

Combinatorics · Mathematics 2018-07-03 A. Cossidente , F. Pavese

In this paper we have a look at squared squares with small integer sidelengths, where the only restriction is that any two subsquares of the same size are not allowed to share a full border. We prove that there are exactly two such squared…

Combinatorics · Mathematics 2013-07-10 Lorenz Milla

We prove that the quotient by SL(2)\timesSL(2) of the space of bidegree (a, b) curves on P^1\timesP^1 is rational when ab is even and a\not=b.

Algebraic Geometry · Mathematics 2019-02-20 Shouhei Ma

We prove a complex polynomial plank covering theorem for not necessarily homogeneous polynomials. As the consequence of this result, we extend the complex plank theorem of Ball to the case of planks that are not necessarily centrally…

Metric Geometry · Mathematics 2024-05-28 Alexey Glazyrin , Roman Karasev , Alexandr Polyanskii

We consider here square tilings of the plane. By extending the formalism introduced in [3] we build a correspondence between plane maps endowed with an harmonic vector and square tilings satisfying a condition of regularity. In the case of…

Combinatorics · Mathematics 2011-01-04 Mathieu Dutour Sikirić

Rationally convex topological embeddings of compact surfaces (closed or with boundary) into $\mathbb{C}^2$ are constructed.

Complex Variables · Mathematics 2018-11-08 Luke Broemeling , Rasul Shafikov
‹ Prev 1 3 4 5 6 7 10 Next ›