Related papers: No new lower bound for the density of planar Sets …

For a given shape $S$ in the plane, one can ask what is the lowest possible density of a point set $P$ that pierces ("intersects", "hits") all translates of $S$. This is equivalent to determining the covering density of $S$ and as such is…

May the $\mathit{triforce}$ be the 3-uniform hypergraph on six vertices with edges $\{123',12'3,1'23\}$. We show that the minimum triforce density in a 3-uniform hypergraph of edge density $\delta$ is $\delta^{4-o(1)}$ but not…

It was recently shown that there exists metastable U(1)_A domain wall configurations in high-density QCD (\mu >> 1 GeV). In the following we will assess the stability of such non-trivial field configurations at intermediate densities (\mu <…

Beyond planarity concepts (prominent examples include k-planarity or fan-planarity) apply certain restrictions on the allowed patterns of crossings in drawings. It is natural to ask, how much the number of crossings may increase over the…

Erdos, Herzog and Piranian asked whether, for $n$ points in the plane with fixed diameter (maximum distance between points), an arrangement of a regular $n$-gon maximizes their product of all pairs of distances. Recently, it was discovered…

For any positive integer $r$, an $r$-identifying code on a graph $G$ is a set $C\subset V(G)$ such that for every vertex in $V(G)$, the intersection of the radius-$r$ closed neighborhood with $C$ is nonempty and pairwise distinct. For a…

We improve a lower bound for the smallest area of convex covers for closed unit curves from 0.0975 to 0.1, which makes it substantially closer to the current best upper bound 0.11023. We did this by considering the minimal area of convex…

First, let $K \subset B(0,1) \subset \mathbb{R}^{2}$ be a set with $\mathcal{H}_{\infty}^{1}(K) \sim 1$, and write $\pi_{e}(K)$ for the orthogonal projection of $K$ into the line spanned by $e \in S^{1}$. For $1/2 \leq s < 1$, write $$E_{s}…

The distance between the pre-impact surface of Comet 9P/Tempel 1 and the upper border of the largest cavity excavated during ejection of material after the collision of the impact module of the Deep Impact spacecraft with the comet is…

Planck allows unbiased mapping of Galactic sub-millimetre and millimetre emission from the most diffuse regions to the densest parts of molecular clouds. We present an early analysis of the Taurus molecular complex, on…

This paper presents an empirical study of the relationship between the density of small-medium sized random graphs and their planarity. It is well known that, when the number of vertices tends to infinite, there is a sharp transition…

The Pioneer 10 and 11 spacecraft had exceptional deep-space navigational capabilities. The accuracies of their orbit reconstruction were limited, however, by a small, anomalous, Doppler frequency drift that can be interpreted as an…

In this work, we study the minimum/stopping distance of array low-density parity-check (LDPC) codes. An array LDPC code is a quasi-cyclic LDPC code specified by two integers q and m, where q is an odd prime and m <= q. In the literature,…

The central density rho_0 of a stellar cluster is an important physical parameter for determining its evolutionary and dynamical state. How much mass segregation there is, or whether the cluster has undergone core collapse both depends on…

In this short note we give a new upper bound for the size of a set family with a single Hamming distance. Our proof is an application of the linear algebra bound method.

We describe a set of $\Delta -1$ slopes that are universal for 1-bend planar drawings of planar graphs of maximum degree $\Delta \geq 4$; this establishes a new upper bound of $\Delta-1$ on the 1-bend planar slope number. By universal we…

For three decades, adaptive optic surveys have revealed an excess of T Tauri binaries across a = 10-100 au in nearby star-forming regions compared to the field population of main-sequence (MS) stars. Such an excess requires that most stars…

In this article we give upper and lower bounds for the integrated density of states (IDS) of the 1D discrete Anderson-Bernoulli model when the disorder is strong enough to separate the two spectral bands. These bounds are uniform on the…

Let F be a finite union-closed family of sets whose largest set contains n elements. In \cite{Wojcik92}, Wojcik defined the density of F to be the ratio of the average set size of F to n and conjectured that the minimum density over all…

A family of graphs $\mathcal{F}$ is $H$-intersecting if the edge intersection of any two graphs in $\mathcal{F}$ contains a copy of a fixed graph $H$. A fundamental problem is to determine the maximum size of such a family. The trivial…