Skip to content
Journal

Journal of Advances in Mathematics and Computer Science

Published by SCIENCEDOMAIN international · ISSN (electronic) 2456-9968

Search within this journal

1,763

Articles indexed

0

2026 articles

1,763

Open access

9,342

Citations (indexed)

Publications by year

Articles (1763)

On the Non-Existence of Difference Sets with Perfect Square Order

Adegoke S. Osifodunrin · Journal of Advances in Mathematics and Computer Science · 2016

The existence of Paley-Hadamard (4t − 1, 2t − 1, t − 1) difference sets provides a platform for solving the equation δ¯δ = n in the cyclotomic ring Z[ζ4t−1], where ζ4t−1 is root of unity, n > 1 and t > 1 are integers. We look at cases where ⟨n⟩ = ⟨δ⟩⟨¯δ⟩ in Z[ζ4t−1] but δ¯δ...

Open access Research Article 10.9734/BJMCS/2016/9173

Symbolic Dynamics Generated by a Hybrid Chaotic Systems

Carlos Correia Ramos, Ana Isabel Santos & Sandra Vinagre · Journal of Advances in Mathematics and Computer Science · 2016

We consider piecewise defined differential dynamical systems which can be analysed through symbolic dynamics and transition matrices. We have a continuous regime, where the time flow is characterized by an ordinary differential equation (ODE) which has explicit solutions, and the...

Open access Research Article 10.9734/BJMCS/2016/27863

Numerical Solution of First Order Fuzzy Differential Equations by Simpson’s Rule

S. Sindu Devi & K. Ganesan · Journal of Advances in Mathematics and Computer Science · 2016

The concept of fuzzy versions of Simpson’s rule and Runge-Kutta method of order four are introduced. In this paper, the solution of fuzzy ordinary differential equation of the first order by Simpson’s rule and Runge-Kutta method of order four is presented without converting them...

Open access Research Article 10.9734/BJMCS/2016/26060

An Example of the Application of Provability Logic to Unsolved Problems in Number Theory: The Cullen Numbers and Conway’s Supposition

Alexander Bolotin · Journal of Advances in Mathematics and Computer Science · 2016

This short paper offers an example of possibly fruitful interactions between modal logic and number theory. In the paper, Conway's remark that p and p.2p + 1  can both be prime numbers is formulated as a formula of modal logic and then analyzed for its decidability.

Open access Research Article 10.9734/BJMCS/2016/27581

Permeable Rings and Their Extensions

M. A. Zalukh & S. K. Nauman · Journal of Advances in Mathematics and Computer Science · 2016

Let us call a ring R to be right permeable if for any α ∈ R; Rα  = 0, then αR = 0. Left permeable and permeable rings are defined analogously. These rings are generalized reversible rings with a privileging role that permeability inherited in its several extensions where reversib...

Open access Research Article 10.9734/BJMCS/2016/27803

The nth Power Transformation of the Error Component of the Multiplicative Time Series Model

A. O. Dike, E. L. Otuonye & D. C. Chikezie · Journal of Advances in Mathematics and Computer Science · 2016

In this paper the author(s) present derivations for the mean and variance of the nth power transformation of the error component of the multiplicative time series model. as a general rule to any power transformation. Some of the published transformations like the square root and...

Open access Research Article 10.9734/BJMCS/2016/27246

A Rapid Quantization-based Image Retrieval Algorithm

Tingjia Shan, Qiang Ling, Kaikai Song, Binbin Du, Feng Li & Song Wang · Journal of Advances in Mathematics and Computer Science · 2016

Fast image retrieval has been a fundamental problem in the area of image processing for a long time. This paper proposes a rapid image retrieval algorithm by improving the conventional nearest neighbor search through the implementation of vector product quantization and inverted...

Open access Research Article 10.9734/BJMCS/2016/27865

Total Domination Number of Generalized Petersen Graphs P(ck,k)

Wensheng Li, Fengjun Liu, Liqiang Fan, Wei Chen & Jie Fang · Journal of Advances in Mathematics and Computer Science · 2016

A set S of vertices of a graph G = (V, E) with no isolated vertex is a total dominating set if every vertex of V(G) is adjacent to some vertex in S. The total domination number is the minimum cardinality of a total dominating set of G. In this paper, we study the total domination...

Open access Research Article 10.9734/BJMCS/2016/27588