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.     

On the code generated by the incidence matrix of points and hyperplanes in <Emphasis Type="Italic">PG</Emphasis>(<Emphasis Type="Italic">n</Emphasis>,<Emphasis Type="Italic">q</Emphasis>) and its dual

In this paper, we study the p-ary linear code C(PG(n,q)), q = p ^h , p prime, h ≥ 1, generated by the incidence matrix of points and hyperplanes of a Desarguesian projective space PG(n,q), and its dual code. We link the codewords of small weight of this code to blocking sets with respect to lines in PG(n,q) and we exclude all possible codewords arising from small linear blocking sets. We also look at the dual code of C(PG(n,q)) and we prove that finding the minimum weight of the dual code can be reduced to finding the minimum weight of the dual code of points and lines in PG(2,q). We present an improved upper bound on this minimum weight and we show that we can drop the divisibility condition on the weight of the codewords in Sachar’s lower bound (Geom Dedicata 8:407–415, 1979). G. Van de Voorde’s research was supported by the Institute for the Promotion of Innovation through Science and Technology in Flanders (IWT-Vlaanderen).     

Symplectic semifield spreads of <Emphasis Type="Italic">PG</Emphasis>(5, <Emphasis Type="Italic">q</Emphasis>) and the veronese surface

In this paper we show that starting from a symplectic semifield spread S{\mathcal{S}} of PG(5, q), q odd, another symplectic semifield spread of PG(5, q) can be obtained, called the symplectic dual of S{\mathcal{S}}, and we prove that the symplectic dual of a Desarguesian spread of PG(5, q) is the symplectic semifield spread arising from a generalized twisted field. Also, we construct a new symplectic semifield spread of PG(5, q) (q = s ², s odd), we describe the associated commutative semifield and deal with the isotopy issue for this example. Finally, we determine the nuclei of the commutative pre-semifields constructed by Zha et al. (Finite Fields Appl 15(2):125–133, 2009).     

Tight sets and <Emphasis Type="Italic">m</Emphasis>-ovoids of generalised quadrangles

The concept of a tight set of points of a generalised quadrangle was introduced by S. E. Payne in 1987, and that of an m-ovoid of a generalised quadrangle was introduced by J. A. Thas in 1989, and we unify these two concepts by defining intriguing sets of points. We prove that every intriguing set of points in a generalised quadrangle is an m-ovoid or a tight set, and we state an intersection result concerning these objects. In the classical generalised quadrangles, we construct new m-ovoids and tight sets. In particular, we construct m-ovoids of W(3,q), q odd, for all even m; we construct (q+1)/2-ovoids of W(3,q) for q odd; and we give a lower bound on m for m-ovoids of H(4,q ²).     

On the Theory of <Emphasis Type="Italic">L</Emphasis><Subscript><Emphasis Type="Italic">p</Emphasis></Subscript>(<Emphasis Type="Italic">L</Emphasis><Subscript><Emphasis Type="Italic">q</Emphasis></Subscript>)-Banach Lattices

Given 1≤ p,q < ∞, let BL_pL_q be the class of all Banach lattices X such that X is isometrically lattice isomorphic to a band in some L_p(L_q)-Banach lattice. We show that the range of a positive contractive projection on any BL_pL_q-Banach lattice is itself in BL_pL_q. It is a consequence of this theorem and previous results that BL_pL_q is first-order axiomatizable in the language of Banach lattices. By studying the pavings of arbitrary BL_pL_q-Banach lattices by finite dimensional sublattices that are themselves in this class, we give an explicit set of axioms for BL_pL_q. We also consider the class of all sublattices of L_p(L_q)-Banach lattices; for this class (when p/q is not an integer) we give a set of axioms that are similar to Krivine’s well-known axioms for the subspaces of L_p-Banach spaces (when p/2 is not an integer). We also extend this result to the limiting case q = ∞.     

Point sets with low <Emphasis Type="Italic">L</Emphasis><Subscript><Emphasis Type="Italic">p</Emphasis></Subscript>-discrepancy

In this paper we study the L _p -discrepancy of digitally shifted Hammersley point sets. While it is known that the (unshifted) Hammersley point set (which is also known as Roth net) with N points has L _p -discrepancy (p an integer) of order (log N)/N, we show that there always exists a shift such that the digitally shifted Hammersley point set has L _p -discrepancy (p an even integer) of order which is best possible by a result of W. Schmidt. Further we concentrate on the case p = 2. We give very tight lower and upper bounds for the L ₂-discrepancy of digitally shifted Hammersley point sets which show that the value of the L ₂-discrepancy of such a point set mostly depends on the number of zero coordinates of the shift and not so much on the position of these. This work is supported by the Austrian Research Fund (FWF), Project P17022-N12 and Project S8305.     

