P.I.G-rings and the contractability of primes

LetR=F{x ₁, …, x_k} be a prime affine p.i. ring andS a multiplicative closed set in the center ofR, Z(R). The structure ofG-rings of the formR _s is completely determined. In particular it is proved thatZ(R _s)—the normalization ofZ(R _s) —is a prüfer ring, 1≦k.d(R _s)≦p.i.d(R _s) and the inequalities can be strict. We also obtain a related result concerning the contractability ofq, a prime ideal ofZ(R) fromR. More precisely, letQ be a prime ideal ofR maximal to satisfyQϒZ(R)=q. Then k.dZ(R)/q=k.dR/Q, h(q)=h(Q) andh(q)+k.dZ(R)/q=k.dz(R). The last condition is a necessary butnot sufficient condition for contractability ofq fromR.     

Additive patterns in a multiplicative group in a finite field

 Let F _q be a field with q elements, let d>1 be a divisor of q−1 and U _d be the subgroup of F _q ^× of index d. Under some growth conditions, we show that the distribution of s-tuples of elements of U _d which follow a given additive pattern approaches a Poissonian distribution. Received: 28 August 2002 Published online: 20 March 2003 Mathematics Subject Classification (2000): 11T99     

Optimal linear perfect hash families with small parameters

A linear (q^d, q, t)‐perfect hash family of size s consists of a vector space V of order q^d over a field F of order q and a sequence ?₁,…,?_s of linear functions from V to F with the following property: for all t subsets X ? V, there exists i ∈ {1,·,s} such that ?_i is injective when restricted to F. A linear (q^d, q, t)‐perfect hash family of minimal size d( – 1) is said to be optimal. In this paper, we prove that optimal linear (q², q, 4)‐perfect hash families exist only for q = 11 and for all prime powers q > 13 and we give constructions for these values of q. © 2004 Wiley Periodicals, Inc. J Comb Designs 12: 311–324, 2004     

A local criterion for Tverberg graphs

The topological Tverberg theorem states that for any prime power q and continuous map from a (d+1)(q−1)-simplex to ℝ ^d , there are q disjoint faces F _i of the simplex whose images intersect. It is possible to put conditions on which pairs of vertices of the simplex that are allowed to be in the same face F _i . A graph with the same vertex set as the simplex, and with two vertices adjacent if they should not be in the same F _i , is called a Tverberg graph if the topological Tverberg theorem still work.     

On the singularities of foliations and of vector bundle maps

LetF be a (smooth) Γ _q ^∞ -stucture (often called a codimension-q Haefliger structure) on a compact manifoldX ⁿ . Cohomological invariants associated to the singularities ofF are defined whose vanishing is shown to be a necessary condition for deformingF to a codimension-q foliation onX ⁿ . An analagous approach to vector bundle maps is then utilized to prove a general theorem concerning the possibility of embedding a vector bundle in the tangent bundle ofX ⁿ , and applications to the planefield problem are given. In the final section geometric realizations of the singularity classes associated toF are constructed.     

Ternary codes of steiner triple systems

The code over a finite field F^q of a design ?? is the space spanned by the incidence vectors of the blocks. It is shown here that if ?? is a Steiner triple system on v points, and if the integer d is such that 3^d ≤ v < 3^d+1, then the ternary code C of ?? contains a subcode that can be shortened to the ternary generalized Reed-Muller code ?_F3(2(d ? 1),d) of length 3^d. If v = 3^d and d ≥ 2, then C_? ? ?_F3(1,d)? ? _F3(2(d ? 1),d) ? C. © 1994 John Wiley & Sons, Inc.     

Reduction theory for a rational function field

LetG be a split reductive group over a finite field F_q. LetF = F_q(t) and let A denote the adèles ofF. We show that every double coset inG(F)/G(A)/K has a representative in a maximal split torus ofG. HereK is the set of integral adèlic points ofG. WhenG ranges over general linear groups this is equivalent to the assertion that any algebraic vector bundle over the projective line is isomorphic to a direct sum of line bundles.     

Hadamard matrices generated by an adaptation of generalized quaternion type array

The purpose of this paper is to prove that ifq 1 (mod 4) andq – 2 are both prime powers, then there exists an Hadamard matrix of order 4q. We rely on relative Gauss sums and generalized quaternion type array. Under the same assumption onq, E. Spence has obtained an Hadamard matrix of order 4q by using a relative difference set and the Goethals-Seidel array. We believe that the matrix constructed here is inequivalent to Spence's matrix, in general.Notation q a power of a primep - Z the rational integer ring - F = GF(q) a finite field withq elements - K = GF(q ^s ) an extension ofF of degrees 2 - F ^× multiplicative group ofF - a primitive element ofK - S _F absolute trace fromF - S _K/F relative trace fromK toF - N _K/F relative norm fromK toF - I _m the unit matrix of orderm - J _m the matrix of orderm with every element + 1 - e the column vector of ordern with every element + 1 - A ^* the transpose of a matrixA - J _m (x) 1 +x + x ² + ... +x ^m-1     

