Related papers: The densest sequence in the unit circle

Let R be a family of n axis-parallel rectangles with packing number p-1, meaning that among any p of the rectangles, there are two with a non-empty intersection. We show that the union complexity of R is at most O(n+p^2), and that the…

We consider hard-disc mixtures with disc sizes within ratio $\sqrt{2}-1$, that is, the small disc exactly fits in the hole between four large discs. For each prescribed stoichiometry of large and small discs, the densest packings are…

A sample of ~20,000 galaxies covering 0.76 deg2 were observed with the CFHT-UH8K up to V<23.5 and I<22.5. The angular correlation analysis of the red selected sample (V-I>1.4) shows a stronger amplitude than the blue selected sample at all…

For any $n \geq 0$ and $k \geq 1$, the \emph{density Hales-Jewett number} $c_{n,k}$ is defined as the size of the largest subset of the cube $[k]^n$ := $\{1,...,k\}^n$ which contains no combinatorial line; similarly, the Moser number…

Let $n_1,\cdots,n_r$ be any finite sequence of integers and let $S$ be the set of all natural numbers $n$ for which there exists a divisor $d(x)=1+\sum_{i=1}^{deg(d)}c_ix^i$ of $x^n-1$ such that $c_i=n_i$ for $1\leq i \leq r$. In this paper…

We establish new upper bounds for the length of runs of consecutive positive integers each with exactly $k$ divisors, where $k$ is a given positive integer of some special forms. Also we have found exact values of the maximum possible runs…

We present algorithms for length-constrained maximum sum segment and maximum density segment problems, in particular, and the problem of finding length-constrained heaviest segments, in general, for a sequence of real numbers. Given a…

A beam's density matrix that is described by the superposition of excitation on coherent states with thermal noise (SECST) is presented, and its matrix elements in Fock space are calculated. The maximum information transmitted by the SECST…

The sequence $(x_n)_{n\in\mathbb N} = (2,5,15,51,187,\dots)$ given by the rule $x_n=(2^n+1)(2^{n-1}+1)/3$ appears in several seemingly unrelated areas of mathematics. For example, $x_n$ is the density of a language of words of length $n$…

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…

Let $\Delta$ be the optimal packing density of $\mathbb R^n$ by unit balls. We show the optimal packing density using two sizes of balls approaches $\Delta + (1 - \Delta) \Delta$ as the ratio of the radii tends to infinity. More generally,…

Let $ \prod_{i=1}^d (X-\alpha_i Y) \in{\mathbb C}[X,Y]$ be a binary form and let $\epsilon_1,\dots,\epsilon_d$ be nonzero complex numbers. We consider the family of binary forms $ \prod_{i=1}^d (X-\alpha_i \epsilon_i^aY)$, $a\in {\mathbb…

We prove that the orbit of a non-periodic point at prime values of the horocycle flow in the modular surface is dense in a set of positive measure. For some special orbits we also prove that they are dense in the whole space (assuming the…

Let G be a digraph (without parallel edges) such that every directed cycle has length at least four; let $\beta(G)$ denote the size of the smallest subset X in E(G) such that $G\X$ has no directed cycles, and let $\gamma(G)$ be the number…

The combined Universal Probability M(D) of strings x in sets D is close to max M({x}) over x in D: their ~logs differ by at most D's information j=I(D:H) about the halting sequence H. Thus if all x have complexity K(x) >k, D carries >i bits…

Let $d_S$ denote the arithmetic density of a subset $S \subseteq \mathbb N$. We derive a power series in $q\in \mathbb C$, $|q|<1$, with co\"efficients related to integer partitions and integer compositions, that yields $1/d_S$ in the limit…

Consider the Cayley graph of the cyclic group of prime order q with k uniformly chosen generators. For fixed k, we prove that the diameter of said graph is asymptotically (in q) of order q^(1/k). The same also holds when the generating set…

We present spectroscopic observations of 11 moderately high-redshift (z~0.7- 1.0) clusters from the first Red-Sequence Cluster Survey (RCS-1). We find excellent agreement between the red-sequence estimated redshift and the spectroscopic…

Clusters of galaxies, the most massive virialized systems known, provide a powerful tool for studying the structure, the mass density, and the cosmology of our universe. Clusters furnish one of the best estimates of the dynamical mass…

We have obtained new deep optical and near-infrared images of the field of the radio-loud quasar 1335.8+2834 at $z=1.086$ where an excess in the surface number density of galaxies was reported by Hutchings et al. [AJ, 106, 1324] from…