http://www.ccsenet.org/journal/index.php/jmr/issue/feedJournal of Mathematics Research2016-05-24T18:58:26-07:00Sophia Wangjmr@ccsenet.orgOpen Journal Systems<p><strong><em>Journal of Mathematics Research </em></strong>(ISSN: 1916-9795; E-ISSN 1916-9809) is an open-access, international, double-blind peer-reviewed journal published by the Canadian Center of Science and Education. This journal, published <strong>bimonthly</strong> (<span>February, April, June, August, October and December</span>) in <strong>both print and online versions</strong>, keeps readers up-to-date with the latest developments in all aspects of mathematics.</p><div class="Section1"><strong>The scopes of the journal </strong>include, but are not limited to, the following topics: statistics, approximation theory, numerical analysis, operations research, dynamical systems, mathematical physics, theory of computation, information theory, cryptography, graph theory, algebra, analysis, probability theory, geometry and topology, number theory, logic and foundations of mathematics. <em> </em></div><div class="Section1"><p>This journal accepts article submissions<strong> <a href="/journal/index.php/jmr/information/authors">online</a> or by <a href="mailto:jmr@ccsenet.org">e-mail</a> </strong>(jmr@ccsenet.org).</p></div><div class="Section1"><br /><br /><strong><strong><em><img src="/journal/public/site/images/jmr/jmr.jpg" alt="jmr" width="201" height="264" align="right" hspace="20" /></em></strong><strong>ABSTRACTING AND INDEXING:</strong></strong></div><div class="Section1"><strong><br /></strong></div><div class="Section1"><ul><li>BASE (Bielefeld Academic Search Engine)<strong><br /></strong></li><li><strong>EBSCOhost</strong></li><li>Google Scholar</li><li>JournalTOCs</li><li>LOCKSS</li><li><strong>MathEDUC</strong></li><li><strong><a href="http://www.ams.org/dmr/JournalList.html">Mathematical Reviews</a>® (<a href="http://www.ams.org/mathscinet">MathSciNet</a>®)</strong></li><li>MathGuide</li><li>NewJour</li><li>OCLC Worldcat</li><li>Open J-Gate</li><li><strong>ProQuest</strong></li><li>SHERPA/RoMEO</li><li>Standard Periodical Directory</li><li>Ulrich's</li><li>Universe Digital Library</li><li><strong><a href="https://zbmath.org/journals/?q=se:00006772">Zentralblatt MATH</a></strong></li></ul></div><div class="Section1"><strong><br /></strong></div><div class="Section1"> </div>http://www.ccsenet.org/journal/index.php/jmr/article/view/60005Heuristic Algorithms for Solving Multiobjective Transportation Problems2016-05-23T00:46:55-07:00Ali Musaddak Delphialimathdelphi@yahoo.com<p>In this paper, we proposed three heuristic algorithms to solve multiobjective transportation problems, the first heuristic algorithm used to minimize two objective functions (total flow time and total late work), the second one used to minimize two objective functions (total flow time and total tardiness) and the last one used to minimize three objective functions (total flow time, total late work and total tardiness), where these heuristic algorithms which is different from to another existing algorithms and providing the support to decision markers for handing time oriented problems.</p>2016-05-21T00:00:00-07:00Copyright (c) 2016 Journal of Mathematics Researchhttp://www.ccsenet.org/journal/index.php/jmr/article/view/60006Rigorous Proof for Reimann Hypothesis Using the Novel Sigma-power Laws and Concepts from the Hybrid Method of Integer Sequence Classification2016-05-23T00:46:55-07:00John Y. C. Tingjycting@hotmail.comProposed by Bernhard Reimann in 1859, Reimann hypothesis refers to the famous conjecture explicitly equivalent to the mathematical statement that the critical line in the critical strip of Reimann zeta function is the location for all non-trivial zeros. The Dirichlet eta function is the proxy for Reimann zeta function. We treat and closely analyze both functions as unique mathematical objects looking for key intrinsic properties and behaviors. We discovered our key formula (coined the Sigma-power law) which is based on our key Ratio (coined the Reimann-Dirichlet Ratio). We recognize and propose the Sigma-power laws (in both the Dirichlet and Reimann versions) and the Reimann-Dirichlet Ratio, together with their various underlying mathematically-consistent properties, in providing crucial \textit{de novo} evidences for the most direct, basic and elementary mathematical proof for Reimann hypothesis. This overall proof is succinctly summarized for the reader by the sequential Theorem I to IV in the second paragraph of Introduction section. Concepts from the Hybrid method of Integer Sequence classification are important mathematical tools employed in this paper. We note the intuitively useful mental picture for the idea of the Hybrid integer sequence metaphorically becoming the non-Hybrid integer sequence with certain criteria obtained using Ratio study.2016-05-21T00:00:00-07:00Copyright (c) 2016 Journal of Mathematics Researchhttp://www.ccsenet.org/journal/index.php/jmr/article/view/60007Hopf-bifurcation Limit Cycles of an Extended Rosenzweig-MacArthur Model2016-05-24T18:58:26-07:00Enobong E. Joshuaekeminitakpan@uniuyo.edu.ngEkemini T. Akpanekeminitakpan@uniuyo.edu.ngChinwendu E. Madubuezeekeminitakpan@uniuyo.edu.ng<p>In this paper, we formulated a new topologically equivalence dynamics of an Extended Rosenzweig-MacArthur Model. Also, we investigated the local stability criteria, and determine the existence of co-dimension-1 Hopf-bifurcation limit cycles as the bifurcation-parameter changes. We discussed the dynamical complexities of this model using numerical responses, solution curves and phase-space diagrams.</p>2016-05-21T00:00:00-07:00Copyright (c) 2016 Journal of Mathematics Researchhttp://www.ccsenet.org/journal/index.php/jmr/article/view/60008Solve Special Case of Some Guran Problems2016-05-23T00:46:55-07:00Ahmad Alghousseinsalwayacoub123@gmail.comZiad Kanayasalwayacoub123@gmail.comSalwa Yacoubsalwayacoub123@gmail.com<p>Throughout this paper, all topological groups are assumed to be topological differential manifolds and algebraically free, our aim in this paper is to prove the open problems number (7) and (8). Which are introduced by (Guran, I, 1998). In many cases of spaces and under a suitable conditions. therefore, we denote by <em>I(X)</em> and <em>I(Y)</em> to be a free topological groups over a topological spaces <em>X</em> and <em>Y</em> respectively where <em>X</em> and <em>Y</em> are assumed to be a non- empty sub manifolds Which are also a closed sub sets, and <em>P</em> is a classes of topological spaces, as a regular, normal, Tychonoff, lindelöf, separable connected, compact and Zero- dimensional space, and we have tried to use a hereditary properties and others of these spaces, so we can prove the open problems in these cases and we have many results showed in this paper.</p>2016-05-21T00:00:00-07:00Copyright (c) 2016 Journal of Mathematics Researchhttp://www.ccsenet.org/journal/index.php/jmr/article/view/59950Existence of Solutions to the Boundary Value Problems for a Class of P-Laplacian Equations at Resonance2016-05-23T00:46:55-07:00Lina Zhoulnazhou@163.comWeihua Jianglnazhou@163.comBy the generalizing the extension of the continuous theorem of Ge and Ren and constructing suitable Banach spaces and operators, we investigate the existence-solutions to the boundary value problems for a class of p-Laplacian equations. Finally an example is given to illustrate our results.2016-05-18T00:00:00-07:00Copyright (c) 2016 Journal of Mathematics Researchhttp://www.ccsenet.org/journal/index.php/jmr/article/view/59942Strong Masting Conjecture for Multiple Size Hexagonal Tessellation in GSM Network Design2016-05-23T00:46:55-07:00Samuel K. Amponsahelvis.donkor@uenr.edu.ghElvis K. Donkohelvis.donkor@uenr.edu.ghJames A. Ansereelvis.donkor@uenr.edu.ghKusi A. Bonsuelvis.donkor@uenr.edu.gh<p>One way to improve cellular network performance is to use efficient handover method and design pattern among other factors. The efficient design pattern has been proven geometrically to be hexagonal (Hales, 2001, pp. 1- 22) due to its maximum tessellable area coverage. But uneven geographical distribution of subscribers requires tessellable hexagons of different radii due to variation of costs of GSM masts. This will call for an overlap difference. The constraint of minimum overlap difference for multiple cell range is a new area that is untapped in cell planning. This paper addresses such multiple size hexagonal tessellation problem using a conjecture. Data from MTN River State-Nigeria, was collected. Multiple Size Hexagonal Tessellation Model (MSHTM) conjecture for masting three (3) different size MTN GSM masts in River State, accounted for least overlap difference with area of 148.3km<sup>2</sup> using 36 GSM masts instead of the original 21.48 km<sup>2</sup> for 50 GSM masts. Our conjecture generally holds for k-different (k>=2 ) cell range.</p>2016-05-18T05:32:36-07:00Copyright (c) 2016 Journal of Mathematics Researchhttp://www.ccsenet.org/journal/index.php/jmr/article/view/59943A Class of Linear Boundary Value Problem for $k$-regular Functions in Clifford Analysis2016-05-23T00:46:55-07:00Yan Zhangyzhangbun@163.comIn this paper, we introduce the linear boundary value problem for $k$-regular function, and give an unique solution for this problem by integral equation method and fixed-point theorem.2016-05-18T05:32:36-07:00Copyright (c) 2016 Journal of Mathematics Researchhttp://www.ccsenet.org/journal/index.php/jmr/article/view/59944Computing of Z- valued Characters for the Projective Special Linear Group L2 (2m) and the Conway Group Co32016-05-23T00:46:55-07:00Ali Moghanimoghania@wpunj.edu<p><span lang="EN-US">According to the main result of W. Feit and G. M. Seitz (see, Illinois J. Math. 33 (1), 103-131, 1988), the projective special linear group L<sub>2</sub> (2<sup>m</sup>) for m = 3, 4, 5 and the smallest Conway group Co<sub>3</sub> are unmatured groups. In this paper, we continue our study on special finite groups (see Int. J. Theo. Physics, Group Theory, and Nonlinear Optics (17)1, 57-62, 2013) and the dominant classes and Q- conjugacy characters for the above groups are derived.</span></p>2016-05-18T05:32:36-07:00Copyright (c) 2016 Journal of Mathematics Researchhttp://www.ccsenet.org/journal/index.php/jmr/article/view/59945Solving Boundary-Layer Problems by Residual-Power-Series Method2016-05-23T00:46:55-07:00Mohd Taib ShatnawiTaib.shatnawi@yahoo.com<p><span lang="EN-US">In this paper, the so-called residual-power-series (RPS) method is presented for solving nonlinear boundary-layer equations. The RPS method provides a single unified treatment for the linear and nonlinear terms in the equations. The accuracy and efficiency of the RPS method is demonstrated for both a single and a system of two coupled boundary-layer equations on an unbounded domain.</span></p>2016-05-18T05:32:36-07:00Copyright (c) 2016 Journal of Mathematics Researchhttp://www.ccsenet.org/journal/index.php/jmr/article/view/59946The Global Formulation of the Cauchy Problem2016-05-23T00:46:55-07:00Mohammad Ali Bashiryash-marina@yandex.ruTarig Abdelazeem Abdelhaleemyash-marina@yandex.ru<p><span lang="EN-US">A Geometrical model for the global Cauchy problem, generalizing the traditional Cauchy problem is considered .The complete correspondence between the known<span>analytical formulation and the </span>geometrical interpretation is described, we have utilized the generalized Green's function and the open mapping theorem appropriate to the problem.</span></p>2016-05-18T05:32:36-07:00Copyright (c) 2016 Journal of Mathematics Researchhttp://www.ccsenet.org/journal/index.php/jmr/article/view/59947Bernoulli Algebra on Common Fractions and Generalized Oscillations2016-05-23T00:46:55-07:00Alexander P. Buslaevapal2006@yandex.ruAlexander G. Tatashevapal2006@yandex.ruBernoulli algebra on set of proper common fractions with fixed denominator has been introduced and investigated. This algebra is one of most important components of a discrete dynamical system called logistic bipendulum.2016-05-18T05:32:36-07:00Copyright (c) 2016 Journal of Mathematics Researchhttp://www.ccsenet.org/journal/index.php/jmr/article/view/59099A New Heuristic Method for Transportation Network and Land Use Problem2016-05-23T00:53:30-07:00Mouhamadou A.M.T. Baldmouhamadouamt.balde@ucad.edu.snBabacar M. Ndiayebabacarm.ndiaye@ucad.edu.snOur paper deals with the Transportation Network and Land Use (TNLU) problem. It consists in finding, simultaneously, the best location of urban area activities, as well as of the road network design that may minimize the moving cost in the network, and the network costs. We propose a new mixed integer programming formulation of the problem, and a new heuristic method for the resolution of TNLU. Then, we give a methodology to find locations or relocations of some Dakar region amenities (home, shop, work and leisure places), that may reduce travel time or travel distance. The proposed methodology mixes multi-agent simulation with combinatorial optimization techniques; that is individual agent strategies versus global optimization using Geographical Information System. Numerical results which show the effectiveness of the method, and simulations based on the scenario of Dakar city are given.2016-05-23T00:39:23-07:00Copyright (c) 2016 Journal of Mathematics Researchhttp://www.ccsenet.org/journal/index.php/jmr/article/view/58585Products of Admissible Monomials in the Polynomial Algebra as a Module over the Steenrod Algebra2016-05-23T00:46:55-07:00Mbakiso Fix Mothebemothebemf@mopipi.ub.bwLet ${\P}(n) ={\F}[x_1,\ldots,x_n]$ be the polynomial algebra in $n$ variables $x_i$, of degree one, over the field $\F$ of two elements. The mod-2 Steenrod algebra $\A$ acts on ${\P }(n)$ according to well known rules. A major problem in algebraic topology is that of determining $\A^+{\P}(n)$, the image of the action of the positively graded part of $\A$. We are interested in the related problem of determining a basis for the quotient vector space ${\Q}(n) = {\P}(n)/\A^{+}\P(n)$. Both ${\P }(n) =\bigoplus_{d \geq 0} {\P}^{d}(n)$ and ${\Q}(n)$ are graded, where ${\P}^{d}(n)$ denotes the set of homogeneous polynomials of degree $d$. ${\Q}(n)$ has been explicitly calculated for $n=1,2,3,4$ but problems remain for $n \geq 5.$ In this note we show that if $u = x_{1}^{m_1} \cdots x_{k}^{m_{k}} \in {\P}^{d}(k)$ and $v = x_{1}^{e_1} \cdots x_{r}^{e_{r}} \in {\P}^{d'}(r)$ are an admissible monomials, (that is, $u$ and $v$ meet a criterion to be in a certain basis for ${\Q}(k)$ and ${\Q}(r)$ respectively), then for each permutation $\sigma \in S_{k+r}$ for which $\sigma(i)<\sigma(j),$ $i<j\leq k$ and $\sigma(s)<\sigma(t),$ $k<s<t\leq k+r,$ the monomial $x_{\sigma(1)}^{m_1} \cdots x_{\sigma(k)}^{m_{k}} x_{\sigma(k+1)}^{e_1} \cdots x_{\sigma(k+r)}^{e_r} \in {\P}^{d+d'}(k+r)$ is admissible. As an application we consider a few cases when $n=5.$2016-05-23T00:46:35-07:00Copyright (c) 2016 Journal of Mathematics Research