Search

Self-interference (SI) represents a bottleneck in the performance of full-duplex (FD) communication systems, necessitating robust offsetting techniques to unlock the potential of FD systems. Currently, deep learning has been leveraged within the communication domain to address specific challenges and enhance efficiency. Inspired by this, this paper reviews the self-interference cancellation (SIC) process in the digital domain focusing on SIC capability. The paper introduces a model architecture that integrates CNN and gated recurrent unit (GRU), while also incorporating residual networks and self-attention mechanisms to enhance the identification and elimination of SI. This model is named CGRSA-Net. Firstly, CNN is employed to capture local signal features in the time–frequency domain. Subsequently, a ResNet module is introduced to mitigate the gradient vanishing problem. Concurrently, GRU is utilized to dynamically capture and retain both long- and short-term dependencies during the communication process. Lastly, by integrating the self-attention mechanism, attention weights are flexibly assigned when processing sequence data, thereby focusing on the most important parts of the input sequence. Experimental results demonstrate that the proposed CGRSA-Net model achieves a minimum of 28% improvement in nonlinear SIC capability compared to polynomial and existing neural network-based eliminator. Additionally, through ablation experiments, we demonstrate that the various modules utilized in this paper effectively learn signal features and further enhance SIC performance. [ABSTRACT FROM AUTHOR]

Fuzzy logic is becoming one of the most-influential fields of modern mathematics with applications that impact not only other sciences, but society in general. This newly found interest in fuzzy logic is in part due to the crucial role it plays in the development of artificial intelligence. As a result, new tools and practices for the development of the above-mentioned field are in high demand. This is one of the issues this paper was composed to address. To be more specific, a sizable part of fuzzy logic is the study of fuzzy connectives. However, the current method used to generalize them is restricted to the use of basic automorphisms, which hinders the creation of new fuzzy connectives. For this reason, in this paper, a new method of generalization is conceived of that aims to generalize the fuzzy connectives using polynomial automorphism functions instead. The creation of these automorphisms is achieved through numerical analysis, an endeavor that is supported with programming applications that, using mathematical modeling, validate and visualize the research. Furthermore, the automorphisms satisfy all the necessary criteria that have been established for use in the generalization process and, consequently, are used to successfully generalize fuzzy connectives. The result of the new generalization method is the creation of new usable and flexible fuzzy connectives, which is very promising for the future development of the field. [ABSTRACT FROM AUTHOR]

Monogenity is a classical area of algebraic number theory that continues to be actively researched. This paper collects the results obtained over the past few years in this area. Several of the listed results were presented at a series of online conferences titled "Monogenity and Power Integral Bases". We also give a collection of the most important methods used in several of these papers. A list of open problems for further research is also given. [ABSTRACT FROM AUTHOR]

This paper introduces the operational rule for 2-iterated 2D Appell polynomials and derives its generalized form using fractional operators. It also presents the generating relation and explicit forms that characterize the generalized 2-iterated 2D Appell polynomials. Additionally, it establishes the monomiality principle for these polynomials and obtains their recurrence relations. The paper also establishes corresponding results for the generalized 2-iterated 2D Bernoulli, 2-iterated 2D Euler, and 2-iterated 2D Genocchi polynomials. [ABSTRACT FROM AUTHOR]

This paper presents an overview of cosine and sine Apostol-type Frobenius–Euler–Fibonacci polynomials, as well as several identities that are associated with these polynomials. By applying a partial derivative operator to the generating functions, the authors obtain derivative formulae and finite combinatorial sums involving these polynomials and numbers. Additionally, the paper establishes connections between cosine and sine Apostol-type Frobenius–Euler–Fibonacci polynomials of order α and several other polynomial sequences, such as the Apostol-type Bernoulli–Fibonacci polynomials, the Apostol-type Euler–Fibonacci polynomials, the Apostol-type Genocchi–Fibonacci polynomials, and the Stirling–Fibonacci numbers of the second kind. The authors also provide computational formulae and graphical representations of these polynomials using the Mathematica program. [ABSTRACT FROM AUTHOR]

Orthogonal polynomials and their moments serve as pivotal elements across various fields. Discrete Krawtchouk polynomials (DKraPs) are considered a versatile family of orthogonal polynomials and are widely used in different fields such as probability theory, signal processing, digital communications, and image processing. Various recurrence algorithms have been proposed so far to address the challenge of numerical instability for large values of orders and signal sizes. The computation of DKraP coefficients was typically computed using sequential algorithms, which are computationally extensive for large order values and polynomial sizes. To this end, this paper introduces a computationally efficient solution that utilizes the parallel processing capabilities of modern central processing units (CPUs), namely the availability of multiple cores and multithreading. The proposed multi-threaded implementations for computing DKraP coefficients divide the computations into multiple independent tasks, which are executed concurrently by different threads distributed among the independent cores. This multi-threaded approach has been evaluated across a range of DKraP sizes and various values of polynomial parameters. The results show that the proposed method achieves a significant reduction in computation time. In addition, the proposed method has the added benefit of applying to larger polynomial sizes and a wider range of Krawtchouk polynomial parameters. Furthermore, an accurate and appropriate selection scheme of the recurrence algorithm is introduced. The proposed approach introduced in this paper makes the DKraP coefficient computation an attractive solution for a variety of applications. [ABSTRACT FROM AUTHOR]

