Search results for " function"
showing 10 items of 9395 documents
On Some Properties of the Dirichlet Problem at Resonance
2008
Abstract The boundary value problem at resonance 𝑥″ + 𝑥 = 𝑞 sin 𝑡 + 𝑓(𝑡,𝑥,𝑥′), 𝑥(0) = 0, 𝑥(π) = 0, is considered, where 𝑓 : [0,π] × 𝑹2 → 𝑹 is a bounded Carathéodory function, 𝑞 is a parameter. We state the multiplicity results without assuming that 𝑓 has limits.
Differential equations over polynomially bounded o-minimal structures
2002
We investigate the asymptotic behavior at +∞ of non-oscillatory solutions to differential equations y' = G(t, y), t > a, where G: R 1+l → R l is definable in a polynomially bounded o-minimal structure. In particular, we show that the Pfaffian closure of a polynomially bounded o-minimal structure on the real field is levelled.
Estimating norms inC*-algebras of discrete groups
1976
LetG be a discrete group, letK be a finite subset ofG and let χ K be the characteristic function ofK. Then χ K acts by convolution as a bounded operator onL2(G). We will prove that the norm |||χ K ||| of this operator always satisfies the following estimate: $$|||\chi _{\rm K} |||^2 \leqq k + 2\sqrt {w\left( {k - 1} \right)\left( {k - w} \right)} + \left( {k - 2} \right)\left( {k - w} \right)$$ . Here .
Quantum Query Complexity of Boolean Functions with Small On-Sets
2008
The main objective of this paper is to show that the quantum query complexity Q(f) of an N-bit Boolean function f is bounded by a function of a simple and natural parameter, i.e., M = |{x|f(x) = 1}| or the size of f's on-set. We prove that: (i) For $poly(N)\le M\le 2^{N^d}$ for some constant 0 < d < 1, the upper bound of Q(f) is $O(\sqrt{N\log M / \log N})$. This bound is tight, namely there is a Boolean function f such that $Q(f) = \Omega(\sqrt{N\log M / \log N})$. (ii) For the same range of M, the (also tight) lower bound of Q(f) is $\Omega(\sqrt{N})$. (iii) The average value of Q(f) is bounded from above and below by $Q(f) = O(\log M +\sqrt{N})$ and $Q(f) = \Omega (\log M/\log N+ \sqrt{N…
Improved Constructions of Quantum Automata
2008
We present a simple construction of quantum automata which achieve an exponential advantage over classical finite automata. Our automata use $\frac{4}{\epsilon} \log 2p + O(1)$ states to recognize a language that requires p states classically. The construction is both substantially simpler and achieves a better constant in the front of logp than the previously known construction of [2]. Similarly to [2], our construction is by a probabilistic argument. We consider the possibility to derandomize it and present some preliminary results in this direction.
Hausdorff dimension from the minimal spanning tree
1993
A technique to estimate the Hausdorff dimension of strange attractors, based on the minimal spanning tree of the point distribution is extensively tested in this work. This method takes into account in some sense the infimum requirement appearing in the definition of the Hausdorff dimension. It provides accurate estimates even for a low number of data points and it is especially suited to high-dimensional systems.
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 simple proof of the polylog counting ability of first-order logic
2007
The counting ability of weak formalisms (e.g., determining the number of 1's in a string of length N ) is of interest as a measure of their expressive power, and also resorts to complexity-theoretic motivations: the more we can count the closer we get to real computing power. The question was investigated in several papers in complexity theory and in weak arithmetic around 1985. In each case, the considered formalism (AC 0 -circuits, first-order logic, Δ 0 ) was shown to be able to count up to a polylogarithmic number. An essential part of the proofs is the construction of a 1-1 mapping from a small subset of {0, ..., N - 1} into a small initial segment. In each case the expressibility of …
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.
Complexity of decision trees for boolean functions
2004
For every positive integer k we present an example of a Boolean function f/sub k/ of n = (/sub k//sup 2k/) + 2k variables, an optimal deterministic tree T/sub k/' for f/sub k/ of complexity 2k + 1 as well as a nondeterministic decision tree T/sub k/ computing f/sub k/. with complexity k + 2; thus of complexity about 1/2 of the optimal deterministic decision tree. Certain leaves of T/sub k/ are called priority leaves. For every input a /spl isin/ {0, 1}/sup n/ if any of the parallel computation reaches a priority leaves then its label is f/sub k/ (a). If the priority leaves are not reached at all then the label on any of the remaining leaves reached by the computation is f/sub k/. (a).