Related papers: Size of Union

In this paper we present a new bound obtained with the probabilistic method for the solution of the Set Covering problem with unit costs. The bound is valid for problems of fixed dimension, thus extending previous similar asymptotic…

For $n$ and $k$ integers we introduce the notion of some partition of $n$ being able to generate another partition of $n$. We solve the problem of finding the minimum size partition for which the set of partitions this partition can…

We show that the size of the intersection of a Hermitian variety in $\PG(n,q^2)$, and any set satisfying an $r$-dimensional-subspace intersection property, is congruent to 1 modulo a power of $p$. In particular, in the case where $n=2$, if…

In this paper, we investigate two questions on Kneser graphs $KG_{n,k}$. First, we prove that the union of $s$ intersecting families in ${[n]\choose k}$ has size at most ${n\choose k}-{n-s\choose k}$ for all sufficiently large $n$ that…

In this paper we introduce the concept of completeness of sets. We study this property on the set of integers. We examine how this property is preserved as we carry out various operations compatible with sets. We also introduce the problem…

A lower bound on the amount of noise that must be added to a GHZ-like entangled state to make it separable (also called the random robustness) is found using the transposition condition. The bound is applicable to arbitrary numbers of…

Recent experiments claiming formation of quantum superposition states in near macroscopic sys- tems raise the question of how the sizes of general quantum superposition states in an interacting system are to be quantified. We propose here a…

We introduce linear programs encoding regular expressions of finite languages. We show that, given a language, the optimum value of the associated linear program is a lower bound on the size of any regular expression of the language.…

For subsets of $\mathbb R^+ = [0,\infty)$ we introduce a notion of coherently porous sets as the sets for which the upper limit in the definition of porosity at a point is attained along the same sequence. We prove that the union of two…

This paper presents two general criteria to determine spaceability results in the complements of unions of subspaces. The first criterion applies to countable unions of subspaces under specific conditions and is closely related to the…

Let $M_n(K)$ denote the algebra of $n \times n$ matrices over a field $K$ of characteristic zero. A nonunital subalgebra $N \subset M_n(K)$ will be called a nonunital intersection if $N$ is the intersection of two unital subalgebras of…

We analyze union-find using potential functions motivated by continuous algorithms, and give alternate proofs of the $O(\log\log{n})$, $O(\log^{*}n)$, $O(\log^{**}n)$, and $O(\alpha(n))$ amortized cost upper bounds. The proof of the…

The union-closed sets conjecture states that if a family of sets $\mathcal{A} \neq \{\emptyset\}$ is union-closed, then there is an element which belongs to at least half the sets in $\mathcal{A}$. In 2001, D. Reimer showed that the average…

Let $3\le d\le k$ and $\nu\ge 0$ be fixed and $\mathcal{F}\subset\binom{[n]}{k}$. The matching number of $\mathcal{F}$, denoted by $\nu(\mathcal{F})$, is the maximum number of pairwise disjoint sets in $\mathcal{F}$, and $\mathcal{F}$ is…

The dynamic approximate membership problem asks to represent a set S of size n, whose elements are provided in an on-line fashion, supporting membership queries without false negatives and with a false positive rate at most epsilon. That…

In this paper, we study the conjunction of possibility measures when they are interpreted as coherent upper probabilities, that is, as upper bounds for some set of probability measures. We identify conditions under which the minimum of two…

Determining the size of a maximum independent set of a graph $G$, denoted by $\alpha(G)$, is an NP-hard problem. Therefore, many attempts are made to find upper and lower bounds, or exact values of $\alpha (G)$ for special classes of…

We characterize the largest point sets in the plane which define at most 1, 2, and 3 angles. For $P(k)$ the largest size of a point set admitting at most $k$ angles, we prove $P(2)=5$ and $P(3)=5$. We also provide the general bounds of $k+2…

Given an infinite group G, we consider the finitely additive measure defined on finite unions of cosets of finite index subgroups. We show that this shares many properties with the size of subsets of a finite group, for instance we can…

We show that any open set in $\R^n$ is a union of an ascending sequence of bounded open sets with analytic boundary. This is just a technical result, which is probably known. We believe, however, that it can be useful for studing BVPs on…