共查询到20条相似文献,搜索用时 21 毫秒
1.
In [3] a certain family of topological spaces was introduced on ultraproducts. These spaces have been called ultratopologies and their definition was motivated by model theory of higher order logics. Ultratopologies provide a natural extra topological structure for ultraproducts. Using this extra structure in [3] some preservation and characterization theorems were obtained for higher order logics. The purely topological properties of ultratopologies seem interesting on their own right. We started to study these properties in [2], where some questions remained open. Here we present the solutions of two such problems. More concretely we show 1. that there are sequences of finite sets of pairwise different cardinalities such that in their certain ultraproducts there are homeomorphic ultratopologies and 2. if A is an infinite ultraproduct of finite sets, then every ultratopology on A contains a dense subset D such that |D| < |A|. (© 2005 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim) 相似文献
2.
Peter Frankl 《Journal of Combinatorial Theory, Series A》1978,24(2):146-161
Let X = [1, n] be a finite set of cardinality n and let be a family of k-subsets of X. Suppose that any two members of intersect in at least t elements and for some given positive constant c, every element of X is contained in less than c || members of . How large || can be and which are the extremal families were problems posed by Erdös, Rothschild, and Szemerédi. In this paper we answer some of these questions for n > n0(k, c). One of the results is the following: let . Then whenever is an extremal family we can find a 7-3 Steiner system such that consists exactly of those k-subsets of X which contain some member of . 相似文献
3.
Zoltán Füredi 《Journal of Combinatorial Theory, Series A》1980,28(3):282-289
Let r be a positive integer. A finite family of pairwise intersecting r-sets is a maximal clique of order r, if for any set A ? , |A| ? r there exists a member E ? such that . For instance, a finite projective plane of order r ? 1 is a maximal clique. Let N(r) denote the minimum number of sets in a maximal clique of order r. We prove whenever a projective plane of order exists. This disproves the known conjecture N(r) ? r2 ? r + 1. 相似文献
4.
Joã o F. Queiró Eduardo M. Sà 《Proceedings of the American Mathematical Society》1996,124(1):259-264
In a real finite-dimensional vector space, we study families of sets such that every compact convex set in the space is the intersection of all members of the family that contains it.
5.
6.
Siberian Mathematical Journal - 相似文献
7.
8.
9.
H.J Ryser 《Journal of Combinatorial Theory, Series A》1973,14(1):79-92
Let X1, X2, …, Xm be finite sets. The present paper is concerned with the m2 ? m intersection numbers |Xi ∩ Xj| (i ≠ j). We prove several theorems on families of sets with the same prescribed intersection numbers. We state here one of our conclusions that requires no further terminology. Let T1, T2, …, Tm be finite sets and let m ? 3. We assume that each of the elements in the set union T1 ∪ T2 ∪ … ∪ Tm occurs in at least two of the subsets T1, T2, …, Tm. We further assume that every pair of sets Ti and Tj (i ≠ j) intersect in at most one element and that for every such pair of sets there exists exactly one set Tk (k ≠ i, k ≠ j) such that Tk intersects both Ti and Tj. Then it follows that the integer m = 2m′ + 1 is odd and apart from the labeling of sets and elements there exist exactly m′ + 1 such families of sets. The unique family with the minimal number of elements is {1}, {2}, …, {m′}, {1}, {2}, …, {m′}, {1, 2, …, m′}. 相似文献
10.
Vojtěch Rödl 《Graphs and Combinatorics》1990,6(2):187-195
The main result of this paper is a lemma which can be used to prove the existence of highchromatic subhypergraphs of large girth in various hypergraphs. In the last part of the paper we use amalgamation techniques to prove the existence for everyl, k 3 of a setA of integers such that the hypergraph having as edges all the arithmetic progressions of lengthk inA has both chromatic number and girth greater thanl. 相似文献
11.
While algorithms exist which produce optimal binary trees, there are no direct formulas for the cost of such trees. In this note, we give a formula for the cost of the optimal binary tree built on m nodes with weights 1, 2, 3,…, m. The simplicity of this proof suggests that one can try to compute the cost of optimal trees for other special classes of weights. 相似文献
12.
We investigate the approximating properties of sets in spaces normed over semifields. We establish criteria for sets to possess the minimization property in several classes of spaces. A set possesses this property if, for every element of the space, there is a sequence of elements of the set which give arbitrarily close approximations to the best approximation. 5 titles.Translated from Matematicheskie Zametki, Vol. 2, No. 5, pp. 523–530, November, 1967. 相似文献
13.
Erd?s, Horváth and Joó discovered some years ago that for some real numbers 1<q<2 there exists only one sequence ci of zeroes and ones such that ∑ciq−i=1. Subsequently, the set U of these numbers was characterized algebraically in [P. Erd?s, I. Joó, V. Komornik, Characterization of the unique expansions 1=∑q−ni and related problems, Bull. Soc. Math. France 118 (1990) 377-390] and [V. Komornik, P. Loreti, Subexpansions, superexpansions and uniqueness properties in non-integer bases, Period. Math. Hungar. 44 (2) (2002) 195-216]. We establish an analogous characterization of the closure of U. This allows us to clarify the topological structure of these sets: is a countable dense set of , so the latter set is perfect. Moreover, since U is known to have zero Lebesgue measure, is a Cantor set. 相似文献
14.
15.
16.
Qing Gu 《Proceedings of the American Mathematical Society》2000,128(10):2973-2979
The question of which groups are isomorphic to groups of interpolation maps for interpolation families of wavelet sets was raised by Dai and Larson. In this article it is shown that any finite group is isomorphic to a group of interpolation maps for some interpolation family of wavelet sets.
17.
Summary A new class of sets called πgs-closed sets is introduced and its properties are studied. Moreover the notions of πgs-T1/2 spaces and πgs-continuity are introduced. 相似文献
18.
It is proved that for any two subsets A and B of an arbitrary finite field $
\mathbb{F}_q
$
\mathbb{F}_q
such that |A||B| > q, the identity 10AB = $
\mathbb{F}_q
$
\mathbb{F}_q
holds. Under the assumption |A||B| ⩾2q, this improves to 8AB = $
\mathbb{F}_q
$
\mathbb{F}_q
. 相似文献
19.
Some topological properties of support points of convex sets 总被引:1,自引:0,他引:1
R. R. Phelps 《Israel Journal of Mathematics》1972,13(3-4):327-336
It is shown, as a corollary to Trojanski’s renorming theorem, that the set of support points (of certain closed convex sets)
is connected. Some connectedness properties are established for support functionals, and it is also shown that the support
points form an Fσ. 相似文献