Search results for "Normal"

showing 10 items of 2571 documents

C-Supplemented subgroups of finite groups

2000

A subgroup H of a group G is said to be c-supplemented in G if there exists a subgroup K of G such that HKa G and H\ K is contained in CoreGOHU .W e follow Hall's ideas to characterize the structure of the finite groups in which every subgroup is c-supplemented. Properties of c-supplemented subgroups are also applied to determine the structure of some finite groups.

Discrete mathematicsNormal subgroupCombinatoricsComplement (group theory)Maximal subgroupSubgroupLocally finite groupGeneral MathematicsCharacteristic subgroupIndex of a subgroupFitting subgroupMathematicsGlasgow Mathematical Journal
researchProduct

On the solutions to 1-Laplacian equation with L1 data

2009

AbstractIn the present paper we study the behaviour, as p goes to 1, of the renormalized solutions to the problems(0.1){−div(|∇up|p−2∇up)=finΩ,up=0on∂Ω, where p>1, Ω is a bounded open set of RN (N⩾2) with Lipschitz boundary and f belongs to L1(Ω). We prove that these renormalized solutions pointwise converge, up to “subsequences,” to a function u. With a suitable definition of solution we also prove that u is a solution to a “limit problem.” Moreover we analyze the situation occurring when more regular data f are considered.

Discrete mathematicsPointwise1-Laplace operatorRenormalized solutionsOpen setBoundary (topology)Function (mathematics)Nonlinear elliptic equationsLipschitz continuityRenormalized solutionBounded functionSummable dataLimit (mathematics)L1-data1Laplce operatorLaplace operatorAnalysisMathematicsJournal of Functional Analysis
researchProduct

Large subgroups of a finite group of even order

2011

It is shown that if G G is a group of even order with trivial center such that | G | > 2 | C G ( t ) | 3 |G|>2|C_{G}(t)|^{3} for some involution t ∈ G t\in G , then there exists a proper subgroup H H of G G such that | G | > | H | 2 |G|> |H|^{2} . If | G | > | C G ( t ) | 3 |G|>|C_{G}(t)|^{3} and k ( G ) k(G) is the class number of G G , then | G | ≤ k ( G ) 3 |G|\leq k(G)^{3} .

Discrete mathematicsPure mathematicsFinite groupConjugacy classLocally finite groupApplied MathematicsGeneral MathematicsCharacteristic subgroupCentralizer and normalizerMathematicsProceedings of the American Mathematical Society
researchProduct

On spectra of geometric operators on open manifolds and differentiable groupoids

2001

We use a pseudodifferential calculus on differentiable groupoids to obtain new analytical results on geometric operators on certain noncompact Riemannian manifolds. The first step is to establish that the geometric operators belong to a pseudodifferential calculus on an associated differentiable groupoid. This then leads to Fredholmness criteria for geometric operators on suitable noncompact manifolds, as well as to an inductive procedure to compute their essential spectra. As an application, we answer a question of Melrose on the essential spectrum of the Laplace operator on manifolds with multicylindrical ends.

Discrete mathematicsPure mathematicsHigher-dimensional algebraMathematics::Operator AlgebrasGeneral MathematicsEssential spectrumMathematics::Spectral TheoryOperator theoryCompact operatorQuasinormal operatorMathematics::K-Theory and HomologyDouble groupoidMathematics::Differential GeometryDifferentiable functionMathematics::Symplectic GeometryLaplace operatorMathematicsElectronic Research Announcements of the American Mathematical Society
researchProduct

Partial *-algebras of closable operators: A review

1996

This paper reviews the theory of partial *-algebras of closable operators in Hilbert space (partial O*-algebras), with some emphasis on partial GW*-algebras. First we discuss the general properties and the various types of partial *-algebras and partial O*-algebras. Then we summarize the representation theory of partial *-algebras, including a generalized Gel’fand-Naimark-Segal construction; the main tool here is the notion of positive sesquilinear form, that we study in some detail (extendability, normality, order structure, …). Finally we turn to automorphisms and derivations of partial O*-algebras, and their mutual relationship. The central theme here is to find conditions that guarante…

Discrete mathematicsPure mathematicsSesquilinear formmedia_common.quotation_subjectHilbert spaceStatistical and Nonlinear PhysicsAutomorphismRepresentation theorysymbols.namesakeOrder structuresymbolsMathematical PhysicsNormalitymedia_commonMathematics
researchProduct

A probabilistic meaning of certain quasinormal subgroups

2007

The role of the cyclic quasinormal subgroups has been recently described in groups both finite and infinite by S.Stonehewer and G.Zacher. This role can be better analyzed in the class of compact groups, obtaining restrictions for the probability that two randomly chosen elements commute. Mathematcs Subject Classification: 20D60, 20P05, 20D08

Discrete mathematicsSettore MAT/02 - AlgebraClass (set theory)Mutually commuting pairs commutativity degree compact groups quasinormal subgroupsProbabilistic logicSettore MAT/03 - GeometriaMeaning (existential)MathematicsInternational Journal of Algebra
researchProduct

A note on endomorphisms of hypercentral groups

2002

Abstract Let H be a subnormal subgroup of a hypercentral group G. We prove that endomorphisms of G are uniquely determined by their restrictions to H if and only if Hom(G/HG,G)=0, and draw some consequences from this fact.

Discrete mathematicsSubnormal subgroupAutomorphisms and endomorphisms of groupsPure mathematicsAlgebra and Number TheoryEndomorphismIf and only ifGroup (mathematics)Nilpotent and hypercentral groupsMathematicsJournal of Algebra
researchProduct

Finite Soluble Groups with Permutable Subnormal Subgroups

2001

Abstract A finite group G is said to be a PST -group if every subnormal subgroup of G permutes with every Sylow subgroup of G . We shall discuss the normal structure of soluble PST -groups, mainly defining a local version of this concept. A deep study of the local structure turns out to be crucial for obtaining information about the global property. Moreover, a new approach to soluble PT -groups, i.e., soluble groups in which permutability is a transitive relation, follows naturally from our vision of PST -groups. Our techniques and results provide a unified point of view for T -groups, PT -groups, and PST -groups in the soluble universe, showing that the difference between these classes is…

Discrete mathematicsSubnormal subgroupCombinatoricsComplement (group theory)Finite groupAlgebra and Number TheoryGroup (mathematics)Locally finite groupSylow theoremsComponent (group theory)Permutable primeMathematicsJournal of Algebra
researchProduct

Graph languages defined by systems of forbidden structures: A survey

1988

This paper deals with different ways of defining graph languages. These are the so-called forbidden structures. Some results on decision problems, their complexity, and set theoretic closure properties are scetched. A normal form, the minimal systems, are given. Finally the influence of the different kinds of forbidden structures on the descriptive power of the systems is shown.

Discrete mathematicsTheoretical computer scienceA-normal formVoltage graphGraph (abstract data type)Decision problemNull graphForbidden graph characterizationMathematics
researchProduct

Efficient CNF Encoding of Boolean Cardinality Constraints

2003

In this paper, we address the encoding into CNF clauses of Boolean cardinality constraints that arise in many practical applications. The proposed encoding is efficient with respect to unit propagation, which is implemented in almost all complete CNF satisfiability solvers. We prove the practical efficiency of this encoding on some problems arising in discrete tomography that involve many cardinality constraints. This encoding is also used together with a trivial variable elimination in order to re-encode parity learning benchmarks so that a simple Davis and Putnam procedure can solve them.

Discrete mathematicsTheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGESCardinalityUnit propagationComputer scienceConstrained optimizationData_CODINGANDINFORMATIONTHEORYVariable eliminationComputer Science::Computational ComplexityConjunctive normal formBoolean data typeSatisfiability
researchProduct