On Finite Saturated Chains of Overrings

If a domain R, with quotient field K, has a finite saturated chain of overrings from R to K, then the integral closure of R is a Prüfer domain. An integrally closed domain R with quotient field K has a finite saturated chain of overrings from R to K with length m ≥ 1 iff R is a Prüfer domain and |Spec(R)| =m + 1. In particular, we prove that a domain R has a finite saturated chain of overrings from R to K with length dim(R) iff R is a valuation domain and that an integrally closed domain R has a finite saturated chain of overrings from R to K with length dim (R) +1 iff R is a Prüfer domain with exactly two maximal ideals such that at most one of them fails to contain every non-maximal prime. The relationship with maximal non-valuation subrings is also established.     

On the Existence of Solutions for Fully Nonlinear Elliptic Equations Under Relaxed Convexity Assumptions

We establish the existence and uniqueness of solutions of fully nonlinear elliptic second-order equations like H(v, Dv, D ² v, x) = 0 in smooth domains without requiring H to be convex or concave with respect to the second-order derivatives. Apart from ellipticity nothing is required of H at points at which |D ² v| ≤K, where K is any given constant. For large |D ² v| some kind of relaxed convexity assumption with respect to D ² v mixed with a VMO condition with respect to x are still imposed. The solutions are sought in Sobolev classes.     

Reconstructible and Half-Reconstructible Tournaments: Application to Their Groups of Hemimorphisms

Let T and T¹ be tournaments with n elements, E a basis for T, E′ a basis for T′, and k ≥ 3 an integer. The dual of T is the tournament T” of basis E defined by T(x, y) = T(y, x) for all x, y ε E. A hemimorphism from T onto T′ is an isomorphism from T onto T” or onto T. A k-hemimorphism from T onto T′ is a bijection f from E to E′ such that for any subset X of E of order k the restrictions T/X and T¹/f(X) are hemimorphic. The set of hemimorphisms of T onto itself has group structure, this group is called the group of hemimorphisms of T. In this work, we study the restrictions to n – 2 elements of a tournament with n elements. In particular, we prove: Let k ≥ 3 be an integer, T a tournament with n elements, where n ≥ k + 5. Then the following statements are equivalent: (i) All restrictions of T to subsets with n – 2 elements are k-hemimorphic. (ii) All restrictions of T to subsets with n – 2 elements are 3-hemimorphic. (iii) All restrictions of T to subsets with n – 2 elements are hemimorphic. (iv) All restrictions of T to subsets with n – 2 elements are isomorphic, (v) Either T is a strict total order, or the group of hemimorphisms of T is 2-homogeneous.     

Generalized projection and approximation of fixed points of nonself maps

Let K be a nonempty closed convex proper subset of a real uniformly convex and uniformly smooth Banach space E; T:K→E be an asymptotically weakly suppressive, asymptotically weakly contractive or asymptotically nonextensive map with F(T){xK: Tx=x}≠. Using the notion of generalized projection, iterative methods for approximating fixed points of T are studied. Convergence theorems with estimates of convergence rates are proved. Furthermore, the stability of the methods with respect to perturbations of the operators and with respect to perturbations of the constraint sets are also established.     

On a signless Laplacian spectral characterization of -shape trees

Let M be an associated matrix of a graph G (the adjacency, Laplacian and signless Laplacian matrix). Two graphs are said to be cospectral with respect to M if they have the same M spectrum. A graph is said to be determined by M spectrum if there is no other non-isomorphic graph with the same spectrum with respect to M. It is shown that T-shape trees are determined by their Laplacian spectra. Moreover among them those are determined by their adjacency spectra are characterized. In this paper, we identify graphs which are cospectral to a given T-shape tree with respect to the signless Laplacian matrix. Subsequently, T-shape trees which are determined by their signless Laplacian spectra are identified.     

Nonlinear functional equations satisfied by orthogonal polynomials

Let c be a linear functional defined by its moments c(xⁱ)=c_i for i=0,1,…. We proved that the nonlinear functional equations P(t)=c(P(x)P(αx+t)) and P(t)=c(P(x)P(xt)) admit polynomial solutions which are the polynomials belonging to the family of formal orthogonal polynomials with respect to a linear functional related to c. This equation relates the polynomials of the family with those of the scaled and shifted family. Other types of nonlinear functional equations whose solutions are formal orthogonal polynomials are also presented. Applications to Legendre and Chebyshev polynomials are given. Then, orthogonality with respect to a definite inner product is studied. When c is an integral functional with respect to a weight function, the preceding functional equations are nonlinear integral equations, and these results lead to new characterizations of orthogonal polynomials on the real line, on the unit circle, and, more generally, on an algebraic curve.     

D-saturated property of the Cayley graphs of semigroups

