Search results for "script"
showing 10 items of 5143 documents
Loop-free Gray code algorithm for the e-restricted growth functions
2011
The subject of Gray codes algorithms for the set partitions of {1,2,...,n} had been covered in several works. The first Gray code for that set was introduced by Knuth (1975) [5], later, Ruskey presented a modified version of [email protected]?s algorithm with distance two, Ehrlich (1973) [3] introduced a loop-free algorithm for the set of partitions of {1,2,...,n}, Ruskey and Savage (1994) [9] generalized [email protected]?s results and give two Gray codes for the set of partitions of {1,2,...,n}, and recently, Mansour et al. (2008) [7] gave another Gray code and loop-free generating algorithm for that set by adopting plane tree techniques. In this paper, we introduce the set of e-restricte…
Any AND-OR Formula of Size N Can Be Evaluated in Time $N^{1/2+o(1)}$ on a Quantum Computer
2007
Consider the problem of evaluating an AND-OR formula on an $N$-bit black-box input. We present a bounded-error quantum algorithm that solves this problem in time $N^{1/2+o(1)}$. In particular, approximately balanced formulas can be evaluated in $O(\sqrt{N})$ queries, which is optimal. The idea of the algorithm is to apply phase estimation to a discrete-time quantum walk on a weighted tree whose spectrum encodes the value of the formula.
A Note on Algebraic Sums of Subsets of the Real Line
2002
AbstractWe investigate the algebraic sums of sets for a large class of invari-ant ˙-ideals and ˙- elds of subsets of the real line. We give a simpleexample of two Borel subsets of the real line such that its algebraicsum is not a Borel set. Next we show a similar result to Proposition 2from A. Kharazishvili paper [4]. Our results are obtained for ideals withcoanalytical bases. 1 Introduction We shall work in ZFC set theory. By !we denote natural numbers. By 4wedenote the symmetric di erence of sets. The cardinality of a set Xwe denoteby jXj. By R we denote the real line and by Q we denote rational numbers. IfAand Bare subsets of R n and b2R , then A+B= fa+b: a2A^b2Bgand A+ b= A+ fbg. Simila…
Circular sturmian words and Hopcroft’s algorithm
2009
AbstractIn order to analyze some extremal cases of Hopcroft’s algorithm, we investigate the relationships between the combinatorial properties of a circular sturmian word (x) and the run of the algorithm on the cyclic automaton Ax associated to (x). The combinatorial properties of words taken into account make use of sturmian morphisms and give rise to the notion of reduction tree of a circular sturmian word. We prove that the shape of this tree uniquely characterizes the word itself. The properties of the run of Hopcroft’s algorithm are expressed in terms of the derivation tree of the automaton, which is a tree that represents the refinement process that, in the execution of Hopcroft’s alg…
Absolutely summing operators on C[0,1] as a tree space and the bounded approximation property
2010
Abstract Let X be a Banach space. For describing the space P ( C [ 0 , 1 ] , X ) of absolutely summing operators from C [ 0 , 1 ] to X in terms of the space X itself, we construct a tree space l 1 tree ( X ) on X. It consists of special trees in X which we call two-trunk trees. We prove that P ( C [ 0 , 1 ] , X ) is isometrically isomorphic to l 1 tree ( X ) . As an application, we characterize the bounded approximation property (BAP) and the weak BAP in terms of X ∗ -valued sequence spaces.
Discrete Derivatives for Atom-Pairs as a Novel Graph-Theoretical Invariant for Generating New Molecular Descriptors: Orthogonality, Interpretation an…
2013
This report presents a new mathematical method based on the concept of the derivative of a molecular graph (G) with respect to a given event (S) to codify chemical structure information. The derivate over each pair of atoms in the molecule is defined as ∂G/∂S(vi , vj )=(fi -2fij +fj )/fij , where fi (or fj ) and fij are the individual frequency of atom i (or j) and the reciprocal frequency of the atoms i and j, respectively. These frequencies characterize the participation intensity of atom pairs in S. Here, the event space is composed of molecular sub-graphs which participate in the formation of the G skeleton that could be complete (representing all possible connected sub-graphs) or comp…
Minimal nontrivial space complexity of probabilistic one- way turing machines
2005
Languages recognizable in o(log log n) space by probabilistic one — way Turing machines are proved to be regular. This solves an open problem in [4].
Counting in the Two Variable Guarded Logic with Transitivity
2005
We show that the extension of the two-variable guarded fragment with transitive guards (GF+TG) by functionality statements is undecidable. This gives immediately undecidability of the extension of GF+TG by counting quantifiers. The result is optimal, since both the three-variable fragment of the guarded fragment with counting quantifiers and the two-variable guarded fragment with transitivity are undecidable. We also show that the extension of GF+TG with functionality, where functional predicate letters appear in guards only, is decidable and of the same complexity as GF+TG. This fragment captures many expressive modal and description logics.
The Descriptive Complexity Approach to LOGCFL
1999
Building upon the known generalized-quantifier-based firstorder characterization of LOGCFL, we lay the groundwork for a deeper investigation. Specifically, we examine subclasses of LOGCFL arising from varying the arity and nesting of groupoidal quantifiers. Our work extends the elaborate theory relating monoidal quantifiers to NC1 and its subclasses. In the absence of the BIT predicate, we resolve the main issues: we show in particular that no single outermost unary groupoidal quantifier with FO can capture all the context-free languages, and we obtain the surprising result that a variant of Greibach's "hardest contextfree language" is LOGCFL-complete under quantifier-free BIT-free interpre…
On Weakly Locally Uniformly Rotund Banach Spaces
1999
Abstract We show that every normed space E with a weakly locally uniformly rotund norm has an equivalent locally uniformly rotund norm. After obtaining a σ -discrete network of the unit sphere S E for the weak topology we deduce that the space E must have a countable cover by sets of small local diameter, which in turn implies the renorming conclusion. This solves a question posed by Deville, Godefroy, Haydon, and Zizler. For a weakly uniformly rotund norm we prove that the unit sphere is always metrizable for the weak topology despite the fact that it may not have the Kadec property. Moreover, Banach spaces having a countable cover by sets of small local diameter coincide with the descript…