Positive Solutions for a Singular Nonlinear Problem on a Bounded Domain in R 2

For a bounded regular Jordan domain in R ², we introduce and study a new class of functions K() related on its Green function G. We exploit the properties of this class to prove the existence and the uniqueness of a positive solution for the singular nonlinear elliptic equation u+(x,u)=0, in D(), with u=0 on and uC(), where is a nonnegative Borel measurable function in ×(0,) that belongs to a convex cone which contains, in particular, all functions (x,t)=q(x)t ^–,>0 with nonnegative functions qK(). Some estimates on the solution are also given.     

Flocks of a quadratic cone in PG(3, q), q ≤ 8

If (O) is a quadratic cone in PG(3,q), with vertex x, then a flock of (O) is a partition of (O)-{x} into q disjoint conics. With such a flock there correspond a translation plane of order q ² and a generalized quadrangle of order (q ², q). Here we determine all flocks of (O) for q 8.     

A chord-stretching map of a convex loop is an isometry

Let ⁿ be n-dimensional Euclidean space, and let : [0, L] ⁿ and : [0, L] ⁿ be closed rectifiable arcs in ⁿ of the same total length L which are parametrized via their arc length. is said to be a chord-stretched version of if for each 0s tL, |(t)–(s)| |(t)–(s)|. is said to be convex if is simple and if ([0, L]) is the frontier of some plane convex set. Individual work by Professors G. Choquet and G. T. Sallee demonstrated that if were simple then there existed a convex chord-stretched version of . This result led Professor Yang Lu to conjecture that if were convex and were a chord-stretched version of then and would be congruent, i.e. any chord-stretching map of a convex arc is an isometry. Professor Yang Lu has proved this conjecture in the case where and are C ² curves. In this paper we prove the conjecture in general.     

Une généralisation d'un résultat de J. Aczél et M. Hosszú sur l'équation de translation

Résumé En généralisant un résultat de J. Aczél et M. Hosszú on donne des conditions nécessaires et suffisantes pour qu'une solution de l'équation de translationF(F(, x), y) = F(, xy), oùF: × G , est un ensemble arbitraire,G forme un groupe, soit de la formeF(, x) = f ^–1(f()·1(x)), oùf est une bijection de au groupeG ₁ isomorphe avecG et 1 est un homomorphisme deG àG ₁. On considère aussi le cas oùG forme un espace vectoriel sur le corps des nombres rationels.Si est un intervalle ayant plus qu'un point etG = R ^m avec l'addition comme l'opération on trouve des conditions pour que la fonction continueF soit de la formeF(, x ₁,, x _m ) =f ^–1(f() + c ₁ x ₁ + +c _m x _m ), oùf est une homéomorphie de àR et (c ₁,,c _m ) R ^m .

---

     

Quasianapole Interaction of Charged Fermions

We obtain the analytic expression for the total cross section of the reaction e ^– e ⁺l ^– l ⁺ (l=,) taking possible quasianapole interaction effects into account. We find numerical restrictions on the interaction parameter value from data for the reaction e ^– e ^+–+ in the energy domain below the Z ⁰ peak.     

Commutator Subgroups of the Extended Hecke Groups \bar H(\lambda _q )

Hecke groups H(_q) are the discrete subgroups of generated by S(z) = –(z+ _q)^–1and T(z) = –1/z. The commutator subgroup of H(_q), denoted by H(_q), is studied in [2]. It was shown that H(_q) is a free group of rank q– 1.Here the extended Hecke groups obtained by adjoining to the generators of H(_q) are considered. The commutator subgroup of is shown to be a free product of two finite cyclic groups. Also it is interesting to note that while in the H(_q) case, the index of H(_q) is changed by q, in the case of this number is either 4 for qodd or 8 for qeven.     

Growth of length of sequential derivation transformed into natural one

We consider the (&, )-fragment of the intuitionistic propositional calculus. It is proved that under the standard transformation of a Gentzen derivation into a natural derivation(), the length of (())2^2·length( ). There is constructed a sequence of Gentzen derivations of length _i, for which the length of (( _i))2^{1/3·length(i}), which shows that the upper bound obtained is not too weak.Translated from Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta im. V. A. Steklova AN SSSR, Vol. 88, pp. 192–196, 1979.     

On Compensated Compactness for Nonlinear Elliptic Problems in Perforated Domains