Kernels and <Emphasis Type="Italic">p</Emphasis>-Kernels of <Emphasis Type="Italic">p</Emphasis><Superscript><Emphasis Type="Italic">r</Emphasis></Superscript>-ary 1-Perfect Codes

The rank of a q-ary code C is the dimension of the subspace spanned by C. The kernel of a q-ary code C of length n can be defined as the set of all translations leaving C invariant. Some relations between the rank and the dimension of the kernel of q-ary 1-perfect codes, over as well as over the prime field , are established. Q-ary 1-perfect codes of length n=(q^m − 1)/(q − 1) with different kernel dimensions using switching constructions are constructed and some upper and lower bounds for the dimension of the kernel, once the rank is given, are established.Communicated by: I.F. Blake     

On the directions problem in <Emphasis Type="Italic">AG</Emphasis>(<Emphasis Type="Italic">n</Emphasis>, <Emphasis Type="Italic">q</Emphasis>)

We prove that if q = p ^h , p a prime, do not exist sets U í AG(n,q){U {\subseteq} AG(n,q)}, with |U| = q ^k and 1 < k < n, determining N directions where

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].     

A Characterization of PSL(3, <Emphasis Type="Italic">q</Emphasis>) for <Emphasis Type="Italic">q</Emphasis>=2<Superscript><Emphasis Type="Italic">m</Emphasis></Superscript>

The order components of a finite group are introduced in [12]. In [9], it is proved that the group PSL(3,q), where q is an odd prime power, is uniquely determined by its order components. In this paper, we show that the group PSL(3, q), where q=2 ^m , is also uniquely determined by its order components. Received December 15, 2000, Revised August 15, 2001, Accepted November 13, 2001     

Algebraic independence results for the sixteen families of <Emphasis Type="Italic">q</Emphasis>-series

The sixteen families of q-series containing the Ramanujan functions were listed by I.J. Zucker (SIAM J. Math. Anal. 10:192–206, 1979), which are generated from the Fourier series expansions of the Jacobian elliptic functions or some of their squares. This paper discusses algebraic independence properties for these q-series. We determine all the sets of q-series such that, at each algebraic point, the values of the q-series in the set are algebraically independent over ℚ. We also present several algebraic relations over ℚ for two or three of these q-series.     

On <Emphasis Type="Italic">K</Emphasis><Subscript><Emphasis Type="Italic">p</Emphasis>,<Emphasis Type="Italic">q</Emphasis></Subscript>-factorization of complete bipartite multigraphs

Let λK _m,n be a complete bipartite multigraph with two partite sets having m and n vertices, respectively. A K _p,q -factorization of λK _m,n is a set of edge-disjoint K _p,q -factors of λK _m,n which partition the set of edges of λK _m,n . When p = 1 and q is a prime number, Wang, in his paper [On K _1,q -factorization of complete bipartite graph, Discrete Math., 126: (1994), 359-364], investigated the K _1,q -factorization of K _m,n and gave a sufficient condition for such a factorization to exist. In papers [K _1,k -factorization of complete bipartite graphs, Discrete Math., 259: 301-306 (2002),; K _p,q -factorization of complete bipartite graphs, Sci. China Ser. A-Math., 47: (2004), 473-479], Du and Wang extended Wang’s result to the case that p and q are any positive integers. In this paper, we give a sufficient condition for λK _m,n to have a K _p,q -factorization. As a special case, it is shown that the necessary condition for the K _p,q -factorization of λK _m,n is always sufficient when p : q = k : (k + 1) for any positive integer k.     

Small weight codewords in the dual code of points and hyperplanes in PG(<Emphasis Type="Italic">n</Emphasis>, <Emphasis Type="Italic">q</Emphasis>), <Emphasis Type="Italic">q</Emphasis> even

The main theorem of this article gives a classification of the codewords in \({C^{\bot}_{n-1}(n,q)}\) , the dual code of points and hyperplanes in PG(n, q), q even, with weight smaller than \({q+\sqrt[3]{q^{2}}+1}\). In the proof, we rely on the classification of the small blocking sets in PG(2, q), q even.     

<Emphasis Type="Italic">L</Emphasis><Subscript><Emphasis Type="Italic">p</Emphasis></Subscript> discrepancy of generalized two-dimensional Hammersley point sets

