Cameron–Liebler line classes in PG(n,4)

We derive a new existence condition for Cameron–Liebler line classes in \(PG(3,q)\) . As an application, we obtain the characterization of Cameron–Liebler line classes in \(PG(n,4),\,n\ge 3\) .     

A New Method for Constructing Williamson Matrices

For every prime power q 1 (mod 4) we prove the existence of (q; x, y)-partitions of GF(q) with q=x²+4y² for some x, y, which are very useful for constructing SDS, DS and Hadamard matrices. We discuss the transformations of (q; x,y)-partitions and, by using the partitions, construct generalized cyclotomic classes which have properties similar to those of classical cyclotomic classes. Thus we provide a new construction for Williamson matrices of order q².The research supported by NSF of China (No. 10071029).     

Cameron–Liebler k-sets in subspaces and non-existence conditions

Designs, Codes and Cryptography - In this article we generalize the concepts that were used in the PhD thesis of Drudge to classify Cameron–Liebler line classes in PG $$(n,q), n\ge 3$$ , to...     

On large minimal blocking sets in PG(2,q)

The size of large minimal blocking sets is bounded by the Bruen–Thas upper bound. The bound is sharp when q is a square. Here the bound is improved if q is a non‐square. On the other hand, we present some constructions of reasonably large minimal blocking sets in planes of non‐prime order. The construction can be regarded as a generalization of Buekenhout's construction of unitals. For example, if q is a cube, then our construction gives minimal blocking sets of size q^4/3 + 1 or q^4/3 + 2. Density results for the spectrum of minimal blocking sets in Galois planes of non‐prime order is also presented. The most attractive case is when q is a square, where we show that there is a minimal blocking set for any size from the interval . © 2004 Wiley Periodicals, Inc. J Combin Designs 13: 25–41, 2005.     

The existence of positive solutions to a non‐local singular boundary value problem

We consider the non‐local singular boundary value problem (1) where q ∈ C⁰([0,1]) and f, h ∈ C⁰((0,∞)), limf(x)=?∞, limh(x)=∞. We present conditions guaranteeing the existence of a solution x ∈ C¹([0,1]) ∩ C²((0,1]) which is positive on (0,1]. The proof of the existence result is based on regularization and sequential techniques and on a non‐linear alternative of Leray–Schauder type. Copyright © 2005 John Wiley & Sons, Ltd.     

Monotonicity methods in generalized Orlicz spaces for a class of non‐Newtonian fluids

The paper concerns existence of weak solutions to the equations describing a motion of some non‐Newtonian fluids with non‐standard growth conditions of the Cauchy stress tensor. Motivated by the fluids of strongly inhomogeneous behavior and having the property of rapid shear thickening, we observe that the L^p framework is not suitable to capture the described situation. We describe the growth conditions with the help of general x‐dependent convex function. This formulation yields the existence of solutions in generalized Orlicz spaces. As examples of motivation for considering non‐Newtonian fluids in such spaces, we recall the electrorheological fluids, magnetorheological fluids, and shear thickening fluids. The existence of solutions is established by the generalization of the classical Minty method to non‐reflexive spaces. The result holds under the assumption that the lowest growth of the Cauchy stress is greater than the critical exponent q=(3d+ 2)/(d+ 2), where d is for space dimension. The restriction on the exponent q is forced by the convective term. Copyright © 2009 John Wiley & Sons, Ltd.     

A study of (<Emphasis Type="Italic">x</Emphasis>(<Emphasis Type="Italic">q</Emphasis> + 1), <Emphasis Type="Italic">x</Emphasis>; 2, <Emphasis Type="Italic">q</Emphasis>)-minihypers

In this paper, we study the weighted (x(q + 1), x; 2, q)-minihypers. These are weighted sets of x(q + 1) points in PG(2, q) intersecting every line in at least x points. We investigate the decomposability of these minihypers, and define a switching construction which associates to an (x(q + 1), x; 2, q)-minihyper, with x ≤ q ² − q, not decomposable in the sum of another minihyper and a line, a (j(q + 1), j; 2, q)-minihyper, where j = q ² − q − x, again not decomposable into the sum of another minihyper and a line. We also characterize particular (x(q + 1), x; 2, q)-minihypers, and give new examples. Additionally, we show that (x(q + 1), x; 2, q)-minihypers can be described as rational sums of lines. In this way, this work continues the research on (x(q + 1), x; 2, q)-minihypers by Hill and Ward (Des Codes Cryptogr 44:169–196, 2007), giving further results on these minihypers.     

Strong asymptotics of orthogonal polynomials with respect to exponential weights

