Related papers: Small Designs for Path Connected Spaces and Path C…
We explore injective morphisms from complex projective varieties $X$ to projective spaces $\mathbb{P}^s$ of small dimension. Based on connectedness theorems, we prove that the ambient dimension $s$ needs to be at least $2 \dim X$ for all…
We use dense Sidon sets to construct small weighted projective 2-designs. This represents quantitative progress on Zauner's conjecture.
We revisit the classic problem of simplex range searching and related problems in computational geometry. We present a collection of new results which improve previous bounds by multiple logarithmic factors that were caused by the use of…
In this report we show that in a planar exponentially growing network consisting of $N$ nodes, congestion scales as $O(N^2/\log(N))$ independently of how flows may be routed. This is in contrast to the $O(N^{3/2})$ scaling of congestion in…
We have identified some necessary conditions for the existence of rigid sphere designs. In particular, we have successfully resolved the conjecture proposed by [Ban87]; Given fixed positive integers t and d, we show that there exist only…
$\newcommand{\Re}{\mathbb{R}}$We study the minWSPD problem of computing the minimum-size well-separated pairs decomposition of a set of points, and show constant approximation algorithms in low-dimensional Euclidean space and doubling…
We study the probabilistic existence of point configurations satisfying the $(0, m, d)$-net property in base $b$ within a randomly generated point set of size $N$ in the $d$-dimensional unit cube. We first derive an upper bound on the…
It was recently claimed that on d-dimensional small-world networks with a density p of shortcuts, the typical separation s(p) ~ p^{-1/d} between shortcut-ends is a characteristic length for shortest-paths{cond-mat/9904419}. This contradicts…
Isocontours in road networks represent the area that is reachable from a source within a given resource limit. We study the problem of computing accurate isocontours in realistic, large-scale networks. We propose polygons with minimum…
In this paper, we use the concept of colored edge graphs to model homogeneous faults in networks. We then use this model to study the minimum connectivity (and design) requirements of networks for being robust against homogeneous faults…
Around 2000, J.-Y. Girard developed a logical theory, called Ludics. This theory was a step in his program of Geometry of Interaction, the aim of which being to account for the dynamics of logical proofs. In Ludics, objects called designs…
We present simple examples of finite-dimensional connected homogeneous spaces (they are actually topological manifolds) with nonhomogeneous and nonrigid factors. In particular, we give an elementary solution of an old problem in general…
An O(n) test for polygon convexity is stated and proved. It is also proved that the test is minimal in a certain exact sense.
In this paper, we show that for all v\pmod 1 (mod 3), there exists a super- simple (v, 4, 2) directed design. Also, we show that for these parameters there exists a super-simple (v, 4, 2) directed design whose each defining set has at least…
Sized types are a modular and theoretically well-understood tool for checking termination of recursive and productivity of corecursive definitions. The essential idea is to track structural descent and guardedness in the type system to make…
Design patterns are distilled from many real systems to catalog common programming practice. However, some object-oriented design patterns are distorted or overly complicated because of the lack of supporting programming language constructs…
The degree of a map between orientable manifolds is a fundamental concept in topology that aids in understanding the structure and properties of the manifolds and the maps between them. Numerous studies have been conducted on the degree of…
A $3$-$(v,\{4,6\},1)$ design is a configuration of $v$ points and a collection of $4$- and $6$-element subsets called blocks, that jointly contain every 3-element subset exactly once. Using an exhaustive computer search on $v\leq 28$ points…
In this note we extend connectedness results to formal properties of inverse images under proper maps of Schubert varieties and of the diagonal in products of projective rational homogeneous spaces
For every fixed $d \in \mathbb{N}$, we design a data structure that represents a binary $n \times n$ matrix that is $d$-twin-ordered. The data structure occupies $O_d(n)$ bits, which is the least one could hope for, and can be queried for…