• 제목/요약/키워드: index polynomial

검색결과 112건 처리시간 0.021초

SOME OBSERVATIONS ON THE NUMERICAL INDEX AND THE POLYNOMIAL NUMERICAL INDEX

  • Kim, Sun Kwang
    • 대한수학회보
    • /
    • 제53권1호
    • /
    • pp.119-126
    • /
    • 2016
  • In this paper, we study both the numerical index and the polynomial numerical index. First, we give a sufficient condition for a Banach space X to have lushness. Second, we study the relation between the renormings of a Banach space and the k-order polynomial numerical index. This shows that every real Banach spaces of dimension greater that 1 can be renormed to have 2-order polynomial numerical index ${\alpha}$ for any ${\alpha}{\in}[0,1/18)$.

ON THE SCHULTZ POLYNOMIAL AND HOSOYA POLYNOMIAL OF CIRCUMCORONENE SERIES OF BENZENOID

  • Farahani, Mohammad Reza
    • Journal of applied mathematics & informatics
    • /
    • 제31권5_6호
    • /
    • pp.595-608
    • /
    • 2013
  • Let G = (V, E) be a simple connected graph. The sets of vertices and edges of G are denoted by V = V (G) and E = E(G), respectively. In such a simple molecular graph, vertices represent atoms and edges represent bonds. The distance between the vertices $u$ and $v$ in V (G) of graph G is the number of edges in a shortest path connecting them, we denote by $d(u,v)$. In graph theory, we have many invariant polynomials for a graph G. In this paper, we focus on the Schultz polynomial, Modified Schultz polynomial, Hosoya polynomial and their topological indices of a molecular graph circumcoronene series of benzenoid $H_k$ and specially third member from this family. $H_3$ is a basic member from the circumcoronene series of benzenoid and its conclusions are base calculations for the Schultz polynomial and Hosoya polynomial of the circumcoronene series of benzenoid $H_k$ ($k{\geq}3$).

Design of Space Search-Optimized Polynomial Neural Networks with the Aid of Ranking Selection and L2-norm Regularization

  • Wang, Dan;Oh, Sung-Kwun;Kim, Eun-Hu
    • Journal of Electrical Engineering and Technology
    • /
    • 제13권4호
    • /
    • pp.1724-1731
    • /
    • 2018
  • The conventional polynomial neural network (PNN) is a classical flexible neural structure and self-organizing network, however it is not free from the limitation of overfitting problem. In this study, we propose a space search-optimized polynomial neural network (ssPNN) structure to alleviate this problem. Ranking selection is realized by means of ranking selection-based performance index (RS_PI) which is combined with conventional performance index (PI) and coefficients based performance index (CPI) (viz. the sum of squared coefficient). Unlike the conventional PNN, L2-norm regularization method for estimating the polynomial coefficients is also used when designing the ssPNN. Furthermore, space search optimization (SSO) is exploited here to optimize the parameters of ssPNN (viz. the number of input variables, which variables will be selected as input variables, and the type of polynomial). Experimental results show that the proposed ranking selection-based polynomial neural network gives rise to better performance in comparison with the neuron fuzzy models reported in the literatures.

EDGE VERSION OF HARMONIC INDEX AND HARMONIC POLYNOMIAL OF SOME CLASSES OF GRAPHS

  • NAZIR, RABIA;SARDAR, SHOAIB;ZAFAR, SOHAIL;ZAHID, ZOHAIB
    • Journal of applied mathematics & informatics
    • /
    • 제34권5_6호
    • /
    • pp.479-486
    • /
    • 2016
  • In this paper we define the edge version of harmonic index and harmonic polynomial of a graph G. We computed explicit formulas for the edge version of harmonic index and harmonic polynomial of many well known classes of graphs.

Polynomial Unknotting and Singularity Index

  • Mishra, Rama
    • Kyungpook Mathematical Journal
    • /
    • 제54권2호
    • /
    • pp.271-292
    • /
    • 2014
  • We introduce a new method to transform a knot diagram into a diagram of an unknot using a polynomial representation of the knot. Here the unknotting sequence of a knot diagram with least number of crossing changes can be realized by a family of polynomial maps. The number of singular knots in this family is defined to be the singularity index of the diagram. We show that the singularity index of a diagram is always less than or equal to its unknotting number.

POLYNOMIAL INVARIANTS FOR VIRTUAL KNOTS VIA VIRTUALIZATION MOVES

  • Im, Young Ho;Kim, Sera
    • East Asian mathematical journal
    • /
    • 제36권5호
    • /
    • pp.537-545
    • /
    • 2020
  • We investigate some polynomial invariants for virtual knots via virtualization moves. We define two types of polynomials WG(t) and S2G(t) from the definition of the index polynomial for virtual knots. And we show that they are invariants for virtual knots on the quotient ring Z[t±1]/I where I is an ideal generated by t2 - 1.

NILRADICALS OF POWER SERIES RINGS AND NIL POWER SERIES RINGS

  • HUH, CHAN;KIM, CHOL ON;KIM, EUN JEONG;KIM, HONG KEE;LEE, YANG
    • 대한수학회지
    • /
    • 제42권5호
    • /
    • pp.1003-1015
    • /
    • 2005
  • Klein proved that polynomial rings over nil rings of bounded index are also nil of bounded index; while Puczylowski and Smoktunowicz described the nilradical of a power series ring with an indeterminate. We extend these results to those with any set of commuting indeterminates. We also study prime radicals of power series rings over some class of rings containing the case of bounded index, finding some examples which elaborate our arguments; and we prove that R is a PI ring of bounded index then the power series ring R[[X]], with X any set of indeterminates over R, is also a PI ring of bounded index, obtaining the Klein's result for polynomial rings as a corollary.

On the Braid Index of Kanenobu Knots

  • Takioka, Hideo
    • Kyungpook Mathematical Journal
    • /
    • 제55권1호
    • /
    • pp.169-180
    • /
    • 2015
  • We study the braid indices of the Kanenobu knots. It is known that the Kanenobu knots have the same HOMFLYPT polynomial and the same Khovanov-Rozansky homology. The MFW inequality is known for giving a lower bound of the braid index of a link by applying the HOMFLYPT polynomial. Therefore, it is not easy to determine the braid indices of the Kanenobu knots. In our previous paper, we gave upper bounds and sharper lower bounds of the braid indices of the Kanenobu knots by applying the 2-cable version of the zeroth coefficient HOMFLYPT polynomial. In this paper, we give sharper upper bounds of the braid indices of the Kanenobu knots.