Approximation under an arc length constraint

Let f C[a, b]. LetP be a subset ofC[a, b], L b – a be a given real number. We say thatp P is a best approximation tof fromP, with arc length constraintL, ifA[p] _b ^a [1 + (p(x)) ²]dx L andp – f q – f for allq P withA[q] L. represents an arbitrary norm onC[a, b]. The constraintA[p] L might be interpreted physically as a materials constraint.In this paper we consider the questions of existence, uniqueness and characterization of constrained best approximations. In addition a bound, independent of degree, is found for the arc length of a best unconstrained Chebyshev polynomial approximation.The work of L. L. Keener is supported by the National Research Council of Canada Grant A8755.     

Almost Covers Of 2-Arc Transitive Graphs

Let be a G-symmetric graph whose vertex set admits a nontrivial G-invariant partition with block size v. Let be the quotient graph of relative to and [B,C] the bipartite subgraph of induced by adjacent blocks B,C of . In this paper we study such graphs for which is connected, (G, 2)-arc transitive and is almost covered by in the sense that [B,C] is a matching of v-1 2 edges. Such graphs arose as a natural extremal case in a previous study by the author with Li and Praeger. The case K _v+1 is covered by results of Gardiner and Praeger. We consider here the general case where K _v+1, and prove that, for some even integer n 4, is a near n-gonal graph with respect to a certain G-orbit on n-cycles of . Moreover, we prove that every (G, 2)-arc transitive near n-gonal graph with respect to a G-orbit on n-cycles arises as a quotient of a graph with these properties. (A near n-gonal graph is a connected graph of girth at least 4 together with a set of n-cycles of such that each 2-arc of is contained in a unique member of .)     

Abschwächungen des Adjunktionsbegriffs

Generalizations of right adjointness (i.e. having a left adjoint) of a functor G:AX are studied. G is called weakly right adjoint, if for any X ObX there exists an A_X ObA and an arrow e_X:X GA_X, such that for any f:XGB there is a (not necessarily unique) morphism f:A_XB inA with (Gf)e_x=f. As weakly right adjoint functors do not have so many interesting properties, it is useful to consider weakly right adjoint functors with a certain uniqueness condition. There are three ways for doing this, first by assuming uniqueness only for special f' s, second by assuming uniquness only up to automorphisms, and third by assuming a canonical choice of f. A different way of generalizing right adjointness are the locally adjunctable functors of Kaput [5]. These weaker notions of adjointness are compared, their continuity properties are studied and the problem, when they imply right adjointness is discussed.     

A Uniqueness Result for an Overdetermined Problem in Non-Linear Parabolic Potential Theory

In this paper we study the question of uniqueness for an inverse problem, arising in the (thermal) linear and/or non-linear potential theory. The overdetermined problem we shall study is represented by(div(|u| ^p–2u)–D _t u–+)u=0where supp()R ⁿ ×(0,), 1<p<, L and {t=} is bounded for >0.The problem has applications in shape-recognition in underground water/oil recovery, subject to shape-change during time intervals. The particular case u0, D _t u0, and p=2, is an example of the well-known Stefan.     

Equivalence Bimodule Between Non-Commutative Tori