The first part of this work provides explicit solutions for two integral equations; both are solved by means of Fourier transform. In the second part of this paper, sufficient conditions for the existence and uniqueness of the solutions satisfying sandwich constraints for two types of full moment problems are provided. The only given data are the moments of all positive integer orders of the solution and two other linear, not necessarily positive, constraints on it. Under natural assumptions, all the linear solutions are continuous. With their value in the subspace of polynomials being given by the moment conditions, the uniqueness follows. When the involved linear solutions and constraints are positive, the sufficient conditions mentioned above are also necessary. This is achieved in the third part of the paper. All these conditions are written in terms of quadratic expressions. [ABSTRACT FROM AUTHOR]

Polynomial multiplication is the most computationally expensive part of the lattice-based cryptography algorithm. However, the existing acceleration schemes have problems, such as low performance and high hardware resource overhead. Based on the polynomial multiplication of number theoretic transformation (NTT), this paper proposed a simple element of Montgomery module reduction with pipeline structure to realize fast module multiplication. In order to improve the throughput of the NTT module, the block storage technology is used in the NTT hardware module to enable the computing unit to read and write data alternately. Based on the NTT hardware module, a precalculated parameter storage and real-time calculation method suitable for the hardware architecture of this paper is also proposed. Finally, the hardware of polynomial multiplier based on NTT module is implemented, and its function simulation and performance evaluation are carried out. The results show that the proposed hardware accelerator can have excellent computing performance while using fewer hardware resources, thus meeting the requirements of lattice cipher algorithms in security chips. Compared with the existing studies, the computing performance of the polynomial multiplier designed in this paper is improved by approximately 1 to 3 times, and the slice resources and storage resources used are reduced by approximately 60% and 17%, respectively. [ABSTRACT FROM AUTHOR]

COPA, introduced by Andreeva et al., is the first online authenticated encryption (AE) mode with nonce-misuse resistance, and it is covered in COLM, which is one of the final CAESAR portfolios. However, COPA has been proven to be insecure in the releasing unverified plaintext (RUP) setting. This paper mainly focuses on the integrity under RUP (INT-RUP) defect of COPA. Firstly, this paper revisits the INT-RUP security model for adaptive adversaries, investigates the possible factors of INT-RUP insecurity for "Encryption-Mix-Encryption"-type checksum-based AE schemes, and finds that these AE schemes with INT-RUP security vulnerabilities utilize a common poor checksum technique. Then, this paper introduces an improved checksum technique named polynomial intermediate checksum (PIC) for INT-RUP security and emphasizes that PIC is a sufficient condition for guaranteeing INT-RUP security for "Encryption-Mix-Encryption"-type checksum-based AE schemes. PIC is generated by a polynomial sum with full terms of intermediate internal states, which guarantees no information leakage. Moreover, PIC ensures the same level between the plaintext and the ciphertext, which guarantees that the adversary cannot obtain any useful information from the unverified decryption queries. Again, based on PIC, this paper proposes a modified scheme COPA-PIC to fix the INT-RUP defect of COPA. COPA-PIC is proven to be INT-RUP up to the birthday-bound security if the underlying primitive is secure. Finally, this paper discusses the properties of COPA-PIC and makes a comparison for AE modes with distinct checksum techniques. The proposed work is of good practical significance. In an interactive system where two parties communicate, the receiver can effectively determine whether the information received from the sender is valid or not, and thus perform the subsequent operation more effectively. [ABSTRACT FROM AUTHOR]

This paper considers the interactive effects between the ego vehicle and other vehicles in a dynamic driving environment and proposes an autonomous vehicle lane-changing behavior decision-making and trajectory planning method based on graph convolutional networks (GCNs) and multi-segment polynomial curve optimization. Firstly, hierarchical modeling is applied to the dynamic driving environment, aggregating the dynamic interaction information of driving scenes in the form of graph-structured data. Graph convolutional neural networks are employed to process interaction information and generate ego vehicle's driving behavior decision commands. Subsequently, collision-free drivable areas are constructed based on the dynamic driving scene information. An optimization-based multi-segment polynomial curve trajectory planning method is employed to solve the optimization model, obtaining collision-free motion trajectories satisfying dynamic constraints and efficiently completing the lane-changing behavior of the vehicle. Finally, simulation and on-road vehicle experiments are conducted for the proposed method. The experimental results demonstrate that the proposed method outperforms traditional decision-making and planning methods, exhibiting good robustness, real-time performance, and strong scenario generalization capabilities. [ABSTRACT FROM AUTHOR]

