This paper describes a polynomial time algorithm for solving graph isomorphism and automorphism. We introduce a new tree data structure called Walk Length Tree. We show that such tree can be both constructed and compared with another in polynomial time. We prove that graph isomorphism and automorphism can be solved in polynomial time using Walk Length Trees.

The independent set, IS, on a graph $G=(V,E)$ is $V^{*}\subseteq V$ such that no two vertices in $V^{*}$ have an edge between them. The MIS problem on G seeks to identify an IS with maximum cardinality, i.e. MIS. $V^{*}\subseteq V$ is a vertex cover, i.e. VC of $G=(V,E)$ if every $e\in E$ is incident upon at least one vertex in $V^{*}$ . $V^{*}\subseteq V$ is dominating set, DS, of $G=(V,E)$ if $\forall v\in V$ either $v\in V^{*}$ or $\exists u\in V^{*}$ and $(u,v)\in E$ . The MVC problem on G seeks to identify a vertex cover with minimum cardinality, i.e. MVC. Likewise, MCV seeks a connected vertex cover, i.e. VC which forms one component in G, with minimum cardinality, i.e. MCV. A connected DS, CDS, is a DS that forms a connected component in G. The problems MDS and MCD seek to identify a DS and a connected DS i.e. CDS respectively with minimum cardinalities. MIS, MVC, MDS, MCV and MCD on a general graph are known to be NP-complete. Polynomial time algorithms are known for bipartite graphs, chordal graphs, cycle graphs, comparability graphs, claw-free graphs, interval graphs and circular arc graphs for some of these problems. We introduce a novel graph class, layered graph, where each layer refers to a subgraph containing at most some k vertices. Inter layer edges are restricted to the vertices in adjacent layers. We show that if $k=\Theta (log\mid V\mid )$ then MIS, MVC and MDS can be computed in polynomial time and if $k=O\left({(log\mid V\mid )}^{\alpha }\right)$ , where $\alpha <1$ , then MCV and MCD can be computed in polynomial time. If $k=\Theta \left({(log\mid V\mid )}^{1+ϵ}\right)$ , for $ϵ>0$ , then MIS, MVC and MDS require quasi-polynomial time. If $k=\Theta (log\mid V\mid )$ then MCV, MCD require quasi-polynomial time. Layered graphs do have constraints such as bipartiteness, planarity and acyclicity.

A transform approach based on a variable initial time (VIT) formulation is developed for discrete-time signals and linear time-varying discrete-time systems or digital filters. The VIT transform is a formal power series in z^(-1) which converts functions given by linear time-varying difference equations into left polynomial fractions with variable coefficients, and with initial conditions incorporated into the framework. It is shown that the transform satisfies a number of properties that are analogous to those of the ordinary z-transform, and that it is possible to do scaling of z^(- i) by time functions which results in left-fraction forms for the transform of a large class of functions including sinusoids with general time-varying amplitudes and frequencies. Using the extended right Euclidean algorithm in a skew polynomial ring with time-varying coefficients, it is shown that a sum of left polynomial fractions can be written as a single fraction, which results in linear time-varying recursions for the inverse transform of the combined fraction. The extraction of a first-order term from a given polynomial fraction is carried out in terms of the evaluation of z^(i) at time functions. In the application to linear time-varying systems, it is proved that the VIT transform of the system output is equal to the product of the VIT transform of the input and the VIT transform of the unit-pulse response function. For systems given by a time-varying moving average or an autoregressive model, the transform framework is used to determine the steady-state output response resulting from various signal inputs such as the step and cosine functions.

M-polynomial of different molecular structures helps to calculate many topological indices. A topological index of graph G is a numerical parameter related to G which characterizes its molecular topology and is usually graph invariant. In the field of quantitative structure-activity (QSAR) quantitative structure-activity structure-property (QSPR) research, theoretical properties of the chemical compounds and their molecular topological indices such as the Zagreb indices, Randic index, Symmetric division index, Harmonic index, Inverse sum index, Augmented Zagreb index, multiple Zagreb indices etc. are correlated. In this report, we compute closed forms of M-polynomial, first Zagreb polynomial and second Zagreb polynomial of Octagonal network. From the M-polynomial we recover some degree-based topological indices for Octagonal network. Moreover, we give a graphical representation of our results.

The synchronous generator, as the main component of power systems, plays a key role in these system’s stability. Therefore, utilizing the most effective control strategy for modeling and control the synchronous generator results in the best outcomes in power systems’ performances. The advantage of using a powerful controller is to have the synchronous generator modeled and controlled as well as its main task i.e. stabilizing power systems. Since the synchronous generator is known as a complicated nonlinear system, modeling and control of it is a difficult task. This paper presents a sum of squares (SOS) approach to modeling and control the synchronous generator using polynomial fuzzy systems. This method as an efficacious control strategy has numerous superiorities to the well-known T–S fuzzy controller, due to the control framework is a polynomial fuzzy model, which is more general and effectual than the well-known T–S fuzzy model. In this case, a polynomial Lyapunov function is used for analyzing the stability of the polynomial fuzzy system. Then, the number of rules in a polynomial fuzzy model is less than in a T-S fuzzy model. Besides, derived stability conditions are represented in terms of the SOS approach, which can be numerically solved via the recently developed SOSTOOLS. This approach avoids the difficulty of solving LMI (Linear Matrix Inequality). The Effectiveness of the proposed control strategy is verified by using the third-part Matlab toolbox, SOSTOOLS.

In the paper, the authors view some ordinary differential equations and their solutions from the angle of (the generalized) derivative polynomials and simplify some known identities for the Bernoulli numbers and polynomials, the Frobenius-Euler polynomials, the Euler numbers and polynomials, in terms of the Stirling numbers of the first and second kinds.

In this note we study the computation of the minimum polynomial of a matrix $A$ and how we can use it for the computation of the matrix $A^n$. We also describe the form of the elements of the matrix $A^{-n}$ and we will see that it is closely related with the computation of the Drazin generalized inverse of $A$. Next we study the computation of the exponential matrix and finally we give a simple proof of the Leverrier - Faddeev algorithm for the computation of the characteristic polynomial.

In the paper, using two inversion theorems for the Stirling numbers and binomial coecients, employing properties of the Bell polynomials of the second kind, and utilizing a higher order derivative formula for the ratio of two dierentiable functions, the authors present two explicit formulas, a determinantal expression, and a recursive relation for a sequence of unnamed polynomials, derive two identities connecting the sequence of unnamed polynomials with the Bell polynomials, and recover a known identity connecting the sequence of unnamed polynomials with the Bell polynomials.

In the paper, the authors establish two identities, which can be regarded as nonlinear differential equations, for the generating function of Eulerian polynomials, find two identities for the Stirling numbers of the second kind, and present two identities for Eulerian polynomials and higher order Eulerian polynomials, pose two open problems about summability of two finite sums involving the Stirling numbers of the second kind. Some of these conclusions meaningfully and significantly simplify several known results.

This article studies electrostatic fields and potentials in the presence of conductors and point charges under the framework of solving Laplace’s equation with specifi ed boundary conditions. The results demonstrate that many problems posed and solved in elementary electrostatics through various heuristics such as the method of images, can be more rigorously treated under the solution framework of Laplace’s equation.

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

The application of graph theory in chemical and molecular structure research far exceeds people's expectations, and it has recently grown exponentially. In the molecular graph, atoms are represented by vertices and bonded by edges. In this report, we study the silicon-carbon Si₂C₃-I[p,q] and Si₂C₃-II[p,q]. We compute several Zagreb polynomials and Redefined Zagreb indices of these silicon-carbons.

