In 1937,German mathematician L.Collatz proposed a conjeture:for any positive integer,if it is even,divide it by 2;if it is odd,multiply it by 3 and 1 to get an even number;keep going on and on, the final result is 1.This paper gives a sequence classification of odd numbers,and gives 1-1 mapping of odd numbers and odd number sequences,and uses these results to give a proof of this conjecture.

Proof of the Riemann hypothesis is obtained using the properties of the Gamma function, the Bernoulli function, and limitations imposed by the rational relations of the complex roots of the Riemann zeta function, and the rational relations of the complex Gamma functions.

Since 1742, the year in which the Prussian Christian Goldbach wrote a letter to Leonhard Euler with his Conjecture in the weak version, mathematicians have been working on the problem. The tools in number theory become the most sophisticated thanks to the resolution solutions. Euler himself said he was unable to prove it. The weak guess in the modern version states the following: any odd number greater than 5 can be written as the sum of 3 primes. In response to Goldbach's letter, Euler reminded him of a conversation in which he proposed what is now known as Goldbach's strong conjecture: any even number greater than 2 can be written as a sum of 2 prime numbers. The most interesting result came in 2013, with proof of weak version by the Peruvian Mathematician Harald Helfgott, however the strong version remained without a definitive proof. The weak version can be demonstrated without major difficulties and will not be described in this article, as it becomes a corollary of the strong version. Despite the enormous intellectual baggage that great mathematicians have had over the centuries, the Conjecture in question has not been validated or refuted until today.

In this paper, we investigate the recurrence properties of the generalized Tribonacci sequence and present how the generalized Tribonacci sequence at negative indices can be expressed by the sequence itself at positive indices.

We examine the extensions of the basic arithmetical operations of addition and multiplication on the natural numbers into higher-rank hyper-operations also on the natural numbers. We go on to define the concepts of prime and composite numbers under these hyper-operations and derive some results about factorisation, resulting in fundamental theorems analogous to the Fundamental Theorem of Arithmetic.

Motivation by the definition of the type 2 poly-Bernoulli polynomials introduced by Kim-Kim [9], in the present paper, we consider a new class of new generating function for the Fubini polynomials, called the type 2 poly-Fubini polynomials by means of the polyexponential function. Then, we derive some useful relations and properties. We show that the type 2 poly-Fubini polynomials equal a linear combination of the classical of the Fubini polynomials and Stirling numbers of the first kind. In a special case, we give a relation between the type 2 poly-Fubini polynomials and Bernoulli polynomials of order r. Moreover, inspired by the definition of the unipoly-Bernoulli polynomials introduced by Kim-Kim [9]. We introduce the type 2 unipoly-Fubini polynomials by means of unipoly function and give multifarious properties including derivative and integral properties. Furthermore, we provide a correlation between the unipoly-Fubini polynomials and the classical Fubini polynomials.

High-frequency neuroelectric signals like electroencephalography (EEG) or magnetoencephalography (MEG) provide a unique opportunity to infer causal relationships between local activity of brain areas. While causal inference is commonly performed through Classical Granger causality (GC) based on multivariate autoregressive models, this method may encounter important limitations (e.g. data paucity) in the case of high dimensional data from densely connected systems like the brain. Additionally, physiological signals often present long-range dependencies which commonly require high autoregressive model orders / number of parameters. We present a generalization of autoregressive models for GC estimation based on Wiener-Volterra decompositions with Laguerre polynomials as basis functions. In this basis, the introduction of only one additional global parameter allows to capture arbitrary long dependencies without increasing model order, hence retaining model simplicity, linearity and ease of parameters estimation. We validate our method in synthetic data generated from families of complex, densely connected networks and demonstrate superior performance as compared to classical GC. Additionally, we apply our framework to studying the directed human brain connectome through MEG data from 89 subjects drawn from the Human Connectome Project (HCP) database, showing that it is able to reproduce current knowledge as well as to uncover previously unknown directed influences between cortical and limbic brain regions.

The present work is focused on the numerical solution of the complete energy equation used in fluid film lubrication. The work was motivated by the fact the complete energy equation has no analytic solution that could be used for validations. Its accuracy and computation time are related to the employed numerical method and to the grid resolution. The natural discretization method (NDM) applied on different grids is systematically compared with the spectral method (the Lobatto Point Colocation Method or LPCM) with different polynomial degrees. A one dimensional inclined slider is used for the numerical tests and the energy equation is artificially decoupled from Reynolds. This approach enables to focus all the attention on the numerical solution of the energy equation. The results show that the LPCM is one or two orders of magnitudes more efficient than the NDM in terms of computation time. The energy equation is then coupled with Reynolds equation in a thermo-hydrodynamic analysis of the same 1D slider; the numerical results confirm again the efficiency of the LPCM. A thermo-hydrodynamic analysis of a two-lobe journal bearing is then presented as a practical application.

The Cochran–Mantel–Haenszel (CMH) methodology is a suite of tests applicable to particular tables of count data. Inference is conditional on the treatment and outcome totals on each stratum being known before sighting the data. The CMH tests are important for analyzing randomised blocks data when the responses are categorical rather than continuous. This overview will first review the traditional CMH tests and then explore new alternative presentations of the ordinal CMH tests. Next the ordinal CMH tests will be extended so they can be used to test for higher moment effects. Finally unconditional analogues of the extended CMH tests will be developed.

In this paper, we have established some new bounds of Fejér type Hermite-Hadamard inequality for k−fractional integrals involving r−times differentiable preinvex functions. It is noteworthy that in the past there was no weighted version of left and right sides of the Hermite-Hadamard inequality for k-fractional integrals for generalized convex functions available in literature.

This paper studies the goodness of fit test for the bivariate Hermite distribution. Specifically, we propose and study a Cramér-von Mises-type test based on the empirical probability generation function. The bootstrap can be used to consistently estimate the null distribution of the test statistics. A simulation study investigates the goodness of the bootstrap approach for finite sample sizes.

This work is divided into two parts. In the first one the combinatorics of a new class of randomly generated objects, exhibiting the same properties as the distribution of prime numbers, is solved and the probability distribution of the combinatorial counterpart of the n-th prime number is derived, together with an estimate of the prime-counting function π(x). A proposition equivalent to the Prime Number Theorem (PNT) is proved to hold, while the equivalent of the Riemann Hypothesis (RH) is proved to be false with probability 1 (w.p. 1) for this model. Many identities involving Stirling numbers of the second kind and harmonic numbers are found, some of which appear to be new. The second part is dedicated to generalizing the model to investigate the conditions enabling both PNT and RH. A model representing a general class of random integer sequences is found, for which RH holds w.p. 1. The prediction of the number of consecutive prime pairs, as a function of the gap d, is derived from this class of models and the results are in agreement with empirical data for large gaps. A heuristic version of the model, directly related to the sequence of primes, is discussed and new integral lower and upper bounds of π(x) are found.

In this study, we define new classes of convexity called of h-Godunova-Levin and h-Godunova-Levin preinvexity, through which some new inequalities of Hermite-Hadamard type were established. These new classes are the generalisation of several known convexity including the s-convex, P-function, Godunova-Levin. Further, the properties of h-Godunova-Levin function were also discussed. Meanwhile, the applications of h-Godunova-Levin Preinvex function are given

The class of A-stable symmetric one-step Hermite-Obrechkoff (HO) methods introduced in [1] for dealing with Initial Value Problems is analyzed. Such schemes have the peculiarity of admitting a multiple knot spline extension collocating the differential equation at the mesh points. As a new result, it is shown that these maximal order schemes are conjugate symplectic which is a benefit when the methods have to be applied to Hamiltonian problems. Furthermore a new efficient approach for the computation of the spline extension is introduced, adopting the same strategy developed in [2] for the BS linear multistep methods. The performances of the schemes are tested in particular on some Hamiltonian benchmarks and compared with those of the Gauss Runge-Kutta schemes and Euler-Maclaurin formulas of the same order.

