E -Theoretic Duality for Higher Rank Graph Algebras

We prove that there is a Poincaré type duality in E-theory between higher rank graph algebras associated with a higher rank graph and its opposite correspondent. We obtain an r-duality, that is the fundamental classes are in E^r. The basic tools are a higher rank Fock space and higher rank Toeplitz algebra which has a more interesting ideal structure than in the rank 1 case. The K-homology fundamental class is given by an r-fold exact sequence whereas the K-theory fundamental class is given by a homomorphism. The E-theoretic products are essentially pull-backs so that the computation is done at the level of exact sequences. Mathematics Subject Classification (2000): 46L80.     

Mixed-Type Duality on Nonsmooth Minimax Fractional Programming Involving Exponential (p,r)-Invexity

Considering a nonsmooth minimax fractional programming problem involving exponential (p, r)-invexity, we construct a mixed-type dual problem, which is performed by an incomplete Lagrangian dual model. This mixed-type dual model involves the Wolfe type dual and Mond-Weir type dual as the special cases under exponential (p, r)-invexity. We establish the mixed-type duality problem with conditions for exponential (p, r)-invexity and prove that the optimal values of the primary problem and the mixed-type duality problem have no duality gap under the framwork of exponential (p, r)-invexity.     

Multidimensional constant linear systems

A continuous resp. discrete r-dimensional (r1) system is the solution space of a system of linear partial differential resp. difference equations with constant coefficients for a vector of functions or distributions in r variables resp. of r-fold indexed sequences. Although such linear systems, both multidimensional and multivariable, have been used and studied in analysis and algebra for a long time, for instance by Ehrenpreis et al. thirty years ago, these systems have only recently been recognized as objects of special significance for system theory and for technical applications. Their introduction in this context in the discrete one-dimensional (r=1) case is due to J. C. Willems. The main duality theorem of this paper establishes a categorical duality between these multidimensional systems and finitely generated modules over the polynomial algebra in r indeterminates by making use of deep results in the areas of partial differential equations, several complex variables and algebra. This duality theorem makes many notions and theorems from algebra available for system theoretic considerations. This strategy is pursued here in several directions and is similar to the use of polynomial algebra in the standard one-dimensional theory, but mathematically more difficult. The following subjects are treated: input-output structures of systems and their transfer matrix, signal flow spaces and graphs of systems and block diagrams, transfer equivalence and (minimal) realizations, controllability and observability, rank singularities and their connection with the integral respresentation theorem, invertible systems, the constructive solution of the Cauchy problem and convolutional transfer operators for discrete systems. Several constructions on the basis of the Gröbner basis algorithms are executed. The connections with other approaches to multidimensional systems are established as far as possible (to the author).Partially supported by US Air Force Grant AFOSR-87-0249 and by Office of Naval Research Grant N 00014-86-K-0538 through the Center for Mathematical System Theory, University of Florida, Gainesville, Florida, U.S.A.     

Double circulant matrices

Double circulant matrices are introduced and studied. By a matrix-theoretic method, the rank r of a double circulant matrix is computed, and it is shown that any consecutive r rows of the double circulant matrix are linearly independent. As a generalization, multiple circulant matrices are also introduced. Two questions on square double circulant matrices are posed.     

Approximate multiplication of tensor matrices based on the individual filtering of factors

Algorithms are proposed for the approximate calculation of the matrix product $ \tilde C $ \tilde C ≈ C = A · B, where the matrices A and B are given by their tensor decompositions in either canonical or Tucker format of rank r. The matrix C is not calculated as a full array; instead, it is first represented by a similar decomposition with a redundant rank and is then reapproximated (compressed) within the prescribed accuracy to reduce the rank. The available reapproximation algorithms as applied to the above problem require that an array containing r ^2d elements be stored, where d is the dimension of the corresponding space. Due to the memory and speed limitations, these algorithms are inapplicable even for the typical values d = 3 and r ∼ 30. In this paper, methods are proposed that approximate the mode factors of C using individually chosen accuracy criteria. As an application, the three-dimensional Coulomb potential is calculated. It is shown that the proposed methods are efficient if r can be as large as several hundreds and the reapproximation (compression) of C has low complexity compared to the preliminary calculation of the factors in the tensor decomposition of C with a redundant rank.     

Schur–Weyl duality over finite fields