Illuminating high-dimensional convex sets

A setL of points in thed-spaceE ^d is said toilluminate a familyF={S ₁, ...,S _n } ofn disjoint compact sets inE ^d if for every setS _i inF and every pointx in the boundary ofS _i there is a pointv inL such thatv illuminatesx, i.e. the line segment joiningv tox intersects the union of the elements ofF in exactly {x}.The problem we treat is the size of a setS needed to illuminate a familyF={S ₁, ...,S _n } ofn disjoint compact sets inE ^d . We also treat the problem of putting these convex sets in mutually disjoint convex polytopes, each one having at most a certain number of facets.     

Quotients of absolute Galois groups which determine the entire Galois cohomology

For a prime power q = p ^d and a field F containing a root of unity of order q we show that the Galois cohomology ring H^*(G_F,\mathbbZ/q){H^*(G_F,\mathbb{Z}/q)} is determined by a quotient G_F^[3]{G_F^{[3]}} of the absolute Galois group G _F related to its descending q-central sequence. Conversely, we show that G_F^[3]{G_F^{[3]}} is determined by the lower cohomology of G _F . This is used to give new examples of pro-p groups which do not occur as absolute Galois groups of fields.     

Spectral invariance for algebras of pseudodifferential operators on besov-triebel-lizorkin spaces

The algebra of pseudodifferential operators with symbols inS _1,δ ⁰ , δ<1, is shown to be a spectrally invariant subalgebra of ℒ(b _p,q ^s ) and ℒ(F _p,q ^s ). The spectrum of each of these pseudodifferential operators acting onB _p,q ^s orF _p,q ^s is independent of the choice ofs, p, andq.     

The decomposition numbers of the hecke algebra of typeF 4

LetW be the finite Coxeter group of typeF ₄, andH _r (q) be the associated Hecke algebra, with parameter a prime powerq, defined over a valuation ringR in a large enough extension field ofQ, with residue class field of characteristicr. In this paper, ther-modular decomposition numbers ofH _R (q) are determined for allq andr such thatr does not divideq. The methods of the proofs involve the study of the generic Hecke algebra of typeF ₄ over the ringA = ℤ[u ^1/2,u ^-1/2] of Laurent polynomials in an indeterminateu ^1/2 and its specializations onto the ring of integers in various cyclotomic number fields. Substancial use of computers and computer program systems (GAP, MAPLE, Meat-Axe) has been made.     

Fast formula of a reliability ofm-consecutive-k-out-of-n:F system with cyclek