The continuing public health issue known as COVID-19 (the 2019 Novel Corona virus infection) has a global emphasis. Despite (or perhaps because of) the fact that there are significant gaps in our understanding of COVID-19 epidemiology, transmission dynamics, research methods, and management breakout poses a new kind of global hazard. The good news is that there is currently enough knowledge about the epidemic process to allow for the creation of mathematical forecasting models. We modify a conventional SEIR epidemic model to the unique dynamic compartments and epidemic features of COVID 19 as it spreads in a population with a diverse age structure. Although many US states and other nations around the world followed lockdown and reopening processes, we perform some analysis on using some techniques of the epidemic course. A new perspective of fractional calculus known as piecewise derivatives of fractional order is used to study the proposed model. Sufficient conditions are established to show the existence theory. In addition, a numerical scheme based on Newton’s polynomials is established to simulate the approximate solutions of the proposed model by using various fractional orders. Some real data results are also shown with comparison of the numerical results.

In this study, we present a numerical method for solving two--dimensional space--time fractional partial differential equations (FPDEs), where the solutions of the FPDEs are expanded in terms of the shifted Chebyshev polynomials. The numerical approximations are evaluated at the Chebyshev-Gauss-Lobatto points. In the case when the FPDE is nonlinear, we employ a Newton-Raphson approach to linearize the equation. Both the linear and nonlinear cases lead to a consistent system of linear algebraic equations. The scheme is tested on selected FPDEs and the numerical results show that the proposed numerical scheme is accurate and computationally efficient in terms of CPU times. To establish the accuracy of the method, we also present an error analysis which shows the convergence of the numerical method. These positive attributes make the proposed method a good approach for solving two--dimensional fractional partial differential equations with both space and time fractional orders.

Dispersion tests based on the second order component of smooth test statistics are related to Fisher’s Index of Dispersion test, used for testing for the Poisson distribution when there are no covariates present. Such tests have been recommended in [1] to test for the Poisson distribution when covariates are present. The modified Borel-Tanner (MBT) distribution seems suited to data with extra zeroes, a monotonic decline in counts and longer tails. Here we recommend a dispersion test for the MBT distribution for both when covariates are absent and when they are present.

In this article, we discuss the concept of infinity (∞), infinitesimals □ , and a new mathematical operation that expands calculations into the realm of the infinite. This breakthrough allows for the computation of infinite numbers, leading to new possibilities for mathematical research and practical applications. By introducing infinite numbers, numerous advantages arise, such as accurately representing limits, divergences in integrals and infinite series, and extending calculations to infinity. This mathematical advancement opens doors to exploring uncharted territories, offering valuable insights and breakthroughs

This paper introduces an innovative Particle Swarm Optimization (PSO) Algorithm in-corporating Sobol and Halton Random number samplings. It evaluates the enhanced PSO's performance against conventional PSO employing Monte Carlo Random Number Samplings. The comparison involves assessing the algorithms across nine benchmark problems and the renowned Travelling Salesman Problem (TSP). The re-sults reveal consistent enhancements achieved by the enhanced PSO utilizing Sob-ol/Halton samplings across the benchmark problems. Particularly noteworthy are the substantial improvements demonstrated by the enhanced PSO in solving the Travel-ling Salesman Problem. These findings underscore the efficacy of employing Sobol and Halton random number generation methods in enhancing algorithm efficiency.

The Collatz conjecture (or 3n+1 problem) has been explored for about 86 years. In this article, we prove the Collatz conjecture. We will show that this conjecture holds for all positive integers by applying the Collatz inverse operation to the numbers that satisfy the rules of the Collatz conjecture. Finally, we will prove that there are no positive integers that do not satisfy this conjecture.

In (Venetz et al., 2019), authors rebuilt the essential genome of Caulobacter crescentus through the process of chemical synthesis rewriting and studied the genetic information content at the level of its essential genes. Then, they reduced the native Caulobacter crescentus native Caulobacter NA1000 genome sequence real genome ( 4042929 bp ) to the 785,701-bp reduced synthetic genome. Here we demonstrate the existence of a palindromic-like mirror structure that exists in real genomes and disappears totally in the synthetic genome. This biomathematic meta-organization is based on characteristic proportions of Fibonacci numbers between DNA single strand nucleotides proportions TC / AG on the one hand and TG / AC on the other hand. In both cases, we suggest that this meta-structure enhances the three-dimensional cohesion of the two DNA strands of the genome. We then generalize this study to the different synthetic genomes and synthetic cells published by the Craig Venter Institute on Mycoplasma Mycoides JCVI-syn1.0 (in 2010), JCVI-syn3.0 (in 2016) and JCVI-syn3A (in 2019). Finally, in the discussion section, we extend this study to synthetic genomes of E-Coli and Yeast chromosome XII.

Prime number-related issues can be viewed from drastically different perspectives by examining the close connections between prime numbers and composite numbers. We think that multiple perspectives are the pillars on the path to solutions so we have created this study. As a result of the study, we proposed two new formulas by presenting three theorems and one proof for each theorem, a total of three proofs. We proved that the formula p · n + p returns a composite number in the first of the theorems, which is the preliminary theorem. Our first theorem except the preliminary theorem is that the formula p · n + p returns all composite numbers, and we proved that too. Finally, we created Theorem II using Theorem I to use in our other work and proved that the formula 2 · n · p + p returns all odd composite numbers, which is Theorem II. Afterward, we presented the similarities of the 2 · n · p + p formula we put forth with another known formula.

Exact sequential state estimation of orbiting objects in space can be found by predicting the state using Fokker Planck Kolmogorov Equation (FPKE) and measurement correction using Bayes’ conditional/posterior Probability Density Function (PDF). Posterior PDF can be expressed as Gaussian density expanded in terms of Hermite polynomials named as Gram Charlier Series (GCS). This research is an extension of an earlier work on second order linearized solution to nonlinear Bayesian filtering using Taylor series and third order GCS expansion of posterior PDF. In this new extension, Bayes’ posterior PDF is approximated by a mixture of GCS functions for which the parameters are propagated using linear propagation theory. The update of weights of different components of GCS mixture model uses the FPKE error as feedback to adapt for the amplitude of different GCS components while solving a quadratic programming problem earlier used for Gaussian Mixture Model (GMM) PDF. Proposed filtering method is applied on tracking of space debris. The simulation results for the filter shows performance is moderately better than single GCS filter, Extended Kalman Filter (EKF) and Gaussian Sum Filter (GSF) under space debris’ highly uncertain initial conditions and sparse measurement availability.

This paper presents the symmetries of differential equations associated with one-variable and Bivariate Hermite polynomials by proposing a representation of Lie algebra for these differential operators. Applying the Baker-Campbell-Hausdorff formula to these algebras, results in new relations and generating functions in one-variable and Bivariate Hermite polynomials. A general form of representation for other orthogonal polynomials such as Laguerre polynomials is introduced.

In this paper, we give all non splitting bi-unitary superperfect polynomials divisible by one or two irreducible polynomials over the prime field of two elements. We prove the nonexistence of odd bi-unitary superperfect polynomials over F2.

Using an algebraic method for solving the wave equation in quantum mechanics, we encountered a new class of orthogonal polynomials on the real line. One of these is a four-parameter polynomial with a discrete spectrum. Another that appeared while solving a Heun-type equation has a mix of continuous and discrete spectra. Based on these results and on our recent study of the solution space of an ordinary differential equation of the second kind with four singular points, we introduce a modification of the hypergeometric polynomials in the Askey scheme. Up to now, all of these polynomials are defined only by their three-term recursion relations and initial values. However, their other properties like the weight function, generating function, orthogonality, Rodrigues-type formula, etc. are yet to be derived analytically. This is an open problem in orthogonal polynomials.

One of the most important unresolved mysteries in mathematics is the Riemann Hypothesis, which suggests a fundamental connection between the non-trivial zeros of the Riemann zeta function and the distribution of prime numbers. Here, we explore the fascinating union of trigonometric functions, prime numbers, and the Riemann zeta function through an examination of the zeros in the statement ln(sec(π·n log(n))). We demonstrate a strong mathematical connection between these components, providing information on the mysterious properties of prime numbers and their complex relationships to basic mathematical operations. Our thorough investigation adds to the current discussion of the Riemann Hypothesis by offering possible solutions and deepening our comprehension of the intricate relationship between number theory and analytic functions.

