Papers by Intan Muchtadi-Alamsyah
arXiv (Cornell University), Oct 6, 2019
Bookmarks Related papers MentionsView impact
Journal of physics, May 1, 2020
The notion of Jacobson graph and n-array Jacobson graph of a commutative ring were introduced in ... more The notion of Jacobson graph and n-array Jacobson graph of a commutative ring were introduced in 2012 and 2018, respectively, by Azimi et al and Ghayour et al. In this article we generalize them to matrix Jacobson graph. Let R be a commutative ring. The matrix Jacobson graph of a ring R, denoted J ( R ) m × n , is defined as a graph with vertex set is the set of matrix of ring without the matrix of its Jacobson such that two distinct vertices A, B are adjacent if and only if 1 − det(AtB) is not a unit of ring. In this article we study the matrix Jacobson graph where the underlying ring R is a finite field. Since any matrix of size m × n over a field F can be considered as a linear mapping from linear space Fm to Fn , we employ the structure of linear mappings on finite dimensional vector spaces to derive some properties of square and non square matrix Jacobson graph of fields, including their diameters.
Bookmarks Related papers MentionsView impact
Journal of physics, 2021
Let n ≥ 2. A Jacobson graph over ℤ n is a graph with vertex set all elements in ℤ n except elemen... more Let n ≥ 2. A Jacobson graph over ℤ n is a graph with vertex set all elements in ℤ n except elements in its Jacobson radical, and x and y are adjacent if and only if 1 − xy is not relative prime to n. In this paper, we give a characterization of Jacobson graph over ℤ n as a foundation for Jacobson graph over a finite commutative ring.
Bookmarks Related papers MentionsView impact
ITB Journal of Information and Communication Technology, 2012
Bookmarks Related papers MentionsView impact
Pattimura Proceeding: Conference of Science and Technology, Jul 1, 2017
Bookmarks Related papers MentionsView impact
Journal of physics, 2021
The Maximum Distance Separable (MDS) matrices have an important application in cryptography, for ... more The Maximum Distance Separable (MDS) matrices have an important application in cryptography, for example see [1]. In order to reduce the implementation complexities, it is important to consider MDS matrices which are involutory. Some constructions of involutory MDS matrices can be found in [2, 3]. In this paper, we give some properties related to a construction of involutory MDS matrices using orthogonal matrices derived from Euclidean self-dual MDS codes. Then, we do a computer search to find involutory MDS matrices with small sizes using classical simulated annealing algorithm. The proposed construction is different compared to the ones in [2, 3].
Bookmarks Related papers MentionsView impact
arXiv (Cornell University), May 17, 2017
Bookmarks Related papers MentionsView impact
arXiv (Cornell University), Apr 15, 2019
Bookmarks Related papers MentionsView impact
Applied sciences, Aug 4, 2022
Bookmarks Related papers MentionsView impact
Mathematical theory and modeling, 2021
Bookmarks Related papers MentionsView impact
Advances in Mathematics, Aug 30, 2020
Bookmarks Related papers MentionsView impact
JP journal of algebra, number theory and applications, Mar 2, 2016
Bookmarks Related papers MentionsView impact
Bookmarks Related papers MentionsView impact
Journal of Physics: Conference Series, 2021
Mobile edugames were popular and has grown rapidly due to their ease of access, affordability, an... more Mobile edugames were popular and has grown rapidly due to their ease of access, affordability, and interactivity. There have been numerous arithmetic related mobile edugames developed and available online. However, there are not so many mathematics mobile edugames existed which emphasize the basic concepts in accordance with Indonesia available curriculum and optimalize specific learning methods that suitable for targeted learner have been developed, particularly in basic division and multiplication materials. Through this study, the design of mathematics mobile edugame about basic division and multiplication with repetitive addition and subtraction concept will be discussed using TPACK framework that generates design recommendation and its application in mathematics mobile edugame with discovery-based learning model as an outcome. It uses specific TPACK plot from PCK to TPACK. The result shows in optimization used of technology in mathematics mobile edugame design user cognitive ps...
Bookmarks Related papers MentionsView impact
Journal of Physics: Conference Series, 2017
Bookmarks Related papers MentionsView impact
For an algebraically closed field K, given a finite dimensional K-algebra A of finite representat... more For an algebraically closed field K, given a finite dimensional K-algebra A of finite representation-type, we can store all the information of the module category mod A by its Auslander Reiten quiver of mod A. In this paper, we will determine the Auslander Reiten quiver of Nakayama algebra N n-2,n for every natural number n greater than or equal to 3 , that is the Nakayama algebra KQ/I where Q is a linear orientation cyclic quiver with vertices and denotes the ideal of the path algebra KQ generated by the paths of length of n – 1 . Keywords : AR-quiver , Nakayama algebra, Quiver. Quiver Auslander Reiten dari Aljabar Nakayama N n-2,n Abstrak Diberikan K-aljabar A berdimensi hingga tipe representasi hingga dengan K suatu lapangan yang tertutup secara aljabar, kita dapat menyimpan semua informasi dari kategori modul kanan mod A menggunakan Auslander Reiten quiver (AR-quiver) dari mod A. Dalam artikel ini, kita akan menentukan quiver Auslander Reiten dari aljabar Nakayama untuk setiap bilangan asli n lebih besar sama dengan 3 . Aljabar N n-2,n adalah aljabar Nakayama KQ/I dimana Q adalah quiver siklis berorientasi linier dengan titik dan I adalah ideal dari aljabar lintasan KQ yang dibangun oleh lintasan panjang n – 1 . 72 1024x768 Normal 0 false false false Kata Kunci : AR-quiver, Aljabar Nakayama, Quiver. 72 1024x768 Normal 0 false false false
Bookmarks Related papers MentionsView impact
Journal of Physics: Conference Series, 2018
Bookmarks Related papers MentionsView impact
Southeast Asian Bulletin of Mathematics, Dec 12, 2020
Bookmarks Related papers MentionsView impact
Commentationes Mathematicae Universitatis Carolinae, 2019
Bookmarks Related papers MentionsView impact
MATHEMATICA
A group G is called a non-inner nilpotent group, whenever it is nilpotent with respect to a non-i... more A group G is called a non-inner nilpotent group, whenever it is nilpotent with respect to a non-inner automorphism. In 2018, all finitely generated abelian non-inner nilpotent groups have been classified. Actually, the authors proved that a finitely generated abelian group G is a non-inner nilpotent group, if G is not isomorphic to cyclic groups Z_p_1p_2...p_t and Z, for a positive integer t and distinct primes p_1, p_2,..., p_t. We conjecture that all finite non-abelian p-groups are non-inner nilpotent and we prove this conjecture for finite $p$-groups of nilpotency class 2 or of co-class 2.
Bookmarks Related papers MentionsView impact
Uploads
Papers by Intan Muchtadi-Alamsyah
An efficient implementation of binary field arithmetic is an important prerequisite in Rijndael because Rijndael operations are performed using arithmetic operations in the underlying field. Two of the most common basis used in binary fields are polynomial basis and normal basis. In normal basis, raising to the 2th power is just a cyclic shift of the coordinates and therefore essentially free. One of the step in Rijndael algorithm is BytesSub which consists of inversion and affine transformation. In this paper we propose algorithms to speed up the encryption/decryption process in Rijndael. To be more precise we propose the use of storage efficient basis conversion from polynomial basis into normal basis and vice versa and the use of inversion algorithm in normal basis."
Social network analysis provides several metrics, which was built with no scalability in minds, thus it is computationally exhaustive. Some metrics such as centrality and community detections has exponential time and space complexity. With the availability of cheap but large-scale data, our challenge is how to measure social interactions based on those large-scale data. In this paper, we present our approach to reduce the computational complexity of social network analysis metrics based on graph compression method to solve real world brand awareness effort.