• Title/Summary/Keyword: F.E.A.

Search Result 4,596, Processing Time 0.034 seconds

NOTES ON A NON-ASSOCIATIVE ALGEBRAS WITH EXPONENTIAL FUNCTIONS I

  • CHOI, SEUL HEE
    • Honam Mathematical Journal
    • /
    • v.28 no.2
    • /
    • pp.197-204
    • /
    • 2006
  • For the evaluation algebra $F[e^{{\pm}{\chi}}]_M$, if M={$\partial$}, the automorphism group $Aut_{non}$($F[e^{{\pm}{\chi}}]_M$) and $Der_{non}$($F[e^{{\pm}{\chi}}]_M$) of the evaluation algebra $F[e^{{\pm}{\chi}}]_M$ are found in the paper [12]. For M={${\partial}^n$}, we find $Aut_{non}$($F[e^{{\pm}{\chi}}]_M$) and $Der_{non}$($F[e^{{\pm}{\chi}}]_M$) of the evaluation algebra $F[e^{{\pm}{\chi}}]_M$ in this paper. We show that a derivation of some non-associative algebra is not inner.

  • PDF

DIFFERENCE CORDIALITY OF SOME SNAKE GRAPHS

  • Ponraj, R.;Narayanan, S. Sathish
    • Journal of applied mathematics & informatics
    • /
    • v.32 no.3_4
    • /
    • pp.377-387
    • /
    • 2014
  • Let G be a (p, q) graph. Let f be a map from V (G) to {1, 2, ${\ldots}$, p}. For each edge uv, assign the label ${\mid}f(u)-f(\nu){\mid}$. f is called a difference cordial labeling if f is a one to one map and ${\mid}e_f(0)-e_f(1){\mid}{\leq}1$ where $e_f(1)$ and $e_f(0)$ denote the number of edges labeled with 1 and not labeled with 1 respectively. A graph with admits a difference cordial labeling is called a difference cordial graph. In this paper, we investigate the difference cordial labeling behavior of triangular snake, Quadrilateral snake, double triangular snake, double quadrilateral snake and alternate snakes.

On the Order of Growth of Solutions to Complex Non-homogeneous Linear Differential Equations

  • Habib, Habib;Belaidi, Benharrat
    • Kyungpook Mathematical Journal
    • /
    • v.56 no.3
    • /
    • pp.819-829
    • /
    • 2016
  • In this paper, we study the order of growth of solutions to the non-homogeneous linear differential equation $$f^{(k)}+A_{k-1}e^{az}f^{(k-1)}+{\cdots}+A_1e^{az}f^{\prime}+A_0e^{az}f=F_1e^{az}+F_2e^{bz}$$, where $A_j(z)$ (${\not\equiv}0$) ($j=0,1,{\cdots},k-1$), $F_j(z)$ (${\not\equiv}0$) (j = 1, 2) are entire functions and a, b are complex numbers such that $ab(a-b){\neq}0$.

EXTREMELY MEASURABLE SUBALGEBRAS

  • Ayyaswamy, S.K.
    • Bulletin of the Korean Mathematical Society
    • /
    • v.22 no.1
    • /
    • pp.7-10
    • /
    • 1985
  • For each a.mem.S and f.mem.m(S), denote by $l_{a}$ f(s)=f(as) for all s.mem.S. If A is a norm closed left translation invariant subalgebra of m(S) (i.e. $l_{a}$ f.mem.A whenever f.mem.A and a.mem.S) containing 1, the constant ont function on S and .phi..mem. $A^{*}$, the dual of A, then .phi. is a mean on A if .phi.(f).geq.0 for f.geq.0 and .phi.(1) = 1, .phi. is multiplicative if .phi. (fg)=.phi.(f).phi.(g) for all f, g.mem.A; .phi. is left invariant if .phi.(1sf)=.phi.(f) for all s.mem.S and f.mem.A. It is well known that the set of multiplicative means on m(S) is precisely .betha.S, the Stone-Cech compactification of S[7]. A subalgebra of m(S) is (extremely) left amenable, denoted by (ELA)LA if it is nom closed, left translation invariant containing contants and has a multiplicative left invariant mean (LIM). A semigroup S is (ELA) LA, if m(S) is (ELA)LA. A subset E.contnd.S is left thick (T. Mitchell, [4]) if for any finite subser F.contnd.S, there exists s.mem.S such that $F_{s}$ .contnd.E or equivalently, the family { $s^{-1}$ E : s.mem.S} has finite intersection property.y.

  • PDF