The Collatz conjecture is a well-known number theory puzzle that states that every positive integer would eventually converge to the trivial cycle of 1, 2, 1, 2,... when repeatedly exposed to a particular transformation. In this transformation, even numbers are divided in half, odd numbers are tripled, and one is added. In this study, we present a new method for creating a directed graph and using it to display and analyze Collatz sequences. Our technique creates what we call a Collatz directed graph by joining an endless number of simple directed graphs, each of which corresponds to a natural number. We show by careful mathematical analysis that all positive integers are included in this Collatz directed graph. Moreover, we give an evidence that verifies the Collatz conjecture by showing that the sole cycle in this graph is the trivial cycle of 1, 2, 1, 2,... We also prove that there is no sequence that diverges to infinity in this graph. Our results provide insights into the fundamental structure of Collatz sequences and further our knowledge of the Collatz conjecture .

In this study, I examined the Beals conjecture on the basis of formulas that produce composite numbers, and I developed some other conjectures that, if answered, would be an answer to the Beals conjecture. Apart from this, I have examined the Beals conjecture from another perspective and posed The Germany Problem.

Accelerators play a critical role in fostering innovative ecosystems and nurturing startups. The evaluation and selection of startups, particularly technology-based startups, for acceleration programs are essential in accelerator economy and management. Assessment of startups requires consideration of numerical and qualitative criteria such as sales, prior startup experience, demand validation, and product maturity. Startups must be ranked based on the varying importance of criteria, which can be identified as a fuzzy multi-criteria decision-making (MCDM) problem. MCDM methods have proven effective in managing complex problems. However, the use of MCDM techniques in startup selection and evaluation of criteria interrelationships from the accelerator perspective is yet to be researched. This study proposes a hybrid DEMATEL-ANP-based fuzzy PROMETHEE II model to rank startups and examine the interrelationships between factors. The final preference values are fuzzy numbers, making a fuzzy ranking method necessary for decision-making. An extension of ranking fuzzy numbers using a spread area-based relative maximizing and minimizing set is suggested to improve the flexibility of existing ranking MCDM methods. Algorithms and formulas are derived and a comparison demonstrates the merits of the proposed method. Finally, a numerical experiment is designed to address the viability of the hybrid DEMATEL-ANP-based fuzzy PROMETHEE II model.

Let's define $\delta(x) = (\sum_{{q\leq x}}{\frac{1}{q}}-\log \log x-B)$, where $B \approx 0.2614972128$ is the Meissel-Mertens constant. The Robin theorem states that $\delta(x)$ changes sign infinitely often. Let's also define $S(x) = \theta(x) - x$, where $\theta(x)$ is the Chebyshev function. It is known that $S(x)$ changes sign infinitely often. We define the another function $\varpi(x) = \left(\sum_{{q\leq x}}{\frac{1}{q}}-\log \log \theta(x)-B \right)$. We prove that when the inequality $\varpi(x) \leq 0$ is satisfied for some number $x \geq 3$, then the Riemann hypothesis should be false. The Riemann hypothesis is also false when the inequalities $\delta(x) \leq 0$ and $S(x)\geq 0$ are satisfied for some number $x \geq 3$ or when $\frac{3 \times \log x + 5}{8 \times \pi \times \sqrt{x} + 1.2 \times \log x + 2} + \frac{\log x}{\log \theta(x)} \leq 1$ is satisfied for some number $x \geq 13.1$.

Robin criterion states that the Riemann Hypothesis is true if and only if the inequality $\sigma(n) < e^{\gamma } \times n \times \log \log n$ holds for all natural numbers $n > 5040$, where $\sigma(n)$ is the sum-of-divisors function and $\gamma \approx 0.57721$ is the Euler-Mascheroni constant. Let $q_{1} = 2, q_{2} = 3, \ldots, q_{m}$ denote the first $m$ consecutive primes, then an integer of the form $\prod_{i=1}^{m} q_{i}^{a_{i}}$ with $a_{1} \geq a_{2} \geq \cdots \geq a_{m} \geq 0$ is called an Hardy-Ramanujan integer. If the Riemann Hypothesis is false, then there are infinitely many Hardy-Ramanujan integers $n > 5040$ such that Robin inequality does not hold and $n < (4.48311)^{m} \times N_{m}$, where $N_{m} = \prod_{i = 1}^{m} q_{i}$ is the primorial number of order $m$.

Analysis of plesiosaur swim dynamics by means of a digital 3D armature (wireframe “skeleton”) of a pliosauromorph (“Ava”) demonstrates that: 1, plesiosaurs used all four flippers for primary propulsion; 2, plesiosaurs utilized all four flippers simultaneously; 3, respective pairs of flippers of Plesiosauridae, front and rear, traveled through distinctive, separate planes of motion, and; 4, the ability to utilize all four paddles simultaneously allowed these largely predatory marine reptiles to achieve a significant increase in acceleration and speed, which, in turn, contributed to their sustained dominance during the Mesozoic.

In this paper, we introduce the generalized Tetranacci quaternions and present some properties of these quaternions.

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, the authors consider the generating functions of the Hermite polynomials and their squares, present explicit formulas for higher order derivatives of the generating functions of the Hermite polynomials and their squares, which can be viewed as ordinary differential equations or derivative polynomials, find differential equations that the generating functions of the Hermite polynomials and their squares satisfy, and derive explicit formulas and recurrence relations for the Hermite polynomials and their squares.

Let {$\Gamma(k)$} denote {$(k-1)!$}, and let {$\Gamma_{n}(k)$} denote {$(k-1)!$}, where {$n \in \{3,\ldots,16\}$} and {$k \in \{2\} \cup [2^{\textstyle 2^{n-3}}+1,\infty) \cap \mathbb N$}. For an integer {$n \in \{3,\ldots,16\}$}, let $\Sigma_n$ denote the following statement: if a system of equations {${\mathcal S} \subseteq \{\Gamma_{n}(x_i)=x_k:~i,k \in \{1,\ldots,n\}\} \cup \{x_i \cdot x_j=x_k:~i,j,k \in \{1,\ldots,n\}\}$} with $\Gamma$ instead of $\Gamma_{n}$ has only finitely many solutions in positive integers {$x_1,\ldots,x_n$}, then every tuple {$(x_1,\ldots,x_n) \in (\mathbb N \setminus \{0\})^n$} that solves the original system ${\mathcal S}$ satisfies {$x_1,\ldots,x_n \leqslant 2^{\textstyle 2^{n-2}}$}. Our hypothesis claims that the statements {$\Sigma_{3},\ldots,\Sigma_{16}$} are true. The statement {$\Sigma_6$} proves the following implication: if the equation {$x(x+1)=y!$} has only finitely many solutions in positive integers $x$ and $y$, then each such solution {$(x,y)$} belongs to the set {$\{(1,2),(2,3)\}$}. The statement {$\Sigma_6$} proves the following implication: if the equation {$x!+1=y^2$} has only finitely many solutions in positive integers $x$ and $y$, then each such solution {$(x,y)$} belongs to the set {$\{(4,5),(5,11),(7,71)\}$}. The statement {$\Sigma_9$} implies the infinitude of primes of the form {$n^2+1$}. The statement {$\Sigma_9$} implies that any prime of the form {$n!+1$} with {$n \geqslant 2^{\textstyle 2^{9-3}}$} proves the infinitude of primes of the form {$n!+1$}. The statement {$\Sigma_{14}$} implies the infinitude of twin primes. The statement {$\Sigma_{16}$} implies the infinitude of Sophie Germain primes.

