Search results for "rete"
showing 10 items of 3470 documents
Parabolic Subgroups of Artin Groups
1997
Abstract Let ( A , Σ) be an Artin system. For X ⊆ Σ, we denote by A X the subgroup of A generated by X . Such a group is called a parabolic subgroup of A . We reprove Van der Lek's theorem: “a parabolic subgroup of an Artin group is an Artin group.” We give an algorithm which decides whether two parabolic subgroups of an Artin group are conjugate. Let A be a finite type Artin group, and let A X be a parabolic subgroup with connected associated Coxeter graph. The quasi-centralizer of A X in A is the set of β in A such that β X β −1 = X . We prove that the commensurator of A X in A is equal to the normalizer of A X in A , and that this group is generated by A X and the quasi-centralizer of…
Centralizers of Parabolic Subgroups of Artin Groups of TypeAl,Bl, andDl
1997
Abstract Let ( A , Σ) be an Artin system of one of the types A l , B l , D l . For X ⊆ Σ, we denote by A X the subgroup of A generated by X . Such a group is called a parabolic subgroup of ( A , Σ). Let A X be a parabolic subgroup with connected associated Coxeter graph. We exhibit a generating set of the centralizer of A X in A . Moreover, we prove that there exists X ′ ⊆ Σ such that A X ′ is conjugate to A X and such that the centralizer of A X ′ in A is generated by the centers of all the parabolic subgroups containing A X ′ .
Injectors and Radicals in Products of Totally Permutable Groups
2003
Abstract Two subgroups H and K of a group G are said to be totally permutable if every subgroup of H permutes with every subgroup of K. In this paper the behaviour of radicals and injectors associated to Fitting classes in a product of pairwise totally permutable finite groups is studied.
Product of nilpotent subgroups
2000
We will say that a subgroup X of G satisfies property C in G if \({\rm C}_{G}(X\cap X^{{g}})\leqq X\cap X^{{g}}\) for all \({g}\in G\). We obtain that if X is a nilpotent subgroup satisfying property C in G, then XF(G) is nilpotent. As consequence it follows that if \(N\triangleleft G\) is nilpotent and X is a nilpotent subgroup of G then \(C_G(N\cap X)\leqq X\) implies that NX is nilpotent.¶We investigate the relationship between the maximal nilpotent subgroups satisfying property C and the nilpotent injectors in a finite group.
Incomplete vertices in the prime graph on conjugacy class sizes of finite groups
2013
Abstract Given a finite group G, consider the prime graph built on the set of conjugacy class sizes of G. Denoting by π 0 the set of vertices of this graph that are not adjacent to at least one other vertex, we show that the Hall π 0 -subgroups of G (which do exist) are metabelian.
Irredundant tandem motifs
2014
Eliminating the possible redundancy from a set of candidate motifs occurring in an input string is fundamental in many applications. The existing techniques proposed to extract irredundant motifs are not suitable when the motifs to search for are structured, i.e., they are made of two (or several) subwords that co-occur in a text string s of length n. The main effort of this work is studying and characterizing a compact class of tandem motifs, that is, pairs of substrings {m1, m2} occurring in tandem within a maximum distance of d symbols in s, where d is an integer constant given in input. To this aim, we first introduce the concept of maximality, related to four specific conditions that h…
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 partition of characters associated to nilpotent subgroups
1999
IfG is a finite solvable group andH is a maximal nilpotent subgroup ofG containingF(G), we show that there is a canonical basisP(G|H) of the space of class functions onG vanishing off anyG-conjugate ofH which consists of characters. ViaP(G|H) it is possible to partition the irreducible characters ofG into “blocks”. These behave like Brauerp-blocks and a Fong theory for them can be developed.
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).