A counterexample to Wood's conjecture

We prove that if the one-point compactification of a locally compact, noncompact Hausdorff space L is the topological space called pseudoarc, then C₀(L,C) is almost transitive. We also obtain two necessary conditions on a metrizable locally compact Hausdorff space L for C₀(L) being almost transitive.     

Workshop lecture on products of Fréchet spaces

The general question, “When is the product of Fréchet spaces Fréchet?” really depends on the questions of when a product of α₄ Fréchet spaces (also known as strongly Fréchet or countably bisequential spaces) is α₄, and when it is Fréchet. Two subclasses of the class of strongly Fréchet spaces shed much light on these questions. These are the class of α₃ Fréchet spaces and its subclass of ℵ₀-bisequential spaces. The latter is closed under countable products, the former not even under finite products. A number of fundamental results and open problems are recalled, some further highlighting the difference between being α₃ and Fréchet and being ℵ₀-bisequential.     

Weighted-Hardy functions with Hadamard gaps on the unit ball

We prove that an analytic function f on the unit ball B with Hadamard gaps, that is, (the homogeneous polynomial expansion of f) satisfying n_k+1/n_k?λ>1 for all k∈N, belongs to the space if and only if . Moreover, we show that the following asymptotic relation holds . Also we prove that lim_r→1(1-r²)^α‖Rf_r‖_p=0 if and only if . These results confirm two conjectures from the following recent paper [S. Stevi?, On Bloch-type functions with Hadamard gaps, Abstr. Appl. Anal. 2007 (2007) 8 pages (Article ID 39176)].     

Quantum Brownian motion and generalizations of Hermite polynomials

We introduce new families of orthogonal polynomials H_D,n, motivated by the non-equilibrium evolution of a quantum Brownian particle (qBp). The H_D,n’s generalize non-trivially the standard Hermite polynomials, employed for classical Brownian motion. We treat several models (labelled by D) for a non-equilibrium qBp, by means of the Wigner function W, in the presence of a “heat bath” at thermal equilibrium, with and without ab initio friction. For long times (for a suitable class of initial conditions), the non-equilibrium Wigner function W should approach, in some sense, the (time-independent) equilibrium Wigner function W_eq,D, which describes the thermal equilibrium of the qBp with the “heat bath” and plays a central role. W_eq,D is chosen to be the weight function which orthogonalizes the H_D,n’s. New results on W_eq,D and on the H_D,n’s are reported. We justify the key role of the H_D,n’s as follows. Using the H_D,n’s, moments W_eq,D,n and W_n are introduced for W_eq,D and W, respectively. At equilibrium, all moments W_eq,D,n except the lowest one (W_eq,D,0) vanish identically. Off-equilibrium, one expects that, for long times (for suitable initial conditions): (i) all non-equilibrium moments W_n (except the lowest moment W₀), will approach zero, while (ii) the lowest non-equilibrium moment W₀ will tend to W_eq,D,0(≠0). To complete the justification, we outline how the approximate long-time non-equilibrium theories determined by W₀ for the different models (D) yield Smoluchowski equations and irreversible evolutions of the qBp towards thermal equilibrium.     

On symmetric graphs of valency five

A graph X, with a subgroup G of the automorphism group of X, is said to be (G,s)-transitive, for some s≥1, if G is transitive on s-arcs but not on (s+1)-arcs, and s-transitive if it is -transitive. Let X be a connected (G,s)-transitive graph, and G_v the stabilizer of a vertex v∈V(X) in G. If X has valency 5 and G_v is solvable, Weiss [R.M. Weiss, An application of p-factorization methods to symmetric graphs, Math. Proc. Camb. Phil. Soc. 85 (1979) 43-48] proved that s≤3, and in this paper we prove that G_v is isomorphic to the cyclic group Z₅, the dihedral group D₁₀ or the dihedral group D₂₀ for s=1, the Frobenius group F₂₀ or F₂₀×Z₂ for s=2, or F₂₀×Z₄ for s=3. Furthermore, it is shown that for a connected 1-transitive Cayley graph of valency 5 on a non-abelian simple group G, the automorphism group of is the semidirect product , where R(G) is the right regular representation of G and .     

Weighted interpolation in Paley-Wiener spaces and finite-time controllability