We consider asymptotics of orthogonal polynomials with respect to weights w(x)dx = e^−Q(x) dx on the real line, where Q(x) = Σ q_k x^k, q_2m > 0, denotes a polynomial of even order with positive leading coefficient. The orthogonal polynomial problem is formulated as a Riemann‐Hilbert problem following [22, 23]. We employ the steepest‐descent‐type method introduced in [18] and further developed in [17, 19] in order to obtain uniform Plancherel‐Rotach‐type asymptotics in the entire complex plane, as well as asymptotic formulae for the zeros, the leading coefficients, and the recurrence coefficients of the orthogonal polynomials. © 1999 John Wiley & Sons, Inc.     

On the independence number of the Erdős‐Rényi and projective norm graphs and a related hypergraph

The Erd?s‐Rényi and Projective Norm graphs are algebraically defined graphs that have proved useful in supplying constructions in extremal graph theory and Ramsey theory. Their eigenvalues have been computed and this yields an upper bound on their independence number. Here we show that in many cases, this upper bound is sharp in the order of magnitude. Our result for the Erd?s‐Rényi graph has the following reformulation: the maximum size of a family of mutually non‐orthogonal lines in a vector space of dimension three over the finite field of order q is of order q^3/2. We also prove that every subset of vertices of size greater than q^2/2 + q^3/2 + O(q) in the Erd?s‐Rényi graph contains a triangle. This shows that an old construction of Parsons is asymptotically sharp. Several related results and open problems are provided. © 2007 Wiley Periodicals, Inc. J Graph Theory 56: 113–127, 2007     

A stability of the steady flow of compressible viscous fluid with respect to initial disturbance (v∞ ≠ 0)

We consider a compressible viscous fluid with the velocity at infinity equal to a strictly non‐zero constant vector in ?³. Under the assumptions on the smallness of the external force and velocity at infinity, Novotny–Padula (Math. Ann. 1997; 308 :439– 489) proved the existence and uniqueness of steady flow in the class of functions possessing some pointwise decay. In this paper, we study stability of the steady flow with respect to the initial disturbance. We proved that if H³‐norm of the initial disturbance is small enough, then the solution to the non‐stationary problem exists uniquely and globally in time, which satisfies a uniform estimate on prescribed velocity at infinity and converges to the steady flow in L_q‐norm for any number q? 2. Copyright © 2006 John Wiley & Sons, Ltd.     

Charakterisierung der <Emphasis Type="Italic">q</Emphasis>-Orthogonalpolynome in <Emphasis Type="Italic">x</Emphasis>

Characterization of q-Orthogonal Polynomials. Im Anschluß an die Arbeit Orthogonalpolynome in x und q^–x als Lösungen von reellen q-Operatorgleichungen zweiter Ordnung (Monatsh. Math. 132, 123–140 (2001); im folgenden als [4] zitiert) werden alle Möglichkeiten für q-Orthogonalpolynome in x als Lösungen von q-Operatorgleichungen zweiter Ordnung angegeben (Orthogonalität im positiv definiten Sinne). Dabei erfolgt die Numerierung der Abschnitte und die Angabe der Formel-nummern unter Einbeziehung von [4].     

New large sets of t‐designs with prescribed groups of automorphisms

In this article, we investigate the existence of large sets of 3‐designs of prime sizes with prescribed groups of automorphisms PSL(2,q) and PGL(2,q) for q < 60. We also construct some new interesting large sets by the use of the computer program DISCRETA. The results obtained through these direct methods along with known recursive constructions are combined to prove more extensive theorems on the existence of large sets. © 2006 Wiley Periodicals, Inc. J Combin Designs 15: 210–220, 2007     

Line partitions of internal points to a conic in <Emphasis Type="Italic">PG</Emphasis>(2,<Emphasis Type="Italic">q</Emphasis>)

All sets of lines providing a partition of the set of internal points to a conic C in PG(2,q), q odd, are determined. There exist only three such linesets up to projectivities, namely the set of all non-tangent lines to C through an external point to C, the set of all non-tangent lines to C through a point in C, and, for square q, the set of all non-tangent lines to C belonging to a Baer subplane PG(2,√q) with √q+1 common points with C. This classification theorem is the analogous of a classical result by Segre and Korchmáros [9] characterizing the pencil of lines through an internal point to C as the unique set of lines, up to projectivities, which provides a partition of the set of all non-internal points to C. However, the proof is not analogous, since it does not rely on the famous Lemma of Tangents of Segre which was the main ingredient in [9]. The main tools in the present paper are certain partitions in conics of the set of all internal points to C, together with some recent combinatorial characterizations of blocking sets of non-secant lines, see [2], and of blocking sets of external lines, see [1].     

Small weight codewords in the codes arising from Desarguesian projective planes

