Approximation numbers for the finite sections of Toeplitz operators with piecewise continuous symbols

In this paper we discuss the asymptotic distribution of the approximation numbers of the finite sections for a Toeplitz operator T(a)∈L(?p), 1<p<∞, where a is a piecewise continuous function on the unit circle. We prove that the behavior of the approximation numbers of the finite sections Tn(a)=PnT(a)Pn depends heavily on the Fredholm properties of the operators T(a) and . In particular, if the operators T(a) and are Fredholm on ?p, then the approximation numbers of Tn(a) have the so-called k-splitting property. But, in contrast with the case of continuous symbols, the splitting number k is in general larger than .     

Generating functions via integral transforms

In this paper, we use some integral transforms to derive, for a polynomial sequence {Pn(x)}_n?0, generating functions of the type , starting from a generating function of type , where {γn}_n?0 is a real numbers sequence independent on x and t. That allows us to unify the treatment of a generating function problem for many well-known polynomial sequences in the literature.     

Second order asymptotic behaviour of subordinated sequences with longtailed subordinator

Suppose that {a(n)} is a discrete probability distribution on the set N₀={0,1,2,…} and {p(n)} is some non-negative sequence defined on the same set. The equation defines a new sequence {b(n)}. Here {a*k(n)} denotes the k-fold convolution of the distribution {a(n)}. In the paper the asymptotic behaviour of the sequence {b(n)} is investigated. It is known that for the large classes of the sequences {a(n)} and {p(n)}, b(n)∼σp([σn]), where 1/σ is the mean of the distribution {a(n)}. The main object of the present work is to estimate the difference b(n)−σp([σn]) for some classes of the sequences {a(n)} and {p(n)}.     

Transcendence of certain infinite products

We prove the transcendence results for the infinite product , where Ek(x), Fk(x) are polynomials, α is an algebraic number, and r?2 is an integer. As applications, we give necessary and sufficient conditions for transcendence of and , where Fn and Ln are Fibonacci numbers and Lucas numbers respectively, and {ak}_k?0 is a sequence of algebraic numbers with log‖ak‖=o(rk).     

Strong and weak convergence theorems for common fixed points of nonself asymptotically nonexpansive mappings

Suppose that K is a nonempty closed convex nonexpansive retract of a real uniformly convex Banach space E. Let be two nonself asymptotically nonexpansive mappings with sequences {kn},{ln}⊂[1,∞), limn→∞kn=1, limn→∞ln=1, , respectively. Suppose {xn} is generated iteratively by

     

Systems of orthogonal polynomials arising from the modular j-function

Let be the polynomial whose zeros are the j-invariants of supersingular elliptic curves over . Generalizing a construction of Atkin described in a recent paper by Kaneko and Zagier (Computational Perspectives on Number Theory (Chicago, IL, 1995), AMS/IP 7 (1998) 97-126), we define an inner product on for every . Suppose a system of orthogonal polynomials {P_n,ψ(x)}_n=0^∞ with respect to exists. We prove that if n is sufficiently large and ψ(x)P_n,ψ(x) is p-integral, then over . Further, we obtain an interpretation of these orthogonal polynomials as a p-adic limit of polynomials associated to p-adic modular forms.     

The Laplacian spectral radius of some bipartite graphs

In this paper, we study the largest Laplacian spectral radius of the bipartite graphs with n vertices and k cut edges and the bicyclic bipartite graphs, respectively. Identifying the center of a star K_1,k and one vertex of degree n of K_m,n, we denote by the resulting graph. We show that the graph (1?k?n-4) is the unique graph with the largest Laplacian spectral radius among the bipartite graphs with n vertices and k cut edges, and (n?7) is the unique graph with the largest Laplacian spectral radius among all the bicyclic bipartite graphs.     

On the Spaltenstein correspondence

In the article [Spa1], N. Spaltenstein has established a bijection between the irreducible components of _χ, the space of full flags fixed by a nilpotent element χ ? M(n, k), where k is an algebraically closed field, and the standard tableaux associated to the Young diagram of χ. In this present work we determine, when χ is of hook type, for each irreducible component X of _χ, the unique Schubert cell _X of the full flag manifold = (V) (where V is vector space of dimension n over k), such that X ∩ _X is a dense subspace in X. This result will allow us to optimize the computation of _χ and when k = is the complex field, to see that the graph resolution of the partition (2, 1, …, 1) of n is related to the Dynkin diagram of sl(n, ).     

Complexity results in graph reconstruction

We investigate the relative complexity of the graph isomorphism problem (GI) and problems related to the reconstruction of a graph from its vertex-deleted or edge-deleted subgraphs (in particular, deck checking (DC) and legitimate deck (LD) problems). We show that these problems are closely related for all amounts c?1 of deletion:

(1)

, , , and .

(2)

For all k?2, and .

(3)

For all k?2, .

(4)

.

(5)

For all k?2, .

For many of these results, even the c=1 case was not previously known.Similar to the definition of reconstruction numbers vrn_∃(G) [F. Harary, M. Plantholt, The graph reconstruction number, J. Graph Theory 9 (1985) 451-454] and ern_∃(G) (see [J. Lauri, R. Scapellato Topics in Graph Automorphism and Reconstruction, London Mathematical Society, Cambridge University Press, Cambridge, 2003, p. 120]), we introduce two new graph parameters, vrn_∀(G) and ern_∀(G), and give an example of a family {G_n}_n?4 of graphs on n vertices for which vrn_∃(G_n)<vrn_∀(G_n). For every k?2 and n?1, we show that there exists a collection of k graphs on (2^k-1+1)n+k vertices with 2ⁿ 1-vertex-preimages, i.e., one has families of graph collections whose number of 1-vertex-preimages is huge relative to the size of the graphs involved.     

Beta-expansion and continued fraction expansion

For any real number β>1, let ε(1,β)=(ε₁(1),ε₂(1),…,εn(1),…) be the infinite β-expansion of 1. Define . Let x∈[0,1) be an irrational number. We denote by kn(x) the exact number of partial quotients in the continued fraction expansion of x given by the first n digits in the β-expansion of x. If is bounded, we obtain that for all x∈[0,1)?Q,

     

Distance irredundance and connected domination numbers of a graph

Let k be a positive integer and G be a connected graph. This paper considers the relations among four graph theoretical parameters: the k-domination number γ_k(G), the connected k-domination number ; the k-independent domination number and the k-irredundance number ir_k(G). The authors prove that if an ir_k-set X is a k-independent set of G, then , and that for k?2, if ir_k(G)=1, if ir_k(G) is odd, and if ir_k(G) is even, which generalize some known results.     

Note on integer powers in sumsets

Let k,m,n?2 be integers. Let A be a subset of {0,1,…,n} with 0∈A and the greatest common divisor of all elements of A is 1. Suppose that

     

Strong convergence of the composite Halpern iteration

Let C be a closed convex subset of a uniformly smooth Banach space E and let T:C→C be a nonexpansive mapping with a nonempty fixed points set. Given a point u∈C, the initial guess x₀∈C is chosen arbitrarily and given sequences , and in (0,1), the following conditions are satisfied:

(i)

;

(ii)

αn→0, βn→0 and 0<a?γn, for some a∈(0,1);

(iii)

, and . Let be a composite iteration process defined by

     

A generalization of a classical zero-sum problem

In this note, we supply the details of the proof of the fact that if a₁,…,a_n+Ω(n) are integers, then there exists a subset M⊂{1,…,n+Ω(n)} of cardinality n such that the equation