Related papers: Complexity of atriodic continua

We introduce the notion of a combinatorial $n$-od cover, for $n \geq 3$, which is a tool that may be used to show that certain continua embedded in the plane are not simple $n$-od-like. Using this tool, we generalize a classic example of…

We consider the homeomorphic classification of finite-dimensional continua as well as several related equivalence relations. We show that, when $n \geq 2$, the classification problem of $n$-dimensional continua is strictly more complex than…

Let $N$ be a compact, connected, nonorientable surface of genus $g$ with $n$ boundary components, and $\mathcal{C}(N)$ be the complex of curves of $N$. Suppose that $g + n \leq 3$ or $g + n \geq 5$. If $\lambda : \mathcal{C}(N) \rightarrow…

Let $d\geq 3$ be a fixed integer and $A$ be the adjacency matrix of a random $d$-regular directed or undirected graph on $n$ vertices. We show there exist constants $\mathfrak d>0$, \begin{align*} {\mathbb P}(\text{$A$ is singular in…

For a topologically complete space $X$ and a family of closed covers $\mathcal A$ of $X$ satisfying a "local refinement condition" and a "completeness condition," we give a construction of an inverse system $\mathbf{ N}_{\mathcal A}$ of…

Let $N$ be a compact, connected, nonorientable surface of genus $g$ with $n$ boundary components. Let $\lambda$ be a simplicial map of the complex of curves, $\mathcal{C}(N)$, on $N$ which satisfies the following: $[a]$ and $[b]$ are…

We are dealing with the complexity of the homeomorphism equivalence relation on some classes of metrizable compacta from the viewpoint of invariant descriptive set theory. We prove that the homeomorphism equivalence relation of absolute…

Let $N$ be a compact, connected, nonorientable surface of genus $g$ with $n$ boundary components with $g \geq 5$, $n \geq 0$. Let $\mathcal{T}(N)$ be the two-sided curve complex of $N$. If $\lambda :\mathcal{T}(N) \rightarrow…

A graph is near-planar if it can be obtained from a planar graph by adding an edge. We show the surprising fact that it is NP-hard to compute the crossing number of near-planar graphs. A graph is 1-planar if it has a drawing where every…

In this paper, we provide an $O(n \mathrm{polylog} n)$ bound on the expected complexity of the randomly weighted Voronoi diagram of a set of $n$ sites in the plane, where the sites can be either points, interior-disjoint convex sets, or…

A space is `n-arc connected' (n-ac) if any family of no more than n-points are contained in an arc. For graphs the following are equivalent: (i) 7-ac, (ii) n-ac for all n, (iii) continuous injective image of a closed sub-interval of the…

We prove that each superinjective simplicial map of the complex of curves of a compact, connected, nonorientable surface is induced by a homeomorphism of the surface, if $(g, n) \in \{(1, 0), (1, 1), (2, 0), (2, 1), (3, 0)\}$ or $g + n \geq…

It is proved that whenever two aperiodic repetitive tilings with finite local complexity have homeomorphic tiling spaces, their associated complexity functions are asymptotically equivalent in a certain sense (which implies, if the…

In this paper we show that a simplicial complex can be determined uniquely up to isomorphism by its barycentric subdivision or comparability graph. At the end, it is summarized several algebraic, combinatorial and topological invariants of…

We examine ordered graphs, defined as graphs with linearly ordered vertices, from the perspective of homomorphisms (and colorings) and their complexities. We demonstrate the corresponding computational and parameterized complexities, along…

We introduce (weak) oddomorphisms of graphs which are homomorphisms with additional constraints based on parity. These maps turn out to have interesting properties (e.g., they preserve planarity), particularly in relation to homomorphism…

Our first main result is a uniform bound, in every dimension $k \in \mathbb N$, on the topological Tur\'an numbers of $k$-dimensional simplicial complexes: for each $k \in \mathbb N$, there is a $\lambda_k \ge k^{-2k^2}$ such that for any…

A graph drawing in the plane is called an almost embedding if images of any two non-adjacent simplices (i.e. vertices or edges) are disjoint. We introduce integer invariants of almost embeddings: winding number, cyclic and triodic Wu…

We consider an arrangement $\A$ of $n$ hyperplanes in $\R^d$ and the zone $\Z$ in $\A$ of the boundary of an arbitrary convex set in $\R^d$ in such an arrangement. We show that, whereas the combinatorial complexity of $\Z$ is known only to…

To any finite simplicial complex X, we associate a natural filtration starting from Chari and Joswig's discrete Morse complex and abutting to the matching complex of X. This construction leads to the definition of several homology theories,…