Property (w) and perturbations II

This note is a continuation of a previous article [P. Aiena, M.T. Biondi, Property (w) and perturbations, J. Math. Anal. Appl. 336 (2007) 683-692] concerning the stability of property (w), a variant of Weyl's theorem, for a bounded operator T acting on a Banach space, under finite-dimensional perturbations K commuting with T. A counterexample shows that property (w) in general is not preserved under finite-dimensional perturbations commuting with T, also under the assumption that T is a-isoloid.     

A cohomological description of property (T) for quantum groups

We prove a Delorme-Guichardet type theorem for discrete quantum groups expressing property (T) of the quantum group in question in terms of its first cohomology groups. As an application, we show that the first L²-Betti number of a discrete property (T) quantum group vanishes.     

Optimal stopping for non-linear expectations—Part II

Relying on the stochastic analysis tools developed in Bayraktar and Yao (2011) [1], we solve the optimal stopping problems for non-linear expectations.     

Letter to the Editor: A note on the preconditioned Gauss-Seidel (GS) method for linear systems

Wen Li (J. Comput. Appl. Math., 182 (2005) 81-90) asserted that there are some errors in article by Hiroshi Niki, Kyouji Harada, Munenori Morimoto and Michio Sakakihara (J. Comput. Appl. Math., 164-165 (2004) 587-600). And Li presented a new proof for the corresponding results in H. Niki et al. In this paper, we point out some errors in Li’s assertion. Moreover, we show that a new proof presented by Li is imperfect.     

Generalization of matching extensions in graphs (III)

Proposing them as a general framework, Liu and Yu (2001) [6] introduced (n,k,d)-graphs to unify the concepts of deficiency of matchings, n-factor-criticality and k-extendability. Let G be a graph and let n,k and d be non-negative integers such that n+2k+d+2?|V(G)| and |V(G)|−n−d is even. If on deleting any n vertices from G the remaining subgraph H of G contains a k-matching and each k-matching can be extended to a defect-d matching in H, then G is called an (n,k,d)-graph. In this paper, we obtain more properties of (n,k,d)-graphs, in particular the recursive relations of (n,k,d)-graphs for distinct parameters n,k and d. Moreover, we provide a characterization for maximal non-(n,k,d)-graphs.     

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.     

Soliton solutions of a BBM(m, n) equation with generalized evolution

We consider a BBM(m, n) equation which is a generalization of the celebrated Benjamin-Bona-Mahony equation with generalized evolution term. By using two solitary wave ansatze in terms of sech^p(x) and tanh^p(x) functions, we find exact analytical bright and dark soliton solutions for the considered model. The physical parameters in the soliton solutions are obtained as function of the dependent model coefficients. The conditions of existence of solitons are presented. Note that, it is always useful and desirable to construct exact analytical solutions especially soliton-type envelope for the understanding of most nonlinear physical phenomena.     

Relative difference sets fixed by inversion (III)—Cocycle theoretical approach

In this paper, we give a characterization of a group G which contains a semiregular relative difference set R relative to a central subgroup N containing the commutator subgroup [G,G] of G such that 1∈R and rRr=R for all r∈R. In particular, these relative difference sets are fixed by inversion and inner automorphisms of the group are multipliers. We also present a construction of such relative difference sets.     

Positive Quaternion Kähler Manifolds with fourth Betti number equal to one

Positive Quaternion Kähler Manifolds are Riemannian manifolds with holonomy contained in Sp(n)Sp(1) and with positive scalar curvature. Conjecturally, they are symmetric spaces. In this article we are mainly concerned with Positive Quaternion Kähler Manifolds M satisfying b₄(M)=1. Generalising a result of Galicki and Salamon we prove that M4n in this case is homothetic to a quaternionic projective space if 2≠n?6.     

Lim's theorems for multivalued mappings in CAT(0) spaces

Let X be a complete CAT(0) space. We prove that, if E is a nonempty bounded closed convex subset of X and a nonexpansive mapping satisfying the weakly inward condition, i.e., there exists p∈E such that ∀x∈E, ∀α∈[0,1], then T has a fixed point. In Banach spaces, this is a result of Lim [On asymptotic centers and fixed points of nonexpansive mappings, Canad. J. Math. 32 (1980) 421-430]. The related result for unbounded R-trees is given.     

On (s,t)-supereulerian graphs in locally highly connected graphs

Given two nonnegative integers s and t, a graph G is (s,t)-supereulerian if for any disjoint sets X,Y⊂E(G) with |X|≤s and |Y|≤t, there is a spanning eulerian subgraph H of G that contains X and avoids Y. We prove that if G is connected and locally k-edge-connected, then G is (s,t)-supereulerian, for any pair of nonnegative integers s and t with s+t≤k−1. We further show that if s+t≤k and G is a connected, locally k-edge-connected graph, then for any disjoint sets X,Y⊂E(G) with |X|≤s and |Y≤t, there is a spanning eulerian subgraph H that contains X and avoids Y, if and only if G−Y is not contractible to K₂ or to K_2,l with l odd.     