This paper investigates various aspects of the distribution of roots and critical points of a complex polynomial, including their variance and the relationships between their moduli using an inequality due to de Bruijn. Making use of two other inequalities-again due to de Bruijn-we derive two probabilistic results concerning upper bounds for the average moduli of the imaginary parts of zeros and those of critical points, assuming uniform distribution of the zeros over a unit disc and employing the Markov inequality. The paper also provides an explicit formula for the variance of the roots of a complex polynomial for the case when all the zeros are real. In addition, for polynomials with uniform distribution of roots over the unit disc, the expected variance of the zeros is computed. Furthermore, a bound on the variance of the critical points in terms of the variance of the zeros of a general polynomial is derived, whereby it is established that the variance of the critical points of a polynomial cannot exceed the variance of its roots. Finally, we conjecture a relation between the real parts of the zeros and the critical points of a polynomial. [ABSTRACT FROM AUTHOR]

The present paper addresses linear parameter-varying systems with high-order time-varying parameter dependency known as polynomial LPV systems and their controller design. Throughout this work, a procedure ensuring a state-feedback controller from a parameterized linear matrix inequality (PLMI) solution is presented. As the main contribution of this paper, the controller is designed by considering the time-varying parameter rate as a tuning parameter with a continuous control gain in such a way that the closed-loop eigenvalues lie in a complex plane subset, with high-order time-varying parameters defining the system dynamics. Simulation results are presented, aiming to show the effectiveness of the proposed controller design. [ABSTRACT FROM AUTHOR]

China aims to reduce carbon dioxide emissions and achieve peak carbon and carbon neutrality goals. Natural gas, as a high-quality fossil fuel energy, is an important transition resource for China in the process of carbon reduction, so it is necessary to predict China's natural gas demand. In this paper, a novel natural gas demand combination forecasting model is constructed to accurately predict the future natural gas demand. The Lasso model and the polynomial model are used to build a combinatorial model, which overcomes the shortcomings of traditional models, which have low data dimensions and poor prediction abilities. In the modeling process, the cross-validation method is used to adjust the modeling parameters. By comparing the performance of the combinatorial forecasting model, the single forecasting model and other commonly used forecasting models, the results show that the error (2.99%) of the combinatorial forecasting model is the smallest, which verifies the high accuracy and good stability advantages of the combinatorial forecasting model. Finally, the paper analyzes the relevant data from 1999 to 2022 and predicts China's natural gas demand in the next 10 years. The results show that the annual growth rate of China's natural gas demand in the next 10 years will reach 13.33%, at 8.3 × 1011 m3 in 2033, which proves that China urgently needs to rapidly develop the gas supply capacity of gas supply enterprises. This study integrates the impact of multiple factors on the natural gas demand, predicts China's natural gas demand from 2023 to 2033, and provides decision-making support for China's energy structure adjustment and natural gas import trade. [ABSTRACT FROM AUTHOR]

In this paper, we develop a novel method to construct Goethals–Seidel (GS) sequences with special structures. In the existing methods, utilizing Turyn sequences is an effective and convenient approach; however, this method cannot cover all GS sequences. Motivated by this, we are devoted to designing some sequences that can potentially construct all GS sequences. Firstly, it is proven that a quad of ± 1 polynomials can be considered a linear combination of eight polynomials with coefficients uniquely belonging to { 0 , ± 1 } . Based on this fact, we change the construction of a quad of Goethals–Seidel sequences to find eight sequences consisting of 0 and ± 1 . One more motivation is to obtain these sequences more efficiently. To this end, we make use of the k-block, of which some properties of (anti) symmetry are discussed. After this, we can then look for the sequences with the help of computers since the symmetry properties facilitate reducing the search range. Moreover, we find that one of the eight blocks, which we utilize to construct GS sequences directly, can also be combined with Williamson sequences to generate GS sequences with more order. Several examples are provided to verify the theoretical results. The main contribution of this work is in building a bridge linking the GS sequences and eight polynomials, and the paper also provides a novel insight through which to consider the existence of GS sequences. [ABSTRACT FROM AUTHOR]

It is well known that in C [ X ] , the product of two polynomials is equal to the product of their greatest common divisor and their least common multiple. In a recent paper, we proved a similar relation between the ranks of matrix polynomials. More precisely, the sum of the ranks of two matrix polynomials is equal to the sum of the rank of the greatest common divisor of the polynomials applied to the respective matrix and the rank of the least common multiple of the polynomials applied to the respective matrix. In this paper, we present three new proofs for this result. In addition to these, we present two more applications. [ABSTRACT FROM AUTHOR]

