On Periodic Solutions of Nonlinear Functional Differential Equations

Sufficient conditions are established for the existence and uniqueness of an -periodic solution of the functional differential equation where f is a continuous operator acting from the space of n-dimensional -periodic continuous vector functions into the space of n-dimensional -periodic and summable on [0,] vector functions.     

Finiteness Result for the Simplicial Branch-and-Bound Algorithm Based on ω-Subdivisions

The question of the finiteness of simplicial branch-and-bound algorithms employing only -subdivisions is considered. In Ref. 1, it was shown that this algorithm is convergent; here, it is proved that the algorithm is also finite if two assumptions are fulfilled. The first assumption requires the function values at vertices of the initial simplex to be lower than the optimal value of the problem. The second assumption requires each vertex of the initial simplex to violate at most one of the constraints defining the feasible polytope. The first assumption is mild from a theoretical point of view; the second assumption is strong, but holds always for instance when the feasible region is a hypercube.     

Some topological properties of ω-covering sets

We prove the following theorems:1. There exists an -covering with the property s ₀.2. Under cov there exists X such that is not an -covering orX \ B is not an -covering].3. Also we characterize the property of being an -covering.     

On the Algebraic Structure of Quasi-cyclic Codes II: Chain Rings

The ring decomposition technique of part I is extended to the case when the factors in the direct product decomposition are no longer fields but arbitrary chain rings. This includes not only the case of quasi-cyclic codes over rings but also the case of quasi-cyclic codes over fields whose co-index is no longer prime to the characteristic of the field. A new quaternary construction of the Leech lattice is derived.     

On Some Isomorphism on the Category of b-Spaces

Given a nuclear b-space N, we show that if is a finite or -finite measure space and 1p, then the functors L _loc ^p (,N.) and NL ^p (,.) are isomorphic on the category of b-spaces of L. Waelbroeck.     

On <Emphasis Type="Italic">L</Emphasis><Subscript>α,ω</Subscript> complete extensions of complete theories of Boolean algebras

For a complete first order theory of Boolean algebras T which has nonisomorphic countable models, we determine the first limit ordinal = (T) such that We show that for some and for all other Ts, A nonprincipal ideal I of B is almost principal, if a is a principal ideal of B} is a maximal ideal of B. We show that the theory of Boolean algebras with an almost principal ideal has complete extensions and characterize them by invariants similar to the Tarskis invariants.Mathematics Subject Classification (2000): Primary 03C15, Secondary 03C35, 06E05Revised version: 2 February 2004     

On the Convergence of Cone Splitting Algorithms with ω-Subdivisions

We present a convergence proof of the Tuy cone splitting algorithm with a pure -subdivision strategy for the minimization of a concave function over a polytope. The key idea of the convergence proof is to associate with the current hyperplane a new hyperplane that supports the whole polytope instead of only the portion of it contained in the current cone. A branch-and-bound variant of the algorithm is also discussed.     

On the Representation of Approximate Subdifferentials for a Class of Generalized Convex Functions

Given a family of real-valued functions defined in a normed vector space X, we study a class of -convex functions having a simpler representation for the --subdifferential. The case =X^* with X being a Banach space (the Fenchel case) is particularly analysed, and we find that the sublinear lower semicontinuous functions satisfy the simpler representation with respect to X^*. As a side result, we provide various new subdifferential-type charaterizations of positively homogeneous functions among those which are lower semicontinuous and convex. In addition, we also discuss that family related to the the so-called prox-bounded functions. In this more general framework our simpler representation may give rise to a new notion of enlargement of the subdifferential.Mathematics Subject Classifications (2000) 47H05, 46B99, 47H17.This work is based on research material supported in part by CONICYT-Chile through FONDECYT 101-0116 and FONDAP-Matemáticas Aplicadas II.     

Rates of convergence of α-stable random motions

The rate-of-convergence problem in the central limit theorem is considered for -stable distributions on the noncommutative group of motions in ^d. The method used here is based on the theory of probability metrics.     

Pathwise rate- stability for input-output processes

