Elementary density bounds for self-similar sets and application

Falconer[1] used the relationship between upper convex density and upper spherical density to obtain elementary density bounds for s-sets at H S-almost all points of the sets. In this paper, following Falconer[1], we first provide a basic method to estimate the lower bounds of these two classes of set densities for the self-similar s-sets satisfying the open set condition （OSC）, and then obtain elementary density bounds for such fractals at all of their points. In addition, we apply the main results to the famous classical fractals and get some new density bounds.     

Some results on the upper convex densities for the self-similar sets

In this paper, by means of a basic result concerning the estimation of the lower bounds of upper convex densities for the self-similar sets, we show that in the Sierpinski gasket, the minimum value of the upper convex densities is achieved at the vertices. In addition, we get new lower bounds of upper convex densities for the famous classical fractals such as the Koch curve, the Sierpinski gasket and the Cartesian product of the middle third Cantor set with itself, etc. One of the main results improves corresponding result in the relevant reference. The method presented in this paper is different from that in the work by Z. Zhou and L. Feng [The minimum of the upper convex density of the product of the Cantor set with itself, Nonlinear Anal. 68 (2008) 3439-3444].     

Category and dimensions for cut-out sets

In this paper, we study the modified box dimensions of cut-out sets that belong to a positive, nonincreasing and summable sequence. Noting that the family of such sets is a compact metric space under the Hausdorff metric, we prove that the lower modified box dimension equals zero and the upper modified box dimension equals the upper box dimension for almost all cut-out set in the sense of Baire category.     

On a generalization of distance sets

A subset X in the d-dimensional Euclidean space is called a k-distance set if there are exactly k distinct distances between two distinct points in X and a subset X is called a locally k-distance set if for any point x in X, there are at most k distinct distances between x and other points in X.Delsarte, Goethals, and Seidel gave the Fisher type upper bound for the cardinalities of k-distance sets on a sphere in 1977. In the same way, we are able to give the same bound for locally k-distance sets on a sphere. In the first part of this paper, we prove that if X is a locally k-distance set attaining the Fisher type upper bound, then determining a weight function w, (X,w) is a tight weighted spherical 2k-design. This result implies that locally k-distance sets attaining the Fisher type upper bound are k-distance sets. In the second part, we give a new absolute bound for the cardinalities of k-distance sets on a sphere. This upper bound is useful for k-distance sets for which the linear programming bound is not applicable. In the third part, we discuss about locally two-distance sets in Euclidean spaces. We give an upper bound for the cardinalities of locally two-distance sets in Euclidean spaces. Moreover, we prove that the existence of a spherical two-distance set in (d−1)-space which attains the Fisher type upper bound is equivalent to the existence of a locally two-distance set but not a two-distance set in d-space with more than d(d+1)/2 points. We also classify optimal (largest possible) locally two-distance sets for dimensions less than eight. In addition, we determine the maximum cardinalities of locally two-distance sets on a sphere for dimensions less than forty.     

轨道逼近时间集的密度

任意给定0pq1,证明了在符号系统中(进而在帐篷映射中)存在Mycielski集C,使得C中任意两个互异的点的轨道按照下密度p,上密度q的"速率"逼近.构造了线段上的连续映射,使其具有一个满Lebesgue测度的Mycielski集S,使得S中任意两个互异的点的轨道按照下密度p,上密度q的"速率"逼近.     

Inside S-inner product sets and Euclidean designs

A finite set X in the Euclidean space is called an s-inner product set if the set of the usual inner products of any two distinct points in X has size s. First, we give a special upper bound for the cardinality of an s-inner product set on concentric spheres. The upper bound coincides with the known lower bound for the size of a Euclidean 2s-design. Secondly, we prove the non-existence of 2- or 3-inner product sets on two concentric spheres attaining the upper bound for any d>1. The efficient property needed to prove the upper bound for an s-inner product set gives the new concept, inside s-inner product sets. We characterize the most known tight Euclidean designs as inside s-inner product sets attaining the upper bound.     

Algorithmic aspects of clique-transversal and clique-independent sets