We consider the second order differential equation y'' + ω^(2)ρ(x)y = 0 where ω is a positive parameter. The principal concern here is to find conditions on the function ρ^(−1/2)(x), which ensure that the consecutive differences of sequences constructed from the zeros of a nontrivial solution of the equation are regular in sign for ω sufficiently large. In particular, if c_(νk)(α) denotes the k-th positive zero of the general Bessel (cylinder) function C_(ν)(x; α) = J_(ν)(x) cos α−Y_(ν)(x) sin α of order ν, and if |ν| < 1/2, we prove that (−1)^(m)∆^(m+2)c_(νk)(α) > 0 (m = 0, 1, 2, ...; k = 1, 2, ...), where ∆a_(k) = a_(k+1) − a_(k). This type of inequalities was conjectured by Lorch and Szego in 1963. We also show that the differences of the zeros of various orthogonal polynomials with higher degrees possess the sign-regularity.

Given a quasi-definite linear functional u in the linear space of polynomials with complex coefficients let us consider the corresponding sequence of monic orthogonal polynomials (SMOP in short) (Pn)n≥0. For the Christoffel transformation u˜=(x−c)u with SMOP (P˜n)n≥0, we are interested to study the relation between u˜ and u(1)˜, where u(1) is the linear functional for the associated orthogonal polynomials of the first kind (Pn(1))n≥0 and u(1)˜=(x−c)u(1) is its Christoffel transformation. This problem is also studied for the Geronimus transformations.

The present paper discusses a study of a class of Charlier matrix polynomials and its generalized analogue. Certain generating matrix functions, recurrence matrix relations, matrix differential equation, summation formulas and many new results have been discussed for these matrix polynomials. Weisner's group theoretic method is used to obtain matrix generating relations for Charlier matrix polynomials and the details of this method were given in this paper. Finally, we will discuss only briefly the procedure followed.

We investigate the value distribution of dierence polynomials of entire and meromorphic functions, which can be viewed as the Hayman's conjecture. And we also study the uniqueness of dierence polynomials sharing a common value.

We developed some questions regarding twin prime conjecture by examining the bounded gaps between composite numbers and explained the relations between the formulas regarding composite numbers. Then we proved the twin prime conjecture to answer the new questions raised by proving the expression: \[ \liminf_{n\to\infty} (c_n_+_1 - c_n) \ge 10. \] In addition, we prove many different approaches have been and it has been proved that there must be a twin prime in the range $(p_k_2\cdot p_k_1, p^2_k_1)$, where $p \neq 2$.

Prime numbers are the atoms of mathematics and mathematics is needed to make sense of the real world. Finding the Prime number structure and eventually being able to crack their code is the ultimate goal in what is called Number Theory. From the evolution of species to cryptography, Nature finds help in Prime numbers. One of the most important advances in the study of Prime numbers was the paper by Bernhard Riemann in November 1859 called “Ueber die Anzahl der Primzahlen unter einer gegebenen Grösse” (On the number of primes less than a given quantity). In that paper, Riemann gave a formula for the number of primes less than x in terms the integral of 1/log(x) and the roots (zeros) of the zeta function defined by: Where ζ(z) is a function of a complex variable z that analytically continues the Dirichlet series. Riemann also formulated a conjecture about the location of the zeros of RZF, which fall into two classes: the "trivial zeros" -2, -4, -6, etc., and those whose real part lies between 0 and 1. Riemann's conjecture Riemann hypothesis [RH] was formulated as this: [RH] The real part of every nontrivial zero z* of the RZF is 1/2. Proving the RH is, as of today, one of the most important problems in mathematics. In this paper we will provide a proof of the RH. The proof of the RH will be built following these five parts: PART 1: Description of the RZF PART 2: The C-transformation PART 3: Application of the C-transformation to in Re(z) 0 to obtain ζ(z)=X(z)-Y(z) PART 4: Analysis of the values of z such that X(z)=Y(z), and |X(z)|=|Y(z)|, that equates to ζ(z)=0 Proof that |X(z)|=|Y(z)| only if Re(z)=1/2 Conclude that ζ(z)=0 only if Re(z)=1/2 for Re(z) 0 PART 5: We will also prove that all non-trivial zeros of ζ(z) in the critical line of the form are not distributed randomly. There is a relationship between the values of those zeros and the Harmonic function that leads to an algebraic relationship between any two zeros.

In this study, a simple approach to solving the Riemann Hypothesis, one of the most prominent unsolved problems in the field of Number Theory in mathematics and one of the “Millenium Prize Problems”, is presented. The Riemann Hypothesis, a conjecture about distribution of prime numbers, has remained unsolved since it was first proposed by German mathematician, Bernhard Riemann in 1859. This paper introduces an analytic continuation of the Zeta Function as well as symmetric approach through integration by parts to address this hypothesis. The proposed solution is obtained through analytical continuation in the critical strip 0<Re(s)<1 to establish that Re(s)=1/2.

In this paper we deal with the resolution of a fuzzy multiobjective programming problem using the level sets optimization. We compare it to other optimization strategies studied until now and we propose an algorithm to identify possible Pareto efficient optimal solutions.

For each non-prime odd number as F=pq , if we consider m/n as an approximation for q/p and choose k=mn , then by proving some lemmas and theorems, we can compute the values of m and n. Finally, by using Fermat’s factorization method for F and 4kF as difference of two non-consecutive natural numbers, we should be able to find the values of p and q. Then we introduce two new and powerful sieves for separating composite numbers from prime numbers.

Let $S=\left(s_1, \ldots, s_n\right)$ be a finite sequence of integers. Then $S$ is a Gilbreath sequence of length $n$, $S\in\mathbb{G}_n$, iff $s_1$ is even or odd and $s_2, \ldots, s_n$ are respectively odd or even and $\min\mathbb{K}_{\left(s_1, \ldots, s_m\right)}\leq s_{m+1}\leq\max\mathbb{K}_{\left(s_1, \ldots, s_m\right)}\forall m\in\left[\left.1, n\right)\right.$. This, applied to the order sequence of prime number $P$, defines Gilbreath polynomials and two integer sequences A347924 \cite{oeisA347924} and A347925 \cite{oeisA347925} which are used to prove that Gilbreath conjecture $GC$ is implied by $p_n-2^{n-1}\leqslant\mathcal{P}_{n-1}\left(1\right)$ where $\mathcal{P}_{n-1}\left(1\right)$ is the $n-1$-th Gilbreath polynomial at 1.

In this paper, we study the symmetry between the supersingular prime number according to smallest sphenic number. With this symmetry, we show that the elements of sporadic group generates all prime numbers with the order by a simple application.

In this paper, we define Tetranacci and Tetranacci-Lucas matrix sequences and investigate their properties.

In this paper, we introduce the (ρ,q)-analogue of the p-adic factorial function. By utilizing some properties of (ρ,q)-numbers, we obtain several new and interesting identities and formulas. We then construct the p-adic (ρ,q)-gamma function by means of the mentioned factorial function. We investigate several properties and relationships belonging to the foregoing gamma function, some of which are given for the case p = 2. We also derive more representations of the p-adic (ρ,q)-gamma function in general case. Moreover, we consider the p-adic (ρ,q)-Euler constant derived from the derivation of p-adic (ρ,q)-gamma function at x = 1. Furthermore, we provide a limit representation of aforementioned Euler constant based on (ρ,q)-numbers. Finally, we consider (ρ,q)-extension of the p-adic beta function via the p-adic (ρ,q)-gamma function and we then investigate various formulas and identities.

In this paper we discuss a problem of generalization of binomial distributed triangle, that is sequence A287326 in OEIS. The main property of A287326 that it returns a perfect cube n as sum of n-th row terms over k; 0 ≤ k ≤ n−1 or 1 ≤ k ≤ n, by means of its symmetry. In this paper we have derived a similar triangles in order to receive powers m = 5; 7 as row items sum and generalized obtained results in order to receive every odd-powered monomial n^2m+1; m ≥ 0 as sum of row terms of corresponding triangle. In other words, in this manuscript are found and discussed the polynomials D_m(n,k) and U_m(n,k), such that, when being summed up over k in some range with respect to m and n returns the monomial n^2m+1.

Our aim in this paper is to establish some new Hermite-Hadamard- Mercer type integral inequalities by utilizing the fractional proportional-integral operators.For this purpose, Hermite-Hadamard-Mercer inequalities for di¤er- antiable mappings whose derivatives in absolute value are convex.