This paper considers the solution of weighted interpolation problems in model subspaces of the Hardy space H² that are canonically isometric to Paley-Wiener spaces of analytic functions. A new necessary and sufficient condition is given on the set of interpolation points which guarantees that a solution in H² can be transferred to a solution in a model space. The techniques used rely on the reproducing kernel thesis for Hankel operators, which is given here with an explicit constant. One of the applications of this work is to the finite-time controllability of diagonal systems specified by a C₀ semigroup.     

More on “Connected (n, m)-graphs with minimum and maximum zeroth-order general Randi? index”

Let G be a graph and d(u) denote the degree of a vertex u in G. The zeroth-order general Randi? index ⁰R_α(G) of the graph G is defined as ∑_u∈V(G)d(u)^α, where the summation goes over all vertices of G and α is an arbitrary real number. In this paper we correct the proof of the main Theorem 3.5 of the paper by Hu et al. [Y. Hu, X. Li, Y. Shi, T. Xu, Connected (n,m)-graphs with minimum and maximum zeroth-order general Randi? index, Discrete Appl. Math. 155 (8) (2007) 1044-1054] and give a more general Theorem. We finally characterize ¹ for α<0 the connected G(n,m)-graphs with maximum value ⁰R_α(G(n,m)), where G(n,m) is a simple connected graph with n vertices and m edges.     

Determining tension parameters in rational gamma-spline interpolation

Inspired by the classic γ-spline, we propose a method for constructing a G² rational γ-spline curve that interpolates a given set of distinct ordered data-points (planar or spatial). The only input of our method is just these data-points. We also present a procedure to solve the key problem of determining the tension parameters γ_i which are computed in terms of exponential functions that determine the eccentricities of the common conic osculants at the junction points while keeping in geometrical agreement with data-points. This allows the resulting curve to be modified in the close vicinity of each data-point.     

Endomorphisms of the shift dynamical system, discrete derivatives, and applications

All continuous endomorphisms f_∞ of the shift dynamical system S on the 2-adic integers Z₂ are induced by some , where n is a positive integer, B_n is the set of n-blocks over {0, 1}, and f_∞(x)=y₀y₁y₂… where for all i∈N, y_i=f(x_ix_i+1…x_i+n−1). Define D:Z₂→Z₂ to be the endomorphism of S induced by the map {(00,0),(01,1),(10,1),(11,0)} and V:Z₂→Z₂ by V(x)=−1−x. We prove that D, V°D, S, and V°S are conjugate to S and are the only continuous endomorphisms of S whose parity vector function is solenoidal. We investigate the properties of D as a dynamical system, and use D to construct a conjugacy from the 3x+1 function T:Z₂→Z₂ to a parity-neutral dynamical system. We also construct a conjugacy R from D to T. We apply these results to establish that, in order to prove the 3x+1 conjecture, it suffices to show that for any m∈Z⁺, there exists some n∈N such that R⁻¹(m) has binary representation of the form or .     

A class of essential representations of product systems

We construct a family of essential representations of an arbitrary product system by generalizing some techniques introduced by M. Skeide and W. Arveson. We then classify the resulting E₀-semigroups up to conjugacy, by identifying their tail flows as periodic W^∗-dynamical systems acting on factors of type I_∞. The conjugacy classes of these E₀-semigroups correspond to the orbits of the action of the automorphism group of the product system on unital vectors. In the sequel, this classification shows explicitly that any E₀-semigroup admits uncountably many non-conjugate cocycle perturbations.     

On certain spaces of vector measures of bounded variation

If (Σ,X) is a measurable space and X a Banach space we investigate the X-inheritance of copies of ?_∞ in certain subspaces Δ(Σ,X) of bvca(Σ,X), the Banach space of all X-valued countable additive measures of bounded variation equipped with the variation norm. Among the consequences of our main theorem we get a theorem of J. Mendoza on the X-inheritance of copies of ?_∞ in the Bochner space L₁(μ,X) and other of the author on the X-inheritance of copies of ?_∞ in bvca(Σ,X).     

A first-order differential double subordination with applications

Let q₁ and q₂ belong to a certain class of normalized analytic univalent functions in the open unit disk of the complex plane. Sufficient conditions are obtained for normalized analytic functions p to satisfy the double subordination chain q₁(z)?p(z)?q₂(z). The differential sandwich-type result obtained is applied to normalized univalent functions and to Φ-like functions.     

Variations on a theme of Boole and Stein-Weiss

