Turán Number of the Family Consisting of a Blow-up of a Cycle and a Blow-up of a Star

Let F={H₁,...,H_k}(k> 1) be a family of graphs.The Turán number of the family F is the maximum number of edges in an n-vertex {H₁,...,H_k)-free graph,denoted by ex(n,F) or ex(n,{H₁,H₂,...,H_k}).The blow-up of a graph H is the graph obtained from H by replacing each edge in H by a clique of the same size where the new vertices of the cliques are all different.In this paper we determine the Turán number of the family cons...     

Regularity of the inverse of a homeomorphism of a Sobolev–Orlicz space

Given a homeomorphism ? ∈ W _M ¹ , we determine the conditions that guarantee the belonging of the inverse of ? in some Sobolev–Orlicz space W _F ¹ . We also obtain necessary and sufficient conditions under which a homeomorphism of domains in a Euclidean space induces the bounded composition operator of Sobolev–Orlicz spaces defined by a special class of N-functions. Using these results, we establish requirements on a mapping under which the inverse homeomorphism also induces the bounded composition operator of another pair of Sobolev–Orlicz spaces which is defined by the first pair.     

Extension of a Theorem of Carleson-Duren

1. Introduction A theorem of Carleson,as generalized by Duren characterizes those positive measure μ on the unit disc U={z∈C:|z|<1} for which the H~p norm domiates the L~q(μ) norm of elements of H~p. Later on, Hasting proved an analogous results with H~p replaced by A~p, the Bergman space of fuctions f     

On Sums of Two Squares of Primes and a Cube of a Prime

