Subdivision algorithms with nonnegative masks generally converge

In this paper, a subdivision scheme consists of an operator froml () tol () determined by a doubly infinite sequence, called the mask. This operator convolutes, in a certain sense, sequences l () with the mask, thus producing a new sequence inl (). Moreover, this new sequence is placed on a finer grid. If we iterate this process with a positive mask infinitely many times, it is known that this process will produce a continuous function, which we callf . In this paper, we consider the extent to which non-negative masks yield similar results. An important application of subdivision schemes in computer graphics is the generation of curves and surfaces from an initial sequence.     

Extremal feedback perturbations for families of closed operators

Let T- S, be a family of not necessarily bounded semi-Fredholm operators, where T and S are operators acting between Banach spaces X and Y, and where S is bounded with D(S) D(T). For compact sets , as well as for certain open sets , we investigate existence and minimal rank of bounded feedback perturbations of the form F=BE such that min.ind (T-S+F)=0 for all . Here B is a given operator from a linear space Z to Y and E is some operator from X to Z.We give a simple characterization of that situation, when such regularizing feedback perturbations exist and show that for compact sets the minimal rank never exceeds max { min.ind (T-S) }+1. Moreover, an example shows that the minimal rank, in fact, may increase from max {...} to max {...}+1, if the given B enforces a certain structure of the feedbachk perturbation F.However, the minimal rank is equal to max { min.ind (T-S) }, if is an open set such that min.ind (T-S) already vanishes for all but finitely many points . We illustrate this result by applying it to the stabilization of certain infinite-dimensional dynamical systems in Hilbert space.     

Linear cyclic codes of wordlength v over GF(q s ) which are also linear cyclic codes of wordlength sv over GF(q)

Any nonsingular linear transformation : GF(q^s) GF(q^s) can be used to treat a linear cyclic code of wordlength v over GF(q^s) as a linear code () of Wordlength sv over GF(q). This paper determines those linear cyclic codes and transformations for which the resulting linear code () is also cyclic.     

L ∞ Algebra Representations

It is shown that the direct sum of an L algebra and a module over it has a natural L algebra structure.     

The Ramsey property for collections of sequences not containing all arithmetic progressions

A family of sequences has the Ramsey property if for every positive integerk, there exists a least positive integerf (k) such that for every 2-coloring of {1,2, ...,f (k)} there is a monochromatick-term member of . For fixed integersm > 1 and 0 q < m, let _q(m) be the collection of those increasing sequences of positive integers {x ₁,..., x_k} such thatx _i+1 – x_i q(modm) for 1 i k – 1. Fort a fixed positive integer, denote byA _t the collection of those arithmetic progressions having constant differencet. Landman and Long showed that for allm 2 and 1 q < m, _q(m) does not have the Ramsey property, while _q(m) A _m does. We extend these results to various finite unions of _q(m) 's andA _t 's. We show that for allm 2, _q=1 ^m–1 _q(m) does not have the Ramsey property. We give necessary and sufficient conditions for collections of the form _q(m) ( _{t T} A _t) to have the Ramsey property. We determine when collections of the form _a(m₁) _b(m₂) have the Ramsey property. We extend this to the study of arbitrary finite unions of _q(m)'s. In all cases considered for which has the Ramsey property, upper bounds are given forf .     

A Polynomial Cutting Surfaces Algorithm for the Convex Feasibility Problem Defined by Self-Concordant Inequalities

Consider a nonempty convex set in ^m which is defined by a finite number of smooth convex inequalities and which admits a self-concordant logarithmic barrier. We study the analytic center based column generation algorithm for the problem of finding a feasible point in this set. At each iteration the algorithm computes an approximate analytic center of the set defined by the inequalities generated in the previous iterations. If this approximate analytic center is a solution, then the algorithm terminates; otherwise either an existing inequality is shifted or a new inequality is added into the system. As the number of iterations increases, the set defined by the generated inequalities shrinks and the algorithm eventually finds a solution of the problem. The algorithm can be thought of as an extension of the classical cutting plane method. The difference is that we use analytic centers and convex cuts instead of arbitrary infeasible points and linear cuts. In contrast to the cutting plane method, the algorithm has a polynomial worst case complexity of O(Nlog 1/) on the total number of cuts to be used, where N is the number of convex inequalities in the original problem and is the maximum common slack of the original inequality system.     

