Related papers: The Nyquist theorem for cellular sheaves

We prove a general theorem that gives a non trivial relation in the group of derived autoequivalences of a variety (or stack) X, under the assumption that there exists a suitable functor from the derived category of another variety Y…

Sheaf cohomology or, more generally, higher direct images of coherent sheaves along proper morphisms are central to modern algebraic geometry. However, the computation of these objects is a non-trivial and expensive task which easily…

We prove the conjectural relation between the Stokes matrix for the quantum cohomology and an exceptional collection generating the derived category of coherent sheaves in the case of smooth cubic surfaces. The proof is based on a toric…

This paper introduces Manhattan sampling in two and higher dimensions, and proves sampling theorems. In two dimensions, Manhattan sampling, which takes samples densely along a Manhattan grid of lines, can be viewed as sampling on the union…

We prove the Poisson geometric version of the Local Reeb Stability (from foliation theory) and of the Slice Theorem (from equivariant geometry). The result is also a generalization of Conn's linearization theorem from one-point leaves to…

We prove invariance results for the cohomology groups of ideal sheaves of simple normal crossing divisors under (a restricted class of) birational morphisms of pairs in arbitrary characteristic, assuming a conjecture regarding the existence…

We prove the Strengthened Hanna Neumann Conjecture, in its common graph theoretic formulation. Our original approach to this conjecture used cohomology of sheaves on graphs, although here we give a short combinatorial proof that we found in…

Resampling is an operation costly in calculation time and accuracy. It regularizes irregular sampling, replacing N data by N periodic estimations. This stage can be suppressed, using formulas built with incoming data and completed by…

In this paper, we develop a general approach to proving global and local uniform limit theorems for the Horvitz-Thompson empirical process arising from complex sampling designs. Global theorems such as Glivenko-Cantelli and Donsker…

A synopsis is offered of the properties of discrete and integer-valued, hence "natural", cellular automata (CA). A particular class comprises the "Hamiltonian CA" with discrete updating rules that resemble Hamilton's equations. The…

In this paper, we obtain two extension theorems for cohomology classes and holomorphic sections defined on analytic subvarieties, which are defined as the supports of the quotient sheaves of multiplier ideal sheaves of…

We confirm the quasi-projective case of Saito's conjecture, namely that the cohomological characteristic classes defined by Abbes and Saito can be computed in terms of the characteristic cycles. We construct a cohomological characteristic…

We use the geometry of the secant variety to an embedded smooth curve to prove some vanishing and regularity theorems for powers of ideal sheaves.

We study the problem of computing the homology of the configuration spaces of a finite cell complex $X$. We proceed by viewing $X$, together with its subdivisions, as a subdivisional space--a kind of diagram object in a category of cell…

Specify a randomized algorithm that, given a very large graph or network, extracts a random subgraph. What can we learn about the input graph from a single subsample? We derive laws of large numbers for the sampler output, by relating…

Hidden variable graphical models can sometimes imply constraints on the observable distribution that are more complex than simple conditional independence relations. These observable constraints can falsify assumptions of the model that…

We develop a discrete gauge-theoretic framework for superposition in large language models (LLMs) that replaces the single-global-dictionary premise with a sheaf-theoretic atlas of local semantic charts. Contexts are clustered into a…

Courcelle's Theorem is an important result in graph theory, proving the existence of linear-time algorithms for many decision problems on graphs whose tree-width is bounded by a constant. The purpose of this text is twofold: to provide an…

We study the cohomology of the hairy graph complexes which compute the rational homotopy of embedding spaces, generalizing the Vassiliev invariants of knot theory. We provide spectral sequences converging to zero whose first pages contain…

Graphs are used to represent and analyze data in domains as diverse as physics, biology, chemistry, planetary science, and the social sciences. Across domains, random graph models relate generative processes to expected graph properties,…