Reznichenko families of trees and their applications

Examples of Talagrand, Gul'ko and Corson compacta resulting from Reznichenko families of trees are presented. The K_σδ property for weakly -analytic Banach spaces with an unconditional basis is proved.     

Hessenberg pairs of linear transformations

Let denote a field and V denote a nonzero finite-dimensional vector space over . We consider an ordered pair of linear transformations A:V→V and A^*:V→V that satisfy (i)–(iii) below.

1. [(i)]Each of A,A^* is diagonalizable on V.

2. [(ii)]There exists an ordering of the eigenspaces of A such that

where V_-1=0, V_d+1=0.

3. [(iii)]There exists an ordering of the eigenspaces of A^* such that

where , .

We call such a pair a Hessenberg pair on V. In this paper we obtain some characterizations of Hessenberg pairs. We also explain how Hessenberg pairs are related to tridiagonal pairs.

A bilinear form relating two Leonard systems

Let Φ, Φ^′ be Leonard systems over a field , and V, V^′ the vector spaces underlying Φ, Φ^′, respectively. In this paper, we introduce and discuss a balanced bilinear form on V×V^′. Such a form naturally arises in the study of Q-polynomial distance-regular graphs. We characterize a balanced bilinear form from several points of view.     

A hybrid approximation method for equilibrium and fixed point problems for a family of infinitely nonexpansive mappings and a monotone mapping

In this paper, we introduce a new iterative scheme for finding a common element of the set of fixed points of a family of infinitely nonexpansive mappings, the set of solutions of an equilibrium problem and the set of solutions of the variational inequality for α-inverse-strongly monotone mapping in the framework of a Hilbert space. Under suitable conditions, some strong convergence theorems for approximating a common element of the above three sets are obtained. Additionally, we utilize our results to study the optimization problem and find a zero of a maximal monotone operator and a strictly pseudocontractive mapping in a real Hilbert space. Our results improve and extend the results announced by many others.     

On reducibility of n-ary quasigroups

An n-ary operation Q:Σⁿ→Σ is called an n-ary quasigroup of order |Σ| if in the relation x₀=Q(x₁,…,x_n) knowledge of any n elements of x₀,…,x_n uniquely specifies the remaining one. Q is permutably reducible if Q(x₁,…,x_n)=P(R(x_σ(1),…,x_σ(k)),x_σ(k+1),…,x_σ(n)) where P and R are (n-k+1)-ary and k-ary quasigroups, σ is a permutation, and 1<k<n. An m-ary quasigroup S is called a retract of Q if it can be obtained from Q or one of its inverses by fixing n-m>0 arguments. We prove that if the maximum arity of a permutably irreducible retract of an n-ary quasigroup Q belongs to {3,…,n-3}, then Q is permutably reducible.     

Finitely additive representation of spaces

Let be any atomless and countably additive probability measure on the product space with the usual σ-algebra. Then there is a purely finitely additive probability measure λ on the power set of a countable subset such that can be isometrically isomorphically embedded as a closed subspace of L^p(λ). The embedding is strict. It is also ‘canonical,’ in the sense that it maps simple and continuous functions on to their restrictions to T.     

Central limit theorem and the bootstrap for -statistics of strongly mixing data

