arXiv subjects
Publications and source records attributed to Muhammad Afifurrahman.
We establish several asymptotic formulae and upper bounds for the count of multiplicatively dependent integer vectors that lie on a fixed hyperplane and have bounded height. This work constitutes a direct extension of the results obtained by Pappalardi, Sha, Shparlinski, and Stewart.
We obtain several new upper bounds of the odd graceful chromatic number of a graph $G$, which must be bipartite. Some of our bounds depend only on the number of the vertices of $G$ or the chromatic number of some graphs related to the bipartition of $G$.
In this article, we study the higher-power moments of restricted divisor functions. In order to establish our main results, we prove a more general result pertaining to the distribution of solutions to certain multiplicative Diophantine equations.
We obtain an asymptotic formula for the number of integer $2\times 2$ matrices that have determinant $\Delta$ and whose absolute values of the entries are at most $H$. The result holds uniformly for a large range of $\Delta$ with respect to $H$.
We consider the set of $n\times n$ matrices with rational entries having numerator and denominator of size at most $H$ and obtain upper and lower bounds on the number of such matrices of a given rank and then apply them to count such matrices with a given determinant, or a given characteristic polynomial.
Given a set $X$ of $n\times n$ matrices and a positive integer $m$, we consider the problem of estimating the cardinalities of the product sets $A_1 \dotsc A_m$, where $A_i\in X$. When $X=\mathcal M_n(\mathbb{Z};H)$, the set of $n\times n$ matrices with integer elements of size at most $H$, we give several bounds on the cardinalities of the product sets. Related to this result, we also give some bounds on the cardinalities of the set of solutions of the related equations such as $A_1 \dotsc A_m=C$ and $A_1 \dotsc A_m=B_1 \dotsc B_m$. We also consider the case where $X$ is the subset of matrices in $\mathcal M_n(\mathbb{F})$, where $\mathbb{F}$ is a field, with bounded rank $k\leq n$. In this case, we completely classify the related product set.
Let $p$ be a prime, and $q=p^n$ be a prime power. In his works on Sidon sets over $\mathbb{F}_q\times \mathbb{F}_q$, Cilleruelo conjectured about polynomials that could generate $q$-element Sidon sets over $\mathbb{F}_q\times \mathbb{F}_q$. Here, we derive some criteria for determining polynomials that could generate $q$-element Sidon set over $\mathbb{F}_q\times \mathbb{F}_q$. Using these criteria, we prove that certain classes of monomials and cubic polynomials over $\mathbb{F}_p$ cannot be used to generate $p$-element Sidon set over $\mathbb{F}_p\times \mathbb{F}_p$. We also discover a connection between the needed polynomials and planar polynomials.
Two of many criteria of a good MDS matrix are being involutory and having few different elements. This paper investigates the number of different entries in an involutory MDS matrices of order 1, 2, 3, and 4 over finite fields of characteristic two. There are at least three and four different elements in an involutory MDS matrices with, respectively, order three and four, over finite fields of characteristic two.