Abstract
In this work, we investigate essential definitions, defining as a simple graph with vertices in and subgraphs and as unit residue and quadratic residue graphs modulo , respectively. The investigation extends to the degree of , , and , illuminating the properties of these subgraphs in the context of quadratic congruences.
1. Introduction
Modular arithmetic acts as the foundation for understanding quadratic congruences, a specific class of equations involving quadratic expressions and congruence relations. The modular arithmetic framework deals with numbers that wrap around upon reaching a specific modulus. A congruence relation expresses the equality of remainders when dividing two numbers by a positive integer known as the modulus.
The general form of a quadratic congruence is expressed as , where , , and are integers with , and represents an unknown integer variable. The solvability of the congruence depends on the existence of an integer that satisfies the congruence, referred to as a solution or root.
When exploring quadratic congruences within the ring of integers modulo a prime, the finite field plays a crucial role. In cases of a non-prime modulus , ’s structure significantly influences the solutions to quadratic congruences, particularly in the context of quadratic residues and non-residues modulo .
Within the ring , where is a prime number, elements fall into distinct categories of idempotents and nilpotents. Idempotents, namely 0 and 1, remain unchanged under repeated operations, while nilpotents eventually become zero after reaching a certain power.
A congruence class is called a unit if it possesses a multiplicative inverse in , denoted by such that . The set of units forms a group under multiplication, often denoted as or . In this group, an element is a quadratic residue mod if for some . The set of such quadratic residues is denoted by , forming a group under multiplication, where each residue has a multiplicative inverse within the group.
Quadratic residues, modulo , are counted excluding the trivial case . This exclusion ensures that the count is one less than the number of squares modulo . However, some sources include 0 as a quadratic residue, leading to being termed a quadratic non-residue modulo in cases where 0 is excluded.
The order of the quadratic residue group is determined by the number of quadratic residues in the set . This order depends on the properties of the modulus . For an odd prime modulus , the order of the group is , reflecting Euler’s criterion and the fact that exactly half of the residues in the set are quadratic residues. For a composite modulus , the order of the group is influenced by the factorization of and cannot be , where is Euler’s totient function.
Researchers, in their respective works, have explored various aspects of mathematical symmetry and congruences. Castillo and Mainguez, in their 2022 study on modular arithmetic, delve into the symmetrical patterns within sets of k-units modulo [1]. Mateen et al., in their 2021 research in graph theory, investigate the symmetrical intricacies within complete graphs involving quadratic and cubic residues [2]. Ali, Bahrami, and Reza’s 2017 contribution uncovers symmetrical properties in Cayley graphs for the ring of Gaussian integers modulo [3]. Somer and Křížek’s 2006 investigation into digraphs associated with quadratic congruences reveals symmetrical foundations [4]. Mateen and Mahmood, through work spanning 2019, navigate the symmetrical intricacies within power digraphs [5]. Deng and Yuan’s 2012 study provides valuable insights into symmetric digraphs, unraveling symmetrical patterns emerging from powers modulo [6]. J. Fabrykowski 1994 investigate the estimation of the maximal cardinality of such a set of residues modulo [7]. Additionally, the study of undirected graphs has been employed in understanding quadratic congruences, with various works relating graphs to the solution of quadratic congruences (e.g., [8,9,10,11]), offering both a visual and structural perspective on the mathematical relationships involved.
This work specifically examines the extension of a graph proposed in [12], related to the arbitrary associative group of integers . We explore elementary results regarding the association of this graph with the ring , constructing it based on the elements and units of the ring. Vertices represent elements, and distinct vertices are connected if and only if their squares are distinct. Additionally, we focus on the degrees of vertices in the graphs of the ring , the subgroup , and the subgroup .
2. Results
In this section, we begin by reviewing a fundamental definition crucial to our exploration.
Definition 1.
Let be a fixed positive integer. We call a simple graph if its vertex set is such that two distinct vertices and are adjacent provided that . Additionally, we introduce two subgraphs, and :
- We call the subgraph a unit residue graph modulo if its vertex set is and ;
- We call the subgraph a quadratic residue graph modulo if its vertex set is reduced residue system mod such that two distinct vertices and are adjacent provided that . i.e., and ;
In graph , when considering every pair of vertices and in the vertex set such that is congruent to 0 modulo , these vertices are disjointed. This property leads to a non-regular graph with vertex degrees less than or equal to . Also, it is observed that the vertex labeled as 0 is connected with all vertices except the nilpotent ones, and similarly, the idempotent vertex presented as is connected to all other vertices.
By the definition of graph , an edge is established between vertices and provided neither serves as a solution to the quadratic congruence for a non-zero . However, the solutions to this quadratic congruence may exceed two due to the factorization of . For example, can be factored as , yielding four roots: . Noticeably, these vertices do not share edges, indicating a lower degree for the mentioned vertices.
For the integers , the graph is empty due to the equality of squares for any pair of vertices. The mentioned values of will be omitted during the next discussion about the vertex degrees in graphs and . However, in the graph , the vertex is adjacent to the vertex .
The subsequent Proposition illustrates the vertex degrees within the graph .
Proposition 1.
For any prime , and , then .
Proof.
Consider any vertex, denoted as , in the set . Since and are the only vertices sharing identical squares, it follows that vertex is connected to all other vertices in except for the vertex . Given that , the number of vertices adjacent to is . □
Corollary 1.
The graph is regular of order for any prime number .
Proposition 2.
For any integer and , then .
Proof.
Consider any vertex, denoted as , in the set such that . Since the congruence has either no solution or exactly four incongruent solutions, namely , shares only three identical squares. It follows that vertex is adjacent to all vertices in except for the vertices . Given that , the number of vertices adjacent to is . □
Corollary 2.
Let , and , then .
The task of identifying elements in is significantly simplified by employing the so-called Legendre symbol; that is, for an odd prime , the Legendre symbol of any integer is defined as:
The Quadratic Reciprocity Theorem is a key result in number theory. It reveals a significant connection between quadratic residues and non-residues when considering congruences modulo prime numbers. The following is the state of the Quadratic Reciprocity Theorem.
Theorem 1
([13] The Quadratic Reciprocity Theorem). If and are odd primes and , then . Otherwise, .
Now, turning our attention to the prime power modulo, we delve into the case of odd modulo after addressing quadratic residues for prime modulo.
Theorem 2
([14]). Let be an odd prime, let , and let . Then if and only if .
Combining characterizations of for distinct prime powers is facilitated by the following result.
Theorem 3
([14]). Let where are primes. Then if and only if for each .
Using the Quadratic Reciprocity Theorem for identifying quadratic residues modulo a prime number, we present the following proposition:
Proposition 3.
For any prime number and any , then
Proof.
Consider a vertex in and a prime number such that for a positive integer . Applying the Quadratic Reciprocity Theorem, we find that is a quadratic residue modulo . Consequently, and share identical squares, leading to their status as non-adjacent vertices. As a result, the degree of is given by .
Alternatively, when is a prime number satisfying for some positive integer , the Quadratic Reciprocity Theorem implies that is a non-quadratic residue modulo . Notably, as is a cyclic group, is adjacent to all vertices in . Thus, the degree of is determined as . □
Corollary 3.
Let be any prime number such that , then the graph is .
Corollary 4.
Let be any prime number such that , then the graph is a -regular graph.
For prime numbers, , the subgraph which consists of non-quadratic residues vertices in , let us call it , is a complete subgraph. However, for some composite integers , is not regular. For example, in and , the graphs are not regular, and the degrees of vertices are different, as shown in Figure 1. Nevertheless, the respective subgraphs containing quadratic residues for these specified values of are empty.
Figure 1.
Shown are graphs of non-quadratic residues modulo n. Panel (a) description of the case n = 15. Panel (b) description of the case n = 20.
Theorem 4.
Let and , then .
Proof .
Since the number of vertices in the graph is determined by , and since the congruence has either no solution or exactly two incongruent solutions, any vertex is connected to all vertices in this graph except the vertex . Therefore, . □
Proposition 4.
For any integer , and , then
Proof.
Let . Since the order of the set is determined by , and since is a non-quadratic residue, any vertex is connected to all vertices in this graph. Therefore, . Similarly, when , then is a quadratic residue. Thus, any vertex is connected to all vertices except the vertex in this graph. Therefore, . □
Theorem 5.
Let are distinct odd primes and are positive integers. Then, the degree of any vertex is .
Proof.
Consider in the set . The congruence has either no solution or precisely two incongruent solutions for each prime power ; then, by the Chinese remainder theorem, there exist exactly incongruent solutions for the congruence . So, if the vertex is one of these solutions, there will be non-adjacent vertices to . Consequently, . □
Before exploring the discussion of vertex degrees within the quadratic residues group modulo a composite number , we introduce an integer defined as follows:
Theorem 6.
Let are distinct odd primes and , then
Proof.
We can establish the inclusion based on our previous discussions. According to Theorem 4, the degree of any vertex in depends on the number of incongruent solutions for the quadratic congruence , denoted as . However, as outlined in Proposition 3, the degree of any quadratic residue is influenced by the specific prime factor , where . Therefore, the term is replaced with the integer , resulting in the expression for . □
Proposition 5.
Let are distinct odd primes and are positive integers. Then, the degree of any vertex is .
Proof.
The proof follows by applying the Chinese Reminder Theorem on Theorem 6. □
To determine how many square roots an element can have, we present the following Lemma.
Lemma 1
([7]). Let denote the distinct primes dividing . If , then the number of elements such that is given by
The count of square roots is solely determined by the variable and remains independent of the element . Furthermore, in the presence of a single square root for a given element , all additional square roots can be obtained by identifying all solutions of through the approach outlined in Example 318 from ref. [14]. Consequently, the order of the group can be ascertained by dividing by , as demonstrated in exercise 7.4 in ref. [14].
Proposition 6.
Let are distinct odd primes dividing , then the degree of any vertex is:
Proof.
The proof follows from Lemma 1 and Theorem 6. □
Recall that for a composite number , Euler’s totient function can be calculated using the prime factorization, and the formula provides the count of positive integers less than or equal to that are relatively prime to .
Theorem 7.
Let are distinct odd primes and are positive integers. Then, the degree of any vertex is:
Proof.
Recall that the congruence has either no solution or exactly four incongruent solutions for . Also, has two solutions, and has one solution. Moreover, the congruence has either no solution or exactly 2 incongruent solutions if is an odd prime. By applying the Chinese Remainder Theorem, if , we determine that has either no solution or solutions. Thus, we have non-adjacent vertices. Also, if , the congruence has either no solution or solutions. Therefore, there are non-adjacent vertices. Finally, if , the congruence has either no solution or solutions. Consequently, we have non-shared vertices. □
Corollary 5.
Let are distinct odd primes and are positive integers, and , then
3. Computer Calculations for Some Integers
In this section, we present three tables featuring computer-generated computations encompassing various parameters, including factors of , Euler’s totient function (), idempotents, nilpotents, and the set of vertices , , and . Also, the set of degrees of vertices in is denoted as D, is denoted as D, and is denoted as D. Within this table, degrees in empty graphs and are represented as {}, and highlighted rows draw attention to complete graphs in .
Throughout the calculations embedded in Table 1, Table 2 and Table 3 for the induced values of , we make note of the following observations:
Table 1.
Computer calculations for .
Table 2.
Computer calculations for .
Table 3.
Computer calculations for .
- The graph is regular but not complete.
- The graph is regular for values of and is not complete. However, for values of , it is complete. Notably, it is complete for certain composite values of such as
- The graph is not regular, thus it is not complete for any induced value of .
- In general, the variation of degrees of vertices in is not influenced by idempotent and nilpotent properties.
4. Conclusions
This scientific exploration contributes to the understanding of quadratic congruences and their graphical representations, offering valuable insights into the structure and properties of associated graphs. The presented results and analyses pave the way for further investigations in graph theory and number theory.
Author Contributions
Conceptualization, O.S.; Methodology, H.D. and O.S.; Software, O.S.; Validation, O.S. and A.A.A.; Investigation, H.D. and O.S.; Resources, H.D. and A.A.A.; Writing—original draft, H.D. and O.S.; Writing—review & editing, H.D. and A.A.A.; Funding acquisition, A.A.A. All authors have read and agreed to the published version of the manuscript.
Funding
This research received no external funding.
Data Availability Statement
This study was not supported by any actual data. Anyone may utilize the hypothetical information used in this research by just citing this article.
Acknowledgments
Researchers acknowledge the Deanship of Scientific Research at Qassim University for funding the publication of this research, Zawia University and Sabratha University.
Conflicts of Interest
The authors declare no conflicts of interest.
Correction Statement
This article has been republished with a minor correction to the existing affiliation information. This change does not affect the scientific content of the article.
List of Symbols
| Symbol | Description |
| The ring of integers modulo . | |
| The group of units modulo . | |
| The group of quadratic residues modulo . | |
| The undirected graph of the ring . | |
| The undirected graph of the ring . | |
| The undirected graph of the ring . | |
| The undirected graph of the ring . | |
| The set of vertices in the undirected graph . | |
| The set of vertices in the undirected graph . | |
| The set of vertices in the undirected graph . | |
| The Euler totient function. | |
| . | |
| . | |
| . | |
| . | |
| The set of edges in the undirected graph . | |
| The set of edges in the undirected graph . | |
| The set of edges in the undirected graph . | |
| The degree of a vertex . | |
| The number roots of a quadratic residue. |
References
- Castillo, J.H.; Jhony, F.; Caranguay, M. The set of k-units modulo n. Involv. A J. Math. 2022, 15, 367–378. [Google Scholar] [CrossRef] [Scilit]
- Mateen, M.H.; Mahmood, M.K.; Ali, S.; Alam, M.D.A. On symmetry of complete graphs over quadratic and cubic residues. J. Chem. 2021, 2021, 4473637. [Google Scholar] [CrossRef] [Scilit]
- Ali, B.; Jahani-Nezhad, R. Unit and unitary Cayley graphs for the ring of Gaussian integers modulo n. Quasigroups Relat. Syst. 2017, 25, 189–200. [Google Scholar]
- Somer, L.; Michal, K. Structure of digraphs associated with quadratic congruences with composite moduli. Discret. Math. 2006, 306, 2174–2185. [Google Scholar] [CrossRef] [Scilit]
- Mateen, M.; Mahmmod, M.; Alghazzawi, D.; Liu, J.-B. Structures of power digraphs over the congruence equation xp ≡ y (mod m) and enumerations. AIMS Math. 2021, 6, 4581–4596. [Google Scholar] [CrossRef] [Scilit]
- Deng, G.; Pingzhi, Y. On the symmetric digraphs from powers modulo n. Discret. Math. 2012, 312, 720–728. [Google Scholar] [CrossRef] [Scilit]
- Fabrykowski, J. On quadratic residues and nonresidues in difference sets modulo m. Proc. Am. Math. Soc. 1994, 122, 325–331. [Google Scholar] [CrossRef] [Scilit]
- Daoub, H. An Exposition of Graphs Related to Finite Commutative Rings. In Proceedings of the 1st International Conference of the Faculties of Sciences, Faculty of Science, Zawia, Libya, 20 December 2021; pp. 341–347. [Google Scholar]
- Rogers, T.D. The graph of the square mapping on the prime fields. Discret. Math. 1996, 148, 317–324. [Google Scholar] [CrossRef] [Scilit]
- Rezaei, M.; Rehman, S.; Khan, Z.; Baig, A.; Farahani, M. Quadratic residues graph. Int. J. Pure Appl. Math 2017, 113, 465–470. [Google Scholar] [CrossRef] [Scilit]
- Pirzada, S.; Altaf, A. Co-unit graphs associated to ring of integers modulo n. Acta Univ. Sapientiae Math. 2022, 14, 308–316. [Google Scholar] [CrossRef] [Scilit]
- Daoub, H.; Shafah, O. Graphs Related to Finite Abelian Groups. J. Fac. Educ. 2021, 24, 13–23. [Google Scholar]
- Dudley, U. Elementary Number Theory; Courier Corporation: Chelmsford, MA, USA, 2012. [Google Scholar]
- Jones, G.A.; Jones, J.M. Elementary Number Theory; Springer Science & Business Media: Berlin/Heidelberg, Germany, 1998. [Google Scholar]
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content. |
© 2024 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/).
