Related papers: Algorithms for computing norms and characteristic …

This note concerns the theoretical algorithmic problem of counting rational points on curves over finite fields. It explicates how the algorithmic scheme introduced by Schoof and generalized by the author yields an algorithm whose running…

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…

Univariate polynomial root-finding is a classical subject, still important for modern computing. Frequently one seeks just the real roots of a polynomial with real coefficients. They can be approximated at a low computational cost if the…

We present an algorithm to solve a system of diagonal polynomial equations over finite fields when the number of variables is greater than some fixed polynomial of the number of equations whose degree depends only on the degree of the…

Fewnomial theory began with explicit bounds -- solely in terms of the number of variables and monomial terms -- on the number of real roots of systems of polynomial equations. Here we take the next logical step of investigating the…

We provide explicit bounds on the difference of heights of isogenous Drinfeld modules. We derive a finiteness result in isogeny classes. In the rank 2 case, we also obtain an explicit upper bound on the size of the coefficients of modular…

Multiplication of polynomials is among key operations in computer algebra which plays important roles in developing techniques for other commonly used polynomial operations such as division, evaluation/interpolation, and factorization. In…

In classical invariant theory, the Gr\"obner base of the ideal of syzygies and the normal forms of polynomials of invariants are two core contents. To improve the performance of invariant theory in symbolic computing of classical geometry,…

We describe a simple algorithm for computing the canonical basis of any irreducible finite-dimensional $U_{q}(so_{2n+1})$ or $U_{q}(so_{2n})$-module.

Let $R$ be a standard graded algebra over an $F$-finite field of characteristic $p > 0$. Let $\phi:R\to R$ be the Frobenius endomorphism. For each finitely generated graded $R$-module $M$, let ${}^{\phi}\!M$ be the abelian group $M$ with…

We develop filtered-graded techniques for algebras in monoidal categories with the main goal of establishing a categorical version of Bongale's 1967 result: A filtered deformation of a Frobenius algebra over a field is Frobenius as well.…

Drinfeld orbifold algebras deform skew group algebras in polynomial degree at most one and hence encompass graded Hecke algebras, and in particular symplectic reflection algebras and rational Cherednik algebras. We introduce parametrized…

We present algorithms for the group independent reduction of group theory factors of Feynman diagrams. We also give formulas and values for a large number of group invariants in which the group theory factors are expressed. This includes…

In the first part of this paper we present explicit formulas for primitive idempotents in arbitrary Frobenius algebras using the entries of representing matrices coming from projective indecomposable modules with respect to a certain choice…

$\Phi $ be a Drinfeld $\mathbf{F}\_{q}[T]$-module of rank 2, over a finite field $L$. Let $P\_{\Phi}(X)=$ $X^{2}-cX+\mu P^{m}$ ($c$ an element of $\mathbf{F}\_{q}[T],$ $\mu $ be a non-vanishing element of $% \mathbf{F}\_{q}$, $m$ the degree…

Let $f, f_1, \ldots, f_\nV$ be polynomials with rational coefficients in the indeterminates $\bfX=X_1, \ldots, X_n$ of maximum degree $D$ and $V$ be the set of common complex solutions of $\F=(f_1,\ldots, f_\nV)$. We give an algorithm…

In the present paper we derive complicated families of orthogonal polynomials in one variable from scratch using the known ones as building blocks. We recall the basics of operational formalism and introduce the notations we use throughout…

We study the graded polynomial identities with a homogeneous involution on the algebra of upper triangular matrices endowed with a fine group grading. We compute their polynomial identities and a basis of the relatively free algebra,…

In this paper, we construct a family of Bernstein functions using a class of rational parametrization. The new family of rational Bernstein basis on an index $\alpha \in {\left(-\infty \, , \, 0 \right)}\cup {\left(1 \, , \,…

The Frobenius companion matrix, and more recently the Fiedler companion matrices, have been used to provide lower and upper bounds on the modulus of any root of a polynomial $p(x)$. In this paper we explore new bounds obtained from taking…