Journal of Prime Research in Mathematics

Journal of Prime Research in Mathematics (JPRM) ISSN: 1817-3462 (Online) 1818-5495 (Print) is an HEC recognized, Scopus indexed, open access journal which provides a plate forum to the international community all over the world to publish their work in mathematical sciences. JPRM is very much focused on timely processed publications keeping in view the high frequency of upcoming new ideas and make those new ideas readily available to our readers from all over the world for free of cost. Starting from 2020, we publish one Volume each year containing two issues in June and December. The accepted papers will be published online immediate in the running issue. All issues will be gathered in one volume which will be published in December of every year.

Latest Published Articles

Fermi, Bose and Vicious walk configurations on the directed square lattice

JPRM-Vol. 1 (2005), Issue 1, pp. 156 – 177 Open Access Full-Text PDF
F. M. Bhatti, J. W. Essam
Abstract: Inui and Katori introduced Fermi walk configurations which are non-crossing subsets of the directed random walks between opposite corners of a rectangular \(l × w\) grid. They related them to Bose configurations which are similarly defined except that they include multisets. Bose configurations biject to vicious walker watermelon configurations. It is found that the maximum number of walks in a Fermi configuration is \(lw + 1\) and the number of configurations corresponding to this number of walks is a w-dimensional Catalan number \(C_{l,w}\). Product formulae for the numbers of Fermi configurations with \(lw\) and \(lw − 1\) walks are derived. We also consider generating functions for the numbers of \(n−\)walk configurations as a function of \(l\) and \(w\). The Bose generating function is rational with denominator \((1-z)^{lw+1}\). The Fermi generating function is found to have a factor \((1+z)^{lw+1}\) and the complementary factor , \( Q_{l,w}^{frmi}(z)\)is related to the numerator of the Bose generating function which is a generalized Naryana polynomial introduced by Sulanke. Recurrence relations for the numbers of Fermi walks and for the coefficients of the polynomial \( Q_{l,w}^{frmi}(z)\) are obtained.
Read Full Article

Statistical space control in non-linear systems: speed gradient method

JPRM-Vol. 1 (2005), Issue 1, pp. 144 – 155 Open Access Full-Text PDF
S. V. Borisenok
Abstract: Here we discuss the application of control theory to dynamical non-linear systems in the form of speed gradient method. This approach can be practically used for the space focusing of classical or quantum particles, for instance, in nanolithography with the beams of cooled atoms. Standard speed gradient method works here not very efficient because it allows to achieve the selected level of energy (the eigenfunction of Hamiltonian for dynamical differential equation). For the practical purposes we re-formulate the mathematical task and introduce principally new type of controlled systems. We demand achievement of the space distribution of the dynamical particles. Additionally we investigate the statistical properties of the particle dynamics but not the behavior of the single particle. Efficiency of the approach was verified by means of computer simulations.
Read Full Article

On the defining spectrum of \(k-\)regular graphs with \(k–1\) colors

JPRM-Vol. 1 (2005), Issue 1, pp. 118 – 135 Open Access Full-Text PDF
Doostali Mojdeh
Abstract: In a given graph \(G = (V;E)\), a set of vertices S with an assignment of colors to them is said to be a defining set of the vertex coloring of G, if there exists a unique extension of the colors of S to a \(c \geq \chi(G)\) coloring of the vertices of G. A defining set with minimum cardinality is called a minimum defining set and its cardinality is the defining number, denoted by \((d(G; c)\). If F is a family of graphs then \( Spec_{c}(F)=\{d| \exists G, G \epsilon F, d(G,C)=d \} \). Here we study the cases where \(F\) is the family of \(k-\)regular (connected and disconnected) graphs on n vertices and \(c = k-1\). Also the \(Spec_{k-1}(F)\) defining spectrum of all \(k-\)regular (connected and disconnected) graph on n vertices are verified for \(k = 3, 4\) and \(5\).
Read Full Article

Extremal and asymptotic properties of irreducible coverings of graphs by cliques

JPRM-Vol. 1 (2005), Issue 1, pp. 101 – 110 Open Access Full-Text PDF
Ioan Tomescu
Abstract: A clique of a graph G is a complete subgraph of \(G\) which is maximal relatively to set inclusion and a covering C of G consisting of s cliques is an irreducible covering if the union of any \(s − 1\) cliques from C is a proper subset of the vertex-set of \(G\). Some discrete optimization problems involve irreducible coverings of graphs: minimization of Boolean functions, minimization of incompletely specified finite automata, finding the chromatic number of a graph. This paper surveys some recent results by the author on the irreducible coverings of graphs by cliques: the recurrence relation and the exponential generating function of the number of irreducible coverings for bipartite graphs, asymptotic behavior of these numbers and of the maximum number of irreducible coverings by cliques of an n-vertex graph as n tends to infinity, extremal graphs of order n for irreducible coverings by \(n − 2\) and \(n − 3\) cliques and the structure of irreducible coverings for bipartite and nonbipartite cases. Some conjectures and open problems are proposed.
Read Full Article

Volume 20 (2024)

Volume 19 (2023)

Volume 18 (2022)

Volume 17 (2021)

Volume 16 (2020)

Volume 15 (2019)

Volume 14 (2018)

Volume 13 (2017)

Volume 12 (2016)

Volume 11 (2015)

Volume 10 (2014)

Volume 09 (2013)

Volume 08 (2012)

Volume 07 (2011)

Volume 06 (2010)

Volume 05 (2009)

Volume 04 (2008)

Volume 03 (2007)

Volume 02 (2006)

Volume 01 (2005)