In the paper, by virtue of the Faá di Bruno formula and two identities for the Bell polynomial of the second kind, the authors find a closed form for the Stirling polynomials in terms of the Stirling numbers of the first and second kinds.

We classify all the topologically non-equivalent phase portraits of the quadratic polynomial differential system dx/dt = (1-2x)(y-x), dy/dt =y (2-g y-(5g-4)x/(g-1)), in the Poincaré disc for all the values of the parameter g in R\{1}. The differential system dx/dt = y-x, dy/dt =y (2-g y-(5g-4)x/(g-1))/(1-2x), when the parameter g in (1,2] models the structure equations of a static star in general relativity in the case of the existence of a homologous family of solutions, being x = m(r)/r where m(r)>= 0 is the mass inside the sphere of radius r of the star, y = 4pi r^2 rho where rho is the density of the star, and t = ln (r/R) where R is the radius of the star. We classify the possible values of m(r)/r and 4pi r^2 rho when r-->0.

A method for noise reduction of spectra based on fitting a multi-window model is presented. The spectrum is modeled as the sum of the polynomial background and Lorentzian peaks. This model applies to all points in the spectrum and to all window sizes. An iterative algorithm is used for fitting. Based on the initial data, the background calculated by the direct least squares method is subtracted. Positive data values ​​are inverted using the 1/x function and the same procedure is used to fit the Lorentzian peaks. The weighted sum of all windows fit containing the point to be processed is used as the result. The weighting factors are calculated by evaluating the quality of the fit. The performance of the presented method is compared with the Savitsky-Golay method and the wavelet noise reduction method. The proposed approach provides good noise reduction performance without using user-entered parameters.

A method for noise reduction of spectra based on the adaptive application of the Savitsky-Golay polynomial filter is presented. A polynomial approximation is calculated at all points of the spectrum and for all window sizes. The weighted sum of all polynomials containing the point to be processed is used as the result. The weighting factors are calculated by evaluating the quality of the fit. This paper proposes two evaluation functions. The performance of the presented method is compared with the Savitsky-Golay method and the wavelet noise reduction method. The proposed approach provides good noise reduction performance without using user-entered parameters.

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.

The P versus NP problem is a fundamental question in computer science. It asks whether problems whose solutions can be quickly verified can also be quickly solved. Here, "quickly" refers to computational time that grows proportionally to the size of the input (polynomial time). While the problem's roots trace back to a 1955 letter from John Nash, its formalization is attributed to Stephen Cook and Leonid Levin. Despite extensive research, a definitive answer remains elusive. Closely tied to this is the concept of NP-completeness. If a single NP-complete problem could be solved efficiently, it would imply that all problems in NP can be solved efficiently, proving that P equals NP. This work posits that MONOTONE ONE-IN-THREE 3SAT, a notoriously difficult NP-complete problem, can be solved efficiently, thereby establishing the equivalence of P and NP.

In this paper we present two ways to solve the Jacobian conjecture. The first way is an equivalent statement to the Jacobian conjecture using idempotent ideals. The second way is to use an equivalent thesis to the thesis of the Jacobian conjecture. In both cases we will show that the Jacobian conjecture is true.

The inherent non-smoothness of vibroimpact system leads to complex behaviors as well as strong sensitive dependence on parameter changes. Unfortunately, uncertainties and errors in system parameters are inevitable in mechanical engineering. Therefore, the investigations of dynamical behaviors for vibroimpact systems with stochastic parameters are highly essential. The present study aims to analyze the dynamical characteristics of the three-degree-of-freedom vibroimpact system with an uncertain parameter by means of the Chebyshev polynomial approximation method. Specifically, the vibroimpact system model considered is one with unilateral constraint. Firstly, the three-degree-of-freedom vibroimpact system with an uncertain parameter is transformed into an equivalent deterministic form by the Chebyshev orthogonal approximation. Then, the ensemble means responses of the stochastic vibroimpact system are derived. Numerical simulations are performed to verify the effectiveness of the approximation method. Furthermore, the periodic and chaos motions under different system parameters are investigated, and the bifurcations of the vibroimpact system are analyzed by the Poincaré map. The results demonstrate that both the restitution coefficient and the random factor can induce the appearance of the periodic bifurcation. It is worth noting that the bifurcations fundamentally differ between the stochastic and deterministic systems. The former has a bifurcation interval, while the latter occurs at a critical point.

Suppose G is a graph with vertex-orbits O1,1 O2, . . . ,Ot, and jOi j denotes the cardinallity of Oi. Then OG (x) = åt 2 i=1 xjOi j is called as orbit polynomial. It is well-known that this polynomial 3 has a unique positive zero d in the interval [0, 1]. The aim of this paper is to study the specific 4 properties of this polynomial and then we determine the location of this root for several classes of 5 complex networks to compare with other graphical measures. Besides, we compare the unique 6 positive zero measure with several well-known centrality graph measures.

P versus NP is considered as one of the most fundamental open problems in computer science. This consists in knowing the answer of the following question: Is P equal to NP? It was essentially mentioned in 1955 from a letter written by John Nash to the United States National Security Agency. However, a precise statement of the P versus NP problem was introduced independently by Stephen Cook and Leonid Levin. Since that date, all efforts to find a proof for this problem have failed. Another major complexity class is NP-complete. It is well-known that P is equal to NP under the assumption of the existence of a polynomial time algorithm for some NP-complete. We show that the Monotone Weighted Xor 2-satisfiability problem (MWX2SAT) is NP-complete and P at the same time. Certainly, we make a polynomial time reduction from every directed graph and positive integer k in the K-CLOSURE problem to an instance of MWX2SAT. In this way, we show that MWX2SAT is also an NP-complete problem. Moreover, we create and implement a polynomial time algorithm which decides the instances of MWX2SAT. Consequently, we prove that P = NP.

Graph entropies have been used to interpret the complexity of the networks. There are various graph entropies in the literature. In this note a new graph entropy is defined which is based on the dominating sets of the graphs. Moreover the entropy of some classes of the graphs is obtained

Recent discovery of triangular boron Nanotubes makes it a competitor of carbon in many respects. Closed forms of M-polynomial of nanotubes produce closed forms of many degree-based topological indices which are numerical parameters of the structure and, in combination, determine properties of the concerned nanotubes. In this report, we give M-polynomials of triangular boron nanotubes and recover many important topological degree-based indices of these nanotubes. We also plot surfaces associated to these nanotubes.

The P versus NP problem is a cornerstone of theoretical computer science, asking whether problems that are easy to check are also easy to solve. "Easy" here means solvable in polynomial time, where the computation time grows proportionally to the input size. While this problem's origins can be traced to John Nash's 1955 letter, its formalization is credited to Stephen Cook and Leonid Levin. Despite decades of research, a definitive answer remains elusive. Central to this question is the concept of NP-completeness. If even one NP-complete problem could be solved efficiently, it would imply that all problems in NP could be solved efficiently, proving P equals NP. This research proposes that EXACT CLOSURE, a notoriously difficult NP-complete problem, can be solved efficiently, thereby potentially establishing the equivalence of P and NP. This work is an expansion and refinement of the article "Note for the P versus NP problem", published in IPI Letters.

