Related papers: Denniston partial difference sets exist in the odd…

In this paper we construct exponentionally many non-isomorphic skew Hadamard difference sets over an elementary abelian group of order $q^3$.

Local M-smoothers are interesting and important signal and image processing techniques with many connections to other methods. In our paper we derive a family of partial differential equations (PDEs) that result in one, two, and three…

Difference sets have been studied for more than 80 years. Techniques from algebraic number theory, group theory, finite geometry, and digital communications engineering have been used to establish constructive and nonexistence results. We…

We obtain sufficient condition for SDEs to evolve in the positive orthant. We use comparison theorem arguments to achieve this. As a result we prove the existence of a unique strong solution for a class of multidimensional degenerate SDEs…

Exceptional points~(EPs) appear as degeneracies in the spectrum of non-Hermitian matrices at which the eigenvectors coalesce. In general, an EP of order $n$ may find room to emerge if $2(n-1)$ real constraints are imposed. Our results show…

We provide the first explicit examples of deformations of higher dimensional quadrics: a straightforward generalization of Peterson's explicit 1-dimensional family of deformations in $\mathbb{C}^3$ of 2-dimensional general quadrics with…

In this paper we consider binary linear codes spanned by incidence matrices of Steiner 2-designs associated with maximal arcs in projective planes of even order, and their dual codes. Upper and lower bounds on the 2-rank of the incidence…

We construct a number of new (v;r,s;lambda) supplementary difference sets (SDS) with v odd and lambda = (r+s)-(v-1)/2. In particular, these give rise to D-optimal matrices of the four new orders 206, 242, 262, 482 constructed here for the…

Complex orthogonal designs (CODs) are used to construct space-time block codes. COD $\mathcal{O}_z$ with parameter $[p, n, k]$ is a $p\times n$ matrix, where nonzero entries are filled by $\pm z_i$ or $\pm z^*_i$, $i = 1, 2,..., k$, such…

Let $p$ be an odd prime number. In this paper, we construct $2(2p-3)$ classes of codes over the ring $R=\Bbb F_p+u\Bbb F_p,u^2=0$, which are associated with down sets. We compute the Lee weight distributions of the $2(2p-3)$ classes of…

A finite set $S \subset \mathbb{Z}$ is a Sidon set if its pairwise differences are distinct. Recall that a perfect difference set (PDS) of order $n$ is a set $B \subset \mathbb{Z}_v$ ($v = n^2 - n + 1$) of size $n$ such that every nonzero…

We consider finite dimensional representations of the dihedral group $D_{2p}$ over an algebraically closed field of characteristic two where $p$ is an odd integer and study the degrees of generating and separating polynomials in the…

We find new constructions of infinite families of skew Hadamard difference sets in elementary abelian groups under the assumption of the existence of cyclotomic strongly regular graphs. Our construction is based on choosing cyclotomic…

A first order expansion of $(\mathbb{R},+,<)$ is dp-minimal if and only if it is o-minimal. We prove analogous results for algebraic closures of finite fields, $p$-adic fields, ordered abelian groups with only finitely many convex subgroups…

Given a $2^N$-dimensional Cayley-Dickson algebra, where $3 \leq N \leq 6$, we first observe that the multiplication table of its imaginary units $e_a$, $1 \leq a \leq 2^N -1$, is encoded in the properties of the projective space PG$(N-1,2)$…

Explicit, unconditionally stable, high-order schemes for the approximation of some first- andsecond-order linear, time-dependent partial differential equations (PDEs) are proposed.The schemes are based on a weak formulation of a…

Let $\mathcal{X}$ be a set of $(h-1)$-dimensional subspaces of $\mathrm{PG}(kh-1,q)$ with the property that every hyperplane contains at most $t$ elements of $\mathcal{X}$. We prove the upper bound $|\mathcal{X}| \leq (t-k+2)q^h + t$, and…

A linear code with parameters $[n, k, n - k + 1]$ is called maximum distance separable (MDS), and one with parameters $[n, k, n - k]$ is called almost MDS (AMDS). A code is near-MDS (NMDS) if both it and its dual are AMDS. NMDS codes…

Binary cyclic codes are worth studying due to their applications and theoretical importance. It is an important problem to construct an infinite family of cyclic codes with large minimum distance $d$ and dual distance $d^{\perp}$. In recent…

In the model of extended non-Abelian tensor gauge fields we have found new metric-independent densities: the exact (2n+3)-forms and their secondary characteristics, the (2n+2)-forms as well as the exact 6n-forms and the corresponding…