Diophantine equations and Fermat's last theorem for multivariate(skew-)polynomials

Fermat’s Last Theorem is a famous theorem in number theory which is difficult to prove.However,it is known that the version of polynomials with one variable of Fermat’s Last Theorem over C can be proved very concisely.The aim of this paper is to study the similar problems about Fermat’s Last Theorem for multivariate(skew)-polynomials with any characteristic.

Improving Video Watermarking through Galois Field GF(2^(4)) Multiplication Tables with Diverse Irreducible Polynomials and Adaptive Techniques

Video watermarking plays a crucial role in protecting intellectual property rights and ensuring content authenticity.This study delves into the integration of Galois Field(GF)multiplication tables,especially GF(2^(4)),and their interaction with distinct irreducible polynomials.The primary aim is to enhance watermarking techniques for achieving imperceptibility,robustness,and efficient execution time.The research employs scene selection and adaptive thresholding techniques to streamline the watermarking process.Scene selection is used strategically to embed watermarks in the most vital frames of the video,while adaptive thresholding methods ensure that the watermarking process adheres to imperceptibility criteria,maintaining the video's visual quality.Concurrently,careful consideration is given to execution time,crucial in real-world scenarios,to balance efficiency and efficacy.The Peak Signal-to-Noise Ratio(PSNR)serves as a pivotal metric to gauge the watermark's imperceptibility and video quality.The study explores various irreducible polynomials,navigating the trade-offs between computational efficiency and watermark imperceptibility.In parallel,the study pays careful attention to the execution time,a paramount consideration in real-world scenarios,to strike a balance between efficiency and efficacy.This comprehensive analysis provides valuable insights into the interplay of GF multiplication tables,diverse irreducible polynomials,scene selection,adaptive thresholding,imperceptibility,and execution time.The evaluation of the proposed algorithm's robustness was conducted using PSNR and NC metrics,and it was subjected to assessment under the impact of five distinct attack scenarios.These findings contribute to the development of watermarking strategies that balance imperceptibility,robustness,and processing efficiency,enhancing the field's practicality and effectiveness.

Generalized polynomial chaos expansion by reanalysis using static condensation based on substructuring

This paper presents a new computational method for forward uncertainty quantification(UQ)analyses on large-scale structural systems in the presence of arbitrary and dependent random inputs.The method consists of a generalized polynomial chaos expansion(GPCE)for statistical moment and reliability analyses associated with the stochastic output and a static reanalysis method to generate the input-output data set.In the reanalysis,we employ substructuring for a structure to isolate its local regions that vary due to random inputs.This allows for avoiding repeated computations of invariant substructures while generating the input-output data set.Combining substructuring with static condensation further improves the computational efficiency of the reanalysis without losing accuracy.Consequently,the GPCE with the static reanalysis method can achieve significant computational saving,thus mitigating the curse of dimensionality to some degree for UQ under high-dimensional inputs.The numerical results obtained from a simple structure indicate that the proposed method for UQ produces accurate solutions more efficiently than the GPCE using full finite element analyses(FEAs).We also demonstrate the efficiency and scalability of the proposed method by executing UQ for a large-scale wing-box structure under ten-dimensional(all-dependent)random inputs.

Linear Functional Equations and Twisted Polynomials

A certain variety of non-switched polynomials provides a uni-figure representation for a wide range of linear functional equations. This is properly adapted for the calculations. We reinterpret from this point of view a number of algorithms.

THE GROWTH OF SOLUTIONS TO HIGHER ORDER DIFFERENTIAL EQUATIONS WITH EXPONENTIAL POLYNOMIALS AS ITS COEFFICIENTS

By looking at the situation when the coefficients Pj(z)(j=1,2,…,n-1)(or most of them) are exponential polynomials,we investigate the fact that all nontrivial solutions to higher order differential equations f((n))+Pn-1(z)f((n-1))+…+P0(z)f=0 are of infinite order.An exponential polynomial coefficient plays a key role in these results.

A Robust Indoor Localization Algorithm Based on Polynomial Fitting and Gaussian Mixed Model

Wireless sensor network(WSN)positioning has a good effect on indoor positioning,so it has received extensive attention in the field of positioning.Non-line-of sight(NLOS)is a primary challenge in indoor complex environment.In this paper,a robust localization algorithm based on Gaussian mixture model and fitting polynomial is proposed to solve the problem of NLOS error.Firstly,fitting polynomials are used to predict the measured values.The residuals of predicted and measured values are clustered by Gaussian mixture model(GMM).The LOS probability and NLOS probability are calculated according to the clustering centers.The measured values are filtered by Kalman filter(KF),variable parameter unscented Kalman filter(VPUKF)and variable parameter particle filter(VPPF)in turn.The distance value processed by KF and VPUKF and the distance value processed by KF,VPUKF and VPPF are combined according to probability.Finally,the maximum likelihood method is used to calculate the position coordinate estimation.Through simulation comparison,the proposed algorithm has better positioning accuracy than several comparison algorithms in this paper.And it shows strong robustness in strong NLOS environment.

