Symplectic graphs over finite commutative rings

Symplectic graphs over finite local rings

It is very well known that algebraic structures have valuable applications in the theory of error-correcting codes. Blake [Codes over certain rings, Inform. and Control 20 (1972) 396–404] has constructed cyclic codes over ℤm and in [Codes over integer residue rings, Inform. and Control 29 (1975), 295–300] derived parity check-matrices for these codes. In [Linear codes over finite rings, Tend. Math. Appl. Comput. 6(2) (2005) 207–217]. Andrade and Palazzo present a construction technique of cyclic, BCH, alternant, Goppa and Srivastava codes over a local finite ring B. However, in [Encoding through generalized polynomial codes, Comput. Appl. Math. 30(2) (2011) 1–18] and [Constructions of codes through semigroup ring [Formula: see text] and encoding, Comput. Math. Appl. 62 (2011) 1645–1654], Shah et al. extend this technique of constructing linear codes over a finite local ring B via monoid rings [Formula: see text], where p = 2 and k = 1, 2, respectively, instead of the polynomial ring B[X]. In this paper, we construct these codes through the monoid ring [Formula: see text], where p = 2 and k = 1, 2, 3. Moreover, we also strengthen and generalize the results of [Encoding through generalized polynomial codes, Comput. Appl. Math.30(2) (2011) 1–18] and [Constructions of codes through semigroup ring [Formula: see text]] and [Encoding, Comput. Math. Appl.62 (2011) 1645–1654] to the case of k = 3.

Circulant matrices form an important class of matrices that have been continuously studied due to their nice algebraic structures and wide applications. In this study, we focus specifically on negacirculant matrices, which are known as extensions of the classical circulant matrices. The algebraic structures of the rings of n × n n\times n negacirculant matrices over finite fields and over finite commutative chain rings are presented. Subsequently, the algebraic structures and enumeration of the unit groups of such matrix rings are established. Additionally, the number of non-singular n × n n\times n negacirculant matrices with prescribed determinant is given in some cases. Conjectures and open problems are proposed as well as a brief discussion in the case where the underlying ring is a finite commutative ring with identity is also presented.

On the ℓ-DLIPs of codes over finite commutative rings

No AccessTwisted Hessian curves over the ring 𝔽q[∈], ∈2 = 0Abdelâli Grini, Abdelhakim Chillali, Lhoussain El Fadil and Hakima MouanisAbdelâli GriniDepartment of Mathematics, Faculty of Science Dhar El Mahraz-Fez, S.M. Ben Abdellah University, Fez, Morocco, Abdelhakim ChillaliDepartment of Mathematics, Physical and Computer Sciences, FP, LSI, Taza, S.M. Ben Abdellah University, Fez, Morocco, Lhoussain El FadilDepartment of Mathematics, Faculty of Science Dhar El Mahraz-Fez, S.M. Ben Abdellah University, Fez, Morocco and Hakima MouanisDepartment of Mathematics, Faculty of Science Dhar El Mahraz-Fez, S.M. Ben Abdellah University, Fez, MoroccoPublished Online:November 28, 2022pp 181-189https://doi.org/10.1504/IJCAET.2023.127795PDF ToolsAdd to FavouritesDownload CitationsTrack Citations Share this article on social mediaShareShare onFacebookTwitterLinkedInReddit AboutAbstractThe goal of this work is to study some arithmetic proprieties of the twisted Hessian curves defined by a equation of type: aX3 + Y3 + Z3 = dXYZ on the local ring R2 = 𝔽q[X]/(X2), where p ≥ 5 is a prime number, q = pd and d ∈ ℕ*, such that -3 is not a square in 𝔽q. This paper consists of an introduction, section, and a conclusion. In the introduction, we review some fundamental arithmetic proprieties of finite local rings R2, which will be used in the remainder of this article. The section is devoted to the study the above mentioned twisted Hessian curves on these finite local rings for restriction to some specific characteristic p ≥ 5. Using these studies, we give essential properties and we define the group H2a,d, these properties, the classification of these elements and a bijection between the sets H2a,d and Ha0,d0 × 𝔽q, where Ha0,d0 is the twisted Hessian curve over the finite field 𝔽q.Keywordstwisted Hessian curves, finite over ring, cryptography, elliptic curves, local ring Previous article Next article FiguresReferencesRelatedDetails Volume 18Issue 1-32023 ISSN: 1757-2657eISSN: 1757-2665 HistoryPublished onlineNovember 28, 2022 Copyright © 2023 Inderscience Enterprises Ltd.Keywordstwisted Hessian curvesfinite over ringcryptographyelliptic curveslocal ringAuthors and AffiliationsAbdelâli Grini1 Abdelhakim Chillali2 Lhoussain El Fadil3 Hakima Mouanis4 1. Department of Mathematics, Faculty of Science Dhar El Mahraz-Fez, S.M. Ben Abdellah University, Fez, Morocco2. Department of Mathematics, Physical and Computer Sciences, FP, LSI, Taza, S.M. Ben Abdellah University, Fez, Morocco3. Department of Mathematics, Faculty of Science Dhar El Mahraz-Fez, S.M. Ben Abdellah University, Fez, Morocco4. Department of Mathematics, Faculty of Science Dhar El Mahraz-Fez, S.M. Ben Abdellah University, Fez, MoroccoPDF download