In this paper, the optimal approximation algorithm is proposed to simplify non-linear functions and/or discrete data as piecewise polynomials by using the constrained least squares. In time-sensitive applications or in embedded systems with limited resources, the runtime of the approximate function is as crucial as its accuracy. The proposed algorithm search to find the Optimal Piecewise Polynomial (OPP) with minimum computational cost while ensuring the error below a specified threshold. This was accomplished by using smooth piecewise polynomials with optimal order and number of intervals. The computational cost only depends on polynomial complexity, i.e., the order and the number of intervals at runtime function call. For optimal approximation, computational costs for all the possible combinations of piecewise polynomials were calculated and tabulated as ascending order for the specific target CPU off-line. Each combination was optimized through constrained least squares and random selection method for given sample points. Afterward, whether the approximation error is below the predetermined value is examined. When the error is permissible, the combination is selected as the optimal approximation or the next combination was examined. To verify the performance, several representative functions were examined and analyzed.

Polynomial recurrence bounds for a class of stochastic differential equations with a gradient type drift and an additive Wiener process are studied without Lyapunov functions.

In this article, we establish sharp trigonometric-polynomial bounds for unnormalized sinc function.

For a graph G, let P(G, λ) be its chromatic polynomial. Two graphs G and H are said to be chromatically equivalent if P(G,λ) = P(H,λ). A graph is said to be chromatically unique if no other graph shares its chromatic polynomial. In this paper, chromatic polynomial of the necklace graph N_n, for n ≥ 2 has been determined. It is further shown that N₃ is chromatically unique.

Sharing confidential information is a critical concern in today’s world. Secret sharing schemes facilitate the sharing of secrets in a way that ensures only authorized participants (shareholders) can access the secret using their allocated shares. Hierarchical secret sharing schemes (HSSSs) build upon Shamir’s scheme by organizing participants into different levels based on priority. Within HSSS, participants at each level can reconstruct the secret if a specified number, denoted as the threshold value (t), or more of them are present. Each level has a predetermined threshold value. If the number of participants falls below the threshold at any level, higher-level participants must be involved in reconstructing the secret at lower levels. Our paper proposes schemes that implement hierarchical access structures and enable the sharing of multiple secrets. Additionally, our proposed scheme includes share verification. We have analyzed potential attacks and demonstrated the scheme’s resistance against them. Through security analysis and comparison with existing schemes, we highlight the novelty and superiority of our proposed approach, contributing to advancements in secure information sharing practices.

The paper analyzes the phenomenon that condition the durability and reliability of a type of dental bur based on the wear of the active part and with effect on its quality. For the experimental study, a conical-cylindrical dental bur and a sample dental material in cobalt-chromium alloy, cylindrical shape, tested on a specially made experimental installation were used. The paper was limited to the consideration of a single parameter (loss of mass, mw by wear of the active part of the dental bur tested) for the establishment the durability and reliability, useful for the extension of the lifetime or even optimization of its operation. The wear phenomenon of the active part of dental bur is studied based on the results and experimental data obtained in the work process that was validated by interpolation and led to polynomial functions which approximate very well the dependent parameter, mw, considered in the experimental program. The results of the interpolation showed that in the first 11 h of work, the dental bur works with high efficiency, after which it can be easily decommissioned (optimizing operation, possibly constructive solutions); i.e., it should be replaced with a new one (criterion for replacing of worn dental bur).

The paper describes a method of solving some stochastic processes using generating functions. A general theorem of generating functions of a particular type is derived. A generating function of this type is applied to a stochastic process yielding polynomial time algorithms for certain partitions. The method is generalized to a stochastic process describing a rather general linear transform. Finally, the main idea of the method is used in deriving a theoretical polynomial time algorithm to the knapsack problem.

Zero-Knowledge Proofs ZKP provide a reliable option to verify that a claim is true without giving detailed information other than the answer. A classical example is provided by the ZKP based in the Graph Isomorphism problem (GI), where a prover must convince the verifier that he knows an isomorphism between two isomorphic graphs without publishing the bijection. We design a novel ZKP exploiting the NP-hard problem of finding the algebraic ideal of a multivariate polynomial set, and consequently resistant to quantum computer attacks. Since this polynomial set is obtained considering instances of GI, we guarantee that the protocol is at least as secure as the GI based protocol.

Nonlinear nonparametric statistics (NNS) algorithm offers new tools for curve fitting. A relationship between k-means clustering and NNS regression points is explored with graphics showing a perfect fit in the limit. The goal of this paper is to demonstrate NNS as a form of unsupervised learning, and supply a proof of its limit condition. The procedural similarity NNS shares with vector quantization is also documented, along with identical outputs for NNS and a k nearest neighbours classification algorithm under a specific NNS setting. Fisher's iris data and artificial data are used. Even though a perfect fit should obviously be reserved for instances of high signal to noise ratios, NNS permits greater flexibility by offering a large spectrum of possible fits from linear to perfect.

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 standard approach to integrable nonlinear evolution equations (NLEE) usually uses the following steps: 1) Lax representation $[L,M]=0$; 2)~construction of fundamental analytic solutions (FAS); 3) reducing the inverse scattering problem (ISP) to a Riemann-Hilbert problem (RHP) $\xi^+(x,t,\lambda) =\xi^-(x,t,\lambda) G(x,t\lambda)$ on a contour $\Gamma$ with sewing function $G(x,t,\lambda)$; 4) soliton solutions and possible applications.Step 1) involves several assumptions: the choice of the Lie algebra $\mathfrak{g}$ underlying $L$, as well as its dependence on the spectral parameter, typically linear or quadratic in $\lambda$. In the present paper we propose another approach which substantially extends the classes of integrable NLEE.Its first advantage is that one can effectively use any polynomial dependence in both $L$ and $M$. We use the following steps: A) Start with canonically normalized RHP with predefined contour $\Gamma$; B) Specify the $x$ and $t$ dependence of the sewing function defined on $\Gamma$; C) Introduce convenient parametrization for the solutions $ \xi^\pm(x,t,\lambda)$ of the RHP and formulate the Lax pair and the nonlinear evolution equations (NLEE); D) use Zakharov-Shabat dressing method to derive their soliton solutions. This needs correctly taking into account the symmetries of the RHP. E) Define the resolvent of the Lax operator and use it analyze its spectral properties.

In this paper, we study the well-posedness and asymptotic behaviour of solutions to a laminated beam in thermoelasticity of type III. We first give the well-posedness of the system by using the semigroup method. Then, we show that the system is exponentially stable under the assumption of equal wave speeds. Furthermore, it is proved that the system is lack of exponential stability for case of nonequal wave speeds. In this regard, a polynomial stability result is proved.

The parameter estimation problem for polynomial phase signals (PPSs) arises in a number of fields, including radar, sonar, biology, etc. In this paper, a fast algorithm of parameter estimation for monocomponent PPS is considered. We propose the so-called LSU-EKF estimator, which combines the least squares unwrapping (LSU) estimator and the extended Kalman filter (EKF). First, the coarse estimates of the parameters of PPS are obtained by the LSU estimator using a small number of samples. Subsequently, these coarse estimates are used to initial the EKF. Monte-Carlo simulations show that the computation complexity of the LSU-EKF estimator is much less than that of the LSU estimator, with little performance loss. Similar to the LSU estimator, the proposed algorithm is able to work over the entire identifiable region. Moreover, in the EKF stage, the accurate estimated results can be output point-by-point, which is useful in real applications.

In the paper, the authors nd a new closed expression for the Fibonacci polynomials and, consequently, for the Fibonacci numbers, in terms of a tridiagonal determinant.

In the paper, by a very simple approach, the author establishes an expression in terms of a lower Hessenberg determinant for the Euler polynomials. By the determinantal expression, the author finds a recurrence relation for the Euler polynomials. By the way, the author derives the corresponding expression and recurrence relation for the Euler numbers.