Relative difference sets fixed by inversion (ii)—character theoretical approach

In this paper, we continue our investigation of relative difference sets fixed by inversion. We exclusively focus our attention on abelian groups. New necessary conditions are obtained and a new family of such relative difference sets with forbidden subgroup Z/4Z is constructed. The methods we use are character theory of abelian groups and Galois rings over Z/4Z.     

Multilinear commutators of Calderón-Zygmund operators on Hardy-type spaces with non-doubling measures

Under the assumption that μ is a non-negative Radon measure on Rd which only satisfies some growth condition, the authors obtain the boundedness in some Hardy-type spaces of multilinear commutators generated by Calderón-Zygmund operators or fractional integrals with RBMO(μ) functions, where the Hardy-type spaces are some appropriate subspaces, associated to the considered RBMO(μ) functions, of the Hardy space H¹(μ) of Tolsa.     

On (d,1)-total numbers of graphs

A (d,1)-total labelling of a graph G assigns integers to the vertices and edges of G such that adjacent vertices receive distinct labels, adjacent edges receive distinct labels, and a vertex and its incident edges receive labels that differ in absolute value by at least d. The span of a (d,1)-total labelling is the maximum difference between two labels. The (d,1)-total number, denoted , is defined to be the least span among all (d,1)-total labellings of G. We prove new upper bounds for , compute some for complete bipartite graphs K_m,n, and completely determine all for d=1,2,3. We also propose a conjecture on an upper bound for in terms of the chromatic number and the chromatic index of G.     

On constants in the Füredi-Hajnal and the Stanley-Wilf conjecture

For a given permutation matrix P, let fP(n) be the maximum number of 1-entries in an n×n(0,1)-matrix avoiding P and let SP(n) be the set of all n×n permutation matrices avoiding P. The Füredi-Hajnal conjecture asserts that cP:=limn→∞fP(n)/n is finite, while the Stanley-Wilf conjecture asserts that is finite.In 2004, Marcus and Tardos proved the Füredi-Hajnal conjecture, which together with the reduction introduced by Klazar in 2000 proves the Stanley-Wilf conjecture.We focus on the values of the Stanley-Wilf limit (sP) and the Füredi-Hajnal limit (cP). We improve the reduction and obtain which decreases the general upper bound on sP from sP?constconstO(klog(k)) to sP?constO(klog(k)) for any k×k permutation matrix P. In the opposite direction, we show .For a lower bound, we present for each k a k×k permutation matrix satisfying cP=Ω(k²).     

Zeros of orthogonal Laurent polynomials and solutions of strong Stieltjes moment problems

The strong Stieltjes moment problem for a bisequence consists of finding positive measures μ with support in [0,∞) such that

     

Turán's theorem for pseudo-random graphs

The generalized Turán number ex(G,H) of two graphs G and H is the maximum number of edges in a subgraph of G not containing H. When G is the complete graph Km on m vertices, the value of ex(Km,H) is , where o(1)→0 as m→∞, by the Erd?s-Stone-Simonovits theorem.In this paper we give an analogous result for triangle-free graphs H and pseudo-random graphs G. Our concept of pseudo-randomness is inspired by the jumbled graphs introduced by Thomason [A. Thomason, Pseudorandom graphs, in: Random Graphs '85, Poznań, 1985, North-Holland, Amsterdam, 1987, pp. 307-331. MR 89d:05158]. A graph G is (q,β)-bi-jumbled if

     

On the complexity of the multicut problem in bounded tree-width graphs and digraphs

Given an edge- or vertex-weighted graph or digraph and a list of source-sink pairs, the minimum multicut problem consists in selecting a minimum weight set of edges or vertices whose removal leaves no path from each source to the corresponding sink. This is a classical NP-hard problem, and we show that the edge version becomes tractable in bounded tree-width graphs if the number of source-sink pairs is fixed, but remains NP-hard in directed acyclic graphs and APX-hard in bounded tree-width and bounded degree unweighted digraphs. The vertex version, although tractable in trees, is proved to be NP-hard in unweighted cacti of bounded degree and bounded path-width.     

Remark on uniqueness of mild solutions to the Navier-Stokes equations

We investigate a limiting uniqueness criterion to the Navier-Stokes equations. We prove that the mild solution is unique under the class , where bmo^-1 is the “critical” space including Lⁿ. As an application of uniqueness theorem, we also consider the local well-posedness of Navier-Stokes equations in bmo^-1.     

Faulhaber’s theorem on power sums

We observe that the classical Faulhaber’s theorem on sums of odd powers also holds for an arbitrary arithmetic progression, namely, the odd power sums of any arithmetic progression a+b,a+2b,…,a+nb is a polynomial in na+n(n+1)b/2. While this assertion can be deduced from the original Fauhalber’s theorem, we give an alternative formula in terms of the Bernoulli polynomials. Moreover, by utilizing the central factorial numbers as in the approach of Knuth, we derive formulas for r-fold sums of powers without resorting to the notion of r-reflective functions. We also provide formulas for the r-fold alternating sums of powers in terms of Euler polynomials.