共查询到20条相似文献,搜索用时 539 毫秒
1.
Let M be a random rank-r matrix over the binary field , and let be its Hamming weight, that is, the number of nonzero entries of M.We prove that, as with r fixed and tending to a constant, we have that converges in distribution to a standard normal random variable. 相似文献
2.
4.
In this paper, we consider a certain class of inequalities for the partition function of the following form: which we call multiplicative inequalities. Given a multiplicative inequality with the condition that for at least one , we shall construct a unified framework so as to decide whether such a inequality holds or not. As a consequence, we will see that study of such inequalities has manifold applications. For example, one can retrieve log-concavity property, strong log-concavity, and the multiplicative inequality for considered by Bessenrodt and Ono, to name a few. Furthermore, we obtain an asymptotic expansion for the finite difference of the logarithm of , denoted by , which generalizes a result by Chen, Wang, and Xie. 相似文献
5.
6.
《Journal of Pure and Applied Algebra》2022,226(9):107058
Let R be a commutative noetherian ring of dimension d and M be a commutative, cancellative, torsion-free monoid of rank r. Then S-. Further, we define a class of monoids such that if is seminormal, then S-, where . As an application, we prove that for the Segre extension over R, S-. 相似文献
8.
9.
《Discrete Mathematics》2022,345(1):112640
We show that the lattice point enumerator satisfies for any bounded sets with integer points and all .We also prove that a certain family of compact sets, extending that of cubes , with , minimizes the functional , for any , among those bounded sets with given positive lattice point enumerator.Finally, we show that these new discrete inequalities imply the corresponding classical Brunn-Minkowski and isoperimetric inequalities for non-empty compact sets. 相似文献
10.
《Discrete Mathematics》2022,345(9):112970
11.
12.
13.
14.
《Discrete Mathematics》2023,346(4):113304
In 1965 Erd?s asked, what is the largest size of a family of k-element subsets of an n-element set that does not contain a matching of size ? In this note, we improve upon a recent result of Frankl and resolve this problem for and . 相似文献
15.
16.
17.
《Discrete Mathematics》2022,345(3):112731
Let be the matching number of a graph G. A characterization of the graphs with given maximum odd degree and smallest possible matching number is given by Henning and Shozi (2021) [13]. In this paper we complete our study by giving a characterization of the graphs with given maximum even degree and smallest possible matching number. In 2018 Henning and Yeo [10] proved that if G is a connected graph of order n, size m and maximum degree k where is even, then , unless G is k-regular and . In this paper, we give a complete characterization of the graphs that achieve equality in this bound when the maximum degree k is even, thereby completing our study of graphs with given maximum degree and smallest possible matching number. 相似文献
18.
19.
20.