Related papers: Computing Congruences of Modular Forms and Galois …

Expansive polynomials (whose roots are greater than 1 in modulus) often arise in dynamical systems and other computational problems. This paper examines the expansivity gap (the gap between 1 and the smallest modulus of the roots) of these…

Given a polynomial $f(x_1,x_2,\ldots, x_t)$ in $t$ variables with integer coefficients and a positive integer $n$, let $\alpha(n)$ be the number of integers $0\leq a<n$ such that the polynomial congruence $f(x_1, x_2, \ldots, x_t)\equiv a\…

Prunescu and Sauras-Altuzarra showed that all C-recursive sequences of natural numbers have an arithmetic div-mod representation that can be derived from their generating function. This representation consists of computing the quotient of…

We study the weight part of (a generalisation of) Serre's conjecture for mod l Galois representations associated to automorphic representations on rank two unitary groups for odd primes l. We propose a conjectural set of Serre weights,…

In this article we study the combinatorics of congruence subgroups of the modular group. We consider the notion of minimal monomial solutions. These are the solutions of a matrix equation (also appearing in the study of Coxeter friezes),…

Fix m >= 1 and let E be an elliptic curve over Q with complex multiplication. We formulate conjectures on the density of primes p (congruent to one modulo m) for which the pth Fourier coefficient of E is an mth power modulo p; often these…

We give formulas for the number of polynomials over a finite field with given root multiplicities, in particular in cases when the formula is surprisingly simple (a power of q). Besides this concrete interpretation, we also prove an…

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…

We present the geometry lying behind counting twin prime polynomials in $\mathbb{F}_q[T]$ in general. We compute cohomology and explicitly count points by means of a twisted Lefschetz trace formula applied to these parametrizing varieties…

We determine the ring structure of Siegel modular forms of degree g modulo a prime p, extending Nagaoka's result in the case of degree g=2. We characterize U(p) congruences of Jacobi forms and Siegel modular forms, and surprisingly find…

We prove very general index formulae for integral Galois modules, specifically for units in rings of integers of number fields, for higher K-groups of rings of integers, and for Mordell-Weil groups of elliptic curves over number fields.…

We study counting functions of planar polygons arising from homological mirror symmetry of elliptic curves. We first analyze the signature and rationality of the quadratic forms corresponding to the signed areas of planar polygons. Then we…

We establish an isomorphism between certain complex-valued and vector-valued modular form spaces of half-integral weight, generalizing the well-known isomorphism between modular forms for $\Gamma_0(4)$ with Kohnen's plus condition and…

For coprime positive integers $q$ and $e$, let $m(q,e)$ denote the least positive integer $t$ such that there exists a sum of $t$ powers of $q$ which is divisible by $e$. We prove an upper bound for $m(q.e)$ and investigate the case where…

In this paper I consider all possible properties from commutative algebra for polynomial composites and monoid domains. The aim is full characterization of these structures. I start with the examination of group, ring, modules properties,…

The congruence subgroup property is established for the modular representations associated to any modular tensor category. This result is used to prove that the kernel of the representation of the modular group on the conformal blocks of…

We obtain new recurrence relations, an explicit formula, and convolution identities for higher order geometric polynomials. These relations generalize known results for geometric polynomials, and lead to congruences for higher order…

Many combinatorial sequences (for example, the Catalan and Motzkin numbers) may be expressed as the constant term of $P(x)^k Q(x)$, for some Laurent polynomials $P(x)$ and $Q(x)$ in the variable $x$ with integer coefficients. Denoting such…

Given a prime number $p$, the study of divisibility properties of a sequence $c(n)$ has two contending approaches: $p$-adic valuations and superconcongruences. The former searches for the highest power of $p$ dividing $c(n)$, for each $n$;…

We investigate certain finiteness questions that arise naturally when studying approximations modulo prime powers of p-adic Galois representations coming from modular forms. We link these finiteness statements with a question by K. Buzzard…