Analytic discs in the boundary and compactness of Hankel operators with essentially bounded symbols

We derive conditions for compactness of Hankel operators () with bounded, holomorphic symbols f for a large class of convex and bounded domains Ω with Ω⊆Dk.     

Continuity and Schatten-von Neumann p-class membership of Hankel operators with anti-holomorphic symbols on (generalized) Fock spaces

In this paper we investigate Hankel operators with anti-holomorphic symbols ∈L²(C,m|z|), where are general Fock spaces. We will show that is not continuous if the corresponding symbol is not a polynomial . For polynomial symbols we will give necessary and sufficient conditions for continuity and compactness in terms of N and m. For monomials we will give a complete characterization of the Schatten-von Neumann p-class membership for p>0. Namely in case 2k<m the Hankel operators are in the Schatten-von Neumann p-class iff p>2m/(m−2k); and in case 2k?m they are not in the Schatten-von Neumann p-class.     

The Neumann boundary problem for a nonlocal Cahn-Hilliard equation

We study the existence, uniqueness and continuous dependence on initial data of the solution to a nonlocal Cahn-Hilliard equation on a bounded domain. The equation generates a gradient flow for a free energy functional with nonlocal interaction. Also we apply a nonlinear Poincaré inequality to show the existence of an absorbing set in each constant mass affine space.     

The hilbert boundary value problem for generalized analytic functions in clifford analysis

Let ?_0,n be the real Clifford algebra generated by e₁, e₂,…, e_n satisfying e_ie_j+e_je_i=−2δ_ij, i, j=1,2,…, n. e₀ is the unit element. Let Ω be an open set. A function f is called left generalized analytic in Ω if f satisfies the equation

equation(0.1)

Lf=0,$Lf=0,$

where

L=q₀e₀∂x₀+ q₁e₁∂x₁+…+qnen_∂xn,$L=q_0{e}_0\partial x_0+\hspace{0.17em}{q}_1{e}_1\partial x_1+\dots +q_n{e}_n{\partial }_{x_n},$

qi <0, i=0,1,…, n. In this article, we first give the kernel function for the generalized analytic function. Further, the Hilbert boundary value problem for generalized analytic functions in ?ⁿ⁺¹₊ will be investigated.     

Weighted estimates for a class of multilinear fractional type operators

In this paper, a class of multiple fractional type weights is defined as

     

Spectrum and analytical indices of the C-algebra of Wiener-Hopf operators

We study multivariate generalisations of the classical Wiener-Hopf algebra, which is the C^∗-algebra generated by the Wiener-Hopf operators, given by convolutions restricted to convex cones. By the work of Muhly and Renault, this C^∗-algebra is known to be isomorphic to the reduced C^∗-algebra of a certain restricted action groupoid, given by the action of Euclidean space on a certain compactification. Using groupoid methods, we construct composition series for the Wiener-Hopf C^∗-algebra by a detailed study of this compactification. We compute the spectrum, and express homomorphisms in K-theory induced by the symbol maps which arise by the subquotients of the composition series in analytical terms. Namely, these symbols maps turn out to be given by an analytical family index of a continuous family of Fredholm operators. In a subsequent paper, we also obtain a topological expression of these indices.     

Some properties for a class of interchange graphs

The Wiener number is the sum of distances between all pairs of vertices of a connected graph. In this paper, we give an explicit algebraic formula for the Wiener number of a class of interchange graphs. Moreover, distance-related properties and cliques of this class of interchange graphs are investigated.     

On holomorphic functions of slow growth on coverings of strongly pseudoconvex manifolds

In this paper we extend some results of the paper [M. Gromov, G. Henkin, M. Shubin, Holomorphic L²-functions on coverings of pseudoconvex manifolds, Geom. Funct. Anal. 8 (1998) 552-585].     

Minimal rankings and the arank number of a path

Given a graph G, a function f:V(G)→{1,2,…,k} is a k-ranking of G if f(u)=f(v) implies every u-v path contains a vertex w such that f(w)>f(u). A k-ranking is minimal if the reduction of any label greater than 1 violates the described ranking property. The arank number of a graph, denoted ψ_r(G), is the largest k such that G has a minimal k-ranking. We present new results involving minimal k-rankings of paths. In particular, we determine ψ_r(P_n), a problem posed by Laskar and Pillone in 2000.     

Condensed Cramer rule for some restricted quaternion linear equations

In this paper, we derive an alternative more condensed Cramer rule for the unique solution of some restricted left and right systems of quaternion linear equations. The findings of this paper extend some known results in the literature.     

A note on the hardness of Skolem-type sequences

The purpose of this note is to give upper bounds (assuming different from ) on how far the generalizations of Skolem sequences can be taken while still hoping to resolve the existence question. We prove that the existence questions for both multi-Skolem sequences and generalized Skolem sequences are strongly -complete. These results are significant strengthenings and simplifications of the recent -completeness result for generalized multi-Skolem sequences.     

Spanning trails containing given edges

A graph G is Eulerian-connected if for any u and v in V(G), G has a spanning (u,v)-trail. A graph G is edge-Eulerian-connected if for any e^′ and e^″ in E(G), G has a spanning (e^′,e^″)-trail. For an integer r?0, a graph is called r-Eulerian-connected if for any X⊆E(G) with |X|?r, and for any , G has a spanning (u,v)-trail T such that X⊆E(T). The r-edge-Eulerian-connectivity of a graph can be defined similarly. Let θ(r) be the minimum value of k such that every k-edge-connected graph is r-Eulerian-connected. Catlin proved that θ(0)=4. We shall show that θ(r)=4 for 0?r?2, and θ(r)=r+1 for r?3. Results on r-edge-Eulerian connectivity are also discussed.     

DFT calculation for the {2}-inverse of a polynomial matrix with prescribed image and kernel

In this paper, we first give the finite algorithm for generalized inverse of a matrix A over an integral domain, and, based on it and the discrete Fourier transform, present an algorithm for calculating {2}-inverses of a polynomial matrix with prescribed image and kernel. And the algorithm is implemented in the Mathematica programming language and expands the algorithms in [13].     

Precoloring extension on unit interval graphs

In the precoloring extension problem a graph is given with some of the vertices having preassigned colors and it has to be decided whether this coloring can be extended to a proper k-coloring of the graph. Answering an open question of Hujter and Tuza [Precoloring extension. III. Classes of perfect graphs, Combin. Probab. Comput. 5 (1) (1996) 35-56], we show that the precoloring extension problem is NP-complete on unit interval graphs.     

Short proofs of summation and transformation formulas for basic hypergeometric series

We show that several terminating summation and transformation formulas for basic hypergeometric series can be proved in a straightforward way. Along the same line, new finite forms of Jacobi's triple product identity and Watson's quintuple product identity are also proved.     

Remarks on the formula for γ-interior

The paper presents a formula for the γ-interior of a set under special conditions for , more general than those in the previous paper [Acta Math. Hungar. 80 (1998) 89-93]. There are also some applications.     

Rationalization and the Gray index of phantom maps

In this paper we study a homotopy invariant of phantom maps called the Gray index. We give a new interpretation of the Gray index of a phantom map f:X→Y, in terms of the rationalization of X. We use this interpretation, in order to detect phantom maps of a specific Gray index. Finally, we examine the set of phantom maps with infinite Gray index in a tower theoretic way.