Finite linear spaces with two consecutive line degrees

Let L be a non-trivial finite linear space in which every line has n or n+1 points. We describe L completely subject to the following restrictions on n and on the number of points p: p≤n ²+n?1 and n≥3; n ²+n+2≤p≤n ²+2n?1 and n≥3; p=n ²+2n and n≥4; p=n ²+2n+2 and n≥3; p=n ²+2n+3 and n≥4.     

Symmetric multi-box splines for higher degree

We consider the space S _n =S _n (v ₀,…,v _n+r ) of compactly supported C ^n?1 piecewise polynomials on a mesh M of lines through ?² in directions v ₀,…,v _n+r . A sequence ψ=(ψ ₁,…,ψ _r ) of elements of S _n is called a multi-box spline if every element of S _n is a finite linear combination of shifts of (the components of) ψ. For the case n=2, 3 we give some examples for multi-box splines and show that they are not always stable. It is further shown that any C ^n?1 piecewise polynomial of degree n≥2 on M, is possibly a symmetric multi-box spline.     

Small point sets of PG(n, q 3) intersecting each k-subspace in 1 mod q points

The main result of this paper is that point sets of PG(n, q ³), q = p ^h , p ≥ 7 prime, of size less than 3(q ^3(n?k) + 1)/2 intersecting each k-space in 1 modulo q points (these are always small minimal blocking sets with respect to k-spaces) are linear blocking sets. As a consequence, we get that minimal blocking sets of PG(n, p ³), p ≥ 7 prime, of size less than 3(p ^3(n?k) + 1)/2 with respect to k-spaces are linear. We also give a classification of small linear blocking sets of PG(n, q ³) which meet every (n ? 2)-space in 1 modulo q points.     

On the exactness of certain inequalities in approximation theory

We prove the following: for every sequence {F_v}, F_v ? 0, F_v > 0 there exists a functionf such that

1. E_n(f)?F_n (n=0, 1, 2, ...) and
2. A_kn^?k? _v=1 ⁿ v^k?1 F_v?1?Ω_k (f, n^?1) (n=1, 2, ...).

     

A Note on Partial Parallel Classes in Steiner Systems

A partial parallel class of blocks of a Steiner system S(t,k,v) is a collection of pairwise disjoint blocks. The purpose of this note is to show that any S(k,k+1,v) Steiner system, with v?k⁴+3k³+k²+1, has a partial parallel class containing at least (v?k+1)/(k+2) blocks.     

On lines, joints, and incidences in three dimensions

We extend (and somewhat simplify) the algebraic proof technique of Guth and Katz (2010) [9], to obtain several sharp bounds on the number of incidences between lines and points in three dimensions. Specifically, we show: (i) The maximum possible number of incidences between n lines in R³ and m of their joints (points incident to at least three non-coplanar lines) is Θ(m1/3n) for m?n, and Θ(m2/3n2/3+m+n) for m?n. (ii) In particular, the number of such incidences cannot exceed O(n3/2). (iii) The bound in (i) also holds for incidences between n lines and m arbitrary points (not necessarily joints), provided that no plane contains more than O(n) points and each point is incident to at least three lines. As a preliminary step, we give a simpler proof of (an extension of) the bound O(n3/2), established by Guth and Katz, on the number of joints in a set of n lines in R³. We also present some further extensions of these bounds, and give a trivial proof of Bourgain's conjecture on incidences between points and lines in 3-space, which is an immediate consequence of our incidence bounds, and which constitutes a much simpler alternative to the proof of Guth and Katz (2010) [9].     

Small point sets of PG(n, p 3h ) intersecting each line in 1 mod p h points

The main result of this paper is that point sets of PG(n, q), q = p ^3h , p ≥ 7 prime, of size < 3(q ^n-1 + 1)/2 intersecting each line in 1 modulo ${\sqrt[3] q}$ points (these are always small minimal blocking sets with respect to lines) are linear blocking sets. As a consequence, we get that minimal blocking sets of PG(n, p ³), p ≥ 7 prime, of size < 3(p ^3(n-1) + 1)/2 with respect to lines are always linear.     

On the maximum number of disjoint Steiner triple systems

