Related papers: Inclusion-Exclusion-Like identities

In this paper we study the expressive power of k-ary exclusion logic, EXC[k], that is obtained by extending first order logic with k-ary exclusion atoms. It is known that without arity bounds exclusion logic is equivalent with dependence…

Given $A\subseteq\mathbb Z_n$, the constant $C_A(n)$ is defined to be the smallest natural number $k$ such that any sequence of $k$ elements in $\mathbb Z_n$ has an $A$-weighted zero-sum subsequence having consecutive terms. The value of…

We work in set-theory without choice $\ZF$. Given a closed subset $F$ of $[0,1]^I$ which is a bounded subset of $\ell^1(I)$ ({\em resp.} such that $F \subseteq \ell^0(I)$), we show that the countable axiom of choice for finite subsets of…

An explicit computation of the so-called string-theoretic E-function of a normal complex variety X with at most log-terminal singularities can be achieved by constructing one snc-desingularization of X, accompanied with the intersection…

We introduce and study the arithmetic function E_m(n), defined as the sum of the remainders of n when divided by the first m positive integers. Although the definition is elementary, the function encodes rich arithmetic structure. In this…

We study general methods to build forking-like notions in the framework of tame abstract elementary classes (AECs) with amalgamation. We show that whenever such classes are categorical in a high-enough cardinal, they admit a good frame: a…

For a nonempty polyhedral set $P\subset \mathbb R^d$, let $\mathcal F(P)$ denote the set of faces of $P$, and let $N(P,F)$ be the normal cone of $P$ at the nonempty face $F\in\mathcal F(P)$. We prove that the function $\sum_{F\in\mathcal…

Let $X_0, X_1, ..., X_k$ with $k \in \IN\cup\{\infty\}$ be sequence spaces $($finite or infinite dimensional$)$ over $\IC$ or $\IR$ with absolute norms $N_i$ for $i = 0, ..., k$, $($i.e., with 1-unconditional bases$)$ such that $\dim X_0 =…

Consider $S$, a set of $n$ points chosen uniformly at random and independently from the unit hypercube of dimension $t>2$. Order $S$ by using the Cartesian product of the $t$ standard orders of $[0,1]$. We determine a constant $\bar x(t)<e$…

Let U be a monster model and let D be a subset of U. Let (U,D) denote theexpansion of U with a new predicate for D. Write e(D) for the collection of all subsets C of U such that (U,C) is elementary equivalent to (U,D). We prove that if e(D)…

Two of the pillars of combinatorics are the notion of choosing an arbitrary subset of a set with $n$ elements (which can be done in $2^n$ ways), and the notion of choosing a $k$-element subset of a set with $n$ elements (which can be done…

A family of sets $\mathcal{A}$ is union-closed if it is finite and nonempty with member sets that are all finite and distinct (at least one of which is nonempty) and it satisfies the property $X, Y \in \mathcal{A} \implies X \cup Y \in…

We prove a version of Gauss's Lemma. It recursively constructs polynomials {c_k} for k=0,1,...,m+n, in Z[a_i,A_i,b_j,B_j] for i=0,...,m, and j=0,1,...,n, having degree at most (m+n choose m) in each of the four variable sets, such that…

Working in a variant of the intersection type assignment system of Coppo, Dezani-Ciancaglini and Venneri [1981], we prove several facts about sets of terms having a given intersection type. Our main result is that every strongly normalizing…

We introduce a notion of compatibility between constraint encoding and compositional structure. Phrased in the language of category theory, it is given by a "composable constraint encoding". We show that every composable constraint encoding…

Fix $d\geq2$ and let $f_{t}(z)=z^{d}+t$ be the family of polynomials parameterized by $t\in\mathbb{C}$. In this article, we will show that there exists a constant $C(d)$ such that for any $a,b\in\mathbb{C}$ with $a^{d}\neq b^{d}$, the…

Let $\{U(n)\}_{n \geq 0}$ be a sequence of independent random variables such that $U(n)$ is distributed uniformly on $\{0, 1, 2 \dots n\}$. The Ulam-Kac adder is the history-dependent random sequence defined by $X_{n + 1} = X_{n} +…

Utilizing spectral residues of parameterized, recursively defined sequences, we develop a general method for generating identities of composition sums. Specific results are obtained by focusing on coefficient sequences of solutions of first…

We use model theoretic techniques to construct explicit first-order axiomatizations for the classes of posets that can be represented as systems of sets, where the order relation is given by inclusion, and existing meets and joins of…

We obtain asymptotic formulas for the sums $\sum_{n_1,\ldots,n_k\le x} f((n_1,\ldots,n_k))$ and $ \sum_{n_1,\ldots,n_k\le x} f([n_1,\ldots,n_k])$ involving the gcd and lcm of the integers $n_1,\ldots,n_k$, where $f$ belongs to certain…