Related papers: Invariant Graphs for Chaotically Driven Maps
Let $G=(V,\overrightarrow{E})$ be a graph with some prescribed orientation for the edges and $\Gamma$ be an arbitrary group. If $f\in \mathrm{Inv}(\Gamma)$ be an anti-involution then the skew gain graph $\Phi_f=(G,\Gamma,\varphi,f)$ is such…
Directed graphs are widely used in modelling of nonsymmetric relations in various sciences and engineering disciplines. We discuss invariants of strongly connected directed graphs - minimal number of vertices or edges necessary to remove to…
We consider a class of skew product maps of interval diffeomorphisms over the doubling map. The interval maps fix the end points of the interval. It is assumed that the system has zero fiber Lyapunov exponent at one endpoint and zero or…
We provide upper bounds on the perturbation of invariant subspaces of normal matrices measured using a metric on the space of vector subspaces of $\mathbb{C}^n$ in terms of the spectrum of both the unperturbed \& perturbed matrices, as well…
This paper introduces a class of polynomial maps in Euclidean spaces, investigates the conditions under which there exist Smale horseshoes and uniformly hyperbolic invariant sets, studies the chaotic dynamical behavior and strange…
We examine the relationships between the differential invariants of objects and of their images under a surjective map. We analyze both the case when the underlying transformation group is projectable and hence induces an action on the…
We compare the invariants of flat vector bundles defined by Atiyah et al. and Jones et al. and prove that, up to weak homotopy, they induce the same map, denoted by $e$, from the $0$-connective algebraic $K$-theory space of the complex…
Flip graphs of non-crossing configurations in the plane are widely studied objects, e.g., flip graph of triangulations, spanning trees, Hamiltonian cycles, and perfect matchings. Typically, it is an easy exercise to prove connectivity of a…
In this paper, we study the graph classification problem from the graph homomorphism perspective. We consider the homomorphisms from $F$ to $G$, where $G$ is a graph of interest (e.g. molecules or social networks) and $F$ belongs to some…
Feynman diagrams in $\phi^4$ theory have as their underlying structure 4-regular graphs. In particular, any 4-point $\phi^4$ graph can be uniquely derived from a 4-regular graph by deleting a vertex. The Feynman period is a simplified…
We investigate dynamical systems obtained by coupling two maps, one of which is chaotic and is exemplified by an Anosov diffeomorphism, and the other is of gradient type and is exemplified by a N-pole-to-S-pole map of the circle. Leveraging…
Similar to static systems, periodically driven systems can host a variety of topologically non-trivial phases. Unlike the case of static Hamiltonians, the topological indices of bulk Floquet bands may fail to describe the presence and…
We describe structural properties of strongly connected finite directed graphs, that are invariants of the topological conjugacy of their Markov-Dyck shifts. For strongly connected finite directed graphs with these properties topological…
Shift-invariant spaces (SISs) on the real line provide a natural framework for representing, analyzing and processing signals with inherent shift-invariant structure. In this paper, we extend this framework to the finite undirected graph…
The ring of graph invariants is spanned by the basic graph invariants which calculate the number of subgraphs isomorphic to a given graph in other graphs. These subgraphs counting invariants are not algebraically independent. In our view…
Let $G=(V,E)$ be a simple and connected graph. A $h$-order invariant of $G$ based on the path sequence is defined from a set of real numbers ${f(x_{0},x_{1},\cdots,x_{h})}$ as $^{h}I_f(G)=\sum\limits_{v_{0}v_{1}v_{2}\cdots…
The classical fiber product in algebraic geometry provides a powerful tool for studying loci where two morphisms to a base scheme, $\phi: X \to S$ and $\psi: Y \to S$, coincide exactly. This condition of strict equality, however, is…
In this paper, we introduce a magneto-spectral invariant for finite graphs. This invariant vanishes on trees and is maximized by complete graphs. We compute this invariant for cycles, complete graphs, wheel graphs, hypercubes, complete…
We study the existence and regularity of invariant graphs for bundle maps (or bundle correspondences with generating bundle maps motivated by ill-posed differential equations) having some relative partial hyperbolicity on non-trivial and…
Progress on graph foundation models is hindered by benchmark practices that conflate the contributions of node features and graph structure, making it hard to tell whether a model actually learns from connectivity, or whether it even needs…