Related papers: Dichotomy for Axiomatising Inclusion Dependencies …
Commutative $d$-torsion $K$-theory is a variant of topological $K$-theory constructed from commuting unitary matrices of order dividing $d$. Such matrices appear as solutions of linear constraint systems that play a role in the study of…
A dynamical system is called contractive if any two solutions approach one another at an exponential rate. More precisely, the dynamics contracts lines at an exponential rate. This property implies highly ordered asymptotic behavior…
Inclusion logic is a variant of dependence logic that was shown to have the same expressive power as positive greatest fixed-point logic. Inclusion logic is not axiomatizable in full, but its first-order consequences can be axiomatized. In…
Association Rules are a basic concept of data mining. They are, however, not understood as logical objects which can be used for reasoning. The purpose of this paper is to investigate a model based semantic for implications with certain…
Archetypal analysis is an unsupervised learning method that uses a convex polytope to summarize multivariate data. For fixed $k$, the method finds a convex polytope with $k$ vertices, called archetype points, such that the polytope is…
Generalized differential cohomology theories, in particular differential K-theory (often called "smooth K-theory"), are becoming an important tool in differential geometry and in mathematical physics. In this survey, we describe the…
K-theory provides a framework for classifying Ramond-Ramond (RR) charges and fields. K-theory of manifolds has a natural extension to K-theory of noncommutative algebras, such as the algebra considered in noncommutative Yang-Mills theory or…
Many deep, mysterious connections have been observed between collections of mutually unbiased bases (MUBs) and combinatorial designs called $k$-nets (and in particular, between complete collections of MUBs and finite affine - or…
We investigate some of the motivations and consequences of the conjecture that the Kac-Moody algebra E11 is the symmetry algebra of M-theory, and we develop methods to aid the further investigation of this idea. The definitions required to…
Let $A$ be a finite-dimensional algebra over a field $k$. We define $A$ to be $\mathbf{C}$-dichotomic if it has the dichotomy property of the representation type on complexes of projective $A$-modules. $\mathbf{C}$-dichotomy implies the…
Standard models for syntactic dependency parsing take words to be the elementary units that enter into dependency relations. In this paper, we investigate whether there are any benefits from enriching these models with the more abstract…
We prove a complexity dichotomy theorem for Holant problems over an arbitrary set of complex-valued symmetric constraint functions F on Boolean variables. This extends and unifies all previous dichotomies for Holant problems on symmetric…
We initiate an investigation how the fundamental concept of independence can be represented effectively in the presence of incomplete information in relational databases. The concepts of possible and certain independence are proposed, and…
We give a combinatorial proof of the skew Kostka analogue of the K-saturation theorem. More precisely, for any positive integer k, we give an explicit injection from the set of skew semistandard Young tableaux with skew shape…
We study ranked enumeration for Conjunctive Queries (CQs) where the answers are ordered by a given ranking function (e.g., an ORDER BY clause in SQL). We develop "any-k" algorithms, which, without knowing the number k of desired answers,…
We prove that Keimel and Lawson's K-completion Kc of the simple valuation monad Vs defines a monad Kc o Vs on each K-category A. We also characterize the Eilenberg-Moore algebras of Kc o Vs as the weakly locally convex K-cones, and its…
We study the problem of fitting ontologies and constraints to positive and negative examples that take the form of a finite relational structure. As ontology and constraint languages, we consider the description logics $\mathcal{E\mkern-2mu…
The connections between nonmonotonic reasoning and belief revision are well-known. A central problem in the area of nonmonotonic reasoning is the problem of default entailment, i.e., when should an item of default information representing…
We introduce the notion of reflexivity for combinatory algebras. Reflexivity can be thought of as an equational counterpart of the Meyer-Scott axiom of combinatory models, which indeed allows us to characterise an equationally definable…
We present a soundness theorem for a dependent type theory with context constants with respect to an indexed category of (finite, abstract) simplical complexes. The point of interest for computer science is that this category can be seen to…