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

The dimension of a block design is the maximum positive integer $d$ such that any $d$ of its points are contained in a proper subdesign. Pairwise balanced designs PBD$(v,K)$ have dimension at least two as long as not all points are on the…

Small world models are networks consisting of many local links and fewer long range `shortcuts'. In this paper, we consider some particular instances, and rigorously investigate the distribution of their inter--point network distances. Our…

We record two facts on spaces of derived maps between the operads $E_d$ of little $d$-cubes. Firstly, these mapping spaces are equivalent to the mapping spaces between the non-unitary versions of $E_d$. Secondly, all endomorphisms of $E_d$…

We present an intrinsic and concrete development of the subdivision of small categories, give some simple examples and derive its fundamental properties. As an application, we deduce an alternative way to compare the homotopy categories of…

We show that any depth-$d$ circuit for determining whether an $n$-node graph has an $s$-to-$t$ path of length at most $k$ must have size $n^{\Omega(k^{1/d}/d)}$. The previous best circuit size lower bounds for this problem were…

We study ordered configuration spaces of compact manifolds with boundary. We show that for a large class of such manifolds, the real homotopy type of the configuration spaces only depends on the real homotopy type of the pair consisting of…

Given a point $s$ and a set of $h$ pairwise disjoint polygonal obstacles of totally $n$ vertices in the plane, we present a new algorithm for building an $L_1$ shortest path map of size O(n) in $O(T)$ time and O(n) space such that for any…

We consider definable topological spaces of dimension one in o-minimal structures, and state several equivalent conditions for when such a topological space $\left(X,\tau\right)$ is definably homeomorphic to an affine definable space…

We present the first in-place algorithm for sorting an array of size n that performs, in the worst case, at most O(n log n) element comparisons and O(n) element transports. This solves a long-standing open problem, stated explicitly, e.g.,…

We propose to use orthologic as the basis for designing type systems supporting intersection, union, and negation types in the presence of subtyping assumptions. We show how to extend orthologic to support monotonic and antimonotonic…

In this paper we study the topology of three different kinds of spaces associated to polynomial knots of degree at most $d$, for $d\geq2$. We denote these spaces by $\mathcal{O}_d$, $\mathcal{P}_d$ and $\mathcal{Q}_d$. For $d\geq3$, we show…

We show the existence of regular combinatorial objects which previously were not known to exist. Specifically, for a wide range of the underlying parameters, we show the existence of non-trivial orthogonal arrays, t-designs, and t-wise…

We prove that any $n$-node graph $G$ with diameter $D$ admits shortcuts with congestion $O(\delta D \log n)$ and dilation $O(\delta D)$, where $\delta$ is the maximum edge-density of any minor of $G$. Our proof is simple, elementary, and…

In [Bal18] a new method of constructing simplex designs based on cyclic group on $n$ elements has been proposed. One of the claims put forward therein is existence of 3-point simplex 3-design in dimension $d = 3$. In this manuscript we…

We study directed sets definable in o-minimal structures, showing that in expansions of ordered fields these admit cofinal definable curves, as well as a suitable analogue in expansions of ordered groups, and furthermore that no analogue…

It is widely believed that point sets in the plane which determine few distinct distances must have some special structure. In particular, such sets are believed to be similar to a lattice. This note considers two different ways to quantify…

In 1989, Ne\v{s}et\v{r}il and Pudl\'ak posed the following challenging question: Do planar posets have bounded Boolean dimension? We show that every poset with a planar cover graph and a unique minimal element has Boolean dimension at most…

We consider graphs parameterized on a portion $X\subset\mathbb Z^d\times \{1,\ldots, M\}^k$ of a cylindrical subset of the lattice $\mathbb Z^d\times \mathbb Z^k$, and perform a discrete-to-continuum dimension-reduction process for energies…

In this expository paper we give an elementary, hands-on computation of the homology of the little disks operad, showing that the homology of a $d-fold loop space is a Poisson algebra. One aim is to familiarize a greater audience with…

We obtain estimates for the number $p_d(n)$ of $(d-1)$-dimensional integer partitions of a number $n$. It is known that the two-sided inequality $C_1(d)n^{1-1/d}<\log p_d(n)< C_2(d)n^{1-1/d}$ is always true and that $C_1(d)>1$ whenever…