Given a finite (associative, unital) ring R, let K(R) denote the set of polynomials in R[x] that send each element of R to 0 under evaluation. We study K(R) and its elements. We conjecture that K(R) is a two-sided ideal of R[x] for any finite ring R, and prove the conjecture for several classes of finite rings (including commutative rings, semisimple rings, local rings, and all finite rings of odd order). We also examine a connection to sets of integer-valued polynomials.

Let $R$ be a finite commutative ring of odd characteristic and let $V$ be a free $R$-module of finite rank. We classify symmetric inner products defined on $V$ up to congruence and find the number of such symmetric inner products. Additionally, if $R$ is a finite local ring, the number of congruent symmetric inner products defined on $V$ in each congruence class is determined.

Linear dynamical systems over finite rings

Matrix product codes with rosenbloom-tsfasman metric

For an element $x$ of a commutative ring $R$, let $\Gamma_x(R)$ be the graph whose vertices are the elements of $R$ that divide $x$ such that distinct vertices $r$ and $s$ are adjacent if and only if $rs=x$. If $x$ is a nonzero nonirreducible nonunit of an integral domain $R$, then $\Gamma_x^\mathcal{C}(R)$ is the graph whose vertices are the associate classes of divisors of $x$ that are neither units nor associates of $x$ such that distinct vertices $A$ and $B$ are adjacent if and only if $rs$ divides $x$ for some (and hence every) $r\in A$ and $s\in B$. The graphs $\Gamma_x(R)$ are considered when $R$ is a local Artinian principal ideal ring, and $\Gamma_x^\mathcal{C}(R)$ is examined when $R$ is a valuation domain. For example, it is shown that a finite local ring $R$ is a principal ideal ring if and only if there exists $x\in R$ such that every connected component of $\Gamma_x(R)$ is a star graph of a prescribed cardinality. Moreover, it is proved that an integral domain $R$ is a discrete valuation ring if and only if its collection of graphs $\Gamma_x^\mathcal{C}(R)$ consists precisely of a single-vertex graph, along with every (up to isomorphism) graph that is realizable as the compressed $0$-divisor graph of a local Artinian principal ideal ring. Certain graphs associated with partially ordered abelian groups have an essential role in the work.

On Representability of a Finite Local Ring

It was shown by C. Wickham [12] that “for a fixed positive integer g, there are finitely many isomorphism classes of finite commutative rings whose zero-divisor graph has genus g.” In this note, we give a short direct proof for this result. Moreover, we show that, if the zero-divisor graph of a commutative ring R has finite genus g, then either g = 0 or R is a finite ring. This immediately generalizes Wickham's theorem to arbitrary (not necessary finite) commutative rings.

In this work, we propose a new way to use lattice theory to build a public key cryptosystem and digital signature scheme. This cryptosystem based on the approximate closest vector problem and the problem of the discrete logarithm on an elliptic curve defined on a finite local ring. At first, we choose a point on the elliptic curve and we will make the exchange of keys to the Diffie-Hellman. We transform the coordinates of this point into a matrix which gives us the private key which will serve us for encryption and decryption.

