Related papers: Calculating Higher Digraph Homotopy Groups

In this paper tackle the problem of computing the ranks of certain eulerian magnitude homology groups of a graph G. First, we analyze the computational cost of our problem and prove that it is #W[1]-complete. Then we develop the first…

Using contact homology, we reobtain some recent results of Geiges and Gonzalo about the fundamental group of the space of contact structures on some 3-manifolds. We show that our techniques can be used to study higher dimensional contact…

Let M be a topological manifold modelled on topological vector spaces, which is the union of an ascending sequence of such manifolds M_n. We formulate a mild condition ensuring that the k-th homotopy group of M is the direct limit of the…

Let V be a representation space of a finite group G. We determine the group structure of the first homology of the equivariant diffeomorphism group of V. Then we can apply it to the calculation of the first homology of the corresponding…

Hypergraphs are useful mathematical models for describing complex relationships among members of a structured graph, while hyperdigraphs serve as a generalization that can encode asymmetric relationships in the data. However, obtaining…

We prove that for many degrees in a stable range the homotopy groups of the moduli space of metrics of positive scalar curvature on S^n and on other manifolds are non-trivial. This is achieved by further developing and then applying a…

A 1-truncated compact Lie group is any extension of a finite group by a torus. In this note we compute the homotopy types of $Map_*(BG,BH)$, $Map(BG,BH)$, and $Map(EG, B_GH)^G$ for compact Lie groups $G$ and $H$ with $H$ 1-truncated,…

We study the class of all algebras that are isotopic to a Hurwitz algebra. Isomorphism classes of such algebras are shown to correspond to orbits of a certain group action. A complete, geometrically intuitive description of the category of…

We characterize the Hurewicz cofibrations between finite topological spaces, that is, the continuous functions between finite topological spaces that have the homotopy extension property with respect to all topological spaces. In…

A general overview of the phenomenon of automatic continuity of homomorphisms between Polish groups is given. In particular, we study variants and improvements of the closed graph theorem, applying these to the problem of continuity of…

We present a new algorithm for computing the first discrete homology group of a graph. By testing the algorithm on different data sets of random graphs, we find that it significantly outperforms other known algorithms.

We study the homotopy groups of complements to reducible divisors on non-singular projective varieties with ample components and isolated non normal crossings. We prove a vanishing theorem generalizing conditions for commutativity of the…

Counting homomorphisms between cyclic groups is a common exercise in a first course in abstract algebra. A similar problem, accessible at the same level, is to count the number of group homomorphisms from a dihedral group of order $2m$ into…

The concept of homotopic distance and its higher analog are introduced in [6]. In this paper we introduce some important properties of higher homotopic distance, investigate the conditions under which $\cat$, $\secat$ and higher dimensional…

Building on recent work of Robertson and Steger, we associate a C*-algebra to a combinatorial object which may be thought of as a higher rank graph. This C*-algebra is shown to be isomorphic to that of the associated path groupoid.…

Groups $\Pi_k(X;\sigma)$ of "flagged homotopies" are introduced of which the usual (abelian for $k>1$) homotopy groups $\pi_k(X;p)$ is the limit case for flags $\sigma$ contracted to a point $p$. Calculus of exterior forms with values in…

The intended model of the homotopy type theories used in Univalent Foundations is the infinity-category of homotopy types, also known as infinity-groupoids. The problem of higher structures is that of constructing the homotopy types needed…

In earlier papers, we showed a decomposition of 2-diregular digraphs (2-dds) and used it to provide some sufficient conditions for these graphs to be non-Hamiltonian; we also showed a close connection between the permanent and determinant…

We provide lower bounds on the connectivity of the independence complexes of hypergraphs. Additionally, we compute the homotopy types of the independence complexes of $d$-uniform properly-connected triangulated hypergraphs.

In this paper, we introduce relative LS category of a map and study some of its properties. Then we introduce `higher topological complexity' of a map, a homotopy invariant. We give a cohomological lower bound and compare it with previously…