A Note on Bell-Based Bernoulli and Euler Polynomials of Complex Variable

In this article,we construct the generating functions for new families of special polynomials including two parametric kinds of Bell-based Bernoulli and Euler polynomials.Some fundamental properties of these functions are given.By using these generating functions and some identities,relations among trigonometric functions and two parametric kinds of Bell-based Bernoulli and Euler polynomials,Stirling numbers are presented.Computational formulae for these polynomials are obtained.Applying a partial derivative operator to these generating functions,some derivative formulae and finite combinatorial sums involving the aforementioned polynomials and numbers are also obtained.In addition,some remarks and observations on these polynomials are given.

AN ALGEBRAIC APPROACH TO DEGENERATE APPELL POLYNOMIALS AND THEIR HYBRID FORMS VIA DETERMINANTS

It is remarkable that studying degenerate versions of polynomials from algebraic point of view is not limited to only special polynomials but can also be extended to their hybrid polynomials.Indeed for the first time,a closed determinant expression for the degenerate Appell polynomials is derived.The determinant forms for the degenerate Bernoulli and Euler polynomials are also investigated.A new class of the degenerate Hermite-Appell polynomials is investigated and some novel identities for these polynomials are established.The degenerate Hermite-Bernoulli and degenerate Hermite-Euler polynomials are considered as special cases of the degenerate Hermite-Appell polynomials.Further,by using Mathematica,we draw graphs of degenerate Hermite-Bernoulli polynomials for different values of indices.The zeros of these polynomials are also explored and their distribution is presented.

Duality between Bessel Functions and Chebyshev Polynomials in Expansions of Functions

In expansions of arbitrary functions in Bessel functions or Spherical Bessel functions, a dual partner set of polynomials play a role. For the Bessel functions, these are the Chebyshev polynomials of first kind and for the Spherical Bessel functions the Legendre polynomials. These two sets of functions appear in many formulas of the expansion and in the completeness and (bi)-orthogonality relations. The analogy to expansions of functions in Taylor series and in moment series and to expansions in Hermite functions is elaborated. Besides other special expansion, we find the expansion of Bessel functions in Spherical Bessel functions and their inversion and of Chebyshev polynomials of first kind in Legendre polynomials and their inversion. For the operators which generate the Spherical Bessel functions from a basic Spherical Bessel function, the normally ordered (or disentangled) form is found.

A Relationship between the Partial Bell Polynomials and Alternating Run Polynomials

In this note, we first derive an exponential generating function of the alternating run polynomials. We then deduce an explicit formula of the alternating run polynomials in terms of the partial Bell polynomials.

Obtaining Simply Explicit Form and New Properties of Euler Polynomials by Differential Calculus

Utilization of the shift operator to represent Euler polynomials as polynomials of Appell type leads directly to its algebraic properties, its relations with powers sums;may be all its relations with Bernoulli polynomials, Bernoulli numbers;its recurrence formulae and a very simple formula for calculating simultaneously Euler numbers and Euler polynomials. The expansions of Euler polynomials into Fourier series are also obtained;the formulae for obtaining all πm as series on k-m and for expanding functions into series of Euler polynomials.

Numerical Solutions of Fractional Variable Order Differential Equations via Using Shifted Legendre Polynomials

In this manuscript,an algorithm for the computation of numerical solutions to some variable order fractional differential equations(FDEs)subject to the boundary and initial conditions is developed.We use shifted Legendre polynomials for the required numerical algorithm to develop some operational matrices.Further,operational matrices are constructed using variable order differentiation and integration.We are finding the operationalmatrices of variable order differentiation and integration by omitting the discretization of data.With the help of aforesaid matrices,considered FDEs are converted to algebraic equations of Sylvester type.Finally,the algebraic equations we get are solved with the help of mathematical software like Matlab or Mathematica to compute numerical solutions.Some examples are given to check the proposed method’s accuracy and graphical representations.Exact and numerical solutions are also compared in the paper for some examples.The efficiency of the method can be enhanced further by increasing the scale level.

Zero distribution of some difference polynomials

In this paper,suppose that a,c∈C{0},c_(j)∈C(j=1,2,···,n) are not all zeros and n≥2,and f (z) is a finite order transcendental entire function with Borel finite exceptional value or with infinitely many multiple zeros,the zero distribution of difference polynomials of f (z+c)-af^(n)(z) and f (z)f (z+c_1)···f (z+c_n) are investigated.A number of examples are also presented to show that our results are best possible in a certain sense.

Comb-Based Filter Design Using Sharpening Technique and Certain Palindromic Polynomial