Collatz conjecture (3x+1 problem) is a natural phenomenon in set theory that may be reconstructed using known combinatorics and order theory. Construction begins by selecting a specific order isomorphism with a bijectional order-embedding. Mapping by 3x+1 induces a unique property to only members of the mapped embedding. Under selective congruence from recursive division by two, that complex controls sequence behavior. This demonstration uses an order isomorphism consisting of two linear orders: the (1) odd positive integers and the always odd (2) Rule 50 Jacobsthal numbers, as the embedding. The argument proceeds by cardinality. When the order isomorphism is mapped under 3x+1, all Rule 50 Jacobsthal numbers are mapped to all the powers of four. This one-to-one correspondence guarantees that every odd integer is assigned to a Rule 50 Jacobsthal number, and subsequently, to a power of four. To align this construction with the conjecture, expand the set to all positive integers by showing that: (1) the powers of four embed the powers of two, in a natural way, and (2) the unique factorization of any positive even integer, not congruent to a power of two, is simply an odd integer, once the factorized power of two is divided out. In other words, if the initial choice for a positive integer is not congruent to a power of two, then recursion continues until a Rule 50 Jacobsthal number (guaranteed by cardinality) is attained. Since this value mapped by 3x+1 is always a power of four, repeated division by two will always send the sequence to one. Because this same process occurs for any choice of positive integer, Collatz conjecture is true.

Level index was introduced in 2017 for rooted trees which is a component of Gini index. In the origin, Gini index is a tool for economical investigations but Balaji and Mahmoud defined the graph theoretical applications of this index for statistical analysis of graphs. Level index is an important component of Gini index. In this paper we define a new graph polynomial which is called level polynomial and calculate the level polynomial of some classes of trees. We obtain some interesting relations between the level polynomials and some integer sequences.

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.

In this work, Gaussian Tribonacci functions are defined and investigated on the set of real numbers $\mathbb{R},$ \textit{i.e}., functions $f_{G}$ $:$ $\mathbb{R}\rightarrow \mathbb{C}$ such that for all $% x\in \mathbb{R},$ $n\in \mathbb{Z},$ $f_{G}(x+n)=f(x+n)+if(x+n-1)$ where $f$ $:$ $\mathbb{R}\rightarrow \mathbb{R}$ is a Tribonacci function which is given as $f(x+3)=f(x+2)+f(x+1)+f(x)$ for all $x\in \mathbb{R}$. Then the concept of Gaussian Tribonacci functions by using the concept of $f$-even and $f$-odd functions is developed. Also, we present linear sum formulas of Gaussian Tribonacci functions. Moreover, it is showed that if $f_{G}$ is a Gaussian Tribonacci function with Tribonacci function $f$, then $% \lim\limits_{x\rightarrow \infty }\frac{f_{G}(x+1)}{f_{G}(x)}=\alpha \ $and\ $\lim\limits_{x\rightarrow \infty }\frac{f_{G}(x)}{f(x)}=\alpha +i,$ where $% \alpha $ is the positive real root of equation $x^{3}-x^{2}-x-1=0$ for which $\alpha >1$. Finally, matrix formulations of Tribonacci functions and Gaussian Tribonacci functions are given. In the literature, there are several studies on the functions of linear recurrent sequences such as Fibonacci functions and Tribonacci functions. However, there are no study on Gaussian functions of linear recurrent sequences such as Gaussian Tribonacci and Gaussian Tetranacci functions and they are waiting for the investigating. We also present linear sum formulas and matrix formulations of Tribonacci functions which have not been studied in the literature.

In this research first, a sequence of properties called delta is assigned to each prime number and then examined. Deltas are only dependent on the distribution of prime numbers, so the results obtained for the delta distribution can be considered as a proxy for the distribution of prime numbers. The first observation was that these properties are not unique and different prime numbers may have the same value of delta of a given order. It was found that a small number of deltas cover a large portion of prime numbers, so by recognizing repetitive deltas, the next prime numbers can be predicted with a certain probability, but the most important observation of this study is the normal distribution of deltas. This research has not tried to justify the obtained observations and instead of answering the questions, it seeks to ask the right question.

Iterations of continuous maps are the simplest models of generic dynamical systems. In particular, circle maps display several key properties of complex dynamics, such as phase-locking and the quasi-periodicity route to chaos. Our work points out that Planck’s constant may be derived from the scaling behavior of circle maps in the asymptotic limit.

In this paper, we generalize Fibonacci quaternion, octonion, sedenion, trigintaduonion, etc. and define Horadam 2^{k}-ions and investigate their properties. Each Horadam (such as Fibonacci, Lucas, Pell) quaternions, octonions and sedenions are Horadam 2^{k}-ions. We also present connection to some earlier works.

Gauss quadrature integral approximation is extended to include integrals with a measure consisting of a continuous as well as a discrete component. That is, we give an approximation for the integral of a function plus its sum over a discrete weighted set.

In this article, the Legendre-Gould Hopper polynomials are combined with Sheffer sequences to introduce certain mixed type special polynomials. Generating functions, differential equations and certain other properties of Legendre-Gould Hopper based Sheffer polynomials are derived. Further, operational and integral representations providing connections between these polynomials and known special polynomials are established. Certain identities and results for some members of these new mixed polynomials are also obtained. Finally, the determinantal definitions of Legendre-Gould Hopper based Sheffer polynomials are also given.

In this paper, we proposed the numerical method called the variational iteration orthogonal collocation method (VIOCM), for the approximate solution of the deadly Corona virus model using Mamadu-Njoseh polynomials as basis functions. The proposed method is an elegant mixture of the variational iteration method (VIM) and the orthogonal collocation method (OCM). It was observed that the proposed method converges rapidly to the exact solution even as N increases. This suggests that the use of orthogonal polynomials as trial functions for the SEIR model is indeed an effective approximant as it produces the analytic solution at just few iterations. Resulting numerical evidences were compared with the standard variational iteration method as available in literature. All computational frameworks were executed with MAPLE software.

I had previously developed an approach called Gocgen approach, which claimed to prove twin prime conjecture. In this paper, I processed the previously developed Gocgen approach with the zeta function and explained the relationship between the zeta function with some formulas to offer another perspective on the zeta function, and also created a new function that explains the Gocgen approach using the zeta function. Understanding the new function created will provide insight into the frequency of prime numbers.

The current research examines the many characteristics of the $\ell_{p}(\widetilde{F}(\widetilde{r},\widetilde{s}))$ $(1\leq p<\infty)$ and $\ell_{\infty}(\widetilde{F}(\widetilde{r},\widetilde{s}))$ spaces which are the generalized forms of those by Candan in 2024 using Fibonacci numbers and two non-zero real numbers in accordance with a predetermined rule, we have made an effort to go through all the characteristics and features which the author of earlier versions thought are the most valuable. This manuscript contains all the information required to describe the matrix class $(\ell_{1},\ell_{p}(\widetilde{F}(\widetilde{r},\widetilde{s})))$ $(1\leq p<\infty)$ which are going to be given in detail in the following sections of the manuscript. We are going to offer estimates for the norms of the bounded linear operators $L_{A}$ formed by those matrix transformations utilizing the Hausdorff measure of non-compactness and identify prerequisites to derive the relevant subclasses of compact matrix operators. When the findings of the current study are compared to those found in the literature, it can be said that the newly found ones are more inclusive and comprehensive.

Several life contingency agreements are based on the assumption that policyholders have impaired life expectancy attributable to factors such as lifestyle, social class, or preexisting health issues. Quantifying two crucial variables, augmented death probabilities and the discount rate of projected cash flows, is essential for pricing such agreements. Information regarding the correct values of these parameters is subject to vagueness and imprecision, which further intensifies if impairments must be considered. This study proposes modelling mortality and interest rates using a generalization of fuzzy numbers (FNs), known as intuitionistic fuzzy numbers (IFNs). Consequently, this paper extends the literature on life contingency pricing with fuzzy parameters, where uncertainty in variables, such as interest rates and death probabilities, is modelled using FNs. While FNs introduce epistemic uncertainty, the use of IFNs adds bipolarity to the analysis by incorporating both positive and negative information regarding actuarial variables. Our analysis focuses on two agreements involving policyholders with impaired life expectancy: determining the annuity payment in a substandard annuity and pricing a life settlement over a whole life insurance policy. In particular, we emphasize modelling interest rates and survival probabilities using triangular intuitionistic fuzzy numbers (TIFNs) owing to their ease of interpretation and implementation.