Local polynomial smoother (LPS) is a weighted local least-squares nonparametric method. It provides a local Taylor series fit of the data at any location and can be directly used in a differential equation to provide a numerical scheme. In this article, we introduce this new nonparametric idea based on local polynomial smoother, for acquiring the numerical solution of the Bagley-Torvik fractional-order differential equations. Furthermore, this paper will present a numerical comparison with some methods, such as legendre operational matrix and pseudo-spectral method. The efficiency and accuracy of the LPS method are demonstrated by two numerical examples.

The Polynomial coefficient function, from the complex hyperspace Cⁿ in itself, is the function Fⁿ that provides the coefficients of the polynomial (x - a₁)(x - a₂)... (x-a_n). A proof of the fundamental theorem of algebra is given where the surjectivity of this function is obtained from a Recurrent Coefficient Equation.

According to the requirement of 20kg load of casting barrel, we design a three-dimensional model of the robot and analyze the three stages of liquid level change in the casting barrel during the casting process. Through the analysis, it is determined that the time and angle function is an implicit function, and it is impossible to find the analytical expression of time about angle. The kinetic function of the casting barrel is simulated by MATLAB, and it is found that the function image has mutation points, and when the original function is fitted and approximated by fifth-degree polynomial interpolation, the fifth-degree polynomial function image of the time versus the angular acceleration has a large amplitude of oscillation, especially the mutation points. A PID algorithm based on the discretization of the time and acceleration function is introduced for correction, and the results show that this method effectively reduces the oscillation amplitude of the image and improves the coincidence with the original function.

An oil and vinegar scheme is a signature scheme based on multivariate quadratic polynomials over finite fields. The system of polynomials contains $n$ variables, divided into two groups: $v$ vinegar variables and $o$ oil variables. The scheme is called balanced (OV) or unbalanced (UOV), depending on whether $v = 0$ or not, respectively. These schemes are very fast and require modest computational resources, which make them ideal for low-cost devices such as smart cards. However, the OV scheme has been already proven to be insecure and the UOV scheme has been proven to be very vulnerable for many parameter choices. In this paper, we propose a new multivariate public key signature whose central map consists of a set of polynomials obtained from the multiplication of block matrices. Our construction is motivated by the design of the Simple Matrix Scheme for Encryption and the UOV scheme. We show that it is secure against the Separation Method, which can be used to attack the UOV scheme, and against the Rank Attack, which is one of the deadliest attacks against multivariate public-key cryptosystems. Some theoretical results on matrices with polynomial entries are also given, to support the construction of the scheme.

The polynomial functional specification is widely used in environmental and ecological economics. When different powers of the same variable enter to the specification the elasticity of explained variable with respect to that variable should be obtained using the elasticity formula. Since, in this case the elasticity itself is a function, one need to calculate it at a certain point, to have a general idea about the response of explained variable to the change in explanatory variable. The mainly used point is mean of the variables entering to the elasticity formula. Sometimes, the minimum and maximum points also used for comparison purposes. One should careful in interpreting the response of explanatory variable to the change in the variable entering to the specification with its different powers. This study revisits some methodological points regarding the calculation and interpretation of responses in the above-mentioned cases.

In this paper, we study the entire or meromorphic solutions for differential-difference equations in f(z) , its shifts, its derivatives and derivatives of its shifts. and study some Hayman's results for differential-difference polynomials.

Ziyuan-3 (ZY-3) satellite is the first civilian stereo mapping satellite in China and was designed to achieve the 1: 50000 scale mapping for land and ocean. Rigorous sensor model (RSM) is required to build the relationship between the three-dimensional (3D) object space and two-dimensional (2D) image space of ZY-3 satellite imagery. However, each satellite sensor has its own imaging system with different physical sensor models, which increase the difficulty of geometric integration of multi-source images with different sensor models. Therefore, it is critical to generate generic model， especially rational polynomial coefficients (RPCs) of optical imagery. Recently, relatively a few researches have been conducted on RPCs generation to ZY-3 satellite. This paper proposes an approach to evaluate the performance of RPCs generation from RSM of ZY-3 imagery. Three scenarios experiments with different terrain features (such as ocean, city and grassland) are designed and conducted to comprehensively evaluate the replacement accuracies of this approach and analyze the RPCs fitting error. All the experimental results demonstrate that the proposed method achieved the encouraging accuracy of better than 1.946E-04 pixel in both x-axis direction and y-axis direction, and it indicates that the RPCs is suitable for ZY-3 imagery and can be used as a replacement for the RSM of ZY-3 imagery.

Graph theory plays a crucial role in modeling and designing of chemical structure or chemical network. Chemical Graph theory helps to understand the molecular structure of molecular graph. The molecular graph consists of atoms as vertices and bonds as edges. Topological indices capture symmetry of molecular structures and give it a mathematical language to predict properties such as boiling points, viscosity, the radius of gyrations etc. In this article, we study the chemical graph of carbon Crystal structure of graphite and cubic carbon and compute several degree-based topological indices. Firstly we compute M-Polynomials of these structures and then from these M-polynomials we recover nine degree-based topological indices.

This article systematically studied the A-optimal designs of a high-order mixture central polynomial model, which is an advancement of the research results for the A-optimal design of the most recent third-order mixture central polynomial model and a more accurate response surface model. This article is based on the simplex center design, obtaining measurement values at various design points, and verifying them through the A-optimal equivalence theorem. We also compare the A-efficiency of designs through examples, which can be applied to the A-optimal precise design of the fourth-order mixture model.

Unmanned aerial vehicles (UAVs, drones) are not just a technological achievement based on modern ideas of artificial intelligence; they also provide a sustainable solution for green technologies in logistics, transport and material handling. In particular, using battery-powered UAVs to transport products can significantly decrease energy and fuel expenses, reduce environmental pollution, and improve the efficiency of clean technologies through improved energy-saving efficiency. We consider the problem of maximizing the average environmental benefit of a fleet of drones given a periodic schedule of tasks performed by the fleet of vehicles. To solve the problem efficiently, we formulate it as an optimization problem on an infinite periodic graph and reduce it to a special type of parametric assignment problem. We exactly solve the problem under consideration in O(n³) time, where n is the number of tasks performed by vehicles.

Nuclear fusion reactors are composed by several complex components whose behaviour may be not certain a priori. This uncertainty may have a significant importance in the evolution of fault transients in the machine, causing unexpected damages to its components. For this reason a suitable method for the uncertainty propagation during those transient is required. The Monte Carlo method would be the reference option, but it is, in most of the cases, not applicable due to the large amount of required simulations to be repeated. In this context the Polynomial Chaos Expansion has been considered as a valuable alternative. It allows to create a surrogate model of the original one in terms of orthogonal polynomials. Then, the uncertainty quantification is performed repeatedly calling this much simpler and faster model. Using the fast current discharge in the Divertor Tokamak Test Toroidal Field (DTT TF) coils as a reference scenario, this method has been applied: the uncertainty on the parameters of the Fast Discharge Unit (FDU) varistor disks is propagated to the simulated electrical and electro-magnetic relevant effects. Eventually two worst case scenarios have been analyzed from the thermal-hydraulic point of view with the 4C code, simulating a fast current discharge as a consequence of a coil quench. Eventually it has been demonstrated that the uncertainty on the inputs (varistor parameters) strongly propagates obtaining a wide range of possible scenarios in case of accidental transients. This result underlines the necessity to take into account and propagate all possible uncertainties in the design of a fusion reactor, according to the Best Estimate Plus Uncertainty approach.

