Related papers: On the Multiple Covering Densities of Triangles

In this paper we determine new upper bounds for the maximal density of translative packings of superballs in three dimensions (unit balls for the $l^p_3$-norm) and of Platonic and Archimedean solids having tetrahedral symmetry. Thereby, we…

One of the basic problems in discrete geometry is to determine the most efficient packing of congruent replicas of a given convex set $K$ in the plane or in space. The most commonly used measure of efficiency is density. Several types of…

In this paper, we present two new results of layered permutation densities. The first one generalizes theorems from H\"{a}st\"{o} (2003) and Warren (2004) to compute the permutation packing of permutations whose layer sequence…

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…

Let $K$ and $L$ be two disjoint unions of strictly convex obstacles contained within a Riemannian manifold with boundary $S$ of dimension $m\geq 2$. The sets of travelling times $\mathcal{T}_K$ and $\mathcal{T}_L$ of $K$ and $L$,…

A seminal result in the theory of toric varieties, due to Knudsen, Mumford and Waterman (1973), asserts that for every lattice polytope $P$ there is a positive integer $k$ such that the dilated polytope $kP$ has a unimodular triangulation.…

We show that a convex body admits a translative dense packing in $\mathbb{R}^d$ if and only if it admits a translative economical covering.

We prove that for any point set P in the plane, a triangle T, and a positive integer k, there exists a coloring of P with k colors such that any homothetic copy of T containing at least ck^8 points of P, for some constant c, contains at…

In 1900, as a part of his 18th problem, Hilbert proposed the question to determine the densest congruent (or translative) packings of a given solid, such as the unit ball or the regular tetrahedron of unit edges. Up to now, our knowledge…

A $3$-uniform hypergraph (or $3$-graph) $H=(V,E)$ is $(d,\mu,1)$-\emph{dense} if for any subsets $X,Y,Z\subseteq V$, the number of triples $(x,y,z)\in X\times Y\times Z$ such that $\{x,y,z\}$ is an edge of $H$ is at least $d|X||Y||Z|-\mu…

We consider the problem of finding a set (partial covering array) $S$ of vertices of the Boolean $n$-cube having cardinality $2^{n-k}$ and intersecting with maximum number of $k$-dimensional faces. We prove that the ratio between the…

For two convex bodies K and T in $R^n$, the covering number of K by T, denoted N(K,T), is defined as the minimal number of translates of T needed to cover K. Let us denote by $K^o$ the polar body of K and by D the euclidean unit ball in…

We study triangulations $\cal T$ defined on a closed disc $X$ satisfying the following condition: In the interior of $X$, the valence of all vertices of $\cal T$ except one of them (the irregular vertex) is $6$. By using a flat singular…

We study density estimation in Kullback-Leibler divergence: given an i.i.d. sample from an unknown density $p^\star$, the goal is to construct an estimator $\widehat{p}$ such that $\mathrm{KL}(p^\star,\widehat{p})$ is small with high…

Based on Minkowski's work on critical lattices of 3-dimensional convex bodies we present an efficient algorithm for computing the density of a densest lattice packing of an arbitrary 3-polytope. As an application we calculate densest…

Given a number field $K$, we show that certain $K$-integral representations of closed surface groups can be deformed to being Zariski dense while preserving many useful properties of the original representation. This generalizes a method…

We study the elliptic curves given by $y^2 = x^3 + b x + t^{3^n+1}$ over global function fields of characteristic $3$; in particular we perform an explicit computation of the $L$-function by relating it to the zeta function of a certain…

We answer an open problem in the \emph{American Mathematical Monthly} about covering large triangles. Given a triangle $T$ of any triangular shape with a selected side length between $n \in \mathbb{N}$ and $n+1$, Baek and Lee proved that…

We prove that the reciprocal sum $S_k(x)$ of the least common multiple of $k\geq 3$ positive integers in $\N\cap [1,x]$ satisfies $$ S_k(x)=P_{2^k-1}(\log x)+O(x^{-\theta_k+\epsilon}) $$ where $P$ is a polynomial of degree $2^k-1$ and…

We consider random lattice triangulations of $n\times k$ rectangular regions with weight $\lambda^{|\sigma|}$ where $\lambda>0$ is a parameter and $|\sigma|$ denotes the total edge length of the triangulation. When $\lambda\in(0,1)$ and $k$…