A class of optimal linear codes of length one above the Griesmer bound

In this paper, we determine the smallest lengths of linear codes with some minimum distances. We construct a [g _q (k, d) + 1, k, d] _q code for sq ^k-1 − sq ^k-2 − q ^s  − q ² + 1 ≤ d ≤ sq ^k-1 − sq ^k-2 − q ^s with 3 ≤ s ≤ k − 2 and q ≥ s + 1. Then we get n _q (k, d) = g _q (k, d) + 1 for (k − 2)q ^k-1 − (k − 1)q ^k-2 − q ² + 1 ≤ d ≤ (k − 2)q ^k-1 − (k − 1)q ^k-2, k ≥ 6, q ≥ 2k − 3; and sq ^k-1 − sq ^k-2 − q ^s  − q + 1 ≤ d ≤ sq ^k-1 − sq ^k-2 − q ^s , s ≥ 2, k ≥ 2s + 1 and q ≥ 2s − 1. This work was partially supported by the Com²MaC-SRC/ERC program of MOST/KOSEF (grant ^# R11-1999-054) and was partially supported by the Korea Research Foundation Grant funded by the Korean Government(MOEHRD)(KRF-2005-214-C00175).     

Weierstrass points on trigonal curves I: The ramification points

LetC be a smooth curve of genusg≥5. Assume thatP is a Weierstrass point onC which first non-gap is equal to 3. The gap sequence atP is completely determinated by numbersn and ε satisfying (g−1)/3≤n≤g/2 and ε is 1 or 2 as follows. Given suchn and ε, the corresponding gap sequence is (1, 2, 4, 5,…, 3n−2, 3n−1, 3n+ε, 3n+3+ε, …, 3(g−n−1)+ε). We say thatP is of then-th kind andP is of type I (resp. II) if ε=1 (resp. 2). Because a curve of genusg≥5 has at most one linear systemg1/3, it follows that the Weierstrass points onC with first non-gap equal to 3 are of the same kind.     

On projectively normal embeddings of generalk-gonal curves

Fix integersg, k andt witht>0,k≥3 andtk<g/2−1. LetX be a generalk-gonal curve of genusg andR∈Pic ^k (X) the uniqueg _k ¹ onX. SetL:=K _X⊗(R ^*)^⊗t.L is very ample. Leth _L:X→P(H ⁰(X, L)^*) be the associated embedding. Here we prove thath _L(X) is projectively normal. Ifk≥4 andtk<g/2−2 the curveh _L(X) is scheme-theoretically cut out by quadrics. The author was partially supported by MURST and GNSAGA of CNR (Italy).     

Pencils on double coverings of curves

Let X be a smooth curve of genus g. When and d ≥ π−2g+1 we show the existence of a double covering where C a smooth curve of genus π with a base-point-free pencil of degree d which is not the pull-back of a pencil on X. Received: 7 February 2007; Revised: 1 July 2008     

Distributions of Points in <Emphasis Type="Italic">d</Emphasis> Dimensions and Large <Emphasis Type="Italic">k</Emphasis>-Point Simplices

We consider a variant of Heilbronn’s triangle problem by investigating for a fixed dimension d≥2 and for integers k≥2 with k≤d distributions of n points in the d-dimensional unit cube [0,1] ^d , such that the minimum volume of the simplices, which are determined by (k+1) of these n points is as large as possible. Denoting by Δ _k,d (n), the supremum of this minimum volume over all distributions of n points in [0,1] ^d , we show that c _k,d ⋅(log n)^1/(d−k+1)/n ^k/(d−k+1)≤Δ _k,d (n)≤c _k,d ′/n ^k/d for fixed 2≤k≤d, and, moreover, for odd integers k≥1, we show the upper bound Δ _k,d (n)≤c _k,d ″/n ^{k/d+(k−1)/(2d(d−1))}, where c _k,d ,c _k,d ′,c _k,d ″>0 are constants. A preliminary version of this paper appeared in COCOON ’05.     

On the number of Galois points for a plane curve in positive characteristic,III

We consider the following problem: For a smooth plane curve C of degree d ≥ 4 in characteristic p > 0, determine the number δ(C) of inner Galois points with respect to C. This problem seems to be open in the case where d ≡ 1 mod p and C is not a Fermat curve F(p ^e  + 1) of degree p ^e  + 1. When p ≠ 2, we completely determine δ(C). If p = 2 (and C is in the open case), then we prove that δ(C) = 0, 1 or d and δ(C) = d only if d−1 is a power of 2, and give an example with δ(C) = d when d = 5. As an application, we characterize a smooth plane curve having both inner and outer Galois points. On the other hand, for Klein quartic curve with suitable coordinates in characteristic two, we prove that the set of outer Galois points coincides with the one of \mathbbF₂{\mathbb{F}_{2}} -rational points in \mathbbP²{\mathbb{P}^{2}}.     

Linear series computing the Clifford index of a projective curve

For a (smooth irreducible) curveC of genus g and Clifford indexc>2 with a linear seriesg _d ^r computing c (so ) it is well known thatc + 2 ≤d ≤2 (c + 2), and if then 2c + 1 ≤g ≤ 2c + 4 unlessd = 2c + 4 in which caseg = 2c + 5. Let c ≥ 0 andg be integers. If 2c + 1 ≤g ≤2c + 4 we prove that for any integerd <g such thatd ≡c mod 2 andc + 2 ≤d < 2(c + 2) there exists a curve of genus g and Clifford index c with a g_d ^r computing c. Ford ≥c + 6 (i.e.r ≥ 3) we construct this curve on a surface of degree 2r-2 in ℙ^r, and ford ≥c + 8 (i.e.r ≥ 4) we show that such a curve cannot be found on a surface in ℙ^r of smaller degree. In fact, if g_d ^r computes the Clifford index c of C such thatc + 8 ≤d ≤ 2c + 3 then the birational morphism defined by this series cannot map C onto a (maybe, singular) curve contained in a surface of degree at most 2r-3 in ℙ^r.     

On local Torelli for a class of extremal varieties

We study the local behaviour of the period map for smooth non-degenerate extremal varieties sitting inside scrolls. We conclude with the following theorem:the period map for smooth non-degenerate extremal varieties of dimension k ≠ 2,3in n-projective space with n≥2k+4is generically locally injective for sufficiently high degree d. In particular, the following two conditions on d suffice: (1)d≥3.k.(n−k)+3; (2)d≥(n − k)²+1.     

Multiple blocking sets in finite projective spaces and improvements to the Griesmer bound for linear codes

Belov, Logachev and Sandimirov construct linear codes of minimum distance d for roughly 1/q ^k/2 of the values of d < q ^k-1. In this article we shall prove that, for q = p prime and roughly \frac38{\frac{3}{8}}-th’s of the values of d < q ^k-1, there is no linear code meeting the Griesmer bound. This result uses Blokhuis’ theorem on the size of a t-fold blocking set in PG(2, p), p prime, which we generalise to higher dimensions. We also give more general lower bounds on the size of a t-fold blocking set in PG(δ, q), for arbitrary q and δ ≥ 3. It is known that from a linear code of dimension k with minimum distance d < q ^k-1 that meets the Griesmer bound one can construct a t-fold blocking set of PG(k−1, q). Here, we calculate explicit formulas relating t and d. Finally we show, using the generalised version of Blokhuis’ theorem, that nearly all linear codes over \mathbb F_p{{\mathbb F}_p} of dimension k with minimum distance d < q ^k-1, which meet the Griesmer bound, have codewords of weight at least d + p in subcodes, which contain codewords satisfying certain hypotheses on their supports.     

Weierstrass multiple points on algebraic curves and ramified coverings

Here we prove the following result on Weierstrass multiple points. Theorem:Fix integers k, g with k≥5 and g>4k. Then there exist a genus g, Riemann surface X and k points P ₁, …,P _k of X such that for all integers b ₁≥…≥b _k ≥0we have:

On the generation of clones containing near-unanimity operations

It is a well-known consequence of the Baker-Pixley-Theorem that any clone containing a near-unanimity operation is finitely generated, leading to the question what arity the generating functions must have. In this paper, we show that, for arbitrary d ≥ 2 and large enough n, (n − 1) ^d − 1 is the smallest integer k such that, for every clone C on an n-element set that contains a (d + 1)-ary near-unanimity operation, C ^(k) generates C.     

A 2-factor with Short Cycles Passing Through Specified Independent Vertices in Graph

For a graph G, we define σ₂(G) := min{d(u) + d(v)|u, v ≠ ∈ E(G), u ≠ v}. Let k ≥ 1 be an integer and G be a graph of order n ≥ 3k. We prove if σ₂(G) ≥ n + k − 1, then for any set of k independent vertices v ₁,...,v _k , G has k vertex-disjoint cycles C ₁,..., C _k of length at most four such that v _i ∈ V(C _i ) for all 1 ≤ i ≤ k. And show if σ₂(G) ≥ n + k − 1, then for any set of k independent vertices v ₁,...,v _k , G has k vertex-disjoint cycles C ₁,..., C _k such that v _i ∈ V(C _i ) for all 1 ≤ i ≤ k, V(C ₁) ∪...∪ V(C _k ) = V(G), and |C _i | ≤ 4 for all 1 ≤ i ≤ k − 1. The condition of degree sum σ₂(G) ≥ n + k − 1 is sharp. Received: December 20, 2006. Final version received: December 12, 2007.     

Tiling Transitive Tournaments and Their Blow-ups

Let TT _k denote the transitive tournament on k vertices. Let TT(h,k) denote the graph obtained from TT _k by replacing each vertex with an independent set of size h≥1. The following result is proved: Let c ₂=1/2, c ₃=5/6 and c _k =1−2^{−k−log k} for k≥4. For every ∈>0 there exists N=N(∈,h,k) such that for every undirected graph G with n>N vertices and with δ(G)≥c _k n, every orientation of G contains vertex disjoint copies of TT(h,k) that cover all but at most ∈n vertices. In the cases k=2 and k=3 the result is asymptotically tight. For k≥4, c _k cannot be improved to less than 1−2^{−0.5k(1+o(1))}. This revised version was published online in June 2006 with corrections to the Cover Date.     

On the degree growth of birational mappings in higher dimension

Let ƒ be a birational map of C ^d ,and consider the degree complexity or asymptotic degree growth rate δ(ƒ) = lim_n → ∞ (deg(ƒⁿ))^1/n.We introduce a family of elementary maps, which have the form ƒ = L o J, where L is (invertible) linear, and J(x ₁ ⁻¹ ,..., x_d) = (x ₁ ⁻¹ ,...,x _d ⁻¹ .We develop a method of regularization and show how it can be used to compute δ for an elementary map.     

Range of Brownian Motion with Drift

Let (B _δ (t)) _{t ≥ 0} be a Brownian motion starting at 0 with drift δ > 0. Define by induction S ₁=− inf _{t ≥ 0} B _δ (t), ρ₁ the last time such that B _δ (ρ₁)=−S ₁, S ₂=sup_{0≤ t ≤ρ 1} B _δ (t), ρ₂ the last time such that B _δ (ρ₂)=S ₂ and so on. Setting A _k =S _k +S _k+1; k ≥ 1, we compute the law of (A ₁,...,A _k ) and the distribution of (B _δ (t+ρ l) − B _δ (ρ _l ); 0 ≤ t ≤ ρ _l-1 − ρ _l )_{2 ≤ l ≤ k} for any k ≥ 2, conditionally on (A ₁,...,A _k ). We determine the law of the range R _δ (t) of (B _δ (s)) _{s≥ 0} at time t, and the first range time θ_δ (a) (i.e. θ_δ (a)=inf{t > 0; R _δ (t) > a}). We also investigate the asymptotic behaviour of θ _δ (a) (resp. R _δ (t)) as a → ∞ (resp. t → ∞).     

Deforming Curves in Jacobians to Non-Jacobians II: Curves in <Emphasis Type="Italic">C</Emphasis><Superscript>(<Emphasis Type="Italic">e</Emphasis>)</Superscript>, 3⩽ <Emphasis Type="Italic">e</Emphasis> ⩽ <Emphasis Type="Italic">g</Emphasis>−3*

We introduce deformation theoretic methods for determining when a curve X in a nonhyperelliptic Jacobian JC will deform with JC to a non-Jacobian. We apply these methods to a particular class of curves in symmetric powers C^(e) of C where 3⩽ e ⩽ g−3. More precisely, given a pencil g¹_d of degree d on C, let X be the curve parametrizing divisors of degree e in divisors of g¹_d (see the paper for the precise scheme-theoretical definition). Under certain genericity assumptions on the pair (C, g¹_d), we prove that if X deforms infinitesimally out of the Jacobian locus with JC then either d=2e, dim H⁰ (g¹_d)=e or d=2e+1, dim H⁰ (g¹_d)=e+1. The analogous result in the case e=2 without genericity assumptions was proved earlier. *This material is based upon work partially supported by the National Science Foundation under Grant No. DMS-0071795. Any opinions, findings and conclusions or recommendations expressed in this material are those of the author and do not necessarily reflect the views of the National Science Foundation.     

Bounding the number of connected components of a real algebraic set

For every polynomial mapf=(f ₁,…,f _k): ℝ ⁿ →ℝ ^k , we consider the number of connected components of its zero set,B(Z _f) and two natural “measures of the complexity off,” that is the triple(n, k, d), d being equal to max(degree off _i), and thek-tuple (Δ₁,...,Δ₄), Δ _k being the Newton polyhedron off _i respectively. Our aim is to boundB(Z _f) by recursive functions of these measures of complexity. In particular, with respect to (n, k, d) we shall improve the well-known Milnor-Thom’s bound μ _d (n)=d(2d−1) ⁿ⁻¹. Considered as a polynomial ind, μ _d (n) has leading coefficient equal to 2 ⁿ⁻¹. We obtain a bound depending onn, d, andk such that ifn is sufficiently larger thank, then it improves μ _d (n) for everyd. In particular, it is asymptotically equal to 1/2(k+1)n ^k−1 dⁿ, ifk is fixed andn tends to infinity. The two bounds are obtained by a similar technique involving a slight modification of Milnor-Thom's argument, Smith's theory, and information about the sum of Betti numbers of complex complete intersections.     

A two-grid method with expanded mixed element for nonlinear reaction-diffusion equations

Expanded mixed finite element approximation of nonlinear reaction-diffusion equations is discussed. The equations considered here are used to model the hydrologic and bio-geochemical phenomena. To linearize the mixed-method equations, we use a two-grid method involving a small nonlinear system on a coarse gird of size H and a linear system on a fine grid of size h. Error estimates are derived which demonstrate that the error is O(△t + h k+1 + H 2k+2 d/2 ) (k ≥ 1), where k is the degree of the approximating space for the primary variable and d is the spatial dimension. The above estimates are useful for determining an appropriate H for the coarse grid problems.     

Ideal einstein,conformally flat and semi-symmetric immersions

Recently, B. Y. Chen introduced a new intrinsic invariant of a manifold, and proved that everyn-dimensional submanifold of real space formsR ^m (ε) of constant sectional curvature ε satisfies a basic inequality δ(n ₁,…,n _k )≤c(n ₁,…,n _k )H ²+b(n ₁,…,n _k )ε, whereH is the mean curvature of the immersion, andc(n ₁,…,n _k ) andb(n ₁,…,n _k ) are constants depending only onn ₁,…,n _k ,n andk. The immersion is calledideal if it satisfies the equality case of the above inequality identically for somek-tuple (n ₁,…,n _k ). In this paper, we first prove that every ideal Einstein immersion satisfyingn≥n ₁+…+n _k +1 is totally geodesic, and that every ideal conformally flat immersion satisfyingn≥n ₁+…+n _k +2 andk≥2 is also totally geodesic. Secondly we completely classify all ideal semi-symmetric hypersurfaces in real space forms. The author was supported by the NSFC and RFDP.     

Nearly perfect matchings in regular simple hypergraphs

For every fixedk≥3 there exists a constantc _k with the following property. LetH be ak-uniform,D-regular hypergraph onN vertices, in which no two edges contain more than one common vertex. Ifk>3 thenH contains a matching covering all vertices but at mostc _k ND ^−1/(k−1). Ifk=3, thenH contains a matching covering all vertices but at mostc ₃ ND ^−1/2ln^3/2 D. This improves previous estimates and implies, for example, that any Steiner Triple System onN vertices contains a matching covering all vertices but at mostO(N ^1/2ln^3/2 N), improving results by various authors. Research supported in part by a USA-Israel BSF grant. Research supported in part by a USA-Israel BSF Grant.