arXiv subjects

C. G. Karthick Babu

Publications and source records attributed to C. G. Karthick Babu.

5 recordsLinked to original sources

arXiv2026

Conflict-avoiding codes and near-primitive roots

An important role in the theory of conflict-avoiding codes is played by a quantity involving the multiplicative order of $4$ modulo $d$, with $d$ running over all positive divisors of an odd integer $n$. We establish results on its distribution as $n$ varies over the odd prime numbers, respectively odd integers, using techniques from the study of Artin's primitive root conjecture. We also point out some other interpretations of this quantity, with one of them making a connection with the factorization of $X^n-1$ into irreducibles over the finite field $\mathbb F_2$.

math.NT↗

arXiv2024

Davenport constant and its variants for some non-abelian groups

We define two variants $e(G)$, $f(G)$ of the Davenport constant $d(G)$ of a finite group $G$, that is not necessarily abelian. These naturally arising constants aid in computing $d(G)$ and are of potential independent interest. We compute the constants $d(G)$, $e(G)$, $f(G)$ for some nonabelian groups G, and demonstrate that, unlike abelian groups where these constants are identical, they can each be distinct. As a byproduct of our results, we also obtain some cases of a conjecture of J. Bass. We compute the $k$-th Davenport constant for several classes of groups as well. We also make a conjecture on $f(G)$ for metacyclic groups and provide evidence towards it.

math.CO↗

arXiv2024

Linear Congruences in several variables with congruence restrictions

In this article, we consider systems of linear congruences in several variables and obtain necessary and sufficient conditions as well as explicit expressions for the number of solutions subject to certain restriction conditions. These results are in terms of Ramanujan sums and generalize the results of Lehmer \cite{DNL13} and Bibak et al. \cite{BBVRL17}. These results have analogues over $\mathbb{F}_q[t]$ where the proofs are similar, once notions such as Ramanujan sums are defined in this set-up. We use the recent description of Ramanujan sums over function fields as developed by Zhiyong Zheng \cite{ZZ18}. This is discussed in the last section. We illustrate the formulae obtained for the number of solutions through some examples. Over the integers, such problems have a rich history, some of which seem to have been forgotten - a number of papers written on the topic re-prove known results. The present authors also became aware of some of these old articles only while writing the present article and hence, we recall very briefly some of the old work by H. J. S. Smith, Rademacher, Brauer, Butson and Stewart, Ramanathan, McCarthy, and Spilker \cite{AB26, BS55, PJM76, HR25, KGR44, HJSS61, JS96}.

math.NT↗

arXiv2024

Linear Congruences and a Conjecture of Bibak

We address three questions posed by Bibak \cite{KB20}, and generalize some results of Bibak, Lehmer and K G Ramanathan on solutions of linear congruences $\sum_{i=1}^k a_i x_i \equiv b \Mod{n}$. In particular, we obtain explicit expressions for the number of solutions where $x_i$'s are squares modulo $n$. In addition, we obtain expressions for the number of solutions with order restrictions $x_1 \geq \cdots \geq x_k$ or, with strict order restrictions $x_1> \cdots > x_k$ in some special cases. In these results, the expressions for the number of solutions involve Ramanujan sums and are obtained using their properties.

math.NT↗

arXiv2019

Primes in Beatty sequence

For a polynomial $g(x)$ of deg $k \geq 2$ with integer coefficients and positive integer leading coefficient, we prove an upper bound for the least prime $p$ such that $g(p)$ is in non-homogeneous Beatty sequence $\lbrace \lfloor αn+β\rfloor : n=1,2,3, \dots \rbrace$, where $α, β\in \mathbb{R}$ with $α>1$ is irrational and we prove an asymptotic formula for the number of primes $p$ such that $g(p)=\lfloor αn+β\rfloor.$ Next we obtain an asymptotic formula for number of primes $p$ of the form $p=\lfloor αn+β\rfloor$ which also satisfies $p \equiv f \pmod d$ where $f, d$ are integers with $1\leq f < d$ and $(f,d)=1$.

math.NT↗