Search results for "Bounded function"
showing 10 items of 508 documents
Varieties of algebras with pseudoinvolution: Codimensions, cocharacters and colengths
2022
Abstract Let A be a finitely generated superalgebra with pseudoinvolution ⁎ over an algebraically closed field F of characteristic zero. In this paper we develop a theory of polynomial identities for this kind of algebras . In particular, we shall consider three sequences that can be attached to Id ⁎ ( A ) , the T 2 ⁎ -ideal of identities of A: the sequence of ⁎-codimensions c n ⁎ ( A ) , the sequence of ⁎-cocharacter χ 〈 n 〉 ⁎ ( A ) and the ⁎-colength sequence l n ⁎ ( A ) . Our purpose is threefold. First we shall prove that the ⁎-codimension sequence is eventually non-decreasing, i.e., c n ⁎ ( A ) ≤ c n + 1 ⁎ ( A ) , for n large enough. Secondly, we study superalgebras with pseudoinvoluti…
Character degrees, derived length and Sylow normalizers
1997
Let P be a Sylow p-subgroup of a monomial group G. We prove that dl $ ({\Bbb N}_G (P)/P') $ is bounded by the number of irreducible character degrees of G which are not divisible by p.
Bounded Bi-ideals and Linear Recurrence
2013
Bounded bi-ideals are a subclass of uniformly recurrent words. We introduce the notion of completely bounded bi-ideals by imposing a restriction on their generating base sequences. We prove that a bounded bi-ideal is linearly recurrent if and only if it is completely bounded.
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.
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…
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…
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 .