Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userUn theor`eme `a la Thom-Sebastiani pour les integrales-fibres
119
0
0.0
(
0
)
Authors
Daniel Barlet
Ask ChatGPT about the research
No Arabic abstract
The aim of this article is to prove a Thom-Sebastiani theorem for the asymptotics of the fiber-integrals. This means that we describe the asymptotics of the fiber-integrals of the function $f oplus g : (x,y) to f(x) + g(y)$ on $(mathbb{C}^ptimes mathbb{C}^q, (0,0))$ in term of the asymptotics of the fiber-integrals of the holomorphic germs $f : (mathbb{C}^p,0) to (mathbb{C},0)$ and $g : (mathbb{C}^q,0) to (mathbb{C},0)$. This reduces to compute the asymptotics of a convolution $Phi_*Psi$ from the asymptotics of $Phi$ and $Psi$ modulo smooth terms. To obtain a precise theorem, giving the non vanishing of expected singular terms in the asymptotic expansion of $foplus g$, we have to compute the constants coming from the convolution process. We show that they are given by rational fractions of Gamma factors. This enable us to show that these constants do not vanish.
rate research
Read More
In this short note, I explain how the non-degeneracy condition of the KAM can be bypassed. The first version of the note has been submitted for publication back in 2010 and this version in 2012.
In this article we show that all results proved for a large class of holomorphic germs $f : (mathbb{C}^{n+1}, 0) to (mathbb{C}, 0)$ with a 1-dimension singularity in [B.II] are valid for an arbitrary such germ.
Overland flow on agricultural fields may have some undesirable effects such as soil erosion, flood and pollutant transport. To better understand this phenomenon and limit its consequences, we developed a code using state-of-the-art numerical methods: FullSWOF (Full Shallow Water equations for Overland Flow), an object oriented code written in C++. It has been made open-source and can be downloaded from http://www.univ-orleans.fr/mapmo/soft/FullSWOF/. The model is based on the classical system of Shallow Water (SW) (or Saint-Venant system). Numerical difficulties come from the numerous dry/wet transitions and the highly-variable topography encountered inside a field. It includes runon and rainfall inputs, infiltration (modified Green-Ampt equation), friction (Darcy-Weisbach and Manning formulas). First we present the numerical method for the resolution of the Shallow Water equations integrated in FullSWOF_2D (the two-dimension version). This method is based on hydrostatic reconstruction scheme, coupled with a semi-implicit friction term treatment. FullSWOF_2D has been previously validated using analytical solutions from the SWASHES library (Shallow Water Analytic Solutions for Hydraulic and Environmental Studies). Finally, FullSWOF_2D is run on a real topography measured on a runoff plot located in Thies (Senegal). Simulation results are compared with measured data. This experimental benchmark demonstrate the capabilities of FullSWOF to simulate adequately overland flow. FullSWOF could also be used for other environmental issues, such as river floods and dam-breaks.
We study the dynamics of surface homeomorphisms around isolated fixed points whose Poincar{e}-Lefschetz index is not equal to 1. We construct a new conjugacy invariant, which is a cyclic word on the alphabet ${ua, ra, da, la}$. This invariant is a refinement of the P.-L. index. It can be seen as a canonical decomposition of the dynamics into a finite number of sectors of hyperbolic, elliptic or indifferent type. The contribution of each type of sector to the P.-L. index is respectively -1/2, $+1/2$ and 0. The construction of the invariant implies the existence of some canonical dynamical structures.
Petri-nets are a simple formalism for modeling concurrent computation. Recently, they have emerged as a powerful tool for the modeling and analysis of biochemical reaction networks, bridging the gap between purely qualitative and quantitative models. These networks can be large and complex, which makes their study difficult and computationally challenging. In this paper, we focus on two structural properties of Petri-nets, siphons and traps, that bring us information about the persistence of some molecular species. We present two methods for enumerating all minimal siphons and traps of a Petri-net by iterating the resolution of a boolean model interpreted as either a SAT or a CLP(B) program. We compare the performance of these methods with a state-of-the-art dedicated algorithm of the Petri-net community. We show that the SAT and CLP(B) programs are both faster. We analyze why these programs perform so well on the models of the repository of biological models biomodels.net, and propose some hard instances for the problem of minimal siphons enumeration.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
