Topic overview

math.GM

490 works640 researchers

Map preview

Start with the graph, then narrow the list

490works
640researchers

Next steps

Use the topic as a working map

Open the full map for clusters, then return here to scan ranked papers and people.

Topic graph

See the topic as a live network

Open full explorer

Inspect nearby papers, researchers, institutions and communities without opening a separate graph page.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Papers in this area

24 paper(s) to start with

preprint2016arXiv

On Transforming the Generalized Exponential Power Series

We transformed the generalized exponential power series to another functional form suitable for further analysis. By applying the Cauchy-Euler differential operator in the form of an exponential operator, the series became a sum of exponential differential operators acting on a simple exponential (exp(-x). In the process we found new relations for the operator and a new polynomial with some interesting properties. Another form of the exponential power series became a nested sum of the new polynomial, thus isolating the main variable to a different functional dependence. We studied shortly the asymptotic behavior by using the dominant terms of the transformed series. New series expressions were created for common functions, like the trigonometric and exponential functions, in terms of the polynomial.

preprint2017arXiv

A Study on the Product Set-Labeling of Graphs

Let $X$ be a non-empty ground set and $\mathscr{P}(X)$ be its power set. A set-labeling (or a set-valuation) of a graph $G$ is an injective set-valued function $f:V(G)\to \mathscr{P}(X)$ such that the induced function $f^*:E(G) \to \mathscr{P}(X)$ is defined by $f^*(uv)=f(u)\ast f(v)$, where $f(u)\ast f(v)$ is a binary operation of the sets $f(u)$ and $f(v)$. A graph which admits a set-labeling is known to be a set-labeled graph. A set-labeling $f$ of a graph $G$ is said to be a set-indexer of $G$ if the associated function $f^*$ is also injective. In this paper, we introduce a new notion namely product set-labeling of graphs as an injective set-valued function $f:V(G)\to \mathscr{P}(\mathbb{N})$ such that the induced edge-function $f^*:V(G)\to \mathscr{P}(\mathbb{N})$ is defined as $^*f(uv)=f(u)\ast f(v) \forall\ uv\in E(G)$, where $f(u)\ast f(v)$ is the product set of the set-labels $f(u)$ and $f(v)$, where $\mathbb{N}$ is the set of all positive integers and discuss certain properties of the graphs which admit this type of set-labeling.

preprint2016arXiv

Two open problems in the fixed point theory of contractive type mappings on first-countable quasimetric spaces

Two open problems in the fixed point theory of quasi metric spaces posed in [Berinde, V. and Choban, M. M., {\it Generalized distances and their associate metrics. Impact on fixed point theory}, Creat. Math. Inform. {\bf 22} (2013), no. 1, 23--32] are considered. We give a complete answer to the first problem, a partial answer to the second one, and also illustrate the complexity and relevance of these problems by means of four very interesting and comprehensive examples.

preprint2016arXiv

Multiple fixed point theorems for contractive and Meir-Keeler type mappings defined on partially ordered spaces with a distance

We introduce and study a general concept of multiple fixed point for mappings defined on partially ordered distance spaces in the presence of a contraction type condition and appropriate monotonicity properties. This notion and the obtained results complement the corresponding ones from [Choban, M., Berinde, V., {\it A general concept of multiple fixed point for mappings defined on spaces with a distance} (submitted)] and also simplifies some concepts of multiple fixed point considered by various authors in the last decade or so.

preprint2016arXiv

How likely are two independent recurrent events to occur simultaneously during a given time?

We determine the probability $P$ of two independent events $A$ and $B$, which occur randomly $n_A$ and $n_B$ times during a total time $T$ and last for $t_A$ and $t_B$, to occur simultaneously at some point during $T$. Therefore we first prove the precise equation \begin{equation*} P^* = \dfrac{t_A+t_B}{T} - \dfrac{t_A^2+t_B^2}{2T^2} \end{equation*} for the case $n_A = n_B = 1$ and continue to establish a simple approximation equation \begin{equation*} P \approx 1 - \left( 1 - n_A \dfrac{t_A + t_B}{T} \right)^{n_B} \end{equation*} for any given value of $n_A$ and $n_B$. Finally we prove the more complex universal equation \begin{equation*} P = 1 - \dfrac{ \left( T^+ - t_A n_A - t_B n_B \right)^{n_A + n_B} }{ \left( T^+ - t_A n_A \right)^{n_A} \left( T^+ - t_B n_B \right)^{n_B} } \pm E^\pm, \end{equation*} which yields the probability for $A$ and $B$ to overlap at some point for any given parameter, with $T^+ := T + \frac{t_A + t_B}{2}$ and a small error term $E^\pm$.

preprint2016arXiv

A general concept of multiple fixed point for mappings defined on spaces with a distance

Our main aim in this paper is to introduce a general concept of multidimensional fixed point of a mapping in spaces with distance and establish various multidimensional fixed point results. This new concept simplifies the similar notion from [A. Roldan, J. Martinez-Moreno, C. Roldan, {\it Multidimensional fixed point theorems in partially ordered complete metric spaces}, J. Math. Anal. Appl. 396 (2012), 536--545]. The obtained multiple fixed point theorems extend, generalise and unify many related results in literature.

preprint2016arXiv

Soft topology redefined

In this paper we give a new definition of soft topology using elementary union and elementary intersection although these operations are not distributive. Also we have shown that this soft topology is different from Naz's soft topology and studied some basic properties of this new type of soft topology. Here we use elementary complement of soft sets, though law of excluded middle is not valid in general for this type of complementation.

preprint2016arXiv

To Prove Four Color Theorem

In this paper, we give a proof for four color theorem(four color conjecture). Our proof does not involve computer assistance and the most important is that it can be generalized to prove Hadwiger Conjecture. Moreover, we give algorithms to color and test planarity of planar graphs, which can be generalized to graphs containing $K_x(x>5)$ minor. There are four parts of this paper: Part-1: To Prove Four Color Theorem Part-2: An Equivalent Statement of Hadwiger Conjecture when $k=5$ Part-3: A New Proof of Wagner's Equivalence Theorem Part-4: A Geometric View of Outerplanar Graph

preprint2016arXiv

Chromatic Zagreb indices for graphical embodiment of colour clusters

For a colour cluster $\mathbb{C} =(\mathcal{C}_1,\mathcal{C}_2, \mathcal{C}_3,\ldots,\mathcal{C}_\ell)$, where $\mathcal{C}_i$ is a colour class such that $|\mathcal{C}_i|=r_i$, a positive integer, we investigate two types of simple connected graph structures $G^{\mathbb{C}}_1$, $G^{\mathbb{C}}_2$ which represent graphical embodiments of the colour cluster such that the chromatic numbers $χ(G^{\mathbb{C}}_1)=χ(G^{\mathbb{C}}_2)=\ell$ and $\min\{\varepsilon(G^{\mathbb{C}}_1)\}=\min\{\varepsilon(G^{\mathbb{C}}_2)\} =\sum\limits_{i=1}^{\ell}r_i-1$. Therefore, the problem is the edge-minimality inverse to finding the chromatic number of a given simple connected graph. In this paper, we also discuss the chromatic Zagreb indices corresponding to $G^{\mathbb{C}}_1$, $G^{\mathbb{C}}_2$.

preprint2016arXiv

Linear Map of $D$-Algebra

Module is effective representation of ring in Abelian group. Linear map of module over commutative ring is morphism of corresponding representation. This definition is the main subject of the book. To consider this definition from more general point of view I started the book from consideration of Cartesian product of representations. Polymorphism of representations is a map of Cartesian product of representations which is a morphism of representations with respect to each separate independent variable. Reduced morphism of representations allows us to simplify the study of morphisms of representations. However a representation has to satisfy specific requirements for existence of reduced polymomorphism of representations. It is possible that Abelian group is only $Ω$-algebra, such that representation in this algebra admits polymorphism of representations. However, today, this statement has not been proved. Multiplicative $Ω$-group is $Ω$-algebra in which product is defined. The definition of tensor product of representations of Abelian multiplicative $Ω$-group is based on properties of reduced polymorphism of representations of Abelian multiplicative $Ω$-group. Since an algebra is

preprint2016arXiv

Distance, entropy and similarity measures of Type-2 soft sets

The concept of Type-2 soft sets had been proposed as a generalization of Molodstov's soft sets. In this paper some shortcomings of some existing distance measures for Type-1 soft sets have been shown and accordingly some new distance measures have been proposed. The axiomatic definitions for distance, entropy and similarity measures for Type-2 soft sets have been introduced and a couple of such measures have been defined. Also the applicability of one of the proposed similarity measures have been demonstrated by showing its utility as an effective tool in a decision making problem.

preprint2016arXiv

Relation-theoretic contraction principle in metric-like as well as partial metric spaces

In this paper, we extend the Banach contraction principle to metric-like as well as partial metric spaces (not essentially complete) equipped with an arbitrary binary relation. Thereafter, we derive some fixed point results which are sharper versions of the corresponding known results of the existing literature. Finally, we use an example to demonstrate our main result.

preprint2016arXiv

Mathematics: abstraction and reality. A sketch toward deeper analysis

This paper establishes grounds for deeper exploration into the question of dual nature of mathematics as an abstract discipline and as a concrete science. It is argued, as one of the consequences of the discussion, that the division into "pure" and "applied" mathematics is artificial. The criterion of creativity and applicability outside of the original context is used as a litmus test. It is emphasized that great societies and cultural environments produce great mathematics and individual mathematicians.

preprint2016arXiv

The geometry of proper quaternion random variables

Second order circularity, also called properness, for complex random variables is a well known and studied concept. In the case of quaternion random variables, some extensions have been proposed, leading to applications in quaternion signal processing (detection, filtering, estimation). Just like in the complex case, circularity for a quaternion-valued random variable is related to the symmetries of its probability density function. As a consequence, properness of quaternion random variables should be defined with respect to the most general isometries in $4D$, i.e. rotations from $SO(4)$. Based on this idea, we propose a new definition of properness, namely the $(μ_1,μ_2)$-properness, for quaternion random variables using invariance property under the action of the rotation group $SO(4)$. This new definition generalizes previously introduced properness concepts for quaternion random variables. A second order study is conducted and symmetry properties of the covariance matrix of $(μ_1,μ_2)$-proper quaternion random variables are presented. Comparisons with previous definitions are given and simulations illustrate in a geometric manner the newly introduced concept.

preprint2016arXiv

Computer modeling of exponential and logarithmic functions of generalized quaternions in symbolic computation system

The paper deals with the process of mathematical modeling representations of exponential and logarithmic functions hypercomplex number system of generalized quaternions via determining a linear differential equation with hypercomplex coefficients. Simulation is performed using symbolic computation system Maple. Some properties of these concepts and their relation to the exponential representations of specific non-commutative hypercomplex number systems of dimension four.

preprint2016arXiv

Symbolic Iterative Solution of Boundary Value Problems for Partial Differential Equations

In this article we introduce a simple straightforward and powerful method involving symbolic manipulation, Picard iteration, and auxiliary variables for approximating solutions of partial differential boundary value problems. The method is easy to implement, computationally efficient, and it is highly accurate. The output of the method is a function that approximates the exact solution.

preprint2016arXiv

Explicit and Exact Traveling Wave Solutions of Cahn Allen equation using MSE Method

By using Modified simple equation method, we study the Cahn Allen equation which arises in many scientific applications such as mathematical biology, quantum mechanics and plasma physics. As a result, the existence of solitary wave solutions of the Cahn Allen equation is obtained. Exact explicit solutions interms of hyperbolic solutions of the associated Cahn Allen equation are characterized with some free parameters. Finally, the variety of structure and graphical representation make the dynamics of the equations visible and provides the mathematical foundation in mathematical biology, quantum mechanics and plasma physics.

preprint2016arXiv

Ramanujan Sums as Derivatives

In 1918 S. Ramanujan defined a family of trigonometric sum now known as Ramanujan sums. In the last few years, Ramanujan sums have inspired the signal processing community. In this paper, we have defined an operator termed here as Ramanujan operator. In this paper it has been proved that these operator possesses properties of first derivative and second derivative with a particular shift. Generalised multiplicative property and new method of computing Ramanujan sums are also derived in terms of interpolation.

preprint2016arXiv

A collocation method based on extended cubic B-splines for numerical solutions of the Klein-Gordon equation

A generalization of classical cubic B-spline functions with a parameter is used as basis in the collocation method. Some initial boundary value problems constructed on the nonlinear Klein-gordon equation are solved by the proposed method for extension various parameters. The coupled system derived as a result of the reduction of the time order of the equation is integrated in time by the Crank-Nicolson method. After linearizing the nonlinear term, the collocation procedure is implemented. Adapting the initial conditions provides a linear iteration system for the fully integration of the equation. The validity of the method is investigated by measuring the maximum errors between analytical and the numerical solutions. The absolute relative changes of the conservation laws describing the energy and the momentum are computed for both problems.

preprint2016arXiv

The algebraic structure of quantity calculus

An algebraic structure underlying the quantity calculus is proposed consisting in an algebraic fiber bundle, that is, a base structure which is a free Abelian group together with fibers which are one dimensional vector spaces, all of them bound by algebraic restrictions. Subspaces, tensor product and quotient spaces are considered as well as homomorphisms to end with a classification theorem of these structures. The new structure provides an axiomatic foundation for quantity calculus and gives complete justification within its framework of the way that quantity calculus is actually performed. It is hoped that this exposition helps to clarify the role of the interviening concepts of quantity, quantity value, quantity dimension and their relation with a system of units, particularly, the SI.

preprint2016arXiv

Dirac matrices as elements of superalgebraic matrix algebra

The paper considers a Clifford extension of the Grassmann algebra, in which operators are built from Grassmann variables and by the derivatives with respect to them. It is shown that a subalgebra which is isomorphic to the usual matrix algebra exists in this algebra, the Clifford exten-sion of the Grassmann algebra is a generalization of the matrix algebra and contains superalgebraic operators expanding matrix algebra and produces supersymmetric transformations.

People in this topic

12 visible researcher(s)