English
Related papers

Related papers: Internal languages of locally cartesian closed $(\…

200 papers

Scaling existing applications and solutions to multiple human languages has traditionally proven to be difficult, mainly due to the language-dependent nature of preprocessing and feature engineering techniques employed in traditional…

Computation and Language · Computer Science 2020-01-01 Xiaotong Liu , Yingbei Tong , Anbang Xu , Rama Akkiraju

A topological group is (openly) almost-elliptic if it contains a(n open) dense subset of elements generating relatively-compact cyclic subgroups. We classify the (openly) almost-elliptic connected locally compact groups as precisely those…

Group Theory · Mathematics 2025-06-12 Alexandru Chirvasitu

Extriangulated categories axiomatize extension-closed subcategories of triangulated categories. We show that the homotopy category of an exact quasi-category can be equipped with a natural extriangulated structure.

Category Theory · Mathematics 2020-04-07 Hiroyuki Nakaoka , Yann Palu

In this paper we continue to study the degrees of matrix coefficients of intertwining operators associated to reductive groups over $p$-adic local fields. Together with previous analysis of global normalizing factors we can control the…

Number Theory · Mathematics 2019-12-12 Tobias Finis , Erez Lapid

We prove two kinds of $\mathbb{Z}/2$-periodic Koszul duality equivalences for triangulated categories of matrix factorizations associated with $(-1)$-shifted cotangents over quasi-smooth affine derived schemes. We use this result to define…

Algebraic Geometry · Mathematics 2021-06-11 Yukinobu Toda

Let $\mathscr{A}$ be a small abelian category. For a closed subbifunctor $F$ of $\Ext_{\mathscr{A}}^{1}(-,-)$, Buan has generalized the construction of the Verdier's quotient category to get a relative derived category, where he localized…

Representation Theory · Mathematics 2016-10-27 Shengyong Pan

We introduce a categorical language in which it is possible to talk about DNA sequencing, alignment methods, CRISPR, homologous recombination, haplotypes, and genetic linkage. This language takes the form of a class of limit-sketches whose…

Category Theory · Mathematics 2018-05-21 Rémy Tuyéras

By theorems of Carlson and Renaudin, the theory of $(\infty,1)$-categories embeds in that of prederivators. The purpose of this paper is to give a two-fold answer to the inverse problem: understanding which prederivators model…

Algebraic Topology · Mathematics 2018-10-16 Daniel Fuentes-Keuthan , Magdalena Kedziorek , Martina Rovelli

Language models (LMs) have exhibited exceptional versatility in reasoning and in-depth financial analysis through their proprietary information processing capabilities. Previous research focused on evaluating classification performance…

Artificial Intelligence · Computer Science 2025-03-21 Han Yuan , Li Zhang , Zheng Ma

Given a compactly generated triangulated category $\mathcal{T}$ equipped with an action of a graded-commutative Noetherian ring $R$, generalizing results of Letz, we prove a general result concerning the openness with respect to levels of…

Commutative Algebra · Mathematics 2025-05-21 Souvik Dey , Jian Liu , Liran Shaul

Intensional computation derives concrete outputs from abstract function definitions; extensional computation defines functions through explicit input-output pairs. In formal semantics: intensional computation interprets expressions as…

Category Theory · Mathematics 2024-09-05 Daniel Quigley

The downward and upward closures of a regular language $L$ are obtained by collecting all the subwords and superwords of its elements, respectively. The downward and upward interiors of $L$ are obtained dually by collecting words having all…

Formal Languages and Automata Theory · Computer Science 2015-12-02 Prateek Karandikar , Matthias Niewerth , Philippe Schnoebelen

We develop the theory of locally rigid and rigid symmetric monoidal $\infty$-categories over an arbitrary base $\mathcal{V}\in\mathrm{CAlg}(\mathbf{Pr}^\mathrm{L})$. Among other things, we prove that every locally rigid commutative…

Category Theory · Mathematics 2026-02-10 Maxime Ramzi

We investigate inference of variable-length codes in other domains of computer science, such as noisy information transmission or information retrieval-storage: in such topics, traditionally mostly constant-length codewords act. The study…

Computation and Language · Computer Science 2021-04-30 Jean Néraud

We propose a new task-specification language for Markov decision processes that is designed to be an improvement over reward functions by being environment independent. The language is a variant of Linear Temporal Logic (LTL) that is…

Artificial Intelligence · Computer Science 2017-04-17 Michael L. Littman , Ufuk Topcu , Jie Fu , Charles Isbell , Min Wen , James MacGlashan

Univalent homotopy type theory (HoTT) may be seen as a language for the category of $\infty$-groupoids. It is being developed as a new foundation for mathematics and as an internal language for (elementary) higher toposes. We develop the…

Category Theory · Mathematics 2023-06-22 Egbert Rijke , Michael Shulman , Bas Spitters

We investigate categories in which products distribute over coproducts, a structure we call doubly-infinitary distributive categories. Through a range of examples, we explore how this notion relates to established concepts such as…

Category Theory · Mathematics 2025-10-15 Fernando Lucatelli Nunes , Matthijs Vákár

In a recent paper by M. Mantoiu and M. Ruzhansky, a global pseudo-differential calculus has been developed for unimodular groups of type I. In the present article we generalize the main results to arbitrary locally compact groups of type I.…

Functional Analysis · Mathematics 2020-08-19 M. Mantoiu , M. Sandoval

In this work, we study the notions of relative comonad and comodule over a relative comonad, and use these notions to give a terminal coalgebra semantics for the coinductive type families of streams and of infinite triangular matrices,…

Logic in Computer Science · Computer Science 2014-04-23 Benedikt Ahrens , Régis Spadotti

In this paper, we continue the research on the power of contextual grammars with selection languages from subfamilies of the family of regular languages. We investigate various comet-like types of languages and compare such language…

Formal Languages and Automata Theory · Computer Science 2024-09-12 Marvin Ködding , Bianca Truthe