Improving dimension estimates for Furstenberg-type sets

In this paper we study the problem of estimating the generalized Hausdorff dimension of Furstenberg sets in the plane. For α∈(0,1], a set F in the plane is said to be an α-Furstenberg set if for each direction e there is a line segment ?e in the direction of e for which dimH(?e∩F)?α. It is well known that , and it is also known that these sets can have zero measure at their critical dimension. By looking at general Hausdorff measures Hh defined for doubling functions, that need not be power laws, we obtain finer estimates for the size of the more general h-Furstenberg sets. Further, this approach allow us to sharpen the known bounds on the dimension of classical Furstenberg sets.The main difficulty we had to overcome, was that if Hh(F)=0, there always exists g?h such that Hg(F)=0 (here ? refers to the natural ordering on general Hausdorff dimension functions). Hence, in order to estimate the measure of general Furstenberg sets, we have to consider dimension functions that are a true step down from the critical one. We provide rather precise estimates on the size of this step and by doing so, we can include a family of zero dimensional Furstenberg sets associated to dimension functions that grow faster than any power function at zero. With some additional growth conditions on these zero dimensional functions, we extend the known inequalities to include the endpoint α=0.     

Enlargements of positive sets

In this paper we introduce the notion of enlargement of a positive set in SSD spaces. To a maximally positive set A we associate a family of enlargements E(A) and characterize the smallest and biggest element in this family with respect to the inclusion relation. We also emphasize the existence of a bijection between the subfamily of closed enlargements of E(A) and the family of so-called representative functions of A. We show that the extremal elements of the latter family are two functions recently introduced and studied by Stephen Simons. In this way we extend to SSD spaces some former results given for monotone and maximally monotone sets in Banach spaces.     

An optimal locating-dominating set in the infinite triangular grid

Assume that G=(V,E) is an undirected graph, and C⊆V. For every v∈V, we denote by I(v) the set of all elements of C that are within distance one from v. If all the sets I(v) for v∈V?C are non-empty, and pairwise different, then C is called a locating-dominating set. The smallest possible density of a locating-dominating set in the infinite triangular grid is shown to be .     

Fractal dimension estimates for invariant sets of non-injective maps

For a special class of non-injective maps on Riemannian manifolds an upper bound for the fractal dimension of invariant set in terms of singular values of the tangent map and degree of non-injectivity is given     

Global properties of the triangular systems in the singular case

We introduce a new class of the triangular (multi-input and multi-output) control systems, of O.D.E., which are not feedback linearizable, and investigate its global behavior. The triangular form introduced is a generalization of the classes of triangular systems, considered before. For our class, we solve the problem of global robust controllability. Combining our main result with that of [F.H. Clarke, Yu.S. Ledyaev, E.D. Sontag, A.I. Subbotin, Asymptotic controllability implies feedback stabilization, IEEE Trans. Automat. Control 42 (1997) 1394-1407], we obtain a corollary on the global discontinuous sampled stabilization (an example showing that global smooth stabilization can be irrelevant to the singular case is considered). To prove our main result, we apply a certain “back-stepping” algorithm and combine the technique proposed in [V.I. Korobov, S.S. Pavlichkov, W.H. Schmidt, Global robust controllability of the triangular integro-differential Volterra systems, J. Math. Anal. Appl. 309 (2005) 743-760] with solving a specific problem of global “practical stabilization” by means of a discontinuous, time-varying feedback law.     

Computation of differential Chow forms for ordinary prime differential ideals

In this paper, we propose algorithms for computing differential Chow forms for ordinary prime differential ideals which are given by characteristic sets. The algorithms are based on an optimal bound for the order of a prime differential ideal in terms of a characteristic set under an arbitrary ranking, which shows the Jacobi bound conjecture holds in this case. Apart from the order bound, we also give a degree bound for the differential Chow form. In addition, for a prime differential ideal given by a characteristic set under an orderly ranking, a much simpler algorithm is given to compute its differential Chow form. The computational complexity of the algorithms is single exponential in terms of the Jacobi number, the maximal degree of the differential polynomials in a characteristic set, and the number of variables.     

Integral estimates for convergent positive series

It is shown that for every α>1, we have

     

Refinement of estimates for some nonhomogeneous linear forms

In this paper, estimates for nonhomogeneous linear forms in values of hypergeometric functions with irrational parameters are refined. This refinement is carried out by means of an optimal choice of the degree of the zeroth polynomial appearing in the construction of approximate functional forms.Translated from Matematicheskie Zametki, vol. 77, no. 4, 2005, pp. 515–521.Original Russian Text Copyright © 2005 by P. L. Ivankov.This revised version was published online in April 2005 with a corrected issue number.     

Algorithms for manipulation of level sets of nonparametric density estimates

