English
Related papers

Related papers: A method for determining the mod-$2^k$ behaviour o…

200 papers

The Catalan number sequence is one of the most famous number sequences in combinatorics and is well studied in the literature. In this paper we further investigate its fundamental properties related to the moment problem and prove for the…

Combinatorics · Mathematics 2018-07-02 Gwo Dong Lin

We find a new approach to computing the remainder of a polynomial modulo $x^n-1$; such a computation is called modular enumeration. Given a polynomial with coefficients from a commutative $\mathbb{Q}$-algebra, our first main result…

Combinatorics · Mathematics 2014-03-06 William Kuszmaul

For all odd primes N up to 500000, we compute the action of the Hecke operator T_2 on the space S_2(Gamma_0(N), Q) and determine whether or not the reduction mod 2 (with respect to a suitable basis) has 0 and/or 1 as eigenvalues. We then…

Number Theory · Mathematics 2024-11-27 Kiran S. Kedlaya , Anna Medvedovsky

Using the framework relating hypergeometric motives to modular forms, we define an explicit family of weight 2 Hecke eigenforms with complex multiplication. We use the theory of ${}_2F_1(1)$ hypergeometric series and Ramanujan's theory of…

Number Theory · Mathematics 2025-02-14 Esme Rosen

We will prove several congruences modulo a power of a prime such as $$ \sum_{0<k_1<...<k_{n}<p}\leg{p-k_{n}}{3} {(-1)^{k_{n}}\over k_1... k_{n}}\equiv {lll} -{2^{n+1}+2\over 6^{n+1}} p B_{p-n-1}({1\over 3}) &\pmod{p^2} &{if $n$ is odd}…

Number Theory · Mathematics 2009-11-06 Roberto Tauraso

In this paper, we study arithmetic properties of weighted Catalan numbers. Previously, Postnikov and Sagan found conditions under which the $2$-adic valuations of the weighted Catalan numbers are equal to the $2$-adic valutations of the…

Combinatorics · Mathematics 2019-08-13 Yibo Gao , Andrew Gu

In this paper we resolve a question by Bringmann, Lovejoy, and Rolen on a new vector-valued $U$-type function. We obtain an expression for a corresponding family of Hecke-Appell-type sums in terms of mixed mock modular forms; that is, we…

Number Theory · Mathematics 2023-05-03 Nikolay Borozenets

We extend our investigation of $2$-determinants, which we defined in a previous paper. For a linear homogenous recurrence of the second order, we consider relations between different sequences satisfying the same linear homogeneous…

Combinatorics · Mathematics 2021-05-12 Dusko Bogdanic , Milan Janjic

Consider an ordinary generating function $\sum_{k=0}^{\infty}c_kx^k$, of an integer sequence of some combinatorial relevance, and assume that it admits a closed form $C(x)$. Various instances are known where the corresponding truncated sum…

Number Theory · Mathematics 2017-03-08 Sandro Mattarei , Roberto Tauraso

For integer $k \geq 0$, let $S_k$ denote the sum of the $k$th powers of the first $n$ positive integers $1^k + 2^k + \cdots + n^k$. For any given $k$, the power sum $S_k$ can in principle be determined by differentiating $k$ times (with…

Number Theory · Mathematics 2023-03-24 José L. Cereceda

Recently, a new class of words, denoted by L_n, was shown to be in bijection with a subset of the Dyck paths of length 2n having cardinality given by the (n-1)-st Catalan number. Here, we consider statistics on L_n recording the number of…

Combinatorics · Mathematics 2014-07-15 Toufik Mansour , Mark Shattuck

Motivated by Andrews' partitions with initial repetitions, we derive parity formulas for several functions for this class of partitions. In many cases, we present an infinite family of Ramanujan-like congruences modulo 2.

Number Theory · Mathematics 2023-06-13 Darlison Nyirenda , Beaullah Mugwangwavari

Motivated by finding analogues of elliptic curve point counting techniques, we introduce one deterministic and two new Monte Carlo randomized algorithms to compute the characteristic polynomial of a finite rank-two Drinfeld module. We…

Symbolic Computation · Computer Science 2019-07-31 Yossef Musleh , Éric Schost

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 2014-06-25 Tewodros Amdeberhan

Many generating series of combinatorially interesting numbers have the property that the sum of the terms of order $<p$ at some suitable point is congruent to a zero of a zeta-function modulo infinitely many primes $p$. Surprisingly, very…

Number Theory · Mathematics 2025-06-17 Frits Beukers

I begin with a simple modular form motivated proof of the following: Let $C_{n}$ in $Z/2[[t]]$ be defined by $C_{n+4} = C_{n+3} + (t^{4}+t^{3}+t^{2}+t)C_{n} + t^{n}(t^{2}+t)$, with initial values $0$, $1$, $t$ and $t^{2}$ for $C_{0}$,…

Number Theory · Mathematics 2016-03-15 Paul Monsky

We analyze the combinatorics behind the operation of taking the logarithm of the generating function $G_k$ for $k^\text{th}$ generalized Catalan numbers. We provide combinatorial interpretations in terms of lattice paths and in terms of…

Combinatorics · Mathematics 2025-07-02 Sabine Jansen , Leonid Kolesnikov

We prove exact asymptotic expansions for the partial sums of the sequences of central binomial coefficients and Catalan numbers, $\sum_{k=0}^n \binom{2k}{k}$ and $\sum_{k=0}^n C_n$. We also obtain closed forms for the polynomials…

Combinatorics · Mathematics 2010-01-13 Sandro Mattarei

Let $NT(m, k, n)$ denote the total number of parts in the partitions of n with rank congruent to m modulo k. Andrews proved Beck's conjecture on congruences for $NT(m, k, n)$ modulo 5 and 7. Generalizing Andrews'results, Chern obtain…

Number Theory · Mathematics 2023-03-10 Nankun Hong , Renrong Mao

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…

Group Theory · Mathematics 2018-06-18 Fikreab Admasu , Amit Sehgal