Strongly indexable graphs and applications

In 1990, Acharya and Hegde introduced the concept of strongly k-indexable graphs: A (p,q)-graph G=(V,E) is said to be strongly k-indexable if its vertices can be assigned distinct numbers 0,1,2,…,p−1 so that the values of the edges, obtained as the sums of the numbers assigned to their end vertices form an arithmetic progression k,k+1,k+2,…,k+(q−1). When k=1, a strongly k-indexable graph is simply called a strongly indexable graph. In this paper, we report some results on strongly k-indexable graphs and give an application of strongly k-indexable graphs to plane geometry, viz; construction of polygons of same internal angles and sides of distinct lengths.     

A new exclusion test for finding the global minimum

Exclusion algorithms have been used recently to find all solutions of a system of nonlinear equations or to find the global minimum of a function over a compact domain. These algorithms are based on a minimization condition that can be applied to each cell in the domain. In this paper, we consider Lipschitz functions of order α and give a new minimization condition for the exclusion algorithm. Furthermore, convergence and complexity results are presented for such algorithm.     

Finitely additive representation of spaces

Let be any atomless and countably additive probability measure on the product space with the usual σ-algebra. Then there is a purely finitely additive probability measure λ on the power set of a countable subset such that can be isometrically isomorphically embedded as a closed subspace of L^p(λ). The embedding is strict. It is also ‘canonical,’ in the sense that it maps simple and continuous functions on to their restrictions to T.     

Minimum degree conditions for -linked graphs

For a fixed multigraph H with vertices w₁,…,w_m, a graph G is H-linked if for every choice of vertices v₁,…,v_m in G, there exists a subdivision of H in G such that v_i is the branch vertex representing w_i (for all i). This generalizes the notions of k-linked, k-connected, and k-ordered graphs.Given a connected multigraph H with k edges and minimum degree at least two and n7.5k, we determine the least integer d such that every n-vertex simple graph with minimum degree at least d is H-linked. This value D(H,n) appears to equal the least integer d^′ such that every n-vertex graph with minimum degree at least d^′ is b(H)-connected, where b(H) is the maximum number of edges in a bipartite subgraph of H.     

Positive solutions for Robin problem involving the -Laplacian

Consider Robin problem involving the p(x)-Laplacian on a smooth bounded domain Ω as follows

Applying the sub-supersolution method and the variational method, under appropriate assumptions on f, we prove that there exists λ_*>0 such that the problem has at least two positive solutions if λ(0,λ_*), has at least one positive solution if λ=λ_*<+∞ and has no positive solution if λ>λ_*. To prove the results, we prove a norm on W^1,p(x)(Ω) without the part of ||_L^p(x)(Ω) which is equivalent to usual one and establish a special strong comparison principle for Robin problem.     

Convergence for a class of delayed recurrent neural networks without M-matrix condition

In this paper, we investigate the asymptotic behavior of solutions to a class of recurrent neural network model with delays. Without assuming M-matrix condition, it is shown that every solution of the network tends to an equilibrium point as t→∞. Our results improve and extend some corresponding ones already known.     

On wavelets related to the Walsh series

For any integers p,n≥2 necessary and sufficient conditions are given for scaling filters with pⁿ many terms to generate a p-multiresolution analysis in . A method for constructing orthogonal compactly supported p-wavelets on is described. Also, an adaptive p-wavelet approximation in is considered.     

On the modulus of -convexity

In this paper, we prove that the moduli of W^*-convexity, introduced by Ji Gao [J. Gao, The W^*-convexity and normal structure in Banach spaces, Appl. Math. Lett. 17 (2004) 1381–1386], of a Banach space X and of the ultrapower of X itself coincide whenever X is super-reflexive. Moreover, we improve a sufficient condition for uniform normal structure of the space and its dual. This generalizes and strengthens the main results of [J. Gao, The W^*-convexity and normal structure in Banach spaces, Appl. Math. Lett. 17 (2004) 1381–1386].     

Spectral theory for algebraic combinations of Toeplitz and composition operators

We determine the essential spectra of algebraic combinations of Toeplitz operators with continuous symbol and composition operators induced by a class of linear-fractional non-automorphisms of the unit disk. The operators in question act on the Hardy space H² on the unit disk. Our method is to realize the C^*-algebra that they generate as an extension of the compact operators by a concrete C^*-algebra whose invertible elements are easily characterized.     

