Related papers: Gauss sum with principal multiplicative character
Abundancy index refers to the ratio of the sum of the divisors of a number to the number itself. It is a concept of great importance in defining friendly and perfect numbers. Here, we describe a suitable generalization of abundancy index to…
We use the Algortihm Z on partitions due to Zeilberger, in a variant form, to give a combinatorial proof of Ramanujan's $_1\psi_1$ summation formula.
A generalised summation method is considered based on the Fourier series of periodic distributions. It is shown that $$ e^{it}-2e^{2it}+3e^{3it}-4e^{4it}+-\cdots = {\mathrm P\mathrm f} {\displaystyle \frac{e^{it}}{(1+e^{it})^2}} +i\pi…
A group $G$ is complete group if it satisfies $Z(G)=e$ and $Aut(G)=Inn(G)$. In this paper, on the one hand, we study the basic properties of generalized Cayley graphs and characterize two classes isomorphic generalized generalized Cayley…
We propose a systematic method for analyzing Rohrlich-type divisor sums for arbitrary congruence subgroups $\Gamma_0(N)$. Our main theorem unifies various results from the literature, and its significance is illustrated through the…
We provide explicit formulas for quadratic Gauss sums over $\mathbb{Z}^n/c\mathbb{Z}^n$, which generalize some of the existing formulas, e.g., Skoruppa and Zagier's (for $n=2$), and Iwaniec and Kowalski's (for arbitrary $n$). We then give…
The Cayley sum graph $\Gamma_S$ of a set $S \subseteq \mathbb{Z}_n$ is defined on the vertex set $\mathbb{Z}_n$, with an edge between distinct $x, y \in \mathbb{Z}_n$ if $x + y \in S$. Campos, Dahia, and Marciano have recently shown that if…
Let $R$ be a ring with identity and $J(R)$ be its Jacobson radical. Assume that $a\in R$ is $(b,c)$-invertible and $j_a,j_b,j_c\in J(R)$. This paper provides necessary and sufficient conditions for $a+j_a$ to be $(b+j_b,c+j_c)$-invertible.…
We consider the generalized character $\Psi_{1,p,G}$ of a finite group $G$ which vanishes on all $p$-singular elements of $G$ and whose value at each $p$-regular $y \in G$ is the number of $p$-elements of $C_{G}(y)$. We conjecture that this…
Gcd-graphs over the ring of integers modulo $n$ are a natural generalization of unitary Cayley graphs. The study of these graphs has foundations in various mathematical fields, including number theory, ring theory, and representation…
For a finite group $G$ and positive integer $g$, a $g$-additive basis is a subset of $G$ whose pairwise sums cover each element of $G$ at least $g$ times, with $g$-difference bases defined similarly using pairwise differences. While prior…
We study sums of Dirichlet characters over polynomials in $\mathbb{F}_q[t]$ with a prescribed number of irreducible factors. Our main results are explicit formulae for these sums in terms of zeros of Dirichlet L-functions. We also exhibit…
We compute generating functions for the sum of the real-valued character degrees of the finite general linear and unitary groups, through symmetric function computations. For the finite general linear group, we get a new combinatorial proof…
Let $\G(v,e)$ be the set of all simple graphs with $v$ vertices and $e$ edges and let $P_2(G)=\sum d_i^2$ denote the sum of the squares of the degrees, $d_1, >..., d_v$, of the vertices of $G$. It is known that the maximum value of $P_2(G)$…
Stanley's theorem establishes that for any finite graph $G$, the number $h_G(s)$ of magic labelings with magic sum $s$ can be expressed as a sum of two polynomials in $s$. However, determining the precise form of $h_G(s)$ is generally…
We give a polynomial time approximation scheme (PTAS) for computing the supremum of a Gaussian process. That is, given a finite set of vectors $V\subseteq\mathbb{R}^d$, we compute a $(1+\varepsilon)$-factor approximation to $\mathop…
In order to study the analytic properties of the Goldbach generating function we consider a smooth version, similar to the Chebyshev function for the Prime Number Theorem. In this paper, we obtain explicit numerical estimates for the…
Frank Harary introduced the concepts of sum and integral sum graphs. A graph $G$ is a \textit{sum graph} if the vertices of $G$ can be labeled with distinct positive integers so that $e = uv$ is an edge of $G$ if and only if the sum of the…
In this paper, we consider universal sums of generalized polygonal numbers. Fixing $m\in\mathbb{N}_{\geq 3}$, we show two finiteness theorems for universal sums of generalized polygonal numbers whose inputs have a restricted number $L$ of…
We construct, for any finite commutative ring $R$, a family of representations of the general linear group $\mathrm{GL}_n(R)$ whose intertwining properties mirror those of the principal series for $\mathrm{GL}_n$ over a finite field.