Let an odd integer be represented as $\sum_{n > m} 2^n + 2^m - 1$ for $m \geq 1$. To transform $2^m - 1$ according to the Collatz rules, the $3x + 1$ step is applied, resulting in the even integer $2^{m + 1} + 2^m - 2$. This even integer, being exactly once divisible by 2, becomes the next odd integer $2^m + 2^{m - 1} - 1$. This represents the growth phase, as exactly one even step follows an odd step. However, while the overall value of the integer increases, terms with decreasing indices are generated after each odd-even cycle. After $m$ such cycles, a term $2^{m - m}$ (which equals 1) is generated, canceling the negative 1. Additional even steps are then performed until the integer becomes odd again, which occurs when the next smallest index becomes zero. The positive 1 thus obtained is written as $2^1 - 1$. If uninterrupted, the term $2^1 - 1$ has the trivial cycle $2^1 - 1 \rightarrow 2^2 \rightarrow 2^1 \rightarrow 2^1 - 1$. This represents the shrinkage phase, as two even steps follow an odd step. To interrupt the trivial cycle, a sequence such as $2^1 + 2^2 + \cdots$ must be available to combine with $2^1 - 1$ and produce $2^{\mathcal{M}} - 1$. This starts another growth phase that lasts for $\mathcal{M}$ odd-even cycles. Finally, there is an attempt to craft an integer that can escape the shrinkage phase in the Collatz dynamics.

In India, the divorce rate is rising year after year. Divorces are thought to have increased by more than a factor of two during the past two decades. India has great cultural diversity, and each of its states has something unique to offer. The divorce rate in India, which differs from state to state, is among the most frequently discussed subjects. More than 30% of marriages end in divorce in big cities like Delhi, Mumbai, Chennai, and Bangalore. Divorce applications have nearly tripled in the past few years in cities like Delhi, Bangalore, Mumbai, Kolkata, and Lucknow. In India, the divorce rate has increased, especially in small cities. Hence, the reasons behind divorce in India were explored in this article. In order to analyze the causes of divorce, the current study aimed to combine the critical components of TOPSIS and COPRAS methodologies in a fuzzy environment. Additionally, it is shown that a comparison study may pinpoint the characteristics that influence divorces the most.

Many people, including Horadam, have studied the numbers $W_n$, satisfying the recurrence relation $W_n=u W_{n-1}+v W_{n-2}$ ($n\ge 2$) with $W_0=0$ and $W_1=1$. In this paper, we study the $p$-numerical semigroups of the triple $(W_i,W_{i+2},W_{i+k})$ for integers $i,k(\ge 3)$. For a nonnegative integer $p$, the $p$-numerical semigroup $S_p$ is defined as the set of integers whose nonnegative integral linear combinations of given positive integers $a_1,a_2,\dots,a_\kappa$ with $\gcd(a_1,a_2,\dots,a_\kappa)=1$ are expressed in more than $p$ ways. When $p=0$, $S=S_0$ is the original numerical semigroup. The largest element and the cardinality of $\mathbb N_0\backslash S_p$ are called the $p$-Frobenius number and the $p$-genus, respectively.

This article introduces the Theory of Inverse Discrete Dynamical Systems (TIDDS), a novel methodology for modeling and analyzing discrete dynamical systems via inverse algebraic models. Key concepts such as inverse modeling, structural analysis of inverse algebraic trees, and the establishment of topological equivalences for property transfer between a system and its inverse are elucidated. Central theorems on homeomorphic invariance and topological transport validate the transfer of cardinal attributes between dynamic representations, offering a fresh perspective on complex system analysis. A significant application presented is an alternative proof of the Collatz Conjecture, achieved by constructing an associated inverse model and leveraging analytical property transfers within the inverted tree structure. This work not only demonstrates the theory's capability to address and solve open problems in discrete dynamics but also suggests vast implications for expanding our understanding of such systems.

This paper investigates the periodic and quasi-periodic orbits in the symmetric collinear four-body problem through a variational approach. In Section 3, we analyze the conditions under which homographic solutions minimize the action functional. We demonstrate that these solutions for four equal masses arranged in a linear configuration are indeed the minimizers of the action functional and compute the minimum value of the action functional for these solutions. Additionally, we employ numerical experiments using Poincaré sections to explore the existence and stability of periodic and quasi-periodic solutions within this dynamical system. Our results provide a deeper understanding of the variational principles in celestial mechanics and reveal complex dynamical behaviors that are crucial for further studies in multi-body problems. The findings have significant implications for theoretical research and practical applications in astrodynamics and space mission planning.

With the rapid development of intelligent logistics and network environment, it has become an urgent problem to efficiently and accurately handle and analyse the huge amount of uncertain decision information. Traditional decision making methods often fail to make the best use of complex and incomplete information, especially in the field of cyber defence. To address these problems, this paper introduces a new mathematical tool, discrete multidimensional Z-numbers (MZs), for expressing and dealing with uncertainty and reliability in network defence decisions. In this paper, we first introduce the synthesis method of discrete multidimensional Z-numbers, which allows us to consider the uncertainty and reliability of multi-source information in network defence strategy. Then, the hidden probability of MZs is calculated by using the hidden probability model, and the multidimensional Z+−number is proposed, which improves the expressiveness of the model in dealing with information uncertainty. Based on MZs, we define a variety of utility functions and build a multi-attribute group decision framework for network defence around these functions. The MZs provides a novel perspective for analysing and designing response strategies, especially against highly adaptive and covert attacks. The method in this paper is verified by a case of network security assessment of an intelligent logistics company. The results show that this method can significantly improve the accuracy and efficiency of decision making, demonstrating its unique advantages and wide application potential in network defence. This integrated discrete multidimensional Z-number group decision method is not only suitable for intelligent logistics decision making, but also provides an efficient decision support tool for network defence, which helps to improve the intelligence and adaptability of network security defence.

The theory says that number interacts with spaces based on the meaning of mathematics, in this way it is possible to obtain numerical knowledge. The theory shows the possibility of using spaces related to each other to efficiently discover whether results and origins are even or odd, but always applying rules to make this work. the study uses equivalent representations of odd and even numbers. Thus, it is possible to discover the possibilities of origins and their results.

