Search results for "General Mathematics"
showing 10 items of 3795 documents
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.
On the supersoluble hypercentre of a finite group
2016
[EN] We give some sufficient conditions for a normal p-subgroup P of a finite group G to have every G-chief factor below it cyclic. The S-permutability of some p-subgroups of O^p(G)plays an important role. Some known results can be reproved and some others appear as corollaries of our main theorems.
Inducing characters and nilpotent subgroups
1996
If H H is a subgroup of a finite group G G and γ ∈ Irr ( H ) \gamma \in \operatorname {Irr}(H) induces irreducibly up to G G , we prove that, under certain odd hypothesis, F ( G ) F ( H ) \mathbf {F}(G) \mathbf {F}(H) is a nilpotent subgroup of G G .
Finite State Verifiers with Constant Randomness
2012
We give a new characterization of NL as the class of languages whose members have certificates that can be verified with small error in polynomial time by finite state machines that use a constant number of random bits, as opposed to its conventional description in terms of deterministic logarithmic-space verifiers. It turns out that allowing two-way interaction with the prover does not change the class of verifiable languages, and that no polynomially bounded amount of randomness is useful for constant-memory computers when used as language recognizers, or public-coin verifiers.
On a Conjecture by Christian Choffrut
2017
It is one of the most famous open problems to determine the minimum amount of states required by a deterministic finite automaton to distinguish a pair of strings, which was stated by Christian Choffrut more than thirty years ago. We investigate the same question for different automata models and we obtain new upper and lower bounds for some of them including alternating, ultrametric, quantum, and affine finite automata.
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…
A note on Taskinen's counterexamples on the problem of topologies of Grothendieck
1989
By the work of Taskinen (see [4, 5]), we know that there is a Fréchet space E such that Lb(E, l2) is not a (DF)-space. Moreover there is a Fréchet–Montel space F such that is not (DF). In this second example, the duality theorem of Buchwalter (cf. [2, §45.3]) can be applied to obtain that and hence is a (gDF)-space (cf. [1, Ch. 12 or 3, Ch. 8]). The (gDF)-spaces were introduced by several authors to extend the (DF)-spaces of Grothendieck and to provide an adequate frame to consider strict topologies.
On a Category of Extensional Fuzzy Rough Approximation L-valued Spaces
2016
We establish extensionality of some upper and lower fuzzy rough approximation operators on an L-valued set. Taking as the ground basic properties of these operators, we introduce the concept of an (extensional) fuzzy rough approximation L-valued space. We apply fuzzy functions satisfying certain continuity-type conditions, as morphisms between such spaces, and in the result obtain a category \(\mathcal{FRA}{} \mathbf{SPA}(L)\) of fuzzy rough approximation L-valued spaces. An interpretation of fuzzy rough approximation L-valued spaces as L-fuzzy (di)topological spaces is presented and applied for constructing examples in category \(\mathcal{FRA}{} \mathbf{SPA}(L)\).
Common fixed points for discontinuous mappings in fuzzy metric spaces
2008
In this paper we prove some common fixed point theorems for fuzzy contraction respect to a mapping, which satisfies a condition of weak compatibility. We deduce also fixed point results for fuzzy contractive mappings in the sense of Gregori and Sapena.
Two-Variable First-Order Logic with Equivalence Closure
2012
We consider the satisfiability and finite satisfiability problems for extensions of the two-variable fragment of first-order logic in which an equivalence closure operator can be applied to a fixed number of binary predicates. We show that the satisfiability problem for two-variable, first-order logic with equivalence closure applied to two binary predicates is in 2-NExpTime, and we obtain a matching lower bound by showing that the satisfiability problem for two-variable first-order logic in the presence of two equivalence relations is 2-NExpTime-hard. The logics in question lack the finite model property; however, we show that the same complexity bounds hold for the corresponding finite sa…