Related papers: Computing discrete logarithms in subfields of resi…
We perform a special number field sieve discrete logarithm computation in a 1024-bit prime field. To our knowledge, this is the first kilobit-sized discrete logarithm computation ever reported for prime fields. This computation took a…
In an important paper, Zagier proved that certain half-integral weight modular forms are generating functions for traces of polynomials in the $j$-function. It turns out that Zagier's work makes it possible to algorithmically compute…
The paper addresses the study and applications of a broad class of extended-real-valued functions, known as optimal value or marginal functions, which are frequently appeared in variational analysis, parametric optimization, and a variety…
A novel basis of discrete analytic polynomials on a rhombic lattice is introduced and the associated convolution product is studied. A class of discrete analytic functions that are rational with respect to this product is also described.
New homotopy invariant finiteness conditions on modules over commutative rings are introduced, and their properties are studied systematically. A number of finiteness results for classical homological invariants like flat dimension,…
We observe algebraic derivations on an affine domain B defined over an algebraically closed field of characteristic 0, which are called locally finite derivations in commutative and non-commutative contexts in other references. We observe…
In this paper, we present a new basis of polynomial over finite fields of characteristic two and then apply it to the encoding/decoding of Reed-Solomon erasure codes. The proposed polynomial basis allows that $h$-point polynomial evaluation…
In this paper we establish decomposition theorems for derivations of group rings. We provide a topological technique for studying derivations of a group ring $A[G]$ in case $G$ has finite conjugacy classes. As a result, we describe all…
We prove a global residual formula in terms of logarithmic indices for one-dimensional holomorphic foliations, with isolated singularities, and logarithmic along normal crossing divisors. We also give a formula for the total sum of the…
The standard mixed finite element approximations of Hodge Laplace problems associated with the de Rham complex are based on proper discrete subcomplexes. As a consequence, the exterior derivatives, which are local operators, are computed…
We present a polynomial-time pseudo-deterministic algorithm for constructing irreducible polynomial of degree $d$ over finite field $\mathbb{F}_q$. A pseudo-deterministic algorithm is allowed to use randomness, but with high probability it…
We give an efficient algorithm for Lang's Theorem in split connected reductive groups defined over finite fields of characteristic greater than 3. This algorithm can be used to construct many important structures in finite groups of Lie…
A well-known generalisation of positional numeration systems is the case where the base is the residue class of $x$ modulo a given polynomial $f(x)$ with coefficients in (for example) the integers, and where we try to construct finite…
We use recurrence relations to derive explicit formulas for counting the number of subgroups of given order (or index) in rank 3 finite abelian p-groups and use these to derive similar formulas in few cases for rank 4. As a consequence, we…
The goal of this note is to bring attention to an interesting family of rings: the rings of $\mathbb Z$-valued functions on $\mathbb Z$ and, more generally, infinite subsets of $\mathbb Z$ whose restrictions to all finite sets are given by…
In a sequence of seminal results in the 80's, Kaltofen showed that the complexity class VP is closed under taking factors. A natural question in this context is to understand if other natural classes of multivariate polynomials, for…
The paper studies constructions of irreducible polynomials over finite fields using polynomial composition method.
We give algorithms for computing the singular moduli of suitable nonholomorphic modular functions F(z). By combining the theory of isogeny volcanoes with a beautiful observation of Masser concerning the nonholomorphic Eisenstein series…
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…
We present and analyze two algorithms for computing the Hilbert class polynomial $H_D$ . The first is a p-adic lifting algorithm for inert primes p in the order of discriminant D < 0. The second is an improved Chinese remainder algorithm…