Spectral theory of discontinuous functions of self-adjoint operators and scattering theory

In the smooth scattering theory framework, we consider a pair of self-adjoint operators H₀, H and discuss the spectral projections of these operators corresponding to the interval (−∞,λ). The purpose of the paper is to study the spectral properties of the difference D(λ) of these spectral projections. We completely describe the absolutely continuous spectrum of the operator D(λ) in terms of the eigenvalues of the scattering matrix S(λ) for the operators H₀ and H. We also prove that the singular continuous spectrum of the operator D(λ) is empty and that its eigenvalues may accumulate only at “thresholds” in the absolutely continuous spectrum.     

On the essential commutant of analytic Toeplitz operators associated with spherical isometries

Let T∈Bn(H) be an essentially normal spherical isometry with empty point spectrum on a separable complex Hilbert space H, and let AT⊂B(H) be the unital dual operator algebra generated by T. In this note we show that every operator S∈B(H) in the essential commutant of AT has the form S=X+K with a T-Toeplitz operator X and a compact operator K. Our proof actually covers a larger class of subnormal operator tuples, called A-isometries, which includes for example the tuple T=(Mz₁,…,Mzn)∈B(H²n(σ)) consisting of the multiplication operators with the coordinate functions on the Hardy space H²(σ) associated with the normalized surface measure σ on the boundary ∂D of a strictly pseudoconvex domain D⊂Cn. As an application we determine the essential commutant of the set of all analytic Toeplitz operators on H²(σ) and thus extend results proved by Davidson (1977) [6] for the unit disc and Ding and Sun (1997) [11] for the unit ball.     

Shilov boundary and p-adic injective analytic functions

Let K be an algebraically closed field complete with respect to a dense ultrametric absolute value |.|. Let D be an infraconnected affinoid subset of K and let H(D) be the Banach algebra of analytic elements on D. Let f ∈ H(D) be injective in D and let f _* be the mapping defined on the multiplicative spectrum of H(D) that identifies with the set of circular filters on D. We show that f _* is injective and maps bijectively the Shilov boundary of H(D) onto this of H(f(D)). Thanks to this property we give a new proof of the equality $\left| {f(x) - f(y)} \right| = \left| {x - y} \right|\sqrt {\left| {f'(x)f'(y)} \right|} $ .     

Norms of multiplication operators on Hardy spaces and weighted composition operators from Hardy spaces to weighted-type spaces on bounded symmetric domains

Let D be a bounded symmetric domain. We calculate operator norm of the multiplication operator on the Hardy space H^p(D), as well as of the weighted composition operator from H^p(D) to a weighted-type space.     

Chromatic number and complete graph substructures for degree sequences

Given a graphic degree sequence D, let χ(D) (respectively ω(D), h(D), and H(D)) denote the maximum value of the chromatic number (respectively, the size of the largest clique, largest clique subdivision, and largest clique minor) taken over all simple graphs whose degree sequence is D. It is proved that χ(D)≤h(D). Moreover, it is shown that a subdivision of a clique of order χ(D) exists where each edge is subdivided at most once and the set of all subdivided edges forms a collection of disjoint stars. This bound is an analogue of the Hajós Conjecture for degree sequences and, in particular, settles a conjecture of Neil Robertson that degree sequences satisfy the bound χ(D) ≤ H(D) (which is related to the Hadwiger Conjecture). It is also proved that χ(D) ≤ 6/5 ω(D)+ 3/5 and that χ(D) ≤ 4/5 ω(D) + 1/5 Δ(D)+1, where Δ(D) denotes the maximum degree in D. The latter inequality is related to a conjecture of Bruce Reed bounding the chromatic number by a convex combination of the clique number and the maximum degree. All derived inequalities are best possible     

Density of characters of bounded <Emphasis Type="Italic">p</Emphasis>-adic analytic functions in the topological dual

Let K be an ultrametric complete algebraically closed field, let D be a disk {x ∈ K ‖x| < R} (with R in the set of absolute values of K) and let A be the Banach algebra of bounded analytic functions in D. The vector space generated by the set of characters of A is dense in the topological dual of A if and only if K is not spherically complete. Let H(D) be the Banach algebra of analytic elements in D. The vector space generated by the set of characters of H(D) is never dense in the topological dual of H(D).     

The complexity of the minimum cost homomorphism problem for semicomplete digraphs with possible loops

