Related papers: Small Designs for Path Connected Spaces and Path C…

We give a new proof of the existence of designs, which is much shorter and gives better bounds.

We prove the existence of subspace designs with any given parameters, provided that the dimension of the underlying space is sufficiently large in terms of the other parameters of the design and satisfies the obvious necessary divisibility…

We study the smallest possible number of points in a topological space having k open sets. Equivalently, this is the smallest possible number of elements in a poset having k order ideals. Using efficient algorithms for constructing a…

We prove several results of the following type: given finite dimensional normed space V there exists another space X with log (dim X) = O(log (dim V)) and such that every subspace (or quotient) of X, whose dimension is not "too small,"…

A design is a finite set of points in a space on which every "simple" functions averages to its global mean. Illustrative examples of simple functions are low-degree polynomials on the Euclidean sphere or on the Hamming cube. We prove lower…

We study separating systems of the edges of a graph where each member of the separating system is a path. We conjecture that every $n$-vertex graph admits a separating path system of size $O(n)$ and prove this in certain interesting special…

We initiate an investigation of structures on the set of real numbers having the property that path components of definable sets are definable. All o\nobreakdash-\hspace{0pt}minimal structures on $(\mathbb{R},<)$ have the property, as do…

We construct a model for the (non-unital) S^1-framed little 2d-dimensional disks operad for any positive integer d using logarithmic geometry. We also show that the unframed little 2d-dimensional disks operad has a model which can be…

New types of designs called nested space-filling designs have been proposed for conducting multiple computer experiments with different levels of accuracy. In this article, we develop several approaches to constructing such designs. The…

Let $X\subset P^n$ be a complex projective manifold of degree $d$ and arbitrary dimension. The main result of this paper gives a classification of such manifolds (assumed moreover to be connected, non-degenerate and linearly normal) in case…

We prove Barth-type connectedness results for low-codimension smooth subvarieties with good numerical properties inside certain "easy" ambient spaces (such as homogeneous varieties, or spherical varieties). The argument employs some basics…

We prove several results of the following type: given finite dimensional normed space V possessing certain geometric property there exists another space X having the same property and such that (1) log (dim X) = O(log (dim V)) and (2) every…

Since its recent introduction, the small-world effect has been identified in several important real-world systems. Frequently, it is a consequence of the existence of a few long-range connections, which dominate the original regular…

In this paper, we prove that the log minimal model program in dimension $d-1$ implies the existence of log minimal models for effective lc pairs (eg of nonnegative Kodaira dimension) in dimension $d$. In fact, we prove that the same…

We prove that the existence of log minimal models in dimension $d$ essentially implies the LMMP with scaling in dimension $d$. As a consequence we prove that a weak nonvanishing conjecture in dimension $d$ implies the minimal model…

For each N>=c_d*n^{2d*(d+1)/(d+2)} we prove the existence of a spherical n-design on S^d consisting of N points, where c_d is a constant depending only on $d$.

For each $N\ge C_dt^d$ we prove the existence of a well separated spherical $t$-design in the sphere $S^d$ consisting of $N$ points, where $C_d$ is a constant depending only on $d$.

We prove that uniform circuits of size n can be evaluated in space O(n/log n). Thus, Space(O(n)) is not in uniform Size(o(n*log n)). For uniformity, we only require that the circuit is O(n/log n)-Space uniform. We also generalize the…

We prove a space-space trade-off for directed $st$-connectivity in the catalytic space model. For any integer $k \leq n$, we give an algorithm that decides directed $st$-connectivity using $O(\log n \cdot \log k+\log n)$ regular workspace…

Optimal block designs in small blocks are explored when the treatments have a natural ordering and interest lies in comparing consecutive pairs of treatments. We first develop an approximate theory which leads to a convenient multiplicative…