A minimum clique-transversal set MCT(G) of a graph G=(V,E) is a set SV of minimum cardinality that meets all maximal cliques in G. A maximum clique-independent set MCI(G) of G is a set of maximum number of pairwise vertex-disjoint maximal cliques. We prove that the problem of finding an MCT(G) and an MCI(G) is NP-hard for cocomparability, planar, line and total graphs. As an interesting corollary we obtain that the problem of finding a minimum number of elements of a poset to meet all maximal antichains of the poset remains NP-hard even if the poset has height two, thereby generalizing a result of Duffas et al. (J. Combin. Theory Ser. A 58 (1991) 158–164). We present a polynomial algorithm for the above problems on Helly circular-arc graphs which is the first such algorithm for a class of graphs that is not clique-perfect. We also present polynomial algorithms for the weighted version of the clique-transversal problem on strongly chordal graphs, chordal graphs of bounded clique size, and cographs. The algorithms presented run in linear time for strongly chordal graphs and cographs. These mark the first attempts at the weighted version of the problem.     

Dimensions for random self–conformal sets

A set is called regular if its Hausdorff dimension and upper box–counting dimension coincide. In this paper, we prove that the random self–conformal set is regular almost surely. Also we determine the dimensions for a class of random self–conformal sets.     

D sets and IP rich sets in countable,cancellative abelian semigroups

We give combinatorial characterizations of IP rich sets (IP sets that remain IP upon removal of any set of zero upper Banach density) and D sets (members of idempotent ultrafilters, all of whose members have positive upper Banach density) in a general countable, cancellative abelian semigroup. We then show that the family of IP rich sets strictly contains the family of D sets.     

Cutting dense point sets in half

A halving hyperplane of a set S of n points in R ^d contains d affinely independent points of S so that equally many of the points off the hyperplane lie in each of the two half-spaces. We prove bounds on the number of halving hyperplanes under the condition that the ratio of largest over smallest distance between any two points is at most , δ some constant. Such a set S is called dense. In d = 2 dimensions the number of halving lines for a dense set can be as much as , and it cannot exceed . The upper bound improves over the current best bound of which holds more generally without any density assumption. In d = 3 dimensions we show that is an upper bound on the number of halving planes for a dense set. The proof is based on a metric argument that can be extended to d≥ 4 dimensions, where it leads to as an upper bound for the number of halving hyperplanes. Received March 22, 1995, and in revised form January 15, 1996.     

Banach upper density recurrent points of <Emphasis Type="Italic">C</Emphasis><Superscript>0</Superscript>-flows

Let X denote a compact metric space with distance d and F:X×R→X or F_t:X→X denote a C⁰-flow. From the point of view of ergodic theory, all important dynamical behaviors take place on a full measure set. The aim of this paper is to introduce the notion of Banach upper density recurrent points and to show that the closure of the set of all Banach upper density recurrent points equals the measure center or the minimal center of attraction for a C⁰-flow. Moreover, we give an example to show that the set of quasi-weakly almost periodic points can be included properly in the set of Banach upper density recurrent points, and point out that the set of Banach upper density recurrent points can be included properly in the set of recurrent points.     

Range sets for weak efficiency in multiobjective linear programming and a parametric polytopes intersection problem

ABSTRACT

The aim of this paper is to obtain the range set for a given multiobjective linear programming problem and a weakly efficient solution. The range set is the set of all values of a parameter such that a given weakly efficient solution remains efficient when the objective coefficients vary in a given direction. The problem was originally formulated by Benson in 1985 and left to be solved. We formulate an algorithm for determining the range set, based on some hard optimization problems. Due to toughness of these optimization problems, we propose also lower and upper bound approximation techniques. In the second part, we focus on topological properties of the range set. In particular, we prove that a range set is formed by a finite union of intervals and we propose upper bounds on the number of intervals. Our approach to tackle the range set problem is via the intersection problem of parametric polytopes. Thus, our results have much wider area of applicability since the intersection (and separability) problem of convex polyhedra is important in many fields of optimization.     

Sum-intersective sets

We study additive intersective properties of sparse subsets of integers. In particular, we prove that for every set S with counting function o(log n) there exists a set A with lower asymptotic density 1/2 such that A + A is disjoint from S. We also show that this result is best possible.     

Multiplicative structures in additively large sets