Let D be a finite graph. A semigroup S is said to be Cayley D-saturated with respect to a subset T of S if, for all infinite subsets V of S, there exists a subgraph of Cay(S,T) isomorphic to D with all vertices in V. The purpose of this paper is to characterize the Cayley D-saturated property of a semigroup S with respect to any subset T⊆S. In particular, the Cayley D-saturated property of a semigroup S with respect to any subsemigroup T is characterized.     

Cohomology of Subregular Tilting Modules for Small Quantum Groups

Let U be a quantumgroup with divid d powers at root ofunity constructed froma rootsystem R .Let u U b th small quantumgroup.Th cohomologyof u with trivial coefficients was computed by Ginzburg and Kumar.It turns out to be isomorphic to the functions algebra of the nilpotent cone of a semisimpl algebraic group with root system R .In this not we calculate cohomology of u with coefficients in simplest reducible tilting modul with nontrivial cohomology.It appears to b isomorphic to th functions algebra of th closure of the subregular nilpotent orbit.     

On character amenability of semigroup algebras

We study the character amenability of semigroup algebras. We work on general semigroups and certain semigroups such as inverse semigroups with a finite number of idempotents, inverse semigroups with uniformly locally finite idempotent set, Brandt and Rees semigroup and study the character amenability of the semigroup algebra l¹(S) in relation to the structures of the semigroup S. In particular, we show that for any semigroup S, if ?¹(S) is character amenable, then S is amenable and regular. We also show that the left character amenability of the semigroup algebra ?¹(S) on a Brandt semigroup S over a group G with index set J is equivalent to the amenability of G and J being finite. Finally, we show that for a Rees semigroup S with a zero over the group G, the left character amenability of ?¹(S) is equivalent to its amenability, this is in turn equivalent to G being amenable.     

On the Structure of the Solution Set of u″ = f(t,u), u(0) = u(1) = 0

The solution set of a Dirichlet problem x″ = f(t, x), x(0) = x(1) = 0, on a Banach space E and with f satisfying a Lipschitz condition, is homeomorphic to a closed subset of E. We prove that to an closed subset C of E there is a function f with Lipschitz constant arbitrarily close to π², such that the solution set of the corresponding Dirichlet problem is homeomorphic to C.     

On the K shortest path trees problem

We address the problem of finding the K best path trees connecting a source node with any other non-source node in a directed network with arbitrary lengths. The main result in this paper is the proof that the kth shortest path tree is adjacent to at least one of the previous (k-1) shortest path trees. Consequently, we design an O(f(n,m,C_max)+Km) time and O(K+m) space algorithm to determine the K shortest path trees, in a directed network with n nodes, m arcs and maximum absolute length C_max, where O(f(n,m,C_max)) is the best time needed to solve the shortest simple paths connecting a source node with any other non-source node.     

Ergodic properties of operators in some semi-Hilbertian spaces

This article deals with linear operators T on a complex Hilbert space ?, which are bounded with respect to the seminorm induced by a positive operator A on ?. The A-adjoint and A ^1/2-adjoint of T are considered to obtain some ergodic conditions for T with respect to A. These operators are also employed to investigate the class of orthogonally mean ergodic operators as well as that of A-power bounded operators. Some classes of orthogonally mean ergodic or A-ergodic operators, which come from the theory of generalized Toeplitz operators are considered. In particular, we give an example of an A-ergodic operator (with an injective A) which is not Cesàro ergodic, such that T ^?* is not a quasiaffine transform of an orthogonally mean ergodic operator.     

FFT-based algorithms for the string matching with mismatches problem

The string matching with mismatches problem requires finding the Hamming distance between a pattern P of length m and every length m substring of text T with length n. Fischer and Paterson's FFT-based algorithm solves the problem without error in O(σnlogm), where σ is the size of the alphabet Σ [SIAM–AMS Proc. 7 (1973) 113–125]. However, this in the worst case reduces to O(nmlogm). Atallah, Chyzak and Dumas used the idea of randomly mapping the letters of the alphabet to complex roots of unity to estimate the score vector in time O(nlogm) [Algorithmica 29 (2001) 468–486]. We show that the algorithm's score variance can be substantially lowered by using a bijective mapping, and specifically to zero in the case of binary and ternary alphabets. This result is extended via alphabet remappings to deterministically solve the string matching with mismatches problem with a constant factor of 2 improvement over Fischer–Paterson's method.     

Enhanced group analysis and conservation laws of variable coefficient reaction–diffusion equations with power nonlinearities

