Recursive Formula Research Articles

Labeled partitions in action: Recombination, selection, mutation and more

In this paper, we consider the evolution of an (infinitely large) population under recombination and additional evolutionary forces, modeled by a measure-valued ordinary differential equation. We provide a stochastic representation for the solution of this model via duality to a new labeled partitioning process with Markovian labels. In the special case of single-crossover, this leads to a recursive solution formula. This extends (and unifies) previous results on the selection–recombination equation. As a concrete example, we consider the selection–mutation–recombination equation.

Interior solution of azimuthally symmetric case of Laplace equation in orthogonal similar oblate spheroidal coordinates

Curvilinear coordinate systems distinct from the rectangular Cartesian coordinate system are particularly valuable in the field calculations as they facilitate the expression of boundary conditions of differential equations in a reasonably simple way when the coordinate surfaces fit the physical boundaries of the problem. The recently finalized orthogonal similar oblate spheroidal (SOS) coordinate system can be particularly useful for a physical processes description inside or in the vicinity of the bodies or particles with the geometry of an oblate spheroid. The solution of the azimuthally symmetric case of the Laplace equation was found for the interior space in the orthogonal SOS coordinates. In the frame of the derivation of the harmonic functions, the Laplace equation was separated by a special separation procedure. A generalized Legendre equation was introduced as the equation for the angular part of the separated Laplace equation. The harmonic functions were determined as relations involving generalized Legendre functions of the first and of the second kind. Several lower-degree functions are reported. Recursion formula facilitating determination of the higher-degree harmonic functions was found. The general solution of the azimuthally symmetric Laplace equation for the interior space in the SOS coordinates is reported.

Quantum knot mosaics and bounds of the growth constant

The discovery of the Jones polynomial made an important connection between quantum physics and knot theory. Kauffman and Lomonaco introduced the knot mosaic system to define the quantum knot system for the purpose of representing an actual physical quantum system. This paper is inspired by an open question about the knot mosaic enumeration suggested by them. A knot [Formula: see text]-mosaic is an [Formula: see text] array of 11 mosaic tiles representing a knot diagram by adjoining properly. The total number [Formula: see text] of knot [Formula: see text]-mosaics, which indicates the dimension of the Hilbert space of the quantum knot system, is known to grow in a quadratic exponential rate. Recently, Oh et al. developed the state matrix recursion method producing the exact enumeration of knot mosaics, which uses a recursion formula of state matrices. Furthermore, they showed the existence of the knot mosaic constant [Formula: see text] and found its upper and lower bounds in a series of papers. The latest upper bound was obtained through two new concepts: quasimosaics and cling mosaics. As a sequel to this research program, we adjust the state matrix recursion method to handle cling mosaics inside a quasimosaic, which is called the progressive state matrix recursion method. This method provides recursive matrix-relations producing a sharper bound of the knot mosaic constant: [Formula: see text]

Probabilistic Stirling numbers and applications

We introduce probabilistic Stirling numbers of the first kind sY(n,k) associated with a complex-valued random variable Y satisfying appropriate integrability conditions, thus completing the notion of probabilistic Stirling numbers of the second kind SY(n,k) previously considered by the first author. Combinatorial interpretations, recursion formulas, and connections between sY(n,k) and SY(n,k) are given. We show that such numbers describe a large subset of potential polynomials, on the one hand, and the moments of sums of i. i. d. random variables, on the other, establishing their precise asymptotic behavior without appealing to the central limit theorem. We explicitly compute these numbers when Y has a certain familiar distribution, providing at the same time their combinatorial meaning.

Multidirectional cascade of square MIMO LTI subsystems: Transfer function representation

This paper considers continuous transfer function representation for a cascade composed of N mutually interconnected square multiple-input multiple-output (MIMO) linear time-invariant (LTI) subsystems with general multidirectional input–output configurations. Such cascaded structure can arise, e.g., from the spatial discretization of one-dimensional distributed parameter systems (DPSs) described by partial differential equations (PDEs) with boundary conditions representing different configurations of boundary input signals. As shown in the paper, the transfer function matrix of the resulting cascade can be calculated using the Redheffer star product of the subsystems’ transfer function matrices, which simplifies into the usual matrix product for the unidirectional cascade. For the particular case of 2 × 2 cascade composed of rational transfer function subsystems, the recursive formulas for its boundary and distributed transfer functions have been derived for both uni- and multidirectional configurations. The well-posedness and the stability criteria are also analyzed, proving to be more restrictive for the multidirectional cascade than for the unidirectional one due to the internal positive feedback in the first case. As shown in the attached example, the presented results can be used to approximate one-dimensional distributed parameter systems using rational transfer function subsystems representing the spatial sections of the original DPS.