An Experimental Study on the Degree of Phonetic Similarity between Korean and Japanese Vowels (한국어와 일본어 단모음의 유사성 분석을 위한 실험음성학적 연구)

  • Kwon, Sung-Mi
    • MALSORI
    • /
    • no.63
    • /
    • pp.47-66
    • /
    • 2007
  • This study aims at exploring the degree of phonetic similarity between Korean and Japanese vowels in terms of acoustic features by performing the speech production test on Korean speakers and Japanese speakers. For this purpose, the speech of 16 Japanese speakers for Japanese speech data, and the speech of 16 Korean speakers for Korean speech data were utilized. The findings in assessing the degree of the similarity of the 7 nearest equivalents of the Korean and Japanese vowels are as follows: First, Korean /i/ and /e/ turned out to display no significant differences in terms of F1 and F2 with their counterparts, Japanese /i/ and /e/, and the distribution of F1 and F2 of Korean /i/ and /e/ in the distributional map completely overlapped with Japanese /i/ and /e/. Accordingly, Korean /i/ and /e/ were believed to be "identical." Second, Korean /a/, /o/, and /i/ displayed a significant difference in either F1 or F2, but showed a great similarity in distribution of F1 and F2 with Japanese /a/, /o/, and /m/ respectively. Korean /a/ /o/, and /i/, therefore, were categorized as very similar to Japanese vowels. Third, Korean /u/, which has the counterpart /m/ in Japanese, showed a significant difference in both F1 and F2, and only half of the distribution overlapped. Thus, Korean /u/ was analyzed as being a moderately similar vowel to Japanese vowels. Fourth, Korean /${\wedge}$/ did not have a close counterpart in Japanese, and was classified as "the least similar vowel."

  • PDF

[r, s, t; f]-COLORING OF GRAPHS

  • Yu, Yong;Liu, Guizhen
    • Journal of the Korean Mathematical Society
    • /
    • v.48 no.1
    • /
    • pp.105-115
    • /
    • 2011
  • Let f be a function which assigns a positive integer f(v) to each vertex v $\in$ V (G), let r, s and t be non-negative integers. An f-coloring of G is an edge-coloring of G such that each vertex v $\in$ V (G) has at most f(v) incident edges colored with the same color. The minimum number of colors needed to f-color G is called the f-chromatic index of G and denoted by ${\chi}'_f$(G). An [r, s, t; f]-coloring of a graph G is a mapping c from V(G) $\bigcup$ E(G) to the color set C = {0, 1, $\ldots$; k - 1} such that |c($v_i$) - c($v_j$ )| $\geq$ r for every two adjacent vertices $v_i$ and $v_j$, |c($e_i$ - c($e_j$)| $\geq$ s and ${\alpha}(v_i)$ $\leq$ f($v_i$) for all $v_i$ $\in$ V (G), ${\alpha}$ $\in$ C where ${\alpha}(v_i)$ denotes the number of ${\alpha}$-edges incident with the vertex $v_i$ and $e_i$, $e_j$ are edges which are incident with $v_i$ but colored with different colors, |c($e_i$)-c($v_j$)| $\geq$ t for all pairs of incident vertices and edges. The minimum k such that G has an [r, s, t; f]-coloring with k colors is defined as the [r, s, t; f]-chromatic number and denoted by ${\chi}_{r,s,t;f}$ (G). In this paper, we present some general bounds for [r, s, t; f]-coloring firstly. After that, we obtain some important properties under the restriction min{r, s, t} = 0 or min{r, s, t} = 1. Finally, we present some problems for further research.

A Functional SNP in the MDM2 Promoter Mediates E2F1 Affinity to Modulate Cyclin D1 Expression in Tumor Cell Proliferation

  • Yang, Zhen-Hai;Zhou, Chun-Lin;Zhu, Hong;Li, Jiu-Hong;He, Chun-Di
    • Asian Pacific Journal of Cancer Prevention
    • /
    • v.15 no.8
    • /
    • pp.3817-3823
    • /
    • 2014
  • Background: The MDM2 oncogene, a negative regulator of p53, has a functional polymorphism in the promoter region (SNP309) that is associated with multiple kinds of cancers including non-melanoma skin cancer. SNP309 has been shown to associate with accelerated tumor formation by increasing the affinity of the transcriptional activator Sp1. It remains unknown whether there are other factors involved in the regulation of MDM2 transcription through a trans-regulatory mechanism. Methods: In this study, SNP309 was verified to be associated with overexpression of MDM2 in tumor cells. Bioinformatics predicts that the T to G substitution at SNP309 generates a stronger E2F1 binding site, which was confirmed by ChIP and luciferase assays. Results: E2F1 knockdown downregulates the expression of MDM2, which confirms that E2F1 is a functional upstream regulator. Furthermore, tumor cells with the GG genotype exhibited a higher proliferation rate than TT, correlating with cyclin D1 expression. E2F1 depletion significantly inhibits the proliferation capacity and downregulates cyclin D1 expression, especially in GG genotype skin fibroblasts. Notably, E2F1 siRNA effects could be rescued by cyclin D1 overexpression. Conclusion: Taken together, a novel modulator E2F1 was identified as regulating MDM2 expression dependent on SNP309 and further mediates cyclin D1 expression and tumor cell proliferation. E2F1 might act as an important factor for SNP309 serving as a rate-limiting event in carcinogenesis.