In the current distributed environment, reversible data hiding in encrypted domain (RDH-ED) cannot grant corresponding privileges according to users' identity classes. To address this issue, this paper proposes a hierarchical authorization structure embedding scheme based on secret image sharing (SIS) and users' hierarchical identities. In the first embedding, the polynomial coefficient redundancy generated in the encryption process of the SIS is utilized by the image owner. For the second, the participants are categorized into two parts. One is core users with adaptive difference reservation embedding, and the other is ordinary users with pixel bit replacement embedding. At the time of reconstruction, more than one core user must provide pixel differences, which grants more privileges to core users. The experimental results demonstrate that the average embedding rate (ER) of the test images is 4.3333 bits per pixel (bpp) in the (3, 4) threshold scheme. Additionally, the reconstructed image achieves a PSNR of +∞ and an SSIM of 1. Compared to existing high-performance RDH-ED schemes based on secret sharing, the proposed scheme with a larger ER maintains strong security and reversibility. Moreover, it is also suitable for multiple embeddings involving multilevel participant identities. In conclusion, the results underscore the efficacy of our technique in achieving both security and performance objectives within a complex distributed setting. [ABSTRACT FROM AUTHOR]

The precise thermal control of aerial cameras is crucial for the acquisition of high-resolution imagery, and an accurate temperature prediction is essential to achieve this. This paper presents a methodology for modifying thermal network models to improve the accuracy of temperature prediction for aerial cameras. Seven types of thermal parameters are extracted from the thermal network model, and a thermally sensitive analysis identifies eleven key parameters to streamline the processing time. Departing from traditional methods that rely on steady-state data, this study conducts transient thermal tests and leverages polynomial fitting to facilitate thorough parameter modification. To ensure data reliability, the Monte-Carlo algorithm is employed to explore the parameter spaces of key parameters, analyzing temperature errors. Subsequently, the Least-Squares method is utilized to obtain optimal estimates of the key parameter values. As a result, the updated model demonstrates significantly improved accuracy in temperature predictions, achieving a reduction in the maximum absolute error between the predicted and experimental results from 22 °C to 4 °C, and a lowering of the relative error from 33.8% to 6.1%. The proposed modification method validates its effectiveness in modeling and enhancing the precision of thermal network models for aerial cameras. [ABSTRACT FROM AUTHOR]

This paper proposes the use of a polynomial code for synthesizing self-checking digital devices. The code is chosen for its error detection characteristics in data symbols and is used for Boolean signals correction in embedded control circuits. In practice, it is possible to equip the device with the ability to detect faults. In contrast to the approaches found in the world literature to solve this problem, this proposal suggests identifying groups of structurally independent outputs to distinguish between convertible and non-convertible outputs of the diagnosed block in the embedded control circuit. The only outputs that can be converted are those that are used as checking symbols for the polynomial code in the embedded control circuit. The other functions remain unchanged. The polynomial codes are used to select them. The authors present algorithms for synthesizing fault detection devices using the proposed approach. [ABSTRACT FROM AUTHOR]

This paper analyzes a novel use of the shifted Fibonacci polynomials (SFPs) to treat the time-fractional Burgers equation (TFBE). We first develop the fundamental formulas of these polynomials, which include their power series representation and the inversion formula. We establish other new formulas for the SFPs, including integer and fractional derivatives, in order to design the collocation approach for treating the TFBE. These derivative formulas serve as tools that aid in constructing the operational metrics for the integer and fractional derivatives of the SFPs. We use these matrices to transform the problem and its underlying conditions into a system of nonlinear equations that can be treated numerically. An error analysis is analyzed in detail. We also present three illustrative numerical examples and comparisons to test our proposed algorithm. These results showed that the proposed algorithm is advantageous since highly accurate approximate solutions can be obtained by choosing a few terms of retained modes of SFPs. [ABSTRACT FROM AUTHOR]

Today, the Ising model is an archetype describing collective ordering processes. As such, it is widely known in physics and far beyond. Less known is the fact that the thesis defended by Ernst Ising 100 years ago (in 1924) contained not only the solution of what we call now the 'classical 1D Ising model' but also other problems. Some of these problems, as well as the method of their solution, are the subject of this note. In particular, we discuss the combinatorial method Ernst Ising used to calculate the partition function for a chain of elementary magnets. In the thermodynamic limit, this method leads to the result that the partition function is given by the roots of a certain polynomial. We explicitly show that 'Ising's roots' that arise within the combinatorial treatment are also recovered by the eigenvalues of the transfer matrix, a concept that was introduced much later. Moreover, we discuss the generalization of the two-state model to a three-state one presented in Ising's thesis, which is not included in his famous paper of 1925 (E. Ising, Z. Physik 31 (1925) 253). The latter model can be considered as a forerunner of the now-abundant models with many-component order parameters. [ABSTRACT FROM AUTHOR]