Fractal properties of the singular function s(u)

The function s(u) arising in the study of long primitive BCH codes over GF(q) is reviewed. The set of points 0 < u 1 such that q ^ku has a modulo 1 representation in the interval [a, 1] for every integer k 0 is shown to have Hausdorff dimension s(a) for every 0 a 1. Berlekamp's conjecture on the dimension of a set of points at which s fails to be differentiable is also proved.     

Difference Sets with n = 2pm

Let D be a (v,k,) difference set over an abelian group G with even n = k - . Assume that t N satisfies the congruences t q _i ^fi (mod exp(G)) for each prime divisor q_i of n/2 and some integer f_i. In [4] it was shown that t is a multiplier of D provided that n > , (n/2, ) = 1 and (n/2, v) = 1. In this paper we show that the condition n > may be removed. As a corollary we obtain that in the case of n= 2p^a when p is a prime, p should be a multiplier of D. This answers an open question mentioned in [2].     

Asymptotic Density and the Asymptotics of Partition Functions

Let A be a set of positive integers with gcd (A) = 1, and let p _A (n) be the partition function of A. Let c ₀ = 2/3. If A has lower asymptotic density and upper asymptotic density , then lim inf log p _A (n)/c ₀ n and lim sup log p _A (n)/c ₀ n . In particular, if A has asymptotic density > 0, then log p _A (n) c₀n. Conversely, if > 0 and log p _A (n) c ₀ n, then the set A has asymptotic density .     

Moduli of smoothness and best approximation in the spacesL p , 0<p<1

L ^p , 0<<1, .     

Connected and alternating vectors: Polyhedra and algorithms

Given a graphG = (V, E), leta ^S, S L, be the edge set incidence vectors of its nontrivial connected subgraphs.The extreme points of = {x R ^E: a^sx |V(S)| - |S|, S L} are shown to be integer 0/± 1 and characterized. They are the alternating vectorsb ^k, k K, ofG. WhenG is a tree, the extreme points ofB 0,b ^kx 1,k K} are shown to be the connected vectors ofG together with the origin. For the four LP's associated with andA, good algorithms are given and total dual integrality of andA proven.On leave from Swiss Federal Institute of Technology, Zurich.     

On a nonlinear eigenvalue problem

In the present paper we consider a selfadjoint and nonsmooth operator-valued function on (c, d)R ¹. We suppose that the equation (L()x, x)=0,x0, has exactly one rootp(x) (c, d) and the functionf()=(L()x, x) is increasing at the pointp(x). We discuss questions of the variational theory of the spectrum. Some theorems on the variational properties of the spectrum are proved.     

A lifting procedure for the asymmetric traveling salesman polytope and a large new class of facets

Given any family of valid inequalities for the asymmetric traveling salesman polytopeP(G) defined on the complete digraphG, we show that all members of are facet defining if the primitive members of (usually a small subclass) are. Based on this result we then introduce a general procedure for identifying new classes of facet inducing inequalities forP(G) by lifting inequalities that are facet inducing forP(G), whereG is some induced subgraph ofG. Unlike traditional lifting, where the lifted coefficients are calculated one by one and their value depends on the lifting sequence, our lifting procedure replaces nodes ofG with cliques ofG and uses closed form expressions for calculating the coefficients of the new arcs, which are sequence-independent. We also introduce a new class of facet inducing inequalities, the class of SD (source-destination) inequalities, which subsumes as special cases most known families of facet defining inequalities.Research supported by Grant DDM-8901495 of the National Science Foundation and Contract N00014-85-K-0198 of the U.S. Office of Naval Research.Research supported by M.U.R.S.T., Italy.     

Net subgroups of Chevalley groups. II. Gauss decomposition

