Related papers: Efficient computation of the Euler-Kronecker const…

For smooth finite fields $F_q$ (i.e., when $q-1$ factors into small primes) the Fast Fourier Transform (FFT) leads to the fastest known algebraic algorithms for many basic polynomial operations, such as multiplication, division,…

In this paper, we investigate the Euler sums $$ G_{n+2}(p,q)=\sum_{1\leq k_1<k_2<\cdots<k_{p+1}}\frac1{k_1k_2\cdots k_pk_{p+1}^{n+2}} \sum_{1\leq\ell_1\leq\ell_2\leq\cdots\leq\ell_q\leq k_{p+1}}\frac1{\ell_1\ell_2\cdots\ell_q}. $$ We give…

Let $q=p^n$ be an odd prime power and let $\mathbb{F}_q$ be the finite field with $q$ elements. Let $\widehat{\mathbb{F}_q^{\times}}$ be the group of all multiplicative characters of $\mathbb{F}_q$ and let $\chi$ be a generator of…

In this paper, we introduce and study a variant of Kummer's notion of (ir)regularity of primes which we call G-irregularity. It is based on Genocchi numbers $G_n$, rather than Bernoulli number $B_n.$ We say that an odd prime $p$ is…

Let $q = p^s$ be a power of a prime number $p$ and let $\mathbb{F}_q$ be the finite field with $q$ elements. In this paper we obtain the explicit factorization of the cyclotomic polynomial $\Phi_{2^nr}$ over $\mathbb{F}_q$ where both $r…

In this essay, we see how prime cyclotomic fields (cyclotomic fields obtained by adjoining a primitive p-th root of unity to Q, where p is an odd prime) can lead to elegant proofs of number theoretical concepts. We namely develop the notion…

Let phi denote Euler's phi function. For a fixed odd prime we give an asymptotic series expansion in the sense of Poincare for the number E_q(x) of n<=x such that q does not divide phi(n). Thereby we improve on a recent theorem of B.K.…

Dating back to Euler, in classical analysis and number theory, the Hurwitz zeta function $$ \zeta(z,q)=\sum_{n=0}^{\infty}\frac{1}{(n+q)^{z}}, $$ the Riemann zeta function $\zeta(z)$, the generalized Stieltjes constants $\gamma_k(q)$, the…

In recent work, Darmon, Pozzi and Vonk explicitly construct a modular form whose spectral coefficients are $p$-adic logarithms of Gross-Stark units and Stark-Heegner points. Here we describe how this construction gives rise to a practical…

This paper provides two characterizations of the primitive roots of unity in quadratic cyclotomic extensions over arbitrary fields. Firstly, we introduce a mapping from $\mathbb{N}$ to $\mathbb{N}$ crucial for describing these roots,…

We compute all irregular primes less than 2^31 = 2 147 483 648. We verify the Kummer-Vandiver conjecture for each of these primes, and we check that the p-part of the class group of Q(zeta_p) has the simplest possible structure consistent…

We introduce a cyclotomic representation for finite $q$-hypergeometric series and $q$-deformed amplitudes that separates algebraic structure from evaluation. By expressing each summand in a sparse exponent basis over irreducible cyclotomic…

Let $\Phi_{n}(q)$ denote the $n$-th cyclotomic polynomial in $q$. Recently, Guo and Schlosser [Constr. Approx. 53 (2021), 155--200] put forward the following conjecture: for an odd integer $n>1$, \begin{align*}…

In connection with Eisenstein series for the principal congruence subgroup $\Gamma(n)$, Hecke introduced certain numbers, of which he said that they are rational and cumbersome to calculate. We show, however, that these numbers are…

We introduce two novel techniques that simplify calculation of Jordan-Kronecker invariants for a Lie algebra $\mathfrak{g}$ and for a Lie algebra representation $\rho$. First, the stratification of matrix pencils under strict equivalence…

We introduce a Lie algebra $\mathfrak{g}_{\mathbf{Q}}(\mathbf{m})$ and an associative algebra $\mathcal{U}_{q,\mathbf{Q}}(\mathbf{m})$ associated with the Cartan data of $\mathfrak{gl}_m$ which is separated into $r$ parts with respect to…

In this paper new series for the first and second Stieltjes constants (also known as generalized Euler's constant), as well as for some closely related constants are obtained. These series contain rational terms only and involve the…

We present a way of computing Kronecker coefficients that uses a new family of rational convex polytopes, called column-row polytopes. We give several different formulas for the computation. They are alternating sums of numbers of integer…

In this paper we study Euclidean algorithms and the corresponding continued fractions for oriented linear Grassmanians $G(k,n)$. We propose two algorithms: Maximal Element Elimination algorithm and Minimal Element Elimination algorithm. The…

We investigate the splitting behavior of $\ell$ in the coefficient field of a newform $f$ of level $N$, under the assumption that $f$ is congruent modulo a prime above $\ell$ to another newform $g$ whose level divides $N/p^2$ for some prime…