We study codewords of small weight in the codes arising from Desarguesian projective planes. We first of all improve the results of K. Chouinard on codewords of small weight in the codes arising from PG(2, p), p prime. Chouinard characterized all the codewords up to weight 2p in these codes. Using a particular basis for this code, described by Moorhouse, we characterize all the codewords of weight up to 2p + (p−1)/2 if p ≥ 11. We then study the codes arising from . In particular, for q ₀ = p prime, p ≥ 7, we prove that the codes have no codewords with weight in the interval [q + 2, 2q − 1]. Finally, for the codes of PG(2, q), q = p ^h , p prime, h ≥ 4, we present a discrete spectrum for the weights of codewords with weights in the interval [q + 2, 2q − 1]. In particular, we exclude all weights in the interval [3q/2, 2q − 1]. Geertrui Van de Voorde research is supported by the Institute for the Promotion of Innovation through Science and Technology in Flanders (IWT-Vlaanderen) Joost Winne was supported by the Fund for Scientific Research - Flanders (Belgium).     

A Bose‐Burton type theorem for quadrics

Let Q be a non‐degenerate quadric defined by a quadratic form in the finite projective space PG(d,q). Let r be the dimension of the generators of Q. For all k with 2 ≤ k < r we determine the smallest cardinality of a set B of points with the property that every subspace of dimension k that is contained in Q meets B. It turns out that the smallest examples consist of the non‐singular points of quadrics S ∩ Q for suitable subspaces S of codimension k of PG(d,q). For k = 1, the same result was known before. © 2003 Wiley Periodicals, Inc. J Combin Designs 11: 317–338, 2003; Published online in Wiley InterScience ( www.interscience.wiley.com ). DOI 10.1002/jcd.10051     

Commuting polarities and maximal partial ovoids of H(4,q2)

In PG(4,q²), q odd, let Q(4,q²) be a non‐singular quadric commuting with a non‐singular Hermitian variety H(4,q²). Then these varieties intersect in the set of points covered by the extended generators of a non‐singular quadric Q₀ in a Baer subgeometry Σ₀ of PG(4,q²). It is proved that any maximal partial ovoid of H(4,q²) intersecting Q₀ in an ovoid has size at least 2(q²+1). Further, given an ovoid O of Q₀, we construct maximal partial ovoids of H(4,q²) of size q³+1 whose set of points lies on the hyperbolic lines 〈P,X〉 where P is a fixed point of O and X varies in O\{P}. © 2009 Wiley Periodicals, Inc. J Combin Designs 17: 307–313, 2009     

Cameron-Liebler line classes in PG (3,q)

A Cameron-Liebler line class is a set L of lines in PG(3, q) for which there exists a number x such that |LS|=x for all spreads S. There are many equivalent properties: Theorem 1 lists eight. This paper classifies Cameron-Liebler line classes with x4 (with two exceptions). It is also shown that the study of Cameron-Liebler line classes is equivalent to the study of weighted sets of points in PG(3, q) with two weights on lines.     

Travelling Wavefronts in Reaction‐Diffusion Equations with Convection Effects and Non‐Regular Terms

This paper deals with the appearance of monotone bounded travelling wave solutions for a parabolic reaction‐diffusion equation which frequently meets both in chemical and biological systems. In particular, we prove the existence of monotone front type solutions for any wave speed c ≥ c* and give an estimate for the threshold value c*. Our model takes into account both of a density dependent diffusion term and of a non‐linear convection effect. Moreover, we do not require the main non‐linearity g to be a regular C¹ function; in particular we are able to treat both the case when g′(0) = 0, giving rise to a degenerate equilibrium point in the phase plane, and the singular case when g′(0) = +∞. Our results generalize previous ones due to Aronson and Weinberger [Adv. Math. 30 (1978), pp. 33–76 ], Gibbs and Murray (see Murray [Mathematical Biology, Springer‐Verlag, Berlin, 1993 ]) and McCabe , Leach and Needham [SIAM J. Appl. Math. 59 (1998), pp. 870–899 ]. Finally, we obtain our conclusions by means of a comparison‐type technique which was introduced and developed in this framework in a recent paper by the same authors.     

Types of superregular matrices and the number of n‐arcs and complete n‐arcs in PG (r,q)

Based on the classification of superregular matrices, the numbers of non‐equivalent n‐arcs and complete n‐arcs in PG(r, q) are determined (i) for 4 ≤ q ≤ 19, 2 ≤ r ≤ q ? 2 and arbitrary n, (ii) for 23 ≤ q ≤ 32, r = 2 and n ≥ q ? 8<$>. The equivalence classes over both PGL (k, q) and PΓL(k, q) are considered throughout the examinations and computations. For the classification, an n‐arc is represented by the systematic generator matrix of the corresponding MDS code, without the identity matrix part of it. A rectangular matrix like this is superregular, i.e., it has only non‐singular square submatrices. Four types of superregular matrices are studied and the non‐equivalent superregular matrices of different types are stored in databases. Some particular results on t(r, q) and m′(r, q)—the smallest and the second largest size for complete arcs in PG(r, q)—are also reported, stating that m′(2, 31) = 22, m′(2, 32) = 24, t(3, 23) = 10, and m′(3, 23) = 16. © 2006 Wiley Periodicals, Inc. J Combin Designs 14: 363–390, 2006