Related papers: Directed topological complexity of spheres
The probability distribution for the number of top to bottom spanning clusters in Directed percolation in two and three dimensions appears to be universal and is of the form $P(n) \sim \exp(-\alpha n^2)$. We argue that $\alpha$ is a new…
A cohomology class u of a topological space X is atoroidal if its pullback to the torus vanishes for every map from a torus to X. Furthermore, X is atoroidally symplectic if there is an atoroidal cohomology class $u\in H^2(X;F)$ such that…
Revised version: some minor errors and typos fixed; exposition watered. Abstract: To a trajectory of a billiard in parallelogram we assign its symbolic trajectory - the sequence of numbers of coordinate plane, to which the faces met by the…
In this paper we study the geometry of metric spheres in the curve complex of a surface, with the goal of determining the "average" distance between points on a given sphere. Averaging is not technically possible because metric spheres in…
We study the set of all closed oriented smooth 4-manifolds experimentally, according to a suitable complexity defined using Turaev's shadows. This complexity roughly measures how complicated the 2-skeleton of the 4-manifold is. We…
Given a set $\Sigma$ of spheres in $\mathbb{E}^d$, with $d\ge{}3$ and $d$ odd, having a fixed number of $m$ distinct radii $\rho_1,\rho_2,...,\rho_m$, we show that the worst-case combinatorial complexity of the convex hull $CH_d(\Sigma)$ of…
We study the topology of the link $M^{\mathrm{trop}}_{g,n}[1]$ of the tropical moduli spaces of curves when g=2. Tropical moduli spaces can be identified with boundary complexes for $\mathcal{M}_{g,n}$, as shown by…
We survey results on the topological complexity of classical configuration spaces of distinct ordered points in orientable surfaces and related spaces, including certain orbit configuration spaces and Eilenberg-Mac Lane spaces associated to…
It is known that every point on L\'evy's Dragon Curve admits a natural representation as a complex power series. We introduce a directed graph $\mathcal{G}_1$ which characterizes this representation. In this paper, we study the translation…
A combinatorial tiling of the sphere is naturally given by an embedded graph. We study the case that each tile has exactly five edges, with the ultimate goal of classifying combinatorial tilings of the sphere by geometrically congruent…
Given any finite subset X of the sphere S^n, n>1, which includes no pairs of antipodal points, we explicitly construct smoothly immersed closed orientable hypersurfaces in Euclidean space R^{n+1} whose Gauss map misses X. In particular,…
We prove that the maximal number of directed edges in a vertex-critical strongly connected simple digraph on n vertices is n(n-1)/2 - n +4.
The notion of parametrized topological complexity, introduced by Cohen, Farber and Weinberger, is extended to fibrewise spaces which are not necessarily Hurewicz fibrations. After exploring some formal properties of this extension we also…
For a given spectral curve, we construct a family of symplectic dual spectral curves for which we prove an explicit formula expressing the $n$-point functions produced by the topological recursion on these curves via the $n$-point functions…
We prove that any Riemannian two-sphere with area at most 1 can be continuously mapped onto a tree in a such a way that the topology of fibers is controlled and their length is less than 7.6. This result improves previous estimates and…
In this paper, the theory of functions of one complex variable is explored to study linearly full unramified holomorphic two-spheres with constant curvature in $G(2,n)$ satisfying that the generated harmonic sequence degenerates at position…
It is known that the $3$-sphere has at most $2^{O(n^2 \log n)}$ combinatorially distinct triangulations with $n$ vertices. Here we construct at least $2^{\Omega(n^2)}$ such triangulations.
This article belongs to a subject, Directed Algebraic Topology, whose general aim is including non-reversible processes in the range of topology and algebraic topology. Here, as a further step, we also want to cover "critical processes",…
We prove that for every $n$-vertex graph $G$, the extension complexity of the correlation polytope of $G$ is $2^{O(\mathrm{tw}(G) + \log n)}$, where $\mathrm{tw}(G)$ is the treewidth of $G$. Our main result is that this bound is tight for…
We study Farber's topological complexity for monotone symplectic manifolds. More precisely, we estimate the topological complexity of 4-dimensional spherically monotone manifolds whose Kodaira dimension is not $-\infty$.