Related papers: The Lonely Vertex Problem

In this paper, we prove that if a finite number of rectangles, every of which has at least one integer side, perfectly tile a big rectangle then there exists a strategy which reduces the number of these tiles (rectangles) without violating…

The 1-2-3 conjecture has been solved positively in 2024 for finite graphs and by extension for infinite graphs which are locally finite. The solution is non-constructive, and finding explicit solutions for large (or infinite) graphs is very…

We consider a problem concerning tilings of rectangular regions by a finite library of polyominoes. We specifically look at rectangular regions of dimension $n\times m$ and ask whether or not a tiling of this region can be rearranged so…

We show that convex pentagons that can generate edge-to-edge monohedral tilings of the plane can be classified into exactly eight types. Using these results, it is also proved that no single convex polygon can be an aperiodic prototile…

We regard a smooth, $d=2$-dimensional manifold $\mathcal{M}$ and its normal tiling $M$, the cells of which may have non-smooth or smooth vertices (at the latter, two edges meet at 180 degrees.) We denote the average number (per cell) of…

An h-tiling on a finite simplicial complex is a partition of its geometric realization by maximal simplices deprived of several codimension one faces together with possibly their remaining face of highest codimension. In this last case, the…

We study the problem of tiling and packing in vector spaces over finite fields, its connections with zeroes of classical exponential sums, and with the Jacobian conjecture

In this paper, we investigate the anisotropic Calder{\'o}n problem on cylindrical Riemannian manifolds with boundary having two ends and equipped with singular metrics of (simple or double) warped product type, that is whose warping factors…

We consider positive solutions to $\displaystyle -\Delta_p u=\frac{1}{u^\gamma}+f(u)$ under zero Dirichlet condition in the half space. Exploiting a prio-ri estimates and the moving plane technique, we prove that any solution is monotone…

We study the minimal complexity of tilings of a plane with a given tile set. We note that every tile set admits either no tiling or some tiling with O(n) Kolmogorov complexity of its n-by-n squares. We construct tile sets for which this…

We present simple examples of finite-dimensional connected homogeneous spaces (they are actually topological manifolds) with nonhomogeneous and nonrigid factors. In particular, we give an elementary solution of an old problem in general…

We study uniqueness of Dirichlet problems of second order divergence-form elliptic systems with transversally independent coefficients on the upper half-space in absence of regularity of solutions. To this end, we develop a substitute for…

We obtain bounds on the least dimension of an affine space that can contain an $n$-dimensional submanifold without any pairs of parallel or intersecting tangent lines at distinct points. This problem is closely related to the generalized…

The thesis concentrates on two problems in discrete geometry, whose solutions are obtained by analytic, probabilistic and combinatoric tools. The first chapter deals with the strong polarization problem. This states that for any sequence…

We show that a realization of a closed connected PL-manifold of dimension n-1 in Euclidean n-space (n>2) is the boundary of a convex polyhedron if and only if the interior of each (n-3)-face has a point, which has a neighborhood lying on…

Using equivariant topology, we prove that it is always possible to find $n$ points in the $d$-dimensional faces of a $nd$-dimensional convex polytope $P$ so that their center of mass is a target point in $P$. Equivalently, the $n$-fold…

Every convex polygon with $n$ vertices is a linear projection of a higher-dimensional polytope with at most $147\,n^{2/3}$ facets.

We study a long standing open problem by Ulam, which is whether the Euclidean ball is the unique body of uniform density which will float in equilibrium in any direction. We answer this problem in the class of origin symmetric n-dimensional…

We expand the basic geometric elements of the simplex method to linear programs in locally convex topological vector spaces and provide conditions under which the method converges in value to optimality. This setting generalizes many…

Many years ago John Tyrell a lecturer at King's college London challenged his Ph.D. students with the following puzzle: show that there is a unique triangle of minimal perimeter with exactly one vertex to lie on one of three given lines,…