We give an alternative proof of a theorem of Stein and Weiss: The distribution function of the Hilbert transform of a characteristic function of a set E only depends on the Lebesgue measure |E| of such a set. We exploit a rational change of variable of the type used by George Boole in his paper “On the comparison of transcendents, with certain applications to the theory of definite integrals” together with the observation that if two functions f and g have the same Lp norm in a range of exponents p₁<p<p₂ then their distribution functions coincide.     

Twisted first homology groups of the automorphism group of a free group

The automorphism group and outer automorphism group of a free group F_n of rank n act on the abelianized group H of F_n and the dual group H^* of H. The twisted first homology groups of and with coefficients in H and H^* are calculated.     

A generalization of a conjecture due to Erd?s, Jacobson and Lehel

An r-graph is a loopless undirected graph in which no two vertices are joined by more than r edges. An r-complete graph on m+1 vertices, denoted by , is an r-graph on m+1 vertices in which each pair of vertices is joined by exactly r edges. A non-increasing sequence π=(d₁,d₂,…,d_n) of nonnegative integers is r-graphic if it is realizable by an r-graph on n vertices. Let be the smallest even integer such that each n-term r-graphic sequence with term sum of at least is realizable by an r-graph containing as a subgraph. In this paper, we determine the value of for sufficiently large n, which generalizes a conjecture due to Erd?s, Jacobson and Lehel.     

Labeling graphs with two distance constraints

Given a graph G and integers p,q,d₁ and d₂, with p>q, d₂>d₁?1, an L(d₁,d₂;p,q)-labeling of G is a function f:V(G)→{0,1,2,…,n} such that |f(u)−f(v)|?p if d_G(u,v)?d₁ and |f(u)−f(v)|?q if d_G(u,v)?d₂. A k-L(d₁,d₂;p,q)-labeling is an L(d₁,d₂;p,q)-labeling f such that max_v∈V(G)f(v)?k. The L(d₁,d₂;p,q)-labeling number ofG, denoted by , is the smallest number k such that G has a k-L(d₁,d₂;p,q)-labeling. In this paper, we give upper bounds and lower bounds of the L(d₁,d₂;p,q)-labeling number for general graphs and some special graphs. We also discuss the L(d₁,d₂;p,q)-labeling number of G, when G is a path, a power of a path, or Cartesian product of two paths.     

Identities for the Widder transform and transforms with Bessel function kernels

In the present paper, we consider the classical Widder transform, the H_ν-transform, the K_ν-transform, and the Y_ν-transform. Some identities involving these transforms and many others are given. By making use of these identities, a number of new Parseval-Goldstein type identities are obtained for these and other well-known integral transforms.     

Colouring games on outerplanar graphs and trees

Let f be a graph function which assigns to each graph H a non-negative integer f(H)≤|V(H)|. The f-game chromatic number of a graph G is defined through a two-person game. Let X be a set of colours. Two players, Alice and Bob, take turns colouring the vertices of G with colours from X. A partial colouring c of G is legal (with respect to graph function f) if for any subgraph H of G, the sum of the number of colours used in H and the number of uncoloured vertices of H is at least f(H). Both Alice and Bob must colour legally (i.e., the partial colouring produced needs to be legal). The game ends if either all the vertices are coloured or there are uncoloured vertices with no legal colour. In the former case, Alice wins the game. In the latter case, Bob wins the game. The f-game chromatic number of G, χ_g(f,G), is the least number of colours that the colour set X needs to contain so that Alice has a winning strategy. Let be the graph function defined as , for any n≥3 and otherwise. Then is called the acyclic game chromatic number of G. In this paper, we prove that any outerplanar graph G has acyclic game chromatic number at most 7. For any integer k, let ?_k be the graph function defined as ?_k(K₂)=2 and ?_k(P_k)=3 (P_k is the path on k vertices) and ?_k(H)=0 otherwise. This paper proves that if k≥8 then for any tree T, χ_g(?_k,T)≤9. On the other hand, if k≤6, then for any integer n, there is a tree T such that χ_g(?_k,T)≥n.     

Path bundles on n-cubes

A path bundle is a set of 2^a paths in an n-cube, denoted Q_n, such that every path has the same length, the paths partition the vertices of Q_n, the endpoints of the paths induce two subcubes of Q_n, and the endpoints of each path are complements. This paper shows that a path bundle exists if and only if n>0 is odd and 0?a?n-⌈log₂(n+1)⌉.