Let D(v) be the maximum number of pairwise disjoint Steiner triple systems of order v. We prove that D(3v)≥2v+D(v) for every v ≡ 1 or 3 (mod 6), v≥3. As a corollary, we have D(3ⁿ)=3ⁿ-2 for every n≥1.     

Embedding a Latin square with transversal into a projective space

A Latin square of side n defines in a natural way a finite geometry on 3n points, with three lines of size n and n² lines of size 3. A Latin square of side n with a transversal similarly defines a finite geometry on 3n+1 points, with three lines of size n, n²−n lines of size 3, and n concurrent lines of size 4. A collection of k mutually orthogonal Latin squares defines a geometry on kn points, with k lines of size n and n² lines of size k. Extending the work of Bruen and Colbourn [A.A. Bruen, C.J. Colbourn, Transversal designs in classical planes and spaces, J. Combin. Theory Ser. A 92 (2000) 88-94], we characterise embeddings of these finite geometries into projective spaces over skew fields.     

A correlational inequality for linear extensions of a poset

Suppose 1, 2, and 3 are pairwise incomparable points in a poset onn≥3 points. LetN (ijk) be the number of linear extensions of the poset in whichi precedesj andj precedesk. Define λ by $$\lambda = \frac{{N(213)N(312)}}{{\left[ {N(123) + N(132)} \right]\left[ {N(231) + N(321)} \right]}}$$ Two applications of the Ahlswede-Daykin evaluation theorem for distributive lattices are used to prove that λ?(n?1)²/(n+1)² for oddn, and λ?(n?2)/(n+2) for evenn. Simple examples show that these bounds are best-possible. Shepp (Annals of Probability, 1982) proved thatP(12)?P(12/13), the so-calledxyz inequality, whereP(ij) is the probability thati precedesj in a randomly chosen linear extension of the poset, thus settling a conjecture of I. Rival and B. Sands. The preceding bounds on λ yield a simple proof ofP(12)<P(12/13), which had also been conjectured by Rival and Sands.     

On the equivalence of linear equations under nonlocal transformation

Linear nth order (n?3) ordinary differential equations have been shown to possess n+1, n+2 or n+4 Lie point symmetries. Each class contains equations which are equivalent under point transformation. By taking the example of third order equations, we show that all linear equations are equivalent if the class of transformation is broadened to include nonlocal transformations and hence the representative of this class of equations is y⁽ⁿ⁾=0.     

A proof of Coleman's conjecture

Almost thirty years ago Coleman made a conjecture that for any convex lattice polygon with v vertices, g (g?1) interior lattice points and b boundary lattice points we have b?2g-v+10. In this note we give a proof of the conjecture. We also aim to describe all convex lattice polygons for which the bound b=2g-v+10 is attained.     

Existence of r-self-orthogonal Latin squares

Two Latin squares of order v are r-orthogonal if their superposition produces exactly r distinct ordered pairs. If the second square is the transpose of the first one, we say that the first square is r-self-orthogonal, denoted by r-SOLS(v). It has been proved that for any integer v?28, there exists an r-SOLS(v) if and only if v?r?v² and r∉{v+1,v²-1}. In this paper, we give an almost complete solution for the existence of r-self-orthogonal Latin squares.     

On the degree of points and lines in a restricted linear space

In this paper we show that, with the exception of a few easily characterized linear spaces, all restricted linear spaces of square order n have the maximal degree of the lines equal to n + 1, the degree of every point at least n + 1, and further we show that p ? n² + n + 1 ? q, where p is the number of points and q the number of lines.     

Weighted norm inequalities for polynomial expansions associated to some measures with mass points

Fourier series in orthogonal polynomials with respect to a measurev on [?1, 1] are studied whenv is a linear combination of a generalized Jacobi weight and finitely many Dirac deltas in [?1, 1]. We prove some weighted norm inequalities for the partial sum operatorsS _n, their maximal operatorS ^*, and the commutator [M _b, S_n], whereM _b denotes the operator of pointwise multiplication byb ∈BMO. We also prove some norm inequalites forS _n whenv is a sum of a Laguerre weitht onR ⁺ and a positive mass on 0.     

Constructions of new orthogonal arrays and covering arrays of strength three

