Search

Let Pn denote the set of polynomials of the form ... with |a| ≤ 1 and |zk| ≥ 1 for 1 ≤ k ≤ n - m. For the polynomials of the form p(z) = z∏k=1n-1(z - zk), with |zk| ≥ 1, where 1 ≤ k ≤ n - 1, Brown [2] stated the problem "Find the best constant Cn such that p'(z) does not vanish in |z| < Cn". He also conjectured in the same paper that Cn = .... This problem was solved by Aziz and Zarger [1]. In this paper, we obtain the results which generalizes the results of Aziz and Zarger. [ABSTRACT FROM AUTHOR]

The paper is devoted to the investigation of problem of approximation of continuous periodic functions by trigonometric polynomials, which are generated by linear methods of summation of Fourier series. The simplest example of a linear approximation of periodic functions is the approximation of functions by partial sums of their Fourier series. However, the sequences of partial Fourier sums are not uniformly convergent over the class of continuous periodic functions. Therefore, many studies devoted to the research of the approximative properties of approximation methods, which are generated by transformations of the partial sums of Fourier series and allow us to construct sequences of trigonometrical polynomials that would be uniformly convergent for the whole class of continuous functions. Particularly, Fej'er sums have been widely studied recently. One of the important problems in this area is the study of asymptotic behavior of the sharp upper bounds over a given class of functions of deviations of the trigonometric polynomials. In the paper, we study upper asymptotic estimates for deviations between a function and the Fej'er means for the Fourier series of the function. The asymptotic behavior is considered for the functions represented by the Poisson integrals of periodic functions of a real variable. The mentioned classes consist of analytic functions of a real variable. These functions can be regularly extended into the corresponding strip of the complex plane. An asymptotic equality for the upper bounds of Fej'er means deviations on classes of Poisson integrals was obtained. [ABSTRACT FROM AUTHOR]

Nonrigid registration presents a significant challenge in the domain of point cloud processing. The general objective is to model complex nonrigid deformations between two or more overlapping point clouds. Applications are diverse and span multiple research fields, including registration of topographic data, scene flow estimation, and dynamic shape reconstruction. To provide context, the first part of the paper gives a general introduction to the topic of point cloud registration, including a categorization of existing methods. Then, a general mathematical formulation for the point cloud registration problem is introduced, which is then extended to address also nonrigid registration methods. A detailed discussion and categorization of existing approaches to nonrigid registration follows. In the second part of the paper, we propose a new method that uses piecewise tricubic polynomials for modeling nonrigid deformations. Our method offers several advantages over existing methods. These advantages include easy control of flexibility through a small number of intuitive tuning parameters, a closed-form optimization solution, and an efficient transformation of huge point clouds. We demonstrate our method through multiple examples that cover a broad range of applications, with a focus on remote sensing applications—namely, the registration of airborne laser scanning (ALS), mobile laser scanning (MLS), and terrestrial laser scanning (TLS) point clouds. The implementation of our algorithms is open source and can be found our public repository. [ABSTRACT FROM AUTHOR]

The Zhang–Zhang polynomial of a benzenoid system is a well-known counting polynomial that was introduced in 1996. It was designed to enumerate Clar covers, which are spanning subgraphs with only hexagons and edges as connected components. In 2018, the generalized Zhang–Zhang polynomial of two variables was defined such that it also takes into account 10-cycles of a benzenoid system. The aim of this paper is to introduce and study a new variation of the Zhang–Zhang polynomial for phenylenes, which are important molecular graphs composed of 6-membered and 4-membered rings. In our case, Clar covers can contain 4-cycles, 6-cycles, 8-cycles, and edges. Since this new polynomial has three variables, we call it the multivariable Zhang–Zhang (MZZ) polynomial. In the main part of the paper, some recursive formulas for calculating the MZZ polynomial from subgraphs of a given phenylene are developed and an algorithm for phenylene chains is deduced. Interestingly, computing the MZZ polynomial of a phenylene chain requires some techniques that are different to those used to calculate the (generalized) Zhang–Zhang polynomial of benzenoid chains. Finally, we prove a result that enables us to find the MZZ polynomial of a phenylene with branched hexagons. [ABSTRACT FROM AUTHOR]

