On the singular graph and the Weyr characteristic of anM-matrix

LetA be anM-matrix in standard lower block triangular form, with diagonal blocksA _ii irreducible. LetS be the set of indices such that the diagonal blockA is singular. We define the singular graph ofA to be the setS with partial order defined by > if there exists a chain of non-zero blocksA _i, A_ij, , A_l.Let ₁ be the set of maximal elements ofS, and define thep-th level _p ,p = 2, 3, , inductively as the set of maximal elements ofS \( _{1 p-1}). Denote by _p the number of elements in _p . The Weyr characteristic (associated with 0) ofA is defined to be (A) = ( ₁, ₂,, _h ), where ₁ + + _p = dim KerA ^p ,p = 1, 2, , and _h > 0, _h+1 = 0.Using a special type of basis, called anS-basis, for the generalized eigenspaceE(A) of 0 ofA, we associate a matrixD withA. We show that(A) = ( ₁, , _h) if and only if certain submatricesD _p,p+1 ,p = 1, , h – 1, ofD have full column rank. This condition is also necessary and sufficient forE(A) to have a basis consisting of non-negative vectors, which is a Jordan basis for –A. We also consider a given finite partially ordered setS, and we find a necessary and sufficient condition that allM-matricesA with singular graphS have(A) = ( ₁, , _h). This condition is satisfied ifS is a rooted forest.The work of the second-named author was partly supported by the National Science Foundation, under grant MPS-08618 A02.     

Verschärfung einer Ungleichung von Ky Fan

Summary In this paper we prove the following:IfA _n ,G _n andH _n (resp.A _n ,G _n andH _n ) denote the arithmetic, geometric and harmonic means ofa ₁,, a _n (resp. 1 –a ₁,, 1 –a _n ) and ifa _i (0, 1/2],i = 1,,n, then(G _n /G _n ) ⁿ (A _n /A _n ) ^n-1 H _n /H _n , (^*) with equality holding forn = 1,2. Forn 3 equality holds if and only ifa ₁ = =a _n . The inequality (^*) sharpens the well-known inequality of Ky Fan:G _n /G _n A _n /A _n .

     

Knaster's problem on continuous maps of a sphere into Euclidean space

A survey of known results and additional new ones on Knaster's problem: on the standard sphere S^n–1Rⁿ find configurations of points A₁, , A_k, such that for any continuous map fS^n–1R^m one can find a rotation a of the sphere S^n–1 such that f(a(A₁)==f(a(A_k)) and some problems closely connected with it. We study the connection of Knaster's problem with equivariant mappings, with Dvoretsky's theorem on the existence of an almost spherical section of a multidimensional convex body, and we also study the set {a S0(n)f(a(A₁))==f(a(A_k))} of solutions of Knaster's problem for a fixed configuration of points A₁, , A_kS^n–1 and a map fS^n–1R^m in general position. Unsolved problems are posed.Translated from Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta im. V. A. Steklova AN SSSR, Vol. 167, pp. 169–178, 1987.     

On products of additive functions (a third approach)

Summary Leta ₁, , a_s : G K be additive functions from an abelian groupG into a fieldK such thata ₁(g)··a_s(g) = 0 for allg G. If char(K) =0, then it is well known that one of the functions a₁ has to vanish. We give a new proof of this result and show that, if char(K) > 0, it is only valid under additional assumptions.     

Two-sided polynomial approximation of functions

