On Buchsbaum bundles on quadric hypersurfaces

Let E be an indecomposable rank two vector bundle on the projective space ℙ ⁿ , n ≥ 3, over an algebraically closed field of characteristic zero. It is well known that E is arithmetically Buchsbaum if and only if n = 3 and E is a null-correlation bundle. In the present paper we establish an analogous result for rank two indecomposable arithmetically Buchsbaum vector bundles on the smooth quadric hypersurface Q _n ⊂ ℙ ⁿ⁺¹, n ≥ 3. We give in fact a full classification and prove that n must be at most 5. As to k-Buchsbaum rank two vector bundles on Q ₃, k ≥ 2, we prove two boundedness results.     

An extremal problem for finite topologies and distributive lattices

Let (r₁, r₂, …) be a sequence of non-negative integers summing to n. We determine under what conditions there exists a finite distributive lattice L of rank n with r_i join-irreducibles of rank i, for all i = 1, 2, …. When L exists, we give explicit expressions for the greatest number of elements L can have of any given rank, and for the greatest total number of elements L can have. The problem is also formulated in terms of finite topological spaces.     

Functions and line digraphs

Consider two maps f and g from a set E into a set F such that f(x) ≠ g(x) for every x in E. Suppose that there exists a positive integer n such that for any element z in F either f^?1(z) or g^?1(z) has at most n elements. Then, E can be partitioned into 2n + 1 subsets E₁, E₂,…,E_{2n + 1} such that f(E_i)∩ g(E_i) = ?, 1 ≤ i ≤ 2n + 1. © 2003 Wiley Periodicals, Inc. J Graph Theory 44: 296–303, 2003     

ON CLIFFORD'S THEOREM FOR VECTOR BUNDLES ON ALGEBRAIC CURVES

Let X be a smooth projective curve of genus g ≥ 2 and E a rank r spanned vector bundle on X with deg(E)/rank(E) ≤ g ? 1. Here we give lower bounds for deg(E) refining the classical theorem of Clifford. Most results are for vector bundles with rank ≤ 5.     

Translating IΔ0 + exp Proofs into Weaker Systems

The purpose of this paper is to explore the relationship between IΔ₀ + exp and its weaker subtheories. We give a method of translating certain classes of IΔ₀ + exp proofs into weaker systems of arithmetic such as Buss' systems S₂. We show if IE_i (exp) ⊢ A with a proof P of expind‐rank(P) ≤ n + 1where all (∀ ≤: right) or (∃ ≤: left) have bounding terms not containing function symbols, then Sⁱ ₂ ⊇ IE_i,2 ⊢ Aⁿ. Here A is not necessarily a bounded formula. For IOpen(exp) we prove a similar result. Using our translations we show IOpen(exp) ⊊ IΔ₀(exp). Here IΔ₀(exp) is a conservative extension of IΔ₀ + exp obtained by adding to IΔ₀ a symbol for 2 ^x to the language as well as defining axioms for it.     

Holomorphic Vector Bundle on Hopf Manifolds with Abelian Fundamental Groups

Let X be a Hopf manifolds with an Abelian fundamental group. E is a holomorphic vector bundle of rank r with trivial pull-back to W = ℂ ⁿ –{0}. We prove the existence of a non-vanishing section of L⊗E for some line bundle on X and study the vector bundles filtration structure of E. These generalize the results of D. Mall about structure theorem of such a vector bundle E. The research was supported by 973 Project Foundation of China and the Outstanding Youth Science Grant of NSFC (grant no. 19825105)     

The combinatorics of the colliding bullets

The finite colliding bullets problem is the following simple problem: consider a gun, whose barrel remains in a fixed direction; let (V_i)_{1 ≤ i ≤ n} be an i.i.d. family of random variables with uniform distribution on [0,1]; shoot n bullets one after another at times 1,2,…,n, where the ith bullet has speed V_i. When two bullets collide, they both annihilate. We give the distribution of the number of surviving bullets, and in some generalization of this model. While the distribution is relatively simple (and we found a number of bold claims online), our proof is surprisingly intricate and mixes combinatorial and geometric arguments; we argue that any rigorous argument must very likely be rather elaborate.     

Perfect matchings in random s-uniform hypergraphs

