Related papers: The Nyquist theorem for cellular sheaves

Gene function prediction from microarray data is a first step toward better understanding the machinery of the cell from relatively cheap and easy-to-produce data. In this paper we investigate whether the knowledge of many metabolic…

We give a short and self-contained proof of the Decomposition Theorem for the non-small resolution of a Special Schubert variety. We also provide an explicit description of the perverse cohomology sheaves. As a by-product of our approach,…

Given scheme-theoretic equations for a nonsingular subvariety, we prove that the higher cohomology groups for suitable twists of the corresponding ideal sheaf vanish. From this result, we obtain linear bounds on the multigraded…

Chain graphs combine directed and undirected graphs and their underlying mathematics combines properties of the two. This paper gives a simplified definition of chain graphs based on a hierarchical combination of Bayesian (directed) and…

This is a new and short proof of the main theorem of classical structure tree theory. Namely, we show the existence of certain automorphism-invariant tree-decompositions of graphs based on the principle of removing finitely many edges. This…

We formulate differential cohomology and Chern-Weil theory -- the theory of connections on fiber bundles and of gauge fields -- abstractly in the context of a certain class of higher toposes that we call "cohesive". Cocycles in this…

We adapt Gromov's notion of ideal-valued measures to symplectic topology, and use it for proving new results on symplectic rigidity and symplectic intersections. Furthermore, it enables us to discuss three "big fiber theorems", the…

Multiple sampling-based methods have been developed for approximating and accelerating node embedding aggregation in graph convolutional networks (GCNs) training. Among them, a layer-wise approach recursively performs importance sampling to…

The presented material is devoted to the equivalent conversion from the vertex graphs to the edge graphs. We suggest that the proved theorems solve the problem of the isomorphism of graphs, the problem of the graph's enumeration with the…

It is known that isomorphisms of graph Jacobians induce cyclic bijections on the associated graphs. We characterize when such cyclic bijections can be strengthened to graph isomorphisms, in terms of an easily computed divisor. The result…

In this paper we develop a general representation theory for mv-algebras. We furnish the appropriate categorical background to study this problem. Our guide line is the theory of classifying topoi of coherent extensions of universal algebra…

The paper extends Birkhoff's theorem on doubly stochastic matrices to some countable families of discrete probability spaces with nonempty intersections. We join every two elements lying in the same probability space by an edge and…

The conditions for fully supersymmetric backgrounds of general N=2 locally supersymmetric theories are derived based on the off-shell superconformal multiplet calculus. This enables the derivation of a non-renormalization theorem for a…

Learning properties of large graphs from samples has been an important problem in statistical network analysis since the early work of Goodman \cite{Goodman1949} and Frank \cite{Frank1978}. We revisit a problem formulated by Frank…

The goal of this paper is to sketch a broader outline of the mathematical structures present in the Nonlinear Maxwell Theory in continuation of work presented in my previous articles. In particular, I display new types of both dynamic and…

The Pathwidth Theorem states that if a class of graphs has unbounded pathwidth, then it contains all trees as graph minors. We prove a similar result for dense graphs. More precisely, we give a finite family of tree-like patterns and prove…

Quantum graphs model processes in complex systems represented as spatial networks in various fields of natural science and technology. An example is the oscillations of elastic string networks, the nodes of which, besides the continuity…

We expand the toolbox of (co)homological methods in computational topology by applying the concept of persistence to sheaf cohomology. Since sheaves (of modules) combine topological information with algebraic information, they allow for…

The aim of this paper is to connect two important and apparently unrelated theories: motivic homotopy theory and ramification theory. We construct motivic homotopy categories over a qcqs base scheme $S$, in which cohomology theories with…

The Hahn-Banach theorem is an extension theorem for linear functionals which preserves certain properties. Specifically, if a linear functional is defined on a subspace of a real vector space which is dominated by a sublinear functional on…