Conditions are established when the collocation polynomials P_m(x) and P_M(x), m M, constructed respectively using the system of nodes x_j of multiplicities a_j 1, j = O,, n, and the system of nodes x_-r,,x_o,,x_n,,x_n+r1, r O, r₁ O, of multiplicities a_-r,,(a_o + y_o),,(a_n + y_n),,a_n+r1, a_j + y_j 1, are two sided-approximations of the function f on the intervals , x_j[, j = O,...,n + 1, and on unions of any number of these intervals. In this case, the polynomials P_m (x), P_M ^(l) (x) with l a_j are two-sided approximations of the function f⁽¹⁾ in the neighborhood of the node x_j and the integrals of the polynomials P_m(x), P_M(x) over D_j are two-sided approximations of the integral of the function f (over D_j). If the multiplicities a_j a_j + y_j of the nodes x_j are even, then this is also true for integrals over the set _j= _µ ^k D_j µ 1, k n. It is shown that noncollocation polynomials (Fourier polynomials, etc.) do not have these properties.Kiev University. Translated from Vychislitel'naya i Prikladnaya Matematika, No. 67, pp. 31–37, 1989.     

The Braided product of Ockham algebras

In this paper we introduce an algebraic concept of the product of Ockham algebras called the Braided product. We show that ifL _i MS(i=1, 2, ,n) then the Braided product ofL _i(i=1, 2, ,n) exists if and only ifL ₁, ,L _n have isomorphic skeletons.     

A structure theorem for sum form functional equations

Summary It is proved that, iff _ij:]0, 1[ C (i = 1, ,k;j = 1, ,l) are measurable, satisfy the equation (1) (with some functionsg _it, h_jt:]0, 1[ C), then eachf _ij is in a linear space (called Euler space) spanned by the functionsx x ^j(logx) ^k (x ]0, 1[;j = 1, ,M;k = 0, ,m _j – 1), where ₁, , _M are distinct complex numbers andm ₁, , m_M natural numbers. The dimension of this linear space is bounded by a linear function ofN.     

Regular (2, 2)-systems

Let (E,I) be an independence system over the finite setE = {e ₁, ,e _n }, whose elements are orderede ₁ e _n . (E,I) is called regular, if the independence of {e _l , ,e _{l k} },l ₁ < <l _k , implies that of {e _{m l} , ,e _{m k} }, wherem _l < ··· <m _k andl ₁ m ₁, ,l _k m _k . (E,I) is called a 2-system, if for anyI I,e E I the setI {e } contains at most 2 distinct circuitsC, C I and the number 2 is minimal with respect to this property. If, in addition, for any two independent setsI andJ the family (C J, C C (J, I)), whereC(J, I) denotes {C C:e J I C {e}}, can be partitioned into 2 subfamilies each of which possesses a transversal, then (E,I) is called a (2, 2)-system. In this paper we characterize regular 2-systems and we show that the classes of regular 2-systems resp. regular (2, 2)-systems are identical.     

Robustness of positional scoring over subsets of alternatives

Positional score vectorsw=(w ₁,,w _m ) for anm-element setA, andv=(v ₁,,v _k ) for ak-element proper subsetB ofA, agree at a profiles of linear orders onA when the restriction toB of the ranking overA produced byw operating ons equals the ranking overB produced byv operating on the restriction ofs toB. Givenw ₁>w _mandv ₁>v _k , this paper examines the extent to which pairs of nonincreasing score vectors agree over sets of profiles. It focuses on agreement ratios as the number of terms in the profiles becomes infinite. The limiting agreement ratios that are considered for (m, k) in {(3,2),(4,2),(4,3)} are uniquely maximized by pairs of Borda (linear, equally-spaced) score vectors and are minimized when (w,v) is either ((1,0,,0),(1,,1,0)) or ((1,,,1,0),(1,0,,0)).This research was supported by the National Science Foundation, Grants SOC 75-00941 and SOC 77-22941.     

The complete figure for second order multiple integral problems in the calculus of variations

Notation Throughout this paper Greek indices, , , and Latin indicesi, j, h, k, assume the values 1, ,m, and 1, ,n respectively. The summation convention is operative in respect of both sets of indices.This work was supported by the South African Council for Scientific and Industrial Research.At time of writing Professor Grässer was Visiting Scholar at the University of Arizona, Tucson, Arizona.     

A distance constrainedp-facility location problem on the real line

LetV = {v ₁,, v _n } be a set ofn points on the real line (existing facilities). The problem considered is to locatep new point facilities,F ₁,, F _p , inV while satisfying distance constraints between pairs of existing and new facilities and between pairs of new facilities. Fori = 1, , p, j = 1, , n, the cost of locatingF _i at pointv _j isc _ij . The objective is to minimize the total cost of setting up the new facilities. We present anO(p ³ n ² logn) algorithm to solve the model.     

On a characterization of polynomials by divided differences

Summary We consider the functional equationf[x ₁,x ₂,, x _n ] =h(x ₁ + +x _n ) (x ₁,,x _n K, x _j x _k forj k), (D) wheref[x ₁,x ₂,,x _n ] denotes the (n – 1)-st divided difference off and prove Theorem. Let n be an integer, n 2, let K be a field, char(K) 2, with # K 8(n – 2) + 2. Let, furthermore, f, h: K K be functions. Then we have that f, h fulfil (D) if, and only if, there are constants a_j K, 0 j n (a := a_n, b := a_{n – 1}) such thatf = ax ⁿ +bx ^{n – 1} + +a ₀ and h = ax + b.     

On the convexity of the sum of the first eigenvalues of operators depending on a real parameter

Let ₁ (k) ₂ (k) be the eigenvalues of an operator of a certain type depending on a real parameterk. The paper shows that under certain requirements on the operator and on the nature of its dependence onk, the sum ₁ (k)++ _N (k) is a concave function ofk, for any positive integerN.

---

Zusammenfassung Seien ₁ (k) ₂ (k) die Eigenwerte eines von einem reellen Parameterk abhängigen Operators. Man zeigt, daß unter gewissen Voraussetzungen über den Operator und seine Abhängigkeit vonk die Summe ₁ (k)++ _N (k) für jedesN eine konkave Funktion vonk ist.

     

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}.     

Nonabelian K-theory: The nilpotent class of K1 and general stability