In this paper, we propose a new method of applying the XOR and XNOR gates on exponentially large superpositions in Instantaneous Noise-Based Logic. These new gates are repeatable, and they can achieve an exponential speedup in computation with polynomial hardware complexity. [ABSTRACT FROM AUTHOR]

In this paper, we consider Tower of Hanoi graphs and study their matching properties. Explicit system of recurrences is derived for the matching polynomials of these graphs and their appropriate truncated variants. Consequently, we obtain exact formula for the numbers of maximum matchings in Hanoi graphs using matching polynomials, which is a new approach for old one problem. [ABSTRACT FROM AUTHOR]

It is undeniable that as vehicle ownership increases; developing countries are constantly dealing with serious issue of traffic accidents. The pavement distress issue is reported as an elementary road entity causing accidents. According to the statistics of the Road Traffic Injury Research and Prevention Centre (RTIR&PC) in Karachi, more than 50% of serious injuries occur due to road faults. This paper aims to develop a mechanism for the exploration of blackspots by inspecting the traffic accidents in Karachi city caused by road distresses. The mathematical analysis involved the Lagrange polynomial method while the screening of blackspots was carried out based on safety inspections. As of lack of technicalities and improved documentation, the paper presented an initiative of complete guidelines for safety audits and investigations specifically for developing countries like Pakistan. According to findings, around 87% locations are pertained with the ranking of blackspots highlighting the pavement problems of the city. [ABSTRACT FROM AUTHOR]

This paper investigates the significance of generating expressions, operational principles, and defining characteristics in the study and development of special polynomials. The focus is on a novel generalized family of degenerate 2D Appell polynomials, which were defined using a fractional operator. Motivated by inquiries into degenerate 2D bivariate Appell polynomials, this research reveals that well-known 2D Appell polynomials and simple Appell polynomials can be regarded as specific instances within this new family for certain values. This paper presents the operational rule, generating relation, determinant form, and recurrence relations for this generalized family. Furthermore, it explores the practical applications of these degenerate 2D Appell polynomials and establishes their connections with equivalent results for the generalized family of degenerate 2D Bernoulli, Euler, and Genocchi polynomials. [ABSTRACT FROM AUTHOR]

In this paper, we establish the clique connected common neighborhood polynomial of the graph resulting from the join of two connected graphs. [ABSTRACT FROM AUTHOR]

According to the Gauss–Lucas theorem, the critical points of a complex polynomial where always lie in the convex hull of its zeros. In this paper, we prove certain relations between the distribution of zeros of a polynomial and its critical points. Using these relations, we prove the well-known Sendov's conjecture for certain special cases. [ABSTRACT FROM AUTHOR]

The object of research in the paper is extrapolation problems based on interpolation polynomials. Polynomial-based prediction methods are well known. However, the problem is that such methods often give very large errors in practice. The permissible error of extrapolation even by one grid step is not ensured by the high accuracy of interpolation using polynomials. The paper proposes an algorithm that allows to significantly improve polynomial forecasts by optimizing the procedure for choosing the power of the polynomial, on the basis of which the forecast is built. The algorithm is based on the procedure for building all polynomial forecasts according to known data and analysis of these forecasts. In particular, the presence of monotonicity and a tendency to convergence allows determining the optimal degree of the polynomial. In the absence of monotonicity, provided that certain ratios are met, the forecast can be constructed as the arithmetic average of all polynomial forecasts. An important result is the estimation of the error of the forecasting method by averaging polynomial forecasts. The development of the algorithm became possible due to the use of a special method of constructing a one-step polynomial forecast. The method differs in that it allows to build a forecast without using the cumbersome procedure of calculating the unknown coefficients of the polynomial. The numerical results presented in the work demonstrate the effectiveness of the forecasting technique based on the average of polynomial forecasts. In particular, for the test functions, the relative error was about 2–5 %, while polynomials of different degrees in the worst case yielded more than 50 %. The obtained results can be useful for building shortterm forecasts of series of economic dynamics, forecasting the behavior of arbitrary processes with a dominant deterministic component. [ABSTRACT FROM AUTHOR]

