Related papers: Additive posets, CW-complexes, and graphs
Graphs are a basic tool for the representation of modern data. The richness of the topological information contained in a graph goes far beyond its mere interpretation as a one-dimensional simplicial complex. We show how topological…
We study the topology of the configuration spaces $C(n,w)$ of $n$ hard disks of unit diameter in an infinite strip of width $w$. We describe ranges of parameter or "regimes", where homology $H_j [C(n,w)]$ behaves in qualitatively different…
This is a survey of some recent developments in the study of complements of line arrangements in the complex plane. We investigate the fundamental groups and finite covers of those complements, focusing on homological and enumerative…
We construct maps on hat Heegaard Floer homology for cobordisms decorated with graphs. The graph TQFT allows for cobordisms with disconnected ends. Our construction uses Juh\'{a}sz's sutured Floer TQFT. We compute the maps for several…
We have observations concerning the set theoretic strength of the following combinatorial statements without the axiom of choice. 1. If in a partially ordered set, all chains are finite and all antichains are countable, then the set is…
We investigate the automorphism group of the substructure ordering of finite directed graphs. The second author conjectured that it is isomorphic to the 768-element group $(\mathbb{Z}_2^4 \times S_4)\rtimes_{\alpha} \mathbb{Z}_2$. Though…
We introduce a new combinatorial invariant, which we call crosscut poset, that is finer than the crosscut complex. We exhibit many applications of the crosscut poset which include a generalization of Bj\"orner's crosscut theorem and two…
We show that the parametrised topological complexity of Cohen, Farber and Weinberger gives an invariant of group epimorphisms. We extend various bounds for the topological complexity of groups to obtain bounds for the parametrised…
The `Weyl symmetric functions' studied here naturally generalize classical symmetric (polynomial) functions, and `Weyl bialternants,' sometimes also called Weyl characters, analogize the Schur functions. For this generalization, the…
A type of directed multigraph called a W-digraph is introduced to model the structure of certain representations of Hecke algebras, including those constructed by Lusztig and Vogan from involutions in a Weyl group. Building on results of…
Persistent homology, a technique from computational topology, has recently shown strong empirical performance in the context of graph classification. Being able to capture long range graph properties via higher-order topological features,…
A discussion given to the question of extending Khovanov homology from links to embedded graphs, by using the Kauffman topological invariant of embedded graphs by associating family of links and knots to a such graph by using some local…
We construct a cobordism group for embedded graphs in two different ways, first by using sequences of two basic operations, called "fusion" and "fission", which in terms of cobordisms correspond to the basic cobordisms obtained by attaching…
This article uses basic homological methods for evaluating examples of compactly supported cohomology groups of line bundles over projective curve.
C-cross topologies are introduced. Modifcations of the Kuratowski-Ulam Theorem are considered. Cardinal invariants add, cof, cov and non with respect to meager or nowhere dense subsets are compared. Remarks on invariants cof(nwdY) are…
For affine symmetric groups we construct finite $W$-graphs corresponding to two-row shapes, and prove their uniqueness. This gives the first non-trivial family of examples of finite $W$-graphs in an affine type. We compare our construction…
Recently, Asao and Izumihara introduced CW-complexes whose homology groups are isomorphic to direct summands of the graph magnitude homology group. In this paper, we study the homotopy type of the CW-complexes in connection with the…
In this paper, various kinds of invariants of directed graphs are summarized. In the first topic, the invariant w(G) for a directed graph G is introduced, which is primarily defined by S. Chen and X.M. Chen to solve a problem of weak…
A poset can be regarded as a category in which there is at most one morphism between objects, and such that at most one of Hom(c,c') and Hom(c',c) is nonempty for c not equal to c'. If we keep in place the latter axiom but allow for more…
We introduce iposets---posets with interfaces---equipped with a novel gluing composition along interfaces and the standard parallel composition. We study their basic algebraic properties as well as the hierarchy of gluing-parallel posets…