A Construction of Difference Sets

In this paper, we will give a construction of a family of -difference sets in thegroup , where q is any power of 2, K is any group with and G is an abelian 2-group of order which contains anelementary abelian subgroup of index 2.     

On the minimum length of some linear codes

We determine the minimum length n _q (k, d) for some linear codes with k ≥ 5 and q ≥ 3. We prove that n _q (k, d) = g _q (k, d) + 1 for when k is odd, for when k is even, and for . This work was supported by the Korea Research Foundation Grant funded by the Korean Government(MOEHRD). (KRF-2005-214-C00175). This research has been partially supported by Grant-in-Aid for Scientific Research of Japan Society for the Promotion of Science under Contract Number 17540129.     

A new family of maximal curves over a finite field

It has been known for a long time that the Deligne–Lusztig curves associated to the algebraic groups of type and defined over the finite field all have the maximum number of -rational points allowed by the Weil “explicit formulas”, and that these curves are -maximal curves over infinitely many algebraic extensions of . Serre showed that an -rational curve which is -covered by an -maximal curve is also -maximal. This has posed the problem of the existence of -maximal curves other than the Deligne–Lusztig curves and their -subcovers, see for instance Garcia (On curves with many rational points over finite fields. In: Finite Fields with Applications to Coding Theory, Cryptography and Related Areas, pp. 152–163. Springer, Berlin, 2002) and Garcia and Stichtenoth (A maximal curve which is not a Galois subcover of the Hermitan curve. Bull. Braz. Math. Soc. (N.S.) 37, 139–152, 2006). In this paper, a positive answer to this problem is obtained. For every q = n ³ with n = p ^r  > 2, p ≥ 2 prime, we give a simple, explicit construction of an -maximal curve that is not -covered by any -maximal Deligne–Lusztig curve. Furthermore, the -automorphism group Aut has size n ³(n ³ + 1)(n ² − 1)(n ² − n + 1). Interestingly, has a very large -automorphism group with respect to its genus . Research supported by the Italian Ministry MURST, Strutture geometriche, combinatoria e loro applicazioni, PRIN 2006–2007.     

A Geometric Construction for Some Ovoids of the Hermitian Surface

Multiple derivation of the classical ovoid of the Hermitian surface of is a well known, powerful method for constructing large families of non classical ovoids of . In this paper, we shall provide a geometric costruction of a family of ovoids amenable to multiple derivation.     

Arithmetic properties of partitions with even parts distinct

In this work, we consider the function ped(n), the number of partitions of an integer n wherein the even parts are distinct (and the odd parts are unrestricted). Our goal is to consider this function from an arithmetical point of view in the spirit of Ramanujan’s congruences for the unrestricted partition function p(n). We prove a number of results for ped(n) including the following: For all n≥0, $$\mathit{ped}(9n+4)\equiv0\pmod{4}$$ and $$\mathit{ped}(9n+7)\equiv0\pmod{12}.$$ Indeed, we compute appropriate generating functions from which we deduce these congruences and find, in particular, the surprising result that $$\sum_{n\geq0}\mathit{ped}(9n+7)q^n=12\frac{ (q^{2};q^{2})_\infty ^{4}(q^{3};q^{3})_\infty ^{6}(q^{4};q^{4})_\infty ^{}}{(q^{};q^{})_\infty ^{11}}.$$ We also show that ped(n) is divisible by 6 at least 1/6 of the time.     

Two new families of <Emphasis Type="Italic">q</Emphasis>-positive integers

Let n,p and k be three non negative integers. We prove that the apparently rational fractions of q:

A new extension theorem for 3-weight modulo q linear codes over $${\mathbb{F}_ q}$$

We prove that every [n, k, d] _q code with q ≥ 4, k ≥ 3, whose weights are congruent to 0, −1 or −2 modulo q and is extendable unless its diversity is for odd q, where .      

High order elements in finite fields arising from recursive towers