For digraphs D and H, a mapping f:V(D)→V(H) is a homomorphism of D to H if uv∈A(D) implies f(u)f(v)∈A(H). For a fixed digraph H, the homomorphism problem is to decide whether an input digraph D admits a homomorphism to H or not, and is denoted as HOM(H).An optimization version of the homomorphism problem was motivated by a real-world problem in defence logistics and was introduced in Gutin, Rafiey, Yeo and Tso (2006) [13]. If each vertex u∈V(D) is associated with costs c_i(u),i∈V(H), then the cost of the homomorphism f is ∑_u∈V(D)c_f(u)(u). For each fixed digraph H, we have the minimum cost homomorphism problem forH and denote it as MinHOM(H). The problem is to decide, for an input graph D with costs c_i(u),u∈V(D),i∈V(H), whether there exists a homomorphism of D to H and, if one exists, to find one of minimum cost.Although a complete dichotomy classification of the complexity of MinHOM(H) for a digraph H remains an unsolved problem, complete dichotomy classifications for MinHOM(H) were proved when H is a semicomplete digraph Gutin, Rafiey and Yeo (2006) [10], and a semicomplete multipartite digraph Gutin, Rafiey and Yeo (2008) [12] and [11]. In these studies, it is assumed that the digraph H is loopless. In this paper, we present a full dichotomy classification for semicomplete digraphs with possible loops, which solves a problem in Gutin and Kim (2008) [9].     

RELATIONS AMONG SOME PARAMETERS OF HYPERGRAPHS

The relations among the dominating number, independence number and covering number of hypergraphs are investigated. Main results are as follows：Dv（H）≤min{α≤（H）, p（H）, p（H）, T（H）}; De（H）≤min{v（H）, T（H）, p（H）}; DT（H） ≤αT（H）; S（H）≤ Dv （H） ＋ α（H）≤n; 2≤ Dv （H） ＋ T（H） ≤n; 2 〈 Dv （H） ＋ v（H）≤n/2 ＋ [n/r]; Dv （H） ＋ p（H） 〈_n;2≤De（H） ＋ Dv（H）≤n/2 ＋ [n/r];α（H） ＋ De（H）≤n;2 ≤ De（H） ＋ v（H）≤2[n/r]; 2 De（H） ＋ p（H）≤n-r ＋ 2.     

The core operator and congruent submodules

The Hardy spaces H²(D²) can be conveniently viewed as a module over the polynomial ring C[z₁,z₂]. Submodules of H²(D²) have connections with many areas of study in operator theory. A large amount of research has been carried out striving to understand the structure of submodules under certain equivalence relations. Unitary equivalence is a well-known equivalence relation in set of submodules. However, the rigidity phenomenon discovered in [Douglas et al., Algebraic reduction and rigidity for Hilbert modules, Amer. J. Math. 117 (1) (1995) 75-92] and some other related papers suggests that unitary equivalence, being extremely sensitive to perturbations of zero sets, lacks the flexibility one might need for a classification of submodules. In this paper, we suggest an alternative equivalence relation, namely congruence. The idea is motivated by a symmetry and stability property that the core operator possesses. The congruence relation effectively classifies the submodules with a finite rank core operator. Near the end of the paper, we point out an essential connection of the core operator with operator model theory.     

Perturbing the boundary conditions of the generator of a cosine family

Let A be a densely defined, closed linear operator (which we shall call maximal operator) with domain D(A) on a Banach space X and consider closed linear operators L:D(A)???X and ??:D(A)???X (where ?X is another Banach space called boundary space). Putting conditions on L and ??, we show that the second order abstract Cauchy problem for the operator A _?? with A _?? u=Au and domain D(A _??):={u??D(A):Lu=??u} is well-posed and thus it generates a cosine operator function on the Banach space X.     

Harmonic functions of linear growth on solvable groups

We answer a question posed by Bonilla and Grosse-Erdmann by showing that the operators P(D) on the space of entire functions H(C), where D is the differentiation operator and P is a polynomial, do not possess a frequently hypercyclic subspace.     

Minimum cost and list homomorphisms to semicomplete digraphs

For digraphs D and H, a mapping f:V(D)→V(H) is a homomorphism of D to H if uv∈A(D) implies f(u)f(v)∈A(H). Let H be a fixed directed or undirected graph. The homomorphism problem for H asks whether a directed or undirected input graph D admits a homomorphism to H. The list homomorphism problem for H is a generalization of the homomorphism problem for H, where every vertex x∈V(D) is assigned a set L_x of possible colors (vertices of H).The following optimization version of these decision problems generalizes the list homomorphism problem and was introduced in Gutin et al. [Level of repair analysis and minimum cost homomorphisms of graphs, Discrete Appl. Math., to appear], where it was motivated by a real-world problem in defence logistics. Suppose we are given a pair of digraphs D,H and a positive integral cost c_i(u) for each u∈V(D) and i∈V(H). The cost of a homomorphism f of D to H is . For a fixed digraph H, the minimum cost homomorphism problem for H is stated as follows: for an input digraph D and costs c_i(u) for each u∈V(D) and i∈V(H), verify whether there is a homomorphism of D to H and, if one exists, find such a homomorphism of minimum cost.We obtain dichotomy classifications of the computational complexity of the list homomorphism and minimum cost homomorphism problems, when H is a semicomplete digraph (digraph in which there is at least one arc between any two vertices). Our dichotomy for the list homomorphism problem coincides with the one obtained by Bang-Jensen, Hell and MacGillivray in 1988 for the homomorphism problem when H is a semicomplete digraph: both problems are polynomial solvable if H has at most one cycle; otherwise, both problems are NP-complete. The dichotomy for the minimum cost homomorphism problem is different: the problem is polynomial time solvable if H is acyclic or H is a cycle of length 2 or 3; otherwise, the problem is NP-hard.     