The utilization of time-fractional PDEs in diverse fields within science and technology has attracted significant interest from researchers. This paper presents a relatively new numerical approach aimed at solving two-term time-fractional PDE models in two and three dimensions. We combined the Liouville–Caputo fractional derivative scheme with the Strang splitting algorithm for the temporal component and employed a meshless technique for spatial derivatives utilizing Lucas and Fibonacci polynomials. The rising demand for meshless methods stems from their inherent mesh-free nature and suitability for higher dimensions. Moreover, this approach demonstrates the effective approximation of solutions across both regular and irregular domains. Error norms were used to assess the accuracy of the methodology across both regular and irregular domains. A comparative analysis was conducted between the exact solution and alternative numerical methods found in the contemporary literature. The findings demonstrate that our proposed approach exhibited better performance while demanding fewer computational resources. [ABSTRACT FROM AUTHOR]

Spinors are important objects in physics, which have found their place more and more after the discovery that particles have an intrinsic angular momentum shape and Cartan's mathematical expression of this situation. Recent studies using special number sequences have also revealed a new approach to the use of spinors in mathematics and have provided a different perspective for spinor research that can be used as a source for future physics studies. The purpose of this work is to expand the generalized Fibonacci quaternion polynomials to the generalized Fibonacci polynomial spinors by associating spinors with quaternions, and to introduce and investigate a new polynomial sequence that can be used to benefit from the potential advantages of spinors in physical applications, and thus, to provide mathematical arguments, such as new polynomials, for studies using spinors and quaternions in quantum mechanics. Starting from this point of view, in this paper we introduce and investigate a new family of sequences called generalized Fibospinomials (or generalized Fibonacci polynomial spinors or Horadam polynomial spinors). Being particular cases, we use (r , s) -Fibonacci and (r , s) -Lucas polynomial spinors. We present Binet's formulas, generating functions and the summation formulas for these polynomials. In addition, we obtain some special identities of these new sequences and matrices related to these polynomials. The importance of this study is that generalized Fibospinomials are currently the most generalized sequence in the literature when moving from Fibonacci quaternions to spinor structure, and that a wide variety of new spinor sequences can be obtained from this particular polynomial sequence. [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]

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]

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]

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]

Graph polynomials is one of the important research directions in mathematical chemistry. The coefficients of some graph polynomials, such as matching polynomial and permanental polynomial, are related to structural properties of graphs. The Hosoya index of a graph is the sum of the absolute value of all coefficients for the matching polynomial. And the permanental sum of a graph is the sum of the absolute value of all coefficients of the permanental polynomial. In this paper, we characterize the second to sixth minimal Hosoya indices of all bicyclic graphs. Furthermore, using the results, the second to sixth minimal permanental sums of all bicyclic graphs are also characterized. [ABSTRACT FROM AUTHOR]

Accurate and fast traffic prediction is the data-based foundation for achieving traffic control and management, and the accuracy of prediction results will directly affect the effectiveness of traffic control and management. This paper proposes a new spatiotemporal periodic polynomial model for road traffic, which integrates the temporal, spatial, and periodic features of speed time series and can effectively handle the nonlinear mapping relationship from input to output. In terms of the model, we establish a road traffic speed prediction model based on polynomial regression. In terms of spatial feature extraction methods, we introduce a maximum mutual information coefficient spatial feature extraction method. In terms of periodic feature extraction methods, we introduce a periodic trend modeling method into the prediction of speed time series, and effective fusion is carried out. Four strategies are evaluated based on the Guangzhou road speed dataset: a univariate polynomial model, a spatiotemporal polynomial model, a periodic polynomial model, and a spatiotemporal periodic polynomial model. The test results show that the three methods proposed in this article can effectively improve prediction accuracy. Comparing the spatiotemporal periodic polynomial model with multiple machine learning models and deep learning models, the prediction accuracy is improved by 5.94% compared to the best feedforward neural network. The research in this article can effectively deal with the temporal, spatial, periodic, and nonlinear characteristics of speed prediction, and to a certain extent, improve the accuracy of speed prediction. [ABSTRACT FROM AUTHOR]