Uniqueness of the Eigenvalue Inverse Problem for a Class of X-type Matrices with Linear Relations

Constraining a matrix by adding additional conditions to determine the matrix if given eigenpairs is called the eigenvalue inverse problem for matrices. The eigenvalue inverse problem of a matrix can be based on a given combination of different eigenvectors and real numbers to inverse a matrix method, and the method of inversion varies for different types of matrices. In this paper, we investigate the eigenvalue inverse problem for a class of X-type matrices characterized by linear relations, Invert the matrix based on its characteristics, determine eigenvalues and eigenvectors, and finally, prove that the solution of the problem exists and is unique, derive a series of expressions and recursive formulas, and we also check the algorithm’s accuracy correctness by giving different instances.

On the accurate computation of the Newton form of the Lagrange interpolant

AbstractIn recent years many efforts have been devoted to finding bidiagonal factorizations of nonsingular totally positive matrices, since their accurate computation allows to numerically solve several important algebraic problems with great precision, even for large ill-conditioned matrices. In this framework, the present work provides the factorization of the collocation matrices of Newton bases—of relevance when considering the Lagrange interpolation problem—together with an algorithm that allows to numerically compute it to high relative accuracy. This further allows to determine the coefficients of the interpolating polynomial and to compute the singular values and the inverse of the collocation matrix. Conditions that guarantee high relative accuracy for these methods and, in the former case, for the classical recursion formula of divided differences, are determined. Numerical errors due to imprecise computer arithmetic or perturbed input data in the computation of the factorization are analyzed. Finally, numerical experiments illustrate the accuracy and effectiveness of the proposed methods with several algebraic problems, in stark contrast with traditional approaches.

Study of cellular structures built from self-similar models and repeatable structures manufactured by FDM/FFF technology

Appropriate recursive formulas were obtained for generating repeatable and self-similar cellular structures obtained from PLA using the FDM/FFF method. The H1s, H2s self-similar models show mechanical self-similarity relationships based on simulation and compression test. In addition, the H1s models show higher displacement values than the H1i recurrent models. For the results of the H2s models, it is not conclusive whether they show higher displacement values.

Finite region stability and networked predictive control for 2-D nonlinear time-delayed systems with quantization, packet dropouts and random disturbances

In this paper, we focus on the finite region stability (FRS) and networked predictive control (NPC) problems for two-dimensional (2-D) networked control systems (NCS) with time delays, quantization errors, packet losses and random disturbances described by the Roesser model. The random packet dropouts and disturbances are modeled as Bernoulli process, and the sufficient conditions of FRS and finite region boundedness (FRB) for 2-D NCS are obtained by using the expectation to process the Lyapunov function difference, so as to better study the transient performance of the systems. According to the recursive formula, an active compensation scheme for time delays of NPC is proposed, which takes into account quantization errors, packet losses, nonlinearity and interferences. Introducing FRS and FRB into 2-D NCS and considering the above factors in NPC scheme are new attempts made in this paper. An example is used to demonstrate the validity of the conclusions in the end.

Novel recursive formula for removing damping distortion effect on bridge mode shape restoration using a two-axle scanning vehicle

Mode shapes recovered for bridges are often distorted by bridge damping when using the vehicle scanning method (VSM). To remedy such an effect, a novel recursive formula utilizing the spatial correlation between the front and rear contact points of a two-axle scanning vehicle is theoretically established. For a bridge subjected to a two-axle moving test vehicle, the dynamic response of the system is first derived in closed form. The vehicle-bridge contact response is used as a substitute for the vehicle response in signal processing, since it is free of the masking effect posed by vehicle frequencies. Using either the Hilbert transform (HT) or wavelet transform (WT), instantaneous amplitudes are extracted for the component response of the bridge of concern. Further, recursive formula that accounts for the spatial correlation between the two contact points is established to recover the undistorted bridge mode shapes. The following are the conclusions: (1) The distortion effect of damping on bridge mode shapes can be effectively removed by the recursive formula against various factors; (2) the WT is more effective in recovering undistorted bridge mode shapes than the HT; and (3) the proposed formula works well for restoring the mode shapes of bridges with rough pavement, by adding an accompanying truck during the vehicle scanning.

