sheaf theory
Recently Published Documents


TOTAL DOCUMENTS

66
(FIVE YEARS 10)

H-INDEX

9
(FIVE YEARS 1)

Author(s):  
Honghao Gao ◽  
Dan Rutherford

Abstract We establish new examples of augmentations of Legendrian twist knots that cannot be induced by orientable Lagrangian fillings. To do so, we use a version of the Seidel –Ekholm–Dimitroglou Rizell isomorphism with local coefficients to show that any Lagrangian filling point in the augmentation variety of a Legendrian knot must lie in the injective image of an algebraic torus with dimension equal to the 1st Betti number of the filling. This is a Floer-theoretic version of a result from microlocal sheaf theory. For the augmentations in question, we show that no such algebraic torus can exist.


2021 ◽  
Vol 8 ◽  
Author(s):  
Renita Murimi

The incorporation of robots in the social fabric of our society has taken giant leaps, enabled by advances in artificial intelligence and big data. As these robots become increasingly adept at parsing through enormous datasets and making decisions where humans fall short, a significant challenge lies in the analysis of robot behavior. Capturing interactions between robots, humans and IoT devices in traditional structures such as graphs poses challenges in the storage and analysis of large data sets in dense graphs generated by frequent activities. This paper proposes a framework that uses the blockchain for the storage of robotic interactions, and the use of sheaf theory for analysis of these interactions. Applications of our framework for social robots and swarm robots incorporating imperfect information and irrationality on the blockchain sheaf are proposed. This work shows the application of such a framework for various blockchain applications on the spectrum of human-robot interaction, and identifies key challenges that arise as a result of using the blockchain for robotic applications.


Author(s):  
Adam Brown ◽  
Omer Bobrowski ◽  
Elizabeth Munch ◽  
Bei Wang

AbstractWe study the probabilistic convergence between the mapper graph and the Reeb graph of a topological space $${\mathbb {X}}$$ X equipped with a continuous function $$f: {\mathbb {X}}\rightarrow \mathbb {R}$$ f : X → R . We first give a categorification of the mapper graph and the Reeb graph by interpreting them in terms of cosheaves and stratified covers of the real line $$\mathbb {R}$$ R . We then introduce a variant of the classic mapper graph of Singh et al. (in: Eurographics symposium on point-based graphics, 2007), referred to as the enhanced mapper graph, and demonstrate that such a construction approximates the Reeb graph of $$({\mathbb {X}}, f)$$ ( X , f ) when it is applied to points randomly sampled from a probability density function concentrated on $$({\mathbb {X}}, f)$$ ( X , f ) . Our techniques are based on the interleaving distance of constructible cosheaves and topological estimation via kernel density estimates. Following Munch and Wang (In: 32nd international symposium on computational geometry, volume 51 of Leibniz international proceedings in informatics (LIPIcs), Dagstuhl, Germany, pp 53:1–53:16, 2016), we first show that the mapper graph of $$({\mathbb {X}}, f)$$ ( X , f ) , a constructible $$\mathbb {R}$$ R -space (with a fixed open cover), approximates the Reeb graph of the same space. We then construct an isomorphism between the mapper of $$({\mathbb {X}},f)$$ ( X , f ) to the mapper of a super-level set of a probability density function concentrated on $$({\mathbb {X}}, f)$$ ( X , f ) . Finally, building on the approach of Bobrowski et al. (Bernoulli 23(1):288–328, 2017b), we show that, with high probability, we can recover the mapper of the super-level set given a sufficiently large sample. Our work is the first to consider the mapper construction using the theory of cosheaves in a probabilistic setting. It is part of an ongoing effort to combine sheaf theory, probability, and statistics, to support topological data analysis with random data.


2020 ◽  
Vol 27 (4) ◽  
pp. 337-342
Author(s):  
ABD EL AZIZ A. RADWAN ◽  
SALAH EL DIN S. HUSSEIN

Since the late sixties, Various Auslander regularity conditions have been widely investigated in both commutative and non-commutative cases, [6]. J. E. Bjork studied the Auslander regularity on graded rings and positively filtered Noetherian Noetherian rings, [7]. In [7] the notion of a holonomic module over positively filtered rings has been introduced. Recently, Huishi, in his Ph. D. Thesis [12], investigate Auslander regularity condition and holonomity of graded and filtered modules over Zariski filtered rings. In this work, using the micro-structure sheaf techniques we characterize a generalized Holonomic sheaf theory. We introduce a general study of Auslander regularity on the micro-structure sheaves. We calculate the global dimension of modules over the micro- structure sheaves O . The main results are contained in Theorem (2.4), Theorem (3.6) and Theorem (3.7).


Algorithms ◽  
2020 ◽  
Vol 13 (6) ◽  
pp. 149
Author(s):  
Denis Khryashchev ◽  
Jie Chu ◽  
Mikael Vejdemo-Johansson ◽  
Ping Ji

The Evasion Problem is the question of whether—given a collection of sensors and a particular movement pattern over time—it is possible to stay undetected within the domain over the same stretch of time. It has been studied using topological techniques since 2006—with sufficient conditions for non-existence of an Evasion Path provided by de Silva and Ghrist; sufficient and necessary conditions with extended sensor capabilities provided by Adams and Carlsson; and sufficient and necessary conditions using sheaf theory by Krishnan and Ghrist. In this paper, we propose three algorithms for the Evasion Problem: one distributed algorithm extension of Adams’ approach for evasion path detection, and two different approaches to evasion path enumeration.


2019 ◽  
Vol 375 (1791) ◽  
pp. 20190303 ◽  
Author(s):  
Steven Phillips

Semantic compositionality—the way that meanings of complex entities obtain from meanings of constituent entities and their structural relations—is supposed to explain certain concomitant cognitive capacities, such as systematicity. Yet, cognitive scientists are divided on mechanisms for compositionality: e.g. a language of thought on one side versus a geometry of thought on the other. Category theory is a field of (meta)mathematics invented to bridge formal divides. We focus on sheaving—a construction at the nexus of algebra and geometry/topology, alluding to an integrative view, to sketch out a category theory perspective on the semantics of compositionality. Sheaving is a universal construction for making inferences from local knowledge, where meaning is grounded by the underlying topological space. Three examples illustrate how topology conveys meaning, in terms of the inclusion relations between the open sets that constitute the space, though the topology is not regarded as the only source of semantic information. In this sense, category (sheaf) theory provides a general framework for semantic compositionality. This article is part of the theme issue ‘Towards mechanistic models of meaning composition’.


2019 ◽  
Vol 7 ◽  
Author(s):  
VIVEK SHENDE

We use microlocal sheaf theory to show that knots can only have Legendrian isotopic conormal tori if they themselves are isotopic or mirror images.


Sign in / Sign up

Export Citation Format

Share Document