Results 11 to 20 of about 28,741 (192)
Chain recurrence, chain transitivity, Lyapunov functions and rigidity of Lagrangian submanifolds of optical hypersurfaces [PDF]
The aim of this paper is twofold. On the one hand, we discuss the notions of strong chain recurrence and strong chain transitivity for flows on metric spaces, together with their characterizations in terms of rigidity properties of Lipschitz Lyapunov ...
Abbondandolo, Alberto +2 more
core +2 more sources
On the omega-limit sets of tent maps [PDF]
For a continuous map f on a compact metric space (X,d), a subset D of X is internally chain transitive if for every x and y in D and every delta > 0 there is a sequence of points {x=x_0,x_1, ...,x_n=y} such that d(f(x_i),x_{i+1}) < delta for i=0,1, ...,n-
Barwell, Andrew +2 more
core +2 more sources
On the cognitive nature of verb transitivity in English [PDF]
The traditional view of the transitivity of a verb as its ability to have a direct complement in the accusative case does not reflect the core essence of this verb characteristic.
Gulevich Tatiana
doaj +1 more source
Phase Transitions in Dissipative Josephson Chains
ABSTRACTWe study the zero temperature phase transitions of a chain of Josephson junctions, taking into account the quantum fluctuations due to the charging energy and the effects of an Ohmic dissipation. We map the problem onto a generalized Coulomb gas model, which then is transformed into a sine-Gordon field theory.
BOBBERT PA +3 more
openaire +6 more sources
Markoff Chains with Reverse Transitions [PDF]
Not ...
openaire +2 more sources
Shadowing with chain transitivity
Let \(f:X\to X\) be a continuous surjective map on a compact metric space \(X\). A \(\delta\)-chain from \(x\) to \(y\) of length \(n\) is a finite sequence \(x_0=x\), \(x_1, \dots,x_n=y\) such that \(d(f(x_i),x_{i+1}) \leq\delta\) for \(i=0,\dots,n-1\). A sequence \(\xi=\{x_i\}^\infty_{i=0}\) is called a \(\delta\)-pseudo orbit if for any \(i\geq 0\),
Ahmadi Dastjerdi, Dawoud +1 more
openaire +1 more source
Faster Existential FO Model Checking on Posets [PDF]
We prove that the model checking problem for the existential fragment of first-order (FO) logic on partially ordered sets is fixed-parameter tractable (FPT) with respect to the formula and the width of a poset (the maximum size of an antichain).
HL Bodlaender +5 more
core +1 more source
Incomplete interval fuzzy preference relations for supplier selection in supply chain management
In the analytical hierarchy process (AHP), it needs the decision maker to establish a pairwise comparison matrix requires n(n–1)/2 judgments for a level with n criteria (or alternatives).
Yejun Xu +3 more
doaj +1 more source
Robustly chain transitive diffeomorphisms [PDF]
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
Shadowing, internal chain transitivity and α-limit sets [PDF]
20 pages, 3 ...
Chris Good +2 more
openaire +3 more sources