Previous research extending over a few decades has established that multiplicatively large sets (in any of several interpretations) must have substantial additive structure. We investigate here the question of how much multiplicative structure can be found in additively large sets. For example, we show that any translate of a set of finite sums from an infinite sequence must contain all of the initial products from another infinite sequence. And, as a corollary of a result of Renling Jin, we show that if A and B have positive upper Banach density, then A+B contains all of the initial products from an infinite sequence. We also show that if a set has a complement which is not additively piecewise syndetic, then any translate of that set is both additively and multiplicatively large in several senses.We investigate whether a subset of N with bounded gaps—a syndetic set—must contain arbitrarily long geometric progressions. We believe that we establish that this is a significant open question.     

Unique reducibility of multiple blocking sets

A weighted t-fold (n ? k)-blocking set B of PG(n, q) always contains a minimal weighted t-fold (n ? k)-blocking set. We prove that, if ${|B| < (t+1)q^{n-k} + \theta_{n-k-1}}$ , then the minimal weighted t-fold (n ? k)-blocking set contained in B is unique.     

Determinacy and weakly Ramsey sets in Banach spaces

We give a sufficient condition for a set of block subspaces in an infinite-dimensional Banach space to be weakly Ramsey. Using this condition we prove that in the Levy-collapse of a Mahlo cardinal, every projective set is weakly Ramsey. This, together with a construction of W. H. Woodin, is used to show that the Axiom of Projective Determinacy implies that every projective set is weakly Ramsey. In the case of we prove similar results for a stronger Ramsey property. And for hereditarily indecomposable spaces we show that the Axiom of Determinacy plus the Axiom of Dependent Choices imply that every set is weakly Ramsey. These results are the generalizations to the class of projective sets of some theorems from W. T. Gowers, and our paper ``Weakly Ramsey sets in Banach spaces.'

     

Sumsets contained in infinite sets of integers

If the positive integers are partitioned into a finite number of cells, then Hindman proved that there exists an infinite set B such that all finite, nonempty sums of distinct elements of B all belong to one cell of the partition. Erdös conjectured that if A is a set of integers with positive asymptotic density, then there exist infinite sets B and C such that B + C ? A. This conjecture is still unproved. This paper contains several results on sumsets contained in finite sets of integers. For example, if A is a set of integers of positive upper density, then for any n there exist sets B and F such that B has positive upper density, F has cardinality n, and B + F ? A.     

Minimal balanced sets and finite geometries

A balanced set is a collection of subsets of a finite set that can be weighted so as to cover the whole set uniformly. Minimal balanced sets are of interest in the theory of n-person games, in particular for the existence of outcomes that cannot be improved upon by any coalition (core of the game).The object of this paper is to determine the finite geometries which are minimal balanced sets. We prove that the dual of any t-design with t ? 2 is a minimal balanced set. In particular symmetrical 2-designs (as projective spaces, biplanes, etc.) are always minimal balanced sets. For 1-designs the problem becomes much more difficult, but it is for instance easy to prove that any partial geometry which is not the dual of a 2-Steiner system is never a minimal balanced set; in particular generalized quadrangles are never minimal balanced sets. For linear graphs the problem is completely solved: the dual of a connected linear graph is a minimal balanced set if and only if this linear graph is not bichromatic.     

On negative limit sets for one-dimensional dynamics

In this paper we study the structure of negative limit sets of maps on the unit interval. We prove that every α-limit set is an ω-limit set, while the converse is not true in general. Surprisingly, it may happen that the space of all α-limit sets of interval maps is not closed in the Hausdorff metric (and thus some ω-limit sets are never obtained as α-limit sets). Moreover, we prove that the set of all recurrent points is closed if and only if the space of all α-limit sets is closed.     

Measurable chromatic number of geometric graphs and sets without some distances in euclidean space

LetH be a set of positive real numbers. We define the geometric graphG _H as follows: the vertex set isR ⁿ (or the unit circleS ¹) andx, y are joined if their distance belongs toH. We define the measurable chromatic number of geometric graphs as the minimum number of classes in a measurable partition into independent sets. In this paper we investigate the difference between the notions of the ordinary and measurable chromatic numbers. We also prove upper and lower bounds on the Lebesgue upper density of independent sets.