• Title/Summary/Keyword: p-set

Search Result 3,439, Processing Time 0.025 seconds

REFINEMENT PERMUTATIONS OF PRIME POWER ORDER

  • Park, Dong-Wan;Jo, Young-Soo
    • Communications of the Korean Mathematical Society
    • /
    • v.15 no.1
    • /
    • pp.59-69
    • /
    • 2000
  • For a permutation ${\mu}$ in S$\sub$b/, the limit algebra A${\mu}$ of the stationary system given by ${\mu}$ is isomorphic to a refinement limit algebra if and only if its exponent set E(${\mu}$) is the set {0}. In the current paper, we prove a sufficient condition under which E(${\mu}$)={0} when the order of ${\mu}$ is a power of p, where p is a prime number dividing b.

  • PDF

REMARKS ON THE GAP SET OF R = K + C

  • Tutas, Nesrin
    • Bulletin of the Korean Mathematical Society
    • /
    • v.47 no.2
    • /
    • pp.433-442
    • /
    • 2010
  • $\tilde{G}(P,\;Q)$, a new generalization of the set of gap numbers of a pair of points, was described in [1]. Here we study gap numbers of local subring $R\;=\;\cal{K}\;+\;C$ of algebraic function field over a finite field and we give a formula for the number of elements of $\tilde{G}(P,\;Q)$ depending on pure gaps and R.

GENERALIZED DISCRETE HALANAY INEQUALITIES AND THE ASYMPTOTIC BEHAVIOR OF NONLINEAR DISCRETE SYSTEMS

  • Xu, Liguang
    • Bulletin of the Korean Mathematical Society
    • /
    • v.50 no.5
    • /
    • pp.1555-1565
    • /
    • 2013
  • In this paper, some new generalized discrete Halanay inequalities are established. On the basis of these new established inequalities, we obtain the attracting set and the global asymptotic stability of the nonlinear discrete systems. Our results established here extend the main results in [R. P. Agarwal, Y. H. Kim, and S. K. Sen, New discrete Halanay inequalities: stability of difference equations, Commun. Appl. Anal. 12 (2008), no. 1, 83-90] and [S. Udpin and P. Niamsup, New discrete type inequalities and global stability of nonlinear difference equations, Appl. Math. Lett. 22 (2009), no. 6, 856-859].

NORMAL FUZZY PROBABILITY FOR TRAPEZOIDAL FUZZY SETS

  • Kim, Changil;Yun, Yong Sik
    • East Asian mathematical journal
    • /
    • v.29 no.3
    • /
    • pp.269-278
    • /
    • 2013
  • A fuzzy set A defined on a probability space (${\Omega}$, $\mathfrak{F}$, P) is called a fuzzy event. Zadeh defines the probability of the fuzzy event A using the probability P. We define the normal fuzzy probability on $\mathbb{R}$ using the normal distribution. We calculate the normal fuzzy probability for generalized trapezoidal fuzzy sets and give some examples.

ALMOST GP-SPACES

  • Mohammad, Reza Ahmadi Zand
    • Journal of the Korean Mathematical Society
    • /
    • v.47 no.1
    • /
    • pp.215-222
    • /
    • 2010
  • A T$_1$ topological space X is called an almost GP-space if every dense G$_{\delta}$-set of X has nonempty interior. The behaviour of almost GP-spaces under taking subspaces and superspaces, images and preimages and products is studied. If each dense G$_{\delta}$-set of an almost GP-space X has dense interior in X, then X is called a GID-space. In this paper, some interesting properties of GID-spaces are investigated. We will generalize some theorems that hold in almost P-spaces.

THE SPLIT AND NON-SPLIT TREE (D, C)-NUMBER OF A GRAPH

  • P.A. SAFEER;A. SADIQUALI;K.R. SANTHOSH KUMAR
    • Journal of applied mathematics & informatics
    • /
    • v.42 no.3
    • /
    • pp.511-520
    • /
    • 2024
  • In this paper, we introduce the concept of split and non-split tree (D, C)- set of a connected graph G and its associated color variable, namely split tree (D, C) number and non-split tree (D, C) number of G. A subset S ⊆ V of vertices in G is said to be a split tree (D, C) set of G if S is a tree (D, C) set and ⟨V - S⟩ is disconnected. The minimum size of the split tree (D, C) set of G is the split tree (D, C) number of G, γχST (G) = min{|S| : S is a split tree (D, C) set}. A subset S ⊆ V of vertices of G is said to be a non-split tree (D, C) set of G if S is a tree (D, C) set and ⟨V - S⟩ is connected and non-split tree (D, C) number of G is γχST (G) = min{|S| : S is a non-split tree (D, C) set of G}. The split and non-split tree (D, C) number of some standard graphs and its compliments are identified.

