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

For a path-connected space X, a well-known theorem of Segal, May and Milgram asserts that the configuration space of finite points in R^n with labels in X is weakly homotopy equivalent to the n-th loop-suspension of X. In this paper, we…

We prove that among all graphs of order n, the path uniquely minimises the average order of its connected induced subgraphs. This confirms a conjecture of Kroeker, Mol and Oellermann, and generalises a classical result of Jamison for trees,…

Designing complex engineered systems requires managing tightly coupled trade-offs between subsystem capabilities and resource requirements. Monotone co-design provides a compositional language for such problems, but its generality does not…

The dimension is a key measure of complexity of partially ordered sets. Small dimension allows succinct encoding. Indeed if $P$ has dimension $d$, then to know whether $x \leq y$ in $P$ it is enough to check whether $x\leq y$ in each of the…

In this paper, we study $\mathbb{A}^1$-connected varieties from log geometry point of view, and prove a criterion for $\mathbb{A}^1$-connectedness. As applications, we provide many interesting examples of $\mathbb{A}^1$-connected varieties…

Let $\Omega$ be a connected open set in the plane and $\gamma: [0,1] \to \overline{\Omega}$ a path such that $\gamma((0,1)) \subset \Omega$. We show that the path $\gamma$ can be ``pulled tight'' to a unique shortest path which is homotopic…

This paper studies the configuration space of all possible positions of a linkage in R^n. For example, it shows that for every compact algebraic set, there is a linkage whose configuration space is analytically isomorphic to a finite number…

The D-dimensional conformal nonlinear sigma-models (NSM) sre constructed. It is shown that the NSM on spaces with $\pi_{D-1} = \mathbb {Z}$ have the topological solutions of a "hedgehog" and "anti-hedgehog" types with logarithmic energies.…

It is known that any planar graph with diameter D has treewidth O(D), and this fact has been used as the basis for several planar graph algorithms. We investigate the extent to which similar relations hold in other graph families. We show…

Small world models are networks consisting of many local links and fewer long range 'shortcuts', used to model networks with a high degree of local clustering but relatively small diameter. Here, we concern ourselves with the distribution…

If we pick $n$ random points uniformly in $[0,1]^d$ and connect each point to its $k-$nearest neighbors, then it is well known that there exists a giant connected component with high probability. We prove that in $[0,1]^d$ it suffices to…

We show that for a closed surface of genus at least 5, or a surface of genus at least 2 with at least one marked point, the set of uniquely ergodic foliations and the set of cobounded foliations is path-connected and locally path-connected.

Recent work argued that the scaling of a dimensionless quantity $Q_D$ with path length is a better proxy for quantifying the scaling of the computational cost of maintaining adiabaticity than the timescale. It also conjectured that…

We prove that for any $K$ and $d$, there exist, for all sufficiently large admissible $v$, a pairwise balanced design PBD$(v,K)$ of dimension $d$ for which all $d$-point-generated flats are bounded by a constant independent of $v$. We also…

In fault-tolerant distance labeling we wish to assign short labels to the vertices of a graph $G$ such that from the labels of any three vertices $u,v,f$ we can infer the $u$-to-$v$ distance in the graph $G\setminus \{f\}$. We show that any…

This paper introduces a new data-structural object that we call the tiny pointer. In many applications, traditional $\log n $-bit pointers can be replaced with $o (\log n )$-bit tiny pointers at the cost of only a constant-factor time…

Let X be a tight t-design of dimension n for one of the open cases t=5 or t=7. An investigation of the lattice generated by X using arithmetic theory of quadratic forms allows to exclude infinitely many values for n.

This note initiates an investigation of packing links into a region of Euclidean space to achieve a maximal density subject to geometric constraints. The upper bounds obtained apply only to the class of homotopically essential links and…

A minimal separating set in a connected topological space $X$ is a subset $L \subset X$ with the property that $X \setminus L$ is disconnected, but if $L^{\prime}$ is a proper subset of $L$, then $X \setminus L^{\prime}$ is connected. Such…

In this work, we consider pattern matching variants in small space, that is, in the read-only setting, where we want to bound the space usage on top of storing the strings. Our main contribution is a space-time trade-off for the Internal…