Related papers: Simplifying inclusion-exclusion formulas

Let $\mathscr{F}=(F_n)$ be a sequence of nonempty finite subsets of $\omega$ such that $\lim_n |F_n|=\infty$ and define the ideal $$\mathcal{I}(\mathscr{F}):=\left\{A\subseteq \omega: |A\cap F_n|/|F_n|\to 0~\mbox{as}~n\to \infty \right\}.$$…

A theorem of Farb and Handel asserts that for $N\ge 4$, the natural inclusion from $\mathrm{Out}(F_N)$ into its abstract commensurator is an isomorphism. We give a new proof of their result, which enables us to generalize it to the case…

A classic theorem in combinatorial design theory is Fisher's inequality, which states that a family $\mathcal F$ of subsets of $[n]$ with all pairwise intersections of size $\lambda$ can have at most $n$ non-empty sets. One may weaken the…

We take a unifying and new approach toward polynomial and trigonometric approximation in an arbitrary number of variables, resulting in a precise and general ready-to-use tool that anyone can easily apply in new situations of interest. The…

Let $t\ge 1$ be a given integer. Let ${\cal F}$ be a family of subsets of $[m]=\{1,2,\ldots,m\}$. Assume that for every pair of disjoint sets $S,T\subset [m]$ with $|S|=|T|=k$, there do not exist $2t$ sets in ${\cal F}$ where $t$ subsets of…

We prove a general decomposition theorem for the modal $\mu$-calculus $L_\mu$ in the spirit of Feferman and Vaught's theorem for disjoint unions. In particular, we show that if a structure (i.e., transition system) is composed of two…

The Frankl's conjecture, formulated in 1979. and still open, states that in every family of sets closed for unions there is an element contained in at least half of the sets. A family Fc is called Frankl-complete (or FC-family) if in every…

Whitney's broken circuit theorem gives a graphical example to reduce the number of the terms in the sum of the inclusion-exclusion formula by a predicted cancellation. So far, the known cancellations for the formula strongly depend on the…

We prove that whenever $M_1,\dots,M_n\colon I^k \to I$, ($n,k \in \mathbb{N}$) are symmetric, continuous means on the interval $I$ and $S_1,\dots,S_m\colon I^k \to I$ ($m <n$) satisfies a sort of embeddability assumptions then for every…

Let F be a finite union-closed family of sets whose largest set contains n elements. In \cite{Wojcik92}, Wojcik defined the density of F to be the ratio of the average set size of F to n and conjectured that the minimum density over all…

The method of exhaustion is generalized to a simple formula that can be used to integrate functions under very general conditions, provided that the integral exists. Both a geometric proof (following the usual procedure for the method of…

We discuss algebraic universality in the sense of P. Vogel for the simplest refined quantity, the Macdonald dimensions. The main known source of universal quantities is given by Chern-Simons theory. Refinement of Chern-Simons theory means…

If the $n-th$ order differential equation is not exact, under certain conditions, an integrating factor exists which transforms the differential equation into an exact one. Hence, its order can be reduced to the lower order. In this paper,…

Dvir and Moran proved the following upper bound for the size of a family $\mbox{$\cal F$}$ of subsets of $[n]$ with $\mbox{Vdim}(\mbox{$\cal F$} \Delta \mbox{$\cal F$})\leq d$. Let $d\leq n$ be integers. Let $\mbox{$\cal F$}$ be a family of…

Systems of equations with sets of integers as unknowns are considered. It is shown that the class of sets representable by unique solutions of equations using the operations of union and addition $S+T=\makeset{m+n}{m \in S, \: n \in T}$ and…

Suppose that $\mathscr{F}$ is a finite union-closed family of sets with $\cup_{A\in \mathscr{F}}A=\{1,2,\ldots,m\}$ and $m\geq 2$. Fix $i\in \{1,2,\ldots,m\}$ and denote $\mathscr{G}:=\{A\backslash \{i\}: A\in \mathscr{F}\}$. For $j\in…

Given a finite sequence $a:={a_1, ..., a_N}$ in a domain $\Omega \subset C^n$, and complex scalars $v:={v_1, ..., v_N}$, consider the classical extremal problem of finding the smallest uniform norm of a holomorphic function verifying…

Jay and Given-Wilson have recently introduced the Factorisation (or SF-) calculus as a minimal fundamental model of intensional computation. It is a combinatory calculus containing a special combinator, F, which is able to examine the…

Let $\mathcal{F}$ be a family of subsets of a ground set $\{1,\ldots,n\}$ with $|\mathcal{F}|=m$, and let $\mathcal{F}^{\updownarrow}$ denote the family of all subsets of $\{1,\ldots,n\}$ that are subsets or supersets of sets in…

An infinite family of graphs ${\cal F}$ is called feasible if for any pair of integers $(n,m)$, $n \geq 1$, $0 \leq m \leq \binom{n}{2}$, there is a member $G \in {\cal F}$ such that $G$ has $n$ vertices and $m$ edges. We prove that given a…