A class of variable coefficient (1+1)-dimensional nonlinear reaction–diffusion equations of the general form f(x)u_t=(g(x)uⁿu_x)_x+h(x)u^m is investigated. Different kinds of equivalence groups are constructed including ones with transformations which are nonlocal with respect to arbitrary elements. For the class under consideration the complete group classification is performed with respect to convenient equivalence groups (generalized extended and conditional ones) and with respect to the set of all local transformations. Usage of different equivalences and coefficient gauges plays the major role for simple and clear formulation of the final results. The corresponding set of admissible transformations is described exhaustively. Then, using the most direct method, we classify local conservation laws. Some exact solutions are constructed by the classical Lie method.     

On–off fluid models in heavy traffic environment

We consider fluid models with infinite buffer size. Let {Z _N (t)} be the net input rate to the buffer, where {{Z _N (t)} is a superposition of N homogeneous alternating on–off flows. Under heavy traffic environment {{Z _N (t)} converges in distribution to a centred Gaussian process with covariance function of a single flow. The aim of this paper is to prove the convergence of the stationary buffer content process {X _N ^* (t)} in the fNth model to the buffer content process {X _N (t)} in the limiting Gaussian model. This revised version was published online in June 2006 with corrections to the Cover Date.     

Structures and Representations of Generalized Path Algebras

It is shown that an algebra Λ can be lifted with nilpotent Jacobson radical r = r(Λ) and has a generalized matrix unit {e _ii } _I with each ē _ii in the center of if Λ is isomorphic to a generalized path algebra with weak relations. Representations of the generalized path algebras are given. As a corollary, Λ is a finite algebra with non-zero unity element over a perfect field k (e.g., a field with characteristic zero or a finite field) if Λ is isomorphic to a generalized path algebra k (D, Ω, ρ) of finite directed graph with weak relations and dim < ∞; Λ is a generalized elementary algebra which can be lifted with nilpotent Jacobson radical and has a complete set of pairwise orthogonal idempotents if Λ is isomorphic to a path algebra with relations. Presented by Idun Reiten.     

Approximating Data in \mathfrak{R}^{n} by a Quadratic Underestimator with Specified Hessian Minimum and Maximum Eigenvalues

The problem of approximating m data points (x _i , y _i ) in , with a quadratic function q(x, p) with s parameters, m ≥ s, is considered. The parameter vector is to be determined so as to satisfy three conditions: (1) q(x, p) must underestimate all m data points, i.e. q(x _i , p) ≤ y _i , i=1,...,m. (2) The error of the approximation is to be minimized in the L1 norm. (3) The eigenvalues of H are to satisfy specified lower and upper bounds, where H is the Hessian of q(x, p) with respect to x. This is called the Quadratic Underestimator with Bounds on Eigenvalues (QUBE) problem. An algorithm for its solution (QUBE algorithm) is given and justified, and computational results presented. The QUBE algorithm has application to finding the global minimum of a basin (or funnel) shaped function with a large number of local minima. Such problems arise in computational biology where it is desired to find the global minimum of an energy surface, in order to predict native protein-ligand docking geometry (drug design) or protein structure. Computational results for a simulated docking energy surface, with n=15, are presented. It is shown that specifying a small condition number for H improves the ability of the underestimator to correctly predict the global minimum point.     

Another Approach to Topological Descent Theory

In the category T op of topological spaces and continuous functions, we prove that surjective maps which are descent morphisms with respect to the class E of continuous bijections are exactly the descent morphisms, providing a new characterization of the latter in terms of subfibrations E(X) of the basic fibration given by T op/X which are, essentially, complete lattices. Also effective descent morphisms are characterized in terms of effective morphisms with respect to continuous bijections. For classes E satisfying suitable conditions, we show that the class of effective descent morphisms coincides with the one of effective E-descent morphisms.     

The chromatic numbers of double coverings of a graph

If we fix a spanning subgraph H of a graph G, we can define a chromatic number of H with respect to G and we show that it coincides with the chromatic number of a double covering of G with co-support H. We also find a few estimations for the chromatic numbers of H with respect to G.     

Proximal Set-Open Topologies on Partial Maps

Let X, Y be T ₁ topological spaces. A partial map from X to Y is a continuous function f whose domain is a subspace D of X and whose codomain is Y. Let P(X, Y) be the set of partial maps with domains in a fixed class D. In analogy with the global case, we introduce on P(X, Y), whatever be the nature of the domain class D, new function space topologies, the proximal set-open topologies, briefly PSOTs, deriving from general networks on X and proximity on Y by replacing inclusion with strong inclusion. The PSOTs include the already known generalized compact-open topology on partial maps with closed domains. When domains are supposed closed, the network α closed and hereditarily closed and the proximity δ on Y Efremovic, then the PSOT attached to α and δ is uniformizable iff α is a Urysohn family in X. This revised version was published online in June 2006 with corrections to the Cover Date.