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].     

THE CAPACITY DENSITY AND THE HAUSDORFF DIMENSION OF FRACTAL SETS

ＴＨＥＣＡＰＡＣＩＴＹＤＥＮＳＩＴＹＡＮＤＴＨＥＨＡＵＳＤＯＲＦＦＤＩＭＥＮＳＩＯＮＯＦＦＲＡＣＴＡＬＳＥＴＳ￥ＸｕＹｏｕ（ＩｎｓｔｉｔｕｔｅｏｆＭａｔｈｅｍａｔｉｃｓ，ＦｕｄａｎＵｎｉｖｅｒｓｉｔｙ，Ｓｈａｎｇｈａｉ２００４３３，Ｓｈａｎｇｈａｉ，...     

The distributional dimension of fractals

In the book [1] H.Triebel introduces the distributional dimension of fractals in an analytical form and proves that： for Г as a non-empty set in R^n with Lebesgue measure ｜Г｜ = 0, one has dimH Г = dimD Г, where dimD Г and dimH Г are the Hausdorff dimension and distributional dimension, respectively. Thus we might say that the distributional dimension is an analytical definition for Hausdorff dimension. Therefore we can study Hausdorff dimension through the distributional dimension analytically. By discussing the distributional dimension, this paper intends to set up a criterion for estimating the upper and lower bounds of Hausdorff dimension analytically. Examples illustrating the criterion are included in the end.     

On the Number of Distinct Values of a Class of Functions with Finite Domain

By relating the number of images of a function with finite domain to a certain parameter, we obtain both an upper and lower bound for the image set. Even though the arguments are elementary, the bounds are, in some sense, best possible. These bounds are then applied in several contexts. In particular, we obtain the first non-trivial upper bound for the image set of a planar function over a finite field.     

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.     

Heat Kernel Estimates and Homogenization for Asymptotically Lower Dimensional Processes on Some Nested Fractals

We consider the class of diffusions on fractals first constructed in [12] on the Sierpinski and abc gaskets. We give an alternative construction of the diffusion process using Dirichlet forms and extend the class of fractals considered to some nested fractals. We use the Dirichlet form to deduce Nash inequalities which give upper bounds on the short and long time behaviour of the transition density of the diffusion process. For short times, even though the diffusion lives mainly on a lower dimensional subset of the fractal, the heat flows slowly. For the long time scales the diffusion has a homogenization property in that rescalings converge to the Brownian motion on the fractal.     

随机自仿射集的Hausdorff维数估计

定义了一类广泛的随机自仿射集,得到了此类集合的Ｈａｕｓｄｏｒｆｆ维数估计．此前的随机自相似（包括Ｇｒａｆ,Ｍａｕｌｄｉｎ与Ｆａｌｃｏｎｅｒ等定义的随机自相似情形）和Ｆａｌｃｏｎｅｒ定义的（严格）自仿射以及作者定义的μ 统计自仿射情形均成为该文结果的特例．     

Some Results on the Upper Convex Densities of the Self-Similar Sets at the Contracting-Similarity Fixed Points

In this paper, some results on the upper convex densities of self-similar sets at the contracting-similarity fixed points are discussed. Firstly, a characterization of the upper convex densities of self-similar sets at the contracting-similarity fixed points is given. Next, under the strong separation open set condition, the existence of the best shape for the upper convex densities of self-similar sets at the contracting-similarity fixed points is proven. As consequences, an open problem and a conjecture, which were posed by Zhou and Xu, are answered.     

Modelling transport in disordered media via diffusion on fractals

When viewed at an appropriate scale, a disordered medium can behave as if it is strictly less than three-dimensional. As fractals typically have noninteger dimensions, they are natural models for disordered media, and diffusion on fractals can be used to model transport in disordered media. In particular, such diffusion processes can be used to obtain bounds on the fundemantal solution to the heat equation on a fractal. In this paper, we review the work in this area and describe how bounds on branching processes lead to bounds on heat kernels.     

The HAUSDORFF DIMENSION AND MEASURE OF THE GENERALIZED MORAN FRACTALS AND FOURIER SERIES

ＴｈｅＨＡＵＳＤＯＲＦＦＤＩＭＥＮＳＩＯＮＡＮＤＭＥＡＳＵＲＥＯＦＴＨＥＧＥＮＥＲＡＬＩＺＥＤＭＯＲＡＮＦＲＡＣＴＡＬＳＡＮＤＦＯＵＲＩＥＲＳＥＲＩＥＳ￥ＲＥＮＦＵＴｈＯ；ＬＩＡＮＧＪＩＮＲＯＮＧＡｂｓｔｒａｃｔ：Ｔｈｉｓｐａｐｅｒｓｔｕｄｉｅｓｔｈ...     

学生面试问题的分配策略

