Euclidean self-similar sets generated by geometrically independent sets

For every integer n>0, we consider all iterated function systems generated by n+1 Euclidean similarities acting on Rn whose fixed points form the set of vertices of an n-simplex, and characterize the nature of attractors of such iterated function systems in terms of contractivity factors of their generators.     

Some remarks on Euclidean tight designs

In this paper we present a new 4-dimensional tight Euclidean 5-design on 3 concentric spheres, together with a list of all known tight Euclidean designs which has been updated since the last survey paper by Bannai and Bannai (2009) [6]. We also examine whether each of all known tight Euclidean designs has the structure of a coherent configuration.     

Transitive sets in Euclidean Ramsey theory

A finite set X in some Euclidean space Rn is called Ramsey if for any k there is a d such that whenever Rd is k-coloured it contains a monochromatic set congruent to X. This notion was introduced by Erd?s, Graham, Montgomery, Rothschild, Spencer and Straus, who asked if a set is Ramsey if and only if it is spherical, meaning that it lies on the surface of a sphere. This question (made into a conjecture by Graham) has dominated subsequent work in Euclidean Ramsey theory.In this paper we introduce a new conjecture regarding which sets are Ramsey; this is the first ever ‘rival’ conjecture to the conjecture above. Calling a finite set transitive if its symmetry group acts transitively—in other words, if all points of the set look the same—our conjecture is that the Ramsey sets are precisely the transitive sets, together with their subsets. One appealing feature of this conjecture is that it reduces (in one direction) to a purely combinatorial statement. We give this statement as well as several other related conjectures. We also prove the first non-trivial cases of the statement.Curiously, it is far from obvious that our new conjecture is genuinely different from the old. We show that they are indeed different by proving that not every spherical set embeds in a transitive set. This result may be of independent interest.     

Rectification of sets in Euclidean spaces

We criticize traditional definitions of the arc length which require semi-continuity from below. Symmetric definitions of lower and uppern-lengths (n-dimensional volumes) are introduced for a wide class of sets in Euclidean spaces, and the additivity of both functionals is proved.     

Blocking sets in block designs

A lower bound is obtained for the cardinality of a blocking set in a non-symmetric block design. The known lower bound for blocking sets in symmetric block design is proved to hold (if and) only if the blocking set is a Baer subdesign.     

Orbits of the hyperoctahedral group as Euclidean designs

The hyperoctahedral group H in n dimensions (the Weyl group of Lie type B _n ) is the subgroup of the orthogonal group generated by all transpositions of coordinates and reflections with respect to coordinate hyperplanes.With e ₁ , ..., e _n denoting the standard basis vectors of ⁿ and letting x _k = e ₁ + ··· + e _k (k = 1, 2, ..., n), the set

Classification of some large sets and designs

In this paper, we briefly introduce an algorithm, based on the standard basis of trades, which has proven successful in the complete classification of certain combinatorial objects.     

Asymptotics of convex sets in Euclidean and hyperbolic spaces

We study convex sets C of finite (but non-zero) volume in Hn and En. We show that the intersection C_∞ of any such set with the ideal boundary of Hn has Minkowski (and thus Hausdorff) dimension of at most (n−1)/2, and this bound is sharp, at least in some dimensions n. We also show a sharp bound when C_∞ is a smooth submanifold of _∂∞Hn. In the hyperbolic case, we show that for any k?(n−1)/2 there is a bounded section S of C through any prescribed point p, and we show an upper bound on the radius of the ball centered at p containing such a section. We show similar bounds for sections through the origin of a convex body in En, and give asymptotic estimates as 1?k?n.     

On defining sets of full designs

A defining set of a t-(v,k,λ) design is a subcollection of its blocks which is contained in a unique t-design with the given parameters on a given v-set. A minimal defining set is a defining set, none of whose proper subcollections is a defining set. The spectrum of minimal defining sets of a design D is the set {|M|∣M is a minimal defining set of D}. The unique simple design with parameters is said to be the full design on v elements; it comprises all possible k-tuples on a v set. We provide two new minimal defining set constructions for full designs with block size k≥3. We then provide a generalisation of the second construction which gives defining sets for all k≥3, with minimality satisfied for k=3. This provides a significant improvement of the known spectrum for designs with block size three. We hypothesise that this generalisation produces minimal defining sets for all k≥3.     

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.     

