Search results for "Maxima"

showing 10 items of 371 documents

Bounds for minimum feedback vertex sets in distance graphs and circulant graphs

2008

Graphs and Algorithms

Discrete mathematicsGeneral Computer Science[INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS]Neighbourhood (graph theory)[ INFO.INFO-DM ] Computer Science [cs]/Discrete Mathematics [cs.DM][INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS][INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]Feedback arc setTheoretical Computer ScienceCombinatorics[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM]Circulant graphChordal graphIndependent setDiscrete Mathematics and CombinatoricsMaximal independent setFeedback vertex setRegular graph[ INFO.INFO-DS ] Computer Science [cs]/Data Structures and Algorithms [cs.DS]MathematicsMathematicsofComputing_DISCRETEMATHEMATICS
researchProduct

Equivalence classes of permutations modulo descents and left-to-right maxima

2014

Abstract In a recent paper [2], the authors provide enumerating results for equivalence classes of permutations modulo excedances. In this paper we investigate two other equivalence relations based on descents and left-to-right maxima. Enumerating results are presented for permutations, involutions, derangements, cycles and permutations avoiding one pattern of length three.

Discrete mathematicsMathematics::CombinatoricsModulo[ MATH.MATH-CO ] Mathematics [math]/Combinatorics [math.CO][MATH.MATH-CO] Mathematics [math]/Combinatorics [math.CO]CombinatoricsCatalan numberPermutationMotzkin numberComputingMethodologies_SYMBOLICANDALGEBRAICMANIPULATION[MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO]MaximaEquivalence classComputingMilieux_MISCELLANEOUSDescent (mathematics)Bell numberMathematicsMathematicsofComputing_DISCRETEMATHEMATICS
researchProduct

Hoffman's Error Bound, Local Controllability, and Sensitivity Analysis

2000

Our aim is to present sufficient conditions ensuring Hoffman's error bound for lower semicontinuous nonconvex inequality systems and to analyze its impact on the local controllability, implicit function theorem for (non-Lipschitz) multivalued mappings, generalized equations (variational inequalities), and sensitivity analysis and on other problems like Lipschitzian properties of polyhedral multivalued mappings as well as weak sharp minima or linear conditioning. We show how the information about our sufficient conditions can be used to provide a computable constant such that Hoffman's error bound holds. We also show that this error bound is nothing but the classical Farkas lemma for linear …

Discrete mathematicsMaxima and minimaControllabilityLinear inequalityControl and OptimizationApplied MathematicsErgodicityVariational inequalityApplied mathematicsConstant (mathematics)Farkas' lemmaImplicit function theoremMathematicsSIAM Journal on Control and Optimization
researchProduct

ℏ-Normalizers and local definitions of saturated formations of finite groups

1989

We define, in each finite groupG, h-normalizers associated with a Schunck class ℏ of the formEΦ f with f a formation. We use these normalizers in order to give some sufficient conditions for a saturated formation of finite groups to have a maximal local definition.

Discrete mathematicsMaximal subgroupClass (set theory)Pure mathematicsFinite groupConjugacy classGeneral MathematicsOrder (group theory)Algebra over a fieldNilpotent groupMathematicsIsrael Journal of Mathematics
researchProduct

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

General inductive inference types based on linearly-ordered sets

1996

In this paper, we reconsider the definitions of procrastinating learning machines. In the original definition of Freivalds and Smith [FS93], constructive ordinals are used to bound mindchanges. We investigate the possibility of using arbitrary linearly ordered sets to bound mindchanges in a similar way. It turns out that using certain ordered sets it is possible to define inductive inference types more general than the previously known ones. We investigate properties of the new inductive inference types and compare them to other types.

Discrete mathematicsOrdered setRecursive functionsInductive reasoningConstructiveMaximal elementMathematics
researchProduct

Maximal function estimates and self-improvement results for Poincaré inequalities

2018

