Search results for "Regular"
showing 10 items of 855 documents
k-Weakly almost convex groups and ? 1 ? $$\tilde M^3 $$
1993
We extend Cannon's notion ofk-almost convex groups which requires that for two pointsx, y on then-sphere in the Cayley graph which can be joined by a pathl1 of length ≤k, there is a second pathl2 in then-ball, joiningx andy, of bounded length ≤N(k). Ourk-weakly almost convexity relaxes this condition by requiring only thatl1 ∝l2 bounds a disk of area ≤C1(k)n1 - e(k) +C2(k). IfM3 is a closed 3-manifold with 3-weakly almost convex fundamental group, then π1∞\(\tilde M^3 = 0\).
On Fine and Wilf's theorem for bidimensional words
2003
AbstractGeneralizations of Fine and Wilf's Periodicity Theorem are obtained for the case of bidimensional words using geometric arguments. The domains considered constitute a large class of convex subsets of R2 which include most parallelograms. A complete discussion is provided for the parallelogram case.
Uniform properties of collections of convex bodies
1991
Running time to recognize nonregular languages by 2-way probabilistic automata
1991
R. Freivalds proved that the language {0m1m} can be recognized by 2-way probabilistic finite automata (2pfa) with arbitrarily high probability 1-ɛ. A.G.Greenberg and A.Weiss proved that no 2pfa can recognize this language in expected time \(T(n) = c^\circ{(n)}\). For arbitrary languages C.Dwork and L.Stockmeyer showed somewhat less: if a language L is recognized by a 2pfa in expected time \(T(n) = c^{n^\circ{(1)} }\), then L is regular. First, we improve this theorem replacing the expected time by the time with probability 1-ɛ. On the other hand, time bound by C.Dwork and L.Stockmeyer cannot be improved: for arbitrary k≥2 we exhibit a specific nonregular language that can be recognized by 2…
Introduction to Homotopy Theory
2001
Consider two manifolds X and Y together with a set of continuous maps f, g,... $$ f:X \to Y,x \to f(x) = y;x \in X,y \in Y. $$
Locally Convex Quasi C*-Algebras and Their Structure
2020
Throughout this chapter \({{\mathfrak A}}_{\scriptscriptstyle 0}[\| \cdot \|{ }_{\scriptscriptstyle 0}]\) denotes a unital C*-algebra and τ a locally convex topology on \({{\mathfrak A}}_{\scriptscriptstyle 0}\). Let \(\widetilde {{{\mathfrak A}}_{\scriptscriptstyle 0}}[\tau ]\) denote the completion of \({{\mathfrak A}}_{\scriptscriptstyle 0}\) with respect to the topology τ. Under certain conditions on τ, a subspace \({\mathfrak A}\) of \(\widetilde {{{\mathfrak A}}_{\scriptscriptstyle 0}}[\tau ]\), containing \({{\mathfrak A}}_{\scriptscriptstyle 0}\), will form (together with \({{\mathfrak A}}_{\scriptscriptstyle 0}\)) a locally convex quasi *-algebra \(({\mathfrak A}[\tau ],{{\mathfrak…
The Bourgain property and convex hulls
2007
Let (Ω, Σ, μ) be a complete probability space and let X be a Banach space. We consider the following problem: Given a function f: Ω X for which there is a norming set B ⊂ BX * such that Zf,B = {x * ○ f: x * ∈ B } is uniformly integrable and has the Bourgain property, does it follow that f is Birkhoff integrable? It turns out that this question is equivalent to the following one: Given a pointwise bounded family ℋ ⊂ ℝΩ with the Bourgain property, does its convex hull co(ℋ) have the Bourgain property? With the help of an example of D. H. Fremlin, we make clear that both questions have negative answer in general. We prove that a function f: Ω X is scalarly measurable provided that there is a n…
Quantum Algorithm for Dyck Language with Multiple Types of Brackets
2021
We consider the recognition problem of the Dyck Language generalized for multiple types of brackets. We provide an algorithm with quantum query complexity \(O(\sqrt{n}(\log n)^{0.5k})\), where n is the length of input and k is the maximal nesting depth of brackets. Additionally, we show the lower bound for this problem which is \(\varOmega (\sqrt{n}c^{k})\) for some constant c.
Product Integration for Weakly Singular Integral Equations In ℝm
1985
In this note we discuss the numerical solution of the second kind Fredholm integral equation: $$ y(t) = f(t) + \lambda \int\limits_{\Omega } {{{\psi }_{\alpha }}(|t - s|)g(t,s)y(s)ds,\;t \in \bar{\Omega },} $$ (1) Where \( \lambda \in ;\not{ \subset }\backslash \{ 0\} \) , the functions f,g are given and continuous, |.| denotes the Euclidean norm, and φα, 0 \alpha > 0} \\ {\left\{ {\begin{array}{*{20}{c}} {\ln (r),} & {j = 0} \\ {{{r}^{{ - j}}}} & {j > 0} \\ \end{array} } \right\},\alpha = m} \\ \end{array} ,} \right. $$ with Cj not depending on r. Here Ω _ is the closure of a bounded domain Ω⊂ℝm.
Equidistribution of Common Perpendicular Arcs
2019
In this chapter, we prove the equidistribution of the initial and terminal vectors of common perpendiculars of convex subsets, at the universal covering space level, for Riemannian manifolds and for metric and simplicial trees.