On Interpolating Blaschke Products and?Blaschke-Oscillatory Equations

This research is partially a continuation of a 2007 paper by the author. Growth estimates for generalized logarithmic derivatives of Blaschke products are provided under the assumption that the zero sequences are either uniformly separated or exponential. Such Blaschke products are known as interpolating Blaschke products. The growth estimates are then proven to be sharp in a rather strong sense. The sharpness discussion yields a solution to an open problem posed by E. Fricain and J. Mashreghi in 2008. Finally, several aspects are pointed out to illustrate that interpolating Blaschke products appear naturally in studying the oscillation of solutions of a differential equation f″+A(z)f=0, where A(z) is analytic in the unit disc. In particular, a unit disc analogue of a 1988 result due to S. Bank on prescribed zero sequences for entire solutions is obtained, and a more careful analysis of a 1955 example due to B. Schwarz on the case A(z)=\frac1+4g²(1-z²)²A(z)=\frac{1+4\gamma^{2}}{(1-z^{2})^{2}} reveals that an infinite zero sequence is always a union of two exponential sequences.     

Nonlocal initial-boundary-value problems for a degenerate hyperbolic equation

We consider the equation y ^m u _xx − u _yy − b ² y ^m u = 0 in the rectangular area {(x, y) | 0 < x < 1, 0 < y < T}, where m < 0, b ≥ 0, T > 0 are given real numbers. For this equation we study problems with initial conditions u(x, 0) = τ(x), u _y (x, 0) = ν(x), 0 ≤ x ≤ 1, and nonlocal boundary conditions u(0, y) = u(1, y), u _x (0, y) = 0 or u _x (0, y) = u _x (1, y), u(1, y) = 0 with 0≤y≤T. Using the method of spectral analysis, we prove the uniqueness and existence theorems for solutions to these problems     

Interpolating sequences in the ball ofC n

LetB be the unit ball ofC ⁿ , I give necessary conditions on sequenceS of points inB to beH ^∞(B) interpolating in term of aC ⁿ valued holomorphic function zero onS (a substitute for the interpolating Blaschke product). These conditions are sufficient to prove that the sequenceS is interpolating for ∩ _p>1 (B) and is also interpolating forH ^p (B) for 1≤p<∞.     

Interpolation problems on the spectrum of H∞

We characterize those sequences (x _n ) in the spectrum of H ^∞ whose Nevanlinna–Pick interpolation problems admit thin Blaschke products as solutions. We also study under which conditions there is a Blaschke product B with prescribed zero-set distribution and solving problems of the form B(x) = f _n (x) for every x ∈ P(x _n ), where P(x _n ) is the Gleason part associated with the point x _n and where (f _n ) is an arbitrary sequence of functions in the unit ball of H ^∞. As a corollary we get a new characterization of Carleson–Newman Blaschke products in terms of bounded universal functions, a result first proved by Gallardo and Gorkin.     

Interpolation problems on the spectrum of <Emphasis Type="Italic">H</Emphasis><Superscript>∞</Superscript>

We characterize those sequences (x _n ) in the spectrum of H ^∞ whose Nevanlinna–Pick interpolation problems admit thin Blaschke products as solutions. We also study under which conditions there is a Blaschke product B with prescribed zero-set distribution and solving problems of the form B(x) = f _n (x) for every x ∈ P(x _n ), where P(x _n ) is the Gleason part associated with the point x _n and where (f _n ) is an arbitrary sequence of functions in the unit ball of H ^∞. As a corollary we get a new characterization of Carleson–Newman Blaschke products in terms of bounded universal functions, a result first proved by Gallardo and Gorkin.      

On (a, b)-consecutive petersen graphs

The generalized Petersen graphsP(n,k), n≥3, 1≤k<n/2, consist of an outern-cyclex _o x ₁ x ₂...x _n−1 , a set ofn spokesx _i y _i (0≤i≤n−1), andn inner edgesy _i y _i +k with indices taken modulon. This paper deals with (a,b)-consecutive labelings of generalized Petersen graphP(n,k).     

On the polynomial limit cycles of polynomial differential equations

In this paper we deal with ordinary differential equations of the form dy/dx = P(x, y) where P(x, y) is a real polynomial in the variables x and y, of degree n in the variable y. If y = φ(x) is a solution of this equation defined for x ∈ [0, 1] and which satisfies φ(0) = φ(1), we say that it is a periodic orbit. A limit cycle is an isolated periodic orbit in the set of all periodic orbits. If φ(x) is a polynomial, then φ(x) is called a polynomial solution.     