In the mean-field approximation, the well-known effect of the critical quantum collapse in a 3D gas of particles pulled to the center by potential U(r) = -U_0/(2r^2) is suppressed by repulsive interparticle interactions, which create the otherwise non-existing s-wave ground state. Here, we address excited bound states carrying the angular momentum, with the orbital and magnetic quantum numbers, l and m. They exist above a threshold value of the potential's strength, U_0 > l(l+1). The sectoral, tesseral, and zonal modes, which correspond to m = l, 0 < m < l, and m = 0, respectively, are found in an approximate analytical form for relatively small values of U_0 - l(l + 1). Explicit results are produced for the p- and d-wave states, with l = 1 and 2, respectively. In the general form, the bound states are obtained numerically, confirming the accuracy of the analytical approximation.

To avoid loss of information and incorrect ranking, this paper proposes a method for ranking generalized fuzzy numbers, which guarantees both horizontal and vertical values are important parameters affecting the final ranking score. In this method, the normalized height coefficient is introduced to evaluate the influence of the height of fuzzy numbers on the final ranking score. The higher the normalized height coefficient of a fuzzy number is, the higher its ranking. The left area and the right area are presented to calculate the impact of vertical value on the final ranking score. The left area is considered the benefit area. The right area is considered the cost area. The fuzzy number is preferred if the benefit area is larger and the cost area is smaller. The proposed method can be employed to rank both normal and non-normal fuzzy numbers without normalization or height minimization. Numerical examples and comparison with other methods highlight the feasibility and robustness of the proposed method, which can overcome the shortcomings of some existing methods and can support decision-makers to select the best alternative.

We consider an $N$ fermion system at low temperature $T$ in which we encounter special particle number values $N_m$ exhibiting special traits. These values arise in focusing attention upon the degree of mixture (DM) of the pertinent quantum states. Given the coupling constant of the Hamiltonian, the DMs stay constant for all $N$-values, but experience sudden jumps at the $N_m$. For a quantum state described by the matrix $\rho$, its purity is expressed by $Tr \rho^2$ and then the degree of mixture is given by $1 - Tr \rho^2$, a quantity that coincides with the entropy $S_q$ for $q=2$. Thus, Tsallis entropy of index two faithfully represents the degree of mixing of a state, that is, it measures the extent to which the state departs from maximal purity . Macroscopic manifestations of the degree of mixing can be observed through various physical quantities. Our present study is closely related to properties of many-fermion systemsn that are usually manipulated at zero temperature. Here we wish to study the subject at finite temperature. Gibbs' ensemble is appealed to. Some interesting insights are thereby gained.

Starting with a particle in the cube system, we investigate the exotic possibility that the quantum numbers (n_x,n_y,n_z) satisfy the Markov equation. We find that the proposed particle in the Markov-cube system follows from a non-classical information entropic space by the quantum potential Q. We study the classical correspondents of the proposed particle in the Markov-cube system. According to our proposition, this particle identified by detailed measurements of the confinement particle-energy levels is an artifact or occurs in nature.

Recently, a paper was written to reformulate and strengthen the theory of semi-structured complex numbers H (a new number set invented to enable division by zero). Whilst the paper had profound results, the application of this number set in many areas of engineering and science has not been fully explored. Consequently, the aim of this paper was to establish the number set H as a useful mathematical tool by providing an amalgam of results arising from its application in several areas of engineering and science. In the process, this paper makes four major contributions: these are (1) determining the product of the gradients of a horizontal and vertical line; (2) developing new Euler formulas relating exponential, trigonometric and hyperbolic functions in the 3D semi-structured complex number Euclidean space; (3) establishing semi-structured complex numbers as a better extension of the complex number set than quaternions; (4) resolving singularities that may arise in engineering and science equations (because of division by zero) to develop reasonable conclusions in the absence of experimental data. These results and their applications provide a firm foundation to advance the number set H as a useful mathematical tool.

We consider a new model of a branching random walk on a multidimensional lattice with continuous time and one source of particle reproduction and death, as well as an infinite number of sources in which, in addition to the walk, only absorption of particles can occur. The asymptotic behavior of the integer moments of both the total number of particles and the number of particles at a lattice point is studied depending on the relationship between the model parameters. In the case of the existence of an isolated positive eigenvalue of the evolution operator of the average number of particles, a limit theorem is obtained on the exponential growth of both the total number of particles and the number of particles at a lattice point.

In this paper, the sequential prime numbers are used as variables for the galactic spiral equations which were developed from the ROTASE model. Special spiral patterns are produced when prime numbers are treated with the unit of radian. The special spiral patterns produced with the first 1000 prime numbers have 20 spirals arranged in two groups. The two groups have perfect central symmetry with each other and are separated with two spiral gaps. The special spiral pattern produced with natural numbers from 1 to 7919 shows 6 spirals in the central area and 44 spirals in the outer area. The whole 7919 spiral points can be plotted with either 6-spiral pattern or 44-spiral pattern. For the spirals only produced by the prime numbers in the 6-spiral pattern plotting, the spiral 2 and spiral 3 each has only one spiral point produced by prime number 2 and 3, respectively, all other spiral points produced by other prime numbers are located on the spiral 1 and spiral 5. The special spiral pattern is well explained with careful analysis, it is concluded that all prime numbers greater than 3 must meet one of the equations: P₁ = 1 + 6 * n (n > 0) P₅ = 5 + 6 * n (n ≥ 0) In other words, every prime number greater than 3 is either a P₁ prime number or a P₅ prime number, no exception. Matching one of the equations is a necessary condition for a number to be a prime number, not a sufficient condition. Hope such sufficient condition can be found in the future. The number of P₁ prime numbers roughly equal the number of P₅ prime number in the first 2 billion prime numbers. The galactic spiral equations with golden angle can duplicate Vogel’s result for the simulation of sunflower seed head pattern, and a pinwheel pattern can be produced also with galactic spiral equations and 1 degree more than golden angle.

The energy loss of photons due to the cosmological red shift is interpreted, here, as a periodical process of transferring electromagnetic field energy into the space. The transferred energy portions are independent on photon energy if this transfer occurs with their frequency. The amounts of periodically released energy are so small that the related ultra-long wave length photons have to be understood as perfectly delocalized. Thus, the described point of view bridges the quantum micro cosmos with the macro cosmos. It is proposed to regard this energy exchange as a typical property of universal time arrow and to interpret the “large numbers”, in particular the dimensionless reciprocal of product of Hubbles constant and Planck time as the fundamental parameter describing cosmic evolution.

A teoria diz que o número interage com os espaços com base no significado da matemática, desta forma é possível obter conhecimento numérico. A teoria mostra a possibilidade de usar espaços relacionados entre si para explicar as razões pelas quais dois números pares formam um par, dois números ímpares formam um par, um número par e um ímpar formam um número ímpar, três números ímpares formam um número ímpar, três números pares formam um número ímpar. um par, um ímpar e dois pares formam um ímpar, dois ímpares e um par formam um par.

In this paper, we study a differential operator of parabolic type with a variable and unbounded coefficient, defined on an infinite strip. Sufficient conditions for the existence and compactness of the resolvent are established, and an estimate for the maximum regularity of solutions of the equation Lu=f∈L_2(Ω) is obtained. Two-sided estimates for the distribution function of approximation numbers are obtained. As is known, estimates of approximation numbers show the rate of best approximation of the resolvent of an operator by finite-dimensional operators. The paper proves the assertion about the existence of positive eigenvalues among the eigenvalues of the given operator and finds two-sided estimates for them.

