Search results for "Recursion"
showing 10 items of 61 documents
A singularly perturbed Kirchhoff problem revisited
2020
Abstract In this paper, we revisit the singularly perturbation problem (0.1) − ( ϵ 2 a + ϵ b ∫ R 3 | ∇ u | 2 ) Δ u + V ( x ) u = | u | p − 1 u in R 3 , where a , b , ϵ > 0 , 1 p 5 are constants and V is a potential function. First we establish the uniqueness and nondegeneracy of positive solutions to the limiting Kirchhoff problem − ( a + b ∫ R 3 | ∇ u | 2 ) Δ u + u = | u | p − 1 u in R 3 . Then, combining this nondegeneracy result and Lyapunov-Schmidt reduction method, we derive the existence of solutions to (0.1) for ϵ > 0 sufficiently small. Finally, we establish a local uniqueness result for such derived solutions using this nondegeneracy result and a type of local Pohozaev identity.
Physical forcing and physical/biochemical variability of the Mediterranean Sea: a review of unresolved issues and directions for future research
2014
Malanotte-Rizzoli, Paola ... et. al.-- 76 pages
Forcing for First-Order Languages from the Perspective of Rasiowa–Sikorski Lemma
2017
The paper is concerned with the problem of building models for first-order languages from the perspective of the classic paper of Rasiowa and Sikorski [9]. The central idea, developed in this paper, consists in constructing first-order models from individual variables. The key notion of a Rasiowa–Sikorski set of formulas for an arbitrary countable language L is examined. Each Rasiowa–Sikorski set defines a countable model for L . Conversely, every countable model for L is determined by a Rasiowa–Sikorski set. The focus is on constructing Rasiowa–Sikorski sets by applying forcing techniques restricted to Boolean algebras arising from the subsets of the set of atomic formulas of L .
Sequential formula translation
1983
The syntax of an algorithmic language such as ALGOL is conveniently described as a sequence of states indicated by an element called cellar. Transitions are controlled by admissible state- s ymbol pairs which may be represented by a transition matrix. This description of syntax furnishes at the same time an extremely simple rule for translating into machine programs statements in the algorithmic language. Sequential treatment, however, is not feasible in the case of certain optimizing processes such as recursive address calculation.
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.
Quasi-Modes in Higher Dimension
2019
Recall that if a(x, ξ) and b(x, ξ) are two C1-functions defined on some domain in \({\mathbf {R}}^{2n}_{x,\xi }\), then we can define the Poisson bracket to be the C0-function on the same domain given by $$\displaystyle \{ a,b\} =a^{\prime }_\xi \cdot b^{\prime }_x-a^{\prime }_x \cdot b^{\prime }_\xi =H_a(b). $$ Here \(H_a=a^{\prime }_\xi \cdot \partial _x-a^{\prime }_x\cdot \partial _\xi \) denotes the Hamilton vector field of a. The following result is due to Zworski, who obtained it via a semi-classical reduction from the above mentioned result of Hormander. A direct proof was given in Dencker et al. and here we give a variant. We will assume some familiarity with symplectic geometry.
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.
A reduction theorem for perfect locally finite minimal non-FC groups
1999
A group G is said to be a minimal non-FC group, if G contains an infinite conjugacy class, while every proper subgroup of G merely has finite conjugacy classes. The structure of imperfect minimal non-FC groups is quite well-understood. These groups are in particular locally finite. At the other end of the spectrum, a perfect locally finite minimal non-FC group must be a p-group. And it has been an open question for quite a while now, whether such groups exist or not.
An advanced variant of an interpolatory graphical display algorithm
2004
In this paper an advanced interpolatory graphical display algorithm based on cardinal B-spline functions is provided. It is well-known that B-spline functions are a flexible tool to design various scale rapresentations of a signal. The proposed method allows to display without recursion a function at any desiderable resolution so that only initial data and opportune vectors weight are involved. In this way the structure of the algorithm is independent across the scale and a computational efficiency is reached. In this paper mono and bi-dimensional vectors weight generated by means of centered cubic cardinal B-spline functions have been supplied. (© 2004 WILEY-VCH Verlag GmbH & Co. KGaA, Wei…