We prove a version of the Schur–Weyl duality over finite fields. We prove that for any field k, if k has at least r + 1 elements, the Schur–Weyl duality holds for the rth tensor power of a finite dimensional vector space V. Moreover, if the dimension of V is at least r + 1, the natural map ${{k\mathfrak{S}_r \to \mathsf{End}_{{\rm GL}(V)}(V^{\otimes r})}}We prove a version of the Schur–Weyl duality over finite fields. We prove that for any field k, if k has at least r + 1 elements, the Schur–Weyl duality holds for the rth tensor power of a finite dimensional vector space V. Moreover, if the dimension of V is at least r + 1, the natural map k\mathfrakS_r ? End_GL(V)(V^?r){{k\mathfrak{S}_r \to \mathsf{End}_{{\rm GL}(V)}(V^{\otimes r})}} is an isomorphism. This isomorphism may fail if dim _k V is not strictly larger than r.     

On webs of maximum rank

This paper contains two results on webs of maximal rank. First, we show that at each point, the web normals for a codimension-r web of maximum r-rank are (r−1)-dimensional generators of a rational normal scroll in the projectivized tangent space to the web domain, an extension of a theorem of Chern and Griffiths in the case r=2 [5]. We use this statement to deduce that webs of maximum rank are almost-Grassmannizable in the sense of Akivis [1]. Second, we show that there are exceptional (that is, maximum rank, but not algebraizable) webs W(2n, n, 2) for all n≥2. The construction relies on the properties of zero-cycles on algebraic K3 surfaces.     

On some ranks of infinite groups

Abstract A group G has finite Hirsch-Zaicev rank r_hz(G) = r if G has an ascending series whose factors are either infinite cyclic or periodic and if the number of infinite cyclic factors is exactly r. The authors discuss groups with finite Hirsch-Zaicev rank and the connection between this and groups having finite section p-rank for some prime p, or p=0. Groups all of whose abelian subgroups are of bounded rank are also discussed. Keywords: p-rank, locally generalized radical group, Hirsch-Zaicev rank, torsion-free rank, rank Mathematics Subject Classification (2000): 20F19, 20E25, 20E15     

On Random Representable Matroids

Results are obtained on the likely connectivity properties and sizes of circuits in the column dependence matroid of a random r × n matrix over a finite field, for large r and n. In a sense made precise in the paper, it is shown to be highly probable that when n is less than r such a matroid is the free matroid on n points, while if n exceeds r it is a connected matroid of rank r. Moreover, the connectivity can be strengthened under additional hypotheses on the growth of n and r, using the notion of vertical connectivity; and the values of k for which circuits of size k exist can be determined in terms of n and r.     

Nonexistence of Proper Holomorphic Maps Between Certain Classical Bounded Symmetric Domains

The author,motivated by his results on Hermitian metric rigidity,conjectured in [4] that a proper holomorphic mapping f：Ω→Ω′from an irreducible bounded symmetric domainΩof rank≥2 into a bounded symmetric domainΩ′is necessarily totally geodesic provided that r′：=rank（Ω′）≤rank（Ω）：=r.The Conjecture was resolved in the affirmative by I.-H.Tsai [8].When the hypothesis r′≤r is removed,the structure of proper holomorphic maps f：Ω→Ω′is far from being understood,and the complexity in studying such maps depends very much on the difference r′-r,which is called the rank defect.The only known nontrivial non-equidimensional structure theorems on proper holomorphic maps are due to Z.-H.Tu [10],in which a rigidity theorem was proven for certain pairs of classical domains of type I,which implies nonexistence theorems for other pairs of such domains.For both results the rank defect is equal to 1,and a generaliza- tion of the rigidity result to cases of higher rank defects along the line of arguments of [10] has so far been inaccessible. In this article, the author produces nonexistence results for infinite series of pairs of （Ω→Ω′） of irreducible bounded symmetric domains of type I in which the rank defect is an arbitrarily prescribed positive integer. Such nonexistence results are obtained by exploiting the geometry of characteristic symmetric subspaces as introduced by N. Mok and L-H Tsai [6] and more generally invariantly geodesic subspaces as formalized in [8]. Our nonexistence results motivate the formulation of questions on proper holomorphic maps in the non-equirank case.     

A comparison of nonnegative real ranks and their preservers

This paper concerns three notions of rank of matrices over semirings; real rank, semiring rank and column rank. These three rank functions are the same over subfields of reals but differ for matrices over subsemirings of nonnegative reals. We investigate the largest values of r for which the real rank and semiring rank, real rank and column rank of all m×n matrices over a given semiring are both r, respectively. We also characterize the linear operators which preserve the column rank of matrices over certain subsemirings of the nonnegative reals.     

Mirror symmetry,Langlands duality,and the Hitchin system

