On degrees of maps between Grassmannians

Let G_n,k denote the oriented grassmann manifold of orientedk-planes in ℝⁿ. It is shown that for any continuous mapf: G_n,k → G_n,k, dim G_n,k = dim G_m,l = l(m −l), the Brouwer’s degree is zero, providedl > 1,n ≠ m. Similar results for continuous mapsg: ℂG_m,l → ℂG_n,k,h: ℍG_m,l → ℍG_n,k, 1 ≤ l < k ≤ n/2, k(n — k) = l(m — l) are also obtained.     

Asymptotics of the basis functions of generalized Taylor series for the class H ρ,2

We study the basis functions φ _n,k and ψ _n,p of generalized Taylor series for the classH _ρ,2 and obtain asymptotic expansions of the functions φ _n,0 ^(l) and $\psi _{n,2 \cdot 4^n - 1}^{(l)} $ . We prove the existence of an asymptotics for the functions φ _n,k and ψ _n,p for k ≠ 0 and p ≠ 2·4 ⁿ ? 1. The first term of the asymptotic expansions of these functions is obtained.     

Equivariant cobordism of Grassmann and flag manifolds

We consider certain natural (ℤ₂)ⁿ actions on real Grassmann and flag manifolds andS ¹ actions on complex Grassmann manifolds with finite stationary point sets and determine completely which of them bound equivariantly.     

Tian’s invariant of the Grassmann manifold

We prove that Tian’s invariant on the complex Grassmann manifold G _p,q(?)is equal to 1/(p+ q).The method introduced here uses a Lie group of holomorphic isometries which operates transitively on the considered manifolds and a natural imbedding of (?¹ (?))^p in G _p,q (?).     

On increasing subsequences of minimal Erdös-Szekeres permutations

Let π be a minimal Erdös-Szekeres permutation of 1, 2, ..., n ², and let l _n,k be the length of the longest increasing subsequence in the segment (π(1), ..., π(k)). Under uniform measure we establish an exponentially decaying bound of the upper tail probability for l _n,k , and as a consequence we obtain a complete convergence, which is an improvement of Romik’s recent result. We also give a precise lower exponential tail for l _n,k .     

Combinatorial models for the finite-dimensional Grassmannians