In this paper we are concerned with the exceptional set of the sum of two squares of primesand a cube of a prime P;+p;+p;.Noting that竹三1 or 3(mod 6)is a necessary conditionfor the solvability of the equation n=P}+P;+P;(see【1]),we define E(N)=Card{n:n≤N,礼∈三and n≠P;+Pi+P;for any Pi,1≤i s 3), (1)where三={n:n三1 or 3(mod 6)). This and similar problems have been studied by a number of authors.In 1937,Davenportand Heilbronn[2J proved that if后2 3 is an odd integer then almost all posi…     

On Sums of a Prime, and a Square of Prime, and a κ-power of Prime

In 1923, Hardy and Littlewood[1] conjectured that each integer n can be written asp+m12+ m22 = n,and Linnik[2,3] proved that this conjecture is true. But if these mi with i = 1,2 are restricted to primes Pi, the corresponding result is out of reach at present. We consider the following Diophantine equation     

Inequality for the Moment of a Function of a Random Variable

ＩｎｅｑｕａｌｉｔｙｆｏｒｔｈｅＭｏｍｅｎｔｏｆａＦｕｎｃｔｉｏｎｏｆａＲａｎｄｏｍＶａｒｉａｂｌｅ￥ＬｉＢａｉｎｉａｎＨｕＳｈｕｈｅ（李柏年，胡舒合）（ＡｎｈｕｉＩｎｓｔｉｔｕｔｅｏｆＦｉｎａｎｃｅａｎｄＴｒａｄｅ）（ＡｎｈｕｉＵｎｉｖｅｒｓｉｔｙ...     

A Generalization of a Theorem of Liao

Let X be a metrizable space and let φ：R× X → X be a continuous flow on X. For any given {φt}-invariant Borel probability measure, this paper presents a {φt}-invariant Borel subset of X satisfying the requirements of the classical ergodic theorem for the contiImous flow （X, {φt}）. The set is more restrictive than the ones in the literature, but it might be more useful and convenient, particularly for non-uniformly hyperbolic systems and skew-product flows.     

Multi-dimensional versions of a formula of Popoviciu

In this paper, an explicit formulation for multivariate truncated power functions of degree one is given firstly. Based on multivariate truncated power functions of degree one, a formulation is presented which counts the number of non-negative integer solutions of s×(s 1) linear Diophantine equations and it can be considered as a multi-dimensional versions of the formula counting the number of non-negative integer solutions of ax by = n which is given by Popoviciu in 1953.     

On a Zero-Sum Generalization of a Variation of Schur’s Equation

Let be a positive integer, and let denote the cyclic group of residues modulo m. Furthermore, let denote the minimum integer N such that for every function there exist m integers satisfying and (and ). It is shown that for every odd prime m. Daniel Schaal: Partially supported by a South Dakota Governor’s 2010 Individual Research Seed Grant.     

Hausdorff dimension of Julia set of a polynomial with a Siegel disk

Let f(z) = e2πiθz(1 z/d)d,θ∈R\Q be a polynomial. Ifθis an irrational number of bounded type, it is easy to see that f(z) has a Siegel disk centered at 0. In this paper, we will show that the Hausdorff dimension of the Julia set of f(z) satisfies Dim(J(f))<2.     

Proof of a conjecture of Zahariuta concerning a problem of Kolmogorov on the ε-entropy

We prove a conjecture of Zahariuta which itself solves a problem of Kolmogorov on the -entropy of some classes of analytic functions. For a given holomorphically convex compact subset K in a pseudoconvex domain D in Cⁿ, Zahariutas conjecture consists in approximating the relative extremal function u^*_K,D, uniformly on any compact subset of DK, by pluricomplex Green functions on D with logarithmic poles in the compact subset K.     

Traversing a Set of Points with a Minimum Number of Turns

Given a finite set of points S in ℝ ^d , consider visiting the points in S with a polygonal path which makes a minimum number of turns, or equivalently, has the minimum number of segments (links). We call this minimization problem the minimum link spanning path problem. This natural problem has appeared several times in the literature under different variants. The simplest one is that in which the allowed paths are axis-aligned. Let L(S) be the minimum number of links of an axis-aligned path for S, and let G _n ^d be an n×…×n grid in ℤ ^d . Kranakis et al. (Ars Comb. 38:177–192, 1994) showed that L(G _n ²)=2n−1 and and conjectured that, for all d≥3, We prove the conjecture for d=3 by showing the lower bound for L(G _n ³). For d=4, we prove that For general d, we give new estimates on L(G _n ^d ) that are very close to the conjectured value. The new lower bound of improves previous result by Collins and Moret (Inf. Process. Lett. 68:317–319, 1998), while the new upper bound of differs from the conjectured value only in the lower order terms. For arbitrary point sets, we include an exact bound on the minimum number of links needed in an axis-aligned path traversing any planar n-point set. We obtain similar tight estimates (within 1) in any number of dimensions d. For the general problem of traversing an arbitrary set of points in ℝ ^d with an axis-aligned spanning path having a minimum number of links, we present a constant ratio (depending on the dimension d) approximation algorithm. Work by A. Dumitrescu was partially supported by NSF CAREER grant CCF-0444188. Work by F. Hurtado was partially supported by projects MECMTM2006-01267 and Gen. Cat. 2005SGR00692. Work by P. Valtr was partially supported by the project 1M0545 of the Ministry of Education of the Czech Republic.     

On a Theorem of Milin

Let S be class of functions f(z)=z a_2 z~2 … analytic and univalent in the unit disk D, and let 1.M.Milin proved that Theorem A. If f∈S and then where d_o(h)=1and In fact,the result is deduced from Milan′s Tauberian Theorem. Here     

Bifurcation and control of a bioeconomic model of a prey–predator system with a time delay

In this paper, we analyze the dynamical behaviour of a bioeconomic model system using differential algebraic equations. The system describes a prey–predator fishery with prey dispersal in a two-patch environment, one of which is a free fishing zone and other is a protected zone. It is observed that a singularity-induced bifurcation phenomenon appears when a variation of the economic interest of harvesting is taken into account. We have incorporated a state feedback controller to stabilize the model system in the case of positive economic interest. A discrete-type gestational delay of predators is incorporated, and its effect on the dynamical behaviour of the model is analyzed. The occurrence of Hopf bifurcation of the proposed model with positive economic profit is shown in the neighbourhood of the coexisting equilibrium point through considering the delay as a bifurcation parameter. Finally, some numerical simulations are given to verify the analytical results, and the system is analyzed through graphical illustrations.     

On a Conjecture of Shapiro's

ＯｎａＣｏｎｊｅｃｔｕｒｅｏｆＳｈａｐｉｒｏ＇ｓ陈志国ＯｎａＣｏｎｊｅｃｔｕｒｅｏｆＳｈａｐｉｒｏ＇ｓ￥ＣｈｅｎＺｈｉｇｕｏ（ＩｎｓｔｉｔｕｔｅｏｆＭａｔｈｅｍａｔｉｃｓ，ＦｕｄａｎＵｎｉｖｅｒｓｉｔｙ）Ａｂａｔｒａｃｔ：Ｔｈｉｓｐｒｏｂｌｅｍｗａｓ...     

On a Conjecture of Halperin

Ｏｎ　ａ　Ｃｏｎｊｅｃｔｕｒｅ　ｏｆ　ＨａｌｐｅｒｉｎＨｕａｎｇＨｕａｌｅ（黄华乐）（ＩｎｓｔｉｔｕｔｅｏｆＭａｔｈｅｍａｔｉｃｓ，ＡｃａｄｅｒｎｉａＳｉｎｉｃａ，Ｂｅｉｊｉｎｇ，１０００８０）Ａｂｓｔｒａｃｔ：Ｉｎ［１］，Ｈａｌｐｅｒｉｎｒａｉｓｅ...     

Cardinality of a Class of (0.1) Matrices Covering a Given Matrix

Let R and S be two vectors whose components are m and non-negative integers,respectively. Let P be an m×n (0,1)-matrix with column sums at most one. Let (R,S) be the class consisting of all m×n (0,1)-matrices with row sum vector R and columu sum vector S, which cover P. In this paper we derive a lower bound to the cardinality of class (R,S), which can be computed readily. Let R=(r_1,r_2,…,r_m) and S=(s_1,s_2,…, s_n)be vectors with nonnegative     

The Bandwidth of a Class of Line Graphs

本文给出了一类线图的带宽,并给出了它的最佳编号.