Many probability-based uncertainty quantification (UQ) schemes require a large amount of sampled data to build credible probability density function (PDF) models for uncertain parameters. Unfortunately, the data collected in compressor blades of aero-engine are mostly limited due to expensive and time-consuming tests. In this paper, we develop a preconditioner-based data-driven polynomial chaos (PDDPC) method that can efficiently deal with uncertainty propagation of limited sampled data. The calculation accuracy of PDDPC method is closely related to the sample size of collected data. Therefore, the influence of sample size on PDDPC method is investigated using a nonlinear test function. Subsequently, we consider the real manufacturing errors of stagger angle for compressor blades. Under three different operating conditions, PDDPC method is applied to investigate the effect of stagger angle error on UQ results of multiple aerodynamic parameters of a two-dimensional compressor blade. The results show that as the sample size of measured data increases, UQ results of aerodynamic performance obtained by PDDPC method gradually converge. There exists a critical sample size that ensures accurate UQ analysis of compressor blades. The probability information contained in the machining error data is analyzed through Kullback-Leibler divergence, and the critical sample size is determined. The research results can make a valuable reference for the fast and cheap UQ analysis of compressor blades in practical engineering.

Using the orbit decomposition, a new enumerative polynomial P(x) is introduced for abstract (simplicial) complexes of a given type, e.g., trees with a fixed number of vertices or triangulations of the torus with a fixed graph. The polynomial has the following three useful properties. (I) The value P(1) is equal to the total number of unlabeled complexes (of a given type). (II) The value of the derivative P'(1) is equal to the total number of nontrivial automorphisms when counted across all unlabeled complexes. (III) The integral of P(x) from 0 to 1 is equal to the total number of vertex-labeled complexes, divided by the order of the acting group. The enumerative polynomial P(x) is demonstrated for trees and then is applied to the triangulations of the torus with the vertex-labeled complete four-partite graph G = K_{2,2,2,2}, in which specific case P(x) = x^{31}. The graph G embeds in the torus as a triangulation, T(G). The automorphism group of G naturally acts on the set of triangulations of the torus with the vertex-labeled graph G. For the first time, by a combination of algebraic and symmetry techniques, all vertex-labeled triangulations of the torus (twelve in number) with the graph G are classified intelligently without using computing technology, in a uniform and systematic way. It is helpful to notice that the graph G can be converted to the Cayley graph of the quaternion group Q_8 with the three imaginary quaternions i, j, k as generators.

In this work, generalized geometry of second-order tangent groups and affine configuration complexes is proposed. Initially, geometry for higher weights n=4 and weights n=5 is presented through some interesting and suitable homomorphisms, finally, this geometry is extended and generalized for any weight n.

The hybrid numbers are a generalization of complex, hyperbolic and dual numbers. In this paper, we introduce the Horadam hybrid polynomials called Horadam hybrinomials. We also give some special cases and algebraic properties of the Horadam hybrinomials. Finally we obtain some applications related to the Horadam hybrinomials in matrices.

In this paper, we study the well-posedness and asymptotics of a one-dimensional thermoelastic laminated beam system either with or without structural damping, where the heat conduction is given by Fourier's law effective in the rotation angle displacements. We show that the system is well-posed by using Lumer-Philips theorem, and prove that the system is exponentially stable if and only if the wave speeds are equal, by using the perturbed energy method and Gearhart-Herbst-Prüss-Huang theorem. Furthermore, we show that the system with structural damping is polynomially stable provided that the wave speeds are not equal, by using the second-order energy method.

In the paper, the authors present unified generalizations for the Bell numbers and polynomials, establish explicit formulas and inversion formulas for these generalizations in terms of the Stirling numbers of the first and second kinds with the help of the Faà di Bruno formula, properties of the Bell polynomials of the second kind, and the inversion theorem connected with the Stirling numbers of the first and second kinds, construct determinantal and product inequalities for these generalizations with aid of properties of the completely monotonic functions, and derive the logarithmic convexity for the sequence of these generalizations.

This paper presents an advanced software tool for precise laser beam propagation analysis, focusing on the calculation of the M2 value, a key measure of beam quality. Developed in Python, the software integrates libraries like NumPy, Matplotlib, and SciPy for robust data handling and accurate polynomial fitting. It features a user-friendly interface for easy data input, analysis, and visualization, making it accessible to both professionals and novices. The tool has been rigorously validated against theoretical models (M2=1) and experimental data (showing M2=1.2548 and 1.3166), ensuring high accuracy and reliability. It visualizes beam width data and fitted polynomial curves, aiding in assessing beam propagation characteristics and optimizing laser systems. Future enhancements include additional beam quality metrics, machine learning integration, and cloud-based functionality. This tool significantly advances laser beam analysis, benefiting research and industrial applications by improving performance and efficiency. The software is available at DOI: 10.5281/zenodo.13325911

In this paper, we introduce and investigate a new family of sequences called the generalized Fibospinomials (or the generalized Fibonacci polynomial spinors or Horadam polynomial spinors). Being particular cases, we handle with $(r,s)$-Fibonacci and $(r,s)$-Lucas polynomial spinors. After a short history on spinors and quaternions, we present Binet's formulas, generating functions and the summation formulas for these polynomials. In addition, we obtain some identities of generalized Fibonacci polynomial spinors, $(r,s)$-Fibonacci polynomial spinors and $(r,s)$-Lucas polynomial spinors. Moreover, we give some special identities such as Catalan's and Cassini's identities and we present matrices related with these polynomials.

The behaviour and bifurcations of solutions to three-dimensional (three-phase) quadratic polynomial dynamical systems (DSs) are considered. The integrability in elementary functions is proved for a class of autonomous polynomial DSs. The occurrence of bifurcations of the type twisted fold is discovered on the basis and within the frames of the elements of the developed DS qualitative theory. The discriminant criterion applied originally to two-phase quadratic polynomial DSs is extended to three-phase DSs investigated in terms of their coefficient matrices. Specific classes of D- and S-vectors are introduced and complete description of the symmetry relations inherent to the DS coefficient matrices is performed using the discriminant criterion.

The fatigue crack growth rate (FCGR) of aluminium alloys under the combined influence of temperature and humidity remains a relatively unexplored area, receiving limited attention due to its intricate nature and challenges in predicting the combined impact of these factors. The challenge was to investigate and address the specific mechanisms and interactions between temperature and humidity, as in coastal environment conditions, on the FCGR of aluminium alloy. The present study conducts a comprehensive investigation on the combined influence of temperature and humidity on the FCGR of Al6082 alloy. The fatigue pre-cracked compact tension specimens were corroded for 7 days and then subjected to various temperature and humidity conditions in a thermal chamber for 3 days to simulate coastal environments. The obtained data were analysed to determine the influence of temperature and humidity on the FCGR of Al6082 alloy. An empirical model was also established to predict fatigue life cycle values under these environmental conditions precisely. The correlation between FCGR and fracture toughness models was also examined. The Al6082 alloy exhibits a 34% increase in the Paris constant C, indicating reduced FCGR resistance due to elevated temperature and humidity levels. At the same time, fatigue, corrosion, moisture-assisted crack propagation, and hydrogen embrittlement lead to a 27% decrease in threshold fracture toughness. The developed model exhibited accurate predictions for fatigue life cycles, and the correlation between fracture toughness and FCGR showed less than 10% error, indicating a strong relationship between these parameters.

In this paper, we consider the zero distributions of q-shift monomi-als and difference polynomials of meromorphic functions with zero order, that extends the classical Hayman results on the zeros of differential poly-nomials to q-shift difference polynomials. We also investigate problem of q-shift difference polynomials that share a common value.

