English
Related papers

Related papers: Skew Hadamard Difference Sets from Dickson Polynom…

200 papers

Previous surveys by Baumert and Lopez and Sanchez have resolved the existence of cyclic (v,k,lambda) difference sets with k <= 150, except for six open cases. In this paper we show that four of those difference sets do not exist. We also…

Combinatorics · Mathematics 2007-05-23 Leonard D. Baumert , Daniel M. Gordon

Let ${\Bbb F}_q$ be a finite field of order $q.$ We prove that if $d\ge 2$ is even and $E \subset {\Bbb F}_q^d$ with $|E| \ge 9q^{\frac{d}{2}}$ then $$ {\Bbb F}_q=\frac{\Delta(E)}{\Delta(E)}=\left\{ \frac{a}{b}: a \in \Delta(E), b \in…

Classical Analysis and ODEs · Mathematics 2019-05-29 A. Iosevich , D. Koh , H. Parshall

Letting $L_{n}(N, u)$ denote a polylogarithm ladder of weight $n$ and index $N$ with $u$ as an algebraic number, there is a rich history surrounding how mathematical objects of this form can be constructed for a given weight or index. This…

Number Theory · Mathematics 2024-12-03 John M. Campbell

Bent functions, or equivalently, Hadamard difference sets in the elementary Abelian group $(\gf(2^{2m}), +)$, have been employed to construct symmetric and quasi-symmetric designs having the symmetric difference property. The main objective…

Combinatorics · Mathematics 2019-04-26 Cunsheng Ding , Akihiro Munemasa , Vladimir Tonchev

We prove an irreducibility criterion for polynomials of the form $h(x)=x^{2m} + bx^m + c_1 \in F[x]$ relating to the Dickson polynomials of the first kind $D_p$. In the case when $F = \mathbb{Q}$, $m$ is a prime $p>3$, and $c_1=c^p$, for…

Number Theory · Mathematics 2024-01-26 Akash Jim , Thomas Hagedorn

Most integers are composite and most univariate polynomials over a finite field are reducible. The Prime Number Theorem and a classical result of Gau{\ss} count the remaining ones, approximately and exactly. For polynomials in two or more…

Commutative Algebra · Mathematics 2014-07-14 Joachim von zur Gathen , Konstantin Ziegler

A matrix $H=[d_{ij}]$ is a generalized Hadamard matrix of order $u\lambda$ with entries from $U$ which is a finite group of order $u$ (for short $\mathrm{GH}(u,\,\lambda)$) such that whenever $i\neq \ell$ the set $\{d_{ij}d_{\ell…

Combinatorics · Mathematics 2013-09-10 Hiroaki Kido

The paired Hayman's conjecture of different types are considered. More accurately speaking, the zeros of a pair of $f^nL(z,g)-a_1(z)$ and $g^mL(z,f)-a_2(z)$ are characterized using different methods from those previously employed, where $f$…

Complex Variables · Mathematics 2025-05-29 Jianren Long , Xuxu Xiang

For each $\alpha \in \{0,1,-1 \}$, we count diagonally and antidiagonally symmetric alternating sign matrices (DASASMs) of fixed odd order with a maximal number of $\alpha$'s along the diagonal and the antidiagonal, as well as DASASMs of…

Combinatorics · Mathematics 2020-09-11 Arvind Ayyer , Roger E. Behrend , Ilse Fischer

We study the hadronic D meson decays into a pseudoscalar meson $P$ and an even-parity meson $M$, where $M$ represents a scalar meson $S$, an axial-vector meson $A$, or a tensor meson $T$. These decays are first analyzed in the…

High Energy Physics - Phenomenology · Physics 2010-05-12 Hai-Yang Cheng , Cheng-Wei Chiang

Planar functions over finite fields give rise to finite projective planes. They were also used in the constructions of DES-like iterated ciphers, error-correcting codes, and codebooks. They were originally defined only in finite fields with…

Information Theory · Computer Science 2016-09-06 Longjiang Qu

We study the counts of smooth permutations and smooth polynomials over finite fields. For both counts we prove an estimate with an error term that matches the error term found in the integer setting by de Bruijn more than 70 years ago. The…

Combinatorics · Mathematics 2025-01-08 Ofir Gorodetsky

Let $G$ be an additive group of order $v$. A $k$-element subset $D$ of $G$ is called a $(v, k, \lambda, t)$-almost difference set if the expressions $gh^{-1}$, for $g$ and $h$ in $D$, represent $t$ of the non-identity elements in $G$…

Combinatorics · Mathematics 2014-09-02 Kathleen Nowak

Using reversible Hadamard difference sets, we construct symmetric Bush-type Hadamard matrices of order $4m^4$ for all odd integer $m$.

Combinatorics · Mathematics 2007-05-23 Mikhail Muzychuk , Qing Xiang

We show that the set of $m \times m$ complex skew-symmetric matrix polynomials of even grade $d$, i.e., of degree at most $d$, and (normal) rank at most $2r$ is the closure of the single set of matrix polynomials with certain, explicitly…

Representation Theory · Mathematics 2023-12-29 Fernando De Terán , Andrii Dmytryshyn , Froilán M. Dopico

We consider the local analytic behavior for a family of holomorphic differentials on a family of degenerating annuli. Three results and discussion are presented. The first is the normal families Lemma 1. The second is an isomorphism of…

Geometric Topology · Mathematics 2011-11-24 Scott A. Wolpert

Constructions of Hadamard matrices from smaller blocks is a well-known technique in the theory of real Hadamard matrices: tensoring Hadamard matrices and the classical arrays of Williamson, Ito are all procedures involving smaller order…

Operator Algebras · Mathematics 2009-03-03 Ferenc Szöllősi

There are considered differential substitutions of the form $v=P(x,u,u_{x})$ for which there exists a differential operator $H=\sum^{k}_{i=0} \alpha_{i} D^{i}_{x}$ such that the differential substitution maps the equation…

solv-int · Physics 2008-02-03 S. Ya. Startsev

In this study, we consider the three dimensional $\alpha$-fractional nonlinear delay differential system of the form \begin{eqnarray*} D^{\alpha}\left(u(t)\right)&=&p(t)g\left(v(\sigma(t))\right),\\…

Classical Analysis and ODEs · Mathematics 2018-11-01 A. Kilicman , V. Sadhasivam , M. Deepa , N. Nagajothi

We introduce the notion of Universally Decodable Matrices of Genus g (UDMG), which for g=0 reduces to the notion of Universally Decodable Matrices (UDM) introduced in [8]. A UDMG is a set of L matrices over a finite field, each with K rows,…

Information Theory · Computer Science 2013-01-28 Steve Limburg , David Grant , Mahesh K. Varanasi
‹ Prev 1 8 9 10 Next ›