A functorial filtration GL _n =S^–1L _n S⁰L _n S ⁱ L _n E _n of the general linear group GL _{n, n} 3, is defined and it is shown for any algebra A, which is a direct limit of module finite algebras, that S^–1 L _n (A)/S⁰L _n (A) is abelian, that S⁰L _n (A) S¹L _n (A) is a descending central series, and that S ⁱ L _n (A) = E _n(A) whenever i the Bass-Serre dimension of A. In particular, the K-functors k ₁ S ⁱ L _n =S ⁱ L _n /E _n are nilpotent for all i 0 over algebras of finite Bass-Serre dimension. Furthermore, without dimension assumptions, the canonical homomorphism S ⁱ L _n (A)/S ⁱ⁺¹ L _n (A)S ⁱ L _{n+ 1}(A)/S ⁱ⁺¹ L _{n + 1} (A) is injective whenever n i + 3, so that one has stability results without stability conditions, and if A is commutative then S⁰L _n (A) agrees with the special linear group SL _n (A), so that the functor S⁰L _n generalizes the functor SL _n to noncommutative rings. Applying the above to subgroups H of GL _n (A), which are normalized by E _n(A), one obtains that each is contained in a sandwich GL _n (A, ) H E _n(A, ) for a unique two-sided ideal of A and there is a descending S⁰L _n (A)-central series GL _n (A, ) S⁰L _n (A, ) S¹L _n (A, ) S ⁱ L _n (A, ) E _n(A, ) such that S ⁱ L _n (A, )=E _n(A, ) whenever i Bass-Serre dimension of A.Dedicated to Alexander Grothendieck on his sixtieth birthday     

Penalty function versus non-penalty function methods for constrained nonlinear programming problems

The relative merits of using sequential unconstrained methods for solving: minimizef(x) subject tog _i (x) 0, i = 1, , m, h _j (x) = 0, j = 1, , p versus methods which handle the constraints directly are explored. Nonlinearly constrained problems are emphasized. Both classes of methods are analyzed as to parameter selection requirements, convergence to first and second-order Kuhn-Tucker Points, rate of convergence, matrix conditioning problems and computations required.This paper was presented at the 7th Mathematical Programming Symposium 1970, The Hague, The Netherlands.     

On the Ranked Excursion Heights of a Kiefer Process

Let (K(s,t), 0s1, t1) be a Kiefer process, i.e., a continuous two-parameter centered Gaussian process indexed by [0,1]×₊ whose covariance function is given by (K(s₁,t₁) K(s₂,t₂))=(s₁s₂-s₁s₂)t₁t₂, 0s₁, s₂1, t₁, t₂ 0. For each t>0, the process K(·,t) is a Brownian bridge on the scale of . Let M ₁ ^* (t) M ₂ ^* (t) M _j ^* (t) 0 be the ranked excursion heights of K(,t). In this paper, we study the path properties of the process tM _j ^* (t). Two laws of the iterated logarithm are established to describe the asymptotic behaviors of M _j ^* (t) as t goes to infinity.     

Monomial gorenstein curves in A4 as set-theoretic complete intersections

It is shown that if the prime ideal ,, x₄], k an arbitrary field, has generic zero x_i=tⁿ _i, n_i positive integers with g.c.d. equal l, l i 4, then P(S) is a set-theoretic complete intersection if the numerical semigroup S=1,, n₄> is symmetric (i.e. if the extension of P(S) in k[[x₁,, x₄]] is a Gorenstein ideal).     

A “from scratch” proof of a theorem of Rockafellar and Fulkerson

The theorem of this paper is of the same general class as Farkas' Lemma, Stiemke's Theorem, and the Kuhn—Fourier Theorem in the theory of linear inequalities. LetV be a vector subspace ofR ⁿ , and let intervalsI ¹,, I ⁿ of real numbers be prescribed. A necessary and sufficient condition is given for existence of a vector (x ¹ ,, x ⁿ ) inV such thatx ⁱ I ⁱ (i = 1, ,n); this condition involves the elementary vectors (nonzero vectors with minimal support) ofV . The proof of the theorem uses only elementary linear algebra.The author at present holds a Senior Scientist Award of the Alexander von Humboldt Stiftung.     

A basis for the type 〈n〉 hyperidentities of the medial variety of semigroups

Summary The medical varietyMV of semigroups is the variety defined by the medial identityxyzw = xzyw. This variety is known to satisfy the medial hyperidentitiesF(G(x ₁₁ ,, x _1n ),, G(x _n1 ,, x _nn )) = G(F(x ₁₁ ,, x _n1 ),, F(x _1n ,, x _nn )), forn 1. Taylor has observed in [2] thatMV also satisfies some other hyperidentities, which are not consequences of the medial ones. In [4] the author introduced a countably infinite family of binary hyperidentities called transposition hyperidentities, which are natural generalizations of then = 2 medial hyperidentity. It was shown that this family is irredundant, and that no finite basis is possible for theMV hyperidentities with one binary operation symbol.In this paper, we generalize the concept of a transposition hyperidentity, and extend it to cover arbitrary arityn 2. We show that theMV hyperidentities with onen-ary operation symbol have no finite basis, but do have a countably infinite basis consisting of these transposition hyperidentities.Research supported by NSERC of Canada.