We construct a real square system related to a given over-determined real system. We prove that the simple real zeros of the over-determined system are the simple real zeros of the related square system and the real zeros of the two systems are one-to-one correspondence with the constraint that the value of the sum of squares of the polynomials in the over-determined system at the real zeros is identically zero. After certifying the simple real zeros of the related square system with the interval methods, we assert that the certified zero is a local minimum of the sum of squares of the input polynomials. If the value of the sum of the squares of the input polynomials at the certified zero is equal to zero, it is a zero of the input system. As an application, we also consider the heuristic verification of the isolated zeros of polynomial systems and their multiplicity structures. Notice that a complex system with complex zeros can be transformed into a real system with real zeros.

The topological index is a numerical quantity based on the characteristics of various invariants or molecular graph. For ease of discussion, these indices are classified according to their logical derivation from topological invariants rather than their temporal development. Degree based topological indices depends upon the degree of vertices. This paper computes Zagreb polynomials and redefined first, second and third Zagrebindices of Bismuth Tri-Iodide chains and sheets.

The topological index is a numerical quantity based on the characteristics of various invariants or molecular graph. For ease of discussion, these indices are classified according to their logical derivation from topological invariants rather than their temporal development. Degree based topological indices depends upon the degree of vertices. This paper computes degree based topological indices of Bismuth Tri-Iodide chains and sheets with the help of M-polynomial.

The Bessel function of the first kind J_N(kx) is expanded in a Fourier-Legendre series, as is the modified Bessel functions of the first kind I_N(kx) . Known polynomial approximations for the range −3≤x≤3 (having five-digit accuracy) are compared with those arising from this Legendre series and substitute versions are given with twice the number of terms and range (with five-digit accuracy or having fifteen-digit accuracy over −3≤x≤3). It is shown that infinite series of like-powered contributors (involving _2F_3 hypergeometric functions) extracted from the Fourier-Legendre series may be summed, having values that are inverse powers of the first five primes 1/(2^i 3^j 5^k 7^l 11^mm) for powers of order x24.

Crop digital twin is redefining traditional farming practices, offering unprecedented opportunities for real-time monitoring, predictive and simulation analysis, and optimization. This research embarks on an exploration of the synergy between precision agriculture, crop modeling, and regression algorithms to create a digital twin for augmenting farmers the concentration and composition prediction-based crop nutrient recovery. This captures the holistic representation of crop characteristics, considering the intricate relationships between environmental factors, nutrient concentrations, and crop compositions. However, the complexity arising from diverse soil and environmental conditions makes nutrient content analysis expensive and time-consuming. This paper presents the result of a predictive digital twin case study that employs six regression algorithms namely Elastic Net, Polynomial, Stepwise, Ridge, Lasso, and Linear Regression to predict rice nutrient content efficiently, particularly considering the coexistence and composition of multiple nutrients. Our research findings highlight the superiority of the Polynomial Regression model in predicting nutrient content, with a specific focus on accurate nitrogen percentage prediction. This insight can be used for nutrient recovery intervention by knowing the precise amount of nutrient to be added into the crop medium. The adoption of the Polynomial Regression model offers a valuable tool for nutrient management practices in the crop digital twin, potentially resulting in higher-quality rice production and a reduced environmental impact. The proposed method can be replicable in other low-resourced crop digital twin system.

This paper discusses a passive control issue for Nonlinear Time-Varying (NTV) systems subject to stability and attenuation performance. Based on the modeling approaches of Takagi-Sugeno (T-S) fuzzy model and the Linear Parameter-Varying (LPV) model, a Parameter-Dependent Polynomial Fuzzy (PDPF) model is constructed to represent the NTV systems. According to Parallel Distributed Compensation (PDC) concept, a parameter-dependent polynomial fuzzy controller is built to achieve robust stability and passivity of PDPF model. Furthermore, the passive theory is applied to achieve the performance constraining the disturbance effect on the PDPF systems. To develop the stability criteria, by introducing a parameter-dependent polynomial Lyapunov function, one can derive some stability conditions which belong to the term of Sum-Of-Squares (SOS) form. Based on the Lyapunov function, two stability criteria are proposed to design the corresponding PDPF controller such that the NTV system is robustly stable and passive. Finally, a numerical example is applied to demonstrate the effectiveness of the proposed stability criterion.

A complete MAPLE procedure is designed to implement effectively an algorithm for approximating the trigonometric functions. The algorithm gives a piecewise polynomial approximation on an arbitrary interval, presenting a special partition that we can get its parts, subintervals with ending points of finite rational numbers, together with corresponding approximate polynomials. The procedure takes a sequence of pairs of interval-polynomial as its output that we can easily explore in some useful ways. Examples on calculating approximate values of the sine function with arbitrary accuracy for both of rational and irrational arguments as well as drawing the graph of the piecewise approximate functions will be presented. Moreover, from the approximate integration of integrands of the form $x^m\sin x$ on $[a,b]$, another MAPLE procedure is proposed to find the desired polynomial estimates in norm for the best $L^2$-approximation of the sine function in the vector space $\mathcal{P}_{\ell}$ of polynomials of degree at most $\ell$, a subspace of $L^2(a,b)$.

MicroRNAs (miRNA) exert regulatory actions via base-pairing with their binding sites on target mRNAs. Cooperative-binding, i.e., synergism, among binding sites on a mRNA is biochemically well-characterized. We studied whether this synergism is reflected in global relationship between miRNA-mediated regulatory activity and miRNA-binding-site count on the target mRNAs, i.e., leading to a non-linear relationship between the two. Recently, using our own and public datasets, we have enquired into miRNA regulatory actions: first, we analyzed the power-law distribution pattern of miRNA binding sites; second, strikingly, mRNAs for core miRNA regulatory apparatus proteins have extra-ordinarily high binding site counts, forming self-feedback-control loops; third, we revealed that tumor suppressor mRNAs generally have more sites than oncogene mRNAs; and fourth, we characterized enrichment of miRNA target mRNAs in translationally less-active polysomes relative to more-active polysomes. In these four studies, obvious correlation was observed qualitatively between the extent to which a mRNA is miRNA-regulated and its binding sites count. This paper summarizes the used datasets. We also re-analyzed the correlation by comparative linear and non-linear regression analyses. The results support a non-linear, instead of linear, relationship between the two parameters, conceivably a transcriptome-level reflection of cooperative-binding/synergism among miRNA binding sites on a target mRNA.

In the quest for robust and efficient digital communication, this paper introduces cutting-edge key exchange protocols leveraging tropical semirings’ computational prowess and block matrices’ structural resilience. Moving away from the conventional use of finite fields, these protocols deliver markedly faster processing speeds and heightened security. We present two implementations of our concept, each utilizing a different platform for the set of commuting matrices: one employing tropical polynomials of matrices and the other employing Linde-de la Puente matrices. The inherent simplicity of tropical semirings leads to a decrease in operational complexity, and using block matrices enhances our protocols’ security profile. The security of these protocols relies on the Matrix Decomposition Problem. We also provide a comparative analysis of our protocols against existing matrix block-based protocols in finite fields. This research marks a significant shift in cryptographic protocol design, specifically tailored for demanding engineering applications, and sets a new standard in secure and efficient digital communication.

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.

