In 1937,German mathematician L.Collatz proposed the following conjeture:for any positive integer,if it is even,divide it by 2,if it is odd,multiply it by 3 and add 1 to get an even number.Continuing with the above rule, the final result will be 1.This paper gives a proof of this conjecture.

The two main strategies used in this study are the binary representation and the decomposition of a natural number into many compound functions of odd function and even function. The Collatz conjecture regarding odd even numbers in number theory can be examined and discussed using them in this way: The sequence created by the finite iterations of the Collatz function becomes the ultimately periodic sequence if any natural number is the beginning value, proving the conjecture that has been held for 85 years.

In this research a neccessary and sufficient condition for the proof of the Binary Goldbach conjecture is established. It is established that the square of all natural numbers greater or equal to 2 have an additive partition equal to the sum of the square of a natural number greater or equal to zero and a Goldbach partition semiprime. All Goldbach partition semiprimes are odd except 4. This finding is in itself proof all composite even numbers have at least Goldbach partition. The result of the proof of the Binary Goldbach conjecture is used to prove the Andrica and Legendre conjectures. The Riemann hypothesis is examined and sources of non trivial zeroes outside the critical strip are discussed. An example example of a non-trivial zero outside the critical strip is given

The primary purpose of this article is to deduce specific order estimates for the \textit{Mertens Function} $M(n)$, which facilitates us to analyze the location of zeros of the \textit{Riemann Zeta function} $\zeta(s)$. The paper also provides a brief overview about the notion of the \textit{Mertens Function} $M(n)$ and \textit{Redheffer Matrices} $\mathbb{A}_{n}$. In addition to learning about various \textit{spectral properties} of $ \mathbb{A}_{n}$, we shall also deduce the relation between these two, which, eventually would lead us to establish a necessary and sufficient condition for the \textit{Riemann Hypothesis} to hold true, as justified by \textit{Redheffer} himself. We shall also observe several numerical evidence as well as theoretical justification behind the falsity of the famous \textit{Mertens Hypothesis}, along with how researchers over the years have approached towards deriving an estimate of the smallest possible natural number $n$ for which the first such violation of the theorem occurs, utilizing numerous conjectures annotating about the order of $M(n)$. Readers who are highly motivated in pursuing research in any of the topics relevent to the contents of this paper will surely find the \texttt{References} section to be extremely resourceful.

In this paper for every number field K generated by a root α of a trinomial x⁷ + ax + b ∈ Z[x] and for every prime integer p, we calculate ν_p(i(K)), the highest power of p dividing the index i(K) of the field K. In particular, we calculate the index i(K). As application, when the index of K is not trivial, then K is not monogenic.

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 this paper, we study semiconic idempotent commutative residuated lattices. After giving some properties of such residuated lattices, we obtain a structure theorem for semiconic idempotent com- mutative residuated lattices. As an application, we make use of the structure theorem to prove that the variety of strongly semiconic idempotent commutative residuated lattices has the amalgamation property.

Using the local bijectivity of Keller maps, we give a proof of two-dimensional Jacobian conjecture.

Throughout this paper, we will establish a comprehensive theoretical foundation and rigorously develop the methodology to investigate the structure of quotient ring S/P under the influence of symmetric generalized n-derivations, where S represents an arbitrary ring, and P signifies a prime ideal of S satisfying certain algebraic identities acting on prime ideal P without relying on the assumption of primeness or semi-primeness of the ring.

We demonstrate a new quantitative method to the sieve of Eratosthenes, which is an alternative to the sieve of Legendre. In this method, every element of a given set is sifted out once only, and therefore, this method is free of the Mobius function and of the parity barrier. Using this method, we prove that every sufficiently large even number is the sum of two primes, and that every even number is the difference of two primes in infinitely many ways.

Starting with a positive odd integer $n$, apply a function $f(n)$ repetitively such that $f(n) = 3n + 1$ if $n \not\equiv 0 (\text{mod}\:2)$ or $f(n) = n/2$ if $n \equiv 0 (\text{mod}\:2)$. Let the sequence of all the odd integers obtained form an orbit $n, f^1(n) , f^2(n), \ldots, f^k(n), f^{k + 1}(n)$. The $k^{th}$ odd integer is written as $f^k(n) = (3^k + \mathbf{B(k)})/2^{\mathbf{z(k)}}$ where $\mathbf{B(k)}$ is the collection of terms without the coefficient $n$. We show that when $1 - \mathbf{B(k)}/(2^{\mathbf{z(k)}} n) \approx 1$, the condition for unbounded orbit is given by OEIS A022921. Further, if there exists at least one orbit for which $f^{k + 1}(n) = n$ when $(k + 1) < 3$, we show that there exists no orbit with $k + 1 > 3$ for which $f^{k + 1}(n) = n$. The final result is that the odd integers that can violate the Collatz conjecture are smaller than 5.

In this paper, a short survey of the existed results concerning the Jacobian Conjecture is first given. Then the 3-fold linear type polynomial map will be analyzed in detail. The expansion of the Jacobian condition is deduced to obtain its equivalent algebraic equations, and the Jacobian condition will be analyzed to derive two coordinate transformations that can maintain the invariance of the Jacobian condition. Finally, it is proved by mathematical induction method that one general chain expression presented in this paper is just the inverse polynomial map of 3-fold linear type polynomial map, i.e. LJC(n,[3]) holds such that the Jacobian Conjecture holds.

Jacobian theta function identities are related to the Addition formula for the Weierstrass 1 Sigma function. In this paper, from the Addition formula for Weierstrass Sigma function, new and 2 simple proofs of four square sums theorem are given. Using the addition formula of the theta func- 3 tions, we also give simple proofs of two square sums and eight square sums theorem.

We establish certain modular equations of degree three based on some results of Ramanujan's theta functions.

We study the divisibility properties of the constant terms of certain meromorphic modular forms for Hecke groups. We relate those properties to those of some sequences that have already appeared in the literature. For possible use in later drafts, we show how to invert the map taking a Laurent series $f(x) = 1/x + \sum_{n=0}^{\infty}a_{n+1} x^n$ to the sequence of constant terms of its positive powers. At the end of the article, we construct from elementary arithmetic functions some meromorphic but not necessarily modular functions and study their constant terms.

