Related papers: Tiling of rectangles with squares via Diophantine …
We construct finite free resolutions of Z over ZG, where G is the fundamental group of a surface distinct from S^2 and RP^2, and define diagonal approximations for these resolutions. We then procceed to give some possible applications that…
New algorithms are presented for numerical conformal mapping based on rational approximations and the solution of Dirichlet problems by least-squares fitting on the boundary. The methods are targeted at regions with corners, where the…
This paper is motivated by Davenport's problem and the subsequent work regarding badly approximable points in submanifolds of a Euclidian space. We study the problem in the area of twisted Diophantine approximation and present two different…
The goal of this PhD thesis is to study a diophantine approximation problem stated by Schmidt in 1967. The problem aim to study the approximation of a subspace of $\mathbb{R}^n$ by rational subspaces, not necessarily of the same dimension,…
The pinwheel tiling is the paradigm for a substitution tiling with circular symmetry, in the sense that the corresponding autocorrelation is circularly symmetric. As a consequence, its diffraction measure is also circularly symmetric, so…
The main objective of this paper is to prove a Khintchine type theorem for divergence for linear Diophantine approximation on non-degenerate manifolds, which completes earlier results for convergence.
A {\it two-dimensional continued fraction expansion} is a map $\mu$ assigning to every $x \in\mathbb R^2\setminus\mathbb Q^2$ a sequence $\mu(x)=T_0,T_1,\dots$ of triangles $T_n$ with vertices $x_{ni}=(p_{ni}/d_{ni},q_{ni}/d_{ni})\in\mathbb…
Finding integer solutions to norm form equations is a classical Diophantine problem. Using the units of the associated coefficient ring, we can produce sequences of solutions to these equations. It is known that these solutions can be…
Motivated by a question of Erd\"{o}s and inquiries by Beeson and Laczkovich, we explore the possible $N$ for which a triangle $T$ can tile into $N$ congruent copies of a triangle $R$. The \emph{reptile} cases (where $T$ is similar to $R$)…
We develop the theory of Diophantine approximation for systems of simultaneously small linear forms, which coefficients are drawn from any given analytic non-degenerate manifolds. This setup originates from a problem of Sprind\v{z}uk from…
We propose a new algorithm to the problem of polygonal curve approximation based on a multiresolution approach. This algorithm is suboptimal but still maintains some optimality between successive levels of resolution using dynamic…
Starting with a substitution tiling, we demonstrate a method for constructing infinitely many new substitution tilings. Each of these new tilings is derived from a graph iterated function system and the tiles have fractal boundary. We show…
We give a characterization of all three points in $\mathbb R^4$ with integer coordinates which are at the same Euclidean distance apart. In three dimension the problem is characterized in terms of solutions of the Diophantine equations…
We show how to determine if a given simple rectilinear polygon can be tiled with rectangles, each having an integer side.
We investigate the metric theory of Diophantine approximation on missing-digit fractals. In particular, we establish analogues of Khinchin's theorem and Gallagher's theorem, as well as inhomogeneous generalisations.
We develop a systematic method for computing the angle combinations at all vertices in an edge-to-edge tiling of the sphere by pentagons with the same five angles. The method is a useful and necessary step in many tiling problems about…
While it is a classical result dating back to Dehn (1903) that squares composing a perfect rectangle must have rational side lengths, the arithmetic complexity of these tilings, specifically the growth of the denominators of these rational…
There are abundant results on Diophantine approximation over fields of positive characteristic (see the survey papers [13, 25]), but there is very little information about simultaneous approximation. In this paper, we develop a technique of…
In this work, we provide the first practical evaluation of the structural rounding framework for approximation algorithms. Structural rounding works by first editing to a well-structured class, efficiently solving the edited instance, and…
Schmidt generalized in 1967 the theory of classical Diophantine approximation to subspaces of $\R^n$. We consider Diophantine exponents for linear subspaces of $\R^n$ which generalize the irrationality measure for real numbers. Using…