On regular groups over their endomorphism rings

  • Chung, Jae-Myung
    • Communications of the Korean Mathematical Society
    • /
    • v.11 no.2
    • /
    • pp.311-314
    • /
    • 1996
  • Let G be an abelian group of finite rink and E be the endomorphism ring of G. Then G is a left E-module by defining $f\cdota = f(a)$ for $f \in E$ and $a \in G$. In this case a condition for an E-module G to be regular is given.

  • PDF

RANDOMLY ORTHOGONAL FACTORIZATIONS OF (0,mf - (m - 1)r)-GRAPHS

  • Zhou, Sizhong;Zong, Minggang
    • Journal of the Korean Mathematical Society
    • /
    • v.45 no.6
    • /
    • pp.1613-1622
    • /
    • 2008
  • Let G be a graph with vertex set V(G) and edge set E(G), and let g, f be two nonnegative integer-valued functions defined on V(G) such that $g(x)\;{\leq}\;f(x)$ for every vertex x of V(G). We use $d_G(x)$ to denote the degree of a vertex x of G. A (g, f)-factor of G is a spanning subgraph F of G such that $g(x)\;{\leq}\;d_F(x)\;{\leq}\;f(x)$ for every vertex x of V(F). In particular, G is called a (g, f)-graph if G itself is a (g, f)-factor. A (g, f)-factorization of G is a partition of E(G) into edge-disjoint (g, f)-factors. Let F = {$F_1$, $F_2$, ..., $F_m$} be a factorization of G and H be a subgraph of G with mr edges. If $F_i$, $1\;{\leq}\;i\;{\leq}\;m$, has exactly r edges in common with H, we say that F is r-orthogonal to H. If for any partition {$A_1$, $A_2$, ..., $A_m$} of E(H) with $|A_i|=r$ there is a (g, f)-factorization F = {$F_1$, $F_2$, ..., $F_m$} of G such that $A_i\;{\subseteq}E(F_i)$, $1\;{\leq}\;i\;{\leq}\;m$, then we say that G has (g, f)-factorizations randomly r-orthogonal to H. In this paper it is proved that every (0, mf - (m - 1)r)-graph has (0, f)-factorizations randomly r-orthogonal to any given subgraph with mr edges if $f(x)\;{\geq}\;3r\;-\;1$ for any $x\;{\in}\;V(G)$.

Synthesis and Biological Evaluation as a Potential Allylamine Type Antimycotics (알릴아민 항진균제의 합성과 생물학적 평가)

  • 정병호;조원제;천승훈;정순영;유진철
    • YAKHAK HOEJI
    • /
    • v.47 no.5
    • /
    • pp.293-299
    • /
    • 2003
  • Structure-activity relationship studies of allylamine type of antimycotics were carried out to evaluate the effect of naphthyl and methyl portion of naftifine. Compounds with 4-fluorophenyl(2a-5a), 2-fluorophenyl(2b-5b), 2,4-dichlorophenyl(2c-5c), 2,6-dichlorophenyl(2d-5d), 4-nitrophenyl(2e-5e), and 2,3-dihydro-benzo[1,4]dioxan-6-yl( 2f-5f) instead of naphthyl group with hydrogen(3a-3f), methyl(4a-4f), and ethyl(5a-5f) in the place of methyl in naftifine were synthesized and tested their in vitro anti-fungal activity against five different fungi. Eight compounds(3a, 5a, 3c, 4c, 4d, 5d, 5e, and 4f) showed significant antifungal activity against T. mentagrophytes. (E)-N-Ethyl-(3-phenyl-2-propenyl)-4-nitro-benzenemethaneamine(5e) displayed moderate antifungal activity against all five different fungi.