A Novel Mathematical Model for Radio Mean Square Labeling Problem

A radio mean square labeling of a connected graph is motivated by the channel assignment problem for radio transmitters to avoid interference of signals sent by transmitters. It is an injective map h from the set of vertices of the graph G to the set of positive integers N , such that for any two distinct vertices x , y , the inequality d x , y + h x 2 + h y 2 / 2 ≥ dim G + 1 holds. For a particular radio mean square labeling h , the maximum number of h v taken over all vertices of G is called its spam, denoted by rmsn h , and the minimum value of rmsn h taking over all radio mean square labeling h of G is called the radio mean square number of G , denoted by rmsn G . In this study, we investigate the radio mean square numbers rmsn P n and rmsn C n for path and cycle, respectively. Then, we present an approximate algorithm to determine rmsn G for graph G . Finally, a new mathematical model to find the upper bound of rmsn G for graph G is introduced. A comparison between the proposed approximate algorithm and the proposed mathematical model is given. We also show that the computational results and their analysis prove that the proposed approximate algorithm overcomes the integer linear programming model (ILPM) according to the radio mean square number. On the other hand, the proposed ILPM outperforms the proposed approximate algorithm according to the running time.

Generating functions and congruences for 9-regular and 27-regular partitions in 3 colours

Let $b_{\ell;3}(n)$ denote the number of $\ell$-regular partitions of $n$ in 3 colours. In this paper, we find some general generating functions and new infinite families of congruences modulo arbitrary powers of $3$ when $\ell\in\{9,27\}$. For instance, for positive integers $n$ and $k$, we have\begin{align*}b_{9;3}\left(3^k\cdot n+3^k-1\right)&\equiv0~\left(\textup{mod}~3^{2k}\right),\\b_{27;3}\left(3^{2k+3}\cdot n+\dfrac{3^{2k+4}-13}{4}\right)&\equiv0~\left(\textup{mod}~3^{2k+5}\right).\end{align*}

A sandwich in thin lie algebras

A thin Lie algebra is a Lie algebra $L$ , graded over the positive integers, with its first homogeneous component $L_1$ of dimension two and generating $L$ , and such that each non-zero ideal of $L$ lies between consecutive terms of its lower central series. All homogeneous components of a thin Lie algebra have dimension one or two, and the two-dimensional components are called diamonds. Suppose the second diamond of $L$ (that is, the next diamond past $L_1$ ) occurs in degree $k$ . We prove that if $k>5$ , then $[Lyy]=0$ for some non-zero element $y$ of $L_1$ . In characteristic different from two this means $y$ is a sandwich element of $L$ . We discuss the relevance of this fact in connection with an important theorem of Premet on sandwich elements in modular Lie algebras.

Divisibility of Fibonomial coefficients in terms of their digital representations and applications

<abstract><p>We give a characterization for the integers $ n \geq 1 $ such that the Fibonomial coefficient $ {pn \choose n}_F $ is divisible by $ p $ for any prime $ p \neq 2, 5 $. Then we use it to calculate asymptotic formulas for the number of positive integers $ n \leq x $ such that $ p \mid {pn \choose n}_F $. This completes the study on this problem for all primes $ p $.</p></abstract>

The Primitive-Solutions of Diophantine Equation x^2+pqy^2=z^2, for primes p,q

In this paper, we determine the primitive solutions of diophantine equations x^2+pqy^2=z^2, for positive integers x, y, z, and primes p,q. This work is based on the development of the previous results, namely using the solutions of the Diophantine equation x^2+y^2=z^2, and looking at characteristics of the solutions of the Diophantine equation x^2+3y^2=z^2 and x^2+9y^2=z^2.

New classes of graphs with edge $ \; \delta- $ graceful labeling

<abstract><p>Graph labeling is a source of valuable mathematical models for an extensive range of applications in technologies (communication networks, cryptography, astronomy, data security, various coding theory problems). An edge $ \; \delta - $ graceful labeling of a graph $ G $ with $ p\; $ vertices and $ q\; $ edges, for any positive integer $ \; \delta $, is a bijective $ \; f\; $ from the set of edge $ \; E(G)\; $ to the set of positive integers $ \; \{ \delta, \; 2 \delta, \; 3 \delta, \; \cdots\; , \; q\delta\; \} $ such that all the vertex labels $ \; f^{\ast} [V(G)] $, given by: $ f^{\ast}(u) = (\sum\nolimits_{uv \in E(G)} f(uv)\; )\; mod\; (\delta \; k) $, where $ k = max (p, q) $, are pairwise distinct. In this paper, we show the existence of an edge $ \; \delta- $ graceful labeling, for any positive integer $ \; \delta $, for the following graphs: the splitting graphs of the cycle, fan, and crown, the shadow graphs of the path, cycle, and fan graph, the middle graphs and the total graphs of the path, cycle, and crown. Finally, we display the existence of an edge $ \; \delta- $ graceful labeling, for the twig and snail graphs.</p></abstract>

On the divisibility among power GCD and power LCM matrices on gcd-closed sets

