Let be a family of 2 n +1 subsets of a 2 n -element set. Then the number of disjoint pairs in is bounded by (1+ o (1))2 2 n . This proves an old conject... N Alon,P Frankl - 《Graphs & Combinatorics》 被引量: 67发表: 1985年 On large families of subsets of the set ...
We consider the Minkowski sum of subsets of integer lattice, each of which is a set of integer points of a face of an extended submodular [Kashiwabara-Takabatake, Discrete Appl. Math. 131 (2003) 433] integer polyhedron supported by a common positive vector. We show a sufficient condition ...
用3sat-证明-subset-sum-是np-complete CMPSCI611:The SUBSET-SUM Problem Lecture18 We begin today with the problem we didn’t get to at the end of last lecture–the SUBSET-SUM problem,which we also saw back in Lecture8.The input to SUBSET-SUM is a set of numbers{a1,...,a n}and a...
Here are examples of what you would use COUNT for:以下是将COUNT⽤于以下⽤途的⽰例：Counting all rows in a table (no group by required)计算表中的所有⾏(不需要按组)Counting the totals of subsets of data (requires a Group By section of the statement)计算数据⼦集的总数(需要语句的“...
We then give two applications of these results. Our first application allows us to write down a formula for the number of orbits under the natural action ofAut(G)on the set of sum-free subsets ofGof the largest cardinality whenGis of the form(Z/mZ)r, with all prime divisors ofm...
It is shown that the set {1,2,...,n} contains at most 2n/2-2-28nmaximal sum-free subsets, provided n is large enough. T? Schoen - 《Proceedings of the American Mathematical Society》 被引量: 40发表: 2001年 On the number of sum-free sets in a segment of positive integers. Exami...
Partition of a set into K subsets with equal sum Given an integer array of N elements, the taskisto dividethisarray into K non-empty subsets such that the sum of elements inevery subsetissame. All elements ofthisarray should be part of exactly one partition....
FAQ: Is the Supremum of the Sum of Two Sets Equal to the Sum of their Suprema? 1. What does "sup" stand for in the equation "Sup C = sup A + sup B"? "Sup" stands for "supremum", which is a mathematical term for the least upper bound of a set. In this...
nition. A collection M of subsets of a set X is called a σ -algebra in X if M has the following properties: 1. X ∈ M. 2. A ∈ M implies A{ ∈ M. 3. If A is a countable collection of sets in M, then A ∈ M. If M is a σ -algebra in X , then X is called a...
We derive that, on a four-letter alphabet, the number of Abelian square-free words of eac... A Carpi - 《Discrete Applied Mathematics》 被引量: 67发表: 1998年 The number of maximal sum-free subsets of integers Cameron and Erd艖s raised the question of how many maximal sum-free sets ...