Defining Integrality at Prime Sets of High Density over Function Fields

 Let F be a function field of characteristic over a finite field . Then for any finite set of F-primes S and any , there exists a set of F-primes W of density greater than such that and has a Diophantine definition over . (Here and is defined analogously.) Received 5 March 2001; in revised form 4 October 2001     

Gauss‐Green theorem for weakly differentiable vector fields,sets of finite perimeter,and balance laws

We analyze a class of weakly differentiable vector fields F : ?ⁿ → ?ⁿ with the property that F ∈ L^∞ and div F is a (signed) Radon measure. These fields are called bounded divergence‐measure fields. The primary focus of our investigation is to introduce a suitable notion of the normal trace of any divergence‐measure field F over the boundary of an arbitrary set of finite perimeter that ensures the validity of the Gauss‐Green theorem. To achieve this, we first establish a fundamental approximation theorem which states that, given a (signed) Radon measure μ that is absolutely continuous with respect to ??^{N ? 1} on ?^N, any set of finite perimeter can be approximated by a family of sets with smooth boundary essentially from the measure‐theoretic interior of the set with respect to the measure ||μ||, the total variation measure. We employ this approximation theorem to derive the normal trace of F on the boundary of any set of finite perimeter E as the limit of the normal traces of F on the boundaries of the approximate sets with smooth boundary so that the Gauss‐Green theorem for F holds on E. With these results, we analyze the Cauchy flux that is bounded by a nonnegative Radon measure over any oriented surface (i.e., an (N ? 1)‐dimensional surface that is a part of the boundary of a set of finite perimeter) and thereby develop a general mathematical formulation of the physical principle of the balance law through the Cauchy flux. Finally, we apply this framework to the derivation of systems of balance laws with measure‐valued source terms from the formulation of the balance law. This framework also allows the recovery of Cauchy entropy flux through the Lax entropy inequality for entropy solutions of hyperbolic conservation laws. © 2008 Wiley Periodicals, Inc.     

The minimal polynomial of a matrix ∗

Let Rbe a finite dimensional central simple algebra over a field F A be any n× n matrix over R. By using the method of matrix representation, this paper obtains the structure formula of the minimal polynomial q_A (λ) of A over F. By using q_A (λ), this paper discusses the structure of right (left) eigenvalues set of A, and obtains the necessary and sufficient condition that a matrix over a finite dimensional central division algebra is similar to a diagonal matrix.     

Conditions on decomposable symmetric tensors as an algebraic variety

Let V be a finite dimensional vector space of dimension at least 2 over an infinite field F. We show that the set of all decomposable elements in the rth symmetric product space over i:V(r≥ 2) is an algebraic set if F is algebraically closed and only if every polynomial of degree at most r splits completcly over F.     

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.     

Writing representations over minimal fields

The chief aim of this paper is to describe a procedure which, given a d-dimensional absolutely irreducible matrix representation of a finite group over a finite field E, produces an equivalent representation such that all matrix entries lie in a subfield F of E which is as small as possible. The algorithm relies on a matrix version of Hilbert's Theorem 90, and is probabilistic with expected running time O(|E:F|d³) when |F| is bounded. Using similar methods we then describe an algorithm which takes as input a prime number and a power-conjugate presentation for a finite soluble group, and as output produces a full set of absolutely irreducible representations of the group over fields whose characteristic is the specified prime, each representation being written over its minimal field.     

Identities of Group Algebras

We consider polynomial identities of group algebras over a field F of characteristic zero. We prove that any PI group algebra satisfies the same identities as a matrix algebra M _n (F ), where n is the maximal degree of finite dimensional representations of the group over algebraic extensions of F.     

Curves with a prescribed number of rational points

We show that for any finite field Fq, any N?0 and all sufficiently large integers g there exist curves over Fq of genus g having exactly N rational points.     

Torsion Elements in Incidence Algebras

Abstract

Let I(X, F) denote the incidence algebra of the locally finite partially ordered set, X, defined over the field, F. This paper considers when the set of torsion elements of I(X, F) forms a group. If F is of finite characteristic, it is shown that the torsion elements of I(X, F) form a group if and only if X is bounded, while if F is of characteristic 0, the torsion elements of the incidence algebra form a group if and only if X is an antichain.     

Geometry of free cyclic submodules over ternions

Given the algebra T of ternions (upper triangular 2×2 matrices) over a commutative field F we consider as set of points of a projective line over T the set of all free cyclic submodules of T ². This set of points can be represented as a set of planes in the projective space over F ⁶. We exhibit this model, its adjacency relation, and its automorphic collineations. Despite the fact that T admits an F-linear antiautomorphism, the plane model of our projective line does not admit any duality.     

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.     

