نتایج جستجو برای: totally bounded

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

2007
BORIS HASSELBLATT

The literature contains several extensions of the standard definitions of topological entropy for a continuous self-map f : X→X from the case when X is a compact metric space to the case when X is allowed to be noncompact. These extensions all require the space X to be totally bounded, or equivalently to have a compact completion, and are invariants of uniform conjugacy. When themap f is unifor...

2007
Janna Burman Shay Kutten

This paper presents an improved and time-optimal self-stabilizing algorithm for a major task in distributed computinga rooted spanning tree construction. Our solution is decentralized (“truly distributed”), uses a bounded memory and is not based on the assumption that either n (the number of nodes), or diam (the actual diameter of the network), or an existence of cycles in the network are known...

Journal: :Applied Categorical Structures 2013
John Frith Anneliese Schauerte

Quasi-nearness biframes provide an asymmetric setting for the study of nearness; in [1] a completion (called a quasi-completion) was constructed for such structures and in [2] completeness was characterized in terms of the convergence of regular Cauchy bifilters. In this talk, questions of functoriality for this quasi-completion are considered and one sees that having enough regular Cauchy bifi...

Journal: :Mathematische Zeitschrift 2023

Abstract We give a short geometric proof of result Soardi and Woess Salvatori that quasitransitive graph is amenable if only its automorphism group unimodular. also strengthen one direction by showing compactly generated totally disconnected locally compact admits proper Lipschitz action on bounded degree then pass via the notion amenability group, which has previously been studied second autho...

Journal: :J. Symb. Log. 2012
Saharon Shelah Pierre Simon

We address the following question: Can we expand an NIP theory by adding a linear order such that the expansion is still NIP? Easily, if acl(A)=A for all A, then this is true. Otherwise, we give counterexamples. More precisely, there is a totally categorical theory for which every expansion by a linear order has IP. There is also an ω-stable NDOP theory for which every expansion by a linear ord...

2010
Michael Brannan Ebrahim Samei

Let G be a locally compact group, and let A(G) and VN(G) be its Fourier algebra and group von Neumann algebra, respectively. In this paper we consider the similarity problem for A(G): Is every bounded representation of A(G) on a Hilbert space H similar to a ∗-representation? We show that the similarity problem for A(G) has a negative answer if and only if there is a bounded representation of A(...

Journal: :iranian journal of fuzzy systems 2012
jin-xuan fang hui zhang

the notion of generalized locally bounded $i$-topological vectorspaces is introduced. some of their important properties arestudied. the relationship between this kind of spaces and thelocally bounded $i$-topological vector spaces introduced by wu andfang [boundedness and locally bounded fuzzy topological vectorspaces, fuzzy math. 5 (4) (1985) 87$-$94] is discussed. moreover, wealso use the fam...

Journal: :Journal of Computer and System Sciences 2021

Given a subset of states $S$ deterministic finite automaton and word $w$, the preimage is all mapped to state in by action $w$. We study three natural problems concerning words giving certain preimages. The first problem whether, for given subset, there exists \emph{extending} (giving larger preimage). second whether \emph{totally extending} whole set as preimage)---equivalently, an \emph{avoid...

2015
RAF CLUCKERS GEORGES COMTE

We prove an analog of the Yomdin–Gromov lemma for p-adic definable sets and more broadly in a non-Archimedean definable context. This analog keeps track of piecewise approximation by Taylor polynomials, a nontrivial aspect in the totally disconnected case. We apply this result to bound the number of rational points of bounded height on the transcendental part of p-adic subanalytic sets, and to ...

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

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