eng
University of Guilan
Journal of Algebra and Related Topics
2345-3931
2382-9877
2019-12-01
7
2
1
7
10.22124/jart.2019.14642.1168
4074
مقاله پژوهشی
Characterization of ^ϕ-amenability and ^ϕ-module amenability of semigroup algebras
S. Grailo Tanha
grailotanha@gmail.com
1
Esfarayen University of Technology, Esfarayen, North Khorasan,Iran
For every inverse semigroup $S$ with subsemigroup $E$ of idempotents, necessary and sufficient conditions are obtained for the semigroup algebra $\l ^{1}(S)$ to be $\hat{\phi}$-amenable and $\hat{\phi}$-module amenable. Also, we characterize the character amenability of semigroup algebra $l^1(S)$.
https://jart.guilan.ac.ir/article_4074_6a8f128b1c1515cb4f46d037c59e761a.pdf
Banach modules
Inverse semigroup
Semigroup algebras
Module amenability
$phi$-amenability
eng
University of Guilan
Journal of Algebra and Related Topics
2345-3931
2382-9877
2019-12-01
7
2
9
18
10.22124/jart.2020.14003.1157
4076
مقاله پژوهشی
Semi n-absorbing ideals in the semiring $\Bbb Z_{0+}$
J. N. Chaudhari
jnchaudhari@rediffmail.com
1
M. D. Suryawanshi
manoharsuryawanshi65@gmail.com
2
D. R. Bonde
drbonde@rediffmail.com
3
N. M. University
Department of Mathematics,SSVPS' L. K. Dr. P. R. Ghogrey Science College, Dhule-424 005, India.
Department of Mathematics, ACS College, Dharangaon-425 105, India
In this paper, all principal (m , n)-closed ideals and principal semi n-absorbing ideals in the semiring of non-negative integers are investigated.
https://jart.guilan.ac.ir/article_4076_abb1072e8e07d0693e02a2e8aec33e6b.pdf
Semiring
n-absorbing ideal
(m
n)-closed ideal
semi-n-absorbing ideal
eng
University of Guilan
Journal of Algebra and Related Topics
2345-3931
2382-9877
2019-12-01
7
2
19
30
10.22124/jart.2020.13887.1154
4140
مقاله پژوهشی
Connections between graphs and Sheaves
P. Sagar
vamsisagarpyla@gmail.com
1
M. Phani Kishore
kishorempk73@gvpce.ac.in
2
Swamy Vivekananda Engineering College, Vizianagaram, AP, India
Department of Information Technology,Gayatri Vidya Parishad College of Engineering (Autonomous), Madhurawada, Visakhapatnam, Andhra Pradesh, India.
In this paper, we discussed a method to construct a global sheaf space using graphs via Maximal compatibility blocks (MCB's) and we proposed the correspondence between graphs and sheaves. Further we discussed the sheaf constructions for various graphs using MCB's and vice-versa. We also presented some graph theoretical examples for the construction of sheaves.
https://jart.guilan.ac.ir/article_4140_14bf2bc5799a3987549caa7de9cc3519.pdf
Sheaf representation
maximal compatibility blocks
graphs
eng
University of Guilan
Journal of Algebra and Related Topics
2345-3931
2382-9877
2019-12-01
7
2
31
45
10.22124/jart.2020.14263.1161
4141
مقاله پژوهشی
Harary spectrum of generalized composition of graphs and Harary equienergetic graphs
H. Ramane
hsramane@yahoo.com
1
D. Patil
daneshwarip@gmail.com
2
K. Ashoka
ashokagonal@gmail.com
3
B. Parvathalu
bparvathalu@gmail.com
4
Department of Mathematics, Karnatak University, Dharwad - 580003, India
Department of Mathematics, Karnatak University, Dharwad,India
Department of Mathematics, Karnatak University, Dharwad - 580003, India
Department of Mathematics, Karnatak University's Karnatak Arts College, Dharwad - 580001, India
The Harary spectrum of a connected graph $G$ is the collection of the eigenvalues of its Harary matrix. The Harary energy of a graph $G$ is the sum of absolute values of its Harary eigenvalues. Harary equitable partition is defined and is used to obtain Harary spectrum of generalized composition of graphs. Harary equienergetic graphs have been constructed with the help of generalized composition through Harary equitable partition.
https://jart.guilan.ac.ir/article_4141_b38a61f4f274ee973786ac502e560b68.pdf
Harary matrix
Harary spectrum
Harary energy
equitable partition
equienergetic graphs
eng
University of Guilan
Journal of Algebra and Related Topics
2345-3931
2382-9877
2019-12-01
7
2
47
61
10.22124/jart.2020.15554.1187
4142
مقاله پژوهشی
The probability that the commutator equation [x,y]=g has solution in a finite group
M. Hashemi
m_hashemi@guilan.ac.ir
1
M. Pirzadeh
m.pirzadeh.math@gmail.com
2
S. A. Gorjian
sh.ali.gorjian@gmail.com
3
Faculty of mathematical sciences, University of Guilan.
Faculty of Mathematical Sciences, University of Guilan
University Compos 2, University of Guilan
Let G be a finite group. For g\in G, an ordered pair $(x_1,y_1)\in G\times G$ is called a solution of the commutator equation $[x,y]=g$ if $[x_1,y_1]=g$. We consider \rho_g(G)=\{(x,y)| x,y\in G, [x,y]=g\}, then the probability that the commutator equation $[x,y]=g$ has solution in a finite group $G$, written P_g(G), is equal to \frac{|\rho_{g}(G)|}{|G|^2}. In this paper, we present two methods for the computing P_g(G). First by $GAP, we give certain explicit formulas for P_g(A_n) and P_g(S_n). Also we note that this method can be applied to any group of small order. Then by using the numerical solutions of the equation xy-zu \equiv t (mod~n), we derive formulas for calculating the probability of $\rho_g(G)$ where $G$ is a two generated group of nilpotency class 2.
https://jart.guilan.ac.ir/article_4142_b30a2ba407287566acc0fff8ba3f52db.pdf
GAP
Alternating groups
Symmetric groups
Nilpotent groups
eng
University of Guilan
Journal of Algebra and Related Topics
2345-3931
2382-9877
2019-12-01
7
2
63
83
10.22124/jart.2020.12926.1142
4159
مقاله پژوهشی
Finding a generator matrix of a multidimensional cyclic code
R. Andriamifidisoa
rmw278@yahoo.fr
1
R. Lalasoa
larissamarius.lm@gmail.com
2
T. Rabeherimanana
rabeherimanana.toussaint@yahoo.fr
3
Department of Mathematics and Computer Science, University of Antananarivo, Antananarivo, Madagascar
Department of Mathematics, University of Antananarivo, Antananarivo, Madagascar
Department of Mathematics, University of Antananarivo, p.O.Box 906,101 Antananarivo, Madagascar
We generalize Sepasdar's method for finding a gene-\\rator matrix of two-dimensional cyclic codes to find a generating set and a linearly independent subset of a general multicyclic code. From these sets, a basis of the code as a vector subspace can be deduced or constructed. A generator matrix can be then deduced from this basis.
https://jart.guilan.ac.ir/article_4159_cb7ac0866eae4244ee47a41c3eb4f8a2.pdf
Quotient ring
lexicographic order
ideal basis
multicyclic code
generator matrix