The asymptotic normality of U-statistics has so far been proved for iid data and under various mixing conditions such as absolute regularity, but not for strong mixing. We use a coupling technique introduced in 1983 by Bradley [R.C. Bradley, Approximation theorems for strongly mixing random variables, Michigan Math. J. 30 (1983),69–81] to prove a new generalized covariance inequality similar to Yoshihara’s [K. Yoshihara, Limiting behavior of U-statistics for stationary, absolutely regular processes, Z. Wahrsch. Verw. Gebiete 35 (1976), 237–252]. It follows from the Hoeffding-decomposition and this inequality that U-statistics of strongly mixing observations converge to a normal limit if the kernel of the U-statistic fulfills some moment and continuity conditions.The validity of the bootstrap for U-statistics has until now only been established in the case of iid data (see [P.J. Bickel, D.A. Freedman, Some asymptotic theory for the bootstrap, Ann. Statist. 9 (1981), 1196–1217]. For mixing data, Politis and Romano [D.N. Politis, J.P. Romano, A circular block resampling procedure for stationary data, in: R. Lepage, L. Billard (Eds.), Exploring the Limits of Bootstrap, Wiley, New York, 1992, pp. 263–270] proposed the circular block bootstrap, which leads to a consistent estimation of the sample mean’s distribution. We extend these results to U-statistics of weakly dependent data and prove a CLT for the circular block bootstrap version of U-statistics under absolute regularity and strong mixing. We also calculate a rate of convergence for the bootstrap variance estimator of a U-statistic and give some simulation results.     

The binding number of a graph and its cliques

We consider the binding numbers of K_r-free graphs, and improve the upper bounds on the binding number which force a graph to contain a clique of order r. For the case r=4, we provide a construction for K₄-free graphs which have a larger binding number than the previously known constructions. This leads to a counterexample to a conjecture by Caro regarding the neighborhoods of independent sets.     

On partial sums of certain meromophic -valent functions

In this paper, we study the ratio of meromorphic p-valent functions in the punctured disk U^*={z:0<|z|<1} of the form to its sequence of partial sums of the form . Also, we determine sharp lower bounds for and .     

Embedding fillings of contact 3-manifolds

In this survey article, we describe different ways of embedding fillings of contact 3-manifolds into closed symplectic 4-manifolds.     

Formal systems of fuzzy logic and their fragments

Formal systems of fuzzy logic (including the well-known Łukasiewicz and Gödel–Dummett infinite-valued logics) are well-established logical systems and respected members of the broad family of the so-called substructural logics closely related to the famous logic BCK. The study of fragments of logical systems is an important issue of research in any class of non-classical logics. Here we study the fragments of nine prominent fuzzy logics to all sublanguages containing implication. However, the results achieved in the paper for those nine logics are usually corollaries of theorems with much wider scope of applicability. In particular, we show how many of these fragments are really distinct and we find axiomatic systems for most of them. In fact, we construct strongly separable axiomatic systems for eight of our nine logics. We also fully answer the question for which of the studied fragments the corresponding class of algebras forms a variety. Finally, we solve the problem how to axiomatize predicate versions of logics without the lattice disjunction (an essential connective in the usual axiomatic system of fuzzy predicate logics).     

On the nonlinear wave equation with the mixed nonhomogeneous conditions: Linear approximation and asymptotic expansion of solutions

In this paper, we consider the following nonlinear wave equation

(1)

where , , μ, f, g are given functions. To problem (1), we associate a linear recursive scheme for which the existence of a local and unique weak solution is proved by applying the Faedo–Galerkin method and the weak compact method. In the case of , , μ(z)≥μ₀>0, μ₁(z)≥0, for all , and , , , a weak solution u_ε1,ε2(x,t) having an asymptotic expansion of order N+1 in two small parameters ε₁, ε₂ is established for the following equation associated to (1)_2,3:

(2)

     

On Banach spaces whose norm-open sets are -sets in the weak topology

We investigate non-separable Banach spaces whose norm-open sets are countable unions of sets closed in the weak topology and a narrower class of Banach spaces with a network for the norm topology which is σ-discrete in the weak topology. In particular, we answer a question of Arhangel'skii exhibiting various examples of non-separable function spaces C(K) with a σ-discrete network for the pointwise topology and (consistently) we answer some questions of Edgar and Oncina concerning Borel structures and Kadec renormings in Banach spaces.     

On -convergence of Fourier series

In this paper we consider the trigonometric Fourier series with the β-general monotone coefficients. Necessary and sufficient conditions of L₁-convergence for such a series, that is f−S_n=o(1), are obtained in terms of coefficients.     

A new iterative method for equilibrium problems and fixed point problems of infinitely nonexpansive mappings and monotone mappings

In this paper, we introduce a new iterative scheme for finding the common element of the set of common fixed points of infinitely many nonexpansive mappings, the set of solutions of an equilibrium problem and the set of solutions of the variational inequality for α-inverse-strongly monotone mapping in Hilbert spaces. We prove that the sequence converges strongly to a common element of the above three sets under some parameters controlling conditions. This main result improve and extend Plubtieng and Punpaeng’s corresponding result [S. Plubtieng, R. Punpaeng, A new iterative method for equilibrium problems and fixed point problems of nonexpansive mappings and monotone mappings, Applied Mathematics and Computation 197 (2008), 548–558]. Using this theorem, we obtain three corollaries.     

On reality and asymptotics of zeros of -Hankel transforms

We give sufficient conditions which guarantee that the finite q-Hankel transforms have only real zeros which satisfy some asymptotic relations. The study is carried out using two different techniques. The first is by a use of Rouché's theorem and the other is by applying a theorem of Hurwitz and Biehler. In every study further restrictions are imposed on q(0,1). We compare the results via some interesting applications involving second and third q-Bessel functions as well as q-trigonometric functions.     

Highly connected coloured subgraphs via the regularity lemma

For integers , n≥k and r≥s, let m(n,r,s,k) be the largest (in order) k-connected component with at most s colours one can find in any r-colouring of the edges of the complete graph K_n on n vertices. Bollobás asked for the determination of m(n,r,s,k).Here, bounds are obtained in the cases s=1,2 and k=o(n), which extend results of Liu, Morris and Prince. Our techniques use Szemerédi’s Regularity Lemma for many colours.We shall also study a similar question for bipartite graphs.