Let A and B designate n×n matrices with coefficients in a field F. In this paper, we completely answer the following question: For A fixed, what are the possible characteristic polynomials of A+B, where B ranges over matrices of rank ≥ m? [ABSTRACT FROM AUTHOR]

We study the problem of describing the triples , , where is the (co)metric associated with a symmetric second-order differential operator defined on a domain of and such that there exists an orthonormal basis of consisting of polynomials which are eigenvectors of and this basis is compatible with the filtration of the space of polynomials by some weighted degree. In a joint paper of D. Bakry, M. Zani, and the author this problem was solved in dimension 2 for the usual degree. In the present paper we solve it still in dimension 2 but for a weighted degree with arbitrary positive weights. [ABSTRACT FROM AUTHOR]

In this paper, we present several new congruences on the q-trinomial coefficients introduced by Andrews and Baxter [J. Statist. Phys. 47 (1987), 297–330]. A new congruence on sums of central q-binomial coefficients is also established. [ABSTRACT FROM AUTHOR]

Stochastic rounding (SR) offers an alternative to the deterministic IEEE-754 floating-point rounding modes. In some applications such as PDEs, ODEs, and neural networks, SR empirically improves the numerical behavior and convergence to accurate solutions while the theoretical background remains partial. Recent works by Ipsen, Zhou, Higham, and Mary have computed SR probabilistic error bounds for basic linear algebra kernels. For example, the inner product SR probabilistic bound of the forward error is proportional to √nu instead of nu for the default rounding mode. To compute the bounds, these works show that the errors accumulated in computation form a martingale. This paper proposes an alternative framework to characterize SR errors based on the computation of the variance. We pinpoint common error patterns in numerical algorithms and propose a lemma that bounds their variance. For each probability and through the Bienaymé-Chebyshev inequality, this bound leads to a better probabilistic error bound in several situations. Our method has the advantage of providing a tight probabilistic bound for all algorithms fitting our model. We show how the method can be applied to give SR error bounds for the inner product and Horner polynomial evaluation. [ABSTRACT FROM AUTHOR]

In this paper, we introduce type 2 degenerate poly-Euler polynomials and numbers, briefly called degenerate poly-Euler polynomials and numbers, by using the modified degenerate polyexponential function and derive several properties on these polynomials and numbers. In the last section, we also consider the type 2 degenerate unipoly-Euler polynomials attached to an arithmetic function, by using the modified degenerate polyexponential function and investigate some identities of these polynomials. In particular, we give some new explicit expressions and identities of degenerate unipoly polynomials related to special numbers and polynomials. [ABSTRACT FROM AUTHOR]

In this article, we present the generalized ρ dependent polynomials for the calculations of eccentricity, distance, total distance, and degree-based topological indices of the identity graph of Zρ. This is a thorough work in which we present many topological indices and coindices as ρ dependent polynomials. The polynomials presented here can play a key role in the further development of the theory of topological indies for commutative rings. This paper presents a brand new approach to generalizing the topological indices because instead of the traditional way. A set-theoretic method is introduced here that can be very helpful and game-changing in the field of algebraic graph theory first of all sets of vertices for the identity graph of the commutative ring Zρ are partitioned into various sets, which makes it easier to generalize the degrees, distances, and eccentricities of this graph. This paper presents various results that make it easier to generalize the topological indices of the identity graph of Zρ. [ABSTRACT FROM AUTHOR]

