Minimal Kakeya Sets

Blokhuis and Mazzocca (A. Blokhuis and F. Mazzocca, The finite field Kakeya problem (English summary). Building bridges. Bolyai Soc Math Stud 19 (2008) 205–218) provide a strong answer to the finite field analog of the classical Kakeya problem, which asks for the minimum size of a point set in an affine plane π that contains a line in every direction. In this article, we consider the related problem of minimal Kakeya sets, namely Kakeya sets containing no smaller Kakeya sets, and provide an interesting infinite family of minimal Kakeya sets that are not of extremal size.     

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.     

The Kakeya problem: a gap in the spectrum and classification of the smallest examples

Kakeya sets in the affine plane $\mathrm AG (2,q)$ are point sets that are the union of lines, one through every point on the line at infinity. The finite field Kakeya problem asks for the size of the smallest Kakeya sets and the classification of these Kakeya sets. In this article we present a new example of a small Kakeya set and we give the classification of the smallest Kakeya sets up to weight $\frac{q(q+2)}{2}+\frac{q}{4}$ , both in case $q$ even.     

Kakeya sets in finite affine spaces

We construct Kakeya sets in AG(n,q), where q is even and n?2, whose points are zeros of a polynomial of degree q.     

New bounds for Kakeya problems

We establish new estimates on the Minkowski and Hausdorff dimensions of Kakeya sets and we obtain new bounds on the Kakeya maximal operator.     

GEOMETRY AND DIMENSION OF SELF—SIMILAR SET

The authors show that the self-similar set for a finite family of contractive similitudes (similarities, i.e., |fi(x) - fi(y)| = αi|x - y|, x,y ∈ RN, where 0 < αi < 1) is uniformly perfect except the case that it is a singleton. As a corollary, it is proved that this self-similar set has positive Hausdorff dimension provided that it is not a singleton. And a lower bound of the upper box dimension of the uniformly perfect sets is given. Meanwhile the uniformly perfect set with Hausdorff measure zero in its Hausdorff dimension is given.     

Finite-tight sets

We introduce two notions of tightness for a set of measurable functions — the finite-tightness and the Jordan finite-tightness with the aim to extend certain compactness results (as biting lemma or Saadoune-Valadier’s theorem of stable compactness) to the unbounded case. These compactness conditions highlight their utility when we look for some alternatives to Rellich-Kondrachov theorem or relaxed lower semicontinuity of multiple integrals. Finite-tightness locates the great growths of a set of measurable mappings on a finite family of sets of small measure. In the Euclidean case, the Jordan finite-tight sets form a subclass of finite-tight sets for which the finite family of sets of small measure is composed by d-dimensional intervals. The main result affirms that each tight set H ⊆ W ^1,1 for which the set of the gradients ∇H is a Jordan finite-tight set is relatively compact in measure. This result offers very good conditions to use fiber product lemma for obtaining a relaxed lower semicontinuity condition.      

Fractal Weyl laws for asymptotically hyperbolic manifolds

For asymptotically hyperbolic manifolds with hyperbolic trapped sets we prove a fractal upper bound on the number of resonances near the essential spectrum, with power determined by the dimension of the trapped set. This covers the case of general convex cocompact quotients (including the case of connected trapped sets) where our result implies a bound on the number of zeros of the Selberg zeta function in disks of arbitrary size along the imaginary axis. Although no sharp fractal lower bounds are known, the case of quasifuchsian groups, included here, is most likely to provide them.     

A cohesive set which is not high

We study the degrees of unsolvability of sets which are cohesive (or have weaker recursion-theoretic “smallness” properties). We answer a question raised by the first author in 1972 by showing that there is a cohesive set A whose degree a satisfies a' = 0″ and hence is not high. We characterize the jumps of the degrees of r-cohesive sets, and we show that the degrees of r-cohesive sets coincide with those of the cohesive sets. We obtain analogous results for strongly hyperimmune and strongly hyperhyperimmune sets in place of r-cohesive and cohesive sets, respectively. We show that every strongly hyperimmune set whose degree contains either a Boolean combination of ∑2 sets or a 1-generic set is of high degree. We also study primitive recursive analogues of these notions and in this case we characterize the corresponding degrees exactly. MSC: 03D30, 03D55.     

Connected Domatic Number in Planar Graphs

A dominating set in a graph G is a connected dominating set of G if it induces a connected subgraph of G. The connected domatic number of G is the maximum number of pairwise disjoint, connected dominating sets in V(G). We establish a sharp lower bound on the number of edges in a connected graph with a given order and given connected domatic number. We also show that a planar graph has connected domatic number at most 4 and give a characterization of planar graphs having connected domatic number 3.     

A refinement of multivariate value set bounds

