English
Related papers

Related papers: Recursive Completion in Higher K-Models: Front-See…

200 papers

Dendroidal sets have been introduced as a combinatorial model for homotopy coherent operads. We introduce the notion of fully Kan dendroidal sets and show that there is a model structure on the category of dendroidal sets with fibrant…

Algebraic Topology · Mathematics 2014-05-20 Matija Bašić , Thomas Nikolaus

Let K and L be compact convex sets in R^n. The following two statements are shown to be equivalent: (i) For every polytope Q inside K having at most n+1 vertices, L contains a translate of Q. (ii) L contains a translate of K. Let 1 <= d <=…

Metric Geometry · Mathematics 2010-10-25 Daniel A. Klain

This paper introduces a model theory for resolution on Higher Order Hereditarily Harrop formulae (HOHH), the logic underlying the Lambda-Prolog programming language, and proves soundness and completeness of resolution. The semantics and the…

Programming Languages · Computer Science 2024-05-28 Gianluca Amato , Mary DeMarco , James Lipton

Let G be a discrete group. We give methods to compute for a generalized (co-)homology theory its values on the Borel construction (EG x X)/G of a proper G-CW-complex X satisfying certain finiteness conditions. In particular we give formulas…

K-Theory and Homology · Mathematics 2012-01-24 Michael Joachim , Wolfgang Lueck

We compare the K-theories of symplectic quotients with respect to a compact connected Lie group and with respect to its maximal torus, and in particular we give a method for computing the former in terms of the latter. More specifically,…

Symplectic Geometry · Mathematics 2007-05-23 Megumi Harada , Gregory D. Landweber

In this paper we construct finite dimensional representations of the wreath product symplectic reflection algebra H(k,c,N,G) of rank N attached to a finite subgroup G of SL(2,C) (here k is a number and c a class function on the set of…

Representation Theory · Mathematics 2007-05-23 Pavel Etingof , Silvia Montarani

There are two well known systems formalizing total recursion beyond primitive recursion (\textbf{PR}), system \textbf{T} by G\"odel and system \textbf{F} by Girard and Reynolds. system \textbf{T} defines recursion on typed objects and can…

Logic in Computer Science · Computer Science 2018-01-04 David M. Cerna

We prove two results about the derived functor of $a$-adic completion: (1) Let $K$ be a commutative noetherian ring, let $A$ be a flat noetherian $K$-algebra which is $a$-adically complete with respect to some ideal $a\subseteq A$, such…

Commutative Algebra · Mathematics 2017-10-04 Liran Shaul

Motivated by the growing interest in representation learning approaches that uncover the latent structure of high-dimensional data, this work proposes new algorithms for reconstruction-based manifold learning within Reproducing-Kernel…

Machine Learning · Computer Science 2026-05-07 Enrique Feito-Casares , Francisco M. Melgarejo-Meseguer , José-Luis Rojo-Álvarez

For a Cohen-Macaulay ring $R$, we exhibit the equivalence of the bounded derived categories of certain resolving subcategories, which, amongst other results, yields an equivalence of the bounded derived category of finite length and finite…

K-Theory and Homology · Mathematics 2015-05-26 William Sanders , Sarang Sane

In the present paper, we discuss applications of the derived completion theorems proven in our previous two papers. One of the main applications is to Riemann-Roch problems for forms of higher equivariant K-theory, which we are able to…

Algebraic Geometry · Mathematics 2024-05-17 Gunnar Carlsson , Roy Joshua , Pablo Pelaez

<Q>_e is the effective list of all finite predicate logic programs. <T_e> is the list of recursive trees. We modify constructions of Marek, Nerode, and Remmel [25] to construct recursive functions f and g such that for all indices e, (i)…

Logic in Computer Science · Computer Science 2013-03-27 D. Cenzer , V. W. Marek , J. B. Remmel

We introduce the notion of a cylindrical bialgebra, which is a quasitriangular bialgebra $H$ endowed with a universal K-matrix, i.e., a universal solution of a generalized reflection equation, yielding an action of cylindrical braid groups…

Representation Theory · Mathematics 2025-10-22 Andrea Appel , Bart Vlaar

In this paper, we establish a theorem that proves a condition when an inclusion morphism between simplicial sets becomes a weak homotopy equivalence. Additionally, we present two applications of this result. The first application…

Algebraic Topology · Mathematics 2024-05-07 Hisato Matsukawa

Continual learning systems operating in fixed-dimensional spaces face a fundamental geometric barrier: the flat manifold problem. When experience is represented as a linear trajectory in Euclidean space, the geodesic distance between…

Machine Learning · Computer Science 2025-12-23 Xin Li

A theory of recursive definitions has been mechanized in Isabelle's Zermelo-Fraenkel (ZF) set theory. The objective is to support the formalization of particular recursive definitions for use in verification, semantics proofs and other…

Logic in Computer Science · Computer Science 2008-02-03 Lawrence C. Paulson

We model the recursive production property of context-free grammars for natural and synthetic languages. To this end, we present a dynamic programming algorithm that marginalises over latent binary tree structures with $N$ leaves, allowing…

Computation and Language · Computer Science 2020-10-12 Shawn Tan , Yikang Shen , Timothy J. O'Donnell , Alessandro Sordoni , Aaron Courville

Let G be a compact connected Lie group, and (M,\omega) a Hamiltonian G-space with proper moment map \mu. We give a surjectivity result which expresses the K-theory of the symplectic quotient M//G in terms of the equivariant K-theory of the…

Symplectic Geometry · Mathematics 2007-05-23 Megumi Harada , Gregory D. Landweber

In their 2007 paper, Jarvis, Kaufmann, and Kimura defined the full orbifold $K$-theory of an orbifold ${\mathfrak X}$, analogous to the Chen-Ruan orbifold cohomology of ${\mathfrak X}$ in that it uses the obstruction bundle as a quantum…

Symplectic Geometry · Mathematics 2009-04-28 Rebecca Goldin , Megumi Harada , Tara S. Holm , Takashi Kimura

We introduce the Rebound library that supports well-scoped term representations in Haskell and automates the definition of substitution, alpha-equivalence, and other operations that work with binding structures. The key idea of our design…

Programming Languages · Computer Science 2025-09-17 Noé De Santo , Stephanie Weirich