English
Related papers

Related papers: Dichotomy for Axiomatising Inclusion Dependencies …

200 papers

We establish axiomatic characterizations of $K$-theory and $KK$-theory for real C*-algebras. In particular, let $F$ be an abelian group-valued functor on separable real C*-algebras. We prove that if $F$ is homotopy invariant, stable, and…

Operator Algebras · Mathematics 2012-10-15 Jeffrey L. Boersema , Efren Ruiz

Syntax is a latent hierarchical structure which underpins the robust and compositional nature of human language. In this work, we explore the hypothesis that syntactic dependencies can be represented in language model attention…

Computation and Language · Computer Science 2023-10-24 Jasper Jian , Siva Reddy

We extend Geisser and Hesselholt's result on ``bi-relative K-theory'' from discrete rings to connective ring spectra. That is, if $\mathcal A$ is a homotopy cartesian $n$-cube of ring spectra (satisfying connectivity hypotheses), then the…

K-Theory and Homology · Mathematics 2007-05-23 Bjørn Ian Dundas , Harald Øyen Kittang

We consider the task of enumerating and counting answers to $k$-ary conjunctive queries against relational databases that may be updated by inserting or deleting tuples. We exhibit a new notion of q-hierarchical conjunctive queries and show…

Databases · Computer Science 2017-02-22 Christoph Berkholz , Jens Keppeler , Nicole Schweikardt

In the mid 1980s, while working on establishing completion theorems for equivariant Algebraic K-Theory similar to the well-known completion theorems for equivariant topological K-theory, the late Robert Thomason found the strong finiteness…

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

We provide a Sandwich Theorem (K\"onig (1972)) for positively homogeneous functionals that satisfy additivity only on a restricted domain. Our relaxation of additivity is based on a binary relation called convex-conic symmetric preorder,…

Functional Analysis · Mathematics 2023-04-07 Mario Ghossoub , Giulio Principi , Lorenzo Stanca

We consider the dichotomy conjecture for consistent query answering under primary key constraints. It states that, for every fixed Boolean conjunctive query q, testing whether q is certain (i.e. whether it evaluates to true over all repairs…

Databases · Computer Science 2024-05-27 Anantha Padmanabha , Luc Segoufin , Cristina Sirangelo

Conjunctive queries are basic and heavily studied database queries; in relational algebra, they are the select-project-join queries. In this article, we study the fundamental problem of counting, given a conjunctive query and a relational…

Computational Complexity · Computer Science 2015-01-22 Hubie Chen , Stefan Mengel

This paper provides a comprehensive overview of some of the foundational properties of categories enriched over quantaloids, along with several new results. We demonstrate that the category whose objects are quantaloid-enriched categories…

Category Theory · Mathematics 2025-10-14 Javier Gutiérrez García , Ulrich Höhle

The role of symmetries in what concerns entanglement entropy has been extensively explored in the last years and revealed a profound connection with the quantum field theory's algebraic structure. Recently, it was found that some universal…

High Energy Physics - Theory · Physics 2022-07-13 Marina Huerta , Guido van der Velde

We introduce an axiomatic approach for characterizing quantum conditional entropy. Our approach relies on two physically motivated axioms: monotonicity under conditional majorization and additivity. We show that these two axioms provide…

Quantum Physics · Physics 2021-10-29 Sarah Brandsen , Isabelle J. Geng , Mark M. Wilde , Gilad Gour

We define complexes analogous to Goncharov's complexes for the K-theory of discrete valuation rings of characteristic zero. Under suitable assumptions in K-theory, there is a map from the cohomology of those complexes to the K-theory of the…

Algebraic Geometry · Mathematics 2007-05-23 Amnon Besser , Rob de Jeu

We prove a complexity dichotomy theorem for all non-negative weighted counting Constraint Satisfaction Problems (CSP). This caps a long series of important results on counting problems including unweighted and weighted graph homomorphisms…

Computational Complexity · Computer Science 2010-12-30 Jin-Yi Cai , Xi Chen , Pinyan Lu

This paper rigorously and concisely defines, in the context of our (Elementary) Mathematical Data Model ((E)MDM), the mathematical concepts of dyadic relation, reflexivity, irreflexivity, symmetry, asymmetry, transitivity, intransitivity,…

Databases · Computer Science 2024-12-02 Christian Mancas

We decompose the K-theory space of a Waldhausen category in terms of its Dwyer-Kan simplicial localization. This leads to a criterion for functors to induce equivalences of K-theory spectra that generalizes and explains many of the criteria…

K-Theory and Homology · Mathematics 2011-08-09 Andrew J. Blumberg , Michael A. Mandell

Inducing association rules is one of the central tasks in data mining applications. Quantitative association rules induced from databases describe rich and hidden relationships holding within data that can prove useful for various…

Computational Complexity · Computer Science 2007-05-23 Fabrizio Angiulli , Giovambattista Ianni , Luigi Palopoli

We study continuous bounded cohomology of totally disconnected locally compact groups with coefficients in a non-Archimedean valued field $K$. To capture the features of classical amenability that induce the vanishing of real bounded…

Group Theory · Mathematics 2022-04-29 Francesco Fournier-Facio

A topological groupoid G is K-pointed, if it is equipped with a homomorphism from a topological group K to G. We describe the homotopy groups of such K-pointed topological groupoids and relate these groups to the ordinary homotopy groups in…

Differential Geometry · Mathematics 2017-03-17 B. Jelenc , J. Mrcun

In several different settings, one comes across situations in which the objects of study are locally consistent but globally inconsistent. Earlier work about probability distributions by Vorob'ev (1962) and about database relations by…

Databases · Computer Science 2020-09-22 Albert Atserias , Phokion G. Kolaitis

Dependence logic is a formalism that augments the syntax of first-order logic with dependence atoms asserting that the value of a variable is determined by the values of some other variables, i.e., dependence atoms express functional…

Logic in Computer Science · Computer Science 2025-08-25 Nicolas Fröhlich , Phokion G. Kolaitis , Arne Meier