The Block Structure of the Images of Regular Unipotent Elements from Subsystem Symplectic Subgroups of Rank 2 in Irreducible Representations of Symplectic Groups. I

The dimensions of the Jordan blocks in the images of regular unipotent elements from subsystem subgroups of type C2 in p-restricted irreducible representations of groups of type Cn in characteristic p ≥ 11 with locally small highest weights are found. These results can be applied for investigating the behavior of unipotent elements in modular representations of simple algebraic groups and recognizing representations and linear groups. The article consists of 3 parts. In the first one, preliminary lemmas that are necessary for proving the principal results, are contained and the case where all weights of the restriction of a representation considered to a subgroup of type A1 containing a relevant unipotent element are less than p, is investigated.     

A Simple Proof of the Restricted Isometry Property for Random Matrices

We give a simple technique for verifying the Restricted Isometry Property (as introduced by Candès and Tao) for random matrices that underlies Compressed Sensing. Our approach has two main ingredients: (i) concentration inequalities for random inner products that have recently provided algorithmically simple proofs of the Johnson–Lindenstrauss lemma; and (ii) covering numbers for finite-dimensional balls in Euclidean space. This leads to an elementary proof of the Restricted Isometry Property and brings out connections between Compressed Sensing and the Johnson–Lindenstrauss lemma. As a result, we obtain simple and direct proofs of Kashin’s theorems on widths of finite balls in Euclidean space (and their improvements due to Gluskin) and proofs of the existence of optimal Compressed Sensing measurement matrices. In the process, we also prove that these measurements have a certain universality with respect to the sparsity-inducing basis.      

A graph-theoretic proof of the non-existence of self-orthogonal Latin squares of order 6

The non-existence of a pair of mutually orthogonal Latin squares of order six is a well-known result in the theory of combinatorial designs. It was conjectured by Euler in 1782 and was first proved by Tarry in 1900 by means of an exhaustive enumeration of equivalence classes of Latin squares of order six. Various further proofs have since been given, but these proofs generally require extensive prior subject knowledge in order to follow them, or are ‘blind’ proofs in the sense that most of the work is done by computer or by exhaustive enumeration. In this paper we present a graph-theoretic proof of a somewhat weaker result, namely the non-existence of self-orthogonal Latin squares of order six, by introducing the concept of a self-orthogonal Latin square graph. The advantage of this proof is that it is easily verifiable and accessible to discrete mathematicians not intimately familiar with the theory of combinatorial designs. The proof also does not require any significant prior knowledge of graph theory.     

Source algebra equivalences for blocks¶of finite general linear groups over a fixed field

T. Jost proved that Donovan's conjecture holds for the unipotent blocks of the finite general linear groups over a fixed field. In this paper, we show that the Morita equivalences exhibited by Jost are in fact equivalences between the source algebras of the corresponding blocks, and thus that Puig's conjecture holds for the unipotent blocks of finite general groups over a fixed field. Received: 3 October 2000     

A bijective proof of the hook-length formula for skew shapes

Recently, Naruse presented a beautiful cancellation-free hook-length formula for skew shapes. The formula involves a sum over objects called excited diagrams, and the term corresponding to each excited diagram has hook lengths in the denominator, like the classical hook-length formula due to Frame, Robinson and Thrall. In this paper, we present a simple bijection that proves an equivalent recursive version of Naruse’s result, in the same way that the celebrated hook-walk proof due to Greene, Nijenhuis and Wilf gives a bijective (or probabilistic) proof of the hook-length formula for ordinary shapes.In particular, we also give a new bijective proof of the classical hook-length formula, quite different from the known proofs.     

A linear programming proof of the second order conditions of non-linear programming

In this note we give a new, simple proof of the standard first and second order necessary conditions, under the Mangasarian–Fromovitz constraint qualification (MFCQ), for non-linear programming problems. We work under a mild constraint qualification, which is implied by MFCQ. This makes it possible to reduce the proof to the relatively easy case of inequality constraints only under MFCQ. This reduction makes use of relaxation of inequality constraints and it makes use of a penalty function. The new proof is based on the duality theorem for linear programming; the proofs in the literature are based on results of mathematical analysis. This paper completes the work in a recent note of Birbil et al. where a linear programming proof of the first order necessary conditions has been given, using relaxation of equality constraints.     

Existence of Gradings on Associative Algebras

In this article, we study the existence of gradings on finite dimensional associative algebras. We prove that a connected algebra A does not have a nontrivial grading if and only if A is basic, its quiver has one vertex, and its group of outer automorphisms is unipotent. We apply this result to prove that up to graded Morita equivalence there do not exist nontrivial gradings on the blocks of group algebras with quaternion defect groups and one isomorphism class of simple modules.     

The Besicovitch–Federer projection theorem is false in every infinite-dimensional Banach space

The theme of the article is the study of the unipotent part of Arthur’s trace formula for general linear groups. The case of regular (or “regular by blocks”) unipotent orbits has been treated in another paper (cf. [10]). Here we are interested in the contribution of Richardson orbits that are induced by Levi subgroups with two-by-two distinct blocks. In this case, the contribution is remarkably given by a global unipotent weighted orbital integral. As a corollary, we get integral formulas for some of Arthur’s global coefficients. We also present a new construction of Arthur’s local unipotent weighted orbital integral and an explicit computation of some of them.     

Cyclic orders: Equivalence and duality

Cyclic orders of graphs and their equivalence have been promoted by Bessy and Thomassé’s recent proof of Gallai’s conjecture. We explore this notion further: we prove that two cyclic orders are equivalent if and only if the winding number of every circuit is the same in the two. The proof is short and provides a good characterization and a polynomial algorithm for deciding whether two orders are equivalent. We then derive short proofs of Gallai’s conjecture and a theorem “polar to” the main result of Bessy and Thomassé, using the duality theorem of linear programming, total unimodularity, and the new result on the equivalence of cyclic orders.     