Let [Formula: see text] and [Formula: see text] be positive integers and let [Formula: see text] be a set of [Formula: see text] distinct positive integers. For [Formula: see text], one defines [Formula: see text]. We denote by [Formula: see text] (respectively, [Formula: see text]) the [Formula: see text] matrix having the [Formula: see text]th power of the greatest common divisor (respectively, the least common multiple) of [Formula: see text] and [Formula: see text] as its [Formula: see text]-entry. In this paper, we show that for arbitrary positive integers [Formula: see text] and [Formula: see text] with [Formula: see text], the [Formula: see text]th power matrices [Formula: see text] and [Formula: see text] are both divisible by the [Formula: see text]th power matrix [Formula: see text] if [Formula: see text] is a gcd-closed set (i.e. [Formula: see text] for all integers [Formula: see text] and [Formula: see text] with [Formula: see text]) such that [Formula: see text]. This confirms two conjectures of Shaofang Hong proposed in 2008.

NOTE ON SUPER \((a,1)\)–\(P_3\)–ANTIMAGIC TOTAL LABELING OF STAR \(S_n\)

Let \(G=(V, E)\) be a simple graph and \(H\) be a subgraph of \(G\). Then \(G\) admits an \(H\)-covering, if every edge in \(E(G)\) belongs to at least one subgraph of \(G\) that is isomorphic to \(H\). An \((a,d)-H\)-antimagic total labeling of \(G\) is bijection \(f:V(G)\cup E(G)\rightarrow \{1, 2, 3,\dots, |V(G)| + |E(G)|\}\) such that for all subgraphs \(H'\) of \(G\) isomorphic to \(H\), the \(H'\) weights \(w(H') =\sum_{v\in V(H')} f (v) + \sum_{e\in E(H')} f (e)\) constitute an arithmetic progression \(\{a, a + d, a + 2d, \dots , a + (n- 1)d\}\), where \(a\) and \(d\) are positive integers and \(n\) is the number of subgraphs of \(G\) isomorphic to \(H\). The labeling \(f\) is called a super \((a, d)-H\)-antimagic total labeling if \(f(V(G))=\{1, 2, 3,\dots, |V(G)|\}.\) In [5], David Laurence and Kathiresan posed a problem that characterizes the super \( (a, 1)-P_{3}\)-antimagic total labeling of Star \(S_{n},\) where \(n=6,7,8,9.\) In this paper, we completely solved this problem.

Local-moves on knots and products of knots II

We use the terms, knot product and local-move, as defined in the text of this paper. Let [Formula: see text] be an integer [Formula: see text]. Let [Formula: see text] be the set of simple spherical [Formula: see text]-knots in [Formula: see text]. Let [Formula: see text] be an integer [Formula: see text]. We prove that the map [Formula: see text] is bijective, where [Formula: see text]Hopf, and Hopf denotes the Hopf link. Let [Formula: see text] and [Formula: see text] be 1-links in [Formula: see text]. Suppose that [Formula: see text] is obtained from [Formula: see text] by a single pass-move, which is a local-move on 1-links. Let [Formula: see text] be a positive integer. Let [Formula: see text] denote the knot product [Formula: see text]. We prove the following: The [Formula: see text]-dimensional submanifold [Formula: see text] [Formula: see text] is obtained from [Formula: see text] by a single [Formula: see text]-pass-move, which is a local-move on [Formula: see text]-submanifolds contained in [Formula: see text]. See the body of this paper for the definitions of all local-moves in this abstract. We prove the following: Let [Formula: see text], and [Formula: see text] be positive integers. If the [Formula: see text] torus link is pass-move-equivalent to the [Formula: see text] torus link, then the Brieskorn manifolds, [Formula: see text] and [Formula: see text], are diffeomorphic as abstract manifolds. Let [Formula: see text] and [Formula: see text] be (not necessarily connected or spherical) 2-dimensional closed oriented submanifolds in [Formula: see text]. Suppose that [Formula: see text] is obtained from [Formula: see text] by a single ribbon-move, which is a local-move on 2-dimensional submanifolds contained in [Formula: see text]. Let [Formula: see text] be an integer [Formula: see text]. We prove the following: The [Formula: see text]-submanifold [Formula: see text] [Formula: see text] is obtained from [Formula: see text] by a single [Formula: see text]-pass-move, which is a local-move on [Formula: see text]-dimensional submanifolds contained in [Formula: see text].

Development of mandelbrot set for the logistic map with two parameters in the complex plane

In this paper, the study of the dynamical behavior of logistic map has been disused with representing fractals graphics of map, the logistic map depends on two parameters and works in the complex plane, the map defined by f(z,α,β)=αz(1–z)β. where and are complex numbers, and β is a positive integers number, the visualization method used in this work to generate fractals of the map and to inspect the relation between the value of β and the shape of the map, this visualization analysis showed also that, as the value of β increasing, as the number of humps in the function also increasing, and it demonstrate that is true also for the function’s first iteration , f2(x0)=f(f(x0)) and the second iteration , f3(x0)=f(f2(x0)), beside that , the visualization technique showed that the number of humps in that fractal is less than the ones in the second iteration of the original function ,the study of the critical points and their properties of the logistic map also discussed it, whereas finding the fixed point led to find the critical point of the function f, in addition , it haven proven for the set of all pointsα∈C and β∈N, the iteration function f(f(z) has an attractive fixed points, and belongs to the region specified by the disc |1–β(α–1)|<1. Also, The discussion of the Mandelbrot set of the function defined by the f(f(z)) examined in complex plans using the path principle, such that the path of the critical point z=z0 is restricted, finally, it has proven that the Mandelbrot set f(z,α,β) contains all the attractive fixed points and all the complex numbers in which α≤(1/β+1) (1/β+1) and the region containing the attractive fixed points for f2(z,α,β) was identified