Bidual renormings of Banach spaces

Given a separable Banach space X with no isomorphic copies of ℓ₁ and a separable subspace Y of its bidual, we provide a sufficient condition on Y to ensure that X admits an equivalent norm such that the restriction to Y of the corresponding bidual norm is midpoint locally uniformly rotund. This result applies to the separable subspaces of the bidual of a Banach space with a shrinking unconditional Schauder basis and to the bidual of the James space.     

Partitioning a graph of bounded tree-width to connected subgraphs of almost uniform size

Assume that each vertex of a graph G is assigned a nonnegative integer weight and that l and u are nonnegative integers. One wishes to partition G into connected components by deleting edges from G so that the total weight of each component is at least l and at most u. Such an “almost uniform” partition is called an (l,u)-partition. We deal with three problems to find an (l,u)-partition of a given graph; the minimum partition problem is to find an (l,u)-partition with the minimum number of components; the maximum partition problem is defined analogously; and the p-partition problem is to find an (l,u)-partition with a fixed number p of components. All these problems are NP-complete or NP-hard, respectively, even for series-parallel graphs. In this paper we show that both the minimum partition problem and the maximum partition problem can be solved in time O(u⁴n) and the p-partition problem can be solved in time O(p²u⁴n) for any series-parallel graph with n vertices. The algorithms can be extended for partial k-trees, that is, graphs with bounded tree-width.     

On hazard rate ordering of the sums of heterogeneous geometric random variables

In this paper, we treat convolutions of heterogeneous geometric random variables with respect to the p-larger order and the hazard rate order. It is shown that the p-larger order between two parameter vectors implies the hazard rate order between convolutions of two heterogeneous geometric sequences. Specially in the two-dimensional case, we present an equivalent characterization. The case when one convolution involves identically distributed variables is discussed, and we reveal the link between the hazard rate order of convolutions and the geometric mean of parameters. Finally, we drive the “best negative binomial bounds” for the hazard rate function of any convolution of geometric sequence under this setup.     

The behavior of best -approximations as . A counterexample of convergence

In the space of summable sequences we give an example of a one-dimensional affine subspace C such that the best L_p-approximations of 0 from C fail to converge as p↓1. We thus give an answer to this problem of convergence in infinite measure spaces.     

Optimality and invexity in optimization problems in Banach algebras (spaces)

In this paper we introduce into nonsmooth optimization theory in Banach algebras a new class of mathematical programming problems, which generalizes the notion of smooth KT-(p,r)-invexity. In fact, this paper focuses on the optimality conditions for optimization problems in Banach algebras, regarding the generalized KT-(p,r)-invexity notion and Kuhn–Tucker points.     

-adic refinable functions and MRA-based wavelets

The main goal of this paper is the development of the MRA theory in . We described a wide class of p-adic refinement equations generating p-adic multiresolution analyses. A method for the construction of p-adic orthogonal wavelet bases within the framework of the MRA theory is suggested. A realization of this method is illustrated by an example which gives a new 3-adic wavelet basis. Another realization leads to the p-adic Haar bases which were known before.     

A completeness result for the simply typed -calculus

In this paper, we define a realizability semantics for the simply typed λμ-calculus. We show that, if a term is typable, then it inhabits the interpretation of its type. This result serves to give characterizations of the computational behavior of some closed typed terms. We also prove a completeness result of our realizability semantics using a particular term model.     

Infinitely many non-negative solutions for a Dirichlet problem involving -Laplacian

In this paper, we consider a Dirichlet problem involving the p(x)-Laplacian of the type

We prove the existence of infinitely many non-negative solutions of the problem by applying a general variational principle due to B. Ricceri and the theory of the variable exponent Sobolev spaces.     

Three solutions for a differential inclusion problem involving the -Laplacian

In this paper we consider differential inclusion problem involving the p(x)-Laplacian of the type

Applying a version of the non-smooth three-critical-points theorem we obtain the existence of three solutions of the problem in .     

Existence of periodic solutions for a fourth-order -Laplacian equation with a deviating argument

In this paper, we study the existence of periodic solutions for a fourth-order p-Laplacian differential equation with a deviating argument as follows:

[φ_p(u^″(t))]^″+f(u^″(t))+g(u(t−τ(t)))=e(t).