Brion’s theorem for Gelfand–Tsetlin polytopes

This work is motivated by the observation that the character of an irreducible gl_n-module (a Schur polynomial), being the sum of exponentials of integer points in a Gelfand–Tsetlin polytope, can be expressed by using Brion’s theorem. The main result is that, in the case of a regular highest weight, the contributions of all nonsimplicial vertices vanish, while the number of simplicial vertices is n! and the contributions of these vertices are precisely the summands in Weyl’s character formula.     

Classical theorems of probability on Gelfand pairs—Khinchin’s theorems and Cramér’s theorem

We prove Khinchin’s Theorems for Gelfand pairs (G, K) satisfying a condition (*): (a)G is connected; (b)G is almost connected and Ad (G/M) is almost algebraic for some compact normal subgroupM; (c)G admits a compact open normal subgroup; (d) (G,K) is symmetric andG is 2-root compact; (e)G is a Zariski-connectedp-adic algebraic group; (f) compact extension of unipotent algebraic groups; (g) compact extension of connected nilpotent groups. In fact, condition (*) turns out to be necessary and sufficient forK-biinvariant measures on aforementioned Gelfand pairs to be Hungarian. We also prove that Cramér’s theorem does not hold for a class of Gaussians on compact Gelfand pairs. This author was supported by the European Commission (TMR 1998–2001 Network Harmonic Analysis).     

Transfer and Tate’s theorem

Let H be a subgroup of a finite group G, and assume that p is a prime that does not divide |G : H|. In favorable circumstances, one can use transfer theory to deduce that the largest abelian p-groups that occur as factor groups of G and of H are isomorphic. When this happens, Tate’s theorem guarantees that the largest not-necessarily-abelian p-groups that occur as factor groups of G and H are isomorphic. Known proofs of Tate’s theorem involve cohomology or character theory, but in this paper, a new elementary proof is given. It is also shown that the largest abelian p-factor group of G is always isomorphic to a direct factor of the largest abelian p-factor group of H. Received: 17 June 2008     

Poncelet’s theorem and billiard knots

Let D be any elliptic right cylinder. We prove that every type of knot can be realized as the trajectory of a ball in D. This proves a conjecture of Lamm and gives a new proof of a conjecture of Jones and Przytycki. We use Jacobi??s proof of Poncelet??s theorem by means of elliptic functions.     

Hindman’s theorem and idempotent types

Motivated by a question of Di Nasso, we show that Hindman’s theorem is equivalent to the existence of idempotent types in countable complete extensions of Peano Arithmetic.     

A proof of dilworth’s decomposition theorem for partially ordered sets

A short proof of the following theorem is given: LetP be a finite partially ordered set. If the maximal number of elements in an independent subset ofP isk, thenP is the union ofk chains.     

Berkson’s theorem

We give a new proof of the theorem that Amitsur’s complex for purely inseparable field extensions has vanishing homology in dimensions higher than 2. This is accomplished by computing the kernel and cokernel of the logarithmic derivativet →Dt/t mapping the multiplicative Amitsur complex to the acyclic additive one (D is a derivation of the extension field). This research was supported by National Science Foundation grant NSF GP 1649.     

The degenerated second main theorem and Schmidt’s subspace theorem

In this paper, we establish a Second Main Theorem for an algebraically degenerate holomorphic curve f : C → Pn(C) intersecting hypersurfaces in general position. The related Diophantine problems are also considered.     

On Turner’s theorem and first-order theory

A theorem of E.C. Turner states that if F is a finitely generated free group, then the test words are precisely the elements not contained in any proper retract. In this paper, we examine some ideas in model theory and logic related to Turner’s characterization of test words and introduce Turner groups, a class of groups containing all finite groups and all stably hyperbolic groups satisfying this characterization. We show that Turner’s theorem is not first-order expressible. However, we prove that every finitely generated elementary free group is a Turner group.     

Picard’s theorem and the Rickman construction

Nevanlinna theory (value-distribution theory) has its genesis in Picard’s discovery that a function analytic in the plane which omits two values is constant. Nearly a century later, attention turned to the analogous situation in Rn, n≥3, where entire functions are necesarily replaced by entire quasiregular mappings. This expository article centers on one of Seppo Rickman’s main contributions to this issue, including an outline of his famous example showing that the omitted set in R3, while finite, can be much larger than possible in the plane.     

A Brauer’s theorem and related results

Given a square matrix A, a Brauer’s theorem [Brauer A., Limits for the characteristic roots of a matrix. IV. Applications to stochastic matrices, Duke Math. J., 1952, 19(1), 75–91] shows how to modify one single eigenvalue of A via a rank-one perturbation without changing any of the remaining eigenvalues. Older and newer results can be considered in the framework of the above theorem. In this paper, we present its application to stabilization of control systems, including the case when the system is noncontrollable. Other applications presented are related to the Jordan form of A and Wielandt’s and Hotelling’s deflations. An extension of the aforementioned Brauer’s result, Rado’s theorem, shows how to modify r eigenvalues of A at the same time via a rank-r perturbation without changing any of the remaining eigenvalues. The same results considered by blocks can be put into the block version framework of the above theorem.     

Oriented matroids and Ky Fan’s theorem

L. Lovász (Matroids and Sperner’s Lemma, Europ. J. Comb. 1 (1980), 65–66) has shown that Sperner’s combinatorial lemma admits a generalization involving a matroid defined on the set of vertices of the associated triangulation. We prove that Ky Fan’s theorem admits an oriented matroid generalization of similar nature. Classical Ky Fan’s theorem is obtained as a corollary if the underlying oriented matroid is chosen to be the alternating matroid C ^m,r .     

Hall’s and Kőnig’s theorem in graphs and hypergraphs

We investigate the relation between Hall’s theorem and K?nig’s theorem in graphs and hypergraphs. In particular, we characterize the graphs satisfying a deficiency version of Hall’s theorem, thereby showing that this class strictly contains all K?nig–Egerváry graphs. Furthermore, we give a generalization of Hall’s theorem to normal hypergraphs.