Euclidean designs obtained from spherical embedding of coherent configurations

Coherent configurations are a generalization of association schemes. Motivated by the recent study of Q-polynomial coherent configurations, in this paper, we study the spherical embedding of a Q-polynomial coherent configuration into some eigenspace by a primitive idempotent. We present a necessary and sufficient condition when the embedding becomes a Euclidean $t$-design (on two concentric spheres) in terms of the Krein numbers for $t\le 4$. In addition, we obtain some Euclidean 2- or 3-designs from spherical embedding of coherent configurations including tight relative 4- or 5-designs in binary Hamming schemes and the union of derived designs of a tight 4-design in Hamming schemes.     

Boolean sums of sets of certain designs

In this note the author applies Boolean sum operation on sets of certain designs to get new series of designs.     

On multiple sum and product sets of finite sets of integers

Let $\text{A?}\text{Z}$ be a finite set of integers of cardinality |A|=N?2. Given a positive integer k, denote kA (resp. A^(k)) the set of all sums (resp. products) of k elements of A. We prove that for all b>1, there exists k=k(b) such that max(|kA|,|A^(k)|)>N^b. This answers affirmably questions raised in Erd?s and Szemerédi (Stud. Pure Math., 1983, pp. 213–218), Elekes et al. (J. Number Theory 83 (2) (2002) 194–201) and recently, by S. Konjagin (private communication). The method is based on harmonic analysis techniques in the spirit of Chang (Ann. Math. 157 (2003) 939–957) and combinatorics on graphs. To cite this article: J. Bourgain, M.-C. Chang, C. R. Acad. Sci. Paris, Ser. I 337 (2003).     

Optimization of the Hausdorff distance between sets in Euclidean space

Set approximation problems play an important role in many areas of mathematics and mechanics. For example, approximation problems for solvability sets and reachable sets of control systems are intensively studied in differential game theory and optimal control theory. In N.N. Krasovskii and A.I. Subbotin’s investigations devoted to positional differential games, one of the key problems was the problem of identification of solvability sets, which are maximal stable bridges. Since this problem can be solved exactly in rare cases only, the question of the approximate calculation of solvability sets arises. In papers by A.B. Kurzhanskii and F.L. Chernous’ko and their colleagues, reachable sets were approximated by ellipsoids and parallelepipeds.In the present paper, we consider problems in which it is required to approximate a given set by arbitrary polytopes. Two sets, polytopes A and B, are given in Euclidean space. It is required to find a position of the polytopes that provides a minimum Hausdorff distance between them. Though the statement of the problem is geometric, methods of convex and nonsmooth analysis are used for its investigation.One of the approaches to dealing with planar sets in control theory is their approximation by families of disks of equal radii. A basic component of constructing such families is best n-nets and their generalizations, which were described, in particular, by A.L. Garkavi. The authors designed an algorithm for constructing best nets based on decomposing a given set into subsets and calculating their Chebyshev centers. Qualitative estimates for the deviation of sets from their best n-nets as n grows to infinity were given in the general case by A.N. Kolmogorov. We derive a numerical estimate for the Hausdorff deviation of one class of sets. Examples of constructing best n-nets are given.     

Decomposing Euclidean space with a small number of smooth sets

Let the cardinal invariant denote the least number of continuously smooth -dimensional surfaces into which -dimensional Euclidean space can be decomposed. It will be shown to be consistent that is greater than . These cardinals will be shown to be closely related to the invariants associated with the problem of decomposing continuous functions into differentiable ones.

     

The discrete parts of approximately decidable sets in Euclidean spaces

It is shown that the classes of discrete parts, A ∩ ?^k, of approximately resp. weakly decidable subsets of Euclidean spaces, A ? ?^k, coincide and are equal to the class of ω‐r. e. sets which is well‐known as the first transfinite level in Ershov's hierarchy exhausting Δ⁰₂.