This is the first study to comprehensively evaluate the benefit of urban open spaces and cropland with different adjacent public facilities seen as locally undesirable (“not in my backyard,” NIMBY) or desirable (“yes in my backyard,” YIMBY). The total benefit increases or decreases for urban open space and cropland with adjacent NIMBY or YIMBY facilities in a municipality in Taiwan. The results show that for the city as a whole, the current arrangement of NIMBY and YIMBY in different zones decreases the total benefit of urban open spaces in highly urbanized zones and increases the total damage to cropland in extremely rural zones. This indicates a need to avoid further installing NIMBY or YIMBY facilities in already occupied urban open spaces. The results also demonstrate that locating NIMBY or YIMBY facilities near cropland fails to highlight the benefit of YIMBY facilities and magnifies opposition to NIMBY facilities. For individual housing units, the total damage is 1.87% of the average housing price for cropland-type open space with adjacent NIMBY or YIMBY facilities, and the total benefit is 7.43% of the average housing price for urban-type open space in a highly urbanized area. In contrast, the total benefit for open space with adjacent NIMBY or YIMBY facilities is a 2.95%-13.80% increase in the average housing price for areas with mixed urban open space and cropland.

Industrial dynamical systems often exhibit multi-scale response due to material heterogeneities, operation conditions and complex environmental loadings. In such problems, it is the case that the smallest length-scale of the systems dynamics controls the numerical resolution required to effectively resolve the embedded physics. In practice however, high numerical resolutions is only required in a confined region of the system where fast dynamics or localized material variability are exhibited, whereas a coarser discretization can be sufficient in the rest majority of the system. To this end, a unified computational scheme with uniform spatio-temporal resolutions for uncertainty quantification can be very computationally demanding. Partitioning the complex dynamical system into smaller easier-to-solve problems based of the localized dynamics and material variability can reduce the overall computational cost. However, identifying the region of interest for high-resolution and intensive uncertainty quantification can be a problem dependent. The region of interest can be specified based on the localization features of the solution, user interest, and correlation length of the random material properties. For problems where a region of interest is not evident, Bayesian inference can provide a feasible solution. In this work, we employ a Bayesian framework to update our prior knowledge on the localized region of interest using measurements and system response. To address the computational cost of the Bayesian inference, we construct a Gaussian process surrogate for the forward model. Once, the localized region of interest is identified, we use polynomial chaos expansion to propagate the localization uncertainty. We demonstrate our framework through numerical experiments on a three-dimensional elastodynamic problem

Titania is one of the most comprehensively studied nanostructures due to its widespread applications in production of catalytic, gas- sensing and corrosion- resistance materials [1]. M-polynomial of nanotubes has been vastly investigated as it produces many degree-based topological indices which are numerical parameters capturing structural and chemical properties. These indices are used in the development of quantitative structure-activity relationships (QSARs) in which the biological activity and other properties of molecules are correlated with their structure like boiling point, stability, strain energy etc of chemical compounds. In this paper, we determine M-polynomials of single-walled titanium (SW TiO2) nanotubes and recover important topological degree based indices of them to theoretically judge these nanotubes. We also use Maple to plot surfaces associated to different types of single-walled titanium (SW TiO2) nanotubes.

In the paper, the author introduces the notions "multi-order logarithmic numbers" and "multi-order logarithmic polynomials", establishes an explicit formula, an identity, and two recurrence relations by virtue of the Faa di Bruno formula and two identities of the Bell polynomials of the second kind in terms of the Stirling numbers of the first and second kinds, and constructs some determinantal inequalities, product inequalities, logarithmic convexity for multi-order logarithmic numbers and polynomials by virtue of some properties of completely monotonic functions.

Valles Marineris (VM), the most prominent example of a Martian Valley Network, has been extensively studied for over 50 years, yet no detailed examination of the principal azimuths of the system exists. To address this, two methods are presented to precisely calculate the principal azimuths, a Bezier Spline analysis, and a GIS technique. The medial axis of the main canyon of VM was determined analytically from cubic polynomial splines fitted to 93 coordinate points along both north and south edges of the canyon. These splines were optimized, and medial axis points were calculated through numerical techniques that ensured orthogonality between the tangents of each spline and their connecting normal lines. 1,000 medial axis points were extracted, and various regression models constructed, including fitting to sinusoidal and cubic polynomial curves, achieving accuracies with R² values of 0.98 and 0.99, respectively. Principal azimuths were obtained using the sinusoidal equation with the slope of the tangent at any point x simply determined by the derivative of the curve’s equation. This analytic approach was cross-validated by a GIS method (using QGIS software), where a vector medial axis was obtained which produced principal azimuths that agreed with values from the analytic study with a correlation coefficient of 1.00, and a p value of 6.43e-65. The findings demonstrate that an azimuthal framework can be rigorously constructed as a potential standard reference in VM geoscience, replacing less precise and ambiguous compass bearings with the accurate azimuths necessary for high-resolution spatial analysis for future investigations.

Formal Calculation uses an auxiliary form to calculate various nested sums and provides results in three forms. In addition to computation, it is also a powerful tool for analysis, allowing one to study various numbers in a unified way. This article contains many results of two types of Stirling numbers, associated Stirling numbers, and Eulerian numbers, making a great generalization of Euler polynomials, Wilson's theorem, and Wolstenholme's theorem, showing that they are just special cases. Formal Calculation provides a novel method for obtaining combinatorial identities and analyzing q-binomial.This article has obtained a large number of results in q-analogues, including inversion formulas for q-binomial coefficients. This article also introduces a theorem on symmetry.

The degradation of Proton-exchange membrane fuel cell (PEMFC) gasket materials is crucial in electric vehicles as it can cause hazardous hydrogen fuel leaks, which are usually due to high temperatures, pressures, and hydrogen fuel exposure. Degradation of gasket materials in PEMFC presents a critical concern for electric vehicle safety due to potential hydrogen fuel leaks. This study utilizes finite element analysis (FEA) to assess the suitability of gasket materials for PEMFC applications, focusing on aging and tensile conditions. The dual degradation framework, incorporating contact pressure and von Mises stress, is employed to evaluate Liquid Silicon Rubber (LSR) and Ethylene Propylene Diene Monomer (EPDM) materials. Under aging techniques, the Yeoh model exhibits the least Mean Absolute Percentage Error (MAPE) and computational cost of 0.27 seconds, while the Ogden model records the highest computational cost of 0.89 seconds. In evaluating MAE, Root Mean Square Error (RMSE), and R-squared metrics, LSR and EPDM materials demonstrate respective averages of 0.25%, 0.275%, 0.945%, and 0.815%, 0.685%, 0.77%. Tensile testing (Uniaxial) reveals RMSE and MAE values of 0.30%, 0.40%, and 0.50%, 0.40%, respectively. FEA proves instrumental in identifying suitable gasket materials for PEMFC applications. LSR emerges as the superior choice, demonstrating enhanced FEA modelling performance under aging and tensile conditions. These findings contribute valuable insights to the design and development of improved gasket materials, bolstering the safety and reliability of electric vehicles.

Log collection and storage is a crucial process for enterprises around the globe. Log analysis helps identify potential security breaches and, in some cases, is required by law for compliance. However, enterprises often delegate these responsibilities to third-party Cloud Service Providers (CSPs), where the logs are collected and processed for anomaly detection and stored in a data warehouse for archiving. Prevalent schemes rely on plain (unencrypted) data for anomaly detection. More often, these logs can reveal sensitive information about an organization or the customers of that organization. Hence, it is best to keep it encrypted at all times. This paper presents "SigML++," an extension of work done in "SigML." We utilize Fully Homomorphic Encryption (FHE) with the Cheon-Kim-Kim-Song (CKKS) scheme for supervised log anomaly detection on encrypted data. We use an Artificial Neural Network (ANN) based probabilistic polynomial approximations using a Perceptron with linear activation. We probabilistically approximate the Sigmoid activation function (σ(x)) in the encrypted domain for the intervals [−10,10] and [−50,50]. Experiments show better approximations for Logistic Regression (LR) and Support Vector Machine (SVM) for low-order polynomials.