Let E = {X₁, X₂…, X_m} where the X_i ? V for 1 ≤ i ≤ m are distinct. The hypergraph G = (V, E) is said to be s-uniform if |X₁| = s for 1 ≤ i ≤ m. A set of edges M = {X_i : i ? I } is a perfect matching if (i) i ≠ j ? I implies X_i ∩ X_i = 0, and (ii) ∪_i?I X_i = V. In this article we consider the question of whether a random s-uniform hypergraph contains a perfect matching. Let s ≥ 3 be fixed and m/n^4/3 → ∞. We show that an s-uniform hypergraph with m edges chosen uniformly from [74] contains a perfect matching with high probability. This improves an earlier result of Schmidt and Shamir who showed that m/n^3/2 → ∞ suffices. © 1995 John Wiley & Sons, Inc.     

Tail bounds for the height and width of a random tree with a given degree sequence

Fix a sequence c = (c₁,…,c_n) of non‐negative integers with sum n ? 1. We say a rooted tree T has child sequence c if it is possible to order the nodes of T as v₁,…,v_n so that for each 1 ≤ i ≤ n, v_i has exactly c_i children. Let ${\mathcal T}Fix a sequence c = (c₁,…,c_n) of non‐negative integers with sum n ? 1. We say a rooted tree T has child sequence c if it is possible to order the nodes of T as v₁,…,v_n so that for each 1 ≤ i ≤ n, v_i has exactly c_i children. Let ${\mathcal T}$ be a plane tree drawn uniformly at random from among all plane trees with child sequence c . In this note we prove sub‐Gaussian tail bounds on the height (greatest depth of any node) and width (greatest number of nodes at any single depth) of ${\mathcal T}$. These bounds are optimal up to the constant in the exponent when c satisfies $\sum_{i=1}^n c_i^2=O(n)$; the latter can be viewed as a “finite variance” condition for the child sequence. © 2012 Wiley Periodicals, Inc. Random Struct. Alg., 2012     

Maximal σ‐polynomials of connected 3‐chromatic graphs

In the set of graphs of order n and chromatic number k the following partial order relation is defined. One says that a graph G is less than a graph H if c_i(G) ≤ c_i(H) holds for every i, k ≤ i ≤ n and at least one inequality is strict, where c_i(G) denotes the number of i‐color partitions of G. In this paper the first ? n/2 ? levels of the diagram of the partially ordered set of connected 3‐chromatic graphs of order n are described. © 2003 Wiley Periodicals, Inc. J Graph Theory 43: 210–222, 2003     

Illuminating high-dimensional convex sets

A setL of points in thed-spaceE ^d is said toilluminate a familyF={S ₁, ...,S _n } ofn disjoint compact sets inE ^d if for every setS _i inF and every pointx in the boundary ofS _i there is a pointv inL such thatv illuminatesx, i.e. the line segment joiningv tox intersects the union of the elements ofF in exactly {x}.The problem we treat is the size of a setS needed to illuminate a familyF={S ₁, ...,S _n } ofn disjoint compact sets inE ^d . We also treat the problem of putting these convex sets in mutually disjoint convex polytopes, each one having at most a certain number of facets.     

The Brauer group of desingularization of moduli spaces of vector bundles over a curve

Let C be an irreducible smooth projective curve, of genus at least two, defined over an algebraically closed field of characteristic zero. For a fixed line bundle L on C, let M _C (r; L) be the coarse moduli space of semistable vector bundles E over C of rank r with ∧ ^r E = L. We show that the Brauer group of any desingularization of M _C (r; L) is trivial.     

Integral approximation sequences

Letn linear formsL _i onm variables be given, normalized so that all coefficients have absolute value at most unity. Letw ₁, ...,w _m be real numbers andx ₁, ...,x _m be integers. We sayE _i =L _i (w ₁, ...,w _m )-L _i (x ₁, ...,x _m ) is the error in approximating thew's by thex's with respect to formL _i It is shown that given anyw's there is an integral approximation ofx's so that the errorsE _i are small-roughly that simultaneously for alli.     

Some intersection theorems

LetL(A) be the set of submatrices of anm×n matrixA. ThenL(A) is a ranked poset with respect to the inclusion, and the poset rank of a submatrix is the sum of the number of rows and columns minus 1, the rank of the empty matrix is zero. We attack the question: What is the maximum number of submatrices such that any two of them have intersection of rank at leastt? We have a solution fort=1,2 using the followoing theorem of independent interest. Letm(n,i,j,k) = max(|F|;|G|), where maximum is taken for all possible pairs of families of subsets of ann-element set such thatF isi-intersecting,G isj-intersecting andF ansd,G are cross-k-intersecting. Then fori≤j≤k, m(n,i,j,k) is attained ifF is a maximali-intersecting family containing subsets of size at leastn/2, andG is a maximal2k?i-intersecting family. Furthermore, we discuss and Erd?s-Ko-Rado-type question forL(A), as well.     

