Antipodality properties of finite sets in Euclidean space

This is a survey of known results and still open problems on antipodal properties of finite sets in Euclidean space. The exposition follows historical lines and takes into consideration both metric and affine aspects.     

Intersection patterns of convex sets

LetK ₁,…K_n be convex sets inR ^d. For 0≦i denote byf _ithe number of subsetsS of {1,2,…,n} of cardinalityi+1 that satisfy ∩{K _i∶i∈S}≠Ø. We prove:Theorem.If f _d+r=0 for somer r>=0, then {fx161-1} This inequality was conjectured by Katchalski and Perles. Equality holds, e.g., ifK ₁=…=K_r=R^d andK _r+1,…,K_n aren?r hyperplanes in general position inR ^d. The proof uses multilinear techniques (exterior algebra). Applications to convexity and to extremal set theory are given.     

Intersection of independent regenerative sets

We investigate the nature of the intersection of two independent regenerative sets. The approach combines Bochners subordination and potential theory for a pair of Markov processes in duality. Received: 21 November 1997 / Revised version: 31 August 1998     

Intersection queries in sets of disks

In this paper we develop some new data structures for storing a set of disks that can answer different types of intersection queries efficiency. If the disks are non-intersecting we obtain a linear size data structure that can report allk disks intersecting a query line segment in timeO(n ⁺ +k), wheren is the number of disks,=log₂(1+5)–1 0.695, and is an arbitrarily small positive constant. If the segment is a full line, the query time becomesO(n +k). For intersecting disks we obtain anO(n logn) size data structure that can answer an intersection query in timeO(n ^2/3 log² n+k). We also present a linear size data structure for ray shooting queries, whose query time isO(n ).The research of the first two authors was supported by the ESPRIT Basic Research Action No. 3075 (project ALCOM). The work of the third author was supported byDimacs (Center for Discrete Mathematics and Theoretical Computer Science), a National Science Foundation Science and Technology Center — NSF-STC88-09648.     

Intersection of triadic Cantor sets with their translates— I. Fundamental properties

Motivated by Mandelbrot's [The Fractal Geometry of Nature, Freeman, San Francisco, 1983] idea of referring to lacunarity of Cantor sets in terms of departure from translation invariance, we study the properties of these translation sets and show how they can be used for a classification purpose. This first paper of a series of two will be devoted to set up the fundamental properties of Hausdorff measures of those intersection sets. Using the triadic expansion of the shifting number, we determine the fractal structure of intersection of triadic Cantor sets with their translates. We found that the Hausdorff measure of these sets forms a discrete spectrum whose non-zero values come only from those shifting numbers with a finite triadic expansion. We characterize this set of shifting numbers by giving a partition expression of it and the steps of its construction from a fundamental root set. Finally, we prove that intersection of Cantor sets with their translates verify a measure-conservation law with scales. The second paper will take advantage of the properties exposed here in order to utilize them in a classification context. Mainly, it will deal with the use of the discrete spectrum of measures to distinguish two Cantor-like sets of the same fractal dimension.     

On additive properties of product sets in an arbitrary finite field

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 .     

Intersection theorems for group divisible difference sets

Let D be an (m,n;k;λ₁,λ₂)-group divisible difference set (GDDS) of a group G, written additively, relative to H, i.e. D is a k-element subset of G, H is a normal subgroup of G of index m and order n and for every nonzero element g of G,?{(d₁,d₂)?,d₁,d₂?D,d₁?d₂=g}? is equal to λ₁ if g is in H, and equal to λ₂ if g is not in H. Let H₁,H₂,…,H_m be distinct cosets of H in G and S_i=D∩H_i for all i=1,2,…,m. Some properties of S₁,S₂,…,S_m are studied here. Table 1 shows all possible cardinalities of S_i's when the order of G is not greater than 50 and not a prime. A matrix characterization of cyclic GDDS's with λ₁=0 implies that there exists a cyclic affine plane of even order, say n, only if n is divisible by 4 and there exists a cyclic (n?1,$\text{1}\text{2}$n?1,$\text{1}\text{4}$n?1)-difference set.     

Intersection of a sequence of imbedded closed sets

A note on the metrical conditions for the intersection of imbedded bounded closed sets in Banach spaces to be nonempty.Translated from Matematicheskie Zametki, Vol. 3, No. 2, pp. 165–170, February, 1968.     

Intersection graphs of subgroups of finite groups

In this paper we classify finite groups with disconnected intersection graphs of subgroups. This solves a problem posed by Csákány and Pollák.     

Intersection of functorial subgroups in finite groups

Intersections of given maximal subgroups of finite groups are studied. General properties of the generalized Frattini subgroup are established with the help of functorial methods.     

Universal covers of finite sets

A recurrent problem in geometry, convexity, and combinatorics is to find universal covers for various classes of sets. (See [2] pp 84–88 for example.) This paper considers that problem for finite sets in the plane. Various covers are given including one which coversall finite sets, is closed, and has empty interior. The problem of covering a finite set or a similar copy of the set is also considered.     

Intersection sets,three-character multisets and associated codes

In this article we construct new minimal intersection sets in \(\mathrm {AG}(r,q^2)\) sporting three intersection numbers with hyperplanes; we then use these sets to obtain linear error correcting codes with few weights, whose weight enumerator we also determine. Furthermore, we provide a new family of three-character multisets in \(\mathrm {PG}(r,q^2)\) with r even and we also compute their weight distribution.     

Minimal covers of finite sets

We enumerate the minimal covers of a finite set S, classifying such covers by their cardinality, and also by the number of elements in S which they cover uniquely.