Search results for " natural language"

showing 2 items of 192 documents

Finite groups with all minimal subgroups solitary

2016

We give a complete classification of the finite groups with a unique subgroup of order p for each prime p dividing its order. All the groups considered in this paper will be finite. One of the most fruitful lines in the research in abstract group theory during the last years has been the study of groups in which the members of a certain family of subgroups satisfy a certain subgroup embedding property. The family of the subgroups of prime order (also called minimal subgroups) has attracted the interest of many mathematicians. For example, a well-known result of Itˆo (see [8, Kapitel III, Satz 5.3; 9]) states that a group of odd order with all minimal subgroups in the center is nilpotent. Th…

p-groupNormal subgroupFinite groupAlgebra and Number TheoryApplied MathematicsAstrophysics::Instrumentation and Methods for AstrophysicsMinimal subgroupGrups Teoria deComputer Science::Computation and Language (Computational Linguistics and Natural Language and Speech Processing)Fitting subgroupCombinatoricsMathematics::Group TheoryLocally finite groupExtra special groupComputer Science::General LiteratureOmega and agemo subgroupSolitary subgroupÀlgebraIndex of a subgroupFinite groupMATEMATICA APLICADAMathematics
researchProduct

On Prefix Normal Words

2011

We present a new class of binary words: the prefix normal words. They are defined by the property that for any given length $k$, no factor of length $k$ has more $a$'s than the prefix of the same length. These words arise in the context of indexing for jumbled pattern matching (a.k.a. permutation matching or Parikh vector matching), where the aim is to decide whether a string has a factor with a given multiplicity of characters, i.e., with a given Parikh vector. Using prefix normal words, we give the first non-trivial characterization of binary words having the same set of Parikh vectors of factors. We prove that the language of prefix normal words is not context-free and is strictly contai…

permutation matchingcontext-free languagesSearch engine indexingpre-necklacesBinary numberParikh vectorsComputer Science::Computation and Language (Computational Linguistics and Natural Language and Speech Processing)Lyndon wordsnon- standard pattern matchingLyndon wordsCombinatoricsPrefixjumbled pattern matchingPattern matchingParikh vectors; pre-necklaces; Lyndon words; context-free languages; jumbled pattern matching; permutation matching; non- standard pattern matching; indexingComputer Science::Formal Languages and Automata TheoryParikh vectors pre-necklaces Lyndon words context-free languages jumbled pattern matching permutation matching non-standard pattern matching indexingMathematicsindexing
researchProduct