Designs, Codes and Cryptography - We illustrate a general technique to construct towers of fields producing high order elements in $$\mathbb {F}_{q^{2^n}}$$ , for odd q, and in $$\mathbb {F}_{2^{2...     

A New Bound on the Number of Designs with Classical Affine Parameters

The hyperplanes in the affine geometry AG(d, q) yield an affineresolvable design with parameters $2 - (q^d ,q^{d - 1} ,\frac{{q^{d - 1} - 1}}{{q - 1}})$ . Jungnickel [3]proved an exponential lower bound on the number of non-isomorphic affine resolvable designs with these parametersfor d ≥ 3. The bound of Jungnickel was improved recently [5] by a factor of $q^{\frac{{d^2 + d - 6}}{2}} (q - 1)^{d - 2}$ for any d ≥ 4. In this paper, a construction of $2 - (q^d ,q^{d - 1} ,\frac{{q^{d - 1} - 1}}{{q - 1}})$ designs based on group divisible designs is given that yieldsat least $$\frac{{\left( {q^{d - 1} + q^{d - 2} + \cdots + 1} \right)!\left( {q - 1} \right)}}{{\left| {{\text{P}}\Gamma {\text{L(}}d,q{\text{)}}} \right|\left| {{\text{A}}\Gamma {\text{L(}}d,q{\text{)}}} \right|}}$$ non-isomorphic designs for any d ≥ 3. This new bound improves the bound of[5] by a factor of $$\frac{1}{{q^d }}\mathop \Pi \limits_{i = 1}^{(q^{d - 1} - q)/(q - 1)} (q^{d - 1} + i).$$ For any given q and d, It was previously known [2,11] that there are at least 8071non-isomorphic 2-(27,9,4) designs. We show that the number of non-isomorphic 2-(27,9,4) is atleast 245,100,000.     

Triangle in a triangle: On a problem of Steinhaus

A necessary and sufficient condition on the sidesp, q, r of a trianglePQR and the sidesa, b, c of a triangleABC in order thatABC contains a congruent copy ofPQR is the following: At least one of the 18 inequalities obtained by cyclic permutation of {a, b, c} and arbitrary permutation of {itp, q, r} in the formula $$\begin{array}{l} Max\{ F(q^2 + r^2 - p^2 ), F'(b^2 + c^2 - a^2 )\} \\ + Max\{ F(p^2 + r^2 - q^2 ), F'(a^2 + c^2 - b^2 )\} \le 2Fcr \\ \end{array}$$ is satisfied. In this formulaF andF′ denote the surface areas of the triangles, i.e. $$\begin{array}{l} F = {\textstyle{1 \over 4}}(2a^2 b^2 + 2b^2 c^2 + 2c^2 a^2 - a^4 - b^4 - c^4 )^{1/2} \\ F' = {\textstyle{1 \over 4}}(2p^2 q^2 + 2q^2 r^2 + 2r^2 p^2 - p^4 - q^4 - r^4 )^{1/2} . \\ \end{array}$$      

On the Andrews–Schur proof of the Rogers–Ramanujan identities

In this article, we study one of Andrews’ proofs of the Rogers–Ramanujan identities published in 1970. His proof inspires connections to some famous formulas discovered by Ramanujan. During the course of study, we discovered identities such as $$\sum_{n\geq0}\frac{q^{n^2}}{(q;q)_n}=\frac{1}{\sqrt{5}}\Biggl(\beta \prod_{n=1}^{\infty}\frac{1}{1+\alpha q^{n/5}+q^{2n/5}}-\alpha \prod_{n=1}^{\infty}\frac{1}{1+\beta q^{n/5}+q^{2n/5}}\Biggr),$$ where β=?1/α is the Golden Ratio.     

Elements of Prescribed Order,Prescribed Traces and Systems of Rational Functions Over Finite Fields

Let k 1 and be a system of rational functions forming a strongly linearly independent set over a finite field . Let be arbitrarily prescribed elements. We prove that for all sufficiently large extensions , there is an element of prescribed order such that is the relative trace map from onto We give some applications to BCH codes, finite field arithmetic and ordered orthogonal arrays. We also solve a question of Helleseth et~al. (Hypercubic 4 and 5-designs from Double-Error-Correcting codes, Des. Codes. Cryptgr. 28(2003). pp. 265–282) completely.classification 11T30, 11G20, 05B15     

Binomial permutations over finite fields with even characteristic

Designs, Codes and Cryptography - In this paper, we study binomials having the form $$x^r(a+x^{3(q-1)})$$ over the finite field $$\mathbb {F}_{q^2}$$ with $$q=2^m$$ , and determine all the...     

Small weight codewords in LDPC codes defined by (dual) classical generalized quadrangles

We find lower bounds on the minimum distance and characterize codewords of small weight in low-density parity check (LDPC) codes defined by (dual) classical generalized quadrangles. We analyze the geometry of the non-singular parabolic quadric in PG(4,q) to find information about the LDPC codes defined by Q (4,q), and . For , and , we are able to describe small weight codewords geometrically. For , q odd, and for , we improve the best known lower bounds on the minimum distance, again only using geometric arguments. Similar results are also presented for the LDPC codes LU(3,q) given in [Kim, (2004) IEEE Trans. Inform. Theory, Vol. 50: 2378–2388]     

Level 17 Ramanujan–Sato series

The Ramanujan Journal - Two level 17 modular functions $$\begin{aligned} r = q^2 \prod _{n=1}^{\infty } (1-q^{n})^{\left( \frac{n}{17} \right) },\qquad s = q^{2} \prod _{n=1}^{\infty } \frac{(1 -...     

Some constructions on the Hermitian surface

In the geometric setting of commuting orthogonal and unitary polarities we construct an infinite family of complete (q + 1)²–spans of the Hermitian surface , q odd. A construction of an infinite family of minimal blocking sets of , q odd, admitting PSL ₂(q), is also provided.      

Some Lambert Series Expansions of Products of Theta Functions

Let q be a complex number satisfying |q| < 1. The theta function (q) is defined by (q) = . Ramanujan has given a number of Lambert series expansions such as

Classification of permutation polynomials of the form $$x^3g(x^{q-1})$$ x 3 g ( x q - 1 ) of $${\mathbb F}_{q^2}$$ F q 2 where $$g(x)=x^3+bx+c$$ g ( x ) = x 3 + b x + c and $$b,c \in {\mathbb F}_q^*$$ b,c ∈ F q ∗

Designs, Codes and Cryptography - We classify all permutation polynomials of the form $$x^3g(x^{q-1})$$ of $${\mathbb F}_{q^2}$$ where $$g(x)=x^3+bx+c$$ and $$b,c \in {\mathbb F}_q^*$$ . Moreover...     

Linear Independence of Values of a Certain Lambert Series

Let K be or an imaginary quadratic number field, and q K an integer with |q| > 1. We give a quantitative version of the linear independence over K of the three numbers 1, , and an equivalent power series version. We also mention several open problems. Received: February 5, 2007. Revised: April 18, 2007.     

On 3-regular partitions with odd parts distinct

We consider \(\text {pod}_3(n)\), the number of 3-regular partitions with odd parts distinct, whose generating function is

$$\begin{aligned} \sum _{n\ge 0}\text {pod}_3(n)q^n=\frac{(-q;q^2)_\infty (q^6;q^6)_\infty }{(q^2;q^2)_\infty (-q^3;q^3)_\infty }=\frac{\psi (-q^3)}{\psi (-q)}, \end{aligned}$$

where

$$\begin{aligned} \psi (q)=\sum _{n\ge 0}q^{(n^2+n)/2}=\sum _{-\infty }^\infty q^{2n^2+n}. \end{aligned}$$

For each \(\alpha >0\), we obtain the generating function for

$$\begin{aligned} \sum _{n\ge 0}\text {pod}_3\left( 3^{\alpha }n+\delta _\alpha \right) q^n, \end{aligned}$$

where \(4\delta _\alpha \equiv {-1}\pmod {3^{\alpha }}\) if \(\alpha \) is even, \(4\delta _\alpha \equiv {-1}\pmod {3^{\alpha +1}}\) if \(\alpha \) is odd.

We show that the sequence {\(\text {pod}_3(n)\)} satisfies the internal congruences

$$\begin{aligned} \text {pod}_3(9n+2)\equiv \text {pod}_3(n)\pmod 9, \end{aligned}$$

(0.1)

$$\begin{aligned} \text {pod}_3(27n+20)\equiv \text {pod}_3(3n+2)\pmod {27} \end{aligned}$$

(0.2)

and

$$\begin{aligned} \text {pod}_3(243n+182)\equiv \text {pod}_3(27n+20)\pmod {81}. \end{aligned}$$

(0.3)