单位球上线丛的不变Cauchy-Riemann算子

L_m,E是Kahler流形M上Hermite丛E第m阶Cauchy－Riemann算子,给定一定条件,L_m,E是L_1,E的多项式．当考虑M是黎曼面时,得到公式(16)．当E为Bⁿ的典范线丛,证明了L_m,E=(?)(L_1,E+(j-1)(j-2)).     

On the L2n 1– Extension Properties

We have proved that for all compact linear operator u from R into an L_p ([0,1], ν) (0 < p < 1) extends to L ₁ ([0,1], ν), where R denotes the closed linear subspace in L ₁ ([0,1], ν) of the Rademacher functions {r_n }_{n ? N}. In this paper, we study this type of extension for E_n ? L_2n ¹ where E_n is the n–dimensional subspace which appears in Kasin's theorem such that L_2n ¹ = E_n ⊕ E ^⊥ _n and the L_2n ¹ , L_2n ² norms are universally equivalent on both E_n , E ^⊥ _n. We show that, the precedent extension fails for the pair (E_n , L_2n ¹ ) and we generalize this to any E in an L ₁(Ω, A, P) by giving some conditions on E.     

On partitioning the edges of graphs into connected subgraphs

For any positive integer s, an s-partition of a graph G = (V, E) is a partition of E into E₁ ∪ E₂ ∪…? ∪ E_k, where ∣E_i∣ = s for 1 ≤ i ≤ k ? 1 and 1 ≤ ∣E_k∣ ≤ s and each E_i induces a connected subgraph of G. We prove

• (i) If G is connected, then there exists a 2-partition, but not necessarily a 3-partition;
• (ii) If G is 2-edge connected, then there exists a 3-partition, but not necessarily a 4-partition;
• (iii) If G is 3-edge connected, then there exists a 4-partition;
• (iv) If G is 4-edge connected, then there exists an s-partition for all s.

     

Monochromatic Hamiltonian t‐tight Berge‐cycles in hypergraphs

In any r‐uniform hypergraph for 2 ≤ t ≤ r we define an r‐uniform t‐tight Berge‐cycle of length ?, denoted by C_?^{(r, t)}, as a sequence of distinct vertices v₁, v₂, … , v_?, such that for each set (v_i, v_{i + 1}, … , v_{i + t ? 1}) of t consecutive vertices on the cycle, there is an edge E_i of that contains these t vertices and the edges E_i are all distinct for i, 1 ≤ i ≤ ?, where ? + j ≡ j. For t = 2 we get the classical Berge‐cycle and for t = r we get the so‐called tight cycle. In this note we formulate the following conjecture. For any fixed 2 ≤ c, t ≤ r satisfying c + t ≤ r + 1 and sufficiently large n, if we color the edges of K_n^(r), the complete r‐uniform hypergraph on n vertices, with c colors, then there is a monochromatic Hamiltonian t‐tight Berge‐cycle. We prove some partial results about this conjecture and we show that if true the conjecture is best possible. © 2008 Wiley Periodicals, Inc. J Graph Theory 59: 34–44, 2008     

Inductive limits of spaces of vector- valued integrable functions

For an order-continuous Banach function space Λ and a separated inductive limit E:= ind_n E _n, we prove that ind_n A {E_n} is a topological subspace of Λ {E}; moreover, both spaces coincide if the inductive limit is hyperstrict. As a consequence, we deduce that if E is an LF-space, then L ^p {E} is barrelled for 1 ≤ p ≤ ∞.     

On generators of ideals defining projective toric varieties

 For any ample line bundle L on a projective toric variety of dimension n, it is proved that the line bundle L ^⊗i is normally generated if i is greater than or equal to n−1, and examples showing that this estimate is best possible are given. Moreover we prove an estimate for the degree of the generators of the ideals defining projective toric varieties. In particular, when L is normally generated, the defining ideal of the variety embedded by the global sections of L has generators of degree at most n+1. When the variety is embedded by the global sections of L ^⊗(n−1) , then the defining ideal has generators of degree at most three. Received: 11 July 2001 / Revised version: 17 December 2001