graph-theory
I'm looking for a book with the description of basic types of graphs, terminology used in this field of Mathematics and main theorems. All in all, a good book to start with to be able to understand other more complicated works.
Geomagnetic field forecasting is critical for mitigating space weather hazards, yet single-station prediction remains a challenge due to the complex, non-linear coupling of vector components. In this work, we propose a Graph Neural Network (GNN) architecture enhanced with Temporal Convolutional Networks (TCN) to forecast the H, D, and Z components. By modeling the observatory’s sensors as nodes i…
_Zenodo_. 2026The directed Ihara (Bowen-Lanford) zeta function of the four-gon quiver Q, the four-vertex six-arrow strongly connected quiver with adjacency spectrum determined by det(I − uA) = 1 − u² − u³ − u⁴, is computed explicitly. The zeta function is ζ_Q(u) = 1/[(1 + u)(1 − u − u³)]. Its four poles occupy three distinct moduli {0.6823, 1, 1.2107}, which do not lie on a common circle. Three s…
_Zenodo_. 2026Two partitions fixed independently agree, including on which cell is empty: the five non-empty error types plus one impossible sixth of *The Five Classes of Error* (Stewart, 2026z), and the partition of the six arrows of the four-gon quiver Q by their role in its path algebra kQ (*The Path Algebra of the Endomorphism*, Stewart, 2026f). The five types are five zero products, and the …

If I have two finite sets $V$ and $C$ and a set of conditions of the form $$f(u) \neq f(v)$$ for some $u$, $v \in V$, and I want to find functions $f: V \to C$ that satisfy all these condition, then ...
NB: This isn’t about crypto. I don’t care about crypto. Chris messaged me the other week asking if I wanted to implement zero-knowledge proofs. I initially was not interested, but then he said: What if I told you there’s a version of them that has nothing to do with cryptocurrencies? What if I told you it involves graph theory? What if I told you there’s a 30 line implementation? Now that was i…

Let me begin with labeled chip-firing on an infinite directed binary tree, where the root is at the top. Place 2n chips, labeled from 0 to 2n − 1, at the root. A move consists of choosing any two chips at the same vertex and firing them: the smaller chip goes to the left child, […]

research.ioSign up to keep scrolling
Create your feed subscriptions, save articles, keep scrolling.


