Results 11 to 20 of about 168,604 (284)
Integrable discretization of recursion operators and unified bilinear forms to soliton hierarchies [PDF]
In this paper, we give a procedure for discretizing recursion operators by utilizing unified bilinear forms within integrable hierarchies. To illustrate this approach, we present unified bilinear forms for both the AKNS hierarchy and the KdV hierarchy ...
Xingbiao Hu, Guofu Yu, Yingnan Zhang
doaj +4 more sources
It is a truism that conceptual understanding of a hypothesis is required for its empirical investigation. However the concept of recursion as articulated in the context of linguistic analysis has been perennially confused.
Jeffrey eWatumull +4 more
doaj +5 more sources
We examine the BCFW recursion relations for celestial amplitudes and how they inform the celestial bootstrap program. We start by recasting the celestial incarnation of the BCFW shift as a generalization of the action of familiar asymptotic symmetries on
Yangrui Hu, Sabrina Pasterski
doaj +3 more sources
Mesoscale movement and recursion behaviors of Namibian black rhinos [PDF]
Background Understanding rhino movement behavior, especially their recursive movements, holds significant promise for enhancing rhino conservation efforts, and protecting their habitats and the biodiversity they support.
Dana Paige Seidel +4 more
doaj +3 more sources
We introduce a simple lattice model in which percolation is constructed on top of critical percolation clusters, and show that it can be repeated recursively any number $n$ of generations. In two dimensions, we determine the percolation thresholds up to $n=5$. The corresponding critical clusters become more and more compact as $n$ increases, and define
Deng, Youjin +2 more
openaire +3 more sources
Hardware acceleration of number theoretic transform for zk‐SNARK
An FPGA‐based hardware accelerator with a multi‐level pipeline is designed to support the large‐bitwidth and large‐scale NTT tasks in zk‐SNARK. It can be flexibly scaled to different scales of FPGAs and has been equipped in the heterogeneous acceleration system with the help of HLS and OpenCL.
Haixu Zhao +6 more
wiley +1 more source
We obtain a recursive formulation for a general class of optimization problems with forward‐looking constraints which often arise in economic dynamic models, for example, in contracting problems with incentive constraints or in models of optimal policy. In this case, the solution does not satisfy the Bellman equation. Our approach consists
Albert Marcet, Ramon Marimon
openaire +9 more sources
Cosymmetries and Nijenhuis recursion operators for difference equations [PDF]
In this paper we discuss the concept of cosymmetries and co--recursion operators for difference equations and present a co--recursion operator for the Viallet equation.
Ablowitz M J +21 more
core +2 more sources
A generalized topological recursion for arbitrary ramification [PDF]
The Eynard-Orantin topological recursion relies on the geometry of a Riemann surface S and two meromorphic functions x and y on S. To formulate the recursion, one must assume that x has only simple ramification points.
Bouchard, Vincent +4 more
core +1 more source
Summary: This paper is an extension of earlier papers [\textit{R. Schaback}, in: New developments in approximation theory. 2nd international Dortmund meeting (IDoMAT) '98, Germany, February 23-27, 1998. Basel: Birkhäuser. ISNM, Int. Ser. Numer. Math. 132, 255--282 (1999; Zbl 0944.46017); J. Comput. Appl. Math.
Mouattamid, Mohammed, Schaback, Robert
openaire +2 more sources

