English
Related papers

Related papers: Inclusion-Exclusion-Like identities

200 papers

In this paper, we apply the combinatorial proof technique of Description, Involution, Exceptions (DIE) to prove various known identities for the joint cumulant. Consider a set of random variables $S = \{X_1,..., X_n\} $. Motivated by the…

Combinatorics · Mathematics 2012-11-06 Connor Ahlbach , Jeremy Usatine , Nicholas Pippenger

In this note, we present a conjecture on intersections of set families, and a rephrasing of the conjecture in terms of principal downsets of Boolean lattices. The conjecture informally states that, whenever we can express the measure of a…

Combinatorics · Mathematics 2024-01-30 Antoine Amarilli , Mikaël Monet , Dan Suciu

We give simple necessary and sufficient conditions for the inclusion-exclusion identity to hold for an infinite countable number of sets. In terms of a random variable, whose range are nonnegative integers, this condition is equivalent to…

Probability · Mathematics 2007-05-23 Shmuel Friedland , Elliot Krop

Using the concept of constant evasion to different sorts of suitable binary relations, we establish many cardinal invariants derived from the established cardinal invariants $\mathfrak{e}^\mathrm{const}_{n}$ and…

Logic · Mathematics 2025-07-16 Miguel A. Cardona , Miroslav Repický

One form of the inclusion-exclusion principle asserts that if A and B are functions of finite sets then A(S) is the sum of B(T) over all subsets T of S if and only if B(S) is the sum of (-1)^|S-T| A(T) over all subsets T of S. If we replace…

Combinatorics · Mathematics 2013-04-02 Ira M. Gessel

This work investigates the intersection property of conditional independence. It states that for random variables $A,B,C$ and $X$ we have that $X$ independent of $A$ given $B,C$ and $X$ independent of $B$ given $A,C$ implies $X$ independent…

Probability · Mathematics 2016-08-18 Jonas Peters

The Euler characteristic of a finite category is defined and shown to be compatible with Euler characteristics of other types of object, including orbifolds. A formula for the cardinality of the colimit of a diagram of sets is proved,…

Category Theory · Mathematics 2010-02-04 Tom Leinster

Let $\mathcal{F}=\{F_1,F_2, \ldots,F_n\}$ be a family of $n$ sets on a ground set $S$, such as a family of balls in $\mathbb{R}^d$. For every finite measure $\mu$ on $S$, such that the sets of $\mathcal{F}$ are measurable, the classical…

Combinatorics · Mathematics 2014-04-18 Xavier Goaoc , Jiří Matoušek , Pavel Paták , Zuzana Safernová , Martin Tancer

A folklore conjecture asserts the existence of a constant $c_n > 0$ such that $\#\mathcal{F}_n(X) \sim c_n X$ as $X\to \infty$, where $\mathcal{F}_n(X)$ is the set of degree $n$ extensions $K/\mathbb{Q}$ with discriminant bounded by $X$.…

Number Theory · Mathematics 2023-12-14 Robert J. Lemke Oliver

Let $\mathcal{E}$ be the $\sigma$-ideal generated by the closed measure zero sets of reals. We use an ultrafilter-extendable matrix iteration of ccc posets to force that, for $\mathcal{E}$, their associated cardinal characteristics (i.e.\…

Logic · Mathematics 2022-06-30 Miguel A. Cardona

For finite sets of integers $A_1, A_2 ... A_n$ we study the cardinality of the $n$-fold sumset $A_1+... +A_n$ compared to those of $n-1$-fold sumsets $A_1+... +A_{i-1}+A_{i+1}+... A_n$. We prove a superadditivity and a submultiplicativity…

Combinatorics · Mathematics 2007-07-19 Katalin Gyarmati , Imre Z. Ruzsa , Mate Matolcsi

Let $f(x)\in\mathbb{Z}[x]$ be a nonconstant polynomial. Let $n, k$ and $c$ be integers such that $n\ge 1$ and $k\ge 2$. An integer $a$ is called an $f$-exunit in the ring $\mathbb{Z}_n$ of residue classes modulo $n$ if $\gcd(f(a),n)=1$. In…

Number Theory · Mathematics 2021-08-03 Junyong Zhao , Shaofang Hong , Chaoxi Zhu

We show that for every $\varepsilon>0$ there is an absolute constant $c(\varepsilon)>0$ such that the following is true. The union of any $n$ arithmetic progressions, each of length $n$, with pairwise distinct differences must consist of at…

Combinatorics · Mathematics 2017-05-15 Shoni Gilboa , Rom Pinchasi

Given positive integers $n,k$ with $k\leq n$, we consider the number of ways of choosing $k$ subsets of $\{1,\ldots,n\}$ in such a way that the union of these subsets gives $\{1,\ldots,n\}$ and they are not subsets of each other. We refer…

Combinatorics · Mathematics 2020-07-03 Çağın Ararat , Ülkü Gürler , M. Emrullah Ildız

The union of a collection of $n$ sets is generally expressed in terms of a characteristic (indicator) function that contains $2^{n}-1$ terms. In this article, a much simpler expression is found that requires the evaluation of $n$ terms…

General Mathematics · Mathematics 2016-08-03 Vladimir García-Morales

In this paper, a class of combinatorial identities is proved. A method is used which is based on the following rule: counting elements of a given set in two ways and making equal the obtained results. This rule is known as "counting in two…

Discrete Mathematics · Computer Science 2009-02-09 Krassimir Yankov Iordjev , Dimiter Stoichkov Kovachev

Let G be any additive abelian group with cyclic torsion subgroup, and let A, B and C be finite subsets of G with cardinality n>0. We show that there is a numbering {a_i}_{i=1}^n of the elements of A, a numbering {b_i}_{i=1}^n of the…

Combinatorics · Mathematics 2008-12-04 Zhi-Wei Sun

We consider a one dimension Kac model with conservation of energy and an exclusion rule: Fix a number of particles $n$, and an energy $E>0$. Let each of the particles have an energy $x_j \geq 0$, with $\sum_{j=1}^n x_j = E$. For some…

Probability · Mathematics 2021-11-09 Eric Carlen , Bernt Wennberg

Let $a=(a_1,\ldots,a_n)$ and $b=(b_1,\ldots,b_n)$ be two $n$-tuples of positive integers, let $X$ be a set of positive integers, and let $g$ be a positive integer. In this work we show an algorithmic process in order to compute all the sets…

Combinatorics · Mathematics 2019-04-10 Aureliano M. Robles-Pérez , José Carlos Rosales

We consider the problem of characterizing isomorphisms of types, or, equivalently, constructive cardinality of sets, in the simultaneous presence of disjoint unions, Cartesian products, and exponentials. Mostly relying on results about…

Logic in Computer Science · Computer Science 2014-11-04 Danko Ilik
‹ Prev 1 2 3 10 Next ›