On symmetric basic sequences in lorentz sequence spaces II

It is shown that if {y _n} is a block of type I of a symmetric basis {x _n} in a Banach spaceX, then {y _n} is equivalent to {x _n} if and only if the closed linear span [y _n] of {y _n} is complemented inX. The result is used to study the symmetric basic sequences of the dual space of a Lorentz sequence spaced(a, p). Let {x _n,f _n} be the unit vector basis ofd(a, p), for 1≤p<+∞. It is shown that every infinite-dimensional subspace ofd(a, p) (respectively, [f _n] has a complemented subspace isomorphic tol _p (respectively,l _q, 1/p+1/q=1 when 1<p<+∞ andc ₀ whenp=1) and numerous other results on complemented subspaces ofd(a, p) and [f _n] are obtained. We also obtain necessary and sufficient conditions such that [f _n] have exactly two non-equivalent symmetric basic sequences. Finally, we exhibit a Banach spaceX with symmetric basis {x _n} such that every symmetric block basic sequence of {x _n} spans a complemented subspace inX butX is not isomorphic to eitherc ₀ orl _p, 1≤p<+∞.     

On the diophantine equation x 2 + p 2k = y n

Let 2 ≤ p < 100 be a rational prime and consider equation (3) in the title in integer unknowns x, y, n, k with x > 0, y > 1, n ≥ 3 prime, k ≥ 0 and gcd(x, y) = 1. Under the above conditions we give all solutions of the title equation (see the Theorem). We note that if in (3) gcd(x, y) = 1, our Theorem is an extension of several earlier results [15], [27], [2], [3], [5], [23]. Received: 25 April 2008     

Negative result in pointwise 3-convex polynomial approximation

Let Δ³ be the set of functions three times continuously differentiable on [−1, 1] and such that f″′(x) ≥ 0, x ∈ [−1, 1]. We prove that, for any n ∈ ℕ and r ≥ 5, there exists a function f ∈ C ^r [−1, 1] ⋂ Δ³ [−1, 1] such that ∥f ^(r)∥ _{C[−1, 1]} ≤ 1 and, for an arbitrary algebraic polynomial P ∈ Δ³ [−1, 1], there exists x such that

On quasi-symmetric designs with intersection difference three

In a recent paper, Pawale (Des Codes Cryptogr, 2010) investigated quasi-symmetric 2-(v, k, λ) designs with intersection numbers x > 0 and y = x + 2 with λ > 1 and showed that under these conditions either λ = x + 1 or λ = x + 2, or D{\mathcal{D}} is a design with parameters given in the form of an explicit table, or the complement of one of these designs. In this paper, quasi-symmetric designs with y − x = 3 are investigated. It is shown that such a design or its complement has parameter set which is one of finitely many which are listed explicitly or λ ≤ x + 4 or 0 ≤ x ≤ 1 or the pair (λ, x) is one of (7, 2), (8, 2), (9, 2), (10, 2), (8, 3), (9, 3), (9, 4) and (10, 5). It is also shown that there are no triangle-free quasi-symmetric designs with positive intersection numbers x and y with y = x + 3.     

Good points for diophantine approximation

Given a sequence (x _n ) _n=1^∞ of real numbers in the interval [0, 1) and a sequence (δ _n ) _n=1^∞ of positive numbers tending to zero, we consider the size of the set of numbers in [0, 1] which can be ‘well approximated’ by terms of the first sequence, namely, those y ∈ [0, 1] for which the inequality |y − x _n | < δ _n holds for infinitely many positive integers n. We show that the set of ‘well approximable’ points by a sequence (x _n ) _n=1^∞, which is dense in [0, 1], is ‘quite large’ no matter how fast the sequence (δ _n ) _n=1^∞ converges to zero. On the other hand, for any sequence of positive numbers (δ _n ) _n=1^∞ tending to zero, there is a well distributed sequence (x _n ) _n=1^∞ in the interval [0, 1] such that the set of ‘well approximable’ points y is ‘quite small’.     

Strongly Closed Subgraphs in a Distance-Regular Graph with <Emphasis Type="Italic">c</Emphasis><Subscript>2</Subscript> > 1

Let Γ be a distance-regular graph of diameter d ≥ 3 with c ₂ > 1. Let m be an integer with 1 ≤ m ≤ d − 1. We consider the following conditions:

On numbers badly approximable by dyadic rationals

We consider a problem originating both from circle coverings and badly approximable numbers in the case of dyadic diophantine approximation. For the unit circle we give an elementary proof that the set {x ∈ : 2 ⁿ x ≥ c (mod 1) n ≥ 0} is a fractal set whose Hausdorff dimension depends continuously on c and is constant on intervals which form a set of Lebesgue measure 1. Hence it has a fractal graph. We completely characterize the intervals where the dimension remains unchanged. As a consequence we can describe the graph of c ↦ dim _H {x ∈ [0; 1]: x − m/2 ⁿ < c/2 ⁿ (mod 1) finitely often}.     

On Bounding the Betti Numbers and Computing the Euler Characteristic of Semi-Algebraic Sets

In this paper we prove new bounds on the sum of the Betti numbers of closed semi-algebraic sets and also give the first single exponential time algorithm for computing the Euler characteristic of arbitrary closed semi-algebraic sets. Given a closed semi-algebraic set S R ^k defined as the intersection of a real variety, Q=0, deg(Q)≤d, whose real dimension is k', with a set defined by a quantifier-free Boolean formula with no negations with atoms of the form P _i =0, P _i ≥ 0, P _i ≤ 0, deg(P _i ) ≤ d, 1≤ i≤ s, we prove that the sum of the Betti numbers of S is bounded by s ^k' (O(d)) ^k . This result generalizes the Oleinik—Petrovsky—Thom—Milnor bound in two directions. Firstly, our bound applies to arbitrary unions of basic closed semi-algebraic sets, not just for basic semi-algebraic sets. Secondly, the combinatorial part (the part depending on s ) in our bound, depends on the dimension of the variety rather than that of the ambient space. It also generalizes the result in [4] where a similar bound is proven for the number of connected components. We also prove that the sum of the Betti numbers of S is bounded by s ^k' 2 ^{O(k2 m4)} in case the total number of monomials occurring in the polynomials in is m. Using the tools developed for the above results, as well as some additional techniques, we give the first single exponential time algorithm for computing the Euler characteristic of arbitrary closed semi-algebraic sets. Received September 9, 1997, and in revised form March 18, 1998, and October 5, 1998.     

Arithmetical semigroups II: sieving by large and small prime elements. Sets of multiples

The quantities ψ(x, y), ϕ(x, y) which denote the number of positive integers ≤x without prime divisors >y,<y respectively as well as the concept of a set of multiples within ℕ together with many wellknown results on these have their counterpart in arithmetical semigroups.     

On circle containment orders

A partially ordered set is called acircle containment order provided one can assign to each element of the poset a circle in the plane so thatxy iff the circle assigned tox is contained in the circle assigned toy. It has been conjectured that every finite three-dimensional partially ordered set is a circle containment order. We show that the infinite three dimensional posetZ ³ isnot a circle containment order.Research supported in part by the Office of Naval Research, contract number N00014-85-K0622.Research supported in part by National Science Foundation, grant number DMS-8403646.     

An inequality relating algebraic and trigonometric derivatives

Using the correspondence x↔ cos θ, where −1≤x ≤ 1 and 0 ≤ θ ≤ π, a function f(x) defined on [−1, 1] can be represented as a 2π-periodic function F(θ), and then the derivative f′(x) corresponds to . From these observations, weighted-norm estimates for first and higher derivatives by x will be obtained, using a generalized Hardy inequality. The results in turn imply the generalized Hardy inequality upon which they depend and will hold true in any weighted norm for which the generalized Hardy is true.     

DENSEST CIRCLE PACKING ON THE FLAT TORUS

Melissen [1] considered packings of k congruent circles in the symmetric flat torus T ² = [0, 1)² and determined the largest possible radius for k ≤ 4. In the present paper the analogous problem is studied for an arbitrary asymmetric torus T′² = [0,b) × [0,a), 0 < a ≤ b and the maximal radius is found again for k ≤ 4. This revised version was published online in August 2006 with corrections to the Cover Date.     

Weak-Geodetically Closed Subgraphs in Distance-Regular Graphs

 Let Γ=(X,R) denote a distance-regular graph with diameter D≥2 and distance function δ. A (vertex) subgraph Ω⊆X is said to be weak-geodetically closed whenever for all x,y∈Ω and all z∈X,