Effects of the Frequency Band Pass Filter on the P300 Event-related Potential in the Working Memory (주파수 통과대역필터가 작업 기억 관련 사건관련전위 P300에 미치는 영향)

  • Park, Woongsik;Lee, Jeongwoo
    • Journal of The Korean Society of Integrative Medicine
    • /
    • v.8 no.2
    • /
    • pp.131-138
    • /
    • 2020
  • Purpose : The purpose of this study was to investigate the effects of the frequency band pass filter on the P300 event-related potential in the working memory. Methods : The subjects were 20 women in their 20s who applied for participation in the experiment. Event-related potentials (ERPs) were elicited using 3-back tasks for the working memory, and were recorded from Fz, Cz, and Pz scalp electrodes. The high-pass filters were set to 0.01, 0.1, and 0.3 Hz for analysis purposes, and the low-pass filters were set to 30 and 15 Hz. The 3-back task was presented for a total of 100 times, among which 30 times were designated for the target stimulation (a matched number) and 70 times for the non-target stimulation (an unmatched number). The temporal interval between each stimulation was set at 1 second, while each time duration was randomly presented between 2 to 4 seconds. ERP were analyzed for the P300 recorded from Fz, Pz and Cz scalp electrodes. Results : Latency and amplitude had no significant interaction effects in both the high- and low-pass filters. For the main effects, the latency and amplitude of the P300 event-related potential had no significant difference in the high-pass filters, but the latency had a significant difference in the low-pass filter of Fz, and the amplitude had a significant difference in the low-pass filter of Pz. Conclusion : The results of this study showed that the less than 0.3 Hz high filters had no effects on the differences between the latency and amplitude of the P300 event-related potential in the working memory. The 30Hz low-pass filter, however, was found to be useful for recording the P300 event-related potential in the working memory.

Climatological Estimation of Sea Surface CO2 Partial Pressure in the North Pacific Oceans by Satellite data

  • Osawa, Takahiro;Akiyama, Masatoshi;Sugimori, Yasuhiro
    • Proceedings of the KSRS Conference
    • /
    • 1999.11a
    • /
    • pp.237-242
    • /
    • 1999
  • As one of the key parameters to determine $CO_2$ flux between air - sea interface, it is quite important to know p$CO_2$, which has involved much uncertainty, mainly due to the complex variations of sea surface p$CO_2$ and the paucity of samples, made in ocean. In order to improve the interrelationship between partial pressure (p$CO_2$) and different physical and biochemical parameters in global sea surface water, a new empirical relation is established to correlate and parameterize p$CO_2$ in the mixed layer using the data from recent WOCE cruises. Meanwhile, by new empirical relation, abundant historical hydrographic and nutrients ship data, Levitus data set and NOAA/AVHRR(SST), p$CO_2$ have been accumulated and applied. Then effort has to be made fur promotion of this study to correlate and parameterize p$CO_2$ in the mixed Layer with different physical and biochemical parameters. and further attribute this huge historical data sets and NOAA/AVHRR(SST) data to estimate p$CO_2$. In this paper we analyzed more interrelationship between the model and ship/satellite data set. Finally, the inter-annual variations of p$CO_2$ in sea are presented and discussed.

  • PDF

THE CONNECTED DOUBLE GEODETIC NUMBER OF A GRAPH

  • SANTHAKUMARAN, A.P.;JEBARAJ, T.
    • Journal of applied mathematics & informatics
    • /
    • v.39 no.1_2
    • /
    • pp.155-163
    • /
    • 2021
  • For a connected graph G of order n, a set S of vertices is called a double geodetic set of G if for each pair of vertices x, y in G there exist vertices u, v ∈ S such that x, y ∈ I[u, v]. The double geodetic number dg(G) is the minimum cardinality of a double geodetic set. Any double godetic set of cardinality dg(G) is called a dg-set of G. A connected double geodetic set of G is a double geodetic set S such that the subgraph G[S] induced by S is connected. The minimum cardinality of a connected double geodetic set of G is the connected double geodetic number of G and is denoted by dgc(G). A connected double geodetic set of cardinality dgc(G) is called a dgc-set of G. Connected graphs of order n with connected double geodetic number 2 or n are characterized. For integers n, a and b with 2 ≤ a < b ≤ n, there exists a connected graph G of order n such that dg(G) = a and dgc(G) = b. It is shown that for positive integers r, d and k ≥ 5 with r < d ≤ 2r and k - d - 3 ≥ 0, there exists a connected graph G of radius r, diameter d and connected double geodetic number k.