Let ? ⁿ be a linear hyperplane arrangement in ? ⁿ . We define two corresponding posetsG _k (? ⁿ andV _k (? ⁿ ) of oriented matroids, which approximate the GrassmannianG _k (? ⁿ ) and the Stiefel manifoldV _k (? ⁿ ). The basic conjectures are that the “OM-Grassmannian”G _k (? ⁿ ) has the homotopy type ofG _k (? ⁿ ), and that the “OM-Stiefel bundle” Δπ: ΔV _k (? ⁿ ) → ΔG _k (? ⁿ ) is a surjective map. These conjectures can be proved in some cases: we survey the known results and add some new ones. The conjectures fail if they are generalized to nonrealizable oriented matroids ? ⁿ .     

Edge disjoint cycles in graphs

Ore proved in 1960 that if G is a graph of order n and the sum of the degrees of any pair of nonadjacent vertices is at least n, then G has a hamiltonian cycle. In 1986, Li Hao and Zhu Yongjin showed that if n ? 20 and the minimum degree δ is at least 5, then the graph G above contains at least two edge disjoint hamiltonian cycles. The result of this paper is that if n ? 2δ², then for any 3 ? l₁ ? l₂ ? ? ? l_k ? n, 1 = k = [(δ - 1)/2], such graph has K edge disjoint cycles with lengths l₁, l₂…l_k, respectively. In particular, when l₁ = l₂ = ? = l_k = n and k = [(δ - 1)/2], the graph contains [(δ - 1)/2] edge disjoint hamiltonian cycles.     

Geometry of real grassmann manifolds. Part III

A canonical decomposition for an element of the tangent bundle of the Grassmann manifold G _p,n ⁺ in its Plücker model is constructed. This decomposition is used for introducing the notion of stationary angles between oriented planes. The relation with the stationary angles in the nonoriented case is established. An explicit formula for the exponential mapping is given, which allows calculating the diameter and the injectivity radius of the manifold G _p,n ⁺ . The problem of uniqueness of the canonical decomposition is reduced to a similar problem on the decomposition of bivectors that realizes their mass (the latter has earlier been solved by the author). The techniques developed are used for describing the structure of the closure of an arbitrary geodesic in the manifolds G _p,n ⁺ and G_p,n. (For the manifolds G_p,n, this result was announced by Wong without proof.) Bibliography: 11 titles. Translated from Zapiski Nauchnykh Seminarov POMI, Vol. 246, 1997, pp. 108–129. Translated by N. Yu. Netsvetaev.     

Centerpole sets for colorings of abelian groups

A subset C?G of a group G is called k-centerpole if for each k-coloring of G there is an infinite monochromatic subset G, which is symmetric with respect to a point c??C in the sense that S=cS ^?1 c. By c _k (G) we denote the smallest cardinality c _k (G) of a k-centerpole subset in G. We prove that c _k (G)=c _k (? ^m ) if G is an abelian group of free rank m??k. Also we prove that c ₁(? ⁿ⁺¹)=1, c ₂(? ⁿ⁺²)=3, c ₃(? ⁿ⁺³)=6, 8??c ₄(? ⁿ⁺⁴)??c ₄(?⁴)=12 for all n????, and ${\frac{1}{2}(k^{2}+3k-4)\le c_{k}(\mathbb{Z}^{n})\le2^{k}-1-\max_{s\le k-2}\binom {k-1}{s-1}}$ for all n??k??4.     

On the structure of linear graphs

Denote byG(n; m) a graph ofn vertices andm edges. We prove that everyG(n; [n ²/4]+1) contains a circuit ofl edges for every 3 ≦l<c ₂ n, also that everyG(n; [n ²/4]+1) contains ak _e(u _n, u_n) withu _n=[c ₁ logn] (for the definition ofk _e(u _n, u_n) see the introduction). Finally fort>t ₀ everyG(n; [tn ^3/2]) contains a circuit of 2l edges for 2≦l<c ₃ t ². This work was done while the author received support from the National Science Foundation, N.S.F. G.88.     

Geometry of Real Grassmann Manifolds. IV

Classical geodesic embeddings in the Grassmann manifold are described algebraically by means of the exterior algebra (V). The group I ₀(G ⁺) of isometries of the Grassmannian is described without the theory of Lie groups and algebras. Interior and exterior properties of Grassmann manifolds are proved with the help of the equivariant Plücker embedding. The isomorphism type of the group of twists of the Grassmann manifold around an arbitrary geodesic is described. Bibliography: 16 titles.     

Nielsen equalizer theory

We extend the Nielsen theory of coincidence sets to equalizer sets, the points where a given set of (more than 2) mappings agree. On manifolds, this theory is interesting only for maps between spaces of different dimension, and our results hold for sets of k maps on compact manifolds from dimension (k−1)n to dimension n. We define the Nielsen equalizer number, which is a lower bound for the minimal number of equalizer points when the maps are changed by homotopies, and is in fact equal to this minimal number when the domain manifold is not a surface.As an application we give some results in Nielsen coincidence theory with positive codimension. This includes a complete computation of the geometric Nielsen number for maps between tori.     

On the characteristic polynomial of supermatrices

We prove that the coefficients of the so-called right 2-characteristic polynomial of a supermatrix over a Grassmann algebraG=G ₀⊕G ₁ are in the even componentG ₀ ofG. As a consequence, we obtain that the algebra ofn×n supermatrices is integral of degreen ² overG ₀. Partially supported by OTKA of Hungary, grant no. T16432.     

The effect on the algebraic connectivity of a tree by grafting or collapsing of edges

Let G=(V,E) be a tree on n?2 vertices and let v∈V. Let L(G) be the Laplacian matrix of G and μ(G) be its algebraic connectivity. Let G_k,l, be the graph obtained from G by attaching two new paths P:vv₁v₂…v_k and Q:vu₁u₂…u_l of length k and l, respectively, at v. We prove that if l?k?1 then μ(G_k-1,l+1)?μ(G_k,l). Let (v₁,v₂) be an edge of G. Let be the tree obtained from G by deleting the edge (v₁,v₂) and identifying the vertices v₁ and v₂. Then we prove that As a corollary to the above results, we obtain the celebrated theorem on algebraic connectivity which states that among all trees on n vertices, the path has the smallest and the star has the largest algebraic connectivity.     

Extremals in some classes of Carnot groups

Let G be a Carnot group and D={e 1,e 2 } be a bracket generating left invariant distribution on G.In this paper,we obtain two main results.We first prove that there only exist normal minimizers in G if the type of D is (2,1,...,1) or (2,1,...,1,2).This immediately leads to the fact that there are only normal minimizers in the Goursat manifolds.As one corollary,we also obtain that there are only normal minimizers when dim G 5.We construct a class of Carnot groups such as that of type (2,1,...,1,2,n 0,...,n a) with n 0 1,n i 0,i=1,...,a,in which there exist strictly abnormal extremals.This implies that,for any given manifold of dimension n 6,we can find a class of n-dimensional Carnot groups having strictly abnormal minimizers.We conclude that the dimension n=5 is the border line for the existence and nonexistence of strictly abnormal extremals.Our main technique is based on the equations for the normal and abnormal extremals.     

Perfect Matchings and K 4 3 -Tilings in Hypergraphs of Large Codegree

For a k-graph F, let t _l (n, m, F) be the smallest integer t such that every k-graph G on n vertices in which every l-set of vertices is included in at least t edges contains a collection of vertex-disjoint F-subgraphs covering all but at most m vertices of G. Let K _m ^k denote the complete k-graph on m vertices. The function $t_{k-1} (kn, 0, K_k^k)For a k-graph F, let t _l (n, m, F) be the smallest integer t such that every k-graph G on n vertices in which every l-set of vertices is included in at least t edges contains a collection of vertex-disjoint F-subgraphs covering all but at most m vertices of G. Let K _m ^k denote the complete k-graph on m vertices. The function (i.e. when we want to guarantee a perfect matching) has been previously determined by Kühn and Osthus [9] (asymptotically) and by R?dl, Ruciński, and Szemerédi [13] (exactly). Here we obtain asymptotic formulae for some other l. Namely, we prove that for any and , . Also, we present various bounds in another special but interesting case: t ₂(n, m, K ₄³) with m = 0 or m = o(n), that is, when we want to tile (almost) all vertices by copies of K ₄³, the complete 3-graph on 4 vertices. Reverts to public domain 28 years from publication. Oleg Pikhurko: Partially supported by the National Science Foundation, Grant DMS-0457512.     

More results on Ramsey—Turán type problems

The paper deals with common generalizations of classical results of Ramsey and Turán. The following is one of the main results. Assumek≧2, ε>0,G _n is a sequence of graphs ofn-vertices and at least 1/2((3k?5) / (3k?2)+ε)n ² edges, and the size of the largest independent set inG _n iso(n). LetH be any graph of arboricity at mostk. Then there exists ann ₀ such that allG _n withn>n ₀ contain a copy ofH. This result is best possible in caseH=K _2k .     

On globally generated vector bundles on projective spaces

A classification is given for globally generated vector bundles E of rank k on Pⁿ having first Chern class c₁(E)=2. In particular, we get that they split if k<n unless E is a twisted null-correlation bundle on P³. In view of the well-known correspondence between globally generated vector bundles and maps to Grassmannians, we obtain, as a corollary, a classification of double Veronese embeddings of Pⁿ into a Grassmannian G(k−1,N) of (k−1)-planes in P^N.     

A note on the probabilistic approach to Turán's problem

The Turán number T(n, l, k) is the smallest possible number of edges in a k-graph on n vertices such that every l-set of vertices contains an edge. Given a k-graph H = (V(H), E(H)), we let X_s(S) equal the number of edges contained in S, for any s-set S?V(H). Turán's problem is equivalent to estimating the expectation E(X_l), given that min(X_l) ≥ 1. The following lower bound on the variance of X_s is proved:

$\text{Var(X}{}_{\mathrm{s}}\text{)?mm}\text{n?2k}\text{s?k}\text{n}\text{s}{}^{\mathrm{?1}}\text{n}\text{k}{}^1$

, where m = |E(H)| and $\text{m}\text{= (}{}_{\mathrm{k}}{}^{\mathrm{n}}\text{) ? m}$. This implies the following: putting t(k, l) = lim_n→∞T(n, l, k)(_kⁿ)^?1 then t(k, l) ≥ T(s, l, k)((_k^s) ? 1)^?1, whenever s ≥ l > k ≥ 2. A connection of these results with the existence of certain t-designs is mentioned.     

Bounds for ratios of eigenvalues using traces

Let A be an n × n matrix with real eigenvalues λ₁ ? … ? λ_n, and let 1 ? k < l ? n. Bounds involving trA and trA² are introduced for λ_k/λ_l, (λ_k ? λ_l)/(λ_k + λ_l), and {kλ_k + (n ? l + 1)λ_l}²/{kλ²_k + (n ? l + 1)λ²_l}. Also included are conditions for λ_l >; 0 and for λ_k + λ_l > 0.