Related papers: The Dynamic Complexity of Acyclic Hypergraph Homom…

A common approach for analyzing hypergraphs is to consider the projected adjacency or Laplacian matrices for each order of interactions (e.g., dyadic, triadic, etc.). However, this method can lose information about the hypergraph structure…

A firm-worker hypergraph consists of edges in which each edge joins a firm and its possible employees. We show that a stable matching exists in both many-to-one matching with transferable utilities and discrete many-to-one matching when the…

We find the Holographic Renormalization Group equations for the holographic duals of generic gravity theories coupled to form fields and spin-1/2 fermions. Using Hamilton-Jacobi theory we discuss the structure of Ward identities, anomalies,…

We prove that any diffeomorphism of a compact manifold can be C^1-approximated by a diffeomorphism which exhibits a homoclinic bifurcation (a homoclinic tangency or a heterodimensional cycle) or by a diffeomorphism which is partially…

In recent work by Johnson et al. (2022), a framework was described for the study of graph problems over classes specified by omitting each of a finite set of graphs as subgraphs. If a problem falls into the framework then its computational…

We show that every sheaf on the site of smooth manifolds with values in a stable (infinity,1)-category (like spectra or chain complexes) gives rise to a differential cohomology diagram and a homotopy formula, which are common features of…

This article investigates the isomorphism problem for graphs derived from the four standard graph products: Cartesian, Kronecker (direct), strong, and lexicographic product. We provide a complete characterization of all simple connected…

Does the interaction graph of a finite dynamical system can force this system to have a "complex" dynamics ? In other words, given a finite interval of integers $A$, which are the signed digraphs $G$ such that every finite dynamical system…

A homomorphism from a graph G to a graph H is a vertex mapping f from the vertex set of G to the vertex set of H such that there is an edge between vertices f(u) and f(v) of H whenever there is an edge between vertices u and v of G. The…

It is known that a graph isomorphism testing algorithm is polynomially equivalent to a detecting of a graph non-trivial automorphism algorithm. The polynomiality of the latter algorithm, is obtained by consideration of symmetry properties…

We consider partially hyperbolic diffeomorphisms on compact manifolds where the unstable and stable foliations stably carry some unique non-trivial homologies. We prove the following two results: if the center foliation is one dimensional,…

We generalise a fundamental graph-theoretical fact, stating that every element of the cycle space of a graph is a sum of edge-disjoint cycles, to arbitrary continua. To achieve this we replace graph cycles by topological circles, and…

We provide a mathematically and conceptually robust notion of quantum superpositions of graphs. We argue that, crucially, quantum superpositions of graphs require node names for their correct alignment, which we demonstrate through a…

A graph homomorphism between two graphs is a map from the vertex set of one graph to the vertex set of the other graph, that maps edges to edges. In this note we study the range of a uniformly chosen homomorphism from a graph G to the…

The need for large amounts of training data in modern machine learning is one of the biggest challenges of the field. Compared to the brain, current artificial algorithms are much less capable of learning invariance transformations and…

We consider an ``integral'' extension of the classical notion of affine connection providing a correspondence between paths in the manifold and diffeomorphisms of the manifold. These path-diffeomorphisms are a generalization of parallel…

The notion of homomorphism indistinguishability offers a combinatorial framework for characterizing equivalence relations of graphs, in particular equivalences in counting logics within finite model theory. That is, for certain graph…

The Subgraph Isomorphism problem asks, given a host graph G on n vertices and a pattern graph P on k vertices, whether G contains a subgraph isomorphic to P. The restriction of this problem to planar graphs has often been considered. After…

The diffeomorphism symmetry of general relativity leads in the canonical formulation to constraints, which encode the dynamics of the theory. These constraints satisfy a complicated algebra, known as Dirac's hypersurface deformation…

A large driver of the complexity of graph learning is the interplay between structure and features. When analyzing the expressivity of graph neural networks, however, existing approaches ignore features in favor of structure, making it…