关于有限Abelian群的生成子集的基数

假若G =Z_m1 Z_m2… Z_mr 为 (m₁, m₂,…, m_r)型Abelian群, 其中Z_mi 为 m_i 阶的循环群且1≤i≤ r, m₁ |m₂|…| m_r, S 为G 的满足0∈ S=-S 的生成子集. 如果 |S|>|G|/ρ, 其中ρ≥l m_r /2l且m_r=e(G) 为群 G 的所有元素的阶的最小公倍数, 则ρS=G. 更进一步作者推广了Klopsch与lev ^[1]的一个结论,有:若 G=Z₂Z_m 为 (2, m) 型 Abelian 群(m ≥8), 则 t_m/2(G)=0.     

子集的交叉t－相交定理

设Ｘ为一个ｎ元集合，Ｃｎｋ为Ｘ的所有ｋ元子集全体，若Ａ∈Ａ，Ｂ∈Ｂ有｜Ａ∩Ｂ｜≥ｔ，则称（Ａ，Ｂ）为一个交叉ｔ－相交子集族．本文得到最大交叉ｔ－相交子集族和最大非空交叉２－相交子集族．证明如下两个结论．（１）若（Ａ，Ｂ）为一个交叉ｔ－相交子集族，且ａ≤ｂ及ａ＋ｂ≤ｎ＋ｔ－１，则｜Ａ＋Ｂ｜≤ｍａｘ｛（ｂｎ），（ａｎ）｝，且当（Ａ；Ｂ）＝（φ，Ｃｎｂ）或（Ｃｎａ，φ）时达到上界．（２）若（Ａ，Ｂ）为一个交叉２－相交子集族，且ａ＜ｂ，ａ＋ｂ≤ｎ－１及（ｎ，ａ，ｂ）≠（２ｉ，ｉ－１，ｉ）（ｉ为任意正整数），又Ａ，Ｂ均非空，则｜Ａ＋Ｂ｜≤１＋（ｂｎ）－（ｂ（ｎ－ａ））－ａ（（ｂ－１）（ｎ－ａ））且当（Ａ，Ｂ）＝（｛Ａ｝，Ｃｎｂ－｛Ｂ｜｜Ｂ｜＝ｂ，｜Ａ∩Ｂ｜≤１｝）时达到上界．     

关于G连通子集

G连通子集有三种不同的定义方式, 建立了这三种G连通子集之间的关系, 并纠正了■(2012)的一些错误.     

R的紧致子集的一个刻画

借助离散子集和相对离散子集的概念,可给出R的紧致子集的一个刻画,证明了R的子集E是紧致子集当且仅当E的每一相对离散子集是有限手集。     

关于正规Boole矩阵行空间的的基数

称Ｂｏｏｌｅ矩阵Ａ是正规是，是指Ａ的行秩与列秩相等。本文主要得到两个结果。第一，推广了Ｊ．Ｋｏｎｉｅｃｚｎｙ在Ｓｅｍｉｇｒｏｕｐ ｆＯＲＵＭ，ｖｏｌ．４４（１９９２）发表的论文Ｏｎ ｃａｒｄｉｎａｌｉｔｉｅｓ ｏｆ ｒｏｗ ｓｐａｃｅ ｏｆ Ｂｏｏｌｅａｎ ｍａｔｒｉｃｅｓ的重要结果。第二，若ｎ阶Ｂｏｏｌｅ矩阵的行空间基数大于２＾ｎ－１－２，则Ａ必是正规的。     

一种改进遗传算法在最大独立子集问题中的应用

最大独立子集问题是组合优化问题中的一个重要问题,该问题是一个NP难题,其目标是在一个环图中找到一个最大的独立子集.提出了一种改进的遗传算法来解决这个问题,用一种基于条件的遗传算子来代替通常的基于概率的遗传算子.实验结果表明提出的算法是有效的.     

集合与子集

集合是数学中的一个不定义的概念，它是现代数学的基础．从某种意义上讲，数学的各个分支就是建立在各种满足特定条件的集合之上的．因此，充分认识集合的概念和性质，有助于加深对数学本质的理解．     

Fuzzy幂群的基数定理

文（１）提出了幂群的概念，给出了幂群中各元素是等势的基数定理，文（２）提出了Ｆｕｚｚｙ幂群的概念，但没研究其中各元素的基数问题，本文深入研究这一问题，得到了由Ｄ．Ｄｕｂｏｉｓ等在文（３）中提出的和由李洪兴等在文（４）中提出的两种Ｆｕｚｚｙ集基数形式下的Ｆｕｚｚｙ幂群的基数定理，并给出了Ｆｕｚｚｙ幂群中与基数有关的若干结果。     

Some applications of a cardinality estimate for a certain configuration

Two configurations are constructed and the cardinality of one of them is estimated in terms of that of the other. The estimate thus obtained is applied to certain combinatorial problems. Translated fromMatematicheskie Zametki, Vol. 63, No. 5, pp. 729–736, May, 1998.     

On the projectivity of threefolds