We determine the L _p discrepancy of the two-dimensional Hammersley point set in base b. These formulas show that the L _p discrepancy of the Hammersley point set is not of best possible order with respect to the general (best possible) lower bound on L _p discrepancies due to Roth and Schmidt. To overcome this disadvantage we introduce permutations in the construction of the Hammersley point set and show that there always exist permutations such that the L _p discrepancy of the generalized Hammersley point set is of best possible order. For the L ₂ discrepancy such permutations are given explicitly. F.P. is supported by the Austrian Science Foundation (FWF), Project S9609, that is part of the Austrian National Research Network “Analytic Combinatorics and Probabilistic Number Theory”.     

<Emphasis Type="Italic">k</Emphasis>-noncrossing and <Emphasis Type="Italic">k</Emphasis>-nonnesting graphs and fillings of ferrers diagrams

We give a correspondence between graphs with a given degree sequence and fillings of Ferrers diagrams by nonnegative integers with prescribed row and column sums. In this setting, k-crossings and k-nestings of the graph become occurrences of the identity and the antiidentity matrices in the filling. We use this to show the equality of the numbers of k-noncrossing and k-nonnesting graphs with a given degree sequence. This generalizes the analogous result for matchings and partition graphs of Chen, Deng, Du, Stanley, and Yan, and extends results of Klazar to k > 2. Moreover, this correspondence reinforces the links recently discovered by Krattenthaler between fillings of diagrams and the results of Chen et al.     

Congruences Concerning Values of the Modular Functions <Emphasis Type="Italic">j</Emphasis><Subscript><Emphasis Type="Italic">n</Emphasis></Subscript>

The j-function j(z) = q⁻¹+ 744 + 196884q + ⋅s plays an important role in many problems. In [7], Zagier, presented an interesting series of functions obtained from the j-function: j_m(ζ) = (j(ζ) – 744)∨T₀(m), where T₀(m) is the usual m′th normalized weight 0 Hecke operator. In [3], Bruinier et al. show how this series of functions can be used to describe all meromorphic modular forms on SL₂(ℤ). In this note we use these functions and basic notions about modular forms to determine previously unidentified congruence relations between the coefficients of Eisenstein series and the j-function. 2000 Mathematics Subject Classification: Primary–11B50, 11F03, 11F30 The author thanks the National Science Foundation for their generous support.     

<Emphasis Type="Italic">mth</Emphasis>-Root subgeometry partitions

New subgeometry partitions of PG(n − 1, q ^m ) by subgeometries isomorphic to PG(n − 1, q) are constructed.      

On the <Emphasis Type="Italic">k</Emphasis>-gamma <Emphasis Type="Italic">q</Emphasis>-distribution

We provide combinatorial as well as probabilistic interpretations for the q-analogue of the Pochhammer k-symbol introduced by Díaz and Teruel. We introduce q-analogues of the Mellin transform in order to study the q-analogue of the k-gamma distribution.     

The <Emphasis Type="Italic">k</Emphasis>-domatic number of a graph

Let k be a positive integer, and let G be a simple graph with vertex set V (G). A k-dominating set of the graph G is a subset D of V (G) such that every vertex of V (G)-D is adjacent to at least k vertices in D. A k-domatic partition of G is a partition of V (G) into k-dominating sets. The maximum number of dominating sets in a k-domatic partition of G is called the k-domatic number d _k (G). In this paper, we present upper and lower bounds for the k-domatic number, and we establish Nordhaus-Gaddum-type results. Some of our results extend those for the classical domatic number d(G) = d ₁(G).      

Generalized doubling constructions for constant mean curvature hypersurfaces in <Emphasis Type="Italic">S</Emphasis><Superscript><Emphasis Type="Italic">n</Emphasis>+1</Superscript>

The sphere S ⁿ⁺¹ contains a simple family of constant mean curvature (CMC) hypersurfaces of the form C _t : = S ^p (cos t) × S ^q (sin t) for p + q = n and called the generalized Clifford hypersurfaces. This paper demonstrates that new, topologically non-trivial CMC hypersurfaces resembling a pair of neighbouring generalized Clifford tori connected to each other by small catenoidal bridges at a sufficiently symmetric configuration of points can be constructed by perturbative PDE methods. That is, one can create an approximate solution by gluing a rescaled catenoid into the neighbourhood of each point; and then one can show that a perturbation of this approximate hypersurface exists, which satisfies the CMC condition. The results of this paper generalize those of the authors in [3].