Related papers: Local-global intersection homology
Hypergraphs are mathematical models for many problems in data sciences. In recent decades, the topological properties of hypergraphs have been studied and various kinds of (co)homologies have been constructed (cf. [3, 4, 12]). In this…
Flag codes that are orbits of a cyclic subgroup of the general linear group acting on flags of a vector space over a finite field, are called cyclic orbit flag codes. In this paper we present a new contribution to the study of such codes…
We consider sets and maps defined over an o-minimal structure over the reals, such as real semi-algebraic or subanalytic sets. A {\em monotone map} is a multi-dimensional generalization of a usual univariate monotone function, while the…
We describe a simple homological test for obstructions to graph colorings. The main idea is to combine the framework of Hom-complexes with the following general fact: an arbitrary Z_2-space has nontrivial homology with Z_2-coefficients in…
We consider local-global principles for rational points on varieties, in particular torsors, over one-variable function fields over complete discretely valued fields. There are several notions of such principles, arising either from the…
Random intersection graphs containing an underlying community structure are a popular choice for modelling real-world networks. Given the group memberships, the classical random intersection graph is obtained by connecting individuals when…
We investigate higher topological cyclic homology as an approach to studying chromatic phenomena in homotopy theory. Higher topological cyclic homology is constructed from the fixed points of a version of topological Hochschild homology…
Pseudocycles are geometric representatives for integral homology classes on smooth manifolds that have proved useful in particular for defining gauge-theoretic invariants. The Borel-Moore homology is often a more natural object to work with…
We define special cycles on arithmetic models of twisted Hilbert-Blumenthal surfaces at primes of good reduction. These are arithmetic versions of these cycles. In particular, we characterize the non-degenerate intersections and partially…
We study the homology of simplicial and cubical sets with symmetries. These are simplicial and cubical sets with additional maps expressing the symmetries of simplices and cubes. We consider the chain complex computing the homology groups…
Centrality describes the importance of nodes in a graph and is modeled by various measures. Its global analogue, called centralization, is a general formula for calculating a graph-level centrality score based on the node-level centrality…
In this paper we study the relationship between the homology and homotopy of a space at infinity and at its boundary. Firstly, we prove that if a locally connected, connected, $\delta$-hyperbolic space that is acted upon geometrically by a…
Polymer networks invariably possess topological inhomogeneities in the form of loops and dangling ends. The macroscopic properties of such materials are directly dependent on the local cyclic topology around nodes and chains. Here, a new…
A standard model in network synchronised distributed computing is the LOCAL model. In this model, the processors work in rounds and, in the classic setting, they know the number of vertices of the network, $n$. Using $n$, they can compute…
We prove that the topological cycle space C(G) of a locally finite graph G is generated by its geodetic topological circles. We further show that, although the finite cycles of G generate C(G), its finite geodetic cycles need not generate…
Hexagonal circle patterns with constant intersection angles mimicking holomorphic maps z^c and log(z) are studied. It is shown that the corresponding circle patterns are immersed and described by special separatrix solutions of discrete…
Generalized splines are a simultaneous generalization of GKM theory -- which studies equivariant cohomology -- and classical splines, which provide piecewise approximations of functions. Generalized splines can also be understood via…
As complex networks find applications in a growing range of disciplines, the diversity of naturally occurring and model networks being studied is exploding. The adoption of a well-developed collection of network taxonomies is a natural…
A classic problem in enumerative combinatorics is to count the number of derangements, that is, permutations with no fixed point. Inspired by a recent generalization to facet derangements of the hypercube by Gordon and McMahon, we…
One of the most fundamental open problems in Incidence Geometry, posed by Tits in the 1960s, asks for the existence of so-called "locally finite generalized polygons" | that is, generalized polygons with "mixed parameters" (one being finite…