Semi-structured complex numbers H was a number set developed to enable division by zero in ordinary algebraic equations. Its utility has been shown in mathematics and engineering. However, very little has been done to show its usefulness in computer science. Consequently, the aim of this paper was to show the utility of semi-structured complex numbers in computer science by developing a division by zero calculator. First two computer programs were written, one for a standard (STD) calculator and the other for a division by zero (DBZ) calculator. The programs were fed 20000 randomly generated arithmetic equations of varying lengths and the space and time complexity associated with processing these equations were measured and compared to determine the efficiency of each calculator. In the process, three major contributions were made: (1) A representation for semi-structured complex numbers that enables it to be easily used by a computer was developed; (2) It was demonstrated that the DBZ calculator outperforms the STD calculator in terms of efficiency; and, (3) It was shown that the number set H reduced the amount of error handling required to run a computer program. These results provide a firm foundation to advance the number set as a useful tool in computer science.

The Ramanujan primes are the least positive integers Rn having the property that if m ≥ Rn, then π_m − π_(m/2) ≥ n. This document develops several bounds related to the Ramanujan primes, sharpening the currently known results. The theory presented is by no means exhaustive, however it provides insights for future research work. Alternatively, we may say that it is a road map which may be followed to make further discoveries.

This work investigates centered polygonal lacunary functions restricted from the unit disk onto symmetry angle space which is defined by the symmetry angles of a given centered polygonal lacunary function. This restriction allows for one to consider only the p-sequences of the centered polygonal lacunary functions which are bounded, but not convergent, at the natural boundary. The periodicity of the $p$-sequences naturally gives rise to a convergent subsequence, which can be used as a grounds for decomposition of the restricted centered polygonal lacunary functions. A mapping of the unit disk to the sphere allows for the study of the line integrals of restricted centered polygonal that includes analytic progress towards closed form representations. Obvious closures of the domain obtained from the spherical map lead to four distinct topological spaces of the "broom topology'' type.

In this paper, we introduce the bicomplex Tetranacci and Tetranacci-Lucas quaternions. Moreover, we present Binet's formulas, generating functions, and the summation formulas for those bicomplex quaternions.

In this paper, we define new kind of Daehee numbers, the degenerate Daehee numbers of the third kind, using degenerate log function as generating function. We obtain some identities for the degenerate Daehee numbers of the third kind associated with the Daehee, degenerate Daehee and degenerate Daehee numbers of the second kind. In addition, we derive a differential equation associated with the degenerate log function. We deduce some identities from the differential equation.

Hamacher operation which is generalization of the Algebraic and Einstein operation, can widely provide a large number of arithmetical operation with respect to uncertainty information, and Heronian mean can deal with correlations of the input arguments or different criteria and don’t make calculation redundancy, meanwhile, the normal intuitionistic fuzzy numbers (NIFNs) can depict distinctively normal distribution information in practical decision making. In this paper, a multi-criteria group decision-making (MCGDM) problem is researched under the NIFNs environment, and a new MCGDM approach is introduced on the basis of the Hamacher operation. Firstly, according to Hamacher t-conorm and t-norm, some operational laws of NIFNs are presented. Secondly, it is noticed that Heronian mean can’t only once take into account mutual relation between attribute values once, but also consider the correlation between input argument and itself. Therefore, we develop some operators and study their properties in order to aggregate normal intuitionistic fuzzy numbers information, these operators include Hamacher Heronian mean (NIFHHM), Hamacher weighted Heronian mean (NIFHWHM), Hamacher geometric Heronian mean (NIFHGHM) and Hamacher weighted geometric Heronian mean (NIFHWGHM). Furthermore, we apply the proposed operators to the MCGDM problem and present a new method. The main characteristics of this new method involve that: (1) it is suitable to make decision under the normal intuitionistic fuzzy numbers environment and more reliable and reasonable to aggregate the normal distribution information. (2) it utilizes Hamacher operation which can provide more reliable and flexible decision-making results and offer an effective and powerful mathematic tool for the MAGDM under uncertainty. (3) it uses the Heronian mean operator which can considers relationships between the input arguments or the attributes and don’t brings subsequently about redundancy. Lastly, an application is given for showing the feasibility and effectiveness of the presented method in this paper.

The following system of equations {x_1 \cdot x_1=x_2, x_2 \cdot x_2=x_3, 2^{2^{x_1}}=x_3, x_4 \cdot x_5=x_2, x_6 \cdot x_7=x_2} has exactly one solution in ({\mathbb N}\{0,1})^7, namely (2,4,16,2,2,2,2). Hypothesis 1 states that if a system of equations S \subseteq {x_i \cdot x_j=x_k: i,j,k \in {1,...,7}} \cup {2^{2^{x_j}}=x_k: j,k \in {1,...,7}} has at most five equations and at most finitely many solutions in ({\mathbb N}\{0,1})^7, then each such solution (x_1,...,x_7) satisfies x_1,...,x_7 \leq 16. Hypothesis 1 implies that there are infinitely many composite numbers of the form 2^{2^{n}}+1. Hypotheses 2 and 3 are of similar kind. Hypothesis 2 implies that if the equation x!+1=y^2 has at most finitely many solutions in positive integers x and y, then each such solution (x,y) belongs to the set {(4,5),(5,11),(7,71)}. Hypothesis 3 implies that if the equation x(x+1)=y! has at most finitely many solutions in positive integers x and y, then each such solution (x,y) belongs to the set {(1,2),(2,3)}. We describe semi-algorithms sem_j (j=1,2,3) that never terminate. For every j \in {1,2,3}, if Hypothesis j is true, then sem_j endlessly prints consecutive positive integers starting from 1. For every j \in {1,2,3}, if Hypothesis j is false, then sem_j prints a finite number (including zero) of consecutive positive integers starting from 1.

This study presents the solution of the second type of a two-dimensional nonlinear integral equation in Banach space. Also, the existence and uniqueness of this equation’s solution are discussed. We utilize a numerical approach involving hybrid and block-pulse functions to obtain the approximate solution of a two-dimensional nonlinear integral equation. Nonlinear integral equation in two dimensions is reduced numerically to a system of nonlinear algebraic equations that can be solved using numerical methods. This study focuses on showing the convergence analysis for the numerical approach and obtaining an error estimate. Some numerical examples have been provided to demonstrate the approach’s viability and efficacy

The main purpose of this paper is to introduce and investigate degenerate Poisson distrib- ution which is a new extension of the Poisson distribution including the degenerate expo- nential function. We then provide several properties of the degenerate Poisson distribution such as the first and the second raw moments and di¤erence operator property. Moreover, we acquired the skewness and the kurtosis for the degenerate Poisson distribution. We also derive its moment generating function by which we define the degenerate Bell polynomials and give a connection for these polynomials related to the unsigned Stirling numbers of the …rst kind.

In this paper, we mainly show that generalized hyperharmonic number sums with reciprocal binomial coefficients can be expressed in terms of classical (alternating) Euler sums, zeta values and generalized (alternating) harmonic numbers.

We propose a correspondence between partition functions of ideal gases consisting of both bosons and fermions and algebraic bases of supersymmetric polynomials on the Banach space of absolutely summable two-sides sequences ℓ1(Z0). Such an approach allows us to interpret some combinatorial identities for supersymmetric polynomials from a physical point of view. We consider a relation of equivalence on ℓ1(Z0) induced by the supersymmetric polynomials, and semiring algebraic structures on the quotient set with respect to this relation. The quotient set is a natural model for the set of energy levels of a quantum system. We introduce two different topological semiring structures on this set and discuss their possible physical interpretations.

In this paper we investigate analytic automorphisms of complex topological vector spaces and their applications to linear and nonlinear transitive operators. We constructed some examples of polynomial automorphisms which show that a natural analogue of the Jacobian Conjecture for infinite dimensional spaces is not true. Also, we prove that any separable Fréchet space supports a transitive analytic operator which is not a polynomial. We found some connections of analytic automorphisms and algebraic bases of symmetric polynomials and applications to hypercyclisity of composition operators.

