Bu dergideki yayınlar

5 →
  • ArticleYalnız künye2014
    Truncated Lucas sequence and its period

    Özkan, Engin

    We prove some theorems concerning the truncated Lucas sequences. We also state some conjectures concerning the period (mod m) of truncated Lucas sequences, where the integer m is at least 2. In addition, we present some computer-generated results that tend to support these conjectures.

    RDL Kalıcı Kaydıİncele
  • ArticleYalnız künye2007
    A numerical treatment for singularly perturbed differential equations with integral boundary condition

    Amiraliyev, G.M.; Amiraliyeva, I.G.; Kudu, Mustafa

    We consider a uniform finite difference method on Shishkin mesh for a quasilinear first order singularly perturbed boundary value problem (BVP) with integral boundary condition. We prove that the method is first order convergent except for a logarithmic factor, in the discrete maximum norm, independently of the perturbation parameter. The parameter uniform convergence is confirmed by numerical computations.

    RDL Kalıcı Kaydıİncele
  • ArticleYalnız künye2003
    A work on torus knots K(p,q)

    Ugur, Tamer; Kopuzlu, Abdullah; Şimşek, Hakan

    The work on torus knots K(p,q) was discussed. Torus knot is a knot which wraps around the standard solid torus T in the longitudinal direction p times and in the meridional direction q times. The (p,q) were relatively prime. A computer program was introduced to plot the curves of regular projection torus knots by computer.

    RDL Kalıcı Kaydıİncele
  • ArticleYalnız künye2003
    A method on the matrix of graph of torus knot k(2, q) and its Maple application

    Kopuzlu, Abdullah; Ugur, Tamer

    In this paper, we introduce a method finding the matrix of graph of connected sum of torus knot K(2, q) for q = 1, 3, 5,⋯ Then, we show that the dimension of the matrix is (q - 1) k + 1, where k is the number of connected sum. Also, for this method a Maple source code is given.

    RDL Kalıcı Kaydıİncele
  • ArticleYalnız künye2003
    Application of computer algebra to Jones polynomials

    Ugur, Tamer; Kopuzlu, Abdullah

    In this paper we apply computer algebra (Maple) techniques to calculate Jones polynomial of graphs of K(2,q)-Torus knots. For this purpose, a computer program was developed. When a positive integer q is given, the program calculate Jones polynomial of graph of K(2,q)-Torus knots.

    RDL Kalıcı Kaydıİncele
Tam Kayıt
AlanDeğerDil
creativeworkseries.issn0096-3003
creativeworkseries.issn1873-5649
dc.date.accessioned2026-10-20T15:42:20.258938682Z
dc.date.available2026-10-20T15:42:20.258938682Z
dc.identifier.urihttps://rdlopen.rawdatalibrary.net/r/ebyu/24873
dc.publisherELSEVIER SCIENCE INC
dc.rightsinfo:eu-repo/semantics/openAccess
dc.titleApplied Mathematics and Computation
dspace.entity.typeJournal