Twisted elliptic genera

We study the twisted elliptic genera of 2d (0, 4) SCFTs associated with the BPS strings in the twisted circle compactification of 6d rank-one (1, 0) SCFTs. Such objects can arise when the 6d gauge algebra allows outer automorphism, thus are classified by twisted affine Lie algebras. We study several fascinating aspects of the twisted elliptic genera including 2d localization, twisted elliptic blowup equations, Higgsing and spectral flow symmetry. We derive a recursion formula with respect to the number of strings to exactly compute the twisted elliptic genera. We also investigate the modular bootstrap of twisted one-string elliptic genera and find the modularity of congruence subgroups Γ1(N) naturally appears with possible N = 2, 3, 4. Geometrically, our study solves the refined BPS partition functions of the underlying genus-one fibered Calabi-Yau threefolds with N-section.

An objective FE-formulation for Cosserat rods based on the spherical Bézier interpolation

A generalization of the spherical linear interpolation (or slerp) for the finite rotations to the case of more than two control variables on SO(3) is introduced to design an objective FE-formulation for the non-linear space Cosserat rod model. The interpolation uses the De Casteljau’s algorithm.In this way, the same interpolation degree can be used for the placement of the centroid curve and for the finite rotation of the cross-section. A recursive formula is obtained for the interpolation of the rotations. Similar recursive formulas are derived for the spin and the curvature vector, leading to a generalization of the Bézier basis functions on the manifold SO(3).The rod formulation so obtained is invariant under a rigid rotation (objective), in the sense that the patch-test with respect to the rigid body motion is satisfied. Furthermore, an optimal path-independence is achieved as verified by several numerical investigations.

A surface area formula for compact hypersurfaces in Rn\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$\\mathbb{R}^{n}$\\end{document}

The classical Cauchy surface area formula states that the surface area of the boundary ∂K=Σ\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$\\partial K=\\Sigma $\\end{document} of any n-dimensional convex body in the n-dimensional Euclidean space Rn\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$\\mathbb{R}^{n}$\\end{document} can be obtained by the average of the projected areas of Σ along all directions in Sn−1\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$\\mathbb{S}^{n-1}$\\end{document}. In this note, we generalize the formula to the boundary of arbitrary n-dimensional submanifold in Rn\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$\\mathbb{R}^{n}$\\end{document} by introducing a natural notion of projected areas along any direction in Sn−1\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$\\mathbb{S}^{n-1}$\\end{document}. This surface area formula derived from the new notion coincides with not only the result of the Crofton formula but also with that of De Jong (Math. Semesterber. 60(1):81–83, 2013) by using a tubular neighborhood. We also define the projected r-volumes of Σ onto any r-dimensional subspaces and obtain a recursive formula for mean projected r-volumes of Σ.

Distributions of 4-subtree patterns for uniform random unrooted phylogenetic trees

Tree shape statistics based on peripheral structures have been utilized to study evolutionary mechanisms and inference methods. Partially motivated by a recent study by Pouryahya and Sankoff on modeling the accumulation of subgenomes in the evolution of polyploids, we present the distribution of subtree patterns with four or fewer leaves for the unrooted Proportional to Distinguishable Arrangements (PDA) model. We derive a recursive formula for computing the joint distributions, as well as a Strong Law of Large Numbers and a Central Limit Theorem for the joint distributions. This enables us to confirm several conjectures proposed by Pouryahya and Sankoff, as well as provide some theoretical insights into their observations. Based on their empirical datasets, we demonstrate that the statistical test based on the joint distribution could be more sensitive than those based on one individual subtree pattern to detect the existence of evolutionary forces such as whole genome duplication.

Multi-trace YMS amplitudes from soft behavior