The main idea of this paper is to investigate the exact solutions and dynamic properties in optical nanofibers, which is modeled by space-time fractional perturbed nonlinear schr\"odinger equation involving Kerr law nonlinearity with conformal fractional derivative. Firstly, by the complex fractional traveling wave transformation, the traveling wave system of the original equation is obtained, then a conserved quantity, namely the Hamiltonian is constructed, and the qualitative analysis of this system is conducted via this quantity by classifying the equilibrium points. Moreover, the prior estimate of the existence of the soliton and periodic solution is established via the bifurcation method. Furthermore, all exact traveling wave solutions are constructed to illustrate our results explicitly by the complete discrimination system for polynomial method.

In present paper, spatial Minkowski Pythagorean Hodograph (MPH) curves are characterized with Rational Rotation Minimizing Frames (RRMFs). We define Euler-Rodrigues Frame (ERF) for MPH curves and by means of this concept, we reach the definition of MPH curves of type (n, m). Expressing the conditions provided by these curves in the form of Minkowski-Hopf map that we define, it is aimed to establish a connection with the Lorentz force which occurs during the process of Computer Numerical Control (CNC) type sinker Electronic Discharge Machines (EDMs). This approach is reinforced by split quaternion polynomials. Finally, we give conditons satisfied by MPH curves of low degree to be type (n, m) and construct illustrative examples.

In the paper, the author (1) presents an explicit formula and its inversion formula for higher order derivatives of generating functions of the Bell polynomials, with the help of the Faà di Bruno formula, properties of the Bell polynomials of the second kind, and the inversion theorem for the Stirling numbers of the first and second kinds; (2) recovers an explicit formula and its inversion formula for the Bell polynomials in terms of the Stirling numbers of the first and second kinds, with the aid of the above explicit formula and its inversion formula for higher order derivatives of generating functions of the Bell polynomials; (3) constructs some determinantal and product inequalities and deduces the logarithmic convexity of the Bell polynomials, with the assistance of the complete monotonicity of generating functions of the Bell polynomials. These inequalities are main results of the paper.

Starting from the model of a slow-rolling missile with six degrees of freedom (6 DOF) in the body frame, a 6 DOF model in the Resal frame is obtained, which is used to linearize the coupled commanded motion. Based on the linearized model, we obtain the structural scheme of the commanded object and define the quality parameters. The obtained parameters have a complex representation (with real and imaginary parts) due to the coupling between longitudinal channels. Then, the kinematic guidance equations, the seeker equations and the actuator specific to the slow-rolling single-channel missile are defined using a switching function. The guidance kinematic equations, the seeker equations and the actuator model are linearized in the Resal frame, and the structural diagram of the homing missile is constructed. Starting from this, the characteristic polynomial having complex coefficients is determined and then analyzed with the Frank-Wall stability criterion. Based on the analysis, a stability range is determined for the navigation constant and a minimum and possibly a maximum limit for the time to hit the target is obtained. The stability range defined for the navigation constant on the linear model is finally validated on the nonlinear model in the body frame.

Wireless Sensor Networks (WSN) are the core of Internet of Things and require cryptographic protection due to the increase number of attacks. Cryptographic methods for WSN should be fast and consume low power as these networks consist of battery-powered devices and constrained microcontrollers. NTRU, the fastest and secure public key cryptosystem, uses high degree polynomials, and is susceptible to the lattice basis reduction attack (LBRA). CPKC, proposed by NTRU authors, works on integers modulo $q$ and is easily attackable by LBRA since it uses small numbers for the sake of the correct decryption. Herein, RCPKC, a random congruential public key cryptosystem working on integers modulo $q$ is proposed, such that the norm of a two-dimensional vector formed by its private key is greater than $\sqrt{q}$. RCPKC works similar to NTRU, and it is a secure version of insecure CPKC. RCPKC specifies a range from which the random numbers shall be selected, and it provides correct decryption for valid users and incorrect decryption for an attacker using LBRA by Gaussian lattice reduction. Because of its resistance to LBRA, RCPKC is more secure. Simultaneously, due to the use of big numbers instead of high degree polynomials, RCPKC is about 24 (7) times faster in encryption (decryption) than NTRU. Also, RCPKC is more three times faster than the most effective known NTRU variant, BQTRU. Compared to NTRU, RCPKC reduces energy consumption at least seven times that allows increasing life-time of unattended WSN more than seven times.

In the paper, by virtue of the Fa`a di Bruno formula, some properties of the Bell polynomials of the second kind, and the inversion formulas of binomial numbers and the Stirling numbers of the first and second kinds, the authors simplify meaningfully and significantly coefficients in two families of ordinary differential equations associated with higher order Frobenius–Euler numbers.

In the paper, by induction and recursively, the author proves that the generating function of multivariate logarithmic polynomials and its reciprocal are a Bernstein function and a completely monotonic function respectively, establishes a Lévy-Khintchine representation for the generating function of multivariate logarithmic polynomials, deduces an integral representation for multivariate logarithmic polynomials, presents an integral representation for the reciprocal of the generating function of multivariate logarithmic polynomials, computes real and imaginary parts for the generating function of multivariate logarithmic polynomials, derives two integral formulas, and denies the uniform convergence of a known integral representation for Bernstein functions.

In the paper, by the Faά di Bruno formula, several identities for the Bell polynomials of the second kind, and an inversion theorem, the authors simplify coefficients of two families of nonlinear ordinary differential equations for the generating function of the Catalan numbers and discover inverses of fifteen closely related lower triangular integer matrices.

The primary purpose of this research article is to study the famous K$\ddot{o}$the's Conjecture for the special cases - when a ring $\mathfrak{R}$ is commutative, and when $\mathfrak{R}$ is an Algebra over a field. Furthermore, some open problems involving tensor product of Algebras over a field has also been discussed extensively along with their proofs. Subsequently, an equivelent statement of K$\ddot{o}$the's problem in terms of algebra of matrices has been established.

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.

In the paper, by virtue of the Faà di Bruno formula, some properties of the Bell polynomials of the second kind, and an inversion formula for the Stirling numbers of the first and second kinds, the authors establish meaningfully and significantly two identities which simplify coefficients in a family of ordinary differential equations associated with higher order Bernoulli numbers of the second kind.

A new framework in quantum chemistry has been proposed recently ("An approach to first principles electronic structure calculation by symbolic-numeric computation'' by A. Kikuchi). It is based on the modern technique of computational algebraic geometry, viz. the symbolic computation of polynomial systems. Although this framework belongs to molecular orbital theory, it fully adopts the symbolic method. The analytic integrals in the secular equations are approximated by the polynomials. The indeterminate variables of polynomials represent the wave-functions and other parameters for the optimization, such as atomic positions and contraction coefficients of atomic orbitals. Then the symbolic computation digests and decomposes the polynomials into a tame form of the set of equations, to which numerical computations are easily applied. The key technique is Grröbner basis theory, by which one can investigate the electronic structure by unraveling the entangled relations of the involved variables. In this article, at first, we demonstrate the featured result of this new theory. Next, we expound the mathematical basics concerning computational algebraic geometry, which are necessitated in our study. We will see how highly abstract ideas of polynomial algebra would be applied to the solution of the definite problems in quantum mechanics. We solve simple problems in "quantum chemistry in algebraic variety'' by means of algebraic approach. Finally, we review several topics related to polynomial computation, whereby we shall have an outlook for the future direction of the research.