The non-commutative torus C ^*(ⁿ,) is realized as the C*-algebra of sections of a locally trivial C*-algebra bundle over S with fibres isomorphic to C ^*n/S, ₁) for a totally skew multiplier ₁ on ⁿ/S. D. Poguntke [9] proved that A is stably isomorphic to C(S) C(^*( Zⁿ/S, ₁) C(S) A M_kl( C) for a simple non-commutative torus A and an integer kl. It is well-known that a stable isomorphism of two separable C*-algebras is equivalent to the existence of equivalence bimodule between them. We construct an A-C(S) A-equivalence bimodule.     

Optimal pairs of score vectors for positional scoring rules

Letw=(w ₁,,w _m ) andv=(v ₁,,v _m-1 ) be nonincreasing real vectors withw ₁>w _m andv ₁>v _m-1 . With respect to a lista ₁,,a _n of linear orders on a setA ofm3 elements, thew-score ofaA is the sum overi from 1 tom ofw _i times the number of orders in the list that ranka inith place; thev-score ofaA{b} is defined in a similar manner after a designated elementb is removed from everya _j .We are concerned with pairs (w, v) which maximize the probability that anaA with the greatestw-score also has the greatestv-score inA{b} whenb is randomly selected fromA{a}. Our model assumes that linear ordersa _j onA are independently selected according to the uniform distribution over them linear orders onA. It considers the limit probabilityP _m (w, v) forn that the element inA with the greatestw-score also has the greatestv-score inA{b}.It is shown thatP _m (m,v) takes on its maximum value if and only if bothw andv are linear, so thatw _i –w _i+1=w _i+1–w _i+2 forim–2, andv _i –v _i+1 =v _i+1 –v _i+2 forim–3. This general result for allm3 supplements related results for linear score vectors obtained previously form{3,4}.     

Stop times in fock space stochastic calculus

Summary A stop time S in the boson Fock space over L ₂()₊ is a spectral measure in [0,] such that {S([0,t])} is an adapted process. Following the ideas of Hudson [6], to each stop time S a canonical shift operator U ^Sis constructed in . When S({}) has the vacuum as a null vector U ^Sbecomes an isometry. When S({})=0 it is shown that admits a factorisation _S]{S where _{S is the range of U ^Sand _S] is a suitable subspace of called the Fock space upto time S. This, in particular, implies the strong Markov property of quantum Brownian motion in the boson as well as fermion sense and the Dynkin-Hunt property that the classical Brownian motion begins afresh at each stop time. The stopped Weyl and fermion processes are defined and their properties studied. A composition operation is introduced in the space of stop time to make it a semigroup. Stop time integrals are introduced and their properties constitute the basic tools for the subject.     

Staircase kernels for orthogonald-polytopes

LetS be a finite union of boxes inR ^d . Forx inS, defineA _x ={yx is clearly visible fromy via staircase paths inS}, and let KerS denote the staircase kernel ofS. Then KerS={A _x x is a point of local nonconvexity ofS}. A similar result holds with clearly visible replaced by visible and points of local nonconvexity ofS replaced by boundary points ofS.Supported in part by NSF grant DMS-9207019.     

Distribution of the supremum of sums of independent variables with negative drift

Let {_n} be a sequence of identically distributed independent random variables,M₁=<0,M ₁ ² <;S ₀=0,S _n =₁+₂,+...+ _{n, n}1;¯ S=sup {S _n n=0.} The asymptotic behavior ofP(¯ St) as t is studied. If _t ^P (₁x dx=0((t)), thenP(¯ St)– 1/¦¦ _t P (₁x dx=0((t)) (t) is a positive function, having regular behavior at infinity.Translated from Matematicheskie Zametki, Vol. 22, No. 5, pp. 763–770, November, 1977.The author thanks B. A. Rogozin for the formulation of the problem and valuable remarks.     

Recurrence and transience for random walks with stationary increments

Summary Let S _n = ₁+...+ _n , n1, be the partial sums of stationary, dependent random variables in ^m . The probability space can be partitioned into I _t I _r , where I _t = {S _n} and I _r ={each S _n is limit point of (S _n)_n1}. This result follows from the inclusion{S _n > for n>0}I _t a.s., which is obtained by using Kac's inequality.     

ℒ2 sets which are almost starshaped

Let S be a subset of R ^d . The set S is said to be an set if and only if for every two points x and y of S, there exists some z S such that [x, z] [z, y] S. Clearly every starshaped set is an set, yet the converse is false and introduces an interesting question: Under what conditions will an set S be almost starshaped; that is, when will there exist a convex subset C of S such that every point of S sees some point of C via SThis paper provides one answer to the question above, and we have the following result: Let S be a closed planar set, S simply connected, and assume that the set Q of points of local nonconvexity of S is finite. If some point p of S see each member of Q via S, then there is a convex subset C of S such that every point of S sees some point of C via S.     

Die Verteilung der schlichten Funktionen in einem Funktionenraum

We consider the set of regular functions . We construct a Borel measure and a class of outer measures _h onH. With these and _h we show that: (HS)=0 and _h (HS)=0, (S is the set of normed univalent functions). From _h (HS)=0 follows—forh=t —that the Hausdorff—Billingsley-dimension ofHS is zero.     

Head of the line processor sharing for many symmetric queues with finite capacity

In this paper the steady-state behavior of many symmetric queues, under the head of the line processor-sharing discipline, is investigated. The arrival process to each of n queues is Poisson, with rateA, and each queue hasr waiting spaces. A job arriving at a full queue is lost. The queues are served by a single exponential server, which has a mean raten, and splits its capacity equally amongst the jobs at the head of each nonempty queue. The normal traffic casep=/< 1 is considered, and it is assumed thatn1 andr= 0(1). A 2-term asymptotic approximation to the loss probabilityL is derived, and it is found thatL = 0(n ^–r ), for fixedp. If6=(1–p)/p 1, then the approximation is valid if n² 1 and (r+ 1)²n, and in this caseL r!/(n)^r. Numerical values ofL are obtained forr = 1,2,3,4 and 5,n = 1000,500 and 200, and various values ofp< 1. Very small loss probabilities may be obtained with appropriate values of these parameters.     

Asymptotic behavior of the dwell time distribution for a random walk on a positive semi-axis

Let ₁, ₂, ... be a sequence of independent identically distributed random variables with zero means. We consider the functional _n = _k=o ⁿ (S _k ) where S₁=0, S_k= _i=1 ^k _i (k1) and(x)=1 for x0,(x) = 0 for x<0. It is readily seen that _n is the time spent by the random walk S_n, n0, on the positive semi-axis after n steps. For the simplest walk the asymptotics of the distribution P (_n = k) for n and k, as well as for k = O(n) and k/n<1, was studied in [1]. In this paper we obtain the asymptotic expansions in powers of n^–1 of the probabilities P(h_n = nx) and P(nx_{1 n} nx₂) for 0<₁, x = k/n ₂<1, 0<₁x₁2₂<1.Translated from Matematicheskie Zametki, Vol. 15, No. 4, pp. 613–620, April, 1974.The author wishes to thank B. A. Rogozin for valuable discussions in the course of his work.     

The central limit theorem for Chébli-Trimèche hypergroups

Let (S _nn>-1) be a random walk on a hypergroup ( ₊ , *), i.e., a Markov chain with transition kernelN(x, A) = _x * (A), where is a fixed probability measure on ₊ such that the second moment exists. Then depending on the growth of the hypergroup two situations can occur: when ( ₊ , *) is of exponential growth then it is shown thatS _n is asymptotically normal. In the case of polynomial growth {more precisely, if the densityA of the Haar measure of ( ₊ , *) satisfies lim[A()/A()]=}, the normalized variablesS _n/[n Var()/(+1)]^1/2 converge to a Rayleigh distribution with parameter .     

Solution of the neutron transport equation by means of hermite-S ∞-theory

Summary A stable numerical approximation (H -S ) is obtained through the use of Hermite's method of order (H ) in the spatial integration of the 1D neutron transport equation. The theory for =1 is applied to a one-group shielding problem.Numerical calculations show the new method to converge much faster than earlier versions ofS -theory. Comparison ofH ₁-S with the well-knownS _N -code ANISN indicates a large gain in computing time for the former.

---

Zusammenfassung Durch Anwendung der Hermiteschen Integrationsmethode der Ordnung (H ) auf die Ortsintegration der 1D Neutronentransportgleichung entsteht eine numerisch stabile Approximation (H -S ). Diese Methode wurde für =1 auf ein 1 Gruppen-Abschirmungsproblem angewandt.Numerische Rechnungen zeigen die wesentlich raschere Konvergenz der Methode verglichen mit den ursprünglichen Versionen derS -Theorie. Durch Vergleich mit dem bekanntenS _N -Code ANISN wurde gezeigt, dass mit derH ₁-S -Methode ein grosser Rechenzeitgewinn erzielt wird.

     

Simplicial Cohomology with Coefficients in Symmetric Categorical Groups

In this paper we introduce and study a cohomology theory {H ⁿ (–,A)} for simplicial sets with coefficients in symmetric categorical groups A. We associate to a symmetric categorical group A a sequence of simplicial sets {K(A,n)} _n0, which allows us to give a representation theorem for our cohomology. Moreover, we prove that for any n3, the functor K(–,n) is right adjoint to the functor _n , where _n (X ) is defined as the fundamental groupoid of the n-loop complex ⁿ (X ). Using this adjunction, we give another proof of how symmetric categorical groups model all homotopy types of spaces Y with _i (Y)=0 for all in,n+1 and n3; and also we obtain a classification theorem for those spaces: [–,Y]H ⁿ (–, _n (Y)).     

Smoothness of Brownian local times and related functionals

In this paper we show that the local time of the Brownian motion belongs to the Sobolev space for any p2 and 0<<1/p. In order to prove this result we first discuss the smoothness and integrability properties of the composition of the Dirac function with a Wiener integral W(h), and we show that this composition belongs to , for any >0 and p>1 such that +1/p>1.     

Convex Hulls in Singular Spaces of Negative Curvature

The paper gives a simple example of a complete CAT(–1)-space containing a set S with the following property: the boundary at infinity CH(S)of the convex hull of S differs from S by an isolated point. In contrast to this it is shown that if S is a union of finitely many convex subsets of a complete CAT(–1)-space X, then CH(S) = S. Moreover, this identity holds without restrictions on S if CH is replaced by some notion of almost convex hull.