An input-output processZ = {Z(t), t 0} is said to be-rate stable ifZ(t) = o((t)) for some non-negative function(t). We prove that the processZ is -rate stable under weak conditions that include the assumption that input satisfies a linear burstiness condition and Z is asymptotically average stable. In many cases of interest, the conditions for-rate-stability can be verified from input data. For example, using input information, we establish-rate stability of the workload for multiserver queues, an ATM multiplexer, and-rate stability of queue-length processes for infinite server queues.     

Equicontinuity of Maps on Figure-eight Space

Let 8 be the figure-eight space and f : 8 8 be a continuous map with a periodic point. In this paper, we show that f is equicontinuous if and only if one of the following conditions holds: (1) (8) is a circle on 8 and f|_o is conjugate to a rational rotation.AMS Mathematics Subject Classification (1991) 54H20     

On Convergence of the Simplicial Branch-and-Bound Algorithm Based on ω-Subdivisions

The problem of minimizing a concave function over a polytope is considered. The simplicial branch-and-bound approach is presented and theoretical studies about the convergence of these algorithms are carried on. In particular, the convergence of the algorithm based on so-called -subdivisions is proved, which had been an open question for a long time.     

On the ω-limit Set Dichotomy of Cooperating Kolmogorov Systems

The authors study the -limit set dichotomy of the Kolmogorov systems _i=x_i f _i(x)x _i0, 1in with the cooperative and irreducible hypotheses and obtain the quasiconvergence almost everywhere when n=3, which gives an affirmative answer to the open problem by Smith [9, p.72] in the case of n=3.     

On a Class of Symmetric Balanced Generalized Weighing Matrices

Let q be a prime power and m a positive integer. A construction method is given to multiply the parametrs of an -circulant BGW(v=1+q+q ₂+·+q ^m , q ^m , q ^m –q ^m–1) over the cyclic group C _n of order n with (q–1)/n being an even integer, by the parameters of a symmetric BGW(1+q ^m+1, q ^m+1, q ^m+1–q ^m ) with zero diagonal over a cyclic group C _vn to generate a symmetric BGW(1+q+·+q ^2m+1,q ^2m+1,q ^2m+1–q ^2m) with zero diagonal, over the cyclic group C _n . Applications include two new infinite classes of strongly regular graphs with parametersSRG(36(1+25+·+25^2m+1),15(25)^2m+1,6(25)^2m+1,6(25)^2m+1), and SRG(36(1+49+·+49^2m+1),21(49)^2m+1,12(49)^2m+1,12(49)^2m+1).     

On the variational convergence of non-coercive quadratic integral functionals and semicontinuity problems

In this paper we give some results about convergence of non coercive quadratic integral functionals by examining the behaviour of coefficients. We apply our results to semicontinuity problems and we illustrate them by some examples.AMS Subject Classification: 40A10, 49J45.     

Inequality of Petrović and Giaccardi for Convex Function of Higher Order

In this paper we use Lidstone polynomials to prove further generalization of Giaccardi generalization of the well-known Petrovis inequality.     

A Simplified Convergence Proof for the Cone Partitioning Algorithm

We present a new convergence result for the cone partitioning algorithm with a pure -subdivision strategy, for the minimization of a quasiconcave function over a polytope. It is shown that the algorithm is finite when -optimal solution with > 0 are looked for, and that any cluster point of the points generated by the algorithm is an optimal solution in the case = 0. This result improves on the one given previously by the authors, its proof is simpler and relies more directly on a new class of hyperplanes and its associated simplicial lower bound.     

A Note on π-Engel Conditions

In this paper we show that the weakly -Engel conditions are closely related to the existance of normal -complements; while the -Engel conditions are closely related to the -nilpotent groups.AMS Subject Classification (2000): 20D20     

On the Neighbourhood of a Subclass of Univalent Functions Related to Complex Order

We consider the class of functions R(A, B) introduced by Dixit and Pal, where b 0 is a complex number and A, B are fixed members –1 B < A 1. We will study the -neighbourhoods for functions belonging to R^b(A, B), by using convolution techniques.AMS Mathematics Classification (2000): 30C55     

On the smoothness of conjugacy for circle covering maps

A conjugacy betweenC ¹⁺ -hyperbolic circle covering maps isC ¹⁺ if it has a positive derivative on some point in the -set.