Search results for "CALL"
showing 10 items of 2320 documents
Real groups and Sylow 2-subgroups
2016
Abstract If G is a finite real group and P ∈ Syl 2 ( G ) , then P / P ′ is elementary abelian. This confirms a conjecture of Roderick Gow. In fact, we prove a much stronger result that implies Gow's conjecture.
Some Questions of Heinrich on Ultrapowers of Locally Convex Spaces
1993
In this note we treat some open problems of Heinrich on ultrapowers of locally convex spaces. In section 1 we investigate the localization of bounded sets in the full ultrapower of a locally convex space, in particular the coincidence of the full and the bounded ultrapower, mainly concentrating in the case of (DF)-spaces. In section 2 we provide a partial answer to a question of Heinrich on commutativity of strict inductive limits and ultrapowers. In section 3 we analyze the relation between some natural candidates for the notion of superreflexivity in the setting of Frechet spaces. We give an example of a Frechet-Schwartz space which is not the projective limit of a sequence of superreflex…
Unary Languages Recognized by Two-Way One-Counter Automata
2014
A two-way deterministic finite state automaton with one counter (2D1CA) is a fundamental computational model that has been examined in many different aspects since sixties, but we know little about its power in the case of unary languages. Up to our knowledge, the only known unary nonregular languages recognized by 2D1CAs are those formed by strings having exponential length, where the exponents form some trivial unary regular language. In this paper, we present some non-trivial subsets of these languages. By using the input head as a second counter, we present simulations of two-way deterministic finite automata with linearly bounded counters and linear–space Turing machines. We also show …
Generalized Lebesgue points for Sobolev functions
2017
In this article, we show that a function $f\in M^{s,p}(X),$ $0<s\leq 1,$ $0<p<1,$ where $X$ is a doubling metric measure space, has generalized Lebesgue points outside a set of $\mathcal{H}^h$-Hausdorff measure zero for a suitable gauge function $h.$
On the use of relational expressions in the design of efficient algorithms
2005
Relational expressions have finite binary relations as arguments and the operations are composition (·), closure (*), inverse (−1), and union (U). The efficient computation of the relation denoted by a relational expression is considered, and a tight bound is established on the complexity of the algorithm suggested by Hunt, Szymanski and Ullman. The result implies a unified method for deriving efficient algorithms for many problems in parsing. For example, optimal algorithms are derived for strong LL(1) and strong LL(2) parser construction and an efficient polynomialtime algorithm is derived for determining the inessential error entries in an LR(1) parsing table.
Finite groups with some C-normal minimal subgroups
2000
Abstract Let G be a finite group. The question of how the properties of its minimal subgroups influence the structure of G is of considerable interest for some scholars. Several authors have investigated this question by using normal or quasinormal conditions. In this paper we use c -normal condition on minimal subgroups to characterize the structure of G through the theory of formations.
A reduction theorem for a conjecture on products of two π -decomposable groups
2013
[EN] For a set of primes pi, a group X is said to be pi-decomposable if X = X-pi x X-pi' is the direct product of a pi-subgroup X-pi and a pi'-subgroup X-pi', where pi' is the complementary of pi in the set of all prime numbers. The main result of this paper is a reduction theorem for the following conjecture: "Let pi be a set of odd primes. If the finite group G = AB is a product of two pi-decomposable subgroups A = A(pi) x A(pi') and B = B-pi x B-pi', then A(pi)B(pi) = B(pi)A(pi) and this is a Hall pi-subgroup of G." We establish that a minimal counterexample to this conjecture is an almost simple group. The conjecture is then achieved in a forthcoming paper. (C) 2013 Elsevier Inc. All ri…
A note on a result of Guo and Isaacs about p-supersolubility of finite groups
2016
In this note, global information about a finite group is obtained by assuming that certain subgroups of some given order are S-semipermutable. Recall that a subgroup H of a finite group G is said to be S-semipermutable if H permutes with all Sylow subgroups of G of order coprime to . We prove that for a fixed prime p, a given Sylow p-subgroup P of a finite group G, and a power d of p dividing such that , if is S-semipermutable in for all normal subgroups H of P with , then either G is p-supersoluble or else . This extends the main result of Guo and Isaacs in (Arch. Math. 105:215-222 2015). We derive some theorems that extend some known results concerning S-semipermutable subgroups.
Superiority Of One-Way And Realtime Quantum Machines
2012
In automata theory, quantum computation has been widely examined for finite state machines, known as quantum finite automata (QFAs), and less attention has been given to QFAs augmented with counters or stacks. In this paper, we focus on such generalizations of QFAs where the input head operates in one-way or realtime mode, and present some new results regarding their superiority over their classical counterparts. Our first result is about the nondeterministic acceptance mode: Each quantum model architecturally intermediate between realtime finite state automaton and one-way pushdown automaton (one-way finite automaton, realtime and one-way finite automata with one-counter, and realtime push…
Banach spaces which are somewhat uniformly noncreasy
2003
AbstractWe consider a family of spaces wider than r-UNC spaces and we give some fixed point results in the setting of these spaces.