Our main result is an estimate for a sharp maximal function, which implies a Keith–Zhong type self-improvement property of Poincaré inequalities related to differentiable structures on metric measure spaces. As an application, we give structure independent representation for Sobolev norms and universality results for Sobolev spaces. peerReviewed

Discrete mathematicsPure mathematicsGeneral Mathematics010102 general mathematicsAlgebraic geometryharmoninen analyysi01 natural sciencesUniversality (dynamical systems)Sobolev inequalitySobolev spacesymbols.namesakeNumber theoryinequalities0103 physical sciencesPoincaré conjecturesymbolsharmonic analysisMaximal function010307 mathematical physicsDifferentiable function0101 mathematicsfunktionaalianalyysiepäyhtälötMathematics
researchProduct

On nilpotent Moufang loops with central associators

2007

Abstract In this paper, we investigate Moufang p-loops of nilpotency class at least three for p > 3 . The smallest examples have order p 5 and satisfy the following properties: (1) They are of maximal nilpotency class, (2) their associators lie in the center, and (3) they can be constructed using a general form of the semidirect product of a cyclic group and a group of maximal class. We present some results concerning loops with these properties. As an application, we classify proper Moufang loops of order p 5 , p > 3 , and collect information on their multiplication groups.

Discrete mathematicsPure mathematicsSemidirect productAlgebra and Number TheoryLoops of maximal classGroup (mathematics)Moufang loopsMathematics::Rings and AlgebrasLoops of maximal claCyclic groupCenter (group theory)Nilpotent loopsSemidirect product of loopsNilpotent loopNilpotentMathematics::Group TheorySettore MAT/02 - AlgebraOrder (group theory)MultiplicationNilpotent groupMoufang loopMathematics
researchProduct

Maximal regularity for Kolmogorov operators in L2 spaces with respect to invariant measures

2006

Abstract We prove an optimal embedding result for the domains of Kolmogorov (or degenerate hypoelliptic Ornstein–Uhlenbeck) operators in L 2 spaces with respect to invariant measures. We use an interpolation method together with optimal L 2 estimates for the space derivatives of T ( t ) f near t = 0 , where T ( t ) is the Ornstein–Uhlenbeck semigroup and f is any function in L 2 .

Discrete mathematicsPure mathematicsSemigroupApplied MathematicsGeneral MathematicsDegenerate energy levelsInvariant measureMathematics::ProbabilityDegenerate Ornstein–Uhlenbeck operatorHypoellipticityHypoelliptic operatorEmbeddingMaximal regularityInvariant (mathematics)MathematicsJournal de Mathématiques Pures et Appliquées
researchProduct

Restriction of odd degree characters and natural correspondences

2016

Let $q$ be an odd prime power, $n > 1$, and let $P$ denote a maximal parabolic subgroup of $GL_n(q)$ with Levi subgroup $GL_{n-1}(q) \times GL_1(q)$. We restrict the odd-degree irreducible characters of $GL_n(q)$ to $P$ to discover a natural correspondence of characters, both for $GL_n(q)$ and $SL_n(q)$. A similar result is established for certain finite groups with self-normalizing Sylow $p$-subgroups. We also construct a canonical bijection between the odd-degree irreducible characters of $S_n$ and those of $M$, where $M$ is any maximal subgroup of $S_n$ of odd index; as well as between the odd-degree irreducible characters of $G = GL_n(q)$ or $GU_n(q)$ with $q$ odd and those of $N_{G}…

Discrete mathematicsRational numberGeneral Mathematics010102 general mathematicsSylow theoremsGroup Theory (math.GR)Absolute Galois group01 natural sciencesCombinatoricsMaximal subgroupMathematics::Group TheoryCharacter (mathematics)0103 physical sciencesFOS: MathematicsBijection010307 mathematical physicsRepresentation Theory (math.RT)0101 mathematicsBijection injection and surjectionMathematics::Representation TheoryPrime powerMathematics - Group TheoryMathematics - Representation TheoryMathematics
researchProduct