• Title/Summary/Keyword: extensions

Search Result 843, Processing Time 0.026 seconds

REIDEMEISTER ZETA FUNCTION FOR GROUP EXTENSIONS

  • Wong, Peter
    • Journal of the Korean Mathematical Society
    • /
    • v.38 no.6
    • /
    • pp.1107-1116
    • /
    • 2001
  • In this paper, we study the rationality of the Reidemeister zeta function of an endomorphism of a group extension. As an application, we give sufficient conditions for the rationality of the Reidemeister and the Nielsen zeta functions of selfmaps on an exponential solvmanifold or an infra-nilmanifold or the coset space of a compact connected Lie group by a finite subgroup.

  • PDF

ON THE TATE-SHAFAREVICH GROUPS OVER DEGREE 3 NON-GALOIS EXTENSIONS

  • Yu, Hoseog
    • Honam Mathematical Journal
    • /
    • v.38 no.1
    • /
    • pp.85-93
    • /
    • 2016
  • Let A be an abelian variety defined over a number field K and let L be a degree 3 non-Galois extension of K. Let III(A/K) and III(A/L) denote, respectively, the Tate-Shafarevich groups of A over K and over L. Assuming that III(A/L) is finite, we compute [III(A/K)][III($A_{\varphi}/K$)]/[III(A/L)], where [X] is the order of a finite abelian group X.

VOLUME OF GRAPH POLYTOPES FOR THE PATH-STAR TYPE GRAPHS

  • Ju, Hyeong-Kwan;Seo, Soo-Jeong
    • Honam Mathematical Journal
    • /
    • v.38 no.1
    • /
    • pp.71-84
    • /
    • 2016
  • The aim of this work is to compute the volume of the graph polytope associated with various type of finite simple graphs composed of paths and stars. Recurrence relations are obtained using the recursive volume formula (RVF) which was introduced in Lee and Ju ([3]). We also discussed the relationship between the volume of the graph polytopes and the number of linear extensions of the associated posets for given bipartite graphs.

ON THE RESIDUAL FINITENESS OF FUNDAMENTAL GROUPS OF GRAPHS OF CERTAIN GROUPS

  • Kim, Goansu
    • Journal of the Korean Mathematical Society
    • /
    • v.41 no.5
    • /
    • pp.913-920
    • /
    • 2004
  • We give a characterization for fundamental groups of graphs of groups amalgamating cyclic edge subgroups to be cyclic subgroup separable if each pair of edge subgroups has a non-trivial intersection. We show that fundamental groups of graphs of abelian groups amalgamating cyclic edge subgroups are cyclic subgroup separable, hence residually finite, if each edge subgroup is isolated in its containing vertex group.

Performance Comparison of Path Reestablishment Schemes for a Backward Handover in Wireless ATM Networks (무선 ATM 망의 역방향 핸드오버에서 경로 재설정 방식에 따른 성능 비교)

  • 전협우;김도현
    • Proceedings of the IEEK Conference
    • /
    • 1998.10a
    • /
    • pp.119-122
    • /
    • 1998
  • Wireless ATM(WATM) intends to provide a broad range of mobile multimedia services through wireless access by mobility extensions from the fixed ATM-based network. Recently, there have been active researches about new handover techniques to support terminal mobility in WATM. In this paper we classify path reestablishment schemes into full reestablishment, path rerouting with a static COS, path rerouting with a dynamic COS, and path extension. For a backward lossy handover procedure, we analyze and compare the performances of path reestablishment schemes in terms of delay, service disruption time and cell loss.

  • PDF

Overview of Fuzzy Associations Mining

  • Chen, Guoqing;Wei, Qiang;Kerre, Etienne;Wets, Geert
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 2003.09a
    • /
    • pp.1-6
    • /
    • 2003
  • Associations, as specific forms of knowledge, reflect relationships among items in databases, and have been widely studied in the fields of knowledge discovery and data mining. Recent years have witnessed many efforts on discovering fuzzy associations, aimed at coping with fuzziness in knowledge representation and decision support processes. This paper focuses on associations of three kinds, namely, association rules, functional dependencies and pattern associations, and overviews major fuzzy logic extensions accordingly.

  • PDF

Implementation issues for Uncertain Relational Databases

  • Yu, Hairong;Ramer, Arthur
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 1998.06a
    • /
    • pp.128-133
    • /
    • 1998
  • This paper aims to present some ideas for implementation of Uncertain Relational Databases (URD) which are extensions of classical relational databases. Our system firstly is based on possibility distribution and probability theory to represent and manipulate fuzzy and probabilistic information, secondly adopts flexible mechanisms that allow the management of uncertain data through the resources provided by both available relational database management systems and front-end interfaces, and lastly chooses dynamic SQL to enhance versatility and adjustability of systems.

  • PDF

BEST APPROXIMATION SETS IN LINEAR 2-NORMED SPACES

  • Elumalai, S.;Cho, Y.J.;Kim, S.S
    • Communications of the Korean Mathematical Society
    • /
    • v.12 no.3
    • /
    • pp.619-629
    • /
    • 1997
  • In this paper, we give some properties of the sets $D_z(x_o, G)P_{G, z}(x)$. We also provide the relation between $P_{G, z}(x)$ and G$\hat{a}$teaux derivatives.

  • PDF