Summary  We present algorithms for finding the level set tree of a multivariate density estimate. That is, we find the separated components of level sets of the estimate for a series of levels, gather information on the separated components, such as volume and barycenter, and present the information together with the tree structure of the separated components. The algorithm proceeds by first building a binary tree which partitions the support of the density estimate, followed by bottom-up travels of this tree during which we join those parts of the level sets which touch each other. As a byproduct we present an algorithm for evaluating a kernel estimate on a large multidimensional grid. Since we find the barycenters of the separated components of the level sets also for high levels, our method finds the locations of local extremes of the estimate. Writing of this article was financed by Deutsche Forschungsgemeinschaft under project MA1026/8-1.     

On removable sets for convex functions

In the present article we provide a sufficient condition for a closed set F∈R^d$F\in {\mathbb{R}}^d$ to have the following property which we call c  -removability: Whenever a continuous function f:R^d→R$f:{\mathbb{R}}^d\to \mathbb{R}$ is locally convex on the complement of F  , it is convex on the whole R^d${\mathbb{R}}^d$. We also prove that no generalized rectangle of positive Lebesgue measure in R²${\mathbb{R}}^2$ is c-removable. Our results also answer the following question asked in an article by Jacek Tabor and Józef Tabor (2010) [5]: Assume the closed set F⊂R^d$F\subset {\mathbb{R}}^d$ is such that any locally convex function defined on R^d?F${\mathbb{R}}^d?F$ has a unique convex extension on R^d${\mathbb{R}}^d$. Is F   necessarily intervally thin (a notion of smallness of sets defined by their “essential transparency” in every direction)? We prove the answer is negative by finding a counterexample in R²${\mathbb{R}}^2$.     

Weakly prime sets for function spaces

We define and study weakly prime sets for a function space and show that it coincides with the known concept of weakly prime sets for function algebras and spaces of affine functions.     

Gauges for the cookie-cutter sets

Let E be a cookie-cutter set with dimH E =s. It is known that the Hausdorff s-measure and the packing s-measure of the set E are positive and finite. In this paper, we prove that for a gauge function g the set E has positive and finite Hausdorff g-measure if and only if 0 〈 liminft→0 g（t）/ts 〈 ∞. Also, we prove that for a doubling gauge function g the set E has positive and finite packing g-measure if and only if 0 〈 lim supt→0 g（t）/ts 〈 ∞.     

Existence of infinitely many homoclinic orbits to Aubry sets for positive definite Lagrangian systems

In this paper, we study the problem of homoclinic orbits to Aubry sets for time-periodic positive definite Lagrangian systems. We show that there are infinitely many homoclinic orbits to some Aubry set under the conditions that the associated Mather set is uniquely ergodic and the first relative homology group of the projection of this Aubry set is nonzero.     

Coefficient estimates for inverses of starlike functions of positive order

In the present paper, the coefficient estimates are found for the class S∗−1(α) consisting of inverses of functions in the class of univalent starlike functions of order α in . These estimates extend the work of Krzyz, Libera and Zlotkiewicz [J.G. Krzyz, R.J. Libera, E. Zlotkiewicz, Coefficients of inverse of regular starlike functions, Ann. Univ. Mariae Curie-Sklodowska Sect. A 33 (10) (1979) 103-109] who found sharp estimates on only first two coefficients for the functions in the class S∗−1(α). The coefficient estimates are also found for the class Σ∗−1(α), consisting of inverses of functions in the class Σ^∗(α) of univalent starlike functions of order α in . The open problem of finding sharp coefficient estimates for functions in the class Σ^∗(α) stands completely settled in the present work by our method developed here.     

Gradient estimates for positive smooth f-harmonic functions

For Riemannian manifolds with a measure, we study the gradient estimates for positive smooth f-harmonic functions when the ∞-Bakry-Emery Ricci tensor and Ricci tensor are bounded from below, generalizing the classical ones of Yau (i.e., when f is constant).     

Tight bounds for eternal dominating sets in graphs

The eternal domination number of a graph is the number of guards needed at vertices of the graph to defend the graph against any sequence of attacks at vertices. We consider the model in which at most one guard can move per attack and a guard can move across at most one edge to defend an attack. We prove that there are graphs G for which , where γ_∞(G) is the eternal domination number of G and α(G) is the independence number of G. This matches the upper bound proved by Klostermeyer and MacGillivray.     

Strengthened fixed point property and products in ordered sets

Strengthened fixed point property for ordered sets is formulated. It is weaker than the strong fixed point property due to Duffus and Sauer and stronger than the product property meaning that A × Y has the fixed point property whenever A has the former and Y has the latter. In particular, doubly chain complete ordered sets with no infinite antichain have the strengthened fixed point property whenever they have the fixed point property, which yields a transparent proof of the well-known theorem saying that doubly chain complete ordered sets with no infinite antichain have the product property whenever they have the fixed point property. The new proof does not require the axiom of choice. Presented at the Summer School on General Algebra and Ordered Sets, Malá Morávka, 4–10 September 2005.