This paper focuses on establishing boundedness properties and Parseval-Goldstein type relations for the generalized Mehler-Fock transform initially introduced by B. L. J. Braaksma and B. M. Meulenbeld (Compositio Math.,{18}(3):235-287, 1967. Also, we derive an inversion formula for this transform over Lebesgue spaces.

O estudo apresenta uma afirmação e explicação de que ocorrem progressões numéricas maiores e menores que dependem da representação contida no espaço físico. Em casos gerais, números maiores são múltiplos e números menores são simples, porque vários números contêm mais números em muitos espaços físicos do que números simples. Em casos específicos, dependem da afirmação do que é a representação específica, podendo ocorrer realidades diferentes de casos gerais. Além disso, a teoria explica a mudança no número de números primos.

In this paper, the transmutation operator method is used to construct an exact solution to the initial boundary value problem for the equation of multidimensional free transverse vibration of a thin elastic plate with a singular Bessel operator acting on geometric variables. We emphasize that multidimensional Erdélyi–Kober operators of fractional order have the property of a transmutation operator, allowing one to transform more complex multidimensional partial differential equations with singular coefficients acting over all variables into simpler ones. If formulas for solutions are known for a simple equation, then we also obtain representations for solutions to the first complex partial differential equation with singular coefficients. In particular, it is successfully applied to the singular differential equations, especially with Bessel-type operators. Using this operator, the considered problem is reduced to a similar problem without the Bessel operator. Based on the solution to the auxiliary problem, an exact solution to the original problem is constructed and analyzed.

The theory of limited numbers says that the number is not infinite, that is, the number is limited in parts or completely. To reach a conclusion about the limited number, one must understand the meaning of mathematics and varied spaces, therefore, one must understand that mathematics and spaces interact. Mathematics has the function of describing the world precisely, where numbers represent elements or facts that rationally belong to space, and spaces have different intensities of specific physical concepts in each space; therefore, there is no infinite element or fact due to differences in the intensities of specific physical concepts in spaces that do not allow for the fact or fact in all spaces.

The generation of arithmetic sequences involves arithmetic operations. However, is it possible to generate such sequences without being subject to any arithmetic or related operations, all by just hand? The answer may be negative, as the very rule defining these sequences itself relies on arithmetic operations. Nonetheless, this paper presents a few results demonstrating that the exact sequences of $an$, where, $a \in \{ 2,3,\cdots,9,10\}$ and $n \in \mathbb N \cup \{0\}$, can indeed be generated up to any desired number of terms without relying on any arithmetic operations and others derived from such. This is done by the formation of a specialized table that leverages numerical patterns and the notion of concatenation.

The unified Mittag-Leffler (ML) function is important factor in formulation of compact form of fractional integrals. In this paper estimations of integral operators, with the unified ML function as kernel are given. The Hadamard inequality in the form of fractional integrals is proved by considering refinement of convexities. These estimations provide various inequalities as refinements of recently published results.

On the H-type group G⊂Rm×Rn, we study the existence of solutions for the Brezis-Nirenberg problem

A class of semi-linear elliptic equations with critical Hardy-Sobolev exponent has been considered. This model is widely used in hydrodynamics and glaciology, gas combustion in thermodynamics, quantum field theory and statistical mechanics, as well as gravity balance problems in galaxies. The $\left( PS\right) _{c}$ sequence of energy functional has been investigated, and then the mountain pass lemma was used to prove the existence of at least one nontrivial solution. Also a multiplicity result has been obtained. Some known results have been generalized.

The existence of palindrome numbers of arbitrary length greater than 2 that are divisible by the prime number 37 is proven in this paper. The method to construct such a palindrome is also described. It turns out that a palindrome number divisible by 37 is also divisible by 3 and, consequently, divisible by 111.

Recently several papers have been published on the Liénard equation x'' +L x+m x^3+n x^5=0, where the authors studied their explicit solutions and their applications. Here we describe the complete dynamics of these differential equations in the Poincar\'e disc. The Poincar\'e disc is the closed disc centered at the origin of coordinates of radius one, the whole plane R^2 is identified with the interior of this disc, and its boundary, the circle $\sss^1$ is identified with the infinity of R^2.

We study L_2-approximation problems in the weighted Hilbert spaces in the worst case setting. Three interesting weighted Hilbert spaces appear in this paper, whose weights are equipped with two positive parameters $\ga_j$ and $\az_j$ for $j=1,\,2,\dots,\,d$. We consider the worst case error of algorithms that use finitely many arbitrary continuous linear functionals. We discuss the exponential convergence-(t,s)-weak tractability (EC-(t,s)-WT) of these L_2-approximation problems under the absolute or normalized error criterion. In particular, we obtain the sufficient and necessary conditions for EC-(1,1)-WT and EC-(t,1)-WT with t

Although the empirical Kepler’s laws can be proven by applying Newton’s laws to the dynamics of two particles attracted due to the gravitational interaction, there is no explicit formula for the motion as a function of time. In this paper, a quasi-analytical solution for this problem is proposed. It approximates the real behavior of celestial bodies with an acceptable degree of accuracy. All calculations involved require a low computational cost. This problem is closely related to Kepler’s equation, since, the solution for the equations of motion as a function of time gives us the solution to Kepler’s equation as well. The results are presented for each planet of the solar system (including Pluto), and the solution is compared against the real orbits.

Under suitable continuity and uniqueness conditions, solutions of an α order Caputo fractional boundary value problem are differentiated with respect to boundary values and boundary points. This extends well-known results for nth order boundary value problems. The approach used is a standard technique and makes heavy use of recent results for differentiation of solutions of Caputo fractional intial value problems with respect to initial conditions and continuous dependence for Caputo fractional boundary value problems.

Forest resources are renewable,rational exploitation and utilization of forest resources are not only conducive to sustainable development of population, but also can obtain higher economic benefits. Based on actual timber harvesting problems,a combined harvesting model of timber and non-timber with nonlinear harvesting term was established.Firstly, using the qualitative theory of ordinary differential equations, the dynamic behavior of the model is studied, and the existence and stability of the equilibrium point of the model are proved .Secondly, the optimal control solution is obtained by using the optimal control theory.Finally, the optimal harvesting strategy of timber and non-timber products is given based on the numerical simulation results, which provides a certain theoretical basis for the sustainable development of forestry ecological economy.

We can analyze the properties of the Collatz Conjecture by using Terras’ Theorem, and computational graphical calculations. To do this, we introduce the concept of “tree" which shows the relationship between the input and output positive integers of the Collatz process. This approach offers a novel way for determining the non-existence of loops and diverge trees through computer simulations.

Partial Differential Equations (PDEs) constitute a fundamental framework for modeling various physical phenomena across diverse fields such as physics, engineering, and finance. Solving PDEs accurately and efficiently remains a significant challenge, particularly when dealing with complex systems or high-dimensional data. In this paper, we present a novel approach based on deep learning techniques to investigate the effective factors in solving PDEs. Our methodology leverages the expressive power of deep neural networks to learn and represent the underlying relationships between input parameters and the solutions of PDEs. By incorporating domain knowledge into the network architecture and training process, our approach aims to provide insights into the key factors influencing the solution of PDEs. We demonstrate the effectiveness of our method through numerical experiments on various PDEs, showcasing its capability to identify important features and improve predictive accuracy. Our findings suggest that deep learning techniques offer a promising avenue for understanding and analyzing the complex dynamics inherent in PDEs, paving the way for enhanced computational methods in scientific and engineering applications.

This paper addresses the Collatz Conjecture, an open question in mathematics that postulates all positive integers will eventually reach one when a pair of specific operations are repeatedly applied. Despite its apparent simplicity, the conjecture lacks a formal proof. To tackle this enigma, we introduce Algebraic Inverse Trees (AITs), data structures that trace inverse operations of the Collatz sequence. This new approach not only elaborates our unique methodology but also sheds light on the underlying complexities of the Collatz Conjecture.

We primarily investigate the existence of solutions for fractional neutral integro-differential equations subjected to Neumann-type boundary conditions, which is crucial for understanding natural phenomena. Taking into account factors such as neutral type, fractional-order integrals, and fractional-order derivatives, we employ probability density functions, Laplace transforms, and resolvent operators to formulate a well-defined concept of a mild solution for the specified equation. Following this, by integrating fixed point theorems, we establish the existence of mild solutions under more relaxed conditions.

Let Vn(d) denote the least number such that every collection of nd-cubes with total volume 1 in d-dimensional (Euclidean) space can be packed parallelly into some d-box of volume Vn(d). We show that V3(d)=r1−dd if d≥11 and V3(d)=1r+1rd+1r−rd+1 if 2≤d≤10, where r is the only solution of the equation 2(d−1)kd+dkd−1=1 on 22,1 and (k+1)d(1−k)d−1dk2+d+k−1=kddkd+1+dkd+kd+1 on 22,1, respectively. The maximum volume is achieved by hypercubes with edges x, y, z such that x=2rd+1−1/d, y=z=rx if d≥11, and x=rd+(1r−r)d+1−1/d, y=rx, z=(1r−r)x if 2≤d≤10. We also proved that only for dimensions less than 11 there are two different maximum packings, and for all dimensions greater than 10 the maximum packing has the two smallest cubes the same.

This research focuses on the Hopf bifurcation occurring at a singular point with high-order degeneracy in a class of three-dimensional systems. Based on center manifold theorem, by expanding the technique for determining singular point values of degenerate singularities in two-dimensional systems, the formal series method to determine the singular point values at the high-order degenerate critical point is discussed. Furthermore, a class of specific three-dimensional differential systems with high-order degenerate singularities is explored. By computing the singular point values and determining center conditions, we proved that a minimum of 5 small-amplitude limit cycles in the vicinity of the origin. This research provides new perspectives on the center problem and limit cycle bifurcation in high-dimensional systems with high-order degenerate singular points.

This paper explores the application of Random Matrix Theory (RMT) as a methodological enhancement for portfolio selection within financial markets. Traditional approaches to portfolio optimization often rely on historical estimates of correlation matrices, particularly susceptible to instability. To address this challenge, we combine a data preprocessing technique based on the Hilbert transformation of returns with RMT to refine the accuracy and robustness of correlation matrix estimation. By contrasting empirical correlations with those derived from random matrices, we uncover non-random properties and underlying relationships within financial data. We then utilize this methodology to construct the correlation network dependence structure used in portfolio optimization. The empirical analysis presented in this paper validates the effectiveness of RMT in enhancing portfolio diversification and risk management strategies. This research contributes by offering investors and portfolio managers with methodological insights to construct portfolios that are more stable, robust, and diversified. At the same time, it advances our comprehension of the intricate statistical principles underlying multivariate financial data.

In this paper, we investigate the Green measure for a class of non-Gaussian processes in $\mathbb{R}^{d}$. These measures are associated with the family of generalized grey Brownian motions $B_{\beta,\alpha}$, $0

The paper primarily demonstrates that the three internal triangles formed by connecting any point on a midsegment with the vertices of a generic triangle satisfy the geometric Proof of the Pythagorean theorem in Euclidean geometry. Moreover, this study elucidates the Pythagorean relationships inherent within three-dimensional geometric constructs resulting from the arrangement of three-dimensional spatial triangles. This geometric relationship, akin to a generalized extension of the Pythagorean theorem, unveils a unique spatial region characterized by this harmonious area interrelation among triangles.

In this paper, we consider a class of bilevel programming problems (abbreviated as, BLPP). Exploiting the generalized approximate convexity assumptions, we investigate the relations among the solutions of approximate Minty (respectively, Stampacchia) type variational inequalities (abbreviated as, AMTVI (respectively, ASTVI)), and the local ϵ-quasi solutions of the BLPP. Moreover, by employing the generalized Knaster–Kuratowski–Mazurkiewicz (abbreviated as, KKM)-Fan’s lemma, we derive some existence results for the solutions of approximate variational inequalities (abbreviated as, AVI), namely, AMTVI and ASTVI. A non-trivial example is given to highlight the importance of the established results. To the best of our knowledge, there is no research paper available in the literature that establishes relationships between the AVI and the BLPP under the assumptions of generalized approximate convexity in terms of limiting subdifferentials.

This paper is devoted to the study of multi-dimensional integral transform with Fox H-function in the kernel in weighted spaces integrable functions in the domain R+n with positive coordinates. Mapping properties such as the boundedness, the range, the representations of the considered transformation are established.

This article deals with special curves similar to those known in mathematics as Lamé curves. Their equations have a certain similarity with the equations of Lamé curves. But these curves are more like ellipses in appearance. Like ellipses, they have major and minor axes. These are such curves that their major and minor semi-axis coincide with an ellipse but are different than an ellipse. The main feature of these curves is that for any triangle whose base coincides with the axis of a given curve and the vertex is on a given curve, the condition aⁿ+bⁿ=cⁿ is obtained. The number “n” is called the degree or rank of this curve. To distinguish this group of curves, we called them Elbe curves. The equations of these lines are also provided in the paper.

This study provides a comprehensive comparison of the Peter Chew Sum method and Newton's Sum in Quadratic Root Function Computations. Both methods offer significant advancements by alleviating the need for memorization of multiple formulas. However, when confronted with higher-order quadratic root functions such as the calculation of power 33. Newton's Sum method proves cumbersome due to its requirement of all previous answers for final computation, leading to increased steps and error risks. In contrast, the Peter Chew Sum method simplifies the computational process by requiring only a few previous answers, resulting in a more straightforward series of operations. We contextualize our analysis within the historical progression of mathematical techniques, highlighting the transformative leap represented by the Peter Chew Sum method in quadratic root function computations. Peter Chew Sum addressing the limitations of Newton's Sum , especially concerning higher-order functions such as the calculation of power 256. Furthermore, study demonstrates that the innovative approach of the Peter Chew Sum method not only simplifies complex computations but also fosters enhanced conceptual understanding among students. In conclusion, study findings underscore the profound impact of the Peter Chew Sum method on quadratic root function computations.

In this paper, a class of semi-linear elliptic equations involving Hardy-Sobolev critical exponents has been investigated. This problem comes from the consideration of standing waves in the anisotropic Schr\"{o}dinger equation, also it is very important in the field of hydrodynamics, glaciology, quantum field theory and statistical mechanics. By a detailed estimation for the extremum function and using Mountain Pass Lemma with $\left( PS\right) _{c}$ conditions, the existence of positive solutions has been obtained. On the other hand, by establishing Pohozaev-type identity and using the properties of Bessel function, the nonexistence of positive solution also has been obtained. These results are extensions of E. Jannelli's research (\cite[Theorem 1.A-1.C]{EJ}).

In this paper, we prove the existence of three solutions for a $p$-Kirchhoff problem with $\psi$-Hilfer fractional derivative. To be more precise, we use the variational method and we prove that the associated functional energy admits a critical point in each of the three constructed sets, these critical points are weak solutions for a studied problem. Moreover, by definition of these sets, one of these solutions is positive, the second is negative, and the third one change sign. At the end of this work, we present an example to validate our main results.

In this paper, we establish the necessary and sufficient conditions for solving a dual split quaternion matrix equation AXB=C, and present the general solution expression when solvability is achieved. As an application, we delve into the necessary and sufficient condition for the existence of Hermitian solution to this equation by using a newly defined real representation method. Furthermore, we obtain the solutions for the dual split quaternion matrix equations AX=C and XB=C. Finally, we provide a numerical example to demonstrate the findings of this paper.

The study aimed to investigate the impact of incorporating deep learning strategies in mathematics instruction on students' problem-solving abilities, critical thinking skills, academic achievement, and mathematical skills development. The study population consisted of 280 students, with a sample size of 162 participants. Employing a purely quantitative approach, data collection utilized questionnaires and achievement tests as instruments. Data analysis involved simple linear regression, descriptive analysis, and Pearson correlation. The results of the study revealed that there was no significant enhancement observed in students' problem-solving abilities and critical thinking skills when deep learning strategies were incorporated into mathematics instruction. Additionally, students' attitudes towards deep learning activities in mathematics showed no effect on their academic achievement. Furthermore, students' engagement levels in deep learning activities did not impact their development of mathematical skills. Lastly, the frequency of deep learning activities in the mathematics classroom did not show a significant relationship with students' academic performance. These findings suggest that the implementation of deep learning strategies in mathematics instruction did not yield notable improvements in the specified areas based on the study outcomes.

In order to deal with imprecision, ambiguity, and uncertainty in data analysis, Pawlak introduced rough set theory in 1982. This paper aims to expand the scope of basic set theory developed by presenting the notions of δP-upper and δP-lower approximations, that are based on the notion of δP-open sets, we additionally examine a few of their fundamental characteristics.

In this paper we introduce an ODE system to model the interaction between nature resources and human exploitation in a rich consumeristic society. In this model the rate of change of population depends on wealth per capita, and the rate of consumption has a quadratic growth with respect to population and wealth. As in our previous work \cite{BaCra_1}, we distinguish between renewable and non renewable resources, and we introduce a replenishment term for non renewable resources. We first get some information on the asymptotic behaviour of wealth and population, then we compute all the equilibria of the system and we study their stability when the parameter of exploitation of resources is small. Some numerical simulations confirm the theoretical results, and give suggestions for future research.

The present study aims to show on the one hand how easily one can get confused when doing research on the internet. Different platforms, fora and homepages supply the visitor with different - and sometimes contradictory - information. On the other hand, we show how to overcome these contradictions and produce valuable research based on almost all sources. For our study, we use the example of the Feit-Thompson conjecture, which is - in opposite to the well-known Feit-Thompson theorem - not widely known. We try to clarify the scientific literature on this topic and we embed our own result into the present state of art. We prove that pq−1p−1 does not divide qp−1q−1 if p and q are twin primes, i.e. p=q+2. Thus we prove that the Feit-Thompson conjecture is true for twin prime numbers.

In this paper the one-to-one correspondences and equivalences between ideals, primals, filters and grills are introduced. It is shown the local functions and the topological spaces induced by them are the same. From this point of view, the topological properties with respect to one topology can be derived from topological properties valid in the corresponding topology.

This paper proposed an optimal tracking control scheme through adaptive dynamic programming(ADP) for a class of partially unknown discrete-time nonlinear systems based on radial basis function neural network(RBF-NN). In order to acquire the unknown system dynamics, we use two RBF-NNs, the one is used to construct the identifier, and the another is used to directly approximate the steady-state control input, where a novel adaptive law is proposed to update neural network weights. While the optimal feedback control and the cost function are derived via feedforward neural networks approximating, it is proposed to regulate the tracking error, the critic network and the actor network are then trained online to obtain the solution of the associated Hamilton–Jacobi–Bellman (HJB) equation being built under the ADP framework. Simulations verify the effectiveness of the optimal tracking control technique using the neural networks.

Recently, Gohar et al. introduced a novel, local, and well-behaved fractional calculus. It possesses all the classical properties, and Its locality imposes simplicity and accuracy in modeling fractional order systems. In this article, we further develop the definitions and extend the classical properties of Gohar fractional calculus to address some of the open problems in Calculus. The fractional Gronwall's integral inequality, Taylor power series expansion, and Laplace transform are defined and applied to overcome some of the limitations in the classical integer-order calculus. The fractional Laplace transform is applied to solve Bernoulli-type logistic and Bertalanffy nonlinear fractional differential equations, and the criteria under which it can be applied to solve linear differential equations are investigated.

The main purpose of this article is to consider the smoothness control of a weak solution after some moment if there is known solution regularity until this moment. The necessary tools can be varied. It is possible to control kinetic energy dissipation to fix moment or changing of velocity square or summability of acceleration square to fix at point time.

We prove an analog of the removable singularity theorem for bounded harmonic functions on stratified sets. The harmonic functions are understood in the sense of the soft Laplacian. The result can become one of the main technical components for extending the well-known Poincaré–Perron’s method of proving the solvability of the Dirichlet problem for the soft Laplacian.

We consider a constrained optimal control problem and an extension of it, in which the set of strict-sense trajectories is enlarged. Extension is a common procedure in optimal control, used to derive necessary and sufficient optimality conditions for the original problem from the extended one, which usually admits a minimizer and has a more regular structure. However, this procedure fails if the two problems have different infima. It is therefore relevant to identify such situations. Following on from earlier work by Warga but adopting perturbation techniques developed in non-smooth analysis, we investigate the relation between the occurrence of an infimum gap and abnormality of necessary conditions. For a notion of local minimizer based on control distance and an extension including the impulsive one, we prove that (i) a local extended minimizer which is not a local minimizer of the original problem and (ii) a local strict-sense minimizer which is not a local minimizer of the extended problem, both satisfy the extended maximum principle in abnormal form. The main novelty is result (ii), as until now it had only been shown that a strict-sense minimizer which is not an extended minimizer is abnormal for an `averaged version’ of the maximum principle.

This work uses a new approach to investigate the Riemann hypothesis, drawing conclusions about its trueness. It is based on the more general method presented in a very recent publication, by the same author, showing in detail how to approach that very well-known and interesting problem. This is achieved by means of the theory of dynamical systems (Poincaré index associated to equilibria of 2-dimensional systems) and the study of the zeros of the Dirichlet eta function, defined by a Dirichlet series. By using the well-known fact that the zeros of the eta function include all zeros of the Riemann zeta function in the (open) critical strip, excluded the critical line, ((0,1/2) ∪ (1/2,1)) × (−∞,∞), the development proceeds using only the eta function. In addition, the open and simply connected region (1/2,1) × (0,∞) is used along the text, taking into account the symmetries of zeros of the functions under analysis in the critical strip. The basic line of proof is to find the mathematical expression for the Poincaré index of the vector field associated to the eta function, assuming the existence of a zero of the eta function outside the critical line (in (1/2,1) × (0,∞)), and investigating the resulting unfoldings. Eventually, an inconsistency occurs and the proof ends by contradiction.

Matrices and their inverses allow accurate calculations to be produced quickly and compactly and can be used to control any process represented by a system of equations. Singular matrices require extensive workarounds (costing time and money) to solve these systems of equations because they have no inverse. Finding their inverse involves division by zero. Nevertheless, recently a new number set called semi-structured complex numbers was developed to enable division by zero in algebraic equations. The aim of this research was to demonstrate that the inverse of a singular matrix can be found using semi-structured complex numbers. This research reveals (1) Singular matrices and their inverses can be used to find a unique solution to a pair of simultaneous equations that appear to have infinitely many solutions or appear to have no solution; (2) Singular matrices map coordinates in projective space to coordinates in Euclidean space and their inverse maps coordinates in Euclidean space to coordinates in projective space; (3) the inverse of a singular matrix proves that parallel lines in Euclidean space do not intersect but in projective space intersect at a “point at infinity” and (4) collinear lines that intersect at infinitely many points in Euclidean space only intersect at one point in projective space.

Quantum logic is a well-structured theory, which has recently received some attention because of its fundamental relation to quantum computing. However, the complex foundation of quantum logic borrowing concepts from different branches of mathematics as well as its peculiar settings have made it a non-trivial task to device suitable applications. This article aims to propose for the first time an approach to use quantum logic in image processing at hand of a process for shape classification. We show how to make use of the principal component analysis to realize quantum logical propositions. In this way we are able to assign a concrete meaning to the rather abstract quantum logical concepts, and we are able to compute a probability measure from the principal components. For shape classification we consider encrypting given point clouds of different objects by making use of specific distance histograms. This enables to initiate the principal component analysis. At hand of experiments, we explore the possibility to distinguish between different geometrical objects and discuss the results in terms of quantum logical interpretation.

. Interconnected control systems (ICS) widely apply to various technical systems. ICS has a complex description. Therefore, simplified models use, which the specifics of an object do not always reflect. So, the problem of synthesizing mathematical models is topical. The work purpose is to develop an approach to obtaining models in conditions of incomplete a priori information. We use an adaptive approach. As examples, two-channel systems (TCS) with cross-links and identical channels consider, and a method for mathematical model design. We consider the system with asymmetric cross-links and evaluate their impact on properties of an adaptive identification system. Approach proposed to assessing the TCS identifiability with cross-links. The excitation constancy influence on TСS parameter estimates is studied. A generalization of the proposed approach is given for an interconnected system.

The current letter complements my info-geometric discoveries, especially those provided from two papers of mine. Fundamentally, the statistical relativization of the Generalized Brownian Motion Manifold. Following this innovative and unprecedented track of research will open a plethora of numerous info-geometric investigations to many unexplored related phenomena in the hope to uncover more new interpretations for the Generalized Brownian Motion Manifold from an info-geometric perspective.

We extend the concept of metallic ratios to the real argument n considered as a dimension by analytic continuation showing that they are defined by an argument of a normalized complex number, and for rational n ≠ {0, ±2}, they are defined by Pythagorean triples. We further extend the concept of metallic ratios to metallic angles.

Monge-Ampere equations have important research significance in many fields such as geometry, convex geometry and mathematical physics. In this paper, under some superlinear and sublinear conditions, the existence of nontrivial solutions for a system arising from Monge-Ampere equations with two parameters is investigated based on Guo-Krasnosel'skii fixed point theorem. In the end, two examples are given to illustrate our main results.

In this paper, I introduce a new concept of representing numbers in base ; in other words, I have found new series for any number similar to series that could be written according to the collatz sequence which is called zi(n) in this article. These series need to end with 1. Then, we use two sets of rules to make a diagram which then proves the existence of such series for any number.In this diagram, by branching numbers into different branches in accordance to the modularity of 4 and continuing branching to the point that their numbers have enough common terms in their collatz series, we could reduce zi(n) to zi(k) so that k<n in any branch by Rule Number One. This diagram shows that zi(n) exists for every number, in other words, this proves the theorem (A) or zi-existence theorem. The proof of zi-existence theorem leads to a proof of the collatz conjecture because the collatz series could be written as a linear combination of such series that all of them end with 1, so the collatz series for any number ends with 1.

Chipman contends, in stark contrast to the conventional view, that utility is not a real number but a vector and is inherently lexicographic in nature. According to these views, it will be proved that, for every preordered topological space (X,≾,t), the assumption t to be finer than the order topology t≾ on (X,t), i.e. t⊇t≾, and the assumption the quotient topology t∣∼≾ that is defined on the preordered set (X∣∼,≾∣∼) of indifference classes of ≾ to be Hausdorff imply that a cardinal number κ and a (complete) preorder ≲ on {0,1}κ that is coarser than the lexicographical ordering ≤lex on {0,1}κ, i.e. ≤lex⊂≲, can be chosen in such a way that there exists a continuous order-embedding ϑ:(X,≾,t)⟶({0,1}κ,≲,t≤lex). This theorem will be compared with a theorem that, in particular, describes necessary and sufficient conditions for ≾ to have a continuous multi-utility representation.

In this paper, we consider an epidemiological Susceptible-Infected-Susceptible (SIS) model in which the individuals cured from the infection return back into the group of people endangered by the infection. Delay differential equations were introduced to create more realistic models since many processes depend on past history. Many different mathematical methods, including the Susceptible-Infected-Recovered (SIR) model as well as derivatives thereof, can be used to prognose the spread of many various infectious diseases, including Covid-19.We use a nonlinear differential system with time delay as a mathematical formulation of this model. It is examined by the existence of a positive solution which is bounded by two functions $k_1, k_2\in C([t_0,\infty),(0,\infty))$ with constants $\lambda_1 > 0,\,\lambda_2 > 0$ where $0<\lambda_1\leq \lambda_2$. The conditions are put in place for existence of a positive solution that approaches zero in infinity, if $t\to\infty$. Infectious diseases accompany a person throughout their entire life, and in the history of mankind often appeared in frequent epidemics caused high mortality. The occurrence of infectious diseases in the population represents a serious health, social and economic problem. There is a lot of ambiguity concerning the time span and final spread of the epidemic thus making it very demanding for the governing bodies, healthcare institutions, and economic sector to precisely judge the future development.Several examples are shown at the end of this paper.

In Chuanming Zong’s program to attack Hadwiger’s covering conjecture, which is a longstanding open problem from Convex and Discrete Geometry, it is essential to estimate covering functionals of convex bodies effectively. Recently, He et al. [J. Optim. Theory Appl. 2023, 196, 1036–1055.] and Yu et al. [Mathematics, 2023, 11, 2000] provided two deterministic global optimization algorithms having high computational complexity for this purpose. Since satisfactory estimations of covering functionals will be sufficient in Zong’s program, we propose a stochastic global optimization algorithm based on CUDA and provide an error estimation for the algorithm. The accuracy of our algorithm is tested by comparing numerical and exact values of covering functionals of convex bodies including the Euclidean unit disc, the three-dimensional Euclidean unit ball, the regular tetrahedron, and the regular octahedron. We also present estimations of covering functionals for the regular dodecahedron and the regular icosahedron.

Prime period sequences can serve as the fundamental tool to construct arbitrary composite period sequences. This is a review study of prime period perfect Gaussian integer sequence (PGIS). When cyclic group {1,2,…,N−1} can be partitioned into k cosets, where N=kf+1 is an odd prime number, the construction of a degree-(k+1) PGIS can be derived from either matching the flat magnitude spectrum criterion or making the sequence with ideal periodic autocorrelation function (PACF). This is a systematic approach of prime period N=kf+1 PGIS construction, and is applied to construct PGISs with degrees 1, 2, 3 and 5. However, for degrees larger than 3, matching either the flat magnitude spectrum or achieving the ideal PACF encounters a great challenge of solving a system of nonlinear constraint equations. To deal with this problem, the correlation and convolution operations can be applied upon PGIS of lower degrees to generate new PGIS with degree-4 and other higher degrees, e.g., 6, 7, 10, 11, 12, 14, 20 and 21 in this paper. In this convolution based scheme, both degree and pattern of a PGIS vary and can be indeterminant, which is rather nonsystematic compared with the systematic approach. The combination of systematic and nonsystematic schemes contributes the great efficiency for constructing abundant PGISs with various degrees and patterns for the associated applications.

It has been more than a century since Erlang published his paper in 1909. The classical queueing system for the M/D/c queue has been investigated by many authors. The key is to find the roots of an equation using explicit or numerical methods. We present an alternate form of explicit solution(s) of this/these root(s) using the Lambert-W function in this paper. In addition, the unsaturated probabilities of the number of customers in the system is derived explicitly in terms of this/these root(s). Finally, the mean number of customers in the system and the mean queueing delay are obtained from these probabilities. The exact queueing delay formula for the M/D/c queue is expressed in closed-form in terms of the root(s). Numerical results show that they are in excellent agreement with the numerical results published by Seelen, Tijms and Van Hoorn.

The purpose of the research is to investigate the unique solvability of a nonlocal boundary value problem for a loaded equation of parabolic-hyperbolic type in a special domain. Methods: Using representations of a general regular solution, the existence and uniqueness of the problem posed is proved. Results: A new method for proving the unique solvability of nonlocal boundary value problems for one loaded equation of mixed type in a special domain has been formed and developed. Conclusions: The obtained results make it possible to solve some problems of genetics, immunology, transonic gas dynamics and thermal physics, which are associated with displacement.

This work presents a new type of chaotic dynamical system originated from Dirichlet Eta function. Although the exposition describes only a bidimensional instance, it is certainly possible to construct higher dimensional such models. The novelty resides in the multitude of interesting characteristics concentrated in only one kind of dynamical system, mainly because of its simple abstract definition - it provokes dissipative, chaotic and itinerant behavior, and its paths typically display nonrecurring quasi-attractors and associate regions of ruin. In addition, it is discrete and nonautonomous, being additively driven by a simple real vector sequence. Also, the defining formulas have parameters which permit to activate bifurcatory effects, mainly related to setting the number of quasi-attractors and overall geometric complexity and diversity. In this fashion, it holds a certain similarity with classical itinerant chaotic systems, but it is a completely different object. One of its parameters is very influential and may be intuitively compared to a type of "potential energy", capable of changing the duration of sojourns etc. In this fashion, there is a potential opportunity to employ artificial inference techniques for designing specific structures on paths. Of course, the other parameters are also relevant, but not necessarily in the control of the number of quasi-attractors and the permanence periods near them. It is important to state that the described system was found during a previous investigation about certain features of the Riemann hypothesis, using the Dirichlet Eta function instead of the Riemann Zeta function - the components of the system under study here were part of certain series whose convergence had to be established, and that scenario produced this very positive side effect. The text also suggests an atypical, but important, potential application in philosophy: the representation of the Hindu concepts of Samsara and Moksha.

Currently, Pythagorean fuzzy sets (PFSs) have been widely applied in various fields due to their substantial advantages in expressing and dealing with uncertainty. However, measuring the similarity and difference between PFSs effectively remains an unresolved issue. Inspired by Tanimoto similarity, we propose a novel set of similarity and distance measures for PFSs. We delve into the theoretical properties of the proposed measures and compare it with existing PFSs measures. Numerous numerical examples validate their rationality and effectiveness. Furthermore, our experimental findings suggest that in contrast to existing measures, the introduced measures successfully circumvent various counter-intuitive issues encountered by current measures, and yield more pronounced outcomes in the discrimination of different fuzzy sets. This enhances the uniqueness and superiority of our measures. Finally, we developed two decision models based on the proposed measures and validated their applicability in three applications.

This paper serves as a seamless continuation of the previous work titled "Special Spirals are Produced by the ROTASE Galactic Spiral Equations with the Sequential Prime Numbers." Upon revisiting the data, a noteworthy observation emerged: the special spirals can be meticulously aligned with the prime spiral on a point-by-point basis through careful scaling and rotation for the parameter ρ remaining a constant greater than one. As ρ increases, both the scaling factor and rotation angle exhibit a corresponding augmentation, albeit with an intriguing caveat—the rotation angle asymptotically approaches its limit of 90°. Notably, the galactic spiral can be perceived as a remarkably close approximation of the Archimedean spiral, with the degree of proximity increasing as ρ grows larger. Furthermore, an intriguing correspondence arises when ρ takes on a value of 1; at this value, the galactic spiral bears a striking resemblance to the Fermat spiral, the space between two consecutive spiral loops undergoes a continuous reduction as the loop's radius expands, yet it never diminishes to zero; simultaneously, the area between two successive loops experiences an augmentation with the value of ρ.

We show succinctly a natural origin of the beautiful Gamma function in light of the WJ distribution, linking to quite distinct fields.

We investigate \texorpdfstring{$L_2$}{}-approximation problems in the worst case setting in the weighted Hilbert spaces \texorpdfstring{$H(K_{R_{d,\a,\g}})$}{} with weights \texorpdfstring{$R_{d,\a,{\bm \ga}}$}{} under parameters \texorpdfstring{$1\ge \ga_1\ge \ga_2\ge \cdots\ge 0$ and $1<\az_1\le \az_2\le \cdots$}{}. Several interesting weighted Hilbert spaces \texorpdfstring{$H(K_{R_{d,\a,\g}})$}{} appear in this paper. We consider the worst case error of algorithms that use finitely many arbitrary continuous linear functionals. Multivariate approximation; information complexity; tractability; weighted Hilbert spacesWe discuss tractability of \texorpdfstring{$L_2$}{}-approximation problems for the involved Hilbert spaces, which describes how the information complexity depends on \texorpdfstring{$d$}{} and \texorpdfstring{$\va^{-1}$}{}. As a consequence we study the strongly polynomial tractability (SPT), polynomial tractability (PT), weak tractability (WT), and \texorpdfstring{$(t_1,t_2)$}{}-weak tractability (\texorpdfstring{$(t_1,t_2)$}{}-WT) for all \texorpdfstring{$t_1>1$}{} and \texorpdfstring{$t_2>0$}{} in terms of the introduced weights under the absolute error criterion or the normalized error criterion.

Fermatean fuzzy sets (FFSs) are a versatile tool for handling uncertain problems and have shown great effectiveness in practical applications. However, many existing Fermatean fuzzy similarity measures exhibit counter-intuitive situations, making it challenging to accurately measure the similarity or difference between FFSs. To address this issue, several similarity and distance measures for FFSs are proposed, inspired by the Tanimoto similarity measure. The properties of the proposed measures are also explored, along with several comparative examples with existing measures for FFSs, which illustrate their superior performance in processing fuzzy information from FFSs. The proposed measures have effectively overcome the counter-intuitive challenges posed by many existing measures and significantly outperforms existing measures in differentiating different FFSs. Furthermore, we demonstrate the practical applicability of the proposed measures in solving pattern recognition, medical diagnosis and multiple-attribute decision-making problems.

In this article, it is demonstrated that if the zeta function does not have a sequence of zeros whose real part converges to 1, then it cannot have any zeros in the critical strip, showing that the Riemann Hypothesis is false.

In this paper, we will use the maximum likelihood estimation (MLE) and the Bayes methods to perform estimation procedures for the reliability of stress-strength ℜ=P[X>Y] based on independent adaptive progressive censored samples that were taken from the Chen distributions. An approximate confidence interval of ℜ is constructed using a variety of classical techniques, such as the normal approximation of the MLE, the normal approximation of the log-transformed MLE, and the percentile bootstrap (Boot-p) procedure. The Bayesian estimation of ℜ is obtained based on the balanced loss function, which comes in two versions here, the symmetric balanced squared error (BSE) loss function and the asymmetric balanced linear exponential (BLINEX) loss function. When estimating ℜ using the Bayesian approach, all the unknown parameters of the Chen distributions are assumed to be independently distributed and to have informative gamma priors. Further, a mixture of Gibbs sampling algorithm and Metropolis-Hastings algorithm is used to compute the Bayes estimate of ℜ and the associated highest posterior density credible interval. In the end, simulation research are used to assess the general overall performance of the proposed estimators and a real data set is provided to exemplify the theoretical results.

Here, we describe the bicomplex (p,q)- Fibonacci numbers and the bicomplex (p,q)- Fibonacci quaternions that are based on these numbers and give some of their equations, including the Binet formula, generating function, Catalan, Cassini, d’Ocagne’s identities, and some summation formulas for both of them. Finally, we create a matrix for bicomplex (p,q)- Fibonacci quaternions, and we obtain a determinant of a special matrix that gives the terms of that quaternion.

Real and complex analytic functions are largely studied in the field of complex analysis and are seen as very useful tools in solving problems in mathematics, physics and engineering. Real and complex numbers are a subset of semi-structured complex numbers (a new number set created to algebraically solve division by zero). Nevertheless, the properties of analytic functions made up of semi-structured complex variables (called semi-structured complex analytic functions) is yet to be explored. This limits the range of possible problems that can be resolved using analytic functions). In this regard, the aim of this paper was to expound upon the properties of semi-structured complex analytic functions and show their application in solving engineering problems. The results of this paper included (1) developing a full set of Cauchy–Riemann Equations for the semi-structured complex -space; (2) define sufficient and necessary conditions for a semi-structured complex function to be analytic; (3) determine the relationship between semi-structured complex analytic functions, Laplace’s Equations and Poisson’s Equations; and (5) provide an example of the use of these functions.

A symbolic analysis of Archimedes’ periodical number system is developed, from which a natural link emerges with the modern positional number systems with zero. After the publication of Fibonacci’s Liber Abaci, the decimal Indo-Arabic positional system was the basis of the algorithmic and algebraic trend of modern mathematics, but even if zero plays a crucial role in algebra and mathematical analysis, zeroless positional systems show the same capability of producing efficient arithmetical algorithms based on operation tables over digits. The crucial role of digits is assessed, by considering a representation of numbers based on strings in lexicographic order. A new algorithm for the determination of decimal periods is presented,, by remarking the cruciality of this topic in number theory. Periods of ordinal numbers, and enumerations of recursive enumerability are shortly recalled. Concluding remarks are formulated about the deep relationship among numbers and information, which shed new light on a red line passing through the whole history of mathematics

In this study, we consider a Lambert series whose coefficients are the sum of divisors function. Utilizing the Lambert series in the sequel we introduce a normalized linear operator JR_(α,β) (z) by applying the convolution with Rabotnov function. We then, acquire sufficient conditions for JR_(α,β) (z) to be Univalent, Starlike and Convex respectively. In each component of this study, we expand the derived results by applying two Robin's inequalities, one of which is equivalent to the Riemann hypothesis.

We introduce and discuss a generalization of the classical multi-objective optimization to pairs of functions. This procedure is referred to as bi-multi-objective optimization. A justification of this general optimization procedure is presented, related both to multi-objective optimization under ambiguity concerning individual preferences and to Pareto optimality for a family of preferences with nontransitive indifference. Incidentally, the binary relation naturally associated to a bi-multi-objective optimization problem is represented by a finite bi-multi-utility, which generalizes to the nontransitive case the classical finite multi-utility representation. An important application is presented to Markowitz portfolio selection under ambiguity concerning both the vector of returns and the covariance matrix.

Discretization in time and in the state space of the system leads to the necessity to solve the parameter identification problems for dynamic systems in a limited time (at a finite time interval) using observations obtained under the influence of unknown-but-bounded noise. Finding the solution in this case is more difficult compared to traditional identification problem setting which considers random independent zero-mean noise. For system parameter identification problem under unknown-but-bounded noise, a randomized stochastic optimization algorithm is given in the paper, estimates for the mean square values of the residuals for a finite observation interval are obtained. An example of application of the given method to the problem of tuning the parameters of a multi-mirror telescope is considered.

We consider two abstract systems of parabolic-hyperbolic type that model thermoelastic problems. We study the influence of the physical constants and the initial data on the nonexistence of global solutions that in our framework are produced by the blow-up in finite time of the norm of the solution in the phase space. We employ a differential inequality to find sufficient conditions that produce the blow-up. To that end, we construct a set that is positive invariant for any positive value of the initial energy. As a result we found that the coupling with the parabolic equation stabilizes the system, as well as the damping term in the hyperbolic equation. Moreover, for any pair of positive values $(\xi,\epsilon)$, there exist initial data such that the corresponding solution with initial energy $\xi$ blows-up at a finite time less than $\epsilon$. Our purpose is to improve results previously published in the literature.

The work is devoted to the development of methods for constructing asymptotic formulas as x→∞ of a fundamental system of solutions of linear differential equations generated by a symmetric two-term differential expression of odd order. The coefficients of the differential expression belong to classes of functions that allow oscillation (for example, those that do not satisfy the classical Titchmarsh-Levitan regularity conditions). As a model equation, the 5th order equation i2p(x)y′′′′′+p(x)y′′′′′+q(x)y=λy, for which various cases of behavior of the coefficients p(x),q(x), is investigated. New asymptotic formulas are obtained for the case when the function h(x)=−1+p−1/2(x)∉L1[1,∞) significantly influences the asymptotics of solutions to the equation. The case when the equation contains a nontrivial bifurcation parameter is studied.

Endoscopic medical images can suffer from uneven illumination, low contrast, and lack of texture information due to the use of point directional light sources and the presence of narrow tissue structures, posing diagnostic difficulties for physicians. In this paper, a deep learning-based su-pervised illumination enhancement network is designed for low-light endoscopic images, aiming to improve both global illumination and local details. Initially, a global illumination enhancement module is formulated utilizing a higher-order curve function to improve global illumination. Sec-ondly, a local feature extraction module incorporating dual attention is designed to capture local detailed features. Considering the significance of color fidelity in biomedical scenarios, the designed loss function prioritizes introducing color loss to alleviate image color distortion. Compared with seven state-of-the-art enhancement algorithms on Endo4IE endoscopic datasets, experimental re-sults show that the proposed method can better enhance low-light endoscopic images and avoid image color distortion. It provides an efficient method to enhance images captured by endoscopes which can effectively assist clinical diagnosis and treatment.

Extension of a derivation on a universally reversible JC-algebra A⊆B(H)_{sa} to the C*-algebra [A] generated by A in B(H) was studied by Upmier [20, Theorem 2.5]. In this article we study the extension of a Jordan derivation on a universally JC-algebra A to its universal enveloping real and complex C*-algebras R and U, respectively. Also, we establish the relationship between local derivations (resp., 2-local derivations, weak local derivations, weak-2-local derivations) of a universally JC-algebra A and the corresponding maps on its universal enveloping real and complex C*-algebras R and A, respectively.

Exercising surds to represent figures is a common practice in scientific and Engineering fields, especially in scripts where calculators are banned or unapproachable. Peter Chew Theorem make result becomes simple when dealing with converting Quadratic Surds. The substance of the Peter Chew Theorem lies in enabling the forthcoming generation to simple break problems related to Quadratic Surds more effectively, easing a direct comparison with contemporary results. By employing the Peter Chew Theorem, one can streamline the tutoring and literacy of math, particularly concerning second- order direct equations with constant portions. This theorem's objective aligns with Albert Einstein's famed quotation Everything should be made as simple as possible, but not simpler.

The article outlines a creative approach by fusing ideas from fuzzy contractions, graph mappings, and Kannan mappings to create a brand-new notion known as "Kannan-graph-fuzzy contraction." This combination of concepts makes it possible to create a unique framework for resolving real-world issues controlled by nonlinear models. It is anticipated that using Kannan-graph-fuzzy contractions will offer a fresh approach to discussing solution existence in situations where these ideas overlap. This strategy might have a significant impact on a lot of real-world applications, proving how practical multidisciplinary techniques are for tackling issues in the real world originating from technology and engineering. The article includes several illustrated examples based on computer simulations, making the results more explicit.

Proxy re-encryption (PRE) is a momentous and widely used cryptographic technique. It enables a proxy to forward ciphertext without the need of decryption. PRE has received significant interest in applications like cloud computing, blockchain, and the Internet of Things. Despite its wide range of uses, PRE has also been subject to new security and privacy regulations. In PKC’19, Cohen $et~al.$~first drew attention to the weakness in PRE's security against chosen-plaintext attacks (CPA) and put up a more stringent security concept known as security against honest re-encryption attacks (HRA). Notably, Cohen provides a beneficial conclusion as well. It is proveded that PRE schemes with re-encryption simulatability property can be elevated from CPA to HRA security. It is also proved that CPA-secure PRE schemes with re-encryption simulatability property can be directly elevated to those satisfying HRA security. However, those PRE schemes with re-encryption simulatability are almost always based on pairings. In this study, to the best of our knowledge, we directly construct HRA-secure PRE with re-encryption simulatability for the first time based on the learning with errors (LWE) assumption, which was widely believed to be quantum-resistant. Based on the re-encryption key generation algorithm and the re-encryption algorithm construction method of the above scheme, we can modify attribute-based conditional proxy re-encryption (AB-CPRE) as well as the corresponding attribute-based proxy re-encryption (AB-PRE) algorithm to make them have re-encryption simulatability properties. Finally, by using this property, We boost the security of AB-CPRE scheme of ESORICS'21 from CPA to HRA and simplify the HRA-security proof for the AB-PRE of ESORICS'21.

Mallios and Zafiris emphasize that adjoint functors or adjunctions are not only "ubiquitous" in category theory but characterize the naturality of their approach to physical geometry. Hence in this paper, the history and theory of adjoint functors is investigated. Where do adjoint functors come from mathematically and how did the concepts develop historically?

The paper deals with exploration of subsequences of polygonal numbers of different sides derived through step-by-step elimination of terms of the original sequences. Eliminations are based on special rules similarly to how the classic sieve of Eratosthenes was developed through the elimination of multiples of primes. These elementary number theory activities, appropriate for technology-enhanced secondary mathematics education courses, are supported by a spreadsheet, Wolfram Alpha, Maple, and the Online Encyclopedia of Integer Sequences. General formulas for subsequences of polygonal numbers referred to in the paper as polygonal number sieves of order k that include base-two exponential functions of k have been developed. Different problem-solving approaches to the derivation of such and other sieves based on the technology-immune/technology-enabled framework have been used. The accuracy of computations and mathematical reasoning is confirmed through the technique of computational triangulation enabled by using more than one digital tool. A few relevant excerpts from the history of mathematics are briefly featured.

We discuss two queueing-inventory systems with catastrophes in the warehouse. Catastrophes occur according to Poisson process and upon arrival of a catastrophe all inventory in the system is instantly destroyed. But consumer customers in the system (in the server or in the buffer) continue still waiting for the replenishment of the stock. The arrivals of the consumer customers follow a Markovian Arrival Process (MAP) and they can be queued in an infinite buffer. Service time of a consumer customer follows a phase-type distribution. The system receives negative customers whose have Poisson flows to service facility and upon arrival of a negative customer one consumer customer is pushed out from the system, if any. One of two replenishment policies can be used in the system: either (s,S) or (s,Q). If upon arrival of the consumer customer, the inventory level is zero, then according to the Bernoulli scheme, this customer is either lost (lost sale scheme) or join the queue (backorder sale scheme). The system is formulated by a four-dimensional continuous-time Markov chain. Steady state distribution is obtained using the matrix-geometric method. A comprehensive numerical study is performed on the performance measures under various replenishment policies. Finally, an optimization study is presented.

Using the method of the beta function, Sun has recently evaluated some series of the type $\sum_{k=0}^{\infty}(ak+b)x^k/\binom{mk}{nk}$. By factorization of the polynomial $t^{m-n}(1-t)^n-x$, we will give a general method to find new $\pi$-series.

The paper proves the existence of a family of axisymmetric equilibrium figures as solutions of a stationary problem with unknown boundaries for the Navier–Stokes equations corresponding to the slow rotation of a viscous compressible two-layer liquid mass about some axis. It is assumed that the liquids are barotropic, capillary and have different viscosities, the internal fluid being bounded by a closed surface. This interface does not intersect with the external boundary of the cloud. The proof is based on implicit function theorem and carried out in the Hölder spaces.

We establish a new Gagliardo-Nirenberg inequality characterized by radial symmetry and involving potentials exhibiting pure power polynomial behaviour. As an application of our result, we investigate the existence of extremals for this inequality, which also correspond to stationary solutions for the nonlinear Schrödinger equation with inhomogeneous nonlinearity, competing with Hs-subcritical nonlinearities, either of local or non-local nature.

In different fields in our life, like physics, coding theory and computer science, graph labeling dramas an vital role and appears in many applications. A labeling of a graph is a map which assign each element in with a positive integer number. An edge irregular total -labeling is a function such that where and are weights for any two distinct edges. In this case, has total edge irregularity strength (TEIS) if is minimum. In our paper, we defined a new type of graphs called a triple star snake graph and star snake graph . Also, we investigated TEIS for a triple star snake graph . After that, we generalized the results for star snake graph .

The aim of this paper is to deep into the dynamic study of the well known Chebyshev-Halley family of iterative methods for solving nonlinear equations. Our objetives are twofold: one the one hand, we are interested in characterize the existence of extraneous attracting fixed points when the methods in the family are applied to polynomial equations. On the other hand, we are also interested in study the free critical points of the methods in the family, as a previous step to determine the existence of attracting cycles. In both cases, we want to identify situations where the methods in the family have a bad behavior from the root-finding point of view. Finally, and joining these two studies, we look for polynomials for which there are methods in the family where this two situations happen simultaneously. That is, the rational map obtained by applying a method in the Chebyshev-Halley family to a polynomial has both super-attracting extraneous fixed point and super-attracting cycles different to the roots of the polynomial.

This article is a study on the (k,s)-Riemann-Liouville fractional integral, a generalization of the Riemann-Liouville fractional integral. Firstly, we introduce several properties of the extended integral of continuous functions. Furthermore, we make the estimation of the Box dimension of the graph of continuous functions after the extended integral. It presents that the upper Box dimension of the (k,s)-Riemann-Liouville fractional integral for any continuous functions is no more than the upper Box dimension of the functions on the unit interval I=[0,1], which indicates that the upper Box dimension of the integrand f(x) will not be increased by the σ-order (k,s)-Riemann-Liouville fractional integral ksD−σf(x) where σ&gt;0 on I. Additionally, we prove that the fractal dimension of ksD−σf(x) of one-dimensional continuous functions f(x) is still one.

In this study, we first discover some new concept coordinated UD-convex mappings with fuzzy-number values. After that, we look into Hermite-Hadamard type inequalities via fuzzy-number-valued coordinated UD-convex fuzzy-number-valued mapping (coordinated UD-convex FNVM). In the case of coordinated UD-convex FNVM, novel conclusions are derived by making particular decisions in recently proven inequalities. Additionally, it is demonstrated that the recently discovered inequalities are expansions of comparable findings in the literature. It is important to note that the main outcomes are validated by nontrivial examples.

In the paper, we develop some numerical schemes including finite difference scheme and finite volume scheme for the fractional Laplacian operator, and apply the resulted numerical schemes to solve some fractional diffusion equations. First, the fractional Laplacian operator can be characterized as the weak singular integral by a integral operator with zero boundary condition. Second, because of the solution of fractional diffusion equation is usually singular near the boundary, we apply finite difference scheme to discrete fractional Laplacian operator and fractional diffusion equation by fractional interpolation function. Moreover, it is find that the differential matrix of the above scheme is symmetric matrix, and strictly row-wise diagonally dominant in special fractional interpolation function. Third, we show finite volume scheme to discrete fractional diffusion equation by fractional interpolation function, and analyze the properties of differential matrix. Finally, the numerical experiments are given, and verify the correctness of theoretical results and the efficiency of the schemes.

Let $m$ and $n$ be the fixed positive integers. Suppose $\mathcal{A}$ is a von Neuman algebra with no central summands of type $I_{1}$ and $L_{m}$ be a Lie type higher derivation i.e., an additive (linear) map $L_{m} :\mathcal{A}\to \mathcal{A}$ such that \begin{equation}\label{def2} \[L_{m}(p_{n}(\mathfrak{S}_{1},\mathfrak{S}_{2},\cdots,\mathfrak{S}_{n}))=\sum_{l_1+l_2+\cdots+l_n=m}p_{n}\big(L_{l_1}(\mathfrak{S}_{1}),L_{l_2}(\mathfrak{S}_{2}),\cdots,L_{l_n}(\mathfrak{S}_{n})\big)\] %L_{m}(p_{n}(\mathfrak{S}_{1},\mathfrak{S}_{2},\cdots,\mathfrak{S}_{n}))=\sum_{l_1+l_2+\cdots+l_n=m}p_{n}\big(L_{l_1}(\mathfrak{S}_{1}),L_{l_2}(\mathfrak{S}_{2}),\cdots,L_{l_n}(\mathfrak{S}_{n})\big)\nonumber \end{equation} for all $\mathfrak{S}_{1},\mathfrak{S}_{2},\cdots,\mathfrak{S}_{n}\in \mathcal{A}$. In the present paper, we study Lie type higher derivations on von Neuman algebras and prove that every additive Lie type higher derivation on $\mathcal{A}$ has a standard form at zero product as well as at projection product. Further, we discuss some more related results.

In this paper, we give the Galois adjunction form of the regular relation, and by using residuated mapping, we find the connection between it and order-generating set. Furthermore, we obtain the equivalent conclusion of "regular". In addition, by using the specialization order of topological space and the lower approximate operator in the rough set, we find a continuous homeomorphic mapping from a regular space to a Alexandrov topological space

The duality is one of the most interesting properties of the Laplace and Fourier transforms associated to the integer order derivative. Here, we will generalize it for fractional derivatives and extend the results to the Mellin, Z and discrete-time Fourier transforms. The scale and nabla derivatives are used.

In this article, an iterative method of two step is proposed for finding all roots simultaneously of polynomial equations. The order of convergence of the proposed algorithm is 2m, by using any iterative scheme of order m. Numerical tests are performed to confirm the theoretical results and to compare the proposed scheme with existing methods for finding all roots simultaneously.

Recently, Li et al [1] investigated the nonlinear Langevin equations existence including two fractional orders with infinite-point boundary conditions. It has shown that the outcomes given it does count on the solution form for which it has boundary values. It means that their solution needs more to be in the final step. In current work, we will have discussion about the existence and uniqueness for the same boundary conditions by investigating the closely explicit solution form that has no boundary values. Numerical example is supported to have more vision to compare the between new and previous results. It turns out that our results are superior.

Based on the definition of double fuzzy relations, two types of new rough set models are constructed, which are multi-granulation double fuzzy rough sets called optimistic and pessimistic multi-granulation double fuzzy rough sets, and some of their properties were studied. In addition, we study the relationship between optimistic and pessimistic multi-granulation double fuzzy rough sets and double fuzzy rough sets.

Matrix-variate Gaussian type or Wishart type distributions in the real domain are widely used in the literature. When the exponential trace has an arbitrary power and when a factor involving a determinant enters into the model or a matrix-variate gamma type or Wishart type model with exponential trace having an arbitrary power, is extremely difficult to handle. Evaluation of the normalizing constant in such a model is the most important part because when studying the properties of such a model, the method used in the evaluation of the normalizing constant will be the relevant steps in all the computations involved. One such model with a factor involving a trace and the exponential trace having an arbitrary power, in the real domain, is known in the literature as Kotz' model. No explicit evaluation of the normalizing constant in the model involving trace with an exponent and determinant with an exponent entering into the model and at the same time the exponential trace having an arbitrary exponent seems to be available in the literature. The normalizing constant widely used in the literature and interpreted as the normalizing constant in the general model and refers to as a Kotz' model does not seem to be correct. Corresponding model in the complex domain, with the correct normalizing constant, does not seem to be available in the literature. One of the main contributions in this paper is the matrix-variate distributions in the complex domain belonging to Gaussian type, gamma type, type-1 and type-2 beta type when the exponential trace has an arbitrary power. All these models are believed to be new. A second main contribution is the explicit evaluation of the the normalizing constants, in the real and complex domains especially in the complex domain, in a matrix-variate model involving a determinant and a trace as multiplicative factors and at the same time the exponential trace having an arbitrary power. Another main contribution is the introduction of matrix-variate models with exponential trace having an arbitrary exponent, in the categories of type-1 beta, type-2 beta and gamma distributions or in the family of Mathai's pathway models [1], both in the real and complex domains. Another new contribution is the logistic-based extensions of models in the real and complex domains with exponential trace having an arbitrary exponent and connecting to extended zeta functions introduced by this author recently. Some properties of such models are indicated but not derived in detail in order to limit the size of the paper. The techniques and steps used at various stages in this paper will be highly useful for people working in multivariate statistical analysis as well as people applying such models in engineering problems, communication theory, quantum physics and related areas, apart from statistical applications.