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.     

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.     

A minimax theorem for vector-valued functions in lexicographic order

In this paper, a minimax theorem and a saddle point theorem are obtained for vector-valued functions in the sense of lexicographic order, respectively. An equivalent relationship between the minimax inequality and the saddle point is established. Some examples are given to illustrate our results.     

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.     

A note on exact complex travelling wave solutions for (2+1)-dimensional B-type Kadomtsev-Petviashvili equation

The -expansion method can be used for constructing exact travelling wave solutions of real nonlinear evolution equations. In this paper, we improve the -expansion method and explore new application of this method to (2+1)-dimensional B-type Kadomtsev-Petviashvili (BKP) equation. New types of exact complex travelling wave solutions of (2+1)-dimensional BKP equation are found. Some exact solutions of (2+1)-dimensional BKP equation obtained before are special cases of our results in this paper.     

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].     

Multiple solutions for elliptic problems with asymmetric nonlinearity

In this paper we establish the existence of multiple solutions for the semilinear elliptic problem

     

Full-rank representations of {2, 4}, {2, 3}-inverses and successive matrix squaring algorithm

We present the full-rank representations of {2, 4} and {2, 3}-inverses (with given rank as well as with prescribed range and null space) as particular cases of the full-rank representation of outer inverses. As a consequence, two applications of the successive matrix squaring (SMS) algorithm from [P.S. Stanimirovi?, D.S. Cvetkovi?-Ili?, Successive matrix squaring algorithm for computing outer inverses, Appl. Math. Comput. 203 (2008) 19-29] are defined using the full-rank representations of {2, 4} and {2, 3}-inverses. The first application is used to approximate {2, 4}-inverses. The second application, after appropriate modifications of the SMS iterative procedure, computes {2, 3}-inverses of a given matrix. Presented numerical examples clarify the purpose of the introduced methods.     

Monotonicity characteristic of Köthe-Bochner spaces

Estimates of the characteristic of monotonicity in Köthe-Bochner function spaces E(X) with some consequences are given. Characterizations of strict and uniform monotonicity of the sequence lattice are obtained.     

Combinatorial constructions of fault-tolerant routings with levelled minimum optical indices

The design of fault-tolerant routings with levelled minimum optical indices plays an important role in the context of optical networks. However, not much is known about the existence of optimal routings with levelled minimum optical indices besides the results established by Dinitz, Ling and Stinson via the partitionable Steiner quadruple systems approach. In this paper, we introduce a new concept of a large set of even levelled -design of order v and index 2, denoted by -LELD, which is equivalent to an optimal, levelled (v−2)-fault-tolerant routing with levelled minimum optical indices of the complete network with v nodes. On the basis of the theory of three-wise balanced designs and partitionable candelabra systems, several infinite classes of -LELDs are constructed. As a consequence, the existence problem for optimal routings with levelled minimum optical indices is solved for nearly a third of the cases.     

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.     

Generalized Navier-Stokes equations with initial data in local Q-type spaces

In this paper, we establish a link between Leray mollified solutions of the three-dimensional generalized Navier-Stokes equations and mild solutions for initial data in the adherence of the test functions for the norm of . This result applies to the usual incompressible Navier-Stokes equations.     

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.     

Derivations as square roots of Dirichlet forms

The aim of this work is to analyze the structure of a tracially symmetric Dirichlet form on a -algebra, in terms of a killing weight and a closable derivation taking values in a Hilbert space with a bimodule structure. It is shown that the generator of the associate Markovian semigroup always appears, in a natural way, as the divergence of a closable derivation. Applications are shown to the decomposition of Dirichlet forms and to the construction of differential calculus on metric spaces.     

On the complexity of constructing Golomb Rulers

A Golomb Ruler is a ruler with integer marks where the distances between every two marks are distinct. Golomb Rulers find diverse applications in computer science and electrical engineering. According to our knowledge the computational complexity of problems related to the construction of Golomb Rulers is unknown. We provide natural definitions for problems related to the construction of such rulers. The main contribution of this work is -completeness results for two such decision problems.     

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.