惯性聚合 高效追踪和阅读你感兴趣的博客、新闻、科技资讯
阅读原文 在惯性聚合中打开

推荐订阅源

月光博客
月光博客
有赞技术团队
有赞技术团队
S
SegmentFault 最新的问题
宝玉的分享
宝玉的分享
量子位
小众软件
小众软件
The Cloudflare Blog
奇客Solidot–传递最新科技情报
奇客Solidot–传递最新科技情报
OSCHINA 社区最新新闻
OSCHINA 社区最新新闻
大猫的无限游戏
大猫的无限游戏
C
Check Point Blog
G
Google Developers Blog
博客园 - 叶小钗
H
Help Net Security
Jina AI
Jina AI
Y
Y Combinator Blog
Last Week in AI
Last Week in AI
GbyAI
GbyAI
让小产品的独立变现更简单 - ezindie.com
让小产品的独立变现更简单 - ezindie.com
Apple Machine Learning Research
Apple Machine Learning Research
MyScale Blog
MyScale Blog
T
Tailwind CSS Blog
钛媒体:引领未来商业与生活新知
钛媒体:引领未来商业与生活新知
Vercel News
Vercel News

math.CO updates on arXiv.org

Complement Submodular Information Measures for Balanced and Robust Data Selection A Proof of a Conjecture on Positive and Negative Square Energies of Unicyclic Graphs Laplacian Spectrum of the Weakly Zero-Divisor Graph of a Finite Commutative Ring An identity for second Eulerian numbers via lattice-point counting $t$-tone edge coloring of graphs Constructing Maximal Bumpless Pipedreams for Double Grothendieck Polynomials Mubayi's Polynomial-Ideal Conjecture and Cover-Ideal Turán Methods Implicit Binarization via Complex Phase Dynamics in Combinatorial Optimization The limits of Schur multipliers in Pólya conversion problems for the $q$-permanent function Universality theorems for generalized splines Framing Triangulations for Arbitrary Integer Flow Polytopes On the Common Generalization of Gentle Algebras and Framed Directed Acyclic Graphs The complexity of frugal digraph homomorphisms Chaotic and periodic behavior of jeu de taquin on infinite Young tableaux Enumerating Pattern Avoiding Parking Functions Incidence toric ideals and three-point functions Unique Winning Opening Move in Three-Row Chomp Strong majority colorings of graphs A Balancing Theorem for Spanning Trees of Rectangular Grid Graphs Spectral radius and edge-disjoint connected factors of graphs New invariants for rank metric codes, with applications to the classification of rank two semifields of order 256 Flexible DP-4-coloring of planar graphs without 4-cycles and intersecting triangles Balanced intersection size distributions in projective planes List Reconstruction Problem with List Size Two Is Dimensionality a Barrier for Retrieval Models? The INIEP: Irreducible and Positive Realizations The number of Pfaffian orientations on punctured polygonally cellulated surfaces Explicit Construction of Polytopes whose Ehrhart Polynomials Realize any Given Sign Pattern Finite-state enumeration of adjacency-constrained 132-avoiding permutations AMDS and quantum AMDS Constacyclic codes of length $4p^ς$ over $\mathbb{F}_{{p}^{m}}$
Inclusion-Exclusion-Like identities
Muneerah Al Nuwairan · 2019-11-09 · via math.CO updates on arXiv.org

An expression $E(X_{1},...,X_{n})$ built using union, intersection, and complements is called inclusion-exclusion-like if, like the union in the exclusion-inclusion principle, there are constants $c_{1},c_{2},...,c_{n}$ so that for any sequence of sets${ A=(A_{1},...,A_{n})}$ the cardinality of ${ E(A_{1},...,A_{n})}$ can be expressed as $\left|E(A_{1},...,A_{n})\right|=$$\sum_{k=1}^{n}c_{k}i_{n,k}(A)$ where $i_{n,k}(A)=\sum_{I\subseteq\overline{n},\left|I=k\right|}^{n}\left|\cap_{i\in I}A_{i}\right|$ is the sum of the cardinalities of all intersections of $k$ sets in the sequence $A$. In this paper, we construct, from the expression $E$, a set of nonempty subsets of $\left\{ 1,\ldots,n\right\} $ called the characteristic set of $E$, and using this set to give a necessary and sufficient condition for the expression to be inclusion-exclusion-like . Furthermore, we give a method for determining the constants $c_{1},c_{2},...,c_{n}$ in the expression for the cardinality of ${ E(A_{1},...,A_{n})}$ when it exists. The content of the paper is illustrated by a simple detailed example given in the introduction.