Related papers: Computing discrete logarithms in subfields of resi…

It is well-known that the existence of more than two ends in the sense of J.R. Stallings for a finitely generated discrete group $G$ can be detected on the cohomology group $\mathrm{H}^1(G,R[G])$, where $R$ is either a finite field, the…

We prove that the most natural low-degree test for polynomials over finite fields is ``robust'' in the high-error regime for linear-sized fields. Specifically we consider the ``local'' agreement of a function $f: \mathbb{F}_q^m \to…

Logarithmic differential forms and logarithmic vector fields associated to a hypersurface with an isolated singularity are considered in the context of computational complex analysis. As applications, based on the concept of torsion…

We present an algorithm to compute the annihilator of (i.e., the linear differential equations for) the logarithm of a polynomial in the ring of differential operators with polynomial coefficients. The algorithm consists of differentiation…

Let $(G_n(x))_{n=0}^\infty$ be a $d$-th order linear recurrence sequence having polynomial characteristic roots, one of which has degree strictly greater than the others. Moreover, let $m\geq 2$ be a given integer. We ask for…

We reveal a complexity chasm, separating the trinomial and tetranomial cases, for solving univariate sparse polynomial equations over certain local fields. First, for any fixed field $K\in\{\mathbb{Q}_2,\mathbb{Q}_3,\mathbb{Q}_5,\ldots\}$,…

The functional decomposition of polynomials has been a topic of great interest and importance in pure and computer algebra and their applications. The structure of compositions of (suitably normalized) polynomials f=g(h) over finite fields…

We obtain several results on the computation of different and discriminant ideals of finite extensions of local fields. As an application, we deduce routines to compute the $\p$-adic valuation of the discriminant $\dsc(f)$, and the…

At present, deep learning based methods are being employed to resolve the computational challenges of high-dimensional partial differential equations (PDEs). But the computation of the high order derivatives of neural networks is costly,…

Discrete approximations to the equation \begin{equation*} L_{cont}u = u^{(4)} + D(x) u^{(3)} + A(x) u^{(2)} + (A'(x)+H(x)) u^{(1)} + B(x) u = f, \; x\in[0,1] \end{equation*} are considered. This is an extension of the Sturm-Liouville case…

This paper addresses an investigation on a factorization method for difference equations. It is proved that some classes of second order linear difference operators, acting in Hilbert spaces, can be factorized using a pair of mutually…

A general method for constructing logarithmic modules in vertex operator algebra theory is presented. By utilizing this approach, we give explicit vertex operator construction of certain indecomposable and logarithmic modules for the…

In this article, we propose a few sufficient conditions on polynomials having integer coefficients all of whose zeros lie outside a closed disc centered at the origin in the complex plane and deduce the irreducibility over the ring of…

Let $\mathcal{R} = \mathbb{K}[x_1, \dots, x_n]$ be a multivariate polynomial ring over a field $\mathbb{K}$ of characteristic 0. Consider $n$ algebraically independent elements $g_1, \dots, g_n$ in $\mathcal{R}$. Let $\mathcal{S}$ denote…

Let $\mathbb{F}_q[T]$ be the polynomial ring over a finite field $\mathbb{F}_q$. We study the endomorphism rings of Drinfeld $\mathbb{F}_q[T]$-modules of arbitrary rank over finite fields. We compare the endomorphism rings to their subrings…

In this paper, we introduce a new family of codes relevent for rank and sum-rank metrics. These codes are based on an effective Chinese remainders theorem for linearized polynomials over finite fields. We propose a decoding algorithm for…

Given a polynomial with integral coefficients, one can inquire about the possible residues it can take in its image modulo a prime $p$. The sum over the distinct residues can sometimes be computed independent of the prime $p$; for example,…

As a localizing invariant, THH participates in localization sequences of cyclotomic spectra. We resolve a conjecture of Rognes by relating these to residue sequences in logarithmic THH. Consequently, logarithmic THH, TR, and TC serve as…

It is well known that the repeated square and multiply algorithm is an efficient way of modular exponentiation. The obvious question to ask is if this algorithm has an inverse which would calculate the discrete logarithm efficiently. The…

Let G be a finite group of complex n by n unitary matrices generated by reflections acting on C^n. Let R be the ring of invariant polynomials, and \chi be a multiplicative character of G. Let \Omega^\chi be the R-module of \chi-invariant…