Sharp estimates for large coupling convergence with applications to Dirichlet operators

Let H be a nonnegative selfadjoint operator, E the closed quadratic form associated with H, and P a nonnegative quadratic form such that E+P is closed and D(P)⊃D(H). For every β>0 let Hβ be the selfadjoint operator associated with E+βP. The pairs (H,P) satisfying

     

The Dirichlet-to-Neumann operator on rough domains

We consider a bounded connected open set Ω⊂Rd whose boundary Γ has a finite (d−1)-dimensional Hausdorff measure. Then we define the Dirichlet-to-Neumann operator D₀ on L₂(Γ) by form methods. The operator −D₀ is self-adjoint and generates a contractive C₀-semigroup S=(St)_t>0 on L₂(Γ). We show that the asymptotic behaviour of St as t→∞ is related to properties of the trace of functions in H¹(Ω) which Ω may or may not have.     

Minimum cost homomorphisms to semicomplete multipartite digraphs

For digraphs D and H, a mapping f:V(D)→V(H) is a homomorphism ofDtoH if uv∈A(D) implies f(u)f(v)∈A(H). For a fixed directed or undirected graph H and an input graph D, the problem of verifying whether there exists a homomorphism of D to H has been studied in a large number of papers. We study an optimization version of this decision problem. Our optimization problem is motivated by a real-world problem in defence logistics and was introduced recently by the authors and M. Tso.Suppose we are given a pair of digraphs D,H and a cost c_i(u) for each u∈V(D) and i∈V(H). The cost of a homomorphism f of D to H is ∑_u∈V(D)c_f(u)(u). Let H be a fixed digraph. The minimum cost homomorphism problem for H, MinHOMP(H), is stated as follows: For input digraph D and costs c_i(u) for each u∈V(D) and i∈V(H), verify whether there is a homomorphism of D to H and, if it does exist, find such a homomorphism of minimum cost. In our previous paper we obtained a dichotomy classification of the time complexity of when H is a semicomplete digraph. In this paper we extend the classification to semicomplete k-partite digraphs, k≥3, and obtain such a classification for bipartite tournaments.     

Domains with growth conditions for the quasihyperbolic metric

For a given growth functionH, we say that a domainD ?R ⁿ is anH-domain if δ_D x≤δ_D(x ₀)H(k _D(x,x ₀)),x ∈D, where δ_D(x)=d(x?D) andk _D denotes the quasihyperbolic distance. We show that ifH satisfiesH(0)=1, |H'|≤H, andH"≤H, then there exists an extremalH-domain. Using this fact, we investigate some fundamental properties ofH-domains.     

The Green Ring of Drinfeld Double D(H 4)

In this paper, we study the Green ring (or the representation ring) of Drinfeld quantum double D(H ₄) of Sweedler’s four-dimensional Hopf algebra H ₄. We first give the decompositions of the tensor products of finite dimensional indecomposable modules into the direct sum of indecomposable modules over D(H ₄). Then we describe the structure of the Green ring r(D(H ₄)) of D(H ₄) and show that r(D(H ₄)) is generated, as a ring, by infinitely many elements subject to a family of relations.     

On relative primeness of operator polynomials

Given operator polynomials A(λ) and B(λ), one of which is monic, conditions are given for the existence of operator polynomials C(λ) and D(λ) such that A(λ)C(λ) + B(λ)D(λ) = I for every $\text{λ ∈}\text{C}$. A special case will give a characterization of controlla- bility of an infinite-dimensional linear control system.     

Generalizing D-graphs

Let ω₀(G) denote the number of odd components of a graph G. The deficiency of G is defined as def(G)=max_X⊆V(G)(ω₀(G-X)-|X|), and this equals the number of vertices unmatched by any maximum matching of G. A subset X⊆V(G) is called a Tutte set (or barrier set) of G if def(G)=ω₀(G-X)-|X|, and an extreme set if def(G-X)=def(G)+|X|. Recently a graph operator, called the D-graph D(G), was defined that has proven very useful in examining Tutte sets and extreme sets of graphs which contain a perfect matching. In this paper we give two natural and related generalizations of the D-graph operator to all simple graphs, both of which have analogues for many of the interesting and useful properties of the original.