On the number of nowhere zero points in linear mappings

LetA be a nonsingularn byn matrix over the finite fieldGF _q ,k=n/2,q=p ^a ,a1, wherep is prime. LetP(A,q) denote the number of vectorsx in (GF _q ) ⁿ such that bothx andAx have no zero component. We prove that forn2, and ,P(A,q)[(q–1)(q–3)] ^k (q–2) ^n–2k and describe all matricesA for which the equality holds. We also prove that the result conjectured in [1], namely thatP(A,q)1, is true for allqn+23 orqn+14.     

On the Embedding of an Affine Space into a Projective Space

Let k, K be fields, and assume that |k| 4 and n, m 2, or |k| = 3 and n 3, m 2. Then, for any embedding of AG(n, k) into PG(m, K), there exists an isomorphism from k into K and an (n+1) × (m+1) matrix B with entries in K such that can be expressed as (x₁,x₂,...,x_n) = [(1,x₁ ,x₂ ,...,x_n )B], where the right-hand side is the equivalence class of (1,x₁ ,x₂ ,...,x_n )B. Moreover, in this expression, is uniquely determined, and B is uniquely determined up to a multiplication of element of K*. Let l 1, and suppose that there exists an embedding of AG(m+l, k) into PG(m, K) which has the above expression. If we put r = dim _k K, then we have r 3 and m > 2 l-1)/(r-2). Conversely, there exists an embedding of AG(l+m, k) into PG(m, K) with the above expression if K is a cyclic extension of k with dim _k K=r 3, and if m 2l/(r-2) with m even or if m 2l/(r-2) +1 with m odd.     

The Milnor–Totaro Theorem for Space Polygons

If denotes the curvature and the torsion of a closed, generic, and oriented polygonal space curve X in , then we show that _X (² + ²) ds = _X ds + _X | | ds > 4 if is positive. We also show that _X (² + ²) ds 2n if no four consecutive vertices lie in a plane and X has linking number n with a straight line. These extend theorems of Milnor and Totaro.     

Sets with fixed congruence in a steiner system

In this paper we study particular sets of a Steiner systemS. More precisely, we study the setsA such that ¦A ¦ d modh for all lines ofS, withd andh integers satisfyingd 0,h 2.Dedicated to Professor M. Scafati Tallini on the occasion of her sixtyfifth birthday     

Minimal Morse functions on a pair of manifolds

The existence theorem for a minimal Morse function on a pair of manifolds (M ⁿ,N ^k), wheren-k 3,k 6, is proved.Translated from Ukrainskii Matematiccheskii Zhurnal, Vol. 45, No. 1, pp. 143–144, January, 1993.     

A n 4 -polyhedra with free homology

An A _n ^k -polyhedron is a CW-complex which is (n–1)-connected and of dimension (n+k). We compute an algebraic category which is equivalent to the homotopy category of A _n ² -polyhedra with free homology (n3). This computation and a calculation of the -group _n+3(X) (n3) is used to obtain a complete algebraic homotopy invariant for A _n ⁴ -polyhedra with free homology (n3).As an application we compute the group of self-homotopy equivalences Aut(X) for a bouquet X=P².     

Über nullstellenfreie Gebiete von ζ(itk) (s)

Let ^(itk) (s) denote thek-th derivative of the Riemann Zeta-function,s=+it, ,t real numbers,k1 rational integers. Using ideas fromT. C. Titchmarsh and from a paper ofR. Spira, lower bounds are derived for |^(itk)(s)|, |^(itk)(1-s) for >1 and some infinitely many, sufficiently large values oft. Further let be an algebraic number of degreen and heightH; then a lower bound for |^(itk)(its)|, dependent onn, H, k is established for alln,H1,k3, 2+7k/4 and all realt.     

Some best possible bounds concerning the traces of finite sets II

LetX be ann-element set and be a family of its subsets. Consider the family _x = {F – {x} : F } for a givenx X. We write(m, n) (m – k, n – 1), when for all with || m, there exists an elementx ofX such that| _x| m – k. We show that (m, n) (m – 10,n – 1) for allm 5n and (m, n) (m – 13,n – 1) for allm 29n/5.     

A finite characterization ofK-matrices in dimensions less than four

The class of realn × n matricesM, known asK-matrices, for which the linear complementarity problemw – Mz = q, w 0, z 0, w ^T z =0 has a solution wheneverw – Mz =q, w 0, z 0 has a solution is characterized for dimensionsn <4. The characterization is finite and practical. Several necessary conditions, sufficient conditions, and counterexamples pertaining toK-matrices are also given. A finite characterization of completelyK-matrices (K-matrices all of whose principal submatrices are alsoK-matrices) is proved for dimensions <4.Partially supported by NSF Grant MCS-8207217.Research partially supported by NSF Grant No. ECS-8401081.     

Convolution semigroups and central limit theorem associated with a dual convolution structure

