The smallest sets of points not determined by their X-rays

Let $F$ be an $n$-point set in $\mathbb{K}^d$ with $\mathbb{K}\in\{\mathbb{R},\mathbb{Z}\}$ and $d\geq 2$. A (discrete) X-ray of $F$ in direction $s$ gives the number of points of $F$ on each line parallel to $s$. We define $\psi_{\mathbb{K}^d}(m)$ as the minimum number $n$ for which there exist $m$ directions $s_1,...,s_m$ (pairwise linearly independent and spanning $\mathbb{R}^d$) such that two $n$-point sets in $\mathbb{K}^d$ exist that have the same X-rays in these directions. The bound $\psi_{\mathbb{Z}^d}(m)\leq 2^{m-1}$ has been observed many times in the literature. In this note we show $\psi_{\mathbb{K}^d}(m)=O(m^{d+1+\varepsilon})$ for $\varepsilon>0$. For the cases $\mathbb{K}^d=\mathbb{Z}^d$ and $\mathbb{K}^d=\mathbb{R}^d$, $d>2$, this represents the first upper bound on $\psi_{\mathbb{K}^d}(m)$ that is polynomial in $m$. As a corollary we derive bounds on the sizes of solutions to both the classical and two-dimensional Prouhet-Tarry-Escott problem. Additionally, we establish lower bounds on $\psi_{\mathbb{K}^d}$ that enable us to prove a strengthened version of R\'enyi's theorem for points in $\mathbb{Z}^2$

Mariner 9 data storage subsystem flight performance summary

The performance is summarized of the Mariner 9 Data Storage Subsystem (DSS) throughout the primary and extended missions. Information presented is limited to reporting of anomalies which occurred during the playback sequences. Tables and figures describe the anomalies (dropouts, missing and added bits, in the imaging data) as a function of time (accumulated tape passes). The data results indicate that the performance of the DSS was satisfactory and within specification throughout the mission. The data presented is taken from the Spacecraft Team Incident/Surprise Anomaly Log recorded during the mission. Pertinent statistics concerning the tape transport performance are given. Also presented is a brief description of DSS operation, particularly that related to the recorded anomalies. This covers the video data encoding and how it is interpreted/decoded by ground data processing and the functional operation of the DSS in abnormal conditions such as loss of lock to the playback signal

CONVEX-BODIES, ECONOMIC CAP COVERINGS, RANDOM POLYTOPES

Let K be a convex compact body with nonempty interior in the d-dimensional Euclidean space Rd and let x1, …, xn be random points in K, independently and uniformly distributed. Define Kn = conv {x1, …, xn}. Our main concern in this paper will be the behaviour of the deviation of vol Kn from vol K as a function of n, more precisely, the expectation of the random variable vol (K\Kn). We denote this expectation by E (K, n)

Almost ellipsoidal sections and projections of convex bodies

In (1) Dvoretsky proved, using very ingenious methods, that every centrally symmetric convex body of sufficiently high dimension contains a central k-dimensional section which is almost spherical. Here we shall extend this result (Corollary to Theorem 2) to k-dimensional sections through an arbitrary interior point of any convex bod

On disjoint Borel uniformizations

Larman showed that any closed subset of the plane with uncountable vertical cross-sections has aleph_1 disjoint Borel uniformizing sets. Here we show that Larman's result is best possible: there exist closed sets with uncountable cross-sections which do not have more than aleph_1 disjoint Borel uniformizations, even if the continuum is much larger than aleph_1. This negatively answers some questions of Mauldin. The proof is based on a result of Stern, stating that certain Borel sets cannot be written as a small union of low-level Borel sets. The proof of the latter result uses Steel's method of forcing with tagged trees; a full presentation of this method, written in terms of Baire category rather than forcing, is given here

The width of 5-dimensional prismatoids

Santos' construction of counter-examples to the Hirsch Conjecture (2012) is based on the existence of prismatoids of dimension d of width greater than d. Santos, Stephen and Thomas (2012) have shown that this cannot occur in $d \le 4$. Motivated by this we here study the width of 5-dimensional prismatoids, obtaining the following results: - There are 5-prismatoids of width six with only 25 vertices, versus the 48 vertices in Santos' original construction. This leads to non-Hirsch polytopes of dimension 20, rather than the original dimension 43. - There are 5-prismatoids with $n$ vertices and width $\Omega(\sqrt{n})$ for arbitrarily large $n$. Hence, the width of 5-prismatoids is unbounded.Comment: 31 pages, 10 figures. Changes from v1: the introduction has been edited, and a minor correction made in the statement of Proposition 1.