Search results for "bound"
showing 10 items of 2948 documents
POLYNOMIAL GROWTH OF THE*-CODIMENSIONS AND YOUNG DIAGRAMS
2001
Let A be an algebra with involution * over a field F of characteristic zero and Id(A, *) the ideal of the free algebra with involution of *-identities of A. By means of the representation theory of the hyperoctahedral group Z 2wrS n we give a characterization of Id(A, *) in case the sequence of its *-codimensions is polynomially bounded. We also exhibit an algebra G 2 with the following distinguished property: the sequence of *-codimensions of Id(G 2, *) is not polynomially bounded but the *-codimensions of any T-ideal U properly containing Id(G 2, *) are polynomially bounded.
A conjecture on the number of conjugacy classes in ap-solvable group
1996
IfG is ap-solvable group, it is conjectured that k(G/O P (G) ≤ |G| p ′. The conjecture is easily obtained for solvable groups as a consequence of R. Knorr’s work on the k(GV) problem. Also, a related result is obtained: k(G/F(G)) is bounded by the index of a nilpotent injector ofG.
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…
The Minimum Amount of Useful Space: New Results and New Directions
2014
We consider minimal space requirements when using memory with restricted access policy (pushdown - hence giving pushdown automata (PDAs), and counter - hence giving counter automata (CAs)) in connection with two-way and realtime head motion. The main results are that: (i) loglogn is a tight space lower bound for accepting general nonregular languages on weak realtime PDAs, (ii) there exist unary nonregular languages accepted by realtime alternating CAs within weak logn space, (iii) there exist nonregular languages accepted by two-way DPADs within strong loglogn space, and, (iv) there exist unary nonregular languages accepted by two-way CAs with quantum and classical states within middle log…
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…
Old and New on the Quasihyperbolic Metric
1998
Let D be a proper subdomain of \( {\mathbb{R}^d}\). Following Gehring and Palka [GP] we define the quasihyperbolic distance between a pair x 1, x 2 of points in D as the infimum of \( {\smallint _\gamma }\frac{{ds}}{{D\left( {x,\partial D} \right)}}\) over all rectifiable curves γ joining x 1, x 2 in D. We denote the quasihyperbolic distance between x 1, x 2 by k D (x 1, x 2). As pointed out by Gehring and Osgood [GO], x 1 and x 2 can be joined by a quasihyperbolic geodesic; also see [Mr]. The quasihyperbolic metric is comparable to the usual hyperbolic metric in a simply connected plane domain by the Koebe distortion theorem. For a multiply connected plane domain D these two metrics are co…
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\).
Words and forbidden factors
2002
AbstractGiven a finite or infinite word v, we consider the set M(v) of minimal forbidden factors of v. We show that the set M(v) is of fundamental importance in determining the structure of the word v. In the case of a finite word w we consider two parameters that are related to the size of M(w): the first counts the minimal forbidden factors of w and the second gives the length of the longest minimal forbidden factor of w. We derive sharp upper and lower bounds for both parameters. We prove also that the second parameter is related to the minimal period of the word w. We are further interested to the algorithmic point of view. Indeed, we design linear time algorithm for the following two p…
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.