نتایج جستجو برای: admitting center map

تعداد نتایج: 476497  

2005
YAKOV PESIN KE ZHANG

Given a uniformly expanding map of two intervals we describe a large class of potentials admitting unique equilibrium measures. This class includes all Hölder continuous potentials but goes far beyond them. We also construct a family of continuous but not Hölder continuous potentials for which we observe phase transitions. This provides a version of the example in [9] for uniformly expanding maps.

2003
Guido Blankenstein

This paper develops the reduction theory of implicit Hamiltonian systems admitting a symmetry group at a singular value of the momentum map. The results naturally extend those known for (explicit) Hamiltonian systems described by Poisson brackets. keywords: implicit Hamiltonian systems, Dirac structures, symmetry, reduction

Journal: :Journal of Geometry and Physics 2013

Journal: :bulletin of the iranian mathematical society 2013
s. saeidi h. haydari

let $x$ be a reflexive banach space, $t:xto x$ be a nonexpansive mapping with $c=fix(t)neqemptyset$ and $f:xto x$ be $delta$-strongly accretive and $lambda$- strictly pseudocotractive with $delta+lambda>1$. in this paper, we present modified hybrid steepest-descent methods, involving sequential errors and functional errors with functions admitting a center, which generate convergent sequences t...

2008
Tomohiro Kawakami

zw Let G be a finite abelian group and M an o-minimal expansion of Rexp = (R, +, ·, <, e) admitting the C∞ cell decomposition. Everything is considered in M. We prove that every definable C∞G manifold is affine. Moreover we prove that if X1, . . . , Xn (resp. Y1, . . . , Yn) are definable C ∞G submanifolds of a definable C∞G manifold X (resp. Y ) in general position, then every definable CG map...

Journal: :Physical review letters 2004
David Poulin Robin Blume-Kohout Raymond Laflamme Harold Ollivier

We present an efficient quantum algorithm to measure the average fidelity decay of a quantum map under perturbation using a single bit of quantum information. Our algorithm scales only as the complexity of the map under investigation. Thus for those maps admitting an efficient gate decomposition, it provides an exponential speedup over known classical procedures. Fidelity decay is important in ...

2009
Nika Naghavi Vasilis Friderikos

In this paper a multi-hop infrastructure based wireless mesh network (WMN), consisting of mesh access points (MAPs) and mesh client (flow) with a hierarchical architecture is considered. The association of each flow-MAP and the multi-hop backhaul routing from the associated MAP to the Gateway, determine the available bandwidth for admitting or rejecting a flow. The main focus of this paper is t...

Journal: :Int. J. Math. Mathematical Sciences 2005
Esther Barrabés David Juher

We answer the following question: given any n ∈ N, which is the minimum number of endpoints en of a tree admitting a zero-entropy map f with a periodic orbit of period n? We prove that en = s1s2 ···sk − ∑k i=2 sisi+1 ···sk, where n = s1s2 ···sk is the decomposition of n into a product of primes such that si ≤ si+1 for 1 ≤ i < k. As a corollary, we get a criterion to decide whether a map f defin...

2008
Katsunori Iwasaki Takato Uehara

We show that S. Saito’s fixed point formula serves as a powerful tool for counting the number of isolated periodic points of an area-preserving surface map admitting periodic curves. His notion of periodic curves of types I and II plays a central role in our discussion. We establish a Shub-Sullivan type result on the stability of local indices under iterations of the map, the finiteness of the ...

Journal: :Annales Fennici Mathematici 2021

We show that every geodesic metric space admitting an injective continuous map into the plane as well planar graph has Nagata dimension at most two, hence asymptotic two. This relies on and answers a question in recent work by Fujiwara Papasoglu. conclude all three-dimensional Hadamard manifolds have three. As consequence, such are absolute Lipschitz retracts.

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید