Related papers: Dichotomy for Axiomatising Inclusion Dependencies …
The two model-theoretic concepts of weak saturation and weak amalgamation property are studied in the context of accessible categories. We relate these two concepts providing sufficient conditions for existence and uniqueness of weakly…
Supersymmetric states in M-theory are mapped after compactification to perturbatively non-supersymmetric states in type IIA string theory, with the supersymmetric parts being encoded in the non-perturbative section of the string theory. An…
XML is of great importance in information storage and retrieval because of its recent emergence as a standard for data representation and interchange on the Internet. However XML provides little semantic content and as a result several…
Asymmetry is an inherent property of bivariate associations and therefore must not be ignored. The currently applicable dependence measures mask the potential asymmetry of the underlying dependence structure by implicitly assuming that…
Dichotomy theorems, which characterize the conditions under which a problem can be solved efficiently, have helped identify important tractability borders for as probabilistic query evaluation, view maintenance, query containment (among…
We present a rigorous and fully consistent $K$-theoretic framework for studying gapped topological phases of free fermions such as topological insulators. It utilises and profits from powerful techniques in operator $K$-theory. From the…
A nonmonotonic logic of thresholded generalizations is presented. Given propositions A and B from a language L and a positive integer k, the thresholded generalization A=>B{k} means that the conditional probability P(B|A) falls short of one…
We study the problem of consistent query answering under primary key violations. In this setting, the relations in a database violate the key constraints and we are interested in maximal subsets of the database that satisfy the constraints,…
Critique has surfaced concerning the existing linguistic annotation framework for Korean Universal Dependencies (UDs), particularly in relation to syntactic relationships. In this paper, our primary objective is to refine the definition of…
Our main result (Theorem 1) suggests a possible dividing line ($\mu$-superstable $+$ $\mu$-symmetric) for abstract elementary classes without using extra set-theoretic assumptions or tameness. This theorem illuminates the structural side of…
Connectivity is a homotopy invariant property of separable C*-algebras which has three notable consequences: absence of nontrivial projections, quasidiagonality and a more geometric realization of KK-theory for nuclear C*-algebras using…
Matching dependencies were recently introduced as declarative rules for data cleaning and entity resolution. Enforcing a matching dependency on a database instance identifies the values of some attributes for two tuples, provided that the…
We introduce and study a $K$-theory of twisted bundles for associative algebras $A(\mathfrak g)$ of formal series with an infinite-Lie algebra coefficients over arbitrary compact topological spaces. Fibers of such bundles are given by…
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…
We extend the treatment of functional dependence, the basic concept of dependence logic, to include the possibility of dependence with a limited number of exceptions. We call this approximate dependence. The main result of the paper is a…
We study the $generalized~model~counting~problem$, defined as follows: given a database, and a set of deterministic tuples, count the number of subsets of the database that include all deterministic tuples and satisfy the query. This…
The question whether a set of formulae G implies a formula f is fundamental. The present paper studies the complexity of the above implication problem for propositional formulae that are built from a systematically restricted set of Boolean…
We explore a combinatorial theory of linear dependency in complex space, "complex matroids", with foundations analogous to those for oriented matroids. We give multiple equivalent axiomatizations of complex matroids, showing that this…
A subset U of a group G is called k-universal if U contains a translate of every k-element subset of G. We give several nearly optimal constructions of small k-universal sets, and use them to resolve an old question of Erdos and Newman on…
To an arbitrary variety over a field of characteristic zero, we associate a complex of Chow motives, which is, up to homotopy, unique and bounded. We deduce that any variety has a natural Euler characteristic in the Grothendieck group of…