This paper is a continuation of RZhMat 1980, 5A439, where there was introduced the subgroup () of the Chevalley group G(,R) of type over a commutative ring R that corresponds to a net , i.e., to a set =(),, of ideals of R such that ₊ whenever ,,+ . It is proved that if the ring R is semilocal, then () coincides with the group ₀ considered earlier in RZhMat 1976, 10A151; 1977, 10A301; 1978, 6A476. For this purpose there is constructed a decomposition of () into a product of unipotent subgroups and a torus. Analogous results are obtained for sub-radical nets over an arbitrary commutative ring.Translated from Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta im. V. A. Steklova AN SSSR, Vol. 114, pp. 62–76, 1982.In conclusion, the authors would like to thank Z. I. Borevich for his interest in this paper.     

On the existence of wave operators for the Klein-Gordon equation

The problem of existence of wave operators for the Klein-Gordon equation ( _t ² –+²+iV_1t+V₂)u(x,t)=0 (x R ⁿ,t R, n3, >0) is studied where V₁ and V₂ are symmetric operators in L₂(R ⁿ) and it is shown that conditions similar to those of Veseli-Weidmann (Journal Functional Analysis 17, 61–77 (1974)) for a different class of operators are also sufficient for the Klein-Gordon equation.     

Limit theorems for sums of independent random variables defined on a nonrecurrent random walk

Let {X_i} _i= -, {_i} _i=1 be two independent sequences of randoms variables, where the _i are identically distributed and assume integer values. LetIn the paper the question of the asymptotic behavior as n of the quantity is considered. It is shown that the distribution of W_n converges to the distribution of the normal law and that the estimate of the rate of convergence has the same order as the classical estimate of Berry-Esseen.Translated from Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta im. V. A. Steklova AN SSSR, Vol. 85, pp. 17–29, 1979.The author is grateful to I. A. Ibragimov for his attention to the present work and for useful discussions.     

A Niche Width Model of Optimal Specialization

Niche width theory, a part of organizational ecology, predicts whether specialist or generalist forms of organizations have higher fitness, in a continually changing environment. To this end, niche width theory uses a mathematical model borrowed from biology. In this paper, we first loosen the specialist-generalist dichotomy, so that we can predict the optimal degree of specialization. Second, we generalize the model to a larger class of environmental conditions, on the basis of the model's underlying assumptions. Third, we criticize the way the biological model is treated in sociological theory. Two of the model's dimensions seem to be confused, i.e., that of trait and environment; the predicted optimal specialization is a property of individual organizations, not of populations; and, the distinction between fine and coarse grained environments is superfluous.     

Geometric properties of 2-dimensional Brownian paths

Summary Let A be the set of all points of the plane , visited by 2-dimensional Brownian motion before time 1. With probability 1, all points of A are twist points except a set of harmonic measure zero. Twist points may be continuously approached in \A only along a special spiral. Although negligible in the sense of harmonic measure, various classes of cone points are dense in A, with probability 1. Cone points may be approached in \A within suitable wedges.Research supported in part by NSF Grant DMS 8419377     

Some functional inequalities and their Baire category properties

Summary In the paper we consider, from a topological point of view, the set of all continuous functionsf:I I for which the unique continuous solution:I – [0, ) of(f(x)) (x, (x)) and(x, (x)) (f(x)) (x, (x)), respectively, is the zero function. We obtain also some corollaries on the qualitative theory of the functional equation(f(x)) = g(x, (x)). No assumption on the iterative behaviour off is imposed.     

On the Dynamics of a Differential Inclusion Built upon a Nonconvex Constrained Minimization Problem

In this paper, we study the dynamics of a differential inclusion built upon a nonsmooth, not necessarily convex, constrained minimization problem in finite-dimensional spaces. In particular, we are interested in the investigation of the asymptotic behavior of the trajectories of the dynamical system represented by the differential inclusion. Under suitable assumptions on the constraint set and the two involved functions (one defining the constraint set, the other representing the functional to be minimized), it is proved that all the trajectories converge to the set of the constrained critical points. We present also a large class of constraint sets satisfying our assumptions. As a simple consequence, in the case of a smooth convex minimization problem, we have that any trajectory converges to the set of minimizers.Research partially supported by the research project CNR-GNAMPA Mathematical Methods for Control Theory and supported in part by the European Communitys Human Potential Program under Contract HPRN-CT-2002-00281, Evolution Equations.