Enumeration of Involutions of Finite Rings
نویسندگان
چکیده
In this paper, we study a special class of elements in the finite commutative rings called involutions. An involution ring R is an element with property that x^2-1=0 for some x R. This describes both implementation and enumeration involutions various rings, such as cyclic non-cyclic zero-rings, fields, especially Gaussian integers. The paper begins simple well-known results equation over It provides concrete setting to enumerate R, along isomorphic relation I(R)≅Z_2^k.
منابع مشابه
On the Eulerian Enumeration of Involutions
We consider in this work the enumeration of involutions by descent sets, and based on that, by descent numbers. Formulas of the number of involutions with a prescribed descent set, with a prescribed descent number and Frobenius-type formulas are given.
متن کاملPattern-avoiding involutions: exact and asymptotic enumeration
We consider the enumeration of pattern-avoiding involutions, focusing in particular on sets defined by avoiding a single pattern of length 4. We directly enumerate the involutions avoiding 1342 and the involutions avoiding 2341. As we demonstrate, the numerical data for these problems exhibits some surprising behavior. This strange behavior even provides some very unexpected data related to the...
متن کاملCoset enumeration of groups generated by symmetric sets of involutions
The well-known Todd-Coxeter algorithm [14], which may be viewed as a means of constructing permutation representations of finitely presented groups, remains a primary reference for coset enumeration programs. All the strategies and variants of this algorithm perform essentially the same calculations as the original algorithm, merely choosing different orders in which to process the available in...
متن کاملReversible Rings with Involutions and Some Minimalities
In continuation of the recent developments on extended reversibilities on rings, we initiate here a study on reversible rings with involutions, or, in short, ∗-reversible rings. These rings are symmetric, reversible, reflexive, and semicommutative. In this note we will study some properties and examples of ∗-reversible rings. It is proved here that the polynomial rings of ∗-reversible rings may...
متن کاملEnumeration of Bruhat intervals between nested involutions in Sn
For any n ≥ 2, let Sn be the symmetric group of n elements equipped with the Bruhat ordering ≤; see e.g. [3, 6, 8, 21, 22]. One of the most celebrated combinatorial and algebraic problems is to study its Bruhat graph and its Bruhat intervals [a, b] = {z ∈ Sn : a ≤ z ≤ b} for a, b ∈ Sn; see e.g. [1, 7, 12, 15]. These are intimately related with the Kazhdan–Lusztig polynomials of Sn and the algeb...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of new theory
سال: 2021
ISSN: ['2149-1402']
DOI: https://doi.org/10.53570/jnt.971924