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.     

Trace Identities for Matrices with the Transpose Involution

Independently, Razmyslov and Procesi have shown that for a field F of characteristic 0 all trace PIs (and thus all PIs) for M _n (F) lie in the T-ideal generated by the characteristic polynomial. Procesi then proved that for (M _n , t), an algebra with (transpose) involution, all *-trace PIs lie in the *-T-ideal generated by a set of n + 1 *-trace PIs. This result proved the existence of the n + 1 *-trace PIs, but no explicit formulas. In this paper we further investigate these n + 1 *-trace PIs by first constructing a closely related set of so-called “pure-trace” *-PIs and then giving examples and applications to illuminate our results.     

Class groups and Brauer groups

LetF be a global field,n a positive integer not divisible by the characteristic ofF. Then there exists a finite extensionE ofF whose class group has a cyclic direct summand of ordern. This theorem, in a slightly stronger form, is applied to determine completely, on the basis of the work of Fein and Schacher, the structure of the Brauer group Br(F()) of the rational function fieldF(t). As a consequence of this, an additional theorem of the above authors, together with a note at the end of the paper, imply that Br(F(t)) ≊ Br(F(t ₁, ···,t _n)), wheret ₁, ···,t _n are algebraically independent overF.     

Negacyclic self-dual codes over finite chain rings