In this paper, we introduce two discrete degenerate random variables, namely the degenerate binomial and degenerate Poisson random variables. We deduce the expectations of the degenerate binomial random variables. We compute the generating function of the moments of the degenerate Poisson random variables, which leads us to define the new type degenerate Bell polynomials, and hence obtain explicit expressions for the moments of those random variables in terms of such polynomials. We also get the variances of the degenerate Poisson random variables. Finally, we illustrate two examples of the degenerate Poisson random variables.

The eighty years old empirical Colebrook function widely used as an informal standard for hydraulic resistance relates implicitly the unknown flow friction factor , with the known Reynolds number and the known relative roughness of a pipe inner surface ; . It is based on logarithmic law in the form that captures the unknown flow friction factor in a way from which it cannot be extracted analytically. As an alternative to the explicit approximations or to the iterative procedures that require at least a few evaluations of computationally expensive logarithmic function or non-integer powers, this paper offers an accurate and computationally cheap iterative algorithm based on Padé polynomials with only one -call in total for the whole procedure (expensive -calls are substituted with Padé polynomials in each iteration with the exception of the first). The proposed modification is computationally less demanding compared with the standard approaches of engineering practice, but does not influence the accuracy or the number of iterations required to reach the final balanced solution.

This paper brings to fruition recently found \cite{migdal2023exact} exact reduction of decaying turbulence in the Navier-Stokes equation in $3 + 1$ dimensions to a Number Theory problem of finding the statistical limit of the Euler ensemble. We reformulate the Euler ensemble as a Markov chain and show the equivalence of this formulation to the \textbf{quantum} statistical theory of $N$ fermions on a ring, with an external field related to the random fractions of $\pi$. We find the solution of this system in the turbulent limit $N\to \infty, \nu \to 0$ in terms of a complex trajectory (instanton) providing a saddle point to the path integral over the density of these fermions. This results in an analytic formula for the observable correlation function of vorticity in wavevector space. This is a full solution of decaying turbulence from the first principle without approximations or fitted parameters. The energy spectrum decays as $k^{-\frac{7}{2}}$. We compute resulting integrals in \Mathematica{} and present effective index $n(t) = -t\partial_t \log E $ for the energy decay as a function of time Fig.\ref{fig::NPlot}. The asymptotic value of the effective index in energy decay $n(\infty) = \frac{5}{4}$, but the universal function $n(t)$ is neither constant nor linear.

Recently, a paper was written to establish semi-structured complex numbers ℍ (a new number set invented to enable division by zero) as a useful mathematical tool providing novel results from its application in engineering and science. Whilst the paper was a milestone, the application of this number set to quantum and classical physics had not been fully explored. Consequently, the aim of this research was to use semi-structured complex numbers to develop a new mathematical model for the mass of an object and in course unite classical and quantum physics in a simple yet effective manner. As its major contributions this paper: (1) develops a new mathematical model for the mass of an object called the wave-mass function using De Broglie’s mass and frequency relation and semi-structured complex numbers; (2) uses the new wave-mass function to determine what happens to an object traveling at the speed of light; (3) derives a relation between Schrödinger’s wave function and the new wave-mass function; (4) derives a relation between Einstein’s Field Equation and the new wave-mass function; (5) uses the wave-mass function to combine Einstein’s Field Equation with Schrödinger’s wave function to form a new quantum gravity equation. These results and their applications provide a firm foundation to advance the number set ℍ as a useful mathematical tool.

We have found an infinite dimensional manifold of exact solutions of the Navier-Stokes loop equation for the Wilson loop in decaying Turbulence in arbitrary dimension $d >2$. This solution family is equivalent to a fractal curve in complex space $\mathbb C^d$ with random steps parametrized by $N$ Ising variables $\sigma_i=\pm 1$, in addition to a rational number $\frac{p}{q}$ and an integer winding number $r$, related by $\sum \sigma_i = q r$. This equivalence provides a \textbf{dual} theory describing a strong turbulent phase of the Navier-Stokes flow in $\mathbb R_d$ space as a random geometry in a different space, like ADS/CFT correspondence in gauge theory. From a mathematical point of view, this theory implements a stochastic solution of the unforced Navier-Stokes equations. For a theoretical physicist, this is a \textbf{quantum} statistical system with integer-valued parameters, satisfying some number theory constraints. Its long-range interaction leads to critical phenomena when its size $N \rightarrow \infty$ or its chemical potential $\mu \rightarrow 0$. The system with fixed $N$ has different asymptotics at odd and even $N\rightarrow \infty$, but the limit $\mu \rightarrow 0$ is well defined. The energy dissipation rate is analytically calculated as a function of $\mu$ using methods of number theory. It grows as $\nu/\mu^2$ in the continuum limit $\mu \rightarrow 0$, leading to anomalous dissipation at $\mu \propto \sqrt{\nu} \to 0$. The same method is used to compute all the local vorticity distribution, which has no continuum limit but is renormalizable in the sense that infinities can be absorbed into the redefinition of the parameters. The small perturbation of the fixed manifold satisfies the linear equation we solved in a general form. This perturbation decays as $t^{-\lambda}$, where the anomalous dimensions $\lambda$ satisfy the spectral equation \eqref{spectralEq}. The spectrum becomes a continuum in the statistical limit $N \to \infty$, presumably leading to multifractal phenomena.

Using number theory, a formula is obtained that describes the thermal conductivities of ZrC, UC, UN, ThN, ZrN and Th_xU_1-xN at x = 0.2 and 0.5 with temperature change. This formula contains the atomic numbers of the elements, the thermal conductivities of the individual elements of the substance, and the structural parameter. There is no direct dependence on temperature in the formula, since it is hidden in the thermal conductivities of each element and in the structure parameter. In some temperature ranges, the structural parameter is constant; therefore, the thermal conductivity of some carbides and nitrides is expressed through summing the thermal conductivities of individual elements.

We consider a multitude of topics in mathematics where unification constructions play an important role: the Yang–Baxter equation and its modified version, Euler’s formula for dual numbers, means and their inequalities, topics in differential geometry, etc. It is interesting to observe that the idea of unification (unity and union) is also present in poetry. Moreover, Euler’s identity is a source of inspiration for the post-modern poets.

This paper is a continuation of previous papers on unification theories publishes in AXIOMS. We present results about the (modified) Yang-Baxter equation, Euler’s formula, dual numbers, coalgebra structures, non-associative structures, differential geometry, and (mean) inequalities. We will also attempt to relate our discussion to some Brain Studies and Machine Learnig.

Recent observations of the dark energy density have demonstrated the fine-tuning problem, and the challenges faced by theoretical modeling. In this study, we apply the self-similar symmetry (SSS) model, describing the hierarchical structure of the universe based on the Dirac large numbers hypothesis, to Einstein's cosmological term. We introduce a new similarity dimension, D_B, in the SSS model. Using the D_B SSS model, the cosmological constant Λ is simply expressed as a function of the cosmic microwave background (CMB) temperature. The result shows that both the gravitational constant G and Λ are coupled with the CMB temperature, which simplifies the solution of Einstein's field equations for the variable Λ-G model.

We consider several unification problems in mathematics. We refer to transcendental numbers. Also, we present some ways to unify the main non-associative algebras (Lie algebras and Jordan algebras) and associative algebras.

Sums of M consecutive squared integers (a+i)^2 equaling squared integers (for a<=1, 0<= i<= M-1) yield remarkable regular linear features when plotting values of M in function of a. These features correspond to groupings of pairs of a values for successive same values of M around straight lines of equation mu*M = 2a and are characterized in this paper for rational values of mu.

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.

The aim of this work is to study generalizations of the notion of mean. Kolmogorov proposed a generalization based on an improper integral with a decay rate for the tail probabilities. This weak or Kolmogorov mean relates to the Weak Law of Large Numbers in the same way that the ordinary mean relates to the Strong Law. We propose a further generalization, also based on an improper integral, called the doubly weak mean, applicable to heavy-tailed distributions such as the Cauchy distribution and the other symmetric stable distributions, We also consider generalizations arising from Abel-Feynman type mollifiers that damp the behavior at infinity and alternative formulations of the mean in terms of the cumulative distribution and the characteristic function.