Web‐compact spaces,Fréchet‐Urysohn groups and a Suslin closed graph theorem

A topological space X is strongly web‐compact if X admits a family {A_α: α ∈ ?^?} of relatively countably compact sets covering X and such that A_α ? A_β for α ≤ β. The main result of this paper states the following: Theorem A Let X and Y be topological groups and f a homomorphism between X and Y with closed graph. If X is Fréchet‐Urysohn and Baire and Y is strongly web‐compact, then f is continuous. This extends a result of Valdivia. We provide an example showing that the property of being strongly web‐compact is not productive. This applies to show that there are quasi‐Suslin spaces X whose product X × X is not quasi‐Suslin (© 2010 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Proof of a conjecture on game domination

Let G(V, E) be a simple, undirected graph where V is the set of vertices and E is the set of edges. A b‐dimensional cube is a Cartesian product I₁×I₂×···×I_b, where each I_i is a closed interval of unit length on the real line. The cubicity of G, denoted by cub(G), is the minimum positive integer b such that the vertices in G can be mapped to axis parallel b‐dimensional cubes in such a way that two vertices are adjacent in G if and only if their assigned cubes intersect. An interval graph is a graph that can be represented as the intersection of intervals on the real line—i.e. the vertices of an interval graph can be mapped to intervals on the real line such that two vertices are adjacent if and only if their corresponding intervals overlap. Suppose S(m) denotes a star graph on m+1 nodes. We define claw number ψ(G) of the graph to be the largest positive integer m such that S(m) is an induced subgraph of G. It can be easily shown that the cubicity of any graph is at least ?log₂ψ(G)?. In this article, we show that for an interval graph G ?log₂ψ(G)??cub(G)??log₂ψ(G)?+2. It is not clear whether the upper bound of ?log₂ψ(G)?+2 is tight: till now we are unable to find any interval graph with cub(G)>?log₂ψ(G)?. We also show that for an interval graph G, cub(G)??log₂α?, where α is the independence number of G. Therefore, in the special case of ψ(G)=α, cub(G) is exactly ?log₂α₂?. The concept of cubicity can be generalized by considering boxes instead of cubes. A b‐dimensional box is a Cartesian product I₁×I₂×···×I_b, where each I_i is a closed interval on the real line. The boxicity of a graph, denoted box(G), is the minimum k such that G is the intersection graph of k‐dimensional boxes. It is clear that box(G)?cub(G). From the above result, it follows that for any graph G, cub(G)?box(G)?log₂α?. © 2010 Wiley Periodicals, Inc. J Graph Theory 65: 323–333, 2010     

Regular reals

Say that α is an n‐strongly c. e. (n‐strongly computably enumerable) real if α is a sum of n many strongly c. e. reals, and that α is regular if α is n‐strongly c. e. for some n. Let Sⁿ be the set of all n‐strongly c. e. reals, Reg be the set of regular reals and CE be the set of c. e. reals. Then we have: S¹ ? S² ? · · · ? Sⁿ ? · · · ? ? Reg ? CE . This gives a hierarchy of the c. e. reals. We also study the regularity of the d. c. e. reals. (© 2005 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Characterizations and Uniqueness of Mutually Nearest Points for Two Sets in Normed Spaces

The present article deals with the problem of mutually nearest points of two nonempty sets S and W in a real normed linear space. A characterization result of Kolmogorov-type of mutually nearest points for S and W is established in view of a solar pair of S × W, and the relationship between a solar pair of S × W and solar points of S and W is obtained. Also, uniqueness results of the pair of mutually nearest points for S and W are given.     

A First Order Sufficient Condition for Optimality in Nonsmooth Optimization

We derive a simple sufficient condition for a point a∈S?X be a local minimum of f: X → R on S. This condition is of the first order in its nature and takes into account the derivative (or some generalization of it) in a neighborhood of a. Applications like a sufficient condition for (a, b)∈ S × T ? X × Y be a saddle-point of a bivariate function f: X × Y ? R are also proposed.     

Tight Lagrangian surfaces in <Emphasis Type="Italic">S</Emphasis><Superscript>2</Superscript> × <Emphasis Type="Italic">S</Emphasis><Superscript>2</Superscript>

We determine all tight Lagrangian surfaces in S ² × S ². In particular, globally tight Lagrangian surfaces in S ² × S ² are nothing but real forms of this symmetric space.     

The inverse problem of bisymmetric matrices with a submatrix constraint

An n×n real matrix A is called a bisymmetric matrix if A=A^T and A=S_nAS_n, where S_n is an n×n reverse unit matrix. This paper is mainly concerned with solving the following two problems: Problem I Given n×m real matrices X and B, and an r×r real symmetric matrix A₀, find an n×n bisymmetric matrix A such that where A([1: r]) is a r×r leading principal submatrix of the matrix A. Problem II Given an n×n real matrix A^*, find an n×n matrix  in S_E such that where ∥·∥ is Frobenius norm, and S_E is the solution set of Problem I. The necessary and sufficient conditions for the existence of and the expressions for the general solutions of Problem I are given. The explicit solution, a numerical algorithm and a numerical example to Problem II are provided. Copyright © 2003 John Wiley & Sons, Ltd.     

A Fokas approach to the coupled modified nonlinear Schrödinger equation on the half‐line

In this work, we discuss the coupled modified nonlinear Schrödinger (CMNLS) equation, which describe the pulse propagation in the picosecond or femtosecond regime of the birefringent optical fibers. By use of the Fokas approach, the initial‐boundary value problem for the CMNLS equation related to a 3×3 matrix Lax pair on the half‐line is to be analyzed. Assuming that the solution {u(x,t),v(x,t)} of CMNLS equation exists, we will prove that it can be expressed in terms of the unique solution of a 3×3 matrix Riemann‐Hilbert problem formulated in the plane of the complex spectral parameter λ. Moreover, we also get that some spectral functions s(λ) and S(λ) are not independent of each other but meet a global relationship.     

On C‐Suslin spaces

We prove a closed graph theorem for Baire locally convex spaces (for Baire linear topological spaces) in the domain and weakly C‐Suslin locally convex spaces (respectively, for C‐Suslin linear topological spaces) in the range which improves some classic closed graph theorems and other, more recent, related results.     

Claw‐free graphs and 2‐factors that separate independent vertices

In this article, we prove that a line graph with minimum degree δ≥7 has a spanning subgraph in which every component is a clique of order at least three. This implies that if G is a line graph with δ≥7, then for any independent set S there is a 2‐factor of G such that each cycle contains at most one vertex of S. This supports the conjecture that δ≥5 is sufficient to imply the existence of such a 2‐factor in the larger class of claw‐free graphs. It is also shown that if G is a claw‐free graph of order n and independence number α with δ≥2n/α?2 and n≥3α³/2, then for any maximum independent set S, G has a 2‐factor with α cycles such that each cycle contains one vertex of S. This is in support of a conjecture that δ≥n/α≥5 is sufficient to imply the existence of a 2‐factor with α cycles, each containing one vertex of a maximum independent set. © 2011 Wiley Periodicals, Inc. J Graph Theory 69: 251–263, 2012     

Global continuation for first order systems over the half‐line involving parameters

Let X be one of the functional spaces W^1,p ((0, ∞), ?^N ) or C₀¹ ([0, ∞), ?^N ), we study the global continuation in λ for solutions (λ, u, ξ) ∈ ? × X × ?^k of the following system of ordinary differential equations: where ?^N = X₁ ⊕ X₂ is a given decomposition, with associated projection P: ?^N → X₁. Under appropriate conditions upon the given functions F and φ, this problem gives rise to a nonlinear Fredholm operator which is proper on the closed bounded subsets of ? × X × ?^k and whose zeros correspond to the solutions of the original problem. Using a new abstract continuation result, based on a recent degree theory for proper Fredholm mappings of index zero, we reduce the continuation problem to that of finding a priori estimates for the possible solutions (© 2009 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Circular flows of nearly Eulerian graphs and vertex‐splitting

The odd edge connectivity of a graph G, denoted by λ_o(G), is the size of a smallest odd edge cut of the graph. Let S be any given surface and ? be a positive real number. We proved that there is a function f_S(?) (depends on the surface S and lim_?→0 f_S(?)=∞) such that any graph G embedded in S with the odd‐edge connectivity at least f_S(?) admits a nowhere‐zero circular (2+?)‐flow. Another major result of the work is a new vertex splitting lemma which maintains the old edge connectivity and graph embedding. © 2002 Wiley Periodicals, Inc. J Graph Theory 40: 147–161, 2002     

Split‐type octonion matrix

The split and hyperbolic (countercomplex) octonions are eight‐dimensional nonassociative algebras over the real numbers, which are in the form , where e_m's have different properties for them. The main purpose of this paper is to define the split‐type octonion and its matrix whose inputs are split‐type octonions and give some properties for them by using the real quaternions, split, and hyperbolic (countercomplex) octonions. On the other hand, to make some definitions, we present some operations on the split‐type octonions. Also, we show that every split‐type octonions can be represented by 2 × 2 real quaternion matrix and 4 × 4 complex number matrix. The information about the determinants of these matrix representations is also given. Besides, the main features of split‐type octonion matrix concept are given by using properties of  real quaternion matrices. Then, 8n × 8nreal matrix representations of split‐type octonion matrices are shown, and some algebraic structures are examined. Additionally, we introduce real quaternion adjoint matrices of split‐type octonion matrices. Moreover, necessary and sufficient conditions and definitions are given for split‐type octonion matrices to be special split‐type octonion matrices. We describe some special split‐type octonion matrices. Finally, oct‐determinant of split‐type octonion matrices is defined. Definitive and understandable examples of all definitions, theorems, and conclusions were given for a better understanding of all these concepts.     

General Littlewood–Paley functions and singular integral operators on product spaces

This paper is devoted to the study on the L^p ‐mapping properties for certain singular integral operators with rough kernels and related Littlewood–Paley functions along “polynomial curves” on product spaces ?^m × ?ⁿ (m ≥ 2, n ≥ 2). By means of the method of block decomposition for kernel functions and some delicate estimates on Fourier transforms, the author proves that the singular integral operators and Littlewood–Paley functions are bounded on L^p (?^m × ?ⁿ ), p ∈ (1, ∞), and the bounds are independent of the coefficients of the polynomials. These results essentially improve or extend some well‐known results. (© 2006 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Relative Position,Sequences and Operators in Banach Spaces

A (p + q) × (p + q) matrix-valued inner function S in the unit disc ?? is called (p, q)-type Arov-inner if in the block partition . the p × p diagonal block S₁₁ and the q × q diagonal block S₂₂ are outer matrix-valued functions. A holomorphic p × q matrix-valued function f in ?? is called Arov-completable if there is a (p, q)-type Arov-inner function S such that S₁₂ = f Arov-completability of a given p × q Schur function f is characterized in terms of a (p + q)-variate stationary sequence (X_{n) ? Z}) in Hilbert space which is naturally associated with f. The necessary and sufficient condition for Arov-completability is an orthogonality condition for certain backward and forward innovation vectors generated by (X_{n) ? Z}.     

Extremal graphs without a semi‐topological wheel

For 2≤r∈?, let S_r denote the class of graphs consisting of subdivisions of the wheel graph with r spokes in which the spoke edges are left undivided. Let ex(n, S_r) denote the maximum number of edges of a graph containing no S_r‐subgraph, and let Ex(n, S_r) denote the set of all n‐vertex graphs containing no S_r‐subgraph that are of size ex(n, S_r). In this paper, a conjecture is put forth stating that for r≥3 and n≥2r + 1, ex(n, S_r) = (r ? 1)n ? ?(r ? 1)(r ? 3/2)? and for r≥4, Ex(n, S_r) consists of a single graph which is the graph obtained from K_{r ? 1, n ? r + 1} by adding a maximum matching to the color class of cardinality r ? 1. A previous result of C. Thomassen [A minimal condition implying a special K₄‐subdivision, Archiv Math 25 (1974), 210–215] implies that this conjecture is true for r = 3. In this paper it is shown to hold for r = 4. © 2011 Wiley Periodicals, Inc. J Graph Theory 68:326‐339, 2011     

Remarks on nonmeasurable unions of big point families

We show that under some conditions on a family A ? I there exists a subfamily A₀ ? A such that ∪ A₀ is nonmeasurable with respect to a fixed ideal I with Borel base of a fixed uncountable Polish space. Our result applies to the classical ideal of null subsets of the real line and to the ideal of first category subsets of the real line (© 2009 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

A note on certain square functions on product spaces

We study certain square functions on product spaces Rn × Rm, whose integral kernels are obtained from kernels which are homogeneous in each factor Rn and Rm and locally in L(log L) away from Rn × {0} and {0} × Rm by means of polynomial distortions in the radial variable. As a model case, we obtain that the Marcinkiewicz integral operator is bounded on Lp(Rn × Rm)(P > 1) for Ω∈ e Llog L(Sn-1 × Sm-1) satisfying the cancellation condition.     

On characterizing Vizing's edge colouring bound

We consider multigraphs G for which equality holds in Vizing's classical edge colouring bound χ′(G)≤Δ + µ, where Δ denotes the maximum degree and µ denotes the maximum edge multiplicity of G. We show that if µ is bounded below by a logarithmic function of Δ, then G attains Vizing's bound if and only if there exists an odd subset S?V(G) with |S|≥3, such that |E[S]|>((|S| ? 1)/2)(Δ + µ ? 1). The famous Goldberg–Seymour conjecture states that this should hold for all µ≥2. We also prove a similar result concerning the edge colouring bound χ′(G)≤Δ + ?µ/?g/2??, due to Steffen (here g denotes the girth of the underlying graph). Finally we give a general approximation towards the Goldberg‐Seymour conjecture in terms of Δ and µ. © 2011 Wiley Periodicals, Inc. J Graph Theory 69:160‐168, 2012     

Global bifurcation theorem for a class of boundary conditions for ordinary differential equations of second order

In this paper we deal with boundary value problems where l : C¹([a, b], ?^k) → ?^k × ?^k is continuous, μ ≤ 0 and φ is a Caratheodory map. We define the class S of maps l, for which a global bifurcation theorem holds for the problem (+), with φ(t, x, y, λ) = λ(|x₁|, …, |x^k|) + o(|x| + |y|). We show that the class S contains Sturm‐Liouville boundary conditions. (© 2005 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)