skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.

Explore Research Products in the PAR
It may take a few hours for recently added research products to appear in PAR search results.


Title: Local Presentability of Certain Comma Categories
It follows from standard results that if A and C are locally λ-presentable categories and F : A → C is a λ-accessible functor, then the comma category 𝖨𝖽↓𝐹 is locally λ-presentable. We show that, under the same hypotheses, 𝐹↓𝖨𝖽 is also locally λ-presentable.  more » « less
Award ID(s):
1713389
PAR ID:
10188158
Author(s) / Creator(s):
;
Date Published:
Journal Name:
Applied categorical structures
Volume:
28
ISSN:
1572-9095
Page Range / eLocation ID:
135-142
Format(s):
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
  1. ; ; ; ; (, International Conference on Autonomous Agents and Multiagent Systems)
    The Weighted-Mean Subsequence Reduced (W-MSR) algorithm, the state-of-the-art method for Byzantine-resilient design of decentralized multi-robot systems, is based on discarding outliers received over Linear Consensus Protocol (LCP). Although W-MSR provides theoretical guarantees relating network connectivity to the convergence of the underlying consensus, W-MSR comes with several limitations: the number of Byzantine robots, 𝐹 , to tolerate should be known a priori, each robot needs to maintain 2𝐹 + 1 neighbors, 𝐹 + 1 robots must independently make local measurements of the consensus property in order for the swarm’s decision to change, and W-MSR is specific to LCP and does not generalize to applications not implemented over LCP. In this work, we pro- pose a Decentralized Blocklist Protocol (DBP) based on inter-robot accusations. Accusations are made on the basis of locally-made observations of misbehavior, and once shared by cooperative robots across the network are used as input to a graph matching algorithm that computes a blocklist. DBP generalizes to applications not implemented via LCP, is adaptive to the number of Byzantine robots, and allows for fast information propagation through the multi- robot system while simultaneously reducing the required network connectivity relative to W-MSR. On LCP-type applications, DBP reduces the worst-case connectivity requirement of W-MSR from (2𝐹 + 1)-connected to (𝐹 + 1)-connected and the minimum number of cooperative observers required to propagate new information from 𝐹 + 1 to just 1 observer. We demonstrate that our approach to Byzantine resilience scales to hundreds of robots on target tracking, time synchronization, and localization case studies. 
    more » « less
  2. ; (, Logic in Computer Science)
    We present a grammar for a robust class of data types that includes algebraic data types (ADTs), (truly) nested types, generalized algebraic data types (GADTs), and their higher-kinded analogues. All of the data types our grammar defines, as well as their associated type constructors, are shown to have fully functorial initial algebra semantics in locally presentable categories. Since local presentability is a modest hypothesis, needed for such semantics for even the simplest ADTs, our semantic framework is actually quite conservative. Our results thus provide evidence that if a category supports fully functorial initial algebra semantics for standard ADTs, then it does so for advanced higher-kinded data types as well. To give our semantics we introduce a new type former called Lan that captures on the syntactic level the categorical notion of a left Kan extension. We show how left Kan extensions capture propagation of a data type’s syntactic generators across the entire universe of types, via a certain completion procedure, so that the type constructor associated with a data type becomes a bona fide functor with a canonical action on morphisms. A by-product of our semantics is a precise measure of the semantic complexity of data types, given by the least cardinal λ for which the functor underlying a data type is λ-accessible. The proof of our main result allows this cardinal to be read off from a data type definition without much effort. It also gives a sufficient condition for a data type to have semantic complexity ω, thus characterizing those data types whose data elements are effectively enumerable. 
    more » « less
  3. ; ; (, Compositio Mathematica)
    null (Ed.)
    We study the question of dualizability in higher Morita categories of locally presentable tensor categories and braided tensor categories. Our main results are that the 3-category of rigid tensor categories with enough compact projectives is 2-dualizable, that the 4-category of rigid braided tensor categories with enough compact projectives is 3-dualizable, and that (in characteristic zero) the 4-category of braided multi-fusion categories is 4-dualizable. Via the cobordism hypothesis, this produces respectively two-, three- and four-dimensional framed local topological field theories. In particular, we produce a framed three-dimensional local topological field theory attached to the category of representations of a quantum group at any value of $$q$$ . 
    more » « less
  4. (, the 19th IEEE Conference on Privacy, Security and Trust (PST’22))
    Making digital evidence presentable is hard due to its intangible and complex nature and the variety of targeted audiences. In this paper, we present Digital Forensic Knowledge Graph (DFKG) for visualizing and reasoning about digital forensic evidence. We first describe the criteria of presentable evidence to ensure the authenticity, integrity, validity, credibility, and relevance of evidence. Then we specify DFKG to capture presentable forensic evidence from three perspectives: (1) the background of a criminal case, (2) the reconstructed timeline, and (3) the verifiable digital evidence related to the criminal activity timeline. We also present a case study to illustrate the DFKG-based approach. 
    more » « less
  5. ; ; ; (, Journal für die reine und angewandte Mathematik (Crelles Journal))
    Abstract We prove that every globally 𝐹-split surface admits an equisingular lifting over the ring of Witt vectors. 
    more » « less
  • Citation Formats
  • MLA
  • APA
  • Chicago
  • BibTeX
  • Save / Share this Record
  • Send to Email