Over finite fields, if the image of a polynomial map is not the entire field, then its cardinality can be bounded above by a significantly smaller value. Earlier results bound the cardinality of the value set using the degree of the polynomial, but more recent results make use of the powers of all monomials.In this paper, we explore the geometric properties of the Newton polytope and show how they allow for tighter upper bounds on the cardinality of the multivariate value set. We then explore a method which allows for even stronger upper bounds, regardless of whether one uses the multivariate degree or the Newton polytope to bound the value set. Effectively, this provides improvement of a degree matrix-based result given by Zan and Cao, making our new bound the strongest upper bound thus far.     

A construction of interpolating wavelets on invariant sets

We introduce the concept of a refinable set relative to a family of contractive mappings on a metric space, and demonstrate how such sets are useful to recursively construct interpolants which have a multiscale structure. The notion of a refinable set parallels that of a refinable function, which is the basis of wavelet construction. The interpolation points we recursively generate from a refinable set by a set-theoretic multiresolution are analogous to multiresolution for functions used in wavelet construction. We then use this recursive structure for the points to construct multiscale interpolants. Several concrete examples of refinable sets which can be used for generating interpolatory wavelets are included.

     

扰动模糊集的粗糙度

首先,将扰动模糊集和粗糙集理论相结合,提出了粗糙扰动模糊集的概念并研究了其基本性质.接着,通过引进扰动模糊集水平上、下边界区域的概念,克服了粗糙集理论中普遍存在的两个集合的上近似的交不等于两个集合的交的上近似(两个集合的下近似的并不等于两个集合的并的下近似)的缺陷.最后,定义了依参数的扰动模糊集的粗糙度的定义,讨论了其基本性质.     

Locating and paired-dominating sets in graphs

In this paper, we continue the study of paired-domination in graphs introduced by Haynes and Slater [T.W. Haynes, P.J. Slater, Paired-domination in graphs, Networks 32 (1998), 199–206]. A paired-dominating set of a graph G with no isolated vertex is a dominating set S of vertices whose induced subgraph has a perfect matching. We consider paired-dominating sets which are also locating sets, that is distinct vertices of G are dominated by distinct subsets of the paired-dominating set. We consider three variations of sets which are paired-dominating and locating sets and investigate their properties.     

Separating invariants and local cohomology

The study of separating invariants is a recent trend in invariant theory. For a finite group acting linearly on a vector space, a separating set is a set of invariants whose elements separate the orbits of G. In some ways, separating sets often exhibit better behavior than generating sets for the ring of invariants. We investigate the least possible cardinality of a separating set for a given G-action. Our main result is a lower bound that generalizes the classical result of Serre that if the ring of invariants is polynomial then the group action must be generated by pseudoreflections. We find these bounds to be sharp in a wide range of examples.     

On a variant of the Kakeya problem in {\mathbb{R}}

We prove that the sharp lower bounds of the Minkowski and Hausdorff dimensions of circular Kakeya sets in ${\mathbb{R}}$ are 1/2 and 0 respectively.     

Relation between spectral classes of a self-similar Cantor set

A self-similar Cantor set is completely decomposed as a class of the lower (upper) distribution sets. We give a relationship between the distribution sets in the distribution class and the subsets in a spectral class generated by the lower (upper) local dimensions of a self-similar measure. In particular, we show that each subset of a spectral class is exactly a distribution set having full measure of a self-similar measure related to the distribution set using the strong law of large numbers. This gives essential information of its Hausdorff and packing dimensions. In fact, the spectral class by the lower (upper) local dimensions of every self-similar measure, except for a singular one, is characterized by the lower or upper distribution class. Finally, we compare our results with those of other authors.     

One-Parameter Families of Feasible Sets in Semi-infinite Optimization

Feasible sets in semi-infinite optimization are basically defined by means of infinitely many inequality constraints. We consider one-parameter families of such sets. In particular, all defin-ing functions - including those defining the index set of the inequality constraints - will depend on a parameter. We note that a semi-infinite problem is a two-level problem in the sense that a point is feasible if and only if all global minimizers of a corresponding marginal function are nonnegative. For a quite natural class of mappings we characterize changes in the global topological structure of the corresponding feasible set as the parameter varies. As long as the index set (-mapping) of the inequality constraints is lower semicontinuous, all changes in topology are those which generically appear in one-parameter sets defined by finitely many constraints. In the case, however, that some component of the mentioned index set is born (or vanishes), the topological change is of global nature and is not controllable. In fact, the change might be as drastic as that when adding or deleting an (arbitrary) inequality constraint.     

Dual blocking sets in projective and affine planes

A dual blocking set is a set of points which meets every blocking set but contains no line. We establish a lower bound for the cardinality of such a set, and characterize sets meeting the bound, in projective and affine planes.