We consider random orthonormal polynomials \begin{equation*} F_{n}(x)=\sum _{i=0}^{n}\xi _{i}p_{i}(x), \end{equation*} where \xi _{0}, ..., \xi _{n} are independent random variables with zero mean, unit variance and uniformly bounded (2+\varepsilon) moments, and (p_n)_{n=0}^{\infty } is the system of orthonormal polynomials with respect to a fixed compactly supported measure on the real line. Under mild technical assumptions satisfied by many classes of classical polynomial systems, we establish universality for the leading asymptotics of the average number of real roots of F_n, both globally and locally. Prior to this paper, these results were known only for random orthonormal polynomials with Gaussian coefficients (see D. D. Lubinsky, I. E. Pritsker, and X. Xie [Proc. Amer. Math. Soc. 144 (2016), pp. 1631–1642]) using the Kac-Rice formula, a method that does not extend to the generality of our paper. [ABSTRACT FROM AUTHOR]

Initial conditions can have a substantial impact on the behavior of iterative root-finding techniques for nonlinear equations. By allowing complex starting points and complex roots, it is possible to examine the basins of attraction in the complex plane in order to compare the performance of various iterative techniques. In this paper, a one-parameter family of third-order root-finding methods is studied by varying its parameter A within −2.0 and 2.4 and applying it to a polynomial equation of high degree (degree 25). This family includes the Euler–Chebyshev's (A = 0), Halley's (A = 1) and BSC (A = 2) techniques. According to the results, the one-parameter family provides the best performance for values near A = 1, which equals to the Halley's method. [ABSTRACT FROM AUTHOR]

In this short paper, I recall the history of dealing with the lack of compactness of a sequence in the case of an unbounded domain and prove the vanishing Lions-type result for a sequence of Lebesgue-measurable functions. This lemma generalizes some results for a class of Orlicz–Sobolev spaces. What matters here is the behavior of the integral, not the space. [ABSTRACT FROM AUTHOR]

In this paper, we investigate the root distribution of the Ehrhart polynomials of lattice polytopes. When the lattice polytope is reflexive, the roots of the Ehrhart polynomial distribute symmetrically with respect to the line Re (z) = − 1 2 . A special case of this distribution is when all the roots lie on this line. Our main concern is to find out which reflexive polytopes satisfy this special condition. Such lattice polytopes are called CL-polytopes. Another special case opposite to this is when all the roots are real. Such lattice polytopes are called real polytopes. The first topic of this paper is the Ehrhart polynomials of equatorial spheres, which are related to graded posets. We discuss the CL-ness of the equatorial Ehrhart polynomials for complete graded posets and zig-zag posets. The second topic is to investigate the relation of the root distribution of the Ehrhart polynomials of a reflexive polytope Q and its dual Q ∨ . We discuss the CL-ness and realness of Q and Q ∨ in pair, of dimensions up to 4. Throughout this paper, we investigate these problems by computer calculation. [ABSTRACT FROM AUTHOR]

The set of polynomial mappings of n-dimensional complex space into itself the Jacobian matrix of which has a constant nonzero determinant is known to be very vast in any dimension that exceeds one. The well-known Jacobian conjecture states that any such mapping is polynomially invertible. Even though the computation of the determinant of the Jacobian matrix is very well supported in modern computer algebra systems, the algorithmic inversion of a polynomial mapping is still a problem of considerable computational complexity. In this paper, we present a Mathematica package JC that can be used for construction and inversion of polynomial mappings and more general analytic mappings with the unit determinant of the Jacobian matrix. The package includes functions that allow one to algorithmically construct these mappings for a given dimension of the space of variables and a given degree of mapping components. The package, together with a library of datasets for testing it and results of computational experiments, is available for free public use at https://www.researchgate.net/publication/358409332_JC_Package_and_Datasets. [ABSTRACT FROM AUTHOR]

Copyright of Rad HAZU: Matematicke Znanosti is the property of Croatian Academy of Sciences & Arts (HAZU) and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

