English
Related papers

Related papers: Extended Irreducible Binary Sextic Goppa codes

200 papers

We show that the number of integer solutions for a pair of bilinear equations in at least 2*6 variables has (up to logarithms) the expected upper bound unless there is a structural reason why it is not the case.

Number Theory · Mathematics 2014-12-12 Eugen Keil

In this note I give a formula for calculating the number of orbits of irreducible binary forms of degree $n$ over GF$(p)$ under the action of GL$(2,p)$. This formula has applications to the classification of class two groups of exponent $p$…

Group Theory · Mathematics 2017-05-23 Michael Vaughan-Lee

We enumerate the number of complex irreducible representations of each degree of general unitary groups of degree 4 over principal ideal rings of length 2.

Representation Theory · Mathematics 2016-02-15 Matthew Levy

Let $F$ be a non-negatively graded free module over a polynomial ring $\mathbb{K}[x_1,\dots,x_n]$ generated by $m$ basis elements. Let $M$ be a submodule of $F$ generated by elements in $F$ with degrees bounded by $D$ and dim $F/M$=$r$. We…

Commutative Algebra · Mathematics 2022-04-22 Yihui Liang

Up to linear transformations, we obtain a classification of permutation polynomials (PPs) of degree $8$ over $\mathbb{F}_{2^r}$ with $r>3$. By [J. Number Theory 176 (2017) 466-66], a polynomial $f$ of degree $8$ over $\mathbb{F}_{2^r}$ is…

Number Theory · Mathematics 2020-03-17 Xiang Fan

An identifying code $C$ of a graph $G$ is a dominating set of $G$ such that any two distinct vertices of $G$ have distinct closed neighbourhoods within $C$. These codes have been widely studied for over two decades. We give an improvement…

Combinatorics · Mathematics 2022-11-14 Florent Foucaud , Tuomo Lehtilä

In this paper, we show that for each $n\geq 1$, the generalised Hermite-Laguerre Polynomials $G_{\frac{1}{4}}$ and $G_{\frac{3}{4}}$ are either irreducible or linear polynomial times an irreducible polynomial of degree $n-1$.

Number Theory · Mathematics 2013-06-05 Shanta Laishram , T. N. Shorey

We present three proofs of an observation of Ahmadi on the number of irreducible polynomials over $\text{GF}(2)$ with certain traces and cotraces, the most interesting of which uses an explicit natural bijection. We also present two proofs…

Combinatorics · Mathematics 2023-02-24 Robert Granger

We present two families of numerical semigroups and show that for each family, the number of required components in an irreducible decomposition cannot be bounded by any given integer. This gives a negative answer to a question raised by…

Commutative Algebra · Mathematics 2024-05-21 Tristram Bogart , Seyed Amin Seyed Fakhari

Let $m\geq 1$ and $a_m$ be integers. Let $\alpha$ be a rational number which is not a negative integer such that $\alpha = \frac{u}{v}$ with $\gcd(u,v) = 1, v>0$. Let $\phi(x)$ belonging to $\Z[x]$ be a monic polynomial which is irreducible…

Number Theory · Mathematics 2023-06-13 Anuj Jakhar , Srinivas Kotyada , Arunabha Mukhopadhyay

For a large prime $p$, and a polynomial $f$ over a finite field $F_p$ of $p$ elements, we obtain a lower bound on the size of the multiplicative subgroup of $F_p^*$ containing $H\ge 1$ consecutive values $f(x)$, $x = u+1, \ldots, u+H$,…

Number Theory · Mathematics 2014-01-28 Igor E. Shparlinski

Motivated by a question of van der Poorten about the existence of infinite chain of prime numbers (with respect to some base), in this paper we advance the study of sequences of consecutive polynomials whose coefficients are chosen…

Number Theory · Mathematics 2018-05-24 Domingo Gómez-Pérez , Alina Ostafe , Min Sha

Let $\Gamma$ denote a $Q$-polynomial distance-regular graph with diameter $D$ and valency $k \ge 3$. In [Homotopy in $Q$-polynomial distance-regular graphs, Discrete Math., {\bf 223} (2000), 189-206], H. Lewis showed that the girth of…

Combinatorics · Mathematics 2025-01-27 Štefko Miklavič

In this paper we consider in detail the composition of an irreducible polynomial with X^2 and suggest a recurrent construction of irreducible polynomials of fixed degree over finite fields of odd characteristics. More precisely, given an…

Number Theory · Mathematics 2020-08-26 Gohar M. Kyureghyan , Melsik K. Kyureghyan

For a rational $q=u+\frac{\alpha}{d}$ with $u, \alpha, d\in \ACOBZ$ with $u\ge 0, 1\le \alpha<d$, $\gcd(\alpha, d)=1$, the \emph{generalized Hermite-Laguerre polynomials $G_q(x)$} are defined by \begin{align*} G_q(x)&=a_nx^n+a_{n-1}(\alpha…

Number Theory · Mathematics 2013-06-05 Shanta Laishram , T. N. Shorey

We obtain new bounds of exponential sums modulo a prime $p$ with binomials $ax^k + bx^n$. In particular, for $k=1$, we improve the bound of Karatsuba (1967) from $O(n^{1/4} p^{3/4})$ to $O\left(p^{3/4} + n^{1/3}p^{2/3}\right)$ for any $n$,…

Number Theory · Mathematics 2018-11-05 Igor E. Shparlinski , Jose Felipe Voloch

We address some questions concerning indecomposable polynomials and their behaviour under specialization. For instance we give a bound on a prime $p$ for the reduction modulo $p$ of an indecomposable polynomial $P(x)\in \Zz[x]$ to remain…

Commutative Algebra · Mathematics 2014-02-26 Arnaud Bodin , Guillaume Chéze , Pierre Débes

We provide upper bounds on the density of a symmetric generalized arithmetic progression lacking nonzero elements of the form h(n) for natural numbers n, or h(p) with p prime, for appropriate polynomials h with integer coefficients. The…

Number Theory · Mathematics 2015-07-10 Ernie Croot , Neil Lyall , Alex Rice

Let $p$ be a prime, and let $f(x)$ be an integer-valued polynomial. By a combinatorial approach, we obtain a nontrivial lower bound of the $p$-adic order of the sum $$\sum_{k=r(mod p^{\beta})}\binom{n}{k}(-1)^k f([(k-r)/p^{\alpha}]),$$…

Number Theory · Mathematics 2015-06-26 Zhi-Wei Sun

We prove that the moduli space ${\mathcal A}_{g,\Gamma_0(p)}\otimes \bar {\mathbb F}_p$ of principally polarized abelian varieties of dimension $g$ with a $\Gamma_0(p)$-level structure in characteristic $p$ has $2^g$ irreducible…

Number Theory · Mathematics 2007-05-23 Chia-Fu Yu