Related papers: Pursuing Stacks
We describe how a systematic use the deep methods from $\ell$-adic cohomology pioneered by Grothendieck and Deligne and further developed by Katz, Laumon allow to make progress on various classical questions from analytic number theory.…
The objective of this work is to reconsider the schematization problem of [6], with a particular focus on the global case over Z. For this, we prove the conjecture [Conj. 2.3.6][15] which gives a formula for the homotopy groups of the…
Sentence order prediction is the task of finding the correct order of sentences in a randomly ordered document. Correctly ordering the sentences requires an understanding of coherence with respect to the chronological sequence of events…
This historical introduction is in two parts. The first is reprinted with permission from ``A century of mathematics in America, Part II,'' Hist. Math., 2, Amer. Math. Soc., 1989, pp.543-585. Virtually no change has been made to the…
This paper is motivated by questions such as P vs. NP and other questions in Boolean complexity theory. We describe an approach to attacking such questions with cohomology, and we show that using Grothendieck topologies and other ideas from…
Effective descent morphisms, originally defined in Grothendieck descent theory, form a class of special morphisms within a category. Essentially, an effective descent morphism enables bundles over its codomain to be fully described as…
We take another approach to Hitchin's strategy of computing the cohomology of moduli spaces of Higgs bundles by localization with respect to the circle-action. Our computation is done in the dimensional completion of the Grothendieck ring…
The fundamental question considered in algorithms on strings is that of indexing, that is, preprocessing a given string for specific queries. By now we have a number of efficient solutions for this problem when the queries ask for an exact…
A special type of cyclic sequences named adjacency-hopping de Bruijn sequences is introduced in this paper. It is theoretically proved the existence of such sequences, and the number of such sequences is derived. These sequences guarantee…
We introduce a homotopy-theoretic interpretation of intuitionistic first-order logic based on ideas from Homotopy Type Theory. We provide a categorical formulation of this interpretation using the framework of Grothendieck fibrations. We…
A reflective subuniverse in homotopy type theory is an internal version of the notion of a localization in topology or in the theory of $\infty$-categories. Working in homotopy type theory, we give new characterizations of the following…
We introduce a stochastic geometry dynamics inspired by opinion dynamics that captures the essence of modern asymmetric social networks with leaders and followers. Points in the Euclidean space represent opinions, and the leader of an agent…
This is the first paper in a series on intrinsic Donaldson-Thomas theory, where we develop a new framework for enumerative geometry that allows the generalization of constructions and results from linear moduli stacks to general non-linear…
Chase algorithms are indispensable in the domain of knowledge base querying, which enable the extraction of implicit knowledge from a given database via applications of rules from a given ontology. Such algorithms have proved beneficial in…
Given a field $K$ and an ample (not necessarily Hausdorff) groupoid $G$, we define the concept of a line bundle over $G$ inspired by the well known concept from the theory of C*-algebras. If $E$ is such a line bundle, we construct the…
We construct the motive of an algebraic stack in the Nisnevich topology. For stacks which are Nisnevich locally quotient stacks, we give a presentation of the motive in terms of simplicial schemes. We also show that for quotient stacks the…
Given a linear category over a finite field such that the moduli space of its objects is a smooth Artin stack (and some additional conditions) we give formulas for an exponential sum over the set of absolutely indecomposable objects and a…
The following three sections and appendices are taken from my thesis "The Foundations of Inference and its Application to Fundamental Physics" from 2021, in which I construct a theory of entropic inference from first principles. The…
Reader curiosity, the drive to seek information, is crucial for textual engagement, yet remains relatively underexplored in NLP. Building on Loewenstein's Information Gap Theory, we introduce a framework that models reader curiosity by…
Given a one-dimensional shift $X$, let $|F_X(\ell)|$ be the number of follower sets of words of length $\ell$ in $X$. We call the sequence $\{|F_X(\ell)|\}_{\ell \in \mathbb{N}}$ the follower set sequence of the shift $X$. Extender sets are…