• 제목/요약/키워드: algebraic structure

검색결과 196건 처리시간 0.023초

EMBEDDING DISTANCE GRAPHS IN FINITE FIELD VECTOR SPACES

  • Iosevich, Alex;Parshall, Hans
    • 대한수학회지
    • /
    • 제56권6호
    • /
    • pp.1515-1528
    • /
    • 2019
  • We show that large subsets of vector spaces over finite fields determine certain point configurations with prescribed distance structure. More specifically, we consider the complete graph with vertices as the points of $A{\subseteq}F^d_q$ and edges assigned the algebraic distance between pairs of vertices. We prove nontrivial results on locating specified subgraphs of maximum vertex degree at most t in dimensions $d{\geq}2t$.

STRUCTURE OF 3-PRIME NEAR-RINGS SATISFYING SOME IDENTITIES

  • Boua, Abdelkarim
    • 대한수학회논문집
    • /
    • 제34권1호
    • /
    • pp.17-26
    • /
    • 2019
  • In this paper, we investigate commutativity of 3-prime near-rings ${\mathcal{N}}$ in which (1, ${\alpha}$)-derivations satisfy certain algebraic identities. Some well-known results characterizing commutativity of 3-prime near-rings have been generalized. Furthermore, we give some examples show that the restriction imposed on the hypothesis is not superfluous.

Fuzzy ideal graphs of a semigroup

  • Rao, Marapureddy Murali Krishna
    • Annals of Fuzzy Mathematics and Informatics
    • /
    • 제16권3호
    • /
    • pp.363-371
    • /
    • 2018
  • The main objective of this paper is to connect fuzzy theory, graph theory and fuzzy graph theory with algebraic structure. We introduce the notion of fuzzy graph of semigroup, the notion of fuzzy ideal graph of semigroup as a generalization of fuzzy ideal of semigroup, intuitionistic fuzzy ideal of semigroup, fuzzy graph and graph, the notion of isomorphism of fuzzy graphs of semigroups and regular fuzzy graph of semigroup and we study some of their properties.

GENERALIZED PSEUDO BE-ALGEBRAS

  • Aslam, Ayesha;Hussain, Fawad;Kim, Hee Sik
    • 호남수학학술지
    • /
    • 제43권2호
    • /
    • pp.325-342
    • /
    • 2021
  • In this paper, we define a new algebraic structure known as a generalized pseudo BE-algebra which is a generalization of a pseudo BE-algebra. We construct some examples in order to show the existence of the generalized pseudo BE-algebra. Moreover, we characterize different classes of generalized pseudo BE-algebras by some results.

HESITANT FUZZY p-IDEALS AND QUASI-ASSOCIATIVE IDEALS IN BCI-ALGEBRAS

  • Jun, Young Bae;Roh, Eun Hwan;Ahn, Sun Shin
    • 호남수학학술지
    • /
    • 제44권2호
    • /
    • pp.148-164
    • /
    • 2022
  • The main purpose of this paper is to apply the notion of hesitant fuzzy sets to an algebraic structure, so called a BCI-algebra. The primary goal of the study is to define hesitant fuzzy p-ideals and hesitant fuzzy quasi-associative ideals in BCI-algebras, and to investigate their properties and relations.

Commutativity Criteria for a Factor Ring R/P Arising from P-Centralizers

  • Lahcen Oukhtite;Karim Bouchannafa;My Abdallah Idrissi
    • Kyungpook Mathematical Journal
    • /
    • 제63권4호
    • /
    • pp.551-560
    • /
    • 2023
  • In this paper we consider a more general class of centralizers called I-centralizers. More precisely, given a prime ideal P of an arbitrary ring R we establish a connection between certain algebraic identities involving a pair of P-left centralizers and the structure of the factor ring R/P.

