Related papers: Combinatorial Conditions for Directed Collapsing
Learning generalizable self-supervised graph representations for downstream tasks is challenging. To this end, Contrastive Learning (CL) has emerged as a leading approach. The embeddings of CL are arranged on a hypersphere where similarity…
Take finitely many topological spaces and for each pair of these spaces choose a pair of corresponding closed subspaces that are identified by a homeomorpism. We note that this gluing procedure does not guarantee that the building pieces,…
Combinatorial topology is used in distributed computing to model concurrency and asynchrony. The basic structure in combinatorial topology is the simplicial complex, a collection of subsets called simplices of a set of vertices, closed…
We suggest an equal-time n-point correlation function for systems in the directed percolation universality class which is well defined in all phases and independent of initial conditions. It is defined as the probability that all points are…
Methods which aim at universal applicability must be able to describe both weak and strong electronic correlation with equal facility. Such methods are in short supply. The combination of symmetry projection for strong correlation and…
This paper continues the research of the author on the homology of cubical and semi-cubical sets with coefficients in systems of objects. The main result is the theorem that the homology of cubical sets with coefficients in contravariant…
We consider two disjoint sets of points. If at least one of the sets can be embedded into an Euclidean space, then we provide sufficient conditions for the two sets to be jointly embedded in one Euclidean space. In this joint Euclidean…
We consider arrangements of axis-aligned rectangles in the plane. A geometric arrangement specifies the coordinates of all rectangles, while a combinatorial arrangement specifies only the respective intersection type in which each pair of…
Consider the Euclidean space $\mathbb{R}^3$ endowed with a canonical semi-symmetric non-metric connection determined by a vector field $\mathsf{C}\in\mathfrak{X}(\mathbb{R}^3)$. We study surfaces when the sectional curvature with respect to…
Bidirected graphs are a common generalisation of directed graphs where arcs can also be incoming to both their incident nodes, or outgoing from both their incident nodes. Such arcs allow a walk to change direction. Some algorithms can…
In this article we provide a combinatorial sufficient (and conjecturally, necessary) condition (called $\alpha$-symmetry) for the mating of two postcritically finite polynomials in $\mathcal{S}_1$ to be obstructed. To do this, we study the…
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",…
Extremal length is a conformal invariant that transfers naturally to the discrete setting, giving square tilings as a natural combinatorial analog of conformal mappings. Recent work by S. Hersonsky has explored generalizing these ideas to…
In this short note, we present a persistence module approach to directed cohomology, dual to the directed homology introduced by the author in a previous article. We lay out the first properties of directed cohomology and in particular of…
We give several new criteria to judge whether a simple convex polytope in a Euclidean space is combinatorially equivalent to a product of simplices. These criteria are mixtures of combinatorial, geometrical and topological conditions that…
If G is a countable discrete group acting linearly on a finite-dimensional vector space over any topological field, then the groups of coboundaries are closed for the product topology in all degrees, and hence the cohomology is reduced in…
Graph matching consists of aligning the vertices of two unlabeled graphs in order to maximize the shared structure across networks; when the graphs are unipartite, this is commonly formulated as minimizing their edge disagreements. In this…
Compatibility conditions are investigated for planar network structures consisting of nodes and connecting bars; these conditions restrict the elongations of bars and are analogous to the compatibility conditions of deformation in continuum…
Using computer simulations, we study the dynamic arrest in a schematic model of colloid-polymer mixtures combining short-ranged attractions with long-ranged repulsions. The arrested gel is a dilute rigid network of colloidal particles…
The arrangement of network nodes in hyperbolic spaces has become a widely studied problem, motivated by numerous results suggesting the existence of hidden metric spaces behind the structure of complex networks. Although several methods…