Anm-consecutive-k-out-of-n:F system is a system ofn linearly arranged components which fails if and only if at leastm non-overlapping sequences ofk components fail, when there arek distinct components with failure probabilitiesq _i fori=1,...,k and where the failure probability of thej-th component (j=rk+i (1 ≤i ≤k) isq _j =q _i , we call this system by anm-consecutive-k-out-of-n:F system with cycle (or period)k. In this paper we give a formula of the failure probability ofm-consecutive-k-out-of-n:F system with cyclek via the failure probability of consecutive-k-out-of-n:F system.     

ADDITIVE FAMILIES OF INVARIANTS OF FORMS OF DEGREE d

Abstract

Let d be a positive integer, and F be a field of characteristic zero. Suppose that for each positive integer n, I _n, is a GL _n,(F)- invariant of forms of degree d in x₁, …, x _n, over F. We call {I _n} an additive family of invariants if I _p+q (f ⊥ g) = I _p(f).I _q(g) whenever f; g are forms of degree d over F in x _l, …, x _p; …, x _q respectively, and where (f ⊥ g)(x _l, …, x _p+q) = f(x ₁, …, x _p,) + g (x _p+1, …, x _p+q). It is well-known that the family of discriminants of the quadratic forms is additive. We prove that in odd degree d each invariant in an additive family must be a constant. We also give an example in each even degree d of a nontrivial family of invariants of the forms of degree d. The proofs depend on the symbolic method for representing invariants of a form, which we review.     

M-P invertible matrices and unitary groups over Fq2

The Moor-Penrose generalized inverses (M-P inverses for short) of matrices over a finite field F_q ² which is a generalization of the Moor-Penrose generalized inverses over the complex field, are studied in the present paper. Some necessary and sufficient conditions for anm xn matrixA over F_q ² having an M-P inverse are obtained, which make clear the set ofm xn matrices over F_q ² having M-P inverses and reduce the problem of constructing and enumerating the M-P invertible matrices to that of constructing and enumerating the non-isotropic subspaces with respect to the unitary group. Based on this reduction, both the construction problem and the enumeration problem are solved by borrowing the results in geometry of unitary groups over finite fields.     

Piercing Numbers for Balanced and Unbalanced Families

Given a finite family F\mathcal{F} of convex sets in ℝ ^d , we say that F\mathcal{F} has the (p,q) _r property if for any p convex sets in F\mathcal{F} there are at least r q-tuples that have nonempty intersection. The piercing number of F\mathcal{F} is the minimum number of points we need to intersect all the sets in F\mathcal{F}. In this paper we will find some bounds for the piercing number of families of convex sets with (p,q) _r properties.     

Geometric progressions in sumsets over finite fields

Given two sets A, B í \Bbb F_q^d{\cal A}, {\cal B}\subseteq {\Bbb F}_q^d , the set of d dimensional vectors over the finite field \Bbb F_q{\Bbb F}_q with q elements, we show that the sumset A+B = {a+b | a ? A, b ? B}{\cal A}+{\cal B} = \{{\bf a}+{\bf b}\ \vert\ {\bf a} \in {\cal A}, {\bf b} \in {\cal B}\} contains a geometric progression of length k of the form vΛ ^j , where j = 0,…, k − 1, with a nonzero vector v ? \Bbb F_q^d{\bf v} \in {\Bbb F}_q^d and a nonsingular d × d matrix Λ whenever # A # B 3 20 q^2d-2/k\# {\cal A} \# {\cal B} \ge 20 q^{2d-2/k} . We also consider some modifications of this problem including the question of the existence of elements of sumsets on algebraic varieties.     

A Springer Theorem for Hermitian forms

Throughout this paper, we let (D,σ) be a central F -division algebra with involution σ such that F^σ={d ∈ F|σ(d)=d} is a Henselian valued field. By [11], the valuation on F^σ extends uniquely to a valuation on D. We denote this valuation by v. Moreover, we assume that the characteristic of the residue field, , is not 2. If the valuation on F is discrete, then any quadratic form q can be written as q= q₁⊥πq₂, where π is a uniformizer and q_i are unit forms. Springer's Theorem states that q is isotropic if and only if at least one of the residue forms and is isotropic. In this paper we generalize this result to ɛ -Hermitian forms. In Section 4, we use the connection between involutions on algebras and ɛ-Hermitian forms to prove an analog of the Springer Theorem for involutions. This paper was part of the author's doctoral dissertation at New Mexico State University. The author wishes to thank his advisor Pat Morandi for his tireless help.     

On homomorphisms from the Hamming cube to Z

WriteF for the set of homomorphisms from {0, 1} ^d toZ which send0 to 0 (think of members ofF as labellings of {0, 1} ^d in which adjacent strings get labels differing by exactly 1), andF ₁ for those which take on exactlyi values. We give asymptotic formulae for |F| and |F|. In particular, we show that the probability that a uniformly chosen memberf ofF takes more than five values tends to 0 asd→∞. This settles a conjecture of J. Kahn. Previously, Kahn had shown that there is a constantb such thatf a.s. takes at mostb values. This in turn verified a conjecture of I. Benjaminiet al., that for eacht>0,f a.s. takes at mosttd values. Determining |F| is equivalent both to counting the number of rank functions on the Boolean lattice 2^[d] (functionsf: 2^[d]→N satisfyingf( ) andf(A)≤f(A∪x)≤f(A)+1 for allA∈2^[d] andx∈[d]) and to counting the number of proper 3-colourings of the discrete cube (i.e., the number of homomorphisms from {0, 1} ^d toK ₃, the complete graph on 3 vertices). Our proof uses the main lemma from Kahn’s proof of constant range, together with some combinatorial approximation techniques introduced by A. Sapozhenko. Research supported by a Graduate School Fellowship from Rutgers University.     

On the length of the tail of a vector space partition

A vector space partition of a finite dimensional vector space V=V(n,q) of dimension n over a finite field with q elements, is a collection of subspaces U₁,U₂,…,U_t with the property that every non zero vector of V is contained in exactly one of these subspaces. The tail of consists of the subspaces of least dimension d₁ in , and the length n₁ of the tail is the number of subspaces in the tail. Let d₂ denote the second least dimension in .Two cases are considered: the integer q^d₂−d₁ does not divide respective divides n₁. In the first case it is proved that if 2d₁>d₂ then n₁≥q^d₁+1 and if 2d₁≤d₂ then either n₁=(q^d₂−1)/(q^d₁−1) or n₁>2q^d₂−d₁. These lower bounds are shown to be tight and the elements in the subspaces in tails of minimal length will constitute a subspace of V of dimension 2d₁ respectively d₂.In case q^d₂−d₁ divides n₁ it is shown that if d₂<2d₁ then n₁≥q^d₂−q^d₁+q^d₂−d₁ and if 2d₁≤d₂ then n₁≥q^d₂. The last bound is also shown to be tight.The results considerably improve earlier found lower bounds on the length of the tail.