Determinantal Expressions and Recursive Relations for the Bessel Zeta Function and for a Sequence Originating from a Series Expansion of the Power of Modified Bessel Function of the First Kind

In the paper,by virtue of a general formula for any derivative of the ratio of two differentiable functions,with the aid of a recursive property of the Hessenberg determinants,the authors establish determinantal expressions and recursive relations for the Bessel zeta function and for a sequence originating from a series expansion of the power of modified Bessel function of the first kind.

A New Gluing Recursive Relation for Linear Sigma Model of P^1-orbifold

The study of the moduli space plays an important role in classical enumerative geometry and its interaction with string theory in physics. Given X=[P1/Zr] and let x＇ = （[0]a , [∞]b） the 2-tuple of twisted sectors on X , we construct in this paper two different compactifications of the moduli space M0,2（X, d[P1/Zr], x＇）： Nonlinear Sigma Model Mx＇d and Linear Sigma Model Nx＇d . Relations between Mx＇d and Nx＇d are studied and a new gluing recursive relation on Nx＇d is derived from Mx＇d due to virtual localization formula.

A Unified Strategy for Formal Derivation and Proof of Binary Tree Nonrecursive Algorithms

In the formal derivation and proof of binary tree algorithms,Dijkstra’s weakest predicate method is commonly used.However,the method has some drawbacks,including a time-consuming derivation process,complicated loop invariants,and the inability to generate executable programs from the specification.This paper proposes a unified strategy for the formal derivation and proof of binary tree non-recursive algorithms to address these issues.First,binary tree problem solving sequences are decomposed into two types of recursive relations based on queue and stack,and two corresponding loop invariant templates are constructed.Second,high-reliability Apla(abstract programming language)programs are derived using recursive relations and loop invariants.Finally,Apla programs are converted automatically into C++executable programs.Two types of problems with binary tree queue and stack recursive relations are used as examples,and their formal derivation and proof are performed to validate the proposed strategy’s effectiveness.This strategy improves the efficiency and correctness of binary tree algorithm derivation.

Recursion Relations for the Constrained Multi-component KP Hierarchy

In this paper, we define a new constrained multi-component KP （cMKP） hierarchy which contains the constrained KP （cKP） hierarchy as a special case. We derive the recursion operator of the constrained multi-component KP hierarchy. As a special example, we also give the recursion operator of the constrained two-component KP hierarchy.

Topological Recursion Relations from Pixton Relations

We propose an algorithm to derive tautological relations from Pixton relations. We carry out this algorithm explicitly to derive some results in genus 0, 1, 2, 3 and analyze the possibility to generalize to higher genera. As an application, some results about reconstruction of Gromov–Witten invariants can be derived.

An introduction to on-shell recursion relations

This article provides an introduction to on-shell recursion relations for calculations of tree-level amplitudes. Starting with the basics, such as spinor notations and color decompositions, we ex- pose analytic properties of gauge-boson amplitudes, BCFW-deformations, the large z-behavior of amplitudes, and on-shell recursion relations of gluons. We discuss further developments of on-shell recursion relations, including generalization to other quantum field theories, supersymmetric theo- ties in particular, recursion relations for off-shell currents, recursion relation with nonzero boundary contributions, bonus relations, relations for rational parts of one-loop amplitudes, recursion relations in 3D and a proof of CSW rules. Finally, we present samples of applications, including solutions of split helicity amplitudes and of Af = 4 SYM theories, consequences of consistent conditions under re- cursion relation, Kleiss-Kuijf （KK） and Bern-Carrasco-Johansson （BCJ） relations for color-ordered gluon tree amplitudes, Kawai-Lewellen-Tye （KLT） relations.

A genus-4 topological recursion relation for Gromov-Witten invariants

In this paper,we give a new genus-4 topological recursion relation for Gromov-Witten invariants of compact symplectic manifolds via Pixton’s relations on the moduli space of curves.As an application,we prove that Pixton’s relations imply a known topological recursion relation on Mg,1 for genus g≤4.

Reconstructing the Potential Function in a Formulation of Quantum Mechanics Based on Orthogonal Polynomials

In a recent reformulation of quantum mechanics, the properties of the physical system are derived from orthogonal polynomials that make up the expansion coefficients of the wavefunction in a complete set of square integrable basis. Here, we show how to reconstruct the potential function so that a correspondence with the standard formulation could be established. However, the correspondence places restriction on the kinematics of such problems.

One loop integrals reduction

By further examining the symmetry of external momenta and masses in Feynman integrals, we fulfilled the method proposed by Battistel and Dallabona, and showed that recursion relations in this method can be applied to simplify Feynman integrals directly.