Related papers: Dedekind Sums with Even Denominators

Every integer greater than two can be expressed as the sum of a prime and a square-free number. Expanding on recent work, we provide explicit and asymptotic results when divisibility conditions are imposed on the square-free number. For…

Let G be a simple complex algebraic group and let K be a reductive subgroup of G such that the coordinate ring of G/K is a multiplicity free G-module. We consider the G-algebra structure of C[G/K], and study the decomposition into…

We determine the $3$-class groups of $\mathbb{Q}(\sqrt[3]{p})$ and $K=\mathbb{Q}(\sqrt[3]{p},\sqrt{-3})$ when $p\equiv 4,7\bmod 9$ is a prime and $3$ is a cubic modulo $p$. This confirms a conjecture made by Barrucand-Cohn, and proves the…

Let Q(4n,d) be the sum of all multiple zeta values of depth d and weight 4n whose arguments are all multiples of 4. In this paper we derive a formula of Q(4n,d) for all d>2 as a finite sum involving binomial coefficients, Bernoulli numbers…

Let f(n)= Sum binomial(n,k)^(-1). First, we show that f:N to Q_p is nowhere continuous in the p-adic topology. If x is a p-adic integer, we say that f(x) is p-definable if lim f(x_j) exists in Q_p, where x_j denotes the jth partial sum for…

The Koml\'os$\unicode{x2013}$Major$\unicode{x2013}$Tusn\'ady (KMT) inequality for partial sums is one of the most celebrated results in probability theory. Yet its practical application has been hindered by a lack of practical constants.…

Our contribution is a bounded cubic compilation theorem. For each fixed resource parameter $k$, syntactic proof checking at resource level $k$ is faithfully represented by a finite bounded-domain system of cubic polynomial equations. Every…

The generalized Euler number E_{n|k} counts the number of permutations of {1,2,...,n} which have a descent in position m if and only if m is divisible by k. The classical Euler numbers are the special case when k=2. In this paper, we study…

Let $k\ge 3$ be an integer, $q$ be a prime power, and $\mathbb{F}_q$ denote the field of $q$ elements. Let $f_i, g_i\in\mathbb{F}_q[X]$, $3\le i\le k$, such that $g_i(-X) = -\, g_i(X)$. We define a graph $S(k,q) =…

One variant of the $q$-Catalan polynomials is defined in terms of Gaussian polynomials by $\mathcal{C}_k(q)=\genfrac{[}{]}{0pt}{}{2k}{k}_q-q\genfrac{[}{]}{0pt}{}{2k}{k+1}_q$. Liu studied congruences of the form $\sum_{k=0}^{n-1}…

We introduce a $q$-deformation of the Pythagoras equation $a^2 + b^2 = c^2$, which is a polynomial version of it different from the standard one. We construct a polynomial analogue, or ``$q$-analogue'', of every primitive Pythagorean…

For sufficiently large integers $K$, $x$, $y$, and $q$ satisfying $K \le y < x$, where $f(u) = \alpha u^n + \alpha_{n-1}u^{n-1} + \ldots + \alpha_1 u$ is a polynomial of degree $n$ with real coefficients, $n$ is a fixed positive integer,…

The eigenvalue probability density function of the Gaussian unitary ensemble permits a $q$-extension related to the discrete $q$-Hermite weight and corresponding $q$-orthogonal polynomials. A combinatorial counting method is used to specify…

Let $i(\infty,k)$ be the limiting proportion, as $n \rightarrow \infty$, of permutations in the symmetric group of degree $n$ that fix a $k$-set. We give an algorithm for computing $i(\infty,k)$ and state the values of $i(\infty,k)$ for $k…

We prove that a $q$-deformation $\Disc k\X q$ of the powers of the discriminant is equal, up to a normalization, to a specialization of a Macdonald polynomial indexed by a staircase partition. We investigate the expansion of $\Disc k\X q$…

An interesting, and still wide open, conjecture of Reiner and Stanton predicts that certain "strange" symmetric differences of $q$-binomial coefficients are always nonnegative and unimodal. We extend their conjecture to a broader, and…

Dris conjectured in his masters thesis that the inequality $q^k < n$ always holds, if $N = {q^k}{n^2}$ is an odd perfect number with special prime $q$. In this note, we initially show that either of the two conditions $n < q^k$ or…

By making use of arithmetic information inequalities, we give a strong quantitative bound for the discretised ring theorem. In particular, we show that if $A \subset [1,2]$ is a $(\delta,\sigma)$-set, with $|A| = \delta^{-\sigma},$ then…

We study cancellation in sums of Hecke eigenvalues over irreducible quadratic polynomials over short intervals. In particular, we look at an average over bases of Hecke forms of weight $k$ in the range $\vert k-K\vert<K^\theta$ where…

We study the commutation structure within the Pauli groups built on all decompositions of a given Hilbert space dimension $q$, containing a square, into its factors. The simplest illustrative examples are the quartit ($q=4$) and two-qubit…