ﻻ يوجد ملخص باللغة العربية
It is inevitable that the $L_{g}(s)$ association scheme with $ggeq 3, sgeq g+2$ is a pseudo-$L_{g}(s)$ association scheme. On the contrary, although $s^2$ treatments of the pseudo-$L_{g}(s)$ association scheme can form one $L_{g}(s)$ association scheme, it is not always an $L_{g}(s)$ association scheme. Mainly because the set of cardinality $s$, which contains two first-associates treatments of the pseudo-$L_{g}(s)$ association scheme, is non-unique. Whether the order $s$ of a Latin square $mathbf{L}$ is a prime power or not, the paper proposes two new conditions in order to extend a $POL(s,w)$ containing $mathbf{L}$. It has been known that a $POL(s,w)$ can be extended to a $POL(s,s-1)$ so long as Brucks cite{brh} condition $sgeq frac{(s-1-w)^4-2(s-1-w)^3+2(s-1-w)^2+(s-1-w)}{2}$ is satisfied, Brucks condition will be completely improved through utilizing six properties of the $L_{w+2}(s)$ association scheme in this paper. Several examples are given to elucidate the application of our results.
Motivated by the growing evidence for lepton flavour universality violation after the first results from Fermilabs muon $(g-2)$ measurement, we revisit one of the most widely studied anomaly free extensions of the standard model namely, gauged $L_{mu
The tightening of the constraints on the standard thermal WIMP scenario has forced physicists to propose alternative dark matter (DM) models. One of the most popular alternate explanations of the origin of DM is the non-thermal production of DM via f
Motivated by the growing evidence for the possible lepton flavour universality violation after the first results from Fermilabs muon $(g-2)$ measurement, we revisit one of the most widely studied anomaly free extensions of the standard model namely,
Inspired by the recent work Sahin and Agha gave recursion formulas for $mathcal{G}_{1}$ and $mathcal{G}_{2}$ Horn hypergeometric functions cite{saa}. The object of work is to establish several new recursion relations, relevant differential recursion
A emph{proper $t$-edge-coloring} of a graph $G$ is a mapping $alpha: E(G)rightarrow {1,ldots,t}$ such that all colors are used, and $alpha(e) eq alpha(e^{prime})$ for every pair of adjacent edges $e,e^{prime}in E(G)$. If $alpha $ is a proper edge-col