Tree level multi-trace Yang-Mills-scalar (YMS) amplitudes have been shown to satisfy a recursive expansion formula, which expresses any YMS amplitude by those with fewer gluons and/or scalar traces. In an earlier work, the single-trace expansion formula has been shown to be determined by the universality of soft behavior. This approach is nevertheless not extended to multi-trace case in a straightforward way. In this paper, we derive the expansion formula of tree-level multi-trace YMS amplitudes in a bottom-up way: we first determine the simplest amplitude, the double-trace pure scalar amplitude which involves two scalars in each trace. Then insert more scalars to one of the traces. Based on this amplitude, we further obtain the double-soft behavior when the trace contains only two scalars is soft. The multi-trace amplitudes with more scalars and more gluons finally follow from the double-soft behavior as well as the single-soft behaviors which has been derived before.

Low-rank balanced truncation of discrete time-delay systems based on Laguerre expansions

This paper introduces a novel model order reduction method based on low-rank Gramian approximations for discrete time-delay systems. Firstly, an efficient algorithm based on Laguerre functions to compute the low-rank decomposition factors of the controllability and observability Gramians for discrete time-delay systems is given, in which the low-rank factors satisfy the iterative recursive formulas of the expansion coefficients of the Laguerre functions. It effectively avoids the direct solutions of Gramians. Then, the reduced-order model of the discrete time-delay system is obtained by combining the low-rank square root method. Additionally, a modified algorithm that combines the dominant subspace projection method is introduced, which alleviates certain drawbacks of the above technique and enhances the stability in certain cases. Finally, two numerical examples are given to verify the accuracy and efficiency of our proposed algorithm.

Are minimum variance portfolios in multi-factor models long in low-beta assets?

Within the one-factor capital asset pricing model (CAPM), the minimum-variance portfolio (MVP) is known to have long positions in those assets of the underlying investment universe whose betas are less than a well-defined long-short threshold beta. We study the structure of MVPs in more general multi-factor asset pricing models and clarify the low-beta puzzle for multi-factor models: For multi-factor models we derive a similar criterion in terms of the betas with explicit closed-form formulas. But the structural relationship is now more involved and the long-short threshold turns out to be asset-specific. The results rely on recursive inverse-free formulas for the precision matrix, which hold for multi-factor models and allow quick computation of that inverse matrix without the need to invert matrices going beyond diagonal ones. We illustrate our findings by analyzing S &P 500 asset returns. Our empirical results of the S &P 500 constituents between 2019 and 2022 confirm the theoretical findings and shows that the minimum variance portfolio is long in low-beta assets when applying estimates of the established asset-specific thresholds.

A CHANGE OF MEASURE FORMULA FOR RECURSIVE CONDITIONAL EXPECTATIONS

We derive a representation for the value process associated to the solutions of forward–backward stochastic differential equations in a jump-diffusion setting under multiple probability measures. Motivated by concrete financial problems, the latter representations are then applied to devise a generalization of the change of numéraire technique, allowing to obtain recursive pricing formulas in the presence of nonlinear funding terms due to e.g. collateralization agreements.

Application of the integral operator method for multispin correlation function calculations in the one-dimensional Ising model.

The one-dimensional (1D) Ising model is revisited. The integral operator method is used for the model to derive the general statistical identity for multispin correlation functions. As an application of this identity to generate various correlations, recursive formulas are derived for the correlations of pairs, threes, fours, and fives of spins. Both compact clusters and disjoint sets of spins are considered. It is shown that multispin correlations for the 1D Ising model can be exactly expressed in terms of pairwise correlations using recursive procedures. For clusters with different structures, numerical calculations of multispin correlations as a function of temperature and external magnetic field are performed. The results of these calculations are presented in the figuresand discussed.

Barile–Macchia resolutions

We construct cellular resolutions for monomial ideals via discrete Morse theory. In particular, we develop an algorithm to create homogeneous acyclic matchings and we call the cellular resolutions induced from these matchings Barile–Macchia resolutions. These resolutions are minimal for edge ideals of weighted oriented forests and (most) cycles. As a result, we provide recursive formulas for graded Betti numbers and projective dimension. Furthermore, we compare Barile–Macchia resolutions to those created by Batzies and Welker and some well-known simplicial resolutions. Under certain assumptions, whenever the above resolutions are minimal, so are Barile–Macchia resolutions.