Transient soil-structure interaction with consistent description of radiation damping

  • Zulkifli, Ediansjah;Ruge, Peter
    • Structural Engineering and Mechanics
    • /
    • 제33권1호
    • /
    • pp.47-66
    • /
    • 2009
  • Radiation damping due to wave propagation in unbounded domains may cause a significant reduction of structural vibrations when excited near resonance. Here a novel matrix-valued algebraic Pad$\acute{e}$-like stiffness formulation in the frequency-domain and a corresponding state equation in the time domain are elaborated for a soil-structure interaction problem with a layered soil excited in a transient manner by a flexible rotor during startup and shutdown. The contribution of radiation damping caused by a soil-layer upon a rigid bedrock is characterized by the corresponding amount of critical damping as it is used in structural dynamics.

ALGEBRAIC STRUCTURES IN A PRINCIPAL FIBRE BUNDLE

  • Park, Joon-Sik
    • 충청수학회지
    • /
    • 제21권3호
    • /
    • pp.371-376
    • /
    • 2008
  • Let $P(M,G,{\pi})=:P$ be a principal fibre bundle with structure Lie group G over a base manifold M. In this paper we get the following facts: 1. The tangent bundle TG of the structure Lie group G in $P(M,G,{\pi})=:P$ is a Lie group. 2. The Lie algebra ${\mathcal{g}}=T_eG$ is a normal subgroup of the Lie group TG. 3. $TP(TM,TG,{\pi}_*)=:TP$ is a principal fibre bundle with structure Lie group TG and projection ${\pi}_*$ over base manifold TM, where ${\pi}_*$ is the differential map of the projection ${\pi}$ of P onto M. 4. for a Lie group $H,\;TH=H{\circ}T_eH=T_eH{\circ}H=TH$ and $H{\cap}T_eH=\{e\}$, but H is not a normal subgroup of the group TH in general.

  • PDF

Wireless PKI for Reducing Certificate Acquisition Time According to Authentication Path

  • Choi Seung-Kwon;Cho Yong-Hwan;Shin Seung-Soo;Jang Yoon-Sik
    • International Journal of Contents
    • /
    • 제1권1호
    • /
    • pp.29-34
    • /
    • 2005
  • In this paper, we proposed an advanced authentication structure for reducing the certificate acquisition time which is one of the factors that should be improved in a conventional wireless PKI. A conventional key exchange method simply performs the key exchange setup step based on discrete algebraic subjects. But the mutual-authentication procedure of wireless PKI for reducing authentication time uses an elliptical curve for a key exchange setup step. We simulated and compared the authentication structure proposed by Sufatrio, K. Lam[4] and proposed authentication structure in terms of the authentication time. Simulation results show that the proposed method reduces the authentication time compared to the conventional wireless PKI authentication method.

  • PDF

MOS 로직 및 타이밍 시뮬레이션을 위한 데이타구조 및 알고리즘 (A data structure and algorithm for MOS logic-with-timing simulation)

  • 공진흥
    • 전자공학회논문지A
    • /
    • 제33A권6호
    • /
    • pp.206-219
    • /
    • 1996
  • This paper describes a data structure and evaluation algorithm to improve the perofmrances MOS logic-with-timing simulation in computation and accuracy. In order to efficiently simulate the logic and timing of driver-load networks, (1) a tree data structure to represent the mutual interconnection topology of switches and nodes in the driver-lod network, and (2) an algebraic modeling to efficiently deal with the new represetnation, (3) an evaluation algorithm to compute the linear resistive and capacitive behavior with the new modeling of driver-load networks are developed. The higher modeling presented here supports the structural and functional compatibility with the linear switch-level to simulate the logic-with-timing of digital MOS circuits at a mixed-level. This research attempts to integrate the new approach into the existing simulator RSIM, which yield a mixed-klevel logic-with-timing simulator MIXIM. The experimental results show that (1) MIXIM is a far superior to RSIM in computation speed and timing accuracy; and notably (2) th etiming simulation for driver-load netowrks produces the accuracy ranged within 17% with respect ot the analog simulator SPICE.

  • PDF