English
Related papers

Related papers: Modular Proofs of Gosper's Identities

200 papers

In 2001 W. Gosper introduced a constant Pi_{q} and conjectured without proofs many intriguing identities on this constant. In this paper we establish some modular equations of degrees 3 and 5. From these modular equations we confirm two…

Classical Analysis and ODEs · Mathematics 2020-11-30 Bing He

We prove a master identity for a class of sequences defined by full-history linear homogeneous recurrences with (non-negative) constant coefficients. The identity is derived in a combinatorial way, providing thus combinatorial proofs for…

Combinatorics · Mathematics 2022-12-14 Tomislav Došlić , Luka Podrug

Let $\epsilon$ be a fixed positive quantity, $m$ be a large integer, $x_j$ denote integer variables. We prove that for any positive integers $N_1,N_2,N_3$ with $N_1N_2N_3>m^{1+\epsilon},$ the set $$ \{x_1x_2x_3 \pmod m: \quad x_j\in [1,N_j]…

Number Theory · Mathematics 2008-08-11 M. Z. Garaev

Pila and Tsimerman proved in 2017 that for every $k$ there exists at most finitely many $k$-tuples $(x_1,\ldots, x_k)$ of distinct non-zero singular moduli with the property "$x_1, \ldots,x_k$ are multiplicatively dependent, but any proper…

Number Theory · Mathematics 2026-05-27 Yuri Bilu , Sanoli Gun , Emanuele Tron

Large scale discrete uniform and homogeneous $P$-values often arise in applications with multiple testing. For example, this occurs in genome wide association studies whenever a nonparametric one-sample (or two-sample) test is applied…

Methodology · Statistics 2021-12-08 Marta Cousido-Rocha , Jacobo de Uña-Álvarez , Sebastian Döhler

In 2013, Pak and Panova proved the strict unimodality property of $q$-binomial coefficients $\binom{\ell+m}{m}_q$ (as polynomials in $q$) based on the combinatorics of Young tableaux and the semigroup property of Kronecker coefficients.…

Symbolic Computation · Computer Science 2023-09-04 Christoph Koutschan , Ali K. Uncu , Elaine Wong

In this paper we investigate the parallelization of two modular algorithms. In fact, we consider the modular computation of Gr\"obner bases (resp. standard bases) and the modular computation of the associated primes of a zero-dimensional…

Commutative Algebra · Mathematics 2011-03-14 Nazeran Idrees , Gerhard Pfister , Stefan Steidel

Applying the theory of elliptic functions we establish two Jacobi theta function identities. From these identities we confirm two q-trigonometric identities conjectured by Gosper. As an application, we give a new and simple proof of a…

Classical Analysis and ODEs · Mathematics 2021-05-10 Bing He

We prove exact identities for convolution sums of divisor functions of the form $\sum_{n_1 \in \mathbb{Z} \smallsetminus \{0,n\}}\varphi(n_1,n-n_1)\sigma_{2m_1}(n_1)\sigma_{2m_2}(n-n_1)$ where $\varphi(n_1,n_2)$ is a Laurent polynomial with…

Number Theory · Mathematics 2023-12-04 Ksenia Fedosova , Kim Klinger-Logan , Danylo Radchenko

Mizuno provided 19 examples of generalized rank three Nahm sums with symmetrizer $\mathrm{diag}(1,1,2)$ which are conjecturally modular. We confirm their modularity by establishing Rogers--Ramanujan type identities of index $(1,1,2)$ for…

Number Theory · Mathematics 2024-02-12 Boxue Wang , Liuquan Wang

In this article, we study the classification of some natural numbers related to the combinatorics of congruence subgroups of the modular group. More precisely, we will focus here on the notion of minimal monomial solutions. These are the…

Combinatorics · Mathematics 2024-12-03 Flavien Mabilat

We show that if the congruence above holds and $n\mid m$, then the quotient $Q:=m/n$ satisfies $\sum_{p\mid Q} \frac{Q}{p}+1 \equiv 0\pmod{Q}$, where $p$ is prime. The only known solutions of the latter congruence are $Q=1$ and the eight…

Number Theory · Mathematics 2015-06-17 José María Grau , Antonio M. Oller-Marcén , Jonathan Sondow

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…

Combinatorics · Mathematics 2015-10-01 William Y. C. Chen , Qing-Hu Hou , Doron Zeilberger

Let $p$ be a prime, let $d \geq 1$ be an integer and $A$ be the algebra of square matrices of size $d$ over the field of order $p$. Let $P, Q \in A[x_1, \dots x_n]$ be polynomials in $n$ indeterminates with coefficients in $A$, such that…

Combinatorics · Mathematics 2026-05-22 Pierre-Emmanuel Caprace , Justin Vast

Let $M$ and $N$ be fixed non-negative integer numbers and let $\pi_N$ be a polynomial of degree $N$. Suppose that $(P_n)_{n\geq0}$ and $(Q_n)_{n\geq0}$ are two orthogonal polynomial sequences such that %their derivatives of orders $k$ and…

Classical Analysis and ODEs · Mathematics 2019-06-19 K. Castillo , D. Mbouna

We show that a matrix is a Hermitian positive semidefinite matrix whose nonzero entries have modulus 1 if and only if it similar to a direct sum of all $1's$ matrices and a 0 matrix via a unitary monomial similarity. In particular, the only…

Rings and Algebras · Mathematics 2007-05-23 Daniel Hershkowitz , Michael Neumann , Hans Schneider

For each prime $\ell$, let $|\cdot|_\ell$ be an extension to $\bar \Q$ of the usual $\ell$-adic absolute value on $\Q$. Suppose $g(z) = \sum_{n=0}^\infty c(n)q^n \in M_{k+\half}(N)$ is an eigenform whose Fourier coefficients are algebraic…

Number Theory · Mathematics 2008-02-03 Ken Ono , Christopher Skinner

Let $A_g$ be an abelian variety of dimension $g$ and $p$-rank $\lambda \leq 1$ over an algebraically closed field of characteristic $p>0$. We compute the number of homomorphisms from $\pi_1^{\text{\'et}}(A_g,a)$ to $GL_n(\mathbb F_q)$,…

Algebraic Geometry · Mathematics 2018-06-22 Brett Frankel

We analyze the stable isomorphism type of polynomial rings on degree 1 generators as modules over the sub-algebra A(1) = <Sq^1, Sq^2> of the mod 2 Steenrod algebra. Since their augmentation ideals are Q_1-local, we do this by studying the…

Algebraic Topology · Mathematics 2014-07-08 Robert R. Bruner

We design the first efficient polynomial identity testing algorithms over the nonassociative polynomial algebra. In particular, multiplication among the formal variables is commutative but it is not associative. This complements the strong…

Computational Complexity · Computer Science 2025-09-16 Partha Mukhopadhyay , C Ramya , Pratik Shastri
‹ Prev 1 2 3 10 Next ›