Results 61 to 70 of about 162,209 (248)
On Kotzig's Perfect Set Problem of Hamiltonian Cycle Decompositions of the Complete Graph
Journal of Combinatorial Designs, EarlyView.ABSTRACT A Hamiltonian cycle decomposition (HCD) of K n ${K}_{n}$ is a set of Hamiltonian cycles in which each 1‐path of K n ${K}_{n}$ appears exactly once. A Dudeney set of K n ${K}_{n}$ is a set of Hamiltonian cycles in which each 2‐path of K n ${K}_{n}$ appears exactly once.
Nobuaki Mutoh
wiley +1 more source
Halin's Grid Theorem for Digraphs
Journal of Graph Theory, EarlyView.ABSTRACT Halin showed that every thick end of every graph contains an infinite grid. We extend Halin's theorem to digraphs. More precisely, we show that for every infinite family ℛ ${\rm{ {\mathcal R} }}$ of disjoint equivalent out‐rays there is a grid whose vertical rays are contained in ℛ ${\rm{ {\mathcal R} }}$.
Florian Reich
wiley +1 more source
How to succeed at Witten diagram recursions without really trying
Journal of High Energy Physics, 2020 Witten diagrams are basic objects for studying dynamics in AdS space, and also play key roles in the analytic functional bootstrap. However, these diagrams are notoriously hard to evaluate, making it extremely difficult to search for recursion relations ...
Xinan Zhou
doaj +1 more source
Mathematical Methods in the Applied Sciences, EarlyView.A highly accurate numerical method is given for the solution of boundary value problem of generalized Bagley‐Torvik (BgT) equation with Caputo derivative of order 0<β<2$$ 0<\beta <2 $$ by using the collocation‐shooting method (C‐SM). The collocation solution is constructed in the space Sm+1(1)$$ {S}_{m+1}^{(1)} $$ as piecewise polynomials of degree at ...
Suzan Cival Buranay +2 more
wiley +1 more source
Recursion operator for stationary Nizhnik--Veselov--Novikov equation
, 2002 We present a new general construction of recursion operator from zero curvature representation. Using it, we find a recursion operator for the stationary Nizhnik--Veselov--Novikov equation and present a few low order symmetries generated with the help of
A Sergyeyev +16 more
core +1 more source
Computing Bonds Between Formal Contexts
Mathematical Methods in the Applied Sciences, EarlyView.ABSTRACT The notion of bond was introduced as a technique to aggregate information from multiple datasets without modifying the information already present in each of the datasets. This notion has been extended to several fuzzy frameworks, including the residuated lattice setting, which we also consider in this paper.
Roberto G. Aragón +2 more
wiley +1 more source
The bi-adjoint scalar ℓ-loop planar integrand recursion and graded inverse variables
Journal of High Energy PhysicsPreviously in [1], we constructed the ℓ-loop planar integrands using loop components and loop kernels by some recursion rules. In this paper, we propose a new formalism to express the loop kernel recursion.
Yi-Xiao Tao
doaj +1 more source
La articulación de le expresión escrita. The articulation of written expression [PDF]
Ocnos, 2014 En este trabajo se aportan argumentos lingüísticos a favor de la autonomía funcional de la expresión escrita. Esta presentaría una estructuración independiente de la oralidad que, sin embargo, descansaría sobre los mismos principios básicos, estando ...
Jose Henrique Pérez-Rodríguez
doaj
Loop Amplitudes and Quantum Homotopy Algebras
Journal of High Energy Physics, 2020 We derive a recursion relation for loop-level scattering amplitudes of La- grangian field theories that generalises the tree-level Berends-Giele recursion relation in Yang-Mills theory.
Branislav Jurčo +3 more
doaj +1 more source
Pointers in Recursion: Exploring the Tropics [PDF]
Electronic Proceedings in Theoretical Computer Science, 2019 We translate the usual class of partial/primitive recursive functions to a pointer recursion framework, accessing actual input values via a pointer reading unit-cost function.
Paulin Jacobé de Naurois
doaj +1 more source