Search results for "Recursion"
showing 10 items of 61 documents
On-shell recursion relations for all Born QCD amplitudes
2007
We consider on-shell recursion relations for all Born QCD amplitudes. This includes amplitudes with several pairs of quarks and massive quarks. We give a detailed description on how to shift the external particles in spinor space and clarify the allowed helicities of the shifted legs. We proof that the corresponding meromorphic functions vanish at z --> infinity. As an application we obtain compact expressions for helicity amplitudes including a pair of massive quarks, one negative helicity gluon and an arbitrary number of positive helicity gluons.
MR 2944715 Reviewed Zhu S. On the recursion formula for double Hurwitz numbers. Proceedings of the American Mathematical Society (2012) 140, no. 11, …
2013
Let $\mu = (\mu_{1}, \mu_{2}, \ldots, \mu_{m})$ and $\nu = (\nu_{1}, \nu_{2}, \ldots, \nu_{n})$ be two partitions of a positive integer $d$. In this paper, the author considers degree $d$ branched coverings of $\mathbb{P}^{1}$ with at most two special points, $0$ and $\infty$. Specifically, the purpose of the author is to give a recursion formula for double Hurwitz numbers $H^{g}_{\mu, \nu}$ by the cut-join analysis. Here, $H^{g}_{\mu, \nu}$ denotes the number of genus $g$ branched covers of $\mathbb{P}^{1}$ with branching date corresponding to $\mu$ and $\nu$ over $0$ and $\infty$, respectively. Furthemore, as application, the author gets a polynomial identity for linear Goulden-Jackson-Va…
Numerical bounds for semi-stable families of curves or of certain higher-dimensional manifolds
2005
Given an open subset U U of a projective curve Y Y and a smooth family f : V → U f:V\to U of curves, with semi-stable reduction over Y Y , we show that for a subvariation V \mathbb {V} of Hodge structures of R 1 f ∗ C V R^1f_*\mathbb {C}_V with rank ( V ) > 2 \textrm {rank} (\mathbb {V})>2 the Arakelov inequality must be strict. For families of n n -folds we prove a similar result under the assumption that the ( n , 0 ) (n,0) component of the Higgs bundle of V \mathbb {V} defines a birational map.
Integrating Domain Knowledge in Data-Driven Earth Observation With Process Convolutions
2022
The modelling of Earth observation data is a challenging problem, typically approached by either purely mechanistic or purely data-driven methods. Mechanistic models encode the domain knowledge and physical rules governing the system. Such models, however, need the correct specification of all interactions between variables in the problem and the appropriate parameterization is a challenge in itself. On the other hand, machine learning approaches are flexible data-driven tools, able to approximate arbitrarily complex functions, but lack interpretability and struggle when data is scarce or in extrapolation regimes. In this paper, we argue that hybrid learning schemes that combine both approa…
Evaluating the thermal-radiative performance of ENVI-met model for green infrastructure typologies: Experience from a subtropical climate
2022
Abstract Microclimate knowledge has been intensively integrated into urban planning and design to improve the buildings’ energy performance and outdoor thermal comfort. To assess the climatic mitigation strategies, numerical modeling is gaining higher relevance. ENVI-met, a microclimate model to simulate the complex surface-vegetation-atmosphere interactions in the built environment, is receiving increasing popularity. This study aims to systematically evaluate the thermal-radiative performance of the ENVI-met model based on its recent updates. First, a field measurement was conducted in a subtropical city. Thermal-radiative parameters were collected besides three green infrastructure (GI) …
Stability of stationary solutions of a one-dimensional parabolic equation with homogeneous Neumann boundary conditions
1991
for some x in [0, rr]. The guiding idea of this paper is to observe the changes in the stability behavior of the solutions if we perturb the autonomous problem intro- ducing a forcing term g. In [8] it was shown that iff and g are related by a boundedness condi- tion (see condition (* ) in Theorem 3.1) then there exists a stable solution of (1.1) “close” to each stable solution of (1.2). We want to call these stable solutions of (1.1)
Reduction of a Non—Linear Parabolic Initial—Boundary Value Problem to Cauchy Problem for a System of ODEs
2004
We consider the boundary value problem for a parabolic equation in the form $$\frac{{\partial {\text{u}}}}{{\partial t}} = \frac{1}{{p(x)}}\frac{\partial }{{\partial x}}\left( {p(x)f'(u)\frac{{\partial u}}{{\partial x}}} \right) + F(u),x \in (0,l),t0,$$ (1) $$u(0,x) = {u_0}(x),$$ (2) $$\frac{{\partial u}}{{\partial x}}{|_{x = 0}} = {f_1}\left( {{u_1}} \right),$$ (3) $$\frac{{\partial u}}{{\partial x}}{|_{x = 1}} = {f_2}\left( {{u_2}} \right),$$ (4) where u = u(t,x) is the unknown function, f 1, f 2, F, f are nonlinear functions and f′ (u) > 0, $${u_1} = {u_1}\left( t \right) \equiv u\left( {t,0} \right),{u_2} = {u_2}(t) \equiv u\left( {t,l} \right),f'\left( u \right) \equiv df(u)/du,p(x) \g…
When can an equational simple graph be generated by hyperedge replacement?
1998
Infinite hypergraphs with sources arise as the canonical solutions of certain systems of recursive equations written with operations on hypergraphs. There are basically two different sets of such operations known from the literature, HR and VR. VR is strictly more powerful than HR on simple hypergraphs. Necessary conditions are known ensuring that a VR-equational simple hypergraph is also HR-equational. We prove that two of them, namely having finite tree-width or not containing the infinite bipartite graph, are also sufficient. This shows that equational hypergraphs behave like context-free sets of finite hypergraphs.
Circular sturmian words and Hopcroft’s algorithm
2009
AbstractIn order to analyze some extremal cases of Hopcroft’s algorithm, we investigate the relationships between the combinatorial properties of a circular sturmian word (x) and the run of the algorithm on the cyclic automaton Ax associated to (x). The combinatorial properties of words taken into account make use of sturmian morphisms and give rise to the notion of reduction tree of a circular sturmian word. We prove that the shape of this tree uniquely characterizes the word itself. The properties of the run of Hopcroft’s algorithm are expressed in terms of the derivation tree of the automaton, which is a tree that represents the refinement process that, in the execution of Hopcroft’s alg…
Epichristoffel Words and Minimization of Moore Automata
2014
This paper is focused on the connection between the combinatorics of words and minimization of automata. The three main ingredients are the epichristoffel words, Moore automata and a variant of Hopcroft's algorithm for their minimization. Epichristoffel words defined in [14] generalize some properties of circular sturmian words. Here we prove a factorization property and the existence of the reduction tree, that uniquely identifies the structure of the word. Furthermore, in the paper we investigate the problem of the minimization of Moore automata by defining a variant of Hopcroft's minimization algorithm. The use of this variant makes simpler the computation of the running time and consequ…