This paper presents a novel approach to improve aliasing rejection in comb-based decimation filters. The method is established on certain palindromic polynomials with all zeros on the unit circle and the sharpening technique. As a result, aliasing rejection and the passband characteristic are improved. The method is illustrated with various examples and compared with the methods from the literature. .

Onto Orthogonal Projections in the Space of Polynomials Pn[x]

In this article, I consider projection groups on function spaces, more specifically the space of polynomials Pn[x]. I will show that a very similar construct of projection operators allows us to project into the subspaces of Pn[x] where the function h ∈Pn[x] represents the closets function to f ∈Pn[x] in the least square sense. I also demonstrate that we can generalise projections by constructing operators i.e. in Rn+1 using the metric tensor on Pn[x]. This allows one to project a polynomial function onto another by mapping it to its coefficient vector in Rn+1. This can be also achieved with the Kronecker Product as detailed in this paper.

Estimating Sums of Convergent Series via Rational Polynomials

Sums of convergent series for any desired number of terms, which may be infinite, are estimated very accurately by establishing definite rational polynomials. For infinite number of terms the sum infinite is obtained by taking the asymptotic limit of the rational polynomial. A rational function with second-degree polynomials both in the numerator and denominator is found to produce excellent results. Sums of series with different characteristics such as alternating signs are considered for testing the performance of the proposed approach.

Structural Interval Reliability Algorithm Based on Bernstein Polynomials and Evidence Theory

Structural reliability is an important method to measure the safety performance of structures under the influence of uncertain factors.Traditional structural reliability analysis methods often convert the limit state function to the polynomial form to measure whether the structure is invalid.The uncertain parameters mainly exist in the form of intervals.This method requires a lot of calculation and is often difficult to achieve efficiently.In order to solve this problem,this paper proposes an interval variable multivariate polynomial algorithm based on Bernstein polynomials and evidence theory to solve the structural reliability problem with cognitive uncertainty.Based on the non-probabilistic reliability index method,the extreme value of the limit state function is obtained using the properties of Bernstein polynomials,thus avoiding the need for a lot of sampling to solve the reliability analysis problem.The method is applied to numerical examples and engineering applications such as experiments,and the results show that the method has higher computational efficiency and accuracy than the traditional linear approximation method,especially for some reliability problems with higher nonlinearity.Moreover,this method can effectively improve the reliability of results and reduce the cost of calculation in practical engineering problems.

Finite Element Orthogonal Collocation Approach for Time Fractional Telegraph Equation with Mamadu-Njoseh Polynomials

Finite element method (FEM) is an efficient numerical tool for the solution of partial differential equations (PDEs). It is one of the most general methods when compared to other numerical techniques. PDEs posed in a variational form over a given space, say a Hilbert space, are better numerically handled with the FEM. The FEM algorithm is used in various applications which includes fluid flow, heat transfer, acoustics, structural mechanics and dynamics, electric and magnetic field, etc. Thus, in this paper, the Finite Element Orthogonal Collocation Approach (FEOCA) is established for the approximate solution of Time Fractional Telegraph Equation (TFTE) with Mamadu-Njoseh polynomials as grid points corresponding to new basis functions constructed in the finite element space. The FEOCA is an elegant mixture of the Finite Element Method (FEM) and the Orthogonal Collocation Method (OCM). Two numerical examples are experimented on to verify the accuracy and rate of convergence of the method as compared with the theoretical results, and other methods in literature.

Optimizing Polynomial-Time Solutions to a Network Weighted Vertex Cover Game

Weighted vertex cover(WVC)is one of the most important combinatorial optimization problems.In this paper,we provide a new game optimization to achieve efficiency and time of solutions for the WVC problem of weighted networks.We first model the WVC problem as a general game on weighted networks.Under the framework of a game,we newly define several cover states to describe the WVC problem.Moreover,we reveal the relationship among these cover states of the weighted network and the strict Nash equilibriums(SNEs)of the game.Then,we propose a game-based asynchronous algorithm(GAA),which can theoretically guarantee that all cover states of vertices converging in an SNE with polynomial time.Subsequently,we improve the GAA by adding 2-hop and 3-hop adjustment mechanisms,termed the improved game-based asynchronous algorithm(IGAA),in which we prove that it can obtain a better solution to the WVC problem than using a the GAA.Finally,numerical simulations demonstrate that the proposed IGAA can obtain a better approximate solution in promising computation time compared with the existing representative algorithms.

On the Numerical Solution of Singular Integral Equation with Degenerate Kernel Using Laguerre Polynomials

In this paper, we derive a simple and efficient matrix formulation using Laguerre polynomials to solve the singular integral equation with degenerate kernel. This method is based on replacement of the unknown function by truncated series of well known Laguerre expansion of functions. This leads to a system of algebraic equations with Laguerre coefficients. Thus, by solving the matrix equation, the coefficients are obtained. Some numerical examples are included to demonstrate the validity and applicability of the proposed method.