A covering array of size N, strength t, degree k, and order v, or a CA(N;t,k,v) in short, is a k×N array on v symbols. In every t×N subarray, each t-tuple column vector occurs at least once. When ‘at least’ is replaced by ‘exactly’, this defines an orthogonal array, OA(t,k,v). A difference covering array, or a DCA(k,n;v), over an abelian group G of order v is a k×n array (aij) (1?i?k, 1?j?n) with entries from G, such that, for any two distinct rows l and h of D (1?l<h?k), the difference list Δlh={dh1−dl1,dh2−dl2,…,dhn−dln} contains every element of G at least once.Covering arrays have important applications in statistics and computer science, as well as in drug screening. In this paper, we present two constructive methods to obtain orthogonal arrays and covering arrays of strength 3 by using DCAs. As a consequence, it is proved that there are an OA(3,5,v) for any integer v?4 and v?2 (mod 4), and an OA(3,6,v) for any positive integer v satisfying gcd(v,4)≠2 and gcd(v,18)≠3. It is also proved that the size CAN(3,k,v) of a CA(N;3,k,v) cannot exceed v³+v² when k=5 and v≡2 (mod 4), or k=6, v≡2 (mod 4) and gcd(v,18)≠3.     

Adaptive Itô-Taylor algorithm can optimally approximate the Itô integrals of singular functions

We deal with numerical approximation of stochastic Itô integrals of singular functions. We first consider the regular case of integrands belonging to the Hölder class with parameters r and ?. We show that in this case the classical Itô-Taylor algorithm has the optimal error Θ(n^−(r+?)). In the singular case, we consider a class of piecewise regular functions that have continuous derivatives, except for a finite number of unknown singular points. We show that any nonadaptive algorithm cannot efficiently handle such a problem, even in the case of a single singularity. The error of such algorithm is no less than n^{−min{1/2,r+?}}. Therefore, we must turn to adaptive algorithms. We construct the adaptive Itô-Taylor algorithm that, in the case of at most one singularity, has the optimal error O(n^−(r+?)). The best speed of convergence, known for regular functions, is thus preserved. For multiple singularities, we show that any adaptive algorithm has the error Ω(n^{−min{1/2,r+?}}), and this bound is sharp.     

PATHS AND CYCLES EMBEDDING ON FAULTY ENHANCED HYPERCUBE NETWORKS

Let Qn,k(n≥3,1≤k≤n-1) be an n-dimensional enhanced hypercube which is an attractive variant of the hypercube and can be obtained by adding some complementary edges,fv and fe be the numbers of faulty vertices and faulty edges,respectively.In this paper,we give three main results.First,a fault-free path P [u,v] of length at least 2n-2fv-1(respectively,2n-2fv-2) can be embedded on Qn,k with fv+fe≤n-1 when d Qn,k(u,v) is odd(respectively,d Qn,k(u,v) is even).Secondly,an Qn,k is(n-2) edgefault-free hyper Hamiltonian-laceable when n(≥3) and k have the same parity.Lastly,a fault-free cycle of length at least 2n-2fv can be embedded on Qn,k with fe≤n-1 and fv+fe≤2n-4.     

Maximal sets of permutations constructed from projective planes

On the set of n²+n+1 points of a projective plane, a set of n²+n+1 permutations is constructed with the property that any two are a Hamming distance 2n+1 apart. Another set is constructed in which every pair are a Hamming distance not greater than 2n+1 apart. Both sets are maximal with respect to the stated property.     

Contribution to the General Linear Conjugation Problem for A Piecewise Analytic Vector

Establishing an analogy between the theories of Riemann–Hilbert vector problem and linear ODEs, for the n-dimensional homogeneous linear conjugation problem on a simple smooth closed contour Γ partitioning the complex plane into two domains D⁺ and D^? we show that if we know n?1 particular solutions such that the determinant of the size n?1 matrix of their components omitting those with index k is nonvanishing on D⁺ ∪ Γ and the determinant of the matrix of their components omitting those with index j is nonvanishing on Γ ∪ D^? {∞}, where \(k,j = \overline {1,n} \), then the canonical system of solutions to the linear conjugation problem can be constructed in closed form.