Let be a smooth complete three-dimensional algebraic variety (defined over an algebraically closed field ). We show that is projective if it contains a divisor which is positive on the cone of effective curves.

     

On sums of sparse prime subsets

For arbitrary c00, if A is a subset of the primes less than x with cardinality δx(logx)-1, δ≥(logx)-c0, then there exists a positive constant c such that the cardinality of A+A is larger than cδx(loglogx)-1.     

Exploring cardinality in the era of touchscreen-based technology

This paper explores how a young child (56 m) builds an understanding of the cardinality principle through communicative, touchscreen-based activities involving talk, gesture and body engagement working via multimodal, touchscreen interface using contemporary mobile technology. Drawing upon Nemirovsky's perceptuomotor integration theoretical lens and other foundational aspects of Husserlian phenomenology, we present an in-depth case study of a preschool child developing mathematical expertise and tool fluency using an iPad application called TouchCounts to operate with cardinal numbers. Overall, this study demonstrates that the one-on-one multimodal touch, sight and auditory feedback via a touchscreen device can serve to assist in a child's development of cardinality.     

Entropy and set cardinality inequalities for partition‐determined functions

A new notion of partition‐determined functions is introduced, and several basic inequalities are developed for the entropies of such functions of independent random variables, as well as for cardinalities of compound sets obtained using these functions. Here a compound set means a set obtained by varying each argument of a function of several variables over a set associated with that argument, where all the sets are subsets of an appropriate algebraic structure so that the function is well defined. On the one hand, the entropy inequalities developed for partition‐determined functions imply entropic analogues of general inequalities of Plünnecke‐Ruzsa type. On the other hand, the cardinality inequalities developed for compound sets imply several inequalities for sumsets, including for instance a generalization of inequalities proved by Gyarmati, Matolcsi and Ruzsa (2010). We also provide partial progress towards a conjecture of Ruzsa (2007) for sumsets in nonabelian groups. All proofs are elementary and rely on properly developing certain information‐theoretic inequalities. © 2011 Wiley Periodicals, Inc. Random Struct. Alg., 40, 399–424, 2012     

Local analysis,cardinality, and split trick of quasi-biorthogonal frame wavelets

The notion of quasi-biorthogonal frame wavelets is a generalization of the notion of orthogonal wavelets. A quasi-biorthogonal frame wavelet with the cardinality r consists of r pairs of functions. In this paper we first analyze the local property of the quasi-biorthogonal frame wavelet and show that its each pair of functions generates reconstruction formulas of the corresponding subspaces. Next we show that the lower bound of its cardinalities depends on a pair of dual frame multiresolution analyses deriving it. Finally, we present a split trick and show that any quasi-biorthogonal frame wavelet can be split into a new quasi-biorthogonal frame wavelet with an arbitrarily large cardinality. For generality, we work in the setting of matrix dilations.     

Factoring by subsets of cardinality of prime power

Rédei's theorem asserts that if a finite abelian group is expressed as a direct product of subsets of prime cardinality, then at least one of the factors must be periodic. (A periodic subset is a direct product of some subset and a nontrivial subgroup.) A. D. Sands proved that if a finite cyclic group is the direct product of subsets each of which has cardinality that is a power of a prime, then at least one of the factors is periodic. We prove that the same conclusion holds if a general finite abelian group is factored as a direct product of cyclic subsets of prime cardinalities and general subsets of cardinalities that are powers of primes provided that the components of the group corresponding to these latter primes are cyclic.     

带基数约束的次模+超模(BP)函数最大化问题的流算法

本文研究在基数约束下具有单调性的次模+超模函数最大化问题的流模型。该问题在数据处理、机器学习和人工智能等方面都有广泛应用。借助于目标函数的收益递减率（$\gamma$）,我们设计了单轮读取数据的过滤-流算法,并结合次模、超模函数的全局曲率（$\kappa^{g}$）得到算法的近似比为$\min\left\{\frac{（1-\varepsilon）\gamma}{2^{\gamma}},1-\frac{\gamma}{2^{\gamma}（1-\kappa^{g}）^{2}}\right\}$。数值实验验证了过滤-流算法对BP最大化问题的有效性并且得出：次模函数和超模函数在同量级条件下,能保证在较少的时间内得到与贪婪算法相同的最优值。     

带基数约束的次模+超模(BP)函数最大化问题的流算法

本文研究在基数约束下具有单调性的次模+超模函数最大化问题的流模型。该问题在数据处理、机器学习和人工智能等方面都有广泛应用。借助于目标函数的收益递减率（$\gamma$）,我们设计了单轮读取数据的过滤-流算法,并结合次模、超模函数的全局曲率（$\kappa^{g}$）得到算法的近似比为$\min\left\{\frac{（1-\varepsilon）\gamma}{2^{\gamma}},1-\frac{\gamma}{2^{\gamma}（1-\kappa^{g}）^{2}}\right\}$。数值实验验证了过滤-流算法对BP最大化问题的有效性并且得出：次模函数和超模函数在同量级条件下,能保证在较少的时间内得到与贪婪算法相同的最优值。