Let <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="upper I"> <mml:semantics> <mml:mi>I</mml:mi> <mml:annotation encoding="application/x-tex">I</mml:annotation> </mml:semantics> </mml:math> </inline-formula> be a proper nonnilpotent ideal in a local (Noetherian) ring <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="left-parenthesis upper R comma upper M right-parenthesis"> <mml:semantics> <mml:mrow> <mml:mo stretchy="false">(</mml:mo> <mml:mi>R</mml:mi> <mml:mo>,</mml:mo> <mml:mi>M</mml:mi> <mml:mo stretchy="false">)</mml:mo> </mml:mrow> <mml:annotation encoding="application/x-tex">(R,M)</mml:annotation> </mml:semantics> </mml:math> </inline-formula> and let <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="upper J"> <mml:semantics> <mml:mi>J</mml:mi> <mml:annotation encoding="application/x-tex">J</mml:annotation> </mml:semantics> </mml:math> </inline-formula> be a reduction of <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="upper I"> <mml:semantics> <mml:mi>I</mml:mi> <mml:annotation encoding="application/x-tex">I</mml:annotation> </mml:semantics> </mml:math> </inline-formula> ; that is, <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="upper J"> <mml:semantics> <mml:mi>J</mml:mi> <mml:annotation encoding="application/x-tex">J</mml:annotation> </mml:semantics> </mml:math> </inline-formula> <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="subset-of-or-equal-to"> <mml:semantics> <mml:mo> ⊆ </mml:mo> <mml:annotation encoding="application/x-tex">\subseteq</mml:annotation> </mml:semantics> </mml:math> </inline-formula> <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="upper I"> <mml:semantics> <mml:mi>I</mml:mi> <mml:annotation encoding="application/x-tex">I</mml:annotation> </mml:semantics> </mml:math> </inline-formula> and <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="upper J upper I Superscript n"> <mml:semantics> <mml:mrow> <mml:mi>J</mml:mi> <mml:msup> <mml:mi>I</mml:mi> <mml:mi>n</mml:mi> </mml:msup> </mml:mrow> <mml:annotation encoding="application/x-tex">JI^n</mml:annotation> </mml:semantics> </mml:math> </inline-formula> <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="equals"> <mml:semantics> <mml:mo>=</mml:mo> <mml:annotation encoding="application/x-tex">=</mml:annotation> </mml:semantics> </mml:math> </inline-formula> <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="upper I Superscript n plus 1"> <mml:semantics> <mml:msup> <mml:mi>I</mml:mi> <mml:mrow class="MJX-TeXAtom-ORD"> <mml:mi>n</mml:mi> <mml:mo>+</mml:mo> <mml:mn>1</mml:mn> </mml:mrow> </mml:msup> <mml:annotation encoding="application/x-tex">I^{n+1}</mml:annotation> </mml:semantics> </mml:math> </inline-formula> for some nonnegative integer <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="n"> <mml:semantics> <mml:mi>n</mml:mi> <mml:annotation encoding="application/x-tex">n</mml:annotation> </mml:semantics> </mml:math> </inline-formula> . We prove that there exists a finite free local unramified extension ring <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="upper S"> <mml:semantics> <mml:mi>S</mml:mi> <mml:annotation encoding="application/x-tex">S</mml:annotation> </mml:semantics> </mml:math> </inline-formula> of <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="upper R"> <mml:semantics> <mml:mi>R</mml:mi> <mml:annotation encoding="application/x-tex">R</mml:annotation> </mml:semantics> </mml:math> </inline-formula> such that the ideal <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="upper I upper S"> <mml:semantics> <mml:mrow> <mml:mi>I</mml:mi> <mml:mi>S</mml:mi> </mml:mrow> <mml:annotation encoding="application/x-tex">IS</mml:annotation> </mml:semantics> </mml:math> </inline-formula> has a minimal reduction <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="upper K"> <mml:semantics> <mml:mi>K</mml:mi> <mml:annotation encoding="application/x-tex">K</mml:annotation> </mml:semantics> </mml:math> </inline-formula> <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="subset-of-or-equal-to"> <mml:semantics> <mml:mo> ⊆ </mml:mo> <mml:annotation encoding="application/x-tex">\subseteq</mml:annotation> </mml:semantics> </mml:math> </inline-formula> <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="upper J upper S"> <mml:semantics> <mml:mrow> <mml:mi>J</mml:mi> <mml:mi>S</mml:mi> </mml:mrow> <mml:annotation encoding="application/x-tex">JS</mml:annotation> </mml:semantics> </mml:math> </inline-formula> with the property that the number of elements in a minimal generating set of <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="upper K"> <mml:semantics> <mml:mi>K</mml:mi> <mml:annotation encoding="application/x-te

We study the compressed zero-divisor graph of a finite associative ring R. In particular, we describe commutative finite rings with compressed zero-divisor graphs of order 2. Moreover, we find all graphs of order 3 that are the compressed zero-divisor graphs of some finite rings.