Related papers: Introducing Ramanujan's Class Polynomials in the G…

A class of bivariate infinite series solutions of the elliptic and hyperbolic Kepler equations is described, adding to the handful of 1-D series that have been found throughout the centuries. This result is based on an iterative procedure…

Let $q$ be a prime power. This paper provides a new class of linear codes that arises from the action of the alternating group on $\mathbb F_q[x_1,\dots,x_m]$ combined with the ideas in (M. Datta and T. Johnsen, 2022). Compared with…

Second-order polynomials generalize classical first-order ones in allowing for additional variables that range over functions rather than values. We are motivated by their applications in higher-order computational complexity theory,…

In this paper we propose a way to construct classical type Sobolev orthogonal polynomials. We consider two families of hypergeometric polynomials: ${}_2 F_2(-n,1;q,r;x)$ and ${}_3 F_2(-n,n-1+a+b,1;a,c;x)$ ($a,b,c,q,r>0$, $n=0,1,...$), which…

For the integer $ D=pq$ of the product of two distinct odd primes, we construct an elliptic curve $E_{2rD}:y^2=x^3-2rDx$ over $\mathbb Q$, where $r$ is a parameter dependent on the classes of $p$ and $q$ modulo 8, and show, under the parity…

We outline a general algorithm for computing an explicit model over a number field of any curve of genus 2 whose (unpolarized) Jacobian is isomorphic to the product of two elliptic curves with CM by the same order in an imaginary quadratic…

Using the theory of Diophantine m-tuples, i.e. sets with the property that the product of its any two distinct elements increased by 1 is a perfect square, we construct an elliptic curve over Q(t) of rank at least 4 with three non-trivial…

For every prime $p \geq 5$, we compute the $p$-th power of the Ramanujan vector field that arises from the differential relations discovered by Ramanujan for the Eisenstein series $E_2,E_4$ and $E_6$. Our method results in explicit…

Let $E/\mathbf{Q}$ be an elliptic curve and $p\geq 3$ be a prime. We prove the $p$-converse theorems for elliptic curves of potentially good ordinary reduction at Eisenstein primes (i.e., such that the residual representation $E[p]$ is…

We provide an algorithm for computing the Euler characteristic of the curves $S_p$ in the space of cubic polynomials, consisting of all polynomials with a periodic critical point of period $p$. The curves were introduced in [Milnor,…

Residue number systems based on pairwise relatively prime moduli are a powerful tool for accelerating integer computations via the Chinese Remainder Theorem. We study a structured family of moduli of the form $2^n - 2^k + 1$, originally…

In this article we provide another method for obtaining explicit formulas yielding counts of secant planes to a projective curve. We formulate the problem in terms of Segre classes of suitable bundles over the symmetric product of the curve…

We investigate polynomials, called m-polynomials, whose generator polynomial has coefficients that can be arranged as a matrix, where q is a positive integer greater than one. Orthogonality relations are established and coefficients are…

Methods of parabolic geometries have been recently used to construct a class of elliptic complexes on quaternionic manifolds, the Salamon's complex being the simplest case. The purpose of this paper is to describe an algorithm how to…

For an elliptic curve $E$ over a finite field $\F_q$, where $q$ is a prime power, we propose new algorithms for testing the supersingularity of $E$. Our algorithms are based on the Polynomial Identity Testing (PIT) problem for the $p$-th…

In pattern classification, polynomial classifiers are well-studied methods as they are capable of generating complex decision surfaces. Unfortunately, the use of multivariate polynomials is limited to kernels as in support vector machines,…

This paper deals with elliptic equations in the plane with degeneracies. The equations are generated by a complex vector field that is elliptic everywhere except along a simple closed curve. Kernels for these equations are constructed.…

New families of maximum distance separable (MDS) codes are constructed from elliptic curves by exploiting their group structures. In contrast to classical constructions based on divisors supported at a single rational point, the proposed…

We investigate two classes of multivariate polynomials with variables indexed by the edges of a uniform hypergraph and coefficients depending on certain patterns of union of edges. These polynomials arise naturally to model job-occupancy in…

A generalisation of the odd Bernoulli polynomials related to the quantum Euler top is introduced and investigated. This is applied to compute the coefficients of the spectral polynomials for the classical Lam\'e operator.