• Title/Summary/Keyword: Symmetric Index

Search Result 90, Processing Time 0.022 seconds

NILPOTENCY INDEX OF NIL-ALGEBRA OF NIL-INDEX 3

  • LEE WOO
    • Journal of applied mathematics & informatics
    • /
    • v.20 no.1_2
    • /
    • pp.569-573
    • /
    • 2006
  • Nagata and Higman proved that any nil-algebra of finite nilindex is nilpotent of finite index. The Nagata-Higman Theorem can be formulated in terms of T-ideals. TheT-ideal generated by $a^n$ for all $a{\in}A$ is also generated by the symmetric polynomials. The symmetric polynomials play an importmant role in analyzing nil-algebra. We construct the incidence matrix with the symmetric polynomials. Using this incidence matrix, we determine the nilpotency index of nil-algebra of nil-index 3.

The Line n-sigraph of a Symmetric n-sigraph-V

  • Reddy, P. Siva Kota;Nagaraja, K.M.;Geetha, M.C.
    • Kyungpook Mathematical Journal
    • /
    • v.54 no.1
    • /
    • pp.95-101
    • /
    • 2014
  • An n-tuple ($a_1,a_2,{\ldots},a_n$) is symmetric, if $a_k$ = $a_{n-k+1}$, $1{\leq}k{\leq}n$. Let $H_n$ = {$(a_1,a_2,{\ldots},a_n)$ ; $a_k$ ${\in}$ {+,-}, $a_k$ = $a_{n-k+1}$, $1{\leq}k{\leq}n$} be the set of all symmetric n-tuples. A symmetric n-sigraph (symmetric n-marked graph) is an ordered pair $S_n$ = (G,${\sigma}$) ($S_n$ = (G,${\mu}$)), where G = (V,E) is a graph called the underlying graph of $S_n$ and ${\sigma}$:E ${\rightarrow}H_n({\mu}:V{\rightarrow}H_n)$ is a function. The restricted super line graph of index r of a graph G, denoted by $\mathcal{R}\mathcal{L}_r$(G). The vertices of $\mathcal{R}\mathcal{L}_r$(G) are the r-subsets of E(G) and two vertices P = ${p_1,p_2,{\ldots},p_r}$ and Q = ${q_1,q_2,{\ldots},q_r}$ are adjacent if there exists exactly one pair of edges, say $p_i$ and $q_j$, where $1{\leq}i$, $j{\leq}r$, that are adjacent edges in G. Analogously, one can define the restricted super line symmetric n-sigraph of index r of a symmetric n-sigraph $S_n$ = (G,${\sigma}$) as a symmetric n-sigraph $\mathcal{R}\mathcal{L}_r$($S_n$) = ($\mathcal{R}\mathcal{L}_r(G)$, ${\sigma}$'), where $\mathcal{R}\mathcal{L}_r(G)$ is the underlying graph of $\mathcal{R}\mathcal{L}_r(S_n)$, where for any edge PQ in $\mathcal{R}\mathcal{L}_r(S_n)$, ${\sigma}^{\prime}(PQ)$=${\sigma}(P){\sigma}(Q)$. It is shown that for any symmetric n-sigraph $S_n$, its $\mathcal{R}\mathcal{L}_r(S_n)$ is i-balanced and we offer a structural characterization of super line symmetric n-sigraphs of index r. Further, we characterize symmetric n-sigraphs $S_n$ for which $\mathcal{R}\mathcal{L}_r(S_n)$~$\mathcal{L}_r(S_n)$ and $$\mathcal{R}\mathcal{L}_r(S_n){\sim_=}\mathcal{L}_r(S_n)$$, where ~ and $$\sim_=$$ denotes switching equivalence and isomorphism and $\mathcal{R}\mathcal{L}_r(S_n)$ and $\mathcal{L}_r(S_n)$ are denotes the restricted super line symmetric n-sigraph of index r and super line symmetric n-sigraph of index r of $S_n$ respectively.

ON 2-GENERATING INDEX OF FINITE DIMENSIONAL LEFT-SYMMETRIC ALGEBRAS

  • Yang, Xiaomei;Zhu, Fuhai
    • Journal of the Korean Mathematical Society
    • /
    • v.54 no.5
    • /
    • pp.1537-1556
    • /
    • 2017
  • In this paper, we introduce the notion of generating index ${\mathcal{I}}_1(A)$ (2-generating index ${\mathcal{I}}_2(A)$, resp.) of a left-symmetric algebra A, which is the maximum of the dimensions of the subalgebras generated by any element (any two elements, resp.). We give a classification of left-symmetric algebras with ${\mathcal{I}}_1(A)=1$ and ${\mathcal{I}}_2(A)=2$, 3 resp., and show that all such algebras can be constructed by linear and bilinear functions. Such algebras can be regarded as a generalization of those relating to the integrable (generalized) Burgers equation.

COMPETITION INDICES OF STRONGLY CONNECTED DIGRAPHS

  • Cho, Han-Hyuk;Kim, Hwa-Kyung
    • Bulletin of the Korean Mathematical Society
    • /
    • v.48 no.3
    • /
    • pp.637-646
    • /
    • 2011
  • Cho and Kim [4] and Kim [6] introduced the concept of the competition index of a digraph. Cho and Kim [4] and Akelbek and Kirkland [1] also studied the upper bound of competition indices of primitive digraphs. In this paper, we study the upper bound of competition indices of strongly connected digraphs. We also study the relation between competition index and ordinary index for a symmetric strongly connected digraph.

LIGHTLIKE SUBMANIFOLDS OF A SEMI-RIEMANNIAN MANIFOLD WITH A SEMI-SYMMETRIC NON-METRIC CONNECTION

  • Shin, Jong Moon
    • East Asian mathematical journal
    • /
    • v.31 no.1
    • /
    • pp.33-40
    • /
    • 2015
  • We study the geometry of r-lightlike submanifolds M of a semi-Riemannian manifold $\bar{M}$ with a semi-symmetric non-metric connection subject to the conditions; (a) the screen distribution of M is totally geodesic in M, and (b) at least one among the r-th lightlike second fundamental forms is parallel with respect to the induced connection of M. The main result is a classification theorem for irrotational r-lightlike submanifold of a semi-Riemannian manifold of index r admitting a semi-symmetric non-metric connection.

Effects of Vibrotactile Bio-Feedback Providing Pressure Information in Real Time on Static Balance and Weight Bearing Rate in Chronic Stroke Patients - Pilot Study (실시간 압력정보 제공 진동 촉각 피드백이 만성 뇌졸중 환자의 정적균형능력과 체중 지지율에 미치는 영향 - 예비실험연구)

  • Kil, Ki-Su;Kim, Ho;Shin, Won-Seob
    • Journal of The Korean Society of Integrative Medicine
    • /
    • v.9 no.1
    • /
    • pp.41-48
    • /
    • 2021
  • Purpose : The purpose of this study is to find out if it helps to improve static balance ability and weight bearing rate for chronic stroke patients with poor balance in clinical intervention through a method of correcting movement errors while performing a task by vibrotactile bio-feedback providing pressure information. Methods : Fifteen chronic stroke patients (12 male and 3 female) were participated in this study. To examine the effects of vibrotactile bio-feedback and general standing without bio-feedback on static balance ability and weight distribution symmetric index in all subjects randomized with R Studio. The static balance ability and weight distribution symmetric index of the participants was evaluated using a force plate. A paired t-test was used for comparison of each conditions. Statistical significance was set at α=0.05. Results : The comparisons of static balance ability and weight distribution symmetric index in chronic stroke patients after two different condition are as follows. In the static balance ability and weight distribution symmetric index, the vibrotactile feedback providing pressure information showed a significant difference compared to none feedback (p<.001). Conclusion : The vibrotactile bio-feedback providing pressure information in real time can support an improve in static balance ability, uniform weight bearing rehabilitation in chronic stroke patients. In the future, it is hoped that a follow-up study that provides a better direction of intervention compared to various feedback interventions commonly used in clinical practice.

CENTER SYMMETRY OF INCIDENCE MATRICES

  • Lee, Woo
    • Communications of the Korean Mathematical Society
    • /
    • v.15 no.1
    • /
    • pp.29-36
    • /
    • 2000
  • The T-ideal of F(X) generated by $x^{n}$ for all x $\in$ X, is generated also by the symmetric polynomials. For each symmetric poly-nomial, there corresponds one row of the incidence matrix. Finding the nilpotency of nil-algebra of nil-index n is equivalent to determining the smallest integer N such that the (n, N)-incidence matrix has rank equal to N!. In this work, we show that the (n, (equation omitted)$^{(1,....,n)}$-incidence matrix is center-symmetric.

  • PDF

ON THE INDEX AND BIDERIVATIONS OF SIMPLE MALCEV ALGEBRAS

  • Yahya, Abdelaziz Ben;Boulmane, Said
    • Communications of the Korean Mathematical Society
    • /
    • v.37 no.2
    • /
    • pp.385-397
    • /
    • 2022
  • Let (M, [ , ]) be a finite dimensional Malcev algebra over an algebraically closed field 𝔽 of characteristic 0. We first prove that, (M, [ , ]) (with [M, M] ≠ 0) is simple if and only if ind(M) = 1 (i.e., M admits a unique (up to a scalar multiple) invariant scalar product). Further, we characterize the form of skew-symmetric biderivations on simple Malcev algebras. In particular, we prove that the simple seven dimensional non-Lie Malcev algebra has no nontrivial skew-symmetric biderivation.

Design of a Catadioptric System with Corrected Color Aberration and Flat Petzval Curvature Using a Graphically Symmetric Method

  • Lim, Tae-Yeon;Park, Sung-Chan
    • Current Optics and Photonics
    • /
    • v.2 no.4
    • /
    • pp.324-331
    • /
    • 2018
  • This paper describes a symmetric method for determining a combination of element power and optical material to design a catadioptric system with corrected color aberration and flat Petzval curvature. To graphically obtain the solutions, a glass chart containing the Abbe number, the refractive index, and the optical power, which are closely related to these aberrations, is suggested. First, we recompose an optical system as a doublet of the specific lens and an equivalent single lens, and then locate both lenses on lines that are symmetric to each other on a glass chart, through changing the lens parameters effectively. Utilizing this method, an achromatic catadioptric system with flat Petzval curvature is obtained.

TWO-SIDED ESTIMATES FOR TRANSITION PROBABILITIES OF SYMMETRIC MARKOV CHAINS ON ℤd

  • Zhi-He Chen
    • Journal of the Korean Mathematical Society
    • /
    • v.60 no.3
    • /
    • pp.537-564
    • /
    • 2023
  • In this paper, we are mainly concerned with two-sided estimates for transition probabilities of symmetric Markov chains on ℤd, whose one-step transition probability is comparable to |x - y|-dϕj (|x - y|)-1 with ϕj being a positive regularly varying function on [1, ∞) with index α ∈ [2, ∞). For upper bounds, we directly apply the comparison idea and the Davies method, which considerably improves the existing arguments in the literature; while for lower bounds the relation with the corresponding continuous time symmetric Markov chains are fully used. In particular, our results answer one open question mentioned in the paper by Murugan and Saloff-Coste (2015).