We consider a sequence of Dirichlet problems for a nonlinear divergent operator A: W _m ¹( _s ) [W _m ¹( _s )]^* in a sequence of perforated domains _s . Under a certain condition imposed on the local capacity of the set \ _s , we prove the following principle of compensated compactness: , where r _s(x) and z _s(x) are sequences weakly convergent in W _m ¹() and such that r _s(x) is an analog of a corrector for a homogenization problem and z _s(x) is an arbitrary sequence from whose weak limit is equal to zero.     

Subsets with Restricted Movement

Let G be a finite permutation group on a set with no fixed points in and let m and k be integers with 0 < m < k. For a finite subset of the movement of is defined as move() = max_gG| ^g \ |. Suppose further that G is not a 2-group and that p is the least odd prime dividing |G| and move() m for all k-element subsets of . Then either || k + m or k (7m – 5) / 2, || (9m – 3)/2. Moreover when || > k + m, then move() m for every subset of .     

Some inequalities about the covering radius of Reed-Muller codes

Let R(r, m) be the rth order Reed-Muller code of length 2 ^m , and let (r, m) be its covering radius. We prove that if 2 k m - r - 1, then (r + k, m + k) (r, m + 2(k - 1). We also prove that if m - r 4, 2 k m - r - 1, and R(r, m) has a coset with minimal weight (r, m) which does not contain any vector of weight (r, m) + 2, then (r + k, m + k) (r, m) + 2k(. These inequalities improve repeated use of the known result (r + 1, m + 1) (r, m).This work was supported by a grant from the Research Council of Wright State University.     

Rate of expansion of an inhomogeneous branching process of brownian particles

Summary Let X be the (B ⁰, {q _n (x)})-branching diffusion where B ⁰is the exp -subprocess of BM(R¹) and q _n (x) is the probability that a particle dying at x produces n offspring, q ₀ q ₁0. Put m(x) = nq _n (x). We assume q _n , n2, m and k are all continuous (but m is not necessarily bounded). If k(x)m(x)0 as ¦x¦, then we prove that R _t /t( ₂/2)^1/2, as t, a.s. and in mean (of any order) where R _t is the position of the rightmost particle at time t and ₀ is the largest eigenvalue of (1/2)d ²/dx ² + Q, Q(x) = k(x)(m(x)–1).This work was supported in part by a grant from the National Science Foundation # MCS-8201470.     

Efficient Regular Polygon Dissections

We study the minimum number g(m,n) (respectively, p(m,n)) of pieces needed to dissect a regular m-gon into a regular n-gon of the same area using glass-cuts (respectively, polygonal cuts). First we study regular polygon-square dissections and show that n/2 -2 g(4,n) (n/2) + o(n) and n/4 g(n,4) (n/2) + o(n) hold for sufficiently large n. We also consider polygonal cuts, i.e., the minimum number p(4,n) of pieces needed to dissect a square into a regular n-gon of the same area using polygonal cuts and show that n/4 p(4,n) (n/2) + o(n) holds for sufficiently large n. We also consider regular polygon-polygon dissections and obtain similar bounds for g(m,n) and p(m,n).     

Constraint decomposition algorithms in global optimization

Many global optimization problems can be formulated in the form min{c(x, y): x X, y Y, (x, y) Z, y G} where X, Y are polytopes in ^p , ⁿ , respectively, Z is a closed convex set in ^p+n, while G is the complement of an open convex set in ⁿ . The function c: ^p+n is assumed to be linear. Using the fact that the nonconvex constraints depend only upon they-variables, we modify and combine basic global optimization techniques such that some new decomposition methods result which involve global optimization procedures only in ⁿ . Computational experiments show that the resulting algorithms work well for problems with smalln.     

Partitioning arrangements of lines II: Applications

In this paper we present efficient deterministic algorithms for various problems involving lines or segments in the plane, using the partitioning algorithm described in a companion paper [A3]. These applications include: (i) anO(m ^2/3 n ^2/3 · log^2/3 n · log^/3 (m/n)+(m+n) logn) algorithm to compute all incidences betweenm points andn lines, where is a constant <3.33; (ii) anO(m ^2/3 n ^2/3 · log^5/3 n · log^/3 (m/n)+(m+n) logn) algorithm to computem faces in an arrangement ofn lines; (iii) anO(n ^4/3 log^(+2)/3 n) algorithm to count the number of intersections in a set ofn segments; (iv) anO(n ^4/3 log^{( + 2)/3} n) algorithm to count red-blue intersections between two sets of segments, and (v) anO(n ^3/2 log^/3 n) algorithm to compute spanning trees with low stabbing number for a set ofn points. We also present an algorithm that, given set ofn points in the plane, preprocesses it, in timeO(nm log^+1/2 n), into a data structure of sizeO(m) forn lognmn ², so that the number of points ofS lying inside a query triangle can be computed inO((n/m) log^3/2 n) time.Work on this paper has been supported by Office of Naval Research Grant N00014-87-K-0129, by National Science Foundation Grant DCR-83-20085, and by grants from the Digital Equipment Corporation and the IBM Corporation. A preliminary version of this paper appears in theProceedings of the 5th ACM Symposium on Computational Geometry, 1989, pp. 11–22.     

Exponential Sums for O+(2n,q) and Their Applications

For a nontrivial additive character of the finite field with q elements and each positive integer r, the exponential sums ( ( trw )^r ) over w SO ⁺(2n,q) and over w O ⁺(2n,q) are considered. We show that both of them can be expressed as polynomials in q involving certain new exponential sums. Estimates on those new exponential sums are given. Also, we derive from these expressions the formulas for the number of elements w in SO ⁺(2n,q) and O ⁺(2n,q) with (trw) ^r = , for each in the finite field with q elements.     

On a Test Statistic for Linear Trend

Let {W(s)} _s 0 be a standard Wiener process. The supremum of the squared Euclidian norm Y (t)², of the R²-valued process Y(t)=(1/t W(t), {12/t ³ int_{0 t} s dW (s)– {3/t} W(t)), t [, 1], is the asymptotic, large sample distribution, of a test statistic for a change point detection problem, of appearance of linear trend. We determine the asymptotic behavior P {sup _t [, 1] Y(t)² > u as u , of this statistic, for a fixed (0,1), and for a moving = (u) 0 at a suitable rate as u . The statistical interest of our results lie in their use as approximate test levels.     

Posterior Sensitivity to the Sampling Distribution and the Prior: More than One Observation

Sensitivity of a posterior quantity (f, P) to the choice of the sampling distribution f and prior P is considered. Sensitivity is measured by the range of (f, P) when f and P vary in nonparametric classes ^f and ^P respectively. Direct and iterative methods are described which obtain the range of (f, P) over f ^f when prior P is fixed, and also the overall range over f ^f and P ^P . When multiple i.i.d. observations X ₁,...,X _k are observed from f, the posterior quantity (f, P) is not a ratio-linear function of f. A method of steepest descent is proposed to obtain the range of (f, P). Several examples illustrate applications of these methods.     

A Solution of a Problem of A. E. Brouwer

Let q=p^e 1(mod 4) be a prime power, and let ^(q) be the Paley graph over the finite field . Denote by ^(q) the subgraph of ^(q) induced on the set of non-zero squares of . In this paper the full automorphism group of ^(q) is determined affirming the conjecture of Brouwer [Des. Codes Cryptograph. 21, 69–76 (2000)]. The proof combines spectral and Schur ring techniques.     

Présentations des groupes de Fischer (II)

In this paper we give Coxeter presentation (X, ) for the three Fischer groupsG=Fi₂₂, Fi₂₃, Fi₂₄; we apply methods exposed in the first part. Each of these groups is generated by a class of 3-transpositions (named here a Fischer class) in which elements ofX are chosen. A subset of is the set of all the relations (xy) ^m(x,y)=1, wherex andy are inX and wherem(x,y) means the order ofxy inG. We obtainG as a specified quotient of the Coxeter group (X, ) with the appropriate diagram .     

On Dirichlet Processes Associated with Second Order Divergence Form Operators

Let be a d - dimensional Markov family corresponding to a uniformly elliptic second order divergence form operator. We show that for any quasi continuous in the Sobolev space the process (X) admits under P ^x a decomposition into a martingale additive functional (AF) M and a continuous AF A of zero quadratic variation for almost every starting point x if q=2, for quasi every x if q>2 and for every if is continuous, d=1 and or d>1 and q>d. Our decomposition enables us to show that in the case of symmetric operator the energy of A equals zero if q=2 and that the decomposition of (X) into the martingale AF M and the AF of zero energy A is strict if for some q>d. Moreover, our decomposition provides a probabilistic representation of A .