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

In this paper, by constructing some identities, we prove some $q$-analogues of some congruences. For example, for any odd integer $n>1$, we show that \begin{gather*} \sum_{k=0}^{n-1} \frac{(q^{-1};q^2)_k}{(q;q)_k} q^k \equiv (-1)^{(n+1)/2}…

We study the problem of generating monomials of a polynomial in the context of enumeration complexity. In this setting, the complexity measure is the delay between two solutions and the total time. We present two new algorithms for…

A polynomial $A(q)=\sum_{i=0}^n a_iq^i$ is said to be unimodal if $a_0\le a_1\le \cdots \le a_k\ge a_{k+1} \ge \cdots \ge a_n$. We investigate the unimodality of rational $q$-Catalan polynomials, which is defined to be $C_{m,n}(q)=…

Let $\mathbb{F}_q$ be the finite field of $q$ elements. In this paper we obtain bounds on the following counting problem: given a polynomial $f(x)\in \mathbb{F}_q[x]$ of degree $k+m$ and a non-negative integer $r$, count the number of…

In Graph Theory a number of results were devoted to studying the computational complexity of the number modulo 2 of a graph's edge set decompositions of various kinds, first of all including its Hamiltonian decompositions, as well as the…

We present a modular function-based approach to explaining, for primes larger than 3, the exponents that appear in the prime decomposition of the order of the monster finite simple group.

Recently, Ko\c{c} proposed a neat and efficient algorithm for computing \[ x = a^{-1} \pmod {p^k} \] for a prime $p$ based on the exact solution of linear equations using $p$-adic expansions. The algorithm requires only addition and right…

Recently, Araci-Acikgoz-Sen derived some interesting identities on weighted q-Euler polynomials and higher-order q-Euler polynomials from the applications of umbral calculus (See [1]). In this paper, we develop the new method of q-umbral…

We present a space-efficient algorithm to compute the Hilbert class polynomial H_D(X) modulo a positive integer P, based on an explicit form of the Chinese Remainder Theorem. Under the Generalized Riemann Hypothesis, the algorithm uses…

In this paper we present two efficient methods for reconstructing a rational number from several residue-modulus pairs, some of which may be incorrect. One method is a natural generalization of that presented by Wang, Guy and Davenport in…

$Q$ is a quiver of type $\tilde A(n-1,1)$ if its graph is of affine type $\tilde A_{n-1}$ and if its arrows have a certain orientation. We develop a bijection between the set of indecomposable $kQ$-modules whose dimension vectors are…

Given n polynomials in n variables with a finite number of complex roots, for any of their roots there is a local residue operator assigning a complex number to any polynomial. This is an algebraic, but generally not rational, function of…

The \emph{$q,t$-Catalan numbers} $C_n(q,t)$ are polynomials in $q$ and $t$ that reduce to the ordinary Catalan numbers when $q=t=1$. These polynomials have important connections to representation theory, algebraic geometry, and symmetric…

It is well known that for all $n\geq1$ the number $n+ 1$ is a divisor of the central binomial coefficient ${2n\choose n}$. Since the $n$th central binomial coefficient equals the number of lattice paths from $(0,0)$ to $(n,n)$ by unit steps…

L. Bary-Soroker and R. Shmueli (2026) have given an asymptotic formula for the number of irreducible polynomials over the finite fields $\mathbb F_q$ of $q$ elements, such that their coefficients are perfect squares in $\mathbb F_q$ and…

Article presents a short investigation into some properties of the Moser polynomials which appear in various problems from algebraic combinatorics. For instance, these polynomials can be used to solve the Generalized Moser's Problem on…

We present algorithms to perform modular polynomial multiplication or modular dot product efficiently in a single machine word. We pack polynomials into integers and perform several modular operations with machine integer or floating point…

We study a subset of permutations, where entries are restricted to having the same remainder as the index, modulo some integer $k \geq 2$. We show that when also imposing the classical 132- or 213-avoidance restriction on the permutations,…

In this paper, we derive new combinatorial formulas for symmetric Macdonald polynomials $P_{\lambda}(X;q,t)$ and integral Macdonald polynomials $J_{\lambda}(X;q,t)$, in terms of several new statistics and the major index for a partition…

Let $p$ be an odd prime number. In this article, we study the number of quadratic residues and non-residues modulo $p$ which are multiples of $2$ or $3$ or $4$ and lying in the interval $[1, p-1]$, by applying the Dirichlet's class number…