Search results for "Bounded"
showing 10 items of 658 documents
On languages factorizing the free monoid
1996
A language X⊂A* is called factorizing if there exists a language Y⊂A* such that XY = A* This work was partially supported by ESPRIT-EBRA project ASMICS contact 6317 and project 40% MURST “Algoritmi, Modelli di Calcolo e Strutture Informative”. and the product is unambiguous. First we give a combinatorial characterization of factorizing languages. Further we prove that it is decidable whether a regular language X is factorizing and we construct an automaton recognizing the corresponding language Y. For finite languages we show that it suffices to consider words of bounded length. A complete characterization of factorizing languages with three words and explicit regular expression for the co…
Polynomial Identities of Algebras of Small Dimension
2009
It is well known that given an associative algebra or a Lie algebra A, its codimension sequence c n (A) is either polynomially bounded or grows at least as fast as 2 n . In [2] we proved that for a finite dimensional (in general nonassociative) algebra A, dim A = d, the sequence c n (A) is also polynomially bounded or c n (A) ≥ a n asymptotically, for some real number a > 1 which might be less than 2. Nevertheless, for d = 2, we may take a = 2. Here we prove that for d = 3 the same conclusion holds. We also construct a five-dimensional algebra A with c n (A) < 2 n .
On the decision problem for the guarded fragment with transitivity
2002
The guarded fragment with transitive guards, [GF+TG], is an extension of GF in which certain relations are required to be transitive, transitive predicate letters appear only in guards of the quantifiers and the equality symbol may appear everywhere. We prove that the decision problem for [GF+TG] is decidable. This answers the question posed in (Ganzinger et al., 1999). Moreover, we show that the problem is 2EXPTIME-complete. This result is optimal since the satisfiability problem for GF is 2EXPTIME-complete (Gradel, 1999). We also show that the satisfiability problem for two-variable [GF+TG] is NEXPTIME-hard in contrast to GF with bounded number of variables for which the satisfiability pr…
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\).
Composition of quasiconformal mappings and functions in Triebel-Lizorkin spaces
2012
Let α > 0 and p ∈ [1, ∞) satisfy αp ≤ n. Suppose that f: Rn Rn is a K-quasiconformal mapping and let u ∈ Wα, p(Rn) have compact support. We find an optimal value of β = β(α, K, n) such that u○f ∈ Wβ, p(Rn). We also give an answer to the analogous problem where we moreover assume that u is bounded.
A bound on the p-length of p-solvable groups
2013
Let G be a finite p-solvable group and P a Sylow p-subgroup of G. Suppose that $\gamma_{l(p-1)}(P)\subseteq \gamma_r(P)^{p^s}$ for $l(p-1)<r+s(p-1)$, then the p-length is bounded by a function depending on l.
Hölder inequality for functions that are integrable with respect to bilinear maps
2008
Let $(\Omega, \Sigma, \mu)$ be a finite measure space, $1\le p<\infty$, $X$ be a Banach space $X$ and $B:X\times Y \to Z$ be a bounded bilinear map. We say that an $X$-valued function $f$ is $p$-integrable with respect to $B$ whenever $\sup_{\|y\|=1} \int_\Omega \|B(f(w),y)\|^p\,d\mu<\infty$. We get an analogue to Hölder's inequality in this setting.
A Star-Variety With Almost Polynomial Growth
2000
Abstract Let F be a field of characteristic zero. In this paper we construct a finite dimensional F -algebra with involution M and we study its ∗ -polynomial identities; on one hand we determine a generator of the corresponding T -ideal of the free algebra with involution and on the other we give a complete description of the multilinear ∗ -identities through the representation theory of the hyperoctahedral group. As an outcome of this study we show that the ∗ -variety generated by M , var( M , ∗ ) has almost polynomial growth, i.e., the sequence of ∗ -codimensions of M cannot be bounded by any polynomial function but any proper ∗ -subvariety of var( M , ∗ ) has polynomial growth. If G 2 is…
Operators on PIP-Spaces and Indexed PIP-Spaces
2009
As already mentioned, the basic idea of pip-spaces is that vectors should not be considered individually, but only in terms of the subspaces V r (r Є F), the building blocks of the structure. Correspondingly, an operator on a pipspace should be defined in terms of assaying subspaces only, with the proviso that only continuous or bounded operators are allowed. Thus an operator is a coherent collection of continuous operators. We recall that in a nondegenerate pip-space, every assaying subspace V r carries its Mackey topology \(\tau (V_r , V \bar{r})\) and thus its dual is \(V \bar{r}\). This applies in particular to \(V^{\#}\) and V itself. For simplicity, a continuous linear map between two…
Browder's theorems through localized SVEP
2005
A bounded linear operator T ∈ L(X) on aBanach space X is said to satisfy “Browder’s theorem” if the Browder spectrum coincides with the Weyl spectrum. T ∈ L(X) is said to satisfy “a-Browder’s theorem” if the upper semi-Browder spectrum coincides with the approximate point Weyl spectrum. In this note we give several characterizations of operators satisfying these theorems. Most of these characterizations are obtained by using a localized version of the single-valued extension property of T. In the last part we shall give some characterizations of operators for which “Weyl’s theorem” holds.