We consider hypergroups associated with Jacobi functions ⁽⁾ (x), (–1/2). We prove the existence of a dual convolution structure on [0,+[i(]0,s ₀]{{) =++1,s ₀=min(,–+1). Next we establish a Lévy-Khintchine type formula which permits to characterize the semigroup and the infinitely divisible probabilities associated with this dual convolution, finally we prove a central limit theorem.     

On the chromatic uniqueness of the graphW(n,n − 2, k)

This paper shows that the graphW(n, n – 2, k) is chromatically unique for any even integern 6 and any integerk 1.     

The Higher K-Theory of Real Curves

If X is a smooth curve defined over the real numbers , we show that K _n (X) is the sum of a divisible group and a finite elementary Abelian 2-group when n 2. We determine the torsion subgroup of K _n (X), which is a finite sum of copies of and 2, only depending on the topological invariants of X() and X(), and show that (for n 2) these torsion subgroups are periodic of order 8.     

Approximation of the Distribution of the Supremum of a Centered Random Walk. Application to the Local Score

Let (X _n ) _{n 0} be a real random walk starting at 0, with centered increments bounded by a constant K. The main result of this study is: |P(S _n n x)–P( sup_{0 u 1} B _u x)| C(n,K) n/n, where x 0, ² is the variance of the increments, S _n is the supremum at time n of the random walk, (B _u ,u 0) is a standard linear Brownian motion and C(n,K) is an explicit constant. We also prove that in the previous inequality S _n can be replaced by the local score and sup₀ u 1 B _u by sup₀ u 1|B _u |.     

There Exists a Simple Non Trivial t-design with an Arbitrarily Large Automorphism Group for Every t

In 1987, Teirlinckproved that if t and are two integers such that v t(mod(t + 1)!^(2t+1) and v t + 1 >0, then there exists a t - (v, t + 1, (t + 1)!^(2t+1)) design. We prove that if there exists a (t+1)-(v,k,)design and a t-(v-1,k-2, (k-t-1)/(v-k+1))design with t 2, then there exists a t-(v+1,k, (v-t+1)(v-t)/ (v-k+1)(k-t))design. Using this recursive construction, we prove that forany pair (t,n) of integers (t 2and n 0), there exists a simple non trivial t-(v,k,) design having an automorphism groupisomorphic to ⁿ ₂.     

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 binding number of a graph and its circuits

In this paper we prove the following main results: Theorem A. If bind (G)3/2, thenG–u has a Hamiltonian circuit for every vertexu of graphG _i, unlessG belongs either to two classesH ₁ andH ₂ of graphs or to some smaller order graphs with |V(G)|17. Theorem B. If bind (G)3/2 and the maximum degree (G)>(n–1)/2, |V(G)|=n>17, thenG is pancyclic (i.e., it contains a circuit of every lengthm, 3m|V(G)|).     

A characterization of the generalized twisted field planes of characteristic ≥5

Let be a non-Desarguesian semifield plane of orderp ⁿ, p a prime number 5 andn3, and let denote the group induced by the autotopism groupG of on the line at infinity. We prove that is a generalized twisted field plane if, and only if, has an element of order (p ^k–1)((p ⁿ–1)/(p ^m–1)), for some integersk andm, wherek | m, m | n, andm.This work was supported in part by NSF grants RII-9014056, component IV of the EPSCoR of Puerto Rico grant and ARO grant for Cornell MSI     

Two combinatorial problems on posets

Bialostocki proposed the following problem: Let nk2 be integers such that k|n. Let p(n, k) denote the least positive integer having the property that for every poset P, |P|p(n, k) and every Z _k -coloring f: P Z _k there exists either a chain or an antichain A, |A|=n and _aA f(a) 0 (modk). Estimate p(n, k). We prove that there exists a constant c(k), depends only on k, such that (n+k–2)²–c(k) p(n, k) (n+k–2)²+1. Another problem considered here is a 2-dimensional form of the monotone sequence theorem of Erdös and Szekeres. We prove that there exists a least positive integer f(n) such that every integral square matrix A of order f(n) contains a square submatrix B of order n, with all rows monotone sequences in the same direction and all columns monotone sequences in the same direction (direction means increasing or decreasing).     

Quadrilaterals and pentagons in arrangements of lines

Let p _k denote the number of k-sided faces in an arrangement of n5 lines in the real projective plane. B. Grünbaum has shown that p ₄1/2n(n–3) and has conjectured that equality can occur only for simple arrangements. We prove this conjecture here. We also show that 4p ₄+5p ₅3n holds for every simple arrangement of n4 lines. This latter result is a strengthening of a theorem of T. O. Strommer.     

Rates of convergence for the stability of large order statistics

Forr1 and eachnr, letM _nr be therth largest ofX ₁,X ₂, ...,X _n , where {X _n ,n1} is an i.i.d. sequence. Necessary and sufficient conditions are presented for the convergence of for all >0 and some –1, where {a _n } is a real sequence. Furthermore, it is shown that this series converges for all >–1, allr1 and all >0 if it converges for some >–1, somer1 and all >0.