Constants of Derivation and Differential Ideals

ABSTRACT

Let R be a differential domain finitely generated over a differential field F of characteristic 0. Let C be the subfield of differential constants of F. This paper investigates conditions on differential ideals of R that are necessary or sufficient to guarantee that C is also the set of constants of differentiation of the quotient field, E, of R. In particular, when C is algebraically closed and R has a finite number of height one differential prime ideals, there are no new constants in E. An example where F is infinitely generated over C shows the converse is false. If F is finitely generated over C and R is a polynomial ring over F, sufficient conditions on F are given so that no new constants in E does imply only finitely many height one prime differential ideals in R. In particular, F can be Q¯(T) where T is a finite transcendence set.

     

Divisibility of polynomials over finite fields and combinatorial applications

Consider a maximum-length shift-register sequence generated by a primitive polynomial f over a finite field. The set of its subintervals is a linear code whose dual code is formed by all polynomials divisible by f. Since the minimum weight of dual codes is directly related to the strength of the corresponding orthogonal arrays, we can produce orthogonal arrays by studying divisibility of polynomials. Munemasa (Finite Fields Appl 4(3):252–260, 1998) uses trinomials over \mathbbF₂{\mathbb{F}_2} to construct orthogonal arrays of guaranteed strength 2 (and almost strength 3). That result was extended by Dewar et al. (Des Codes Cryptogr 45:1–17, 2007) to construct orthogonal arrays of guaranteed strength 3 by considering divisibility of trinomials by pentanomials over \mathbbF₂{\mathbb{F}_2} . Here we first simplify the requirement in Munemasa’s approach that the characteristic polynomial of the sequence must be primitive: we show that the method applies even to the much broader class of polynomials with no repeated roots. Then we give characterizations of divisibility for binomials and trinomials over \mathbbF₃{\mathbb{F}_3} . Some of our results apply to any finite field \mathbbF_q{\mathbb{F}_q} with q elements.     

On the divisorial spectrum of a Noetherian domain

For a Noetherian domain, the sets of divisorial primes, t-primes, and associated primes of principal ideals coincide. We study the divisorial primes of a Noetherian domain as a partially ordered set. In particular, we show that it is possible to have arbitrarily long chains and any finite amount of noncatenarity.     

Norm Principles for Forms of Higher Degree Permitting Composition

Let F be a field of characteristic 0 or greater than d. Scharlau's norm principle holds for finite field extensions K over F, for certain forms ? of degree d over F which permit composition.     

Diophantine Undecidability of Function Fields of Characteristic Greater than 2, Finitely Generated over Fields Algebraic over a Finite Field

Let F be a function field of characteristic p > 2, finitely generated over a field C algebraic over a finite field C _p and such that it has an extension of degree p. Then Hilbert's Tenth Problem is not decidable over F.     

Zero divisors in quaternion algebras

Let F be a finite field or an algebraic number field. In previous papers we have shown how to find the basic building blocks (the radical and the simple components) of a finite dimensional algebra over F in polynomial time (deterministically in characteristic zero and Las Vegas in the finite case). A finite-dimensional simple algebra A is a full matrix algebra over some not necessarily commutative extension field G of F. The problem remains to find G and an isomorphism between A and a matrix algebra over G. This, too, can be done in polynomial time for finite F. We indicate in the present paper that the problem for F = Q might be substantially more difficult. We link the problem to hard number theoretic problems such as quadratic residuosity modulo a composite number. We show that assuming the generalized Riemann hypothesis, there exists a randomized polynomial time reduction from quadratic residuosity to determining whether or not a given 4-dimensional algebra over Q has zero divisors. It will follow that finding a pair of zero divisors is at least as hard as factoring squarefree integers.     

Vector spaces as unions of proper subspaces

In this note, we find a sharp bound for the minimal number (or in general, indexing set) of subspaces of a fixed (finite) codimension needed to cover any vector space V over any field. If V is a finite set, this is related to the problem of partitioning V into subspaces.     

Going up of the <Emphasis Type="Italic">u</Emphasis>-invariant over formally real fields

Let F be a field of characteristic not 2, and assume that F has finite reduced stability. Let K/F be any finite extension. We prove that if the general u-invariant u(F) is finite, then u(K) is finite. This article is based on part of the author’s Ph.D. thesis, written under the supervision of Richard Elman.