Search results for " function"

Packing dimension, intersection measures, and isometries

1997

Quantum Queries on Permutations with a Promise

2009

This paper studies quantum query complexities for deciding (exactly or with probability 1.0) the parity of permutations of n numbers, 0 through n *** 1. Our results show quantum mechanism is quite strong for this non-Boolean problem as it is for several Boolean problems: (i) For n = 3, we need a single query in the quantum case whereas we obviously need two queries deterministically. (ii) For even n , n /2 quantum queries are sufficient whereas we need n *** 1 queries deterministically. (iii) Our third result is for the problem deciding whether the given permutation is the identical one. For this problem, we show that there is a nontrivial promise such that if we impose that promise to the …

STURMIAN WORDS AND AMBIGUOUS CONTEXT-FREE LANGUAGES

1990

If x is a rational number, 0<x≤1, then A(x)c is a context-free language, where A(x) is the set of factors of the infinite Sturmian words with asymptotic density of 1’s smaller than or equal to x. We also prove a “gap” theorem i.e. A(x) can never be an unambiguous co-context-free language. The “gap” theorem is established by proving that the counting generating function of A(x) is transcendental. We show some links between Sturmian words, combinatorics and number theory.

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\).

On the signature of four-manifolds with universal covering spin

1993

In this note we study closed oriented 4-manifolds whose universal covering is spin and ask whether there are restrictions on the divisibility of the signature. Since any natural number appears as the signature of a connected sum of r 2,s, without the assumption on the universal covering there cannot exist any restrictions. Certainly, the most famous such restriction was proved by Rohlin in [10], where he showed that the signature a of a smooth 4-dimensional spin manifold is divisible by 16 (compare part (2) of our Main Theorem for a new proof). The Kummer surface K shows that this is the best possible general result. Dividing by a certain free holomorphic involution on K, one obtains the En…

On lacunary Toeplitz determinants

2014

By using Riemann--Hilbert problem based techniques, we obtain the asymptotic expansion of lacunary Toeplitz determinants $\det_N\big[ c_{\ell_a-m_b}[f] \big]$ generated by holomorhpic symbols, where $\ell_a=a$ (resp. $m_b=b$) except for a finite subset of indices $a=h_1,\dots, h_n$ (resp. $b=t_1,\dots, t_r$). In addition to the usual Szeg\"{o} asymptotics, our answer involves a determinant of size $n+r$.

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.