就学生面试问题中的教师分配策略进行了系统的分析.首先我们分别给出并证明了在面试老师数一定,满足没有两个老师相同以及三个老师相同情形下的,可承担面试学生数的四个上界.然后提出了2种分配算法:排队算法和集合压缩算法,计算结果表明,所提算法可以很好的逼近理论上界.针对文理各半的情形,我们也同样提出并证明了类似的上界,两种分配策略同样适合文理各半的情形.在不分文理和文理各半的两种情况下,我们提出的分配策略都能很好的逼进甚至达到上界,同时也说明了我们理论界是一个很紧的上界.     

Prime and almost prime integral points on principal homogeneous spaces

We develop the affine sieve in the context of orbits of congruence subgroups of semisimple groups acting linearly on affine space. In particular, we give effective bounds for the saturation numbers for points on such orbits at which the value of a given polynomial has few prime factors. In many cases these bounds are of the same quality as what is known in the classical case of a polynomial in one variable where the orbit consists of the integers. When the orbit is the set of integral matrices of a fixed determinant, we obtain a sharp result for the saturation number, and thus establish the Zariski density of matrices all of whose entries are prime numbers. Among the key tools used are explicit approximations to the generalized Ramanujan conjectures for such groups, and sharp and uniform counting of points on such orbits when ordered by various norms.     

Small polynomials with integer coefficients

We study the problem of minimizing the supremum norm, on a segment of the real line or on a compact set in the plane, by polynomials with integer coefficients. The extremal polynomials are naturally called integer Chebyshev polynomials. Their factors, zero distribution and asymptotics are the main subjects of this paper. In particular, we show that the integer Chebyshev polynomials for any infinite subset of the real line must have infinitely many distinct factors, which answers a question of Borwein and Erdélyi. Furthermore, it is proved that the accumulation set for their zeros must be of positive capacity in this case. We also find the first nontrivial examples of explicit integer Chebyshev constants for certain classes of lemniscates. Since it is rarely possible to obtain an exact value of the integer Chebyshev constant, good estimates are of special importance. Introducing the methods of weighted potential theory, we generalize and improve the Hilbert-Fekete upper bound for the integer Chebyshev constant. These methods also give bounds for the multiplicities of factors of integer Chebyshev polynomials, and lower bounds for the integer Chebyshev constant. Moreover, all the bounds mentioned can be found numerically by using various extremal point techniques, such as the weighted Leja points algorithm. Applying our results in the classical case of the segment [0, 1], we improve the known bounds for the integer Chebyshev constant and the multiplicities of factors of the integer Chebyshev polynomials. Research supported in part by the National Security Agency under Grant No. MDA904-03-1-0081.     

一类具有上下界的均衡问题

本文获得一类具有上、下界的抽象均衡问题解的存在性条件, 回答了Isac, Sehgal和Singh提出的一个公开问题,进一步研究了具上、下界及约束条件的抽象均 衡问题,获得了更为深刻的结果. 最后,把上述公开问题推广到两个空间的情形.     

Absence of Critical Mass Densities for a Vibrating Membrane

We study the dependence of the eigenvalues of a N-dimensional vibrating membrane upon variation of the mass density. We prove that the elementary symmetric functions of the eigenvalues depend real-analytically on the mass density and that such functions have no critical points with constant mass constraint. In particular, the elementary symmetric functions of the eigenvalues, hence all simple eigenvalues, have no local maxima or minima on the set of those mass densities with a prescribed total mass.     

Some improvements for two-sided bounds on the inverse of diagonally dominant tridiagonal matrices

In this paper, we obtain lower and upper bounds for the entries of the inverses of diagonally dominant tridiagonal matrices. First of all we derive the bounds for off-diagonal elements of the inverse as a function of the diagonal ones, then we improve the two-sided bounds for the diagonal entries obtaining sharper lower and upper bounds for all the elements of the inverse.     

完全图全符号控制数的较小上界和下确界

设图G=G(V,E),令函数f∶V∪E→{-1,1},f的权w(f)=∑x∈V∪Ef[x],对V∪E中任一元素,定义f[x]=∑y∈NT[x]f(y),这里NT[x]表示V∪E中x及其关联边、邻点的集合.图G的全符号控制函数为f∶V∪E→{-1,1},满足对所有的x∈V∪E有f[x]1,图G的全符号控制数γT(G)就是图G上全符号控制数的最小权,称其f为图G的γT-函数.本文得到了完全图全符号控制数的一个较小上界和下确界.     

Fractal properties of number systems

In this paper we study properties of the fundamental domain F of number systems in the n-dimensional real vector space. In particular we investigate the fractal structure of its boundary F. In a first step we give upper and lower bounds for its box counting dimension. Under certain circumstances these bounds are identical and we get an exact value for the box counting dimension. Under additional assumptions we prove that the Hausdorf dimension of F is equal to its box counting dimension. Moreover, we show that the Hausdorf measure is positive and fnite. This is done by applying the theory of graphdirected self similar sets due to Falconer and Bandt. Finally, we discuss the connection to canonical number systems in number felds, and give some numerical examples.     

A semilattice generated by superlow computably enumerable degrees

We prove that a partially ordered set of all computably enumerable (c. e.) degrees that are the least upper bounds of two superlow c. e. degrees is an upper semilattice not elementary equivalent to the semilattice of all c. e. degrees.