The paper deals with a certain trinomial with two strictly complex coefficients. The root locus technique is utilized to obtain a distribution of roots with respect to a unit circle in the complex plane. A number of roots inside the unit disk is described in a relation with the two parameter values. Several appropriate graphs illustrate the trinomial roots distribution in particular cases. [ABSTRACT FROM AUTHOR]

In this paper, we consider polynomial composites with the coefficients from K ⊂ L. We already know many properties, but we do not know the answer to the question of whether there is a relationship between composites and field extensions. We present the characterization of some known field extensions in terms of polynomial composites. This paper contains the open problem of characterization of ideals in polynomial composites with respect to various field extensions. We also present the full possible characterization of certain field extensions. Moreover, in this paper we show that any finite group is a Galois group of some field extensions and present the inverse Galois problem solved. [ABSTRACT FROM AUTHOR]

This paper presents planning of smooth trajectories using the asymmetric profiles of displacement, velocity, acceleration and jerk of described higher degree polynomials. The presented way of determination of polynomial and asymmetry coefficients as well as motion time includes the procedure at both constraints of single kinematic quantities, i.e., velocity, acceleration, jerk and introducing a few constraints simultaneously. Moreover, the paper presents a method of planning trajectories with intermediate points consisting in concatenation of the analyzed polynomials. The proposed method of trajectory planning was compared to that of using the S-curve. The results in the form of kinematic quantity courses are presented graphically. The discussed method guarantees continuity of displacement, velocity, acceleration and jerk. It can be used for planning trajectories of various technical objects (e.g., manipulators, mobile robots, CNC machine tools, optical disk drives, autonomous vehicles, etc.). [ABSTRACT FROM AUTHOR]

Machine learning potentials (MLPs) developed from extensive datasets constructed from density functional theory calculations have become increasingly appealing to many researchers. This paper presents a framework of polynomial-based MLPs, called polynomial MLPs. The systematic development of accurate and computationally efficient polynomial MLPs for many elemental and binary alloy systems and their predictive powers for various properties are also demonstrated. Consequently, many polynomial MLPs are available in a repository website [A. Seko, Polynomial Machine Learning Potential Repository at Kyoto University, https://sekocha.github.io]. The repository will help many scientists perform accurate and efficient large-scale atomistic simulations and crystal structure searches. [ABSTRACT FROM AUTHOR]

Seniority-zero geminal wavefunctions are known to capture bond-breaking correlation. Among this class of wavefunctions, Richardson–Gaudin states stand out as they are eigenvectors of a model Hamiltonian. This provides a clear physical picture, clean expressions for reduced density matrix (RDM) elements, and systematic improvement (with a complete set of eigenvectors). Known expressions for the RDM elements require the computation of rapidities, which are obtained by first solving for the so-called eigenvalue based variables (EBV) and then root-finding a Lagrange interpolation polynomial. In this paper, we obtain expressions for the RDM elements directly in terms of the EBV. The final expressions can be computed at the same cost as the rapidity expressions. Therefore, except, in particular, circumstances, it is entirely unnecessary to compute rapidities at all. The RDM elements require numerically inverting a matrix, and while this is usually undesirable, we demonstrate that it is stable, except when there is degeneracy in the single-particle energies. In such cases, a different construction would be required. [ABSTRACT FROM AUTHOR]

In this paper, we study bounds for the total variation distance between distributions of second order polynomials in normal random variables provided that they essentially depend on at least three variables. Moreover, we partially extend some recent bounds for the Kolmogorov distance between the distributions of norms of Gaussian random vectors to the case of the total variation distance. [ABSTRACT FROM AUTHOR]

In this paper, we develop the theoretical provisions of symmetric cryptographic algorithms based on the polynomial residue number system for the first time. The main feature of the proposed approach is that when reconstructing the polynomial based on the method of undetermined coefficients, multiplication is performed not on the found base numbers but on arbitrarily selected polynomials. The latter, together with pairwise coprime residues of the residue class system, serve as the keys of the cryptographic algorithm. Schemes and examples of the implementation of the developed polynomial symmetric encryption algorithm are presented. The analytical expressions of the cryptographic strength estimation are constructed, and their graphical dependence on the number of modules and polynomial powers is presented. Our studies show that the cryptanalysis of the proposed algorithm requires combinatorial complexity, which leads to an NP-complete problem. [ABSTRACT FROM AUTHOR]

This paper is devoted to some selected topics of the theory of special orthogonal group SO(3). First, we discuss the trace of orthogonal matrices and its relation to the characteristic polynomial; on this basis, the partition of SO(3) formed by conjugation classes is described by trace mapping. Second, we show that every special orthogonal matrix can be expressed as the product of three elementary special orthogonal matrices. Explicit formulas for the decomposition as needed for applications in differential geometry and physics as symmetry transformations are given. [ABSTRACT FROM AUTHOR]

In the quest for robust and efficient digital communication, this paper introduces cutting-edge key exchange protocols leveraging the computational prowess of tropical semirings and the structural resilience of block matrices. 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, while using block matrices enhances our protocols' security profile. The security of these protocols relies on the Matrix Decomposition Problem. In addition, we 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, is specifically tailored for demanding engineering applications, and sets a new standard in secure and efficient digital communication. [ABSTRACT FROM AUTHOR]

Purpose: This study aims to treat a novel system of Volterra integro-differential equations with multiple delays and variable bounds, constituting a generic numerical method based on the matrix equation and a combinatoric-parametric Charlier polynomials. The proposed method utilizes these polynomials for the matrix relations at the collocation points. Design/methodology/approach: Thanks to the combinatorial eligibility of the method, the functional terms can be transformed into the generic matrix relations with low dimensions, and their resulting matrix equation. The obtained solutions are tested with regard to the parametric behaviour of the polynomials with $\alpha$, taking into account the condition number of an outcome matrix of the method. Residual error estimation improves those solutions without using any external method. A calculation of the residual error bound is also fulfilled. Findings: All computations are carried out by a special programming module. The accuracy and productivity of the method are scrutinized via numerical and graphical results. Based on the discussions, one can point out that the method is very proper to solve a system in question. Originality/value: This paper introduces a generic computational numerical method containing the matrix expansions of the combinatoric Charlier polynomials, in order to treat the system of Volterra integro-differential equations with multiple delays and variable bounds. Thus, the method enables to evaluate stiff differential and integral parts of the system in question. That is, these parts generates two novel components in terms of unknown terms with both differentiated and delay arguments. A rigorous error analysis is deployed via the residual function. Four benchmark problems are solved and interpreted. Their graphical and numerical results validate accuracy and efficiency of the proposed method. In fact, a generic method is, thereby, provided into the literature. [ABSTRACT FROM AUTHOR]

In this paper, we analyze a hybridizable discontinuous Galerkin method for the Helmholtz equation with large wave number, which uses piecewise polynomials of degree of p ≥ 1 to approximate the potential u and its traces and piecewise polynomials of degree of p - 1 for the flux q. It is proved that ... and ... hold under the conditions that k(kh)2p is sufficiently small and that the penalty parameter ..., where h is the mesh size. Numerical experiments are proposed to verify our theoretical findings and to show that the pollution error may be greatly reduced by tuning the penalty parameter. [ABSTRACT FROM AUTHOR]

This paper presents the generalized Pell p-numbers and provides some related results. A new sequence is defined using the characteristic polynomial of the Pell p-numbers and generalized Mersenne numbers. Two algorithms for Diffie-Hellman key exchange are given as an application of these sequences. They are illustrated via numerical examples and shown to be secure against attacks. Thus, these new sequences are practical for encryption and constructing private keys. [ABSTRACT FROM AUTHOR]