Search results for "Applied Mathematics"

showing 10 items of 4379 documents

Brauer’s Height Zero Conjecture for principal blocks

2021

Abstract We prove the other half of Brauer’s Height Zero Conjecture in the case of principal blocks.

CombinatoricsConjectureApplied MathematicsGeneral Mathematics010102 general mathematics0103 physical sciencesPrincipal (computer security)Zero (complex analysis)010307 mathematical physics0101 mathematics01 natural sciencesMathematicsJournal für die reine und angewandte Mathematik (Crelles Journal)
researchProduct

Optimal Locations and Inner Products

1997

Abstract In a normed space X , we consider objective functions which depend on the distances between a variable point and the points of certain finite sets A . A point where such a function attains its minimum on X is generically called an optimal location. In this paper we obtain characterizations of inner product spaces with properties connecting optimal locations and the convex hull of A or barycenters of points of A with well chosen weights. We thus generalize several classical results about characterization of inner product spaces.

CombinatoricsConvex hullInner product spaceApplied MathematicsMathematical analysisPoint (geometry)Function (mathematics)Characterization (mathematics)Finite setAnalysisNormed vector spaceVariable (mathematics)MathematicsJournal of Mathematical Analysis and Applications
researchProduct

Testing for selectivity in the dependence of random variables on external factors

2008

Random variables AA and BB, whose joint distribution depends on factors (x,y)(x,y), are selectively influenced by xx and yy, respectively, if AA and BB can be represented as functions of, respectively, (x,SA,C)(x,SA,C) and (y,SB,C)(y,SB,C), where SA,SB,CSA,SB,C are stochastically independent and do not depend on (x,y)(x,y). Selective influence implies selective dependence of marginal distributions on the respective factors: thus no parameter of AA may depend on yy. But parameters characterizing stochastic interdependence of AA and BB, such as their mixed moments, are generally functions of both xx and yy. We derive two simple necessary conditions for selective dependence of (A,B)(A,B) on (x…

CombinatoricsCrystallographyJoint probability distributionApplied MathematicsSelectivityRandom variableGeneral PsychologyMathematicsJournal of Mathematical Psychology
researchProduct

Extremum degree sets of irregular oriented graphs and pseudodigraphs

2006

CombinatoricsDegree (graph theory)Applied MathematicsDiscrete Mathematics and CombinatoricsMathematicsDiscussiones Mathematicae Graph Theory
researchProduct

Completion of partially ordered sets

2007

CombinatoricsDiscrete mathematicsAlgebra and Number TheoryGraded posetApplied MathematicsPartially ordered setMathematicsDiscussiones Mathematicae - General Algebra and Applications
researchProduct

Differential equations over polynomially bounded o-minimal structures

2002

We investigate the asymptotic behavior at +∞ of non-oscillatory solutions to differential equations y' = G(t, y), t > a, where G: R 1+l → R l is definable in a polynomially bounded o-minimal structure. In particular, we show that the Pfaffian closure of a polynomially bounded o-minimal structure on the real field is levelled.

CombinatoricsDiscrete mathematicsAsymptotic analysisDifferential equationApplied MathematicsGeneral MathematicsBounded functionClosure (topology)Structure (category theory)PfaffianReal fieldMathematicsProceedings of the American Mathematical Society
researchProduct

Remarks on Partially Square Graphs, Hamiltonicity and Circumference

2001

CombinatoricsDiscrete mathematicsClaw-free graphlawApplied MathematicsIndependent setLine graphDiscrete Mathematics and CombinatoricsCubic graphCircumferenceSquare (algebra)law.inventionMathematicsDiscussiones Mathematicae Graph Theory
researchProduct

BOUNDING THE NUMBER OF IRREDUCIBLE CHARACTER DEGREES OF A FINITE GROUP IN TERMS OF THE LARGEST DEGREE

2013

We conjecture that the number of irreducible character degrees of a finite group is bounded in terms of the number of prime factors (counting multiplicities) of the largest character degree. We prove that this conjecture holds when the largest character degree is prime and when the character degree graph is disconnected.

CombinatoricsDiscrete mathematicsFinite groupOrientation characterAlgebra and Number TheoryCharacter (mathematics)Degree (graph theory)Character tableApplied MathematicsPrime factorCharacter groupPrime (order theory)MathematicsJournal of Algebra and Its Applications
researchProduct

Degree sequences of digraphs with highly irregular property

1998

CombinatoricsDiscrete mathematicsProperty (philosophy)Degree (graph theory)Applied MathematicsDiscrete Mathematics and CombinatoricsDigraphMathematicsDiscussiones Mathematicae Graph Theory
researchProduct

On the structure of the set of equivalent norms on ℓ1 with the fixed point property

2012

Abstract Let A be the set of all equivalent norms on l 1 which satisfy the FPP. We prove that A contains rays. In fact, every renorming in l 1 which verifies condition (⁎) in Theorem 2.1 is the starting point of a (closed or open) ray composed by equivalent norms on l 1 with the FPP. The standard norm ‖ ⋅ ‖ 1 or P.K. Linʼs norm defined in Lin (2008) [12] are examples of such norms. Moreover, we study some topological properties of the set A with respect to some equivalent metrics defined on the set of all norms on l 1 equivalent to ‖ ⋅ ‖ 1 .

CombinatoricsDiscrete mathematicsRenorming theoryApplied MathematicsNorm (mathematics)Fixed-point theoremNonexpansive mappingsFixed point theoryEquivalence of metricsFixed-point propertyStabilityAnalysisMathematicsJournal of Mathematical Analysis and Applications
researchProduct