The basic theorem of complementarity revisited

The basic theorm of (linear) complementarity was stated in a 1971 paper [6] by B.C. Eaves who credited C.E. Lemke for giving a constructive proof based on his almost complementary pivot algorithm. This theorem asserts that associated with an arbitrary linear complementarity problem, a certain augmented problem always possesses a solution. Many well-known existence results pertaining to the linear complementarity problem are consequences of this fundamental theorem.In this paper, we explore some further implications of the basic theorem of complementarity and derive new existence results for the linear complementarity problem. Based on these results, conditions for the existence of a solution to a linear complementarity problem with a fully-semimonotone matrix are examined. The class of the linear complementarity problems with aG-matrix is also investigated.The work of this author was based on research supported by the National Science Foundation under grant ECS-8717968.     

论有限群元素共轭类的平均长度

本文研究有限群元素共轭类的平均长度问题.利用初等群论方法和有限群特征标理论,在共轭类平均长度为某一定数时,获得了对有限群结构的刻划,且对有限群数量性质的研究是有意义的.     

Bijective proofs of some classical partition identities

A bijective proof of a general partition theorem is given which has as direct corollaries many classical partition theorems due to Euler, Glaisher, Schur, Andrews, Subbarao, and others. It is shown that the bijective proof specializes to give bijective proofs of these classical results and moreover the bijections which result often coincide with bijections which have occurred in the literature. Also given are some sufficient conditions for when two classes of words omitting certain sequences of words are in bijection.     

Parallel summation,Maxwell's principle and the infimum of projections

In this paper we apply Maxwell's principle to give simple proofs of the properties of R: S, the parallel sum of two positive semi-definite linear operators. The parallel sum has been studied by Anderson, Ando, Duffin, Fillmore, Mitra, Williams, and others. In particular we give a short, elementary, and geometric proof of the result of Anderson and Duffin that gives the infimum of two orthogonal projections as twice their parallel sum.     

Balancedness of Sequencing Games with Multiple Parallel Machines

We provide simple constructive proofs of balancedness of classes of m-PS (m-Parallel Sequencing) games, which arise from sequencing situations with m parallel machines. This includes the setting that is studied by Calleja et al. (2001) and Calleja et al. (2002), who provided a complex constructive proof and a simple non-constructive proof of balancedness of a restricted class of 2-PS games, respectively. Furthermore, we provide a counterexample to illustrate that our balancedness results cannot be extended to a general setting.     

Stokes Cocycle and Differential Galois Groups

The classification of germs of ordinary linear differential systems with meromorphic coefficients at 0 under convergent gauge transformations and fixed normal form is essentially given by the non-Abelian 1-cohomology set of Malgrange–Sibuya. (Germs themselves are actually classified by a quotient of this set.) It is known that there exists a natural isomorphism h between a unipotent Lie group (called the Stokes group) and the 1-cohomology set of Malgrange–Sibuya; the inverse map which consists of choosing, in each cohomology class, a special cocycle called a Stokes cocycle is proved to be natural and constructive. We survey here the definition of the Stokes cocycle and give a combinatorial proof for the bijectivity of h. We state some consequences of this result, such as Ramis, density theorem in linear differential Galois theory; we note that such a proof based on the Stokes cocycle theorem and the Tannakian theory does not require any theory of (multi-)summation.     

A Bijection for Eulerian-equivalence Classes of Totally Cyclic Orientations

Gioan showed that the number of cycle reversing classes of totally cyclic orientations of a given graph can be calculated as an evaluation of the corresponding Tutte polynomial. We note that the concept of cycle reversing classes of orientations coincides with that of Eulerian-equivalence classes considered by Chen and Stanley, and Kochol. Based on this coincidence, we give a bijective proof of Gioan’s result. Precisely, the main result of the paper is an algorithmic bijection between the set of Eulerian-equivalence classes of totally cyclic orientations and the set of spanning trees without internally active edges.      

General logical metatheorems for functional analysis

In this paper we prove general logical metatheorems which state that for large classes of theorems and proofs in (nonlinear) functional analysis it is possible to extract from the proofs effective bounds which depend only on very sparse local bounds on certain parameters. This means that the bounds are uniform for all parameters meeting these weak local boundedness conditions. The results vastly generalize related theorems due to the second author where the global boundedness of the underlying metric space (resp. a convex subset of a normed space) was assumed. Our results treat general classes of spaces such as metric, hyperbolic, CAT(0), normed, uniformly convex and inner product spaces and classes of functions such as nonexpansive, Hölder-Lipschitz, uniformly continuous, bounded and weakly quasi-nonexpansive ones. We give several applications in the area of metric fixed point theory. In particular, we show that the uniformities observed in a number of recently found effective bounds (by proof theoretic analysis) can be seen as instances of our general logical results.

     

Jordan标准形定理的初等变换证明

本文对 Jordan标准形定理给出了一种使用初等变换的证明 ,直观意义明显、易于理解 ,可用于线性代数教学 .     

SUBSPACES OF BARRELLED SPACES

Abstract

Dieudoné [1] showed that finite-codimensional subspace of a barreled locally convex space is itself barreled, and a simple proof was obtained by Komura [2]. The result was later extended to conutable-condimensional subspaces by Saxon and Levin [3] and Valdivia [4]. Their proofs were rather complicated, and in this note we present a simple proof that a countable-codimensional subspace of a barreled space is barrelled.