In modern software development, OSS (Open Source Software) has become a crucial element. However, if OSS have few contributors and are lacking in maintenance activities, such as bug fixes, are used, it can lead to significant costs and resource allocation due to maintenance discontinuation. Since OSS are developed by a diverse group of contributors, the consistency of their involvement may vary, making continuous support and maintenance unpredictable. Therefore, it is necessary to identify the status of each OSS to avoid increased maintenance costs when selecting OSS for use. To address these issues, we use polynomial regression to predict trends in bug-fixing activities and evaluate the survivability of OSS accordingly. We predict the trend of bug-fixing activities in OSS, using factors such as popularity, number of contributors, and code complexity. A lower trend value indicates more vigorous activity. In this paper, we conduct data collection and extraction, generating model, and model testing and evaluation to predict survivability using these data. After collecting data through various tools, the models of different degrees are generated using K-fold cross-validation. The model with the highest performance is selected based on the RMSE (Root Mean Squared Error) and RSE (Residual Standard Error). Then, the chosen model is employed to predict the survivability of OSS and compare it with actual outcomes. This method is experimented with on OSS used in the KakaoTalk commercial messenger app. As a result, several OSS are predicted to have low survivability, and among them, five are analyzed. It is observed that, in reality, activities such as delayed or discontinued release updates occurred. These findings can support OSS users in selecting OSS for cost-saving purposes and alert OSS administrators to the need for solutions to ensure project survival. [ABSTRACT FROM AUTHOR]

A long-standing conjecture due to R. Fox states that the coefficients of the Alexander polynomial of an alternating knot exhibit a trapezoidal pattern. In other words, these coefficients increase, stabilize, then decrease in a symmetric way. A stronger version of this conjecture states that these coefficients form a log-concave sequence. This conjecture has been recently highlighted by J. Huh as one of the most interesting problems on log-concavity of sequences. In this expository paper, we shall review the various versions of the conjecture, highlight settled cases and outline some future directions. [ABSTRACT FROM AUTHOR]

The mathematical side of applied problems in multiple subject areas (biology, pattern recognition, etc.) is reduced to the problem of discrete optimization in the following mathematical method. We were provided a network and graphs in its leaves, for which we needed to find a rearrangement of graphs by non-leaf nodes, in which the given functional reached its minimum. Such a problem, even in the simplest case, is NP-hard, which means unavoidable restrictions on the network, on graphs, or on the functional. In this publication, this problem is addressed in the case of all graphs being so-called "structures", meaning directed-loaded graphs consisting of paths and cycles, and the functional as the sum (over all edges in the network) of distances between structures at the endpoints of every edge. The distance itself is equal to the minimal length of sequence from the fixed list of operations, the composition of which transforms the structure at one endpoint of the edge into the structure at its other endpoint. The list of operations (and their costs) on such a graph is fixed. Under these conditions, the given discrete optimization problem is called the reconstruction problem. This paper presents novel algorithms for solving the reconstruction problem, along with full proofs of their low error and low polynomial complexity. For example, for the network, the problem is solved with a zero error algorithm that has a linear polynomial computational complexity; and for the tree the problem is solved using an algorithm with a multiplicative error of at most two, which has a second order polynomial computational complexity. [ABSTRACT FROM AUTHOR]

In this paper, by using the Golden Calculus, we introduce the generalized Apostol-type Frobenius–Euler–Fibonacci polynomials and numbers; additionally, we obtain various fundamental identities and properties associated with these polynomials and numbers, such as summation theorems, difference equations, derivative properties, recurrence relations, and more. Subsequently, we present summation formulas, Stirling–Fibonacci numbers of the second kind, and relationships for these polynomials and numbers. Finally, we define the new family of the generalized Apostol-type Frobenius–Euler–Fibonacci matrix and obtain some factorizations of this newly established matrix. Using Mathematica, the computational formulae and graphical representation for the mentioned polynomials are obtained. [ABSTRACT FROM AUTHOR]

Iterative procedures have been proved as a milestone in the generation of fractals. This paper presents a novel approach for generating and visualizing fractals, specifically Mandelbrot and Julia sets, by utilizing complex polynomials of the form Q C (p) = a p n + m p + c , where n ≥ 2 . It establishes escape criteria that play a vital role in generating these sets and provides escape time results using different iterative schemes. In addition, the study includes the visualization of graphical images of Julia and Mandelbrot sets, revealing distinct patterns. Furthermore, the study also explores the impact of parameters on the deviation of dynamics, color, and appearance of fractals. [ABSTRACT FROM AUTHOR]

In this paper, we explore a study focused on a two-variable extension of matrix Bessel polynomials. We initiate the discussion by introducing the matrix Bessel polynomials involving two variables and derive specific differential formulas and recurrence relations associated with them. Additionally, we present a segment detailing integral formulas for the extended matrix Bessel polynomials. Lastly, we introduce the Laplace–Carson transform for the two-variable matrix Bessel polynomial analogue. [ABSTRACT FROM AUTHOR]

In this paper, we introduce and study new features for 2-variable (p , q) -Hermite polynomials, such as the (p , q) -diffusion equation, (p , q) -differential formula and integral representations. In addition, we establish some summation models and their (p , q) -derivatives. Certain parting remarks and nontrivial examples are also provided. [ABSTRACT FROM AUTHOR]

