• Title/Summary/Keyword: Group inverse

Search Result 294, Processing Time 0.03 seconds

THE INVERSE GALOIS PROBLEM

  • MATYSIAK, LUKASZ
    • Journal of applied mathematics & informatics
    • /
    • v.40 no.3_4
    • /
    • pp.765-767
    • /
    • 2022
  • The inverse Galois problem concerns whether or not every finite group appears as the Galois group of some Galois extension of the rational numbers. This problem, first posed in the early 19th century, is unsolved. In other words, we consider a pair - the group G and the field K. The question is whether there is an extension field L of K such that G is the Galois group of L. In this paper we present the proof that any group G is a Galois group of any field extension. In other words, we only consider the group G. And we present the solution to the inverse Galois problem.

EFFICIENT ALGORITHM FOR FINDING THE INVERSE AND THE GROUP INVERSE OF FLS $\gamma-CIRCULANT$ MATRIX

  • JIANG ZHAO-LIN;XU ZONG-BEN
    • Journal of applied mathematics & informatics
    • /
    • v.18 no.1_2
    • /
    • pp.45-57
    • /
    • 2005
  • An efficient algorithm for finding the inverse and the group inverse of the FLS $\gamma-circulant$ matrix is presented by Euclidean algorithm. Extension is made to compute the inverse of the FLS $\gamma-retrocirculant$ matrix by using the relationship between an FLS $\gamma-circulant$ matrix and an FLS $\gamma-retrocirculant$ matrix. Finally, some examples are given.

AUGMENTED INVERSE GRAPHS WITH RESPECT TO A GROUP

  • M. LAKSHMI KAMESWARI;N. NAGA MARUTHI KUMARI;T.V. PRADEEP KUMAR
    • Journal of applied mathematics & informatics
    • /
    • v.41 no.2
    • /
    • pp.287-293
    • /
    • 2023
  • In this paper, the Augmented graph Es(τ) of the inverse graph Gs(τ) of a cyclic group (τ,◦) was studied. The Augmented inverse graph was constructed by applying the method of Mycielski's construction. The dimension of Augmented inverse graph and different properties of the graph were investigated. Later the chromatic number of Augmented inverse graph was discussed and the relation between the maximum degree of the graph and the chromatic number was established. In the Mycielski's construction, the properties of the key node 'u' in Es (τ) were established based on cardinality of the cyclic group (τ,◦) and also proved that the Augmented inverse graph Es(τ) was a triangle free graph.

CONTINUOUS ORBIT EQUIVALENCES ON SELF-SIMILAR GROUPS

  • Yi, Inhyeop
    • Bulletin of the Korean Mathematical Society
    • /
    • v.58 no.1
    • /
    • pp.133-146
    • /
    • 2021
  • For pseudo-free and recurrent self-similar groups, we show that continuous orbit equivalence of inverse semigroup partial actions implies continuous orbit equivalence of group actions. Conversely, if group actions are continuous orbit equivalent, and the induced homeomorphism commutes with the shift maps on their groupoids, we obtain continuous orbit equivalence of inverse semigroup partial actions.

CONTINUOUS SHADOWING AND STABILITY FOR GROUP ACTIONS

  • Kim, Sang Jin
    • Journal of the Korean Mathematical Society
    • /
    • v.56 no.1
    • /
    • pp.53-65
    • /
    • 2019
  • Recently, Chung and Lee [2] introduced the notion of topological stability for a finitely generated group action, and proved a group action version of the Walters's stability theorem. In this paper, we introduce the concepts of continuous shadowing and continuous inverse shadowing of a finitely generated group action on a compact metric space X with respect to various classes of admissible pseudo orbits and study the relationships between topological stability and continuous shadowing and continuous inverse shadowing property of group actions. Moreover, we introduce the notion of structural stability for a finitely generated group action, and we prove that an expansive action on a compact manifold is structurally stable if and only if it is continuous inverse shadowing.

GALOIS GROUP OF GENERALIZED INVERSE POLYNOMIAL MODULES

  • Park, Sang-Won;Jeong, Jin-Sun
    • East Asian mathematical journal
    • /
    • v.24 no.2
    • /
    • pp.139-144
    • /
    • 2008
  • Given an injective envelope E of a left R-module M, there is an associative Galois group Gal($\phi$). Let R be a left noetherian ring and E be an injective envelope of M, then there is an injective envelope E[$x^{-1}$] of an inverse polynomial module M[$x^{-1}$] as a left R[x]-module and we can define an associative Galois group Gal(${\phi}[x^{-1}]$). In this paper we extend the Galois group of inverse polynomial module and can get Gal(${\phi}[x^{-s}]$), where S is a submonoid of $\mathds{N}$ (the set of all natural numbers).

  • PDF

Optimal distance exponent of inverse distance method (역거리법의 최적 거리 지수)

  • Yoo, Ju-Hwan
    • Journal of Korea Water Resources Association
    • /
    • v.51 no.5
    • /
    • pp.451-459
    • /
    • 2018
  • We calculated the optimal exponent values based on the hourly rainfall data observed in South Korea by treating the exponent value as a variable without fixing it as a square in the inverse distance method. For this purpose, rainfall observation stations providing the data are classified into four groups which are located at the Han river upstream, downstream, the Geum river upstream, and the Nakdong river midstream area. A total of 52 cases were analyzed for seven stations in each group. The optimal exponent value of distance was calculated in a case including one base station and four surrounding stations in a group. We applied the golden section search method to calculating this optimum values using rainfall data for 10 years (2004~2013) and verified the optimum values for the last three years (2014~2016). We compared and analyzed two results of the conventional inverse distance method and the inverse distance method in this study. The optimal values of distance exponent obtained in this study were 3.280, 1.839, 2.181, and 2.005 respectively, in the four groups, and totally mean value was 2.326. It is shown the proposed inverse distance method applying the optimal exponent is superior to the conventional inverse distance method.

THE APPLICATIONS OF ADDITIVE MAP PRESERVING IDEMPOTENCE IN GENERALIZED INVERSE

  • Yao, Hongmei;Fan, Zhaobin;Tang, Jiapei
    • Journal of applied mathematics & informatics
    • /
    • v.26 no.3_4
    • /
    • pp.541-547
    • /
    • 2008
  • Suppose R is an idempotence-diagonalizable ring. Let n and m be two arbitrary positive integers with $n\;{\geq}\;3$. We denote by $M_n(R)$ the ring of all $n{\times}n$ matrices over R. Let ($J_n(R)$) be the additive subgroup of $M_n(R)$ generated additively by all idempotent matrices. Let ($D=J_n(R)$) or $M_n(R)$. In this paper, by using an additive idem potence-preserving result obtained by Coo (see [4]), I characterize (i) the additive preservers of tripotence from D to $M_m(R)$ when 2 and 3 are units of R; (ii) the additive preservers of inverses (respectively, Drazin inverses, group inverses, {1}-inverses, {2}-inverses, {1, 2}-inverses) from $M_n(R)$ to $M_n(R)$ when 2 and 3 are units of R.

  • PDF