共查询到20条相似文献,搜索用时 0 毫秒
1.
An increasing sequence of positive integers {n1, n2, …} is called a sum-free sequence if every term is never a sum of distinct smaller terms. We prove that there exist sum-free sequences {nk} with polynomial growth and such that limk→∞ nk+1/nk = 1. 相似文献
2.
3.
H Groemer 《Journal of Combinatorial Theory, Series A》1983,34(1):71-79
Let (Ci) be a sequence of closed convex subsets of Euclidean n-space En. This paper is concerned with the problem of finding necessary and sufficient conditions that the sets Ci can be rearranged (by the application of rigid motions or translations) so as to cover all or almost all En. Particular attention is paid to the problems that arise if the sets Ci are permitted to be unbounded. It is shown that under certain conditions this covering problem can be reduced to the already thoroughly investigated case of compact sets with bounded diameter set{d(Ci)}, and it is also proved that there are two additional covering possibilities if such a reduction is not possible. 相似文献
4.
5.
Sergei Bezrukov Dalibor Fronček Steven J. Rosenberg Petr Kovář 《Discrete Mathematics》2008,308(2-3):319-323
6.
Assuming the existence of a Mahlo cardinal, we produce a generic extension of Gödel’s constructible universe L, in which the \(\textit{GCH}\) holds and the transfer principles \((\aleph _2, \aleph _0) \rightarrow (\aleph _3, \aleph _1)\) and \((\aleph _3, \aleph _1) \rightarrow (\aleph _2, \aleph _0)\) fail simultaneously. The result answers a question of Silver from 1971. We also extend our result to higher gaps. 相似文献
7.
8.
We classify finite 2-groupsG possessing an involution which is contained in a unique subgroup of order 4 inG. This answers a question of N. Blackburn about finite 2-groups. We show that the extended Blackburn’s problem is reduced
to the outstanding problem ofp-group theory to classify 2-groups with exactly three involutions. 相似文献
9.
10.
11.
We consider finite lattice coverings of strictly convex bodies K. For planar centrally symmetric K we characterize the finite arrangements C
n
such that conv , where C
n
is a subset of a covering lattice for K (which satisfies some natural conditions). We prove that for a fixed lattice the optimal arrangement (measured with the parametric
density) is either a sausage, a so-called double sausage or tends to a Wulff-shape, depending on the parameter. This shows
that the Wulff-shape plays an important role for packings as well as for coverings. Further we give a version of this result
for variable lattices. For the Euclidean d-ball we characterize the lattices, for which the optimal arrangement is a sausage, for large parameter.
Received 19 May 1999. 相似文献
12.
We study the module category of a certain Galois covering of a cluster-tilted algebra which we call the cluster repetitive algebra. Our main result compares the module categories of the cluster repetitive algebra of a tilted algebra C and the repetitive algebra of C, in the sense of Hughes and Waschbüsch. 相似文献
13.
14.
15.
16.
17.
18.
F.R.K. Chung 《Discrete Mathematics》1980,30(2):89-93
Let ρ(n) denote the smallest integer with the property that any graph with n vertices can be covered by ρ(n) complete bipartite subgraphs. We prove a conjecture of J.-C. Bermond by showing for any positive ?. 相似文献
19.
20.