In this article, we study negacyclic self-dual codes of length n over a finite chain ring R when the characteristic p of the residue field [`(R)]{\bar{R}} and the length n are relatively prime. We give necessary and sufficient conditions for the existence of (nontrivial) negacyclic self-dual codes over a finite chain ring. As an application, we construct negacyclic MDR self-dual codes over GR(p ^t , m) of length p ^m  + 1.     

Deciding finiteness for matrix groups over function fields

LetF be a field andt an indeterminate. In this paper we consider aspects of the problem of deciding if a finitely generated subgroup of GL(n,F(t)) is finite. WhenF is a number field, the analysis may be easily reduced to deciding finiteness for subgroups of GL(n,F), for which the results of [1] can be applied. WhenF is a finite field, the situation is more subtle. In this case our main results are a structure theorem generalizing a theorem of Weil and upper bounds on the size of a finite subgroup generated by a fixed number of generators with examples of constructions almost achieving the bounds. We use these results to then give exponential deterministic algorithms for deciding finiteness as well as some preliminary results towards more efficient randomized algorithms. Supported in part by NSF DMS Awards 9404275 and Presidential Faculty Fellowship.     

Elliptic periods for finite fields

We construct two new families of basis for finite field extensions. Bases in the first family, the so-called elliptic bases, are not quite normal bases, but they allow very fast Frobenius exponentiation while preserving sparse multiplication formulas. Bases in the second family, the so-called normal elliptic bases are normal bases and allow fast (quasi-linear) arithmetic. We prove that all extensions admit models of this kind.     

Abelian Groups,Gauss Periods,and Normal Bases

A result on finite abelian groups is first proved and then used to solve problems in finite fields. Particularly, all finite fields that have normal bases generated by general Gauss periods are characterized and it is shown how to find normal bases of low complexity.     

ON MULTIOSCULATING SPACES

The aim of this paper is to study varieties with second Gauss map not birational. In particular we classify such varieties in dimension two. We prove that there are two types of surfaces S of P ⁿ (C), with n > 5, not satisfying Laplace equations, with second Gauss map t ² not birational: i. surfaces such that the image of the second Gauss map is one-dimensional and containing a one-dimensional family of curves. Each curve of the family is contained in some P ³ ? P ⁿ .

ii. surfaces such that the second Gauss map is generically finite of degree at least two. In this case the image of the second Gauss map is two-dimensional, locally embedded in a Laplace congruence and meeting the general generatrix in more than one point.

     

The Linear Coordinate Preserving Problem

We prove that every K-endomorphism of a rank 2 polynomial algebra over an algebraically closed field K of positive characteristic taking all linear coordinates to coordinates is an automorphism. We give a new characterization of coordinates of K[t][x, y], where K is an algebraically closed field of any characteristic. We also explore the close connection between coordinates and permutation polynomials of finite fields.     

A general method for construction of (<Emphasis Type="Italic">t</Emphasis>, <Emphasis Type="Italic">n</Emphasis>)-threshold visual secret sharing schemes for color images

This paper is concerned with the construction of basis matrices of visual secret sharing schemes for color images under the (t, n)-threshold access structure, where n ≥ t ≥ 2 are arbitrary integers. We treat colors as elements of a bounded semilattice and regard stacking two colors as the join of the two corresponding elements. We generate n shares from a secret image with K colors by using K matrices called basis matrices. The basis matrices considered in this paper belong to a class of matrices each element of which is represented by a homogeneous polynomial of degree n. We first clarify a condition such that the K matrices corresponding to K homogeneous polynomials become basis matrices. Next, we give an algebraic scheme for the construction of basis matrices. It is shown that under the (t, n)-threshold access structure we can obtain K basis matrices from appropriately chosen K − 1 homogeneous polynomials of degree n by using simple algebraic operations. In particular, we give basis matrices that are unknown so far for the cases of t = 2, 3 and n − 1.     

Discreteness and rationality of F-jumping numbers on singular varieties

We prove that the F-jumping numbers of the test ideal t(X; D, \mathfraka^t){\tau(X; \Delta, \mathfrak{a}^t)} are discrete and rational under the assumptions that X is a normal and F-finite scheme over a field of positive characteristic p, K _X  + Δ is \mathbb Q{\mathbb {Q}}-Cartier of index not divisible p, and either X is essentially of finite type over a field or the sheaf of ideals \mathfraka{\mathfrak{a}} is locally principal. This is the largest generality for which discreteness and rationality are known for the jumping numbers of multiplier ideals in characteristic zero.     

Immersions of Finite Geometric Type in Euclidean Spaces

In this paper, we introduce the class of hypersurfaces of finitegeometric type. They are defined as the ones that share the basicdifferential topological properties of minimal surfaces of finite totalcurvature. We extend to surfaces in this class the classical theorem ofOsserman on the number of omitted points of the Gauss mapping ofcomplete minimal surfaces of finite total curvature. We give aclassification of the even-dimensional catenoids as the only even-dimensional minimal hypersurfaces of R ⁿ of finite geometric type.     

A method for constructing a self-dual normal basis in odd characteristic extension fields

This paper proposes a useful method for constructing a self-dual normal basis in an arbitrary extension field F_p^m such that 4p does not divide m(p−1) and m is odd. In detail, when the characteristic p and extension degree m satisfies the following conditions (1) and either (2a) or (2b); (1) 2km+1 is a prime number, (2a) the order of p in F_2km+1 is 2km, (2b) 2km and the order of p in F_2km+1 is km, we can consider a class of Gauss period normal bases. Using this Gauss period normal basis, this paper shows a method to construct a self-dual normal basis in the extension field F_p^m.     

Unitary designs and codes

A unitary design is a collection of unitary matrices that approximate the entire unitary group, much like a spherical design approximates the entire unit sphere. In this paper, we use irreducible representations of the unitary group to find a general lower bound on the size of a unitary t-design in U(d), for any d and t. We also introduce the notion of a unitary code—a subset of U(d) in which the trace inner product of any pair of matrices is restricted to only a small number of distinct absolute values—and give an upper bound for the size of a code with s inner product values in U(d), for any d and s. These bounds can be strengthened when the particular inner product values that occur in the code or design are known. Finally, we describe some constructions of designs: we give an upper bound on the size of the smallest weighted unitary t-design in U(d), and we catalogue some t-designs that arise from finite groups.      

q-Inverting pairs of shape 1, 2, 1

Let V denote a vector space with finite positive dimension over an algebraically closed field 𝔽. Let K, K* be a q-inverting pair on V, an ordered pair of invertible linear transformations on V satisfying certain conditions. In this article we study the q-inverting pairs with shape 1, 2, 1. We define a pair of scalars called the parameter pair for K, K*. We give six bases for V and give the action of K, K ^?1, K* and (K*)^?1 on each of these bases, respectively. We classify the q-inverting pairs of shape 1, 2, 1 in terms of the parameter pairs. We conclude with some trace formulae involving the parameter pair.     

A logarithmic Gauss curvature flow and the Minkowski problem

Let X₀ be a smooth uniformly convex hypersurface and f a postive smooth function in Sⁿ. We study the motion of convex hypersurfaces X(·,t) with initial X(·,0)=θX₀ along its inner normal at a rate equal to log(K/f) where K is the Gauss curvature of X(·,t). We show that the hypersurfaces remain smooth and uniformly convex, and there exists θ^*>0 such that if θ<θ^*, they shrink to a point in finite time and, if θ>θ^*, they expand to an asymptotic sphere. Finally, when θ=θ^*, they converge to a convex hypersurface of which Gauss curvature is given explicitly by a function depending on f(x).     

Basic Properties of the (t, n)-Threshold Visual Secret Sharing Scheme with Perfect Reconstruction of Black Pixels

In this paper we consider the (t, n)-threshold visual secret sharing scheme (VSSS) in which black pixels in a secret black-white images is reproduced perfectly as black pixels when we stack arbitrary t shares. This paper provides a new characterization of the (t, n)-threshold visual secret sharing scheme with such a property (hereafter, we call such a VSSS the (t, n)-PBVSSS for short). We use an algebraic method to characterize basis matrices of the (t, n)-PBVSSS in a certain class of matrices. We show that the set of all homogeneous polynomials each element of which yields basis matrices of the (t, n)-PBVSSS becomes a set of lattice points in an (n−t+1)-dimensional linear space. In addition, we prove that the optimal basis matrices in the sense of maximizing the relative difference among all the basis matrices in the class coincides with the basis matrices given by Blundo, Bonis and De Santis [3] for all n≥ t ≥ 2.     

Galois Stability, Integrality and Realization Fields for Representations of Finite Abelian Groups

For a given field F of characteristic 0 we consider a normal extension E/F of finite degree d and finite Abelian subgroups GGL _n (E) of a given exponent t. We assume that G is stable under the natural action of the Galois group of E/F and consider the fields E=F(G) that are obtained via adjoining all matrix coefficients of all matrices gG to F. It is proved that under some reasonable restrictions for n, any E can be realized as F(G), while if all coefficients of matrices in G are algebraic integers, there are only finitely many fields E=F(G) for prescribed integers n and t or prescribed n and d.     

On some questions related to the Gauss conjecture for function fields

We show that, for any finite field Fq, there exist infinitely many real quadratic function fields over Fq such that the numerator of their zeta function is a separable polynomial. As pointed out by Anglès, this is a necessary condition for the existence, for any finite field Fq, of infinitely many real function fields over Fq with ideal class number one (the so-called Gauss conjecture for function fields). We also show conditionally the existence of infinitely many real quadratic function fields over Fq such that the numerator of their zeta function is an irreducible polynomial.     

The rationality of the Hilbert-Kunz multiplicity in graded dimension two

We show that the Hilbert-Kunz multiplicity is a rational number for an R₊−primary homogeneous ideal I=(f₁, . . . , f_n) in a two-dimensional graded domain R of finite type over an algebraically closed field of positive characteristic. More specific, we give a formula for the Hilbert-Kunz multiplicity in terms of certain rational numbers coming from the strong Harder-Narasimhan filtration of the syzygy bundle Syz(f₁, . . . , f_n) on the projective curve Y=ProjR.