Among the major mathematical approaches to mirror symmetry are those of Batyrev-Borisov and Strominger-Yau-Zaslow (SYZ). The first is explicit and amenable to computation but is not clearly related to the physical motivation; the second is the opposite. Furthermore, it is far from obvious that mirror partners in one sense will also be mirror partners in the other. This paper concerns a class of examples that can be shown to satisfy the requirements of SYZ, but whose Hodge numbers are also equal. This provides significant evidence in support of SYZ. Moreover, the examples are of great interest in their own right: they are spaces of flat SL_r-connections on a smooth curve. The mirror is the corresponding space for the Langlands dual group PGL_r. These examples therefore throw a bridge from mirror symmetry to the duality theory of Lie groups and, more broadly, to the geometric Langlands program.     

An affine analogue of the Hartman-Nirenberg cylinder theorem

Let X be a smooth, complete, connected submanifold of dimension in a complex affine space , and r is the rank of its Gauss map . The authors prove that if and in the pencil of the second fundamental forms of X, there are two forms defining a regular pencil all eigenvalues of which are distinct, then the submanifold X is a cylinder with -dimensional plane generators erected over a smooth, complete, connected submanifold Y of rank r and dimension r. This result is an affine analogue of the Hartman-Nirenberg cylinder theorem proved for and r = 1. For and , there exist complete connected submanifolds that are not cylinders. Received: 20 October 2000 / Revised version: 18 April 2001 / Published online: 18 January 2002     

Lq‐estimates for the stationary Oseen equations on the exterior of a rotating obstacle

We study the Dirichlet problem for the stationary Oseen equations around a rotating body in an exterior domain. Our main results are the existence and uniqueness of weak and very weak solutions satisfying appropriate L^q‐estimates. The uniqueness of very weak solutions is shown by the method of cut‐off functions with an anisotropic decay. Then our existence result for very weak solutions is deduced by a duality argument from the existence and estimates of strong solutions. From this and interior regularity of very weak solutions, we finally establish the complete D^1,r‐result for weak solutions of the Oseen equations around a rotating body in an exterior domain, where 4/3<r <4. Here, D^1,r is the homogeneous Sobolev space.     

Polytopes of high rank for the symmetric groups

In the Atlas of abstract regular polytopes for small almost simple groups by Leemans and Vauthier, the polytopes whose automorphism group is a symmetric group Sn of degree 5?n?9 are available. Two observations arise when we look at the results: (1) for n?5, the (n−1)-simplex is, up to isomorphism, the unique regular (n−1)-polytope having Sn as automorphism group and, (2) for n?7, there exists, up to isomorphism and duality, a unique regular (n−2)-polytope whose automorphism group is Sn. We prove that (1) is true for n≠4 and (2) is true for n?7. Finally, we also prove that Sn acts regularly on at least one abstract polytope of rank r for every 3?r?n−1.     

The union of minimal hitting sets: Parameterized combinatorial bounds and counting

A k-hitting set in a hypergraph is a set of at most k vertices that intersects all hyperedges. We study the union of all inclusion-minimal k-hitting sets in hypergraphs of rank r (where the rank is the maximum size of hyperedges). We show that this union is relevant for certain combinatorial inference problems and give worst-case bounds on its size, depending on r and k. For r=2 our result is tight, and for each r3 we have an asymptotically optimal bound and make progress regarding the constant factor. The exact worst-case size for r3 remains an open problem. We also propose an algorithm for counting all k-hitting sets in hypergraphs of rank r. Its asymptotic runtime matches the best one known for the much more special problem of finding one k-hitting set. The results are used for efficient counting of k-hitting sets that contain any particular vertex.     

The rank of a completion of a dedekind domain

Let D be a Dedekind domain with quotient field K. Let C_p be the completion of the localisationD_p , of D at a nonzero prime idealp, of D. Let r_p be the rank of C_p as a D-module, ier_p , is the dimension of the K-vector space K_p , = K? _DC_p . The following results on r_p are deduced from well-known theorems: if r_p is finite for at least one prime ideal p, then D is a discrete valuation ring; and D = C_p if _p = 1. If D is a discrete valuation ring, then r_p = dimExt(K, D) + 1. A module M is extensionless if every extension of M by M splits. The D-module r_C is an estensionless indecomposable module. If r_C is infinite for every nonzero prime ideal, it is shown that an estensionless D-module of finite rank is a direct sum or certain rank one modulcs.     

A generalization of curve genus for ample vector bundles. I

A new genus g = g (X, ?) is defined for the pairs (X, ?S)that consist of n-dimensional compact complex manifolds X and ample vector bundles ? of rank r less than n on X. In case r = n-1g is equal to curve genus. Above pairs (X,?) with g less than two are classified. For spanned ? it is shown that g is greater than or equal to the irregularity of X, and its equality condition is given.