English
Related papers

Related papers: A New Approach to Enumerating Statistics Modulo $n…

200 papers

Let $(G_n(x))_{n=0}^\infty$ be a $d$-th order linear recurrence sequence having polynomial characteristic roots, one of which has degree strictly greater than the others. Moreover, let $m\geq 2$ be a given integer. We ask for…

Number Theory · Mathematics 2018-10-30 Clemens Fuchs , Christina Karolus

We propose a criterion that allows one to distinguish prime numbers from compound ones. This criterion is based on the counting of small quadratic residues.

Number Theory · Mathematics 2016-09-20 Denise Vella-Chemla

When the parameter $q\in\mathbb C^*$ is not a root of unity, simple modules of affine $q$-Schur algebras have been classified in terms of Frenkel--Mukhin's dominant Drinfeld polynomials (\cite[4.6.8]{DDF}). We compute these Drinfeld…

Quantum Algebra · Mathematics 2012-01-18 Jie Du , Qiang Fu

We present two algorithms that, given a prime ell and an elliptic curve E/Fq, directly compute the polynomial Phi_ell(j(E),Y) in Fq[Y] whose roots are the j-invariants of the elliptic curves that are ell-isogenous to E. We do not assume…

Number Theory · Mathematics 2014-10-14 Andrew V. Sutherland

Evidences have suggested that counting representations are sometimes tractable even when the corresponding classification problem is almost impossible, or "wild" in a precise sense. Such counting problems are directly related to matrix…

Representation Theory · Mathematics 2024-05-01 Yifeng Huang

We present several new algorithms to evaluate modular polynomials of level $\ell$ modulo a prime $p$ on an input $j$. More precisely, we introduce two new generic algorithms, sharing the following similarities: they are based on a CRT…

We introduce SP$\mathbb{Q}$R, a new Mathematica package for the division and elimination of variables from polynomial systems. SP$\mathbb{Q}$R works by sampling and reconstructing results over finite fields, in an analogous manner to many…

High Energy Physics - Theory · Physics 2025-11-20 Vsevolod Chestnov , Giulio Crisanti

Let $p$ be a given modulus, let $u$ be prime to $p$, and consider the linear permutation $u\cdot n\pmod p$ of the residue system modulo $p$. Writing $\langle x\rangle_p$ to denote the least nonnegative residue of $x$ modulo $p$, we say that…

Number Theory · Mathematics 2026-05-19 Gennady Bachman

Recently, Bruinier and Ono found an algebraic formula for the partition function in terms of traces of singular moduli of a certain non-holomorphic modular function. In this paper we prove that the rational polynomial having these singuar…

Number Theory · Mathematics 2020-07-02 Michael H. Mertens , Larry Rolen

Let $\E$ be an ordinary elliptic curve over a finite field $\F_{q}$ of $q$ elements and $x(Q)$ denote the $x$-coordinate of a point $Q = (x(Q),y(Q))$ on $\E$. Given an $\F_q$-rational point $P$ of order $T$, we show that for any subsets…

Number Theory · Mathematics 2008-06-05 Omran Ahmadi , Igor Shparlinski

Let $p$ be an odd prime and let $a,m$ be integers with $a>0$ and $m \not\equiv0\pmod p$. In this paper we determine $\sum_{k=0}^{p^a-1}\binom{2k}{k+d}/m^k$ mod $p^2$ for $d=0,1$; for example,…

Number Theory · Mathematics 2016-02-16 Zhi-Wei Sun

We consider the moduli space $\mathcal{R}_n$ of pairs of monic, degree $n$ polynomials whose resultant equals $1$. We relate the topology of these algebraic varieties to their geometry and arithmetic. In particular, we compute their…

Algebraic Geometry · Mathematics 2015-11-16 Benson Farb , Jesse Wolfson

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

We construct (q,t)-Catalan polynomials and q-Fuss-Catalan polynomials for any irreducible complex reflection group W. The two main ingredients in this construction are Rouquier's formulation of shift functors for the rational Cherednik…

Combinatorics · Mathematics 2009-12-09 Iain Gordon , Stephen Griffeth

In this paper, we introduce a new family of codes relevent for rank and sum-rank metrics. These codes are based on an effective Chinese remainders theorem for linearized polynomials over finite fields. We propose a decoding algorithm for…

Rings and Algebras · Mathematics 2025-05-22 Philippe Gaborit , Camille Garnier , Olivier Ruatta

A novel very simple method for finding roots of polynomials over finite fields has been proposed. The essence of the proposed method is to search the roots via nested cycles over the subgroups of the multiplicative group of the Galois…

Number Theory · Mathematics 2023-12-27 Gennady N. Glushchenko

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),…

Combinatorics · Mathematics 2021-12-21 Flavien Mabilat

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

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

We use generating functions over group rings to count polynomials over finite fields with the first few coefficients prescribed and a factorization pattern prescribed. In particular, we obtain different exact formulas for the number of…

Number Theory · Mathematics 2021-05-18 Simon Kuttner , Qiang Wang
‹ Prev 1 8 9 10 Next ›