Related papers: Redefining Euler-Rabinowitsch Polynomials with Hee…

Let $f(x)=x^n+ax^2+bx+c \in \Z[x]$ be an irreducible polynomial with $b^2=4ac$ and let $K=\Q(\theta)$ be an algebraic number field defined by a complex root $\theta$ of $f(x)$. Let $\Z_K$ deonote the ring of algebraic integers of $K$. The…

In this paper, we construct a new family of q-Hermite polynomials denoted by Hn(x,s|q). Main properties and relations are established and proved. In addition, is deduced a sequence of novel polynomials, Ln(. ,.|q), which appear to be…

Let $K=\mathbb{Q}(\omega)$ with $\omega$ the root of a degree $n$ monic irreducible polynomial $f\in\mathbb{Z}[X]$. We show the degree $n$ polynomial $N(\sum_{i=1}^{n-k}x_i\omega^{i-1})$ in $n-k$ variables formed by setting the final $k$…

In this paper we study those polynomials orthogonal with respect to a particular weight over the union of disjoint intervals first introduced by N.I. Akhiezer, via a reformulation as a matrix factorization or Riemann-Hilbert problem. This…

Let K be a (commutative) field and consider a nonzero element q in K which is not a root of unity. Goodearl and Lenagan have shown that the number of H-primes in the algebra R of m times p quantum matrices which contain all (t+1) times…

We introduce several notions of `random fewnomials', i.e. random polynomials with a fixed number f of monomials of degree N. The f exponents are chosen at random and then the coefficients are chosen to be Gaussian random, mainly from the…

This work formalizes efficient Fast Fourier-based multiplication algorithms for polynomials in quotient rings such as $\mathbb{Z}_{m}[x]/\left<x^{n}-a\right>$, with $n$ a power of 2 and $m$ a non necessarily prime integer. We also present a…

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…

Let $\mathcal{A}'$ be the set of integers missing any three fixed digits from their decimal expansion. We produce primes in a thin sequence by proving an asymptotic formula for counting primes of the form $p = m^2 + \ell^2$, with $\ell \in…

Consider the set $\mathcal{K}$ of integers $k$ for which there are infinitely many primes $p$ such that $p+k$ is a power of $2$. The aim of this paper is to show a relationship between $\mathcal{K}$ and the limits points of some set…

For a fixed quadratic irreducible polynomial $f$ with no fixed prime factors at prime arguments, we prove that there exist infinitely many primes $p$ such that $f(p)$ has at most 4 prime factors, improving a classical result of Richert who…

Let $E$ be a rational elliptic curve, and $K$ be an imaginary quadratic field. In this article we give a method to construct Heegner points when $E$ has a prime bigger than $3$ of additive reduction ramifying in the field $K$. The ideas…

We associate a graded monoidal supercategory $\mathcal{H}\mathit{eis}_{F,k}$ to every graded Frobenius superalgebra $F$ and integer $k$. These categories, which categorify a broad range of lattice Heisenberg algebras, recover many…

The classical Eulerian polynomials can be expanded in the basis $t^{k-1}(1+t)^{n+1-2k}$ ($1\leq k\leq\lfloor (n+1)/2\rfloor$) with positive integral coefficients. This formula implies both the symmetry and the unimodality of the Eulerian…

Every symplectic spread of PG(3,q), or equivalently every ovoid of Q(4,q), is shown to give rise to a certain family of permutation polynomials of GF(q) and conversely. This leads to an algebraic proof of the existence of the Tits-Luneburg…

In this paper we define a two-variable, generic Hecke algebra, H, for each complex reflection group G(b,1,n). The algebra H specializes to the group algebra of G(b,1,n) and also to an endomorphism algebra of a representation of GL(n,q)…

This paper presents new formulae for the harmonic numbers of order $k$, $H_{k}(n)$, and for the partial sums of two Fourier series associated with them, denoted here by $C^m_{k}(n)$ and $S^m_{k}(n)$. I believe this new formula for…

In his paper Almost-Primes Represented by Quadratic Polynomials, Iwaniec proved that the polynomial n^2 + 1 takes on values with at most two prime factors (counted with multiplicity) infinitely often. He states that "in order to avoid…

We present a prime-generating polynomial $(1+2n)(p -2n) + 2$ where $p>2$ is a lower member of a pair of twin primes less than $41$ and the integer $n$ is such that $\: \frac {1-p}{2} < n < p-1$.

In this study we introduce a second type of higher order generalised geometric polynomials. This we achieve by examining the generalised stirling numbers $S(n; k;\alpha;\beta;\gamma)$ [Hsu & Shiue,1998] for some negative arguments. We study…