Related papers: On variables with few occurrences in conjunctive n…
We consider databases in which each attribute takes values from a partially ordered set (poset). This allows one to model a number of interesting scenarios arising in different applications, including quantitative databases, taxonomies, and…
New Vapnik and Chervonenkis type concentration inequalities are derived for the empirical distribution of an independent random sample. Focus is on the maximal deviation over classes of Borel sets within a low probability region. The…
The Local Lemma is a fundamental tool of probabilistic combinatorics and theoretical computer science, yet there are hardly any natural problems known where it provides an asymptotically tight answer. The main theme of our paper is to…
We study the number of queries needed to identify a monotone Boolean function $f:\{0,1\}^n \rightarrow \{0,1\}$. A query consists of a 0-1-sequence, and the answer is the value of $f$ on that sequence. It is well-known that the number of…
We present a study of minimal unsatisfiable subsets (MUSs) of 2-CNF Boolean formulas, building on the Abbasizanjani-Kullmann classification of minimally unsatisfiable 2-CNFs (2-MUs). We start by giving a linear-time procedure for…
Let $f(X)$ be a nonconstant polynomial over $\mathbb{F}_{q}$, with a nonzero constant term. The order of $f(X)$ is a classical notion in the theory of polynomials over finite fields, and recently the definition of freeness of binomials of…
We introduce constraints necessary for type checking a higher-order concurrent constraint language, and solve them with an incremental algorithm. Our constraint system extends rational unification by constraints x$\subseteq$ y saying that…
For a coherent, binary system made up of binary elements, the exact failure probability requires knowledge of statistical dependence of all orders among the minimal cut sets. Since dependence among the cut sets beyond the second order is…
We give a model-theoretic account for several results regarding sequences of random variables appearing in Berkes & Rosenthal \cite{Berkes-Rosenthal:AlmostExchangeableSequences}. In order to do this, {itemize} We study and compare three…
In this article, we explore the combinatorics of balanced collections. A collection of subsets of the set $[n] = \{1, \dots, n\}$ is called \emph{balanced} if the relative interior of the convex hull of the corresponding characteristic…
We consider the number of occurrences of subwords (non-consecutive sub-sequences) in a given word. We first define the notion of subword entropy of a given word that measures the maximal number of occurrences among all possible subwords. We…
We establish that the Lavrentiev gap between Sobolev and Lipschitz maps does not occur for a scalar variational problem of the form: \[ \textrm{to minimize} \qquad u \mapsto \int_\Omega f(x,u,\nabla u)\,dx \,, \] under a Dirichlet boundary…
Let $d,k$ be natural numbers and let $\mathcal{L}_1, \dots, \mathcal{L}_k \in \mathrm{GL}_d(\mathbb{Q})$ be linear transformations such that there are no non-trivial subspaces $U, V \subseteq \mathbb{Q}^d$ of the same dimension satisfying…
There has been much recent interest in the satisfiability of random Boolean formulas. A random k-SAT formula is the conjunction of m random clauses, each of which is the disjunction of k literals (a variable or its negation). It is known…
We prove a lower bound of exp(-C (log(2/alpha))^7)N^{k-1} to the number of solutions of an invariant equation in k variables, contained in a set of density alpha. Moreover, we give a Behrend-type construction for the same problem with the…
We study the binary Ehrenfeucht Mycielski sequence seeking a balance between the number of occurrences of different binary strings. There have been numerous attempts to prove the balance conjecture of the sequence, which roughly states that…
Model counting is a fundamental problem that consists of determining the number of satisfying assignments for a given Boolean formula. The weighted variant, which computes the weighted sum of satisfying assignments, has extensive…
Recently, the separated fragment (SF) of first-order logic has been introduced. Its defining principle is that universally and existentially quantified variables may not occur together in atoms. SF properly generalizes both the…
We prove that the abundance conjecture holds on a variety $X$ with mild singularities if $X$ has many reflexive differential forms with coefficients in pluricanonical bundles, assuming the Minimal Model Program in lower dimensions. This…
A string $w$ is called a minimal absent word (MAW) for another string $T$ if $w$ does not occur in $T$ but the proper substrings of $w$ occur in $T$. For example, let $\Sigma = \{\mathtt{a, b, c}\}$ be the alphabet. Then, the set of MAWs…