A well-known result of Posner’s second theorem states that if the commutator of each element in a prime ring and its image under a nonzero derivation is central, then the ring is commutative. In the present paper, we extend this bluestocking theorem to an arbitrary ring with involution involving prime ideals. Further, apart from proving several other interesting and exciting results, we establish *-version of Vukman’s theorem [48, Theorem 1]. Precisely, we describe the structure of quotient ring A/L, where A is an arbitrary ring and L is a prime ideal of A. Further, by taking advantage of the *-version of Vukman’s theorem, we show that if a 2-trosion free semiprime ring A with involution admits a nonzero *-centralizing derivation, then A contains a nonzero central ideal. This result is in a spirit of the classical result due to Bell and Martindale [19, Theorem 3]. As the applications, we extends and unify several classical theorems proved in [6],[25,[42], and [48] . Finally, we conclude our paper with a direction for further research.

The following is the Collatz Conjecture: Suppose we begin with a positive number, multiply it by 3 and add 1 if it is odd, and divide it by 2 if it is even. Then continue doing this as long as you can. Will it matter where you start, whether you end up at the number 1? The Collatz conjecture has been studied for around 85 years. We transform the Collatz function from decimal to binary, then use the binary string's character to prove the Collatz conjecture. In addition, we use mathematics to give another interpretation to chaos, which is the ultimately periodic positive integer sequence.

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.

Firstly, we present a more explicit formulation of the complete system $D(N)$ of representatives of Manin's symbols over $\mathbb{Q}$, which was initially given by Shimura. Then we establish a bijection between $D(M)\times D(N)$ and $D(MN)$ for $(M,N)=1$, which reveals a recursive structure between Manin's symbols of different levels. Based on Manin's complete system $\Pi (N)$ of representatives of cusps on $X_0(N)$ and Cremona's characterization of the equivalence between cusps, we establish a bijection between a subset $C(N)$ of $D(N)$ and $\Pi (N)$, and then establish a bijection between $C(M)\times C(N)$ and $C(MN)$ for $(M,N)=1$. We also provide a recursive structure for elliptical points on $X_0(N)$. Based on these recursive structures, we obtain recursive algorithms for constructing Manin symbols over $\mathbb{Q}$, cusps and elliptical points on $X_0(N)$. This gives rise to a more efficient algorithms for modular elliptic curve. As direct corollaries of these recursive structures, we present a recursive version of the genus formula and an elementary proof of formulas of the numbers of $D(N)$, cusps and elliptical points on $X_0(N)$.

In this paper we propose the notion of a transposed Poisson superalgebra. We prove that a transposed Poisson superalgebra can be constructed by means of a commutative associative superalgebra and an even degree derivation of this algebra. Making use of this we construct two examples of transposed Poisson superalgebra. One of them is the graded differential algebra of differential forms on a smooth finite dimensional manifold, where we use the Lie derivative as an even degree derivation. The second example is the commutative superalgebra of basic fields of the quantum Yang-Mills theory, where we use the BRST-supersymmetry as an even degree derivation to define a graded Lie bracket. We prove several identities, which hold in a transposed Poisson superalgebra.

This article derives the closed form solution to finding the roots of a quadratic equation in SU3.

Collatz conjecture states that an integer $n$ reduces to $1$ when certain simple operations are applied to it. Mathematically, the Collatz function is written as $f^k(n) = \frac{3^kn + C}{2^{z}}$, where $z, k, C \geq 1$. Suppose the integer $n$ violates Collatz conjecture by reappearing as $2^in$, where $i \geq 1$, then the equation modifies to $n \left(1 - \frac{3^k}{2^{z}2^i}\right) = \frac{C}{2^{z}2^i}$. The article takes an elementary approach to this problem by calculating the bounds on the values of $\frac{C}{2^{z}2^i}$ and $1 - \frac{3^k}{2^{z}2^i}$. Correspondingly, an upper limit on the integer $n$ is placed that can re-appear in the sequence. The integer $n$ lies in the $(-\infty, 5)$ range, and the limit on the number of odd steps is $k < 3$. Finally, it is shown that no integer chain exists that does not lead to 1.

This study focuses on one of the most famous open problems in mathematics, namely the Collatz conjecture. The Collatz conjecture or 3x + 1 Problem is perhaps today's most enigmatic unsolved mathematical problem. It is named after Lothar Collatz, who rst proposed it in 1937. It may be stated as as follow: Take any positive integer n. If n is even then divide it by 2, else do \triple plus one" and get 3n + 1. The conjecture is that this process will eventually reach the number 1, regardless of which positive integer is chosen initially. In this paper, we present a simple proof for the Collatz conjecture.

The basic idea is to expand the completed zeta function $\xi(s)$ in MacLaurin series (infinite polynomial), which can be further expressed as infinite product (Hadamard product) by conjugate complex roots. Finally, the functional equation $\xi(s)=\xi(1-s)$ leads to $(s-\alpha_i)^2 = (1-s-\alpha_i)^2, i \in \mathbb{N}$ with solution $\alpha_i= \frac{1}{2}, i \in \mathbb{N}$, where $\alpha_i$ are the real parts of the zeros of $\xi(s)$, i.e., $s_i =\alpha_i\pm j\beta_i, i\in \mathbb{N}$. Therefore, a proof of the Riemann Hypothesis is achieved.

Given a square matrix $A$, we are able to construct numerous equalities that involve reasonable mixed operations of $A$ and its conjugate transpose $A^{\ast}$, Moore--Penrose inverse $A^{\dag}$, and group inverse $A^{\#}$. Such kind of equalities can be generally represented in the equation form $f(A, \, A^{\ast}, A^{\dag}, A^{\#}) =0$. In this article, the author constructs a series of simple or complicated matrix equalities, as well as matrix rank equalities involving the mixed operations of the four matrices. As applications, we give a sequence of necessary and sufficient conditions for a square matrix to be range-Hermitian.

Build a special identical equation, use its calculation characters to prove and search for solution of any odd converging to 1 equation through (*3+1)/2^k operation, and get a solution for this equation, which is exactly same with that got from calculating directly. Then give a specific example to verify. Thus prove the Collatz Conjecture is true. Furthermore, analysis the even and odd sequences produced by iteration calculation during the procedure of searching for solution, build a weight function model, prove it decrease progressively to 0, build another complement weight function model, prove it increase to its convergence state. Indicate that this kind of iteration calculation has determined direction, and gradually regularly converges.

We approximate the trigonometric function sine and cosine on the interval . This analysis provides two formulas to approximate sine and cosine. At first, we try to derive the formula which involves a square root, and then we derive another formula that does not require any use of a square root. Nevertheless, after deriving the procedure which requires no square root, we further try to increase its accuracy and then derive another formula that approximates trigonometric functions more accurately on the interval [0, pi/2]. So, this analysis provides mainly two types of procedures. One uses square roots, whereas the other does not. We also focus on ensuring the accuracy of these trigonometric functions in the interval [0,pi/2]. This accuracy analysis is portrayed using the graph. This graph shows the difference between the values generated by the functions defined here and the actual value of these functions. So, these graphs also indicate the error of these functions on that interval. Finally, we compare our approximation with the approximation formula of the 7th-century Indian Mathematician Bhaskara I.

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.

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.

The 3x+1 problem asks the following: Suppose we start with a positive integer, and if it is odd then multiply it by 3 and add 1, and if it is even, divide it by 2. Then repeat this process as long as you can. Do you eventually reach the integer 1, no matter what you started with? Collatz conjecture (or 3n+1 problem) has been explored for about 85 years. In this paper, we convert an integer number from decimal to binary number, and convert the Collatz function to binary function, which is multiplication and division of two binary numbers. Finally the iternation of the Collatz function, eventually reach the integer 1, thus we solve the 3x+1 problem completely.

It is a classic topic in algebras to construct and verify equalities that are composed of various algebraic operations of elements and their inverses or generalized inverses. In this note, the author constructs a matrix equality $(AB)^{\dag} = B^{\ast}(A^{\ast}ABB^{\ast})^{\#}A^{\ast}$ (called a mixed reverse-order law), where $A$ and $B$ are two matrices of appropriate sizes, $(\cdot)^{\ast}$, $(\cdot)^{\dag}$, and $(\cdot)^{\#}$ denote the conjugate transpose, the Moore--Penrose inverse, and the group inverse of a matrix, respectively, and shows that the mixed reverse-order law always holds. A list of variation forms of this matrix equality are also given, and necessary and sufficient conditions are obtained for them to hold. Especially, we show a remarkable fact that the two reverse-order laws $(AB)^{\dag} = B^{\dag}A^{\dag}$ and $(A^{\ast}ABB^{\ast})^{\#} = (BB^{\ast})^{\#}(A^{\ast}A)^{\#}$ are equivalent.

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.

In this article, we introduce the concept of soft intervals, soft ordering and sequences of soft real numbers, and some of their structural properties are studied. The notion of soft Lebesgue measure on the soft real numbers has been introduced. Also, a correspondence relationship has been established between the soft Lebesgue measure and the classical Lebesgue measure. Furthermore, we have studied some exciting results and relations between the soft Lebesgue measure and the Lebesgue measure of soft real sets.

The calculation of the exact value of the square root of 2 is requested. In order to obtain its infinite value, A new concept is proposed where the accumulations of the infinitely many of finity is indicated by the change in direction which means that there is a jump from finity to infinity .The meaningless for an infinite number with a decimal point is indicated by this jump because any decimal number only have meanings within a finite range values and there is only an infinite integer quantity that can not be operated by algorithms like operations of multiplication，division,addition, and subtraction . The final result of the change in direction is two quantity where the second quantity and the first quantity extend in parallel line and never intersect and the second quantity represent the size of the first quantity. The first quantity is the infinitely great that can't be talked about anything outside of it and can compress any quantities outside of it to nothing and it is the exact value of the square root of 2 .

In this note we, first, recall that the sets of all representatives of some special ordinary residue classes become $\left( m,n\right) $-rings. Second, we introduce a possible $p$-adic analog of the residue class modulo a $p$-adic integer. Then, we find the relations which determine, when the representatives form a $\left( m,n\right) $-ring. At the very short spacetime scales such rings could lead to new symmetries of modern particle models.

In this paper, we define and investigate modified p-Leonardo, p-Leonardo-Lucas and p-Leonardo sequences as special cases of the generalized Leonardo sequence. We present Binet's formulas, generating functions, Simson formulas, and the summation formulas for these sequences. Moreover, we give some identities and matrices related with these sequences. Furthermore, we show that there are close relations between modified p-Leonardo, p-Leonardo-Lucas, p-Leonardo numbers and Fibonacci, Lucas numbers.

The Goldbach Conjecture, which is frequently termed as “1 + 1”, has been a fascinating goal for many mathematicians over centuries. A Chinese mathematician, Dr. Jingrun Chen, proved 1 + 2, which is a great success and the best result so far achieved. Although there were several attempts proving the conjecture, these attempts are either tediously long, complicated, or logically imperfect, thus not widely accepted. Taking advantage of the periodicity of primes, here the author provides a straight forward rigorous proof for the Conjecture.

This paper asserts that the falsity of Goldbach Conjecture results in the breakdown of Trichotomy Law. Assuming that Goldbach Conjecture breaks down at an even integer 2n, where n ≥ 3, we note that the differences of 2n with the odd primes in the interval (1, n) are composite integers. We form a product δ of the collection of the least prime factors of these composite integers. We show that for a base case this product breaks Trichotomy Law. With the inductive hypothesis that such is the case with 2n, we prove that for all even integers the breakdown of Goldbach Conjecture entails the breakdown of Trichotomy Law.

Dilation of contractions on Hilbert space and Banach space is classical. Recently, dilations theory has been put in the setting of sets, vector spaces, p-adic Hilbert spaces and modules. In this paper, we derive important dilation results for self-adjoint morphisms on indefinite inner product modules over *-rings of characteristic 2. More precisely, we prove indefinite inner product versions of Halmos dilation, Egervary N-dilation and Sz.-Nagy dilation.

It is well established the complex exponential and logarithm are multivalued functions, both failing to maintain most identities originally valid over the positive integers domain. Moreover the general case of complex logarithm, with a complex base, is hardly mentionned in mathematic litterature. We study the exponentiation and logarithm as binary operations where all operands are complex. In a redefined complex number system using an extension of the C field, hereafter named E, we prove both operations always produce single value results and maintain the validity of identities such as log_u (w v) = log_u (w) + log_u (v) where u, v, w in E. There is a cost as some algebraic properties of the addition and subtraction will be diminished, though remaining valid to a certain extent. In order to handle formulas in a C and E dual number system, we introduce the notion of set precision and set truncation. We show complex numbers as defined in C are insufficiently precise to grasp all subtleties of some complex operations, as a result multivaluation, identity failures and, in specific cases, wrong results are obtained when computing exclusively in C. A geometric representation of the new complex number system is proposed, in which the complex plane appears as an orthogonal projection, and where the complex logarithm and exponentiation can be simply represented. Finally we attempt an algebraic formalization of E.

We propose Reduced Collatz Conjecture that is equivalent to Collatz Conjecture, which states that every positive integer can return to an integer less than it, instead of 1. Reduced Collatz Conjecture should be easier because some properties are presented in reduced dynamics, rather than in original dynamics (e.g., ratio and period). Reduced dynamics is a computation sequence from starting integer to the first integer less than it, and original dynamics is a computation sequence from starting integer to 1. Reduced dynamics is a component of original dynamics. We denote dynamics of x as a sequence of either computations in terms of ``I'' that represents (3*x+1)/2 and ``O'' that represents x/2. Here 3*x+1 and x/2 are combined together, because 3*x+1 is always even and followed by x/2. We formally prove that all positive integers are partitioned into two halves and either presents ``I'' or ``O'' in next ongoing computation. More specifically, (1) if any positive integer x that is i module $2^t$ (i is an odd integer) is given, then the first t computations (each one is either ``I'' or ``O'' corresponding to whether current integer is odd or even) will be identical with that of i. (2) If current integer after t computations (in terms of ``I'' or ``O'') is less than x, then reduced dynamics of x is available. Otherwise, the residue class of x (namely, i module $2^t$) can be partitioned into two halves (namely, i module $2^{t+1}$ and $i+2^t$ module $2^{t+1}$), and either half presents ``I'' or ``O'' in intermediately forthcoming (t+1)-th computation.

We evaluate the nested sum $\sum_{a_{n - 1} = c}^{a_n } {\sum_{a_{n - 2} = c}^{a_{n - 1} } { \cdots \sum_{a_0 = c}^{a_1 } {x^{a_0 } } } }$ where $a_n$ and $c$ are any integers and $x$ is a real or complex variable. Consequently, we evaluate multiple sums involving the terms of a general second order sequence, the Horadam sequence (W_j (a, b; p, q)), defined for all non-negative integers j by the recurrence relation W₀ = a, W₁ = b; W_j = pW_j−1 − qW_j−2 (j≥2); where a, b, p and q are arbitrary complex numbers, with p ≠ 0, q ≠ 0.

The previous two parts of the paper (correspondingly, https://philpapers.org/rec/PENFLT-2 and https://philpapers.org/rec/PENFLT-3) demonstrate that the interpretation of Fermat’s last theorem (FLT) in Hilbert arithmetic meant both in a narrow sense and in a wide sense can suggest a proof by induction in Part I and by means of the Kochen - Specker theorem in Part II. The same interpretation can serve also for a proof FLT based on Gleason’s theorem and partly similar to that in Part II. The concept of (probabilistic) measure of a subspace of Hilbert space and especially its uniqueness can be unambiguously linked to that of partial algebra or incommensurability, or interpreted as a relation of the two dual branches of Hilbert arithmetic in a wide sense. The investigation of the last relation allows for FLT and Gleason’s theorem to be equated in a sense, as two dual counterparts, and the former to be inferred from the latter, as well as vice versa under an additional condition relevant to the Gödel incompleteness of arithmetic to set theory. The qubit Hilbert space itself in turn can be interpreted by the unity of FLT and Gleason’s theorem. The proof of such a fundamental result in number theory as FLT by means of Hilbert arithmetic in a wide sense can be generalized to an idea about “quantum number theory”. It is able to research mathematically the origin of Peano arithmetic from Hilbert arithmetic by mediation of the “nonstandard bijection” and its two dual branches inherently linking it to information theory. Then, infinitesimal analysis and its revolutionary application to physics can be also re-realized in that wider context, for example, as an exploration of the way for physical quantity of time (respectively, for time derivative in any temporal process considered in physics) to appear at all. Finally, the result admits a philosophical reflection of how any hierarchy arises or changes itself only thanks to its dual and idempotent counterpart.

One of matrix equalities composed of multiple products of matrices and their generalized inverses is given by $A_1B_1^{-}A_2B_2^{-} \cdots A_kB_k^{-}A_{k+1}= A$ where $A_1$, $B_1$, $A_2$, $B_2$, $\ldots$, $A_k$, $B_k$, $A_{k+1}$, and $A$ are given matrices of appropriate sizes, and $B_1^{-}$, $B_2^{-}$, $\cdots$, $B_k^{-}$ are generalized inverses of matrices. The cases for $k = 1, 2$ and their special forms were properly approached in the theory of generalized inverses of matrices. In this note, the author presents an algebraic procedure to derive explicit necessary and sufficient conditions for the equality with $k = 3$ to always hold using certain rank equalities for the block matrices constructed by the given matrices, and then mention a key step of extending the previous work to a general situation.

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.

In this paper, we examine the weak abc conjecture and the strong abc conjecture using some functions. we attempt to discuss the possibilty that the negative consequence of the weak abc conjecture. Namely, we derive that the weak abc conjecture is not true. Additionally, we show that the strong abc conjecture is not true.

The paper is a continuation of another paper (https://philpapers.org/rec/PENFLT-2) published as Part I. Now, the case of “n=3” is inferred as a corollary from the Kochen and Specker theorem (1967): the eventual solutions of Fermat’s equation for “n=3” would correspond to an admissible disjunctive division of qubit into two absolutely independent parts therefore versus the contextuality of any qubit, implied by the Kochen – Specker theorem. Incommensurability (implied by the absence of hidden variables) is considered as dual to quantum contextuality. The relevant mathematical structure is Hilbert arithmetic in a wide sense (https://dx.doi.org/10.2139/ssrn.3656179), in the framework of which Hilbert arithmetic in a narrow sense and the qubit Hilbert space are dual to each other. A few cases involving set theory are possible: (1) only within the case “n=3” and implicitly, within any next level of “n” in Fermat’s equation; (2) the identification of the case “n=3” and the general case utilizing the axiom of choice rather than the axiom of induction. If the former is the case, the application of set theory and arithmetic can remain disjunctively divided: set theory, “locally”, within any level; and arithmetic, “globally”, to all levels. If the latter is the case, the proof is thoroughly within set theory. Thus, the relevance of Yablo’s paradox to the statement of Fermat’s last theorem is avoided in both cases. The idea of “arithmetic mechanics” is sketched: it might deduce the basic physical dimensions of mechanics (mass, time, distance) from the axioms of arithmetic after a relevant generalization, Furthermore, a future Part III of the paper is suggested: FLT by mediation of Hilbert arithmetic in a wide sense can be considered as another expression of Gleason’s theorem in quantum mechanics: the exclusions about (n = 1, 2) in both theorems as well as the validity for all the rest values of “n” can be unified after the theory of quantum information. The availability (respectively, non-availability) of solutions of Fermat’s equation can be proved as equivalent to the non-availability (respectively, availability) of a single probabilistic measure as to Gleason’s theorem.

In this paper, we derive Von Koch's inequality without using the Riemann Hypothesis. As well known, Von Koch's inequality is equivalent to the Riemann Hypothesis. Namely, we show that the Riemann Hypothesis is true. Furthermore, we show that the upper limit of its can be lowered.

In this part of the series of two papers, we extend the theorems discussed in part I for infinite series. We then use these theorems to develop distinct novel results involving the Hurwitz zeta function, Riemann zeta function, Polylogarithm and Fibonacci numbers. In continuation, we obtain some zeros of the newly developed zeta functions and explain their behaviour using plots in complex plane. Furthermore, we provide particular cases for the theorems and corollaries which show that our results generalise the currently available functions and series such as the Riemann zeta function and the geometric series. Finally, we provide four miscellaneous examples to showcase the vast scope of the developed theorems.

In gravitational theory and astrophysical dynamics, singular initial value problems (IVPs) are frequently encountered. Finding the solutions to this class of IVPs can be challenging due to their complex nature. This study strives to circumvent the complexity by proposing a numerical method for solving such problems. The approach proposed in the current research seeks solutions to the IVP by partitioning the domain [0,L] of the problem into two intervals and solving the problem on each domain. The study seeks a closed-form solution to the IVP in the interval containing the singular point. A linearization technique and piecewise partitioning of the domain not containing the singularity are applied to the nonlinear IVP. The resulting linearized differential equation is solved using the Chebyshev spectral collocation method. Some examples are presented to illustrate the efficiency of the proposed method. Numerical analysis of the solution and residual errors are shown to ascertain convergence and accuracy. The results suggest that the technique gives accurate convergent solutions using a few collocation points.

A generalization of the sum of divisors function involves a recursive definition. This leads to variants of superabundant numbers, colossally abundant numbers, and Gronwall's theorem (relevant to the Riemann hypothesis).

In a previous paper (https://dx.doi.org/10.2139/ssrn.3648127 ), an elementary and thoroughly arithmetical proof of Fermat’s last theorem by induction has been demonstrated if the case for “n = 3” is granted as proved only arithmetically (which is a fact a long time ago), furthermore in a way accessible to Fermat himself though without being absolutely and precisely correct. The present paper elucidates the contemporary mathematical background, from which an inductive proof of FLT can be inferred since its proof for the case for “n = 3” has been known for a long time. It needs “Hilbert mathematics”, which is inherently complete unlike the usual “Gödel mathematics”, and based on “Hilbert arithmetic” to generalize Peano arithmetic in a way to unify it with the qubit Hilbert space of quantum information. An “epoché to infinity” (similar to Husserl’s “epoché to reality”) is necessary to map Hilbert arithmetic into Peano arithmetic in order to be relevant to Fermat’s age. Furthermore, the two linked semigroups originating from addition and multiplication and from the Peano axioms in the final analysis can be postulated algebraically as independent of each other in a “Hamilton” modification of arithmetic supposedly equivalent to Peano arithmetic. The inductive proof of FLT can be deduced absolutely precisely in that Hamilton arithmetic and the pransfered as a corollary in the standard Peano arithmetic furthermore in a way accessible in Fermat’s epoch and thus, to himself in principle. A future, second part of the paper is outlined, getting directed to an eventual proof of the case “n=3” based on the qubit Hilbert space and the Kochen-Specker theorem inferable from it.

The 3x+1 problem is a problem of continuous iteration for integers. According to the basic theorem of arithmetic and the way of iteration, we derive a general formula for continuous iteration for odd integers. Through this formula, we can construct a loop iteration equation and obtain the result of the equation: the equation has only one positive integer solution. In addition, this general formula can be converted into a linear indeterminate equation. The process of solving this equation shows that the relationship between the iteration result and the odd number being iterated is linear. Extending this result to all positive even numbers, we get the answer to the 3x + 1 question.

Multi-objective optimization (MOO) is an optimization involving minimization or maximization of several objective functions more than the conventional one objective optimization, which is useful in many fields. Many of the current methodologies addresses challenges and solutions that attempt to solve simultaneously several Objectives with multiple constraints subjoined to each. Often MOO are generally subjected to linear inequality, equality and or bounded constraint that prevent all objectives from being optimized at once. This paper reviews some recent articles in area of MOO and presents deep analysis of Random and Uniform Entry-Exit time of objectives. It further break down process into sub-process and then provide some new concepts for solving problems in MOO, which comes due to periodical objectives that do not stay for the entire duration of process lifetime, unlike permanent objectives which are optimized once for the entire process duration. A methodology based on partial optimization that optimizes each objective iteratively and weight convergence method that optimizes sub-group of objectives are given. Furthermore, another method is introduced which involve objective classification, ranking, estimation and prediction where objectives are classified based on their properties, and ranked using a given criteria and in addition estimated for an optimal weight point (pareto optimal point) if it certifies a coveted optimal weight point. Then finally predicted to find how far it deviates from the estimated optimal weight point. A Sample Mathematical Tri-Objectives and Real world Optimization was analyzed using partial method, ranking and classification method, the result showed that an objective can be added or removed without affecting previous or existing optimal solutions. Therefore suitable for handling time governed MOO. Although this paper presents concepts work only, it’s practical application are beyond the scope of this paper, however base on analysis and examples presented, the concept is worthy of igniting further research and application.

In this paper, we present sums and partial sums of Horadam sequences via generating functions which extends a recent result of Prodinger.

In this paper, we give explicit asymptotic formulas for some sums over primes involving generalized alternating hyperharmonic numbers of types I, II and III. Analogous results for numbers with $k$-prime factors will also be considered.

Integer is either a composite number or a prime number. Therefore, detecting composite numbers is important for solving prime numbers. The study of prime numbers, apart from satisfying human curiosity, can be very important. In this article, the order of composite numbers has been detected. And explained with a simple method and a simple function. And, a method has been developed in which all composite numbers and therefore prime numbers can be determined by using the specified methods, functions and formulas.

Applying a procedure similar to that of E.S. Bring, by using a 4^th degree Tschirnhaus transformation, it was possible to transform the Bring-Jerrard normal quintic (BJQ) equation into a De Moivre form (DMQ), so that it could be solved by radicals. The general solution by radicals of the De Moivre equations of any degree is presented. By the same procedure the BJSx (normal sextic) equation was taken to another one without the 2^nd, 4^th and 6^th terms which was transformed into a cubic (solvable) equation. By applying a 6^th degree Tschirnhaus transformation to the BJSp (normal septic) equation its binormal (without the 2^nd, 3^rd, 4^th and 5^th terms) form was obtained.

In the paper it is demonstrated that a valid path to a contradiction in complex number theory exists. In the path use is made of Euler’s identity and simple trigonometry. Each step can be easily verified.

Locally finiteness of some varieties of nonassociative coalgebras is studied and the Gelfand-Dorfman construction for Novikov coalgebras and the Kantor construction for Jordan super-coalgebras are given. We give examples of a non-locally finite differential coalgebra, Novikov coalgebra, Lie coalgebra, Jordan super-coalgebra, and right-alternative coalgebra. The dual algebra of each of these examples satisfies very strong additional identities. We also constructed examples of an infinite dimensional simple differential coalgebra, Novikov coalgebra, Lie coalgebra, and Jordan super-coalgebra over a field of characteristic zero.

Applying a procedure similar to that of E.S. Bring, by using a 4^th degree Tschirnhaus transformation, it was possible to transform the Bring-Jerrard normal quintic (BJQ) equation into a De Moivre form (DMQ), so that it could be solved by radicals. The general solution by radicals of the De Moivre equations of any degree is presented. By the same procedure the BJSx (normal sextic) equation was taken to another one without the 2^nd, 4^th and 6^th terms which was transformed into a cubic (solvable) equation. By applying a 6^th degree Tschirnhaus transformation to the BJSp (normal septic) equation its binormal (without the 2^nd, 3^rd, 4^th and 5^th terms) form was obtained.

Applying a procedure similar to that of E.S. Bring, by using a 4^th degree Tschirnhaus transformation, it was possible to transform the Bring-Jerrard normal quintic (BJQ) equation into a De Moivre form (DMQ), so that it could be solved by radicals. The general solution by radicals of the De Moivre equations of any degree is presented. By the same procedure the BJSx (normal sextic) equation was taken to another one without the 2^nd, 4^th and 6^th terms which was transformed into a cubic (solvable) equation. By applying a 6^th degree Tschirnhaus transformation to the BJSp (normal septic) equation its binormal (without the 2^nd, 3^rd, 4^th and 5^th terms) form was obtained.

Depression is considered by WHO as the main contributor to global disability and it poses dangerous threats to approximately all aspects of human life, in particular public and private health. This mental disorder is usually characterized by considerable changes in feelings, routines, or thoughts. With respect to the fact that early diagnosis of this illness would be of critical importance ineffective treatment, some development has occurred in the purpose of depression detection. EEG signals reflect the working status of the human brain by which are considered the most proper tools for a depression diagnosis. Deep learning algorithms have the capacity of pattern discovery and extracting features from the raw data which is fed into them. Owing to this significant characteristic of deep learning, recently, these methods have intensely utilized in the diverse field of researches, specifically medicine and healthcare. Thereby, in this article, we aimed to review all papers concentrated on using deep learning to detect or predict depressive subjects with the help of EEG signals as input data. Regarding the adopted search method, we finally evaluated 22 articles between 2016 and 2021. This article which is organized according to the systematic literature review (SLR) method, provides complete summaries of all exploited studies and compares the noticeable aspects of them. Moreover, some statistical analysis performs to gain a depth perception of the general ideas of the latest researches in this area. A pattern of a five-step procedure was also established by which almost all reviewed articles fulfilled the goal of depression detection. Finally, open issues and challenges in this way of depression diagnosis or prediction and suggested works as the future directions discussed.

Let $a, b$ and $n > 1$ be three positive integers such that $a$ and $\sum_{j=0}^{n-1} b^j$ are relatively prime. In this paper, we prove that the toric ideal $I$ associated to the submonoid of $\mathbb{N}$ generated by $\{\sum_{j=0}^{n-1} b^j\} \cup \{\sum_{j=0}^{n-1} b^j + a\, \sum_{j=0}^{i-2} b^j \mid i = 2, \ldots, n\}$ is determinantal. Moreover, we prove that for $n > 3$, the ideal $I$ has a unique minimal system of generators if and only if $a < b-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$.

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$.

In this paper, we investigate the generalized Padovan sequences and we deal with, in detail, four special cases, namely, Padovan, Perrin, Padovan-Perrin and modified Padovan sequences. We present Binet's formulas, generating functions, Simson formulas, and the summation formulas for these sequences. Moreover, we give some identities and matrices related with these sequences.

Let R be a commutative ring with identity and S be a multiplicatively closed subset of R. The purpose of this paper is to introduce the concept of weakly S-primary ideals as a new generalization of weakly primary ideals. An ideal I of R disjoint with S is called a weakly S-primary ideal if there exists s∈S such that whenever 0≠ab∈I for a,b∈R, then sa∈√I or sb∈I. The relationships among S-prime, S-primary, weakly S-primary and S-n-ideals are investigated. For an element r in any general ZPI-ring, the (weakly) S_{r}-primary ideals are charctarized where S={1,r,r²,⋯}. Several properties, characterizations and examples concerning weakly S-primary ideals are presented. The stability of this new concept with respect to various ring-theoretic constructions such as the trivial ring extension and the amalgamation of rings along an ideal are studied. Furthermore, weakly S-decomposable ideals and S-weakly Laskerian rings which are generalizations of S-decomposable ideals and S-Laskerian rings are introduced.

In this note we generalize the regularity concept for semigroups in two ways simultaneously: to higher regularity and to higher arity. We show that the one-relational and multi-relational formulations of higher regularity do not coincide, and each element has several inverses. The higher idempotents are introduced, and their commutation leads to unique inverses in the multi-relational formulation, and then further to the higher inverse semigroups. For polyadic semigroups we introduce several types of higher regularity which satisfy the arity invariance principle as introduced: the expressions should not depend of the numerical arity values, which allows us to provide natural and correct binary limits. In the first definition no idempotents can be defined, analogously to the binary semigroups, and therefore the uniqueness of inverses can be governed by shifts. In the second definition called sandwich higher regularity, we are able to introduce the higher polyadic idempotents, but their commutation does not provide uniqueness of inverses, because of the middle terms in the higher polyadic regularity conditions.

Text summarization remains a challenging task in the Natural Language Processing field despite the plethora of applications in enterprises and daily life. One of the common use cases is the summarization of web pages which has the potential to provide an overview of web pages to devices with limited features. In fact, despite the increasing penetration rate of mobile devices in rural areas, the bulk of those devices offer limited features in addition to the fact that these areas are covered with limited connectivity such as the GSM network. Summarizing web pages into SMS becomes, therefore, an important task to provide information to limited devices. This work introduces WATS-SMS, a T5-based French Wikipedia Abstractive Text Summarizer for SMS. It is built through a transfer learning approach. The T5 English pre-trained model is used to generate a French text summarization model by retraining the model on 25,000 Wikipedia pages then compared with different approaches in the literature. The objective is twofold: (1) to check the assumption made in the literature that abstractive models provide better results compared to extractive ones; and (2) to evaluate the performance of our model compared to other existing abstractive models. A score based on ROUGE metrics gave us a value of 52% for articles with length up to 500 characters against 34.2% for transformer-ED and 12.7% for seq-2seq-attention; and a value of 77% for articles with larger size against 37% for transformers-DMCA. Moreover, an architecture including a software SMS-gateway has been developed to allow owners of mobile devices with limited features to send requests and to receive summaries through the GSM network.

Simple measures often couldn’t count a deep complexity. In the case of semantic complexity, conventional readability formulas share a common style, a common sort of achievements and a common borders of limitation: These formulas lack a semantics-aware approach and as a result, a precise measurement of semantic complexity couldn’t be done. In this paper, we introduce DASTEX, a novel semantics-aware complexity measure for semantic complexity of text. By DASTEX, a new layer of complexity analysis are opened for NLP, cognitive and computational tasks. This measure benefits from an intuitionistic underlying formal model which consider semantic as a lattice of intuitions. This yields to a well-defined definition for semantic of a text and its complexity. DASTEX is a practical analysis method upon this formal model. So a complete suite of idea, model and method are prepared to result in a simple but yet deep measure for semantic complexity of text. The evaluation of the proposed approach is done by 4 Experiments. The results show DASTEX is capable of measuring the semantic complexity of text in 6 application-tasks.

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.

Elliptic scator algebra is possible in 1+n dimensions, n∈N. It is isomorphic to complex algebra in 1+1 dimensions, when the real part and any one hypercomplex component are considered. It is endowed with two representations: an additive one, where the scator components are represented as a sum; and a polar representation, where the scator components are represented as products of exponentials. Within the scator framework, De Moivre’s formula is generalized to 1+n dimensions in the so called victoria equation. This novel formula is then used to obtain compact expressions for the integer powers of scator elements. A scator in S1+n can be factored into a product of n scators that are geometrically represented as its projections onto n two dimensional planes. A geometric interpretation of scator multiplication in terms of rotations with respect to the scalar axis is expounded. The powers of scators, when the ratio of their director components is a rational number, lie on closed curves. For 1+2 dimensional scators, twisted curves in a three dimensional space are obtained. Collecting previous results, it is possible to evaluate the exponential of a scator element in 1+2 dimensions.

Let R be a commutative graded ring with unity, S be a multiplicative subset of homogeneous elements of R and P be a graded ideal of R such that P\bigcap S=\emptyset In this article, we introduce several results concerning graded S-prime ideals. Then we introduce the concept of graded weakly S-prime ideals which is a generalization of graded weakly prime ideals. We say that P is a graded weakly S-prime ideal of R if there exists s\in S such that for all x, y\in h(R), if 0\neq xy\in P, then sx\in P or sy\in P. We show that graded weakly S-prime ideals have many acquaintance properties to these of graded weakly prime ideals.

The Mobius function is commonly used to define Euler's totient function and the Mangoldt function. Similarly, the summatory Mobius function (the Mertens function) can be used to define the summatory totient function and the summatory Mangoldt function (the second Chebyshev function).

While Europe was beginning to deal with the resurgence of COVID-19 due to the Delta variant, the European football championship took place, June 11 - July 11, 2021. We studied the inversion in the decrease/increase rate of new SARS-COV-2 infections in the countries of the tournament, investigating the hypothesis of an association. Using a Bayesian piecewise regression with a Poisson Generalized Linear Model, we looked for a changepoint in the timeseries of the new SARS-COV-2 cases of each country, expecting it to appear not later than two to three weeks after the date of their first match. The two slopes, before and after the changepoint, were used to discuss the reversal from a decreasing to an increasing rate of the infections. For 17 out of 22 countries (77%) the changepoint came on average 14.97 days after their first match [95% CI 12.29 to 17.47]. For all those 17 countries, the changepoint coincides with an inversion from a decreasing to an increasing rate of the infections. Before the changepoint, the new cases were decreasing, halving on average every 18.07 days [95% CI 11.81 to 29.42]. After the changepoint, the cases begin to increase, doubling every 29.10 days [95% CI 14.12 to 49.78]. This inversion in the SARS-COV-2 case rate, happened during the tournament, provides evidence in favor of a relationship

In this paper any superalgebra is generalized to a new form, namely ultra algebra. We study some algebraic structure results for ultra algebras and we have defined some maps on ultra algebras to know ultra derivation and Jordan ultra derivation. Moreover on certain assumptions we have proved that Jordan ultra derivation is an ultra derivation.

In this paper defines the consecutive sum of the digits of a natural number, so far as it becomes less than ten, as an arithmetic function called and then introduces some important properties of this function by proving a few theorems in a way that they can be used as a powerful tool in many cases. As an instance, by introducing a test called test, it has been shown that we are able to examine many algebraic equalities in the form of in which and are arithmetic functions and to easily study many of the algebraic and diophantine equations in the domain of whole numbers. The importance of test for algebraic equalities can be considered equivalent to dimensional equation in physics relations and formulas. Additionally, this arithmetic function can also be useful in factorizing the composite odd numbers.

This article describes an algorithm for estimation the variance of Gaussian noise. The data is smoothed using the Savitsky-Golay polynomial filter. Absolute differences between original and smoothed data are sorted in ascending order. The initial part of this sequence is selected for analysis. The result of calculation mean value of differences can be used to estimate the variance of the noise. By selecting points for analysis, the impact of cosmic ray noise and other artifacts can be reduced. The use of the proposed method for artificial and real spectra shows the ability to effectively estimate the noise variance. The algorithm contains no user-defined parameters.

This paper reports applying Minimax principle and impulsive differential inequality to derive the existence of multiple stationary solutions and the global stability of a positive stationary solution for a delayed feedback Gilpin-Ayala competition model with impulsive disturbance. The conclusion obtained in this paper reduces the conservatism of the algorithm compared with the known literature, for the impulsive disturbance is not limited to impulsive control.

Clustering, or otherwise known as cluster analysis, is a learning problem that takes place without any human supervision. This technique has often been utilized, much efficiently, in data analysis, and serves for observing and identifying interesting, useful, or desired patterns in the said data. The clustering technique functions by performing a structured division of the data involved, in similar objects based on the characteristics that it identifies. This process results in the formation of groups, and each group that is formed, is called a cluster. A single said cluster consists of objects from the data, that have similarities among other objects found in the same cluster, and resemble differences when compared to objects identified from the data that now exist in other clusters. The process of clustering is very significant in various aspects of data analysis, as it determines and presents the intrinsic grouping of objects present in the data, based on their attributes, in a batch of unlabeled raw data. A textbook or otherwise said, good criteria, does not exist in this method of cluster analysis. That is because this process is so different and so customizable for every user, that needs it in his/her various and different needs. There is no outright best clustering algorithm, as it massively depends on the user’s scenario and needs. This paper is intended to compare and study two different clustering algorithms. The algorithms under investigation are k-mean and mean shift. These algorithms are compared according to the following factors: time complexity, training, prediction performance and accuracy of the clustering algorithms.

This paper presents a complete derivation and design of a physics-informed neural network (PINN) applicable to solve initial- and boundary value problems described by linear ordinary differential equations. The objective not to develop a numerical solution procedure which is more accurate and efficient than standard finite element or finite difference based methods, but to give a fully explicit mathematical description of a PINN and to present an application example in the context of hydrodynamic lubrication. It is, however, worth noticing that the PINN developed herein, contrary to FEM and FDM, is a meshless method and that training does not require big data which is typical in machine learning.

This mathematical observation deals with the development of a completely new expression [(S/4D) × √ {(S₁²-D²)(D²-D₁²)}] to calculate the area of a trapezoid system. Because of the difficulties of the previous methods to find out the area of a trapezoid (AOT), the proposed formula has thus indicated the best way to determine the AOT more precisely and easily beyond limitation, successfully. It is obvious that the derived formula is helpful to determine AOT more easily and precisely rather than existing method. And this developed theorem for the trapezoid system is observed for the first time.

Optical motion capture is a mature contemporary technique for the acquisition of motion data, alas it is non-error-free. Due to technical limitations and occlusions of markers, gaps might occur in such recordings. The article reviews various neural network architectures applied for gap filling problem in motion capture sequences within FBM framework providing the representation for body kinematic structure. The results are compared with interpolation and matrix completion methods. We found out, that for longer sequences simple linear feedforward neural networks can outperform the other, sophisticated architectures. We were also able to identify, that acceleration and monotonicity of input sequence are the parameters that have a notable impact on the obtained results.

This paper presents the evaluation of a fungal disease forecast model in vineyards for qualitative parameter analysis using the data from off the shelf sensors, i.e. temperature and air relative humidity, rain precipitation, and leaf wetness. The rules for the fungal disease models are digitalized as a decision support tool that serve as an indicator to farmers for the need of spraying of the chemical substances to ensure the best growing condition and suppress the level of parasites. The temperature and humidity contexts are used interchangeably in practice to detect the risk of the disease occurrence. By taking into account a number of influences on these parameters collected from the shelf sensors, new topics for research in the multidimensional field of precision agriculture emerge. In this study, the impact of the humidity is evaluated by assessing how different humidity parameters correlate with the accuracy of the Botrytis cinerea fungi forecast. Each humidity parameter has it’s own threshold that triggers the second step of the disease modeling - risk index based on the temperature. The research showed that for humidity a low-cost relative humidity sensor can detect in average 14.61% risk values, a leaf wetness sensor an additional 3.99% risk cases, and finally, a precipitation sensor will detect only an additional 0.59% risk cases.

The methods for constructing solutions to integro-differential equations of the Volterra type are considered. The equations are related to fractional conformable derivatives. Explicit solutions of homogeneous and inhomogeneous equations are constructed and a Cauchy-type problem is studied. It should be noted that the considered method is based on the construction of normalized systems of functions with respect to a differential operator of fractional order.

In this paper, the notion of θ∗-weak contraction is introduced, which is utilized to prove some fixed point results. These results are helpful to give a positive response to certain open question raised by Kannan [Amer. Math. Monthly 76:1969] and Rhoades [Contemp. Math. 72:1988] on the existence of contractive definition which does not force the mapping to be continuous at the fixed point. Some illustrative examples are also given to support our results. As applications of our result, we investigate the existence and uniqueness of a solution of non-linear matrix equations and integral equations of Volterra type as well.

Haemodynamic indices are widely used in clinical practice for deciding on a particular type of treatment. Low quality of the CT data and tachycardia complicate interpretation of the measured or simulated values. In this work, we present a novel approach for evaluating resistances in terminal coronary arteries. Using 14 measurements from 10 patients, we show that this algorithm retains the accuracy of 1D haemodynamic simulations in less detailed (truncated) geometric models of coronary networks. We also apply the variable systole fraction model to study the effect of elevated heart rate on the values of FFR, CFR and iFR. We conclude that tachycardia may produce both overestimation or underestimation of coronary stenosis significance.

In the early 1980s it was well established that Leray solutions of the unforced Navier-Stokes equations in Rn decay in energy norm for large time. With the works of T. Miyakawa, M. Schonbek and others it is now known that the energy decay rate cannot in general be any faster than t^-(n+2)/4 and is typically much slower. In contrast, we show in this note that, given an arbitrary Leray solution u(.,t), the difference of any two Stokes approximations to the Navier-Stokes flow u(.,t) will always decay at least as fast as t^-(n+2)/4, no matter how slow the decay of || u(.,t) ||_L2 might happen to be.

Neural decoding from spiking activity is an essential tool for understanding the information encoded in population neurons, especially in applications like brain-computer interface (BCI). Various quantitative methods have been proposed and have shown superiorities under different scenarios respectively. From the machine learning perspective, the decoding task is to map the high-dimensional spatial &amp; temporal neuronal activity to the low-dimensional physical quantities (e.g., velocity, position). Because of the complex interactions and the abundant dynamics among neural circuits, good decoding algorithms usually have the capability of capturing flexible spatiotemporal structures embedded in the input feature space. Recently, the Transformer-based models are widely used in processing natural languages and images due to its superior performances in handling long-range and global dependencies. Hence, in this work we examine the potential applications of Transformers in neural decoding and introduce two Transformer-based models. Besides adapting the Transformer to neuronal data, we also propose a data augmentation method for overcoming the data shortage issue. We test our models on three experimental datasets and their performances are comparable to the previous state-of-the-art (SOTA) RNN-based methods. In addition, Transformer-based models show increased decoding performances when the input sequences are longer, while LSTM-based models deteriorate quickly. Our research suggests that Transformer-based models are important additions to the existing neural decoding solutions, especially for large datasets with long temporal dependencies.

Background: There is little clarity in the application of content related to improper integrals in university students, due to the absence of meaning, which prevents them from making a connection with everyday problem situations. Methods: we designed a mathematical modelling proposal where a specific situation involving the instrumentation, use and application of this type of integrals is experimented and solved with a population of engineering students, who learn to use them. Results: The importance of using mathematical modelling as a didactic-dynamic resource is highlighted because it helps students to reach an understanding of real situations involving improper integrals in different contexts. Conclusions: Despite the numerous errors detected in the students, this strategy made it possible to demonstrate the development of advanced mathematical thinking skills in young people.

The colossal depths of the deep neural network sometimes suffer from ineffective backpropagation of the gradients through all its depths. Whereas, The strong performance of shallower multilayer neural structures prove their ability to increase the gradient signals in the early stages of training which easily gets backpropagated for global loss corrections. Shallow neural structures are always a good starting point for encouraging the sturdy feature characteristics of the input. In this research, a shallow, deep neural structure called PrimeNet is proposed. PrimeNet is aimed to dynamically identify and encourage the quality visual indicators from the input to be used by the subsequent deep network layers and increase the gradient signals in the lower stages of the training pipeline. In addition to this, the layerwise training is performed with the help of locally generated errors which means the gradient is not backpropagated to previous layers, and the hidden layer weights are updated during the forward pass, making this structure a backpropagation free variant. PrimeNet has obtained state-of-the-art results on various image datasets, attaining the dual objective of (1) compact dynamic deep neural structure, which (2) eliminates the problem of backwards-locking. The PrimeNet unit is proposed as an alternative to traditional convolution and dense blocks for faster and memory-efficient training, outperforming previously reported results aimed at adaptive methods for parallel and multilayer deep neural systems.

Background: Zebrafish (Danio rerio) is a model organism emerged for the study of human cancer. Compared with the murine model, the zebrafish model has several properties ideal for personalized therapies. The transparency of the zebrafish embryos and the development of the pigment-deficient “casper” zebrafish line give the capacity to directly observe cancer formation and progression in the living animal. Automatic quantification of cellular proliferation in vivo is critical to the development of personalized medicine. Methods: A new methodology was defined to automatically quantify the cancer cellular evolution. ZFTool was developed to establish a base threshold that eliminates the embryo auto-fluorescence and automatically measures the area and intensity of GFP (green-fluorescent protein) marked cells and define a proliferation index. Results: Proliferation index automatically computed on different targets demonstrates the efficiency of ZFTool to provide a good automatic quantification of cancer cell evolution and dissemination. Conclusion: Our results demonstrate that ZFTool is a reliable tool for the automatic quantification of the proliferation index, being a measure of cancer mass evolution in zebrafish eliminating the influence of its autofluorescence.

Semantic segmentation is a very popular topic in modern computer vision and it has applications to many fields. Researchers proposed a variety of architectures over time, but the most common ones exploit an encoder-decoder structure that aims to capture the semantics of the image and it low level features. The encoder uses convolutional layers, in general with a stride larger than one, to extract the features, while the decoder recreates the image by upsampling an using skip connections with the first layers. In this work, we use DeepLab as architecture to test the effectiveness of creating an ensemble of networks by randomly changing the activation functions inside the network multiple times. We also use different backbone networks in our DeepLab to validate our findings. We manage to reach a dice coefficient of 0.888, and a mean Intersection over Union (mIoU) of 0.825, in the competitive Kvasir-SEG dataset. Results in skin detection also confirm the performance of the proposed ensemble, which is ranked first with respect to other state-of-the-art approaches (including HardNet) in a large set of testing datasets. The developed code will be available at https://github.com/LorisNanni.

Sleep deficiency impacts the quality of life and may have serious health consequences in the long run. Questionnaire-based subjective assessment of sleep deficiency has many limitations. On the other hand, objective assessment of sleep deficiency is challenging. In this study, we propose a polysomnography-based mathematical model for computing baseline sleep deficiency severity score and then investigated the estimation of sleep deficiency severity using features available only from wearable sensor data including heart rate variability and single-channel electroen-cephalography for a dataset of 500 subjects. We used Monte-Carlo Feature Selection (MCFS) and inter-dependency discovery for selecting the best features and removing multi-collinearity. For developing the Regression model we investigated both the frequentist and the Bayesian ap-proaches. An Artificial Neural Network achieved the best performance of RMSE = 5.47 and an R-squared value of 0.67 for sleep deficiency severity estimation. The developed method is com-parable to conventional methods of Functional Outcome of Sleep Questionnaire and Epworth Sleepiness Scale for assessing the impact of sleep apnea on sleep deficiency. Moreover, the results pave the way for reliable and interpretable sleep deficiency severity estimation using a wearable device in Smart Health.

We examine a family of nonlinear q-difference-differential Cauchy problems obtained as a coupling of linear Cauchy problems containing dilation q-difference operators, recently investigated by the author, and quasi-linear Kowalevski type problems that involve contraction q-difference operators. We build up local holomorphic solutions to these problems. Two aspects of these solutions are explored. One facet deals with asymptotic expansions in the complex time variable for which a mixed type Gevrey and q-Gevrey structure is exhibited. The other feature concerns the problem of confluence of these solutions as q tends to 1.

Anonymous communications networks were born to protect the privacy of our communications, preventing censorship and traffic analysis. The most famous anonymous communication network is Tor. This anonymous communication network provides some interesting features, among them, we can mention user’s IP location or Tor Hidden Services (THS) as a mechanism to conceal the location of servers, mainly, web servers. THS is an important research field in Tor. However, there is a lack of reviews that sump up main findings and research challenges. In this article we present a systematic literature review that aims to offer a comprehensive view on the research made on Tor Hidden services presenting the state of the art and the different research challenges to be addressed. This review has been developed from a selection of 57 articles and present main findings and advances regarding Tor Hidden Services, limitations found, and future issues to be investigated.

The spread of the Coronavirus pandemic has been accompanied by an infodemic. The false information that is embedded in the infodemic affects people’s ability to have access to safety information and follow proper procedures to mitigate the risks. This research aims to target the falsehood part of the infodemic, which prominently proliferates in news articles and false medical publications. Here, we present NeoNet, a novel supervised machine learning text mining algorithm that analyzes the content of a document (news article, a medical publication) and assigns a label to it. The algorithm is trained by TFIDF bigram features which contribute a network training model. The algorithm is tested on two different real-world datasets from the CBC news network and Covid-19 publications. In five different fold comparisons, the algorithm predicted a label of an article with a precision of 97-99 %. When compared with prominent algorithms such as Neural Networks, SVM, and Random Forests NeoNet surpassed them. The analysis highlighted the promise of NeoNet in detecting disputed online contents which may contribute negatively to the COVID-19 pandemic.

Fractional differential equations have become a fundamental modelling approach for understanding and simulating the many aspects of nonlocality and spatial heterogeneity of complex materials and systems. Yet, while real-order fractional operators are nowadays widely adopted, little progress has been made in extending such operators to complex-order counterparts. In this work, we introduce new definitions for the complex-order fractional Laplacian, fully consistent with the theory of averaging of smooth functions over fractal sets, and present tailored spectral methods for their numerical treatment. The proposed complex-order operators exhibit a dual particle-wave behaviour, with solutions manifesting wave-like features depending on the magnitude of the imaginary part of the fractional order. Reaction-diffusion systems driven by the complex-order fractional Laplacian exhibit unique spatio-temporal dynamics, such as equilibrium of diffusion in random materials by interference of scattered waves, conduction block and highly fractionated propagation, or the generation of completely novel Turing patterns. Taken together, our results support that the proposed complex-order operators hold unparalleled capabilities to advance the description of multiscale transport phenomena in physical and biological processes highly influenced by the heterogeneity of complex media.

The Unmanned Aerial Vehicles (UAVs), used in civilian applications such as emergency medical deliveries, precision agriculture, wireless communication provisioning, etc., face the challenge of limited flight time due to their reliance on the on-board battery. Therefore, developing efficient mechanisms for in-situ power transfer to recharge UAV batteries hold potential in extending their mission time. In this paper, we study the use of far-field wireless power transfer (WPT) technique from specialized, transmitter UAVs (tUAVs) carrying Multiple Input Multiple Output (MIMO) antennas for transferring wireless power to receiver UAVs (rUAVs) in a mission. The tUAVs can fly and adjust their distance to the rUAVs to maximize energy transfer. The use of MIMO antennas further boost the energy reception by narrowing the energy beam toward the rUAVs. The complexity of their dynamic operating environment increases with the growing number of tUAVs, and rUAVs with varying levels of energy consumption and residual power. We propose an intelligent trajectory selection algorithm for the tUAVs based on a deep reinforcement learning model called Proximal Policy Optimization (PPO) to optimize the energy transfer gain. Simulation results demonstrate that with the use of PPO, the system achieves a tenfold flight time extension compared to no wireless recharging. Further, PPO outperforms the benchmark movement strategies of ’Traveling Salesman Problem’ and ’Low Battery First’ when used by the tUAVs.