In this paper, we address the inverse of a true fourth-degree permutation polynomial (4-PP), modulo a positive integer of the form  32 k L Ψ , where  k L ∈ { 1 , 3 }  and  Ψ  is a product of different prime numbers greater than three. Some constraints are considered for the 4-PPs to avoid some complicated coefficients' conditions. With the fourth- and third-degree coefficients of the form  k 4 , f Ψ  and  k 3 , f Ψ , respectively, we prove that the inverse PP is (I) a 4-PP when  k 4 , f ∈ { 1 , 3 }  and  k 3 , f ∈ { 1 , 3 , 5 , 7 }  or when  k 4 , f = 2  and (II) a 5-PP when  k 4 , f ∈ { 1 , 3 }  and  k 3 , f ∈ { 0 , 2 , 4 , 6 } . [ABSTRACT FROM AUTHOR]

In this paper, a family of fifth-order Chebyshev–Halley-type iterative methods with one parameter is presented. The convergence order of the new iterative method is analyzed. By obtaining rational operators associated with iterative methods, the stability of the iterative method is studied by using fractal theory. In addition, some strange fixed points and critical points are obtained. By using the parameter space related to the critical points, some parameters with good stability are obtained. The dynamic plane corresponding to these parameters is plotted, visualizing the stability characteristics. Finally, the fractal diagrams of several iterative methods on different polynomials are compared. Both numerical results and fractal graphs show that the new iterative method has good convergence and stability when α = 1 2 . [ABSTRACT FROM AUTHOR]

Estimation of the region of attraction of the power system using sum of squares (SOS) programming theory is investigated in this paper. Firstly, the Taylor expansion formula is applied to explore the inherent polynomial structure of the swing equation. The single machine projection equation for a multi-machine system is proposed based on the amplitude characteristic of the rotor angle response in decoupled space. Secondly, the theory of SOS programming originating from the polynomial system is derived, and the theory about estimation of the region of attraction for the differential algebraic system is summarized. Thirdly, the method for estimating the region of attraction for the polynomial swing equation based on a V-S two-stage iterative procedure is proposed. Finally, a single machine infinite bus power system, an IEEE 3-machine power system, and an IEEE 4-machine power system are employed to validate the effectiveness and accuracy of the proposed method and analysis. [ABSTRACT FROM AUTHOR]

This paper exploits two remarkable features of the translationally form-invariant (TFI) canonical Sturm–Liouville equation (CSLE) transfigured by Liouville transformation into the Schrödinger equation with the shape-invariant Gendenshtein (Scarf II) potential. First, the Darboux–Crum net of rationally extended Gendenshtein potentials can be specified by a single series of Maya diagrams. Second, the exponent differences for the poles of the CSLE in the finite plane are energy-independent. The cornerstone of the presented analysis is the reformulation of the conventional supersymmetric (SUSY) quantum mechanics of exactly solvable rational potentials in terms of 'generalized Darboux transformations' of canonical Sturm–Liouville equations introduced by Rudyak and Zakhariev at the end of the last century. It has been proven by the author that the first feature assures that all the eigenfunctions of the TFI CSLE are expressible in terms of Wronskians of seed solutions of the same type, while the second feature makes it possible to represent each of the mentioned Wronskians as a weighted Wronskian of Routh polynomials. It is shown that the numerators of the polynomial fractions in question form the exceptional orthogonal polynomial (EOP) sequences composed of Wronskian transforms of the given finite set of Romanovski–Routh polynomials excluding their juxtaposed pairs, which have already been used as seed polynomials. [ABSTRACT FROM AUTHOR]

This paper introduces a new type of polynomials generated through the convolution of generalized multivariable Hermite polynomials and Appell polynomials. The paper explores several properties of these polynomials, including recurrence relations, explicit formulas using shift operators, and differential equations. Further, integrodifferential and partial differential equations for these polynomials are also derived. Additionally, the study showcases the practical applications of these findings by applying them to well-known polynomials, such as generalized multivariable Hermite-based Bernoulli and Euler polynomials. Thus, this research contributes to advancing the understanding and utilization of these hybrid polynomials in various mathematical contexts. [ABSTRACT FROM AUTHOR]

In this paper, polynomial recurrence bounds for a class of stochastic differential equations with a rotational symmetric gradient type drift and an additive Wiener process are established, as well as certain a priori moment inequalities for solutions. The key feature of this paper is that the approach does not use Lyapunov functions because it is not clear how to construct them. The method based on Dynkin's (nonrandom) chain of equations is applied instead. Another key feature is that the asymptotic conditions on the potential near infinity are assumed as inequalities—which allows for more flexibility compared to a single limit at infinity, making it less restrictive. [ABSTRACT FROM AUTHOR]

We extended the classical Bernoulli and Euler numbers and polynomials to introduce the Laguerre-type Bernoulli and Euler numbers and related fractional polynomials. The case of fractional Bernoulli and Euler polynomials and numbers has already been considered in a previous paper of which this article is a further generalization. Furthermore, we exploited the Laguerre-type fractional exponentials to define a generalized form of the classical Laplace transform. We show some examples of these generalized mathematical entities, which were derived using the computer algebra system Mathematica© (latest v. 14.0). [ABSTRACT FROM AUTHOR]

We investigate L 2 -approximation problems in the worst case setting in the weighted Hilbert spaces H (K R d , α , γ ) with weights R d , α , γ under parameters 1 ≥ γ 1 ≥ γ 2 ≥ ⋯ ≥ 0 and 1 < α 1 ≤ α 2 ≤ ⋯ . Several interesting weighted Hilbert spaces H (K R d , α , γ ) appear in this paper. We consider the worst case error of algorithms that use finitely many arbitrary continuous linear functionals. We discuss tractability of L 2 -approximation problems for the involved Hilbert spaces, which describes how the information complexity depends on d and ε − 1 . As a consequence we study the strongly polynomial tractability (SPT), polynomial tractability (PT), weak tractability (WT), and (t 1 , t 2) -weak tractability ( (t 1 , t 2) -WT) for all t 1 > 1 and t 2 > 0 in terms of the introduced weights under the absolute error criterion or the normalized error criterion. [ABSTRACT FROM AUTHOR]

Recently, Appell-type polynomials have been investigated and applied in several ways. In this paper, we consider a new extension of Appell-type Changhee polynomials. We introduce two-variable generalized Appell-type λ -Changhee polynomials (2VGAT λ CHP). The generating function, series representations, and summation identities related to these polynomials are explored. Further, certain symmetry identities involving two-variable generalized Appell-type λ -Changhee polynomials are established. Finally, Mathematica was used to examine the zero distributions of two-variable truncated-exponential Appell-type Changhee polynomials. [ABSTRACT FROM AUTHOR]

In this paper, we introduce a new class of special polynomials called the generalized Bell polynomials, constructed by combining two-variable general polynomials with two-variable Bell polynomials. The concept of the monomiality principle was employed to establish the generating function and obtain various results for these polynomials. We explore certain related identities, properties, as well as differential and integral formulas. Further, specific members within the generalized Bell family—such as the Gould-Hopper-Bell polynomials, Laguerre-Bell polynomials, truncated-exponential-Bell polynomials, Hermite-Appell-Bell polynomials, and Fubini-Bell polynomials—were examined, unveiling analogous outcomes for each. Finally, Mathematica was utilized to investigate the zero distributions of the Gould-Hopper-Bell polynomials. [ABSTRACT FROM AUTHOR]

In this study, we introduce a new class of normalized analytic and bi-univalent functions denoted by D Σ (δ , η , λ , t , r) . These functions are connected to the Bazilevič functions and the λ -pseudo-starlike functions. We employ Sakaguchi Type Functions and Horadam polynomials in our survey. We establish the Fekete-Szegö inequality for the functions in D Σ (δ , η , λ , t , r) and derive upper bounds for the initial Taylor–Maclaurin coefficients | a 2 | and | a 3 | . Additionally, we establish connections between our results and previous research papers on this topic. [ABSTRACT FROM AUTHOR]

In this paper, we consider a supersymmetric version of block-symmetric polynomials on a Banach space of two-sided absolutely summing series of vectors in C s for some positive integer s > 1. We describe some sequences of generators of the algebra of block-supersymmetric polynomials and algebraic relations between the generators for the finite-dimensional case and construct algebraic bases of block-supersymmetric polynomials in the infinite-dimensional case. Furthermore, we propose some consequences for algebras of block-supersymmetric analytic functions of bounded type and their spectra. Finally, we consider some special derivatives in algebras of block-symmetric and block-supersymmetric analytic functions and find related Appell-type sequences of polynomials. [ABSTRACT FROM AUTHOR]

Private Set Intersection Cardinality (PSI-CA) and Private Set Union Cardinality (PSU-CA) are two cryptographic primitives whereby two or more parties are able to obtain the cardinalities of the intersection and the union of their respective private sets, and the privacy of their sets is preserved. In this paper, we propose a new privacy protection intersection cardinality protocol, which can quickly deal with set inequality and asymmetry problems and can obtain 100% correct results, and, in terms of efficiency, we are much faster than using the polynomial method. Our protocol adopts the Paillier addition homomorphic encryption scheme and applies the identifier guidance technology, using identifier determination, to the semi-homomorphic encryption ciphertext environment, excluding a large number of different options and quickly finding the base of the intersection of two sides. [ABSTRACT FROM AUTHOR]