English
Related papers

Related papers: On modular representations of C-recursive integer …

200 papers

Previous work showed that, for $\nu_2(n)$ the number of partitions of $n$ into exactly two part sizes, one has $\nu_2(16n + 14) \equiv 0 \pmod{4}$. The earlier proof required the technology of modular forms, and a combinatorial proof was…

Combinatorics · Mathematics 2025-07-21 Eli R. DeWitt , William J. Keith

Let $f(x)\in\mathbb{Z}[x]$ be a nonconstant polynomial. Let $n, k$ and $c$ be integers such that $n\ge 1$ and $k\ge 2$. An integer $a$ is called an $f$-exunit in the ring $\mathbb{Z}_n$ of residue classes modulo $n$ if $\gcd(f(a),n)=1$. In…

Number Theory · Mathematics 2021-08-03 Junyong Zhao , Shaofang Hong , Chaoxi Zhu

Concave compositions are ordered partitions whose parts are decreasing towards a central part. We study the distribution modulo $a$ of the number of concave compositions. Let $c(n)$ be the number of concave compositions of $n$ having even…

Number Theory · Mathematics 2014-07-07 Keenan Monks , Lynnelle Ye

For any relatively prime integers $r$ and $s$, let $a_{r,s}(n)$ denote the number of $(r,s)$-regular partitions of a positive integer of $n$ into distinct parts. Prasad and Prasad (2018) proved many infinite families of congruences modulo 2…

Number Theory · Mathematics 2021-07-01 Rinchin Drema , Nipen Saikia

We have designed a new symbolic-numeric strategy to compute efficiently and accurately floating point Puiseux series defined by a bivariate polynomial over an algebraic number field. In essence, computations modulo a well chosen prime $p$…

Symbolic Computation · Computer Science 2008-03-21 Adrien Poteaux , Marc Rybowicz

This paper uses previous results of the authors on vector-valued modular forms to study certain non-congruence modular forms. We prove that these forms have unbounded denominators, and in certain cases we verify congruences of…

Number Theory · Mathematics 2015-03-23 Cameron Franc , Geoffrey Mason

The notion of 'bifurcating continued fractions' is introduced. Two coupled sequences of non-negative integers are obtained from an ordered pair of positive real numbers in a manner that generalizes the notion of continued fractions. These…

General Mathematics · Mathematics 2007-05-23 Ashok Kumar Gupta , Ashok Kumar Mittal

Let $p$ be a large prime number. We prove that any integer $\lambda$ modulo $p$ can be represented in the form $$ m!n! +\sum_{i=1}^{47}n_i!\equiv \lambda \pmod p, $$ with $\max\{m,n,n_1,\ldots,n_{47}\}\ll p^{1300/1301}.$ This improves the…

Number Theory · Mathematics 2025-09-01 Moubariz Z. Garaev , Julio C. Pardo

Recently, Hirschhorn and Sellers defined the partition function $a_r(n)$, which counts the number of partitions of $n$ wherein even parts come in only one color, while the odd parts may appear in one of $r$-colors for fixed $r\ge1$. The aim…

Number Theory · Mathematics 2025-11-19 M. P. Thejitha , S. N. Fathima

We compute modular Galois representations associated with a newform $f$, and study the related problem of computing the coefficients of $f$ modulo a small prime $\ell$. To this end, we design a practical variant of the complex…

Number Theory · Mathematics 2013-06-13 Nicolas Mascot

We prove that every odd semisimple reducible (2-dimensional) mod l Galois representation arises from a cuspidal eigenform. In addition, we investigate the possible different types (level, weight, character) of such a modular form. When the…

Number Theory · Mathematics 2017-04-13 Nicolas Billerey , Ricardo Menares

Polynomially-recursive sequences generally have a periodic behavior mod $m$. In this paper, we analyze the period mod $m$ of a second order polynomially-recursive sequence. The problem originally comes from an enumeration of avoiding…

Number Theory · Mathematics 2019-03-07 Cyril Banderier , Florian Luca

Let $F$ be a non-Archimedean locally compact field of residue characteristic $p$, $G$ be an inner form of $GL_n(F)$, $n\ge1$, and $\ell$ be a prime number different from $p$. We give a numerical criterion for an integral $\ell$-adic…

Representation Theory · Mathematics 2015-07-10 Vincent Sécherre

In deduction modulo, a theory is not represented by a set of axioms but by a congruence on propositions modulo which the inference rules of standard deductive systems---such as for instance natural deduction---are applied. Therefore, the…

Logic in Computer Science · Computer Science 2019-03-14 Guillaume Burel

We observe structure in the sequences of quotients and remainders of the Euclidean algorithm with two families of inputs. Analyzing the remainders, we obtain new algorithms for computing modular inverses and representating prime numbers by…

Number Theory · Mathematics 2017-04-05 Christina Doran , Shen Lu , Barry R. Smith

We study modular Galois representations mod $p^m$. We show that there are three progressively weaker notions of modularity for a Galois representation mod $p^m$: we have named these `strongly', `weakly', and `dc-weakly' modular. Here, `dc'…

Number Theory · Mathematics 2012-05-28 Imin Chen , Ian Kiming , Gabor Wiese

For a composite $n$ and an odd $c$ with $c$ not dividing $n$, the number of solutions to the equation $n+a\equiv b\mod c$ with $a,b$ quadratic residues modulus $c$ is calculated. We establish a direct relation with those modular solutions…

Number Theory · Mathematics 2020-04-17 Juan Di Mauro

A thorough analysis is made of the Fourier coefficients for vector-valued modular forms associated to three-dimensional irreducible representations of the modular group. In particular, the following statement is verified for all but a…

Number Theory · Mathematics 2015-04-01 Christopher Marks

Let $\ell \geq 5$ be a prime, and let $\nu_\eta$ denote the Dedekind eta multiplier. For an odd integer $r$, and a real Dirichlet character $\psi$, recent work of Ahlgren, Andersen, and the author showed that quadratic congruences modulo…

Number Theory · Mathematics 2026-03-10 Robert Dicks

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$;…

Number Theory · Mathematics 2015-06-30 Tewodros Amdeberhan , Roberto Tauraso