Search results for "FOS: Mathematics"

showing 10 items of 1448 documents

Groups with few $p'$-character degrees

2019

Abstract We prove a variation of Thompson's Theorem. Namely, if the first column of the character table of a finite group G contains only two distinct values not divisible by a given prime number p > 3 , then O p p ′ p p ′ ( G ) = 1 . This is done by using the classification of finite simple groups.

Finite groupAlgebra and Number Theory010102 general mathematicsPrime number0102 computer and information sciencesGroup Theory (math.GR)01 natural sciencesColumn (database)CombinatoricsCharacter (mathematics)Character table010201 computation theory & mathematicsFOS: MathematicsClassification of finite simple groups0101 mathematicsRepresentation Theory (math.RT)Mathematics - Group TheoryMathematics - Representation TheoryMathematics
researchProduct

Bounding the number of vertices in the degree graph of a finite group

2020

Abstract Let G be a finite group, and let cd ( G ) denote the set of degrees of the irreducible complex characters of G . The degree graph Δ ( G ) of G is defined as the simple undirected graph whose vertex set V ( G ) consists of the prime divisors of the numbers in cd ( G ) , two distinct vertices p and q being adjacent if and only if pq divides some number in cd ( G ) . In this note, we provide an upper bound on the size of V ( G ) in terms of the clique number ω ( G ) (i.e., the maximum size of a subset of V ( G ) inducing a complete subgraph) of Δ ( G ) . Namely, we show that | V ( G ) | ≤ max { 2 ω ( G ) + 1 , 3 ω ( G ) − 4 } . Examples are given in order to show that the bound is bes…

Finite groupAlgebra and Number Theory20C15010102 general mathematicsGroup Theory (math.GR)01 natural sciencesUpper and lower boundsGraphVertex (geometry)CombinatoricsBounding overwatch0103 physical sciencesFOS: MathematicsMaximum size010307 mathematical physics0101 mathematicsUndirected graphMathematics - Group TheoryClique numberMathematicsJournal of Pure and Applied Algebra
researchProduct

A characterisation of nilpotent blocks

2015

Let $B$ be a $p$-block of a finite group, and set $m=$ $\sum \chi(1)^2$, the sum taken over all height zero characters of $B$. Motivated by a result of M. Isaacs characterising $p$-nilpotent finite groups in terms of character degrees, we show that $B$ is nilpotent if and only if the exact power of $p$ dividing $m$ is equal to the $p$-part of $|G:P|^2|P:R|$, where $P$ is a defect group of $B$ and where $R$ is the focal subgroup of $P$ with respect to a fusion system $\CF$ of $B$ on $P$. The proof involves the hyperfocal subalgebra $D$ of a source algebra of $B$. We conjecture that all ordinary irreducible characters of $D$ have degree prime to $p$ if and only if the $\CF$-hyperfocal subgrou…

Finite groupApplied MathematicsGeneral MathematicsSubalgebraZero (complex analysis)Group Theory (math.GR)Prime (order theory)CombinatoricsNilpotentCharacter (mathematics)FOS: MathematicsAbelian groupNilpotent groupRepresentation Theory (math.RT)QAMathematics - Group TheoryMathematics - Representation TheoryMathematics
researchProduct

New Refinements of the McKay Conjecture for Arbitrary Finite Groups

2004

Let $G$ be an arbitrary finite group and fix a prime number $p$. The McKay conjecture asserts that $G$ and the normalizer in $G$ of a Sylow $p$-subgroup have equal numbers of irreducible characters with degrees not divisible by $p$. The Alperin-McKay conjecture is a version of this as applied to individual Brauer $p$-blocks of $G$. We offer evidence that perhaps much stronger forms of both of these conjectures are true.

Finite groupConjecture20C15Sylow theoremsPrime numberGroup Theory (math.GR)Centralizer and normalizerCollatz conjectureCombinatoricsMathematics::Group TheoryMathematics (miscellaneous)Character (mathematics)Symmetric groupFOS: MathematicsStatistics Probability and UncertaintyMathematics::Representation TheoryMathematics - Group TheoryMathematicsThe Annals of Mathematics
researchProduct

Conjugacy classes, characters and products of elements

2019

Recently, Baumslag and Wiegold proved that a finite group $G$ is nilpotent if and only if $o(xy)=o(x)o(y)$ for every $x,y\in G$ of coprime order. Motivated by this result, we study the groups with the property that $(xy)^G=x^Gy^G$ and those with the property that $\chi(xy)=\chi(x)\chi(y)$ for every complex irreducible character $\chi$ of $G$ and every nontrivial $x, y \in G$ of pairwise coprime order. We also consider several ways of weakening the hypothesis on $x$ and $y$. While the result of Baumslag and Wiegold is completely elementary, some of our arguments here depend on (parts of) the classification of finite simple groups.

Finite groupCoprime integersGeneral Mathematics010102 general mathematicsGroup Theory (math.GR)01 natural sciences010101 applied mathematicsCombinatoricsNilpotentCharacter (mathematics)Conjugacy classSolvable groupFOS: MathematicsOrder (group theory)Classification of finite simple groups0101 mathematicsMathematics - Group Theory20C15 20D15 20E45MathematicsMathematische Nachrichten
researchProduct

An adaptive rectangular mesh administration and refinement technique with application in cancer invasion models

2022

We present an administration technique for the bookkeeping of adaptive mesh refinement on (hyper-)rectangular meshes. Our technique is a unified approach for h-refinement on 1-, 2- and 3D domains, which is easy to use and avoids traversing the connectivity graph of the ancestry of mesh cells. Due to the employed rectangular mesh structure, the identification of the siblings and the neighbouring cells is greatly simplified. The administration technique is particularly designed for smooth meshes, where the smoothness is dynamically used in the matrix operations. It has a small memory footprint that makes it affordable for a wide range of mesh resolutions over a large class of problems. We pre…

Finite volume methodRC0254 Neoplasms. Tumors. Oncology (including Cancer)Applied MathematicsT-NDASCancer invasionNumerical Analysis (math.NA)Mesh administration510Adaptive mesh refinementRC0254Computational MathematicsSDG 3 - Good Health and Well-beingFOS: MathematicsMathematics - Numerical AnalysisQA Mathematicsh-refinementddc:510QA
researchProduct

Gradient estimates for the perfect conductivity problem in anisotropic media

2018

Abstract We study the perfect conductivity problem when two perfectly conducting inclusions are closely located to each other in an anisotropic background medium. We establish optimal upper and lower gradient bounds for the solution in any dimension which characterize the singular behavior of the electric field as the distance between the inclusions goes to zero.

Finsler LaplacianApplied MathematicsGeneral Mathematics010102 general mathematicsMathematical analysisZero (complex analysis)Perfect conductorGradient blow-upConductivity01 natural sciences010101 applied mathematicsMathematics - Analysis of PDEsDimension (vector space)Settore MAT/05 - Analisi MatematicaElectric fieldSingular behaviorFOS: MathematicsMathematics (all)Primary: 35J25 35B44 35B50 Secondary: 35J62 78A48 58J600101 mathematicsPerfect conductorAnisotropyAnalysis of PDEs (math.AP)MathematicsJournal de Mathématiques Pures et Appliquées
researchProduct

Albanese Maps and Fundamental Groups of Varieties With Many Rational Points Over Function Fields

2020

We investigate properties of the Albanese map and the fundamental group of a complex projective variety with many rational points over some function field, and prove that every linear quotient of the fundamental group of such a variety is virtually abelian, as well as that its Albanese map is surjective, has connected fibres, and has no multiple fibres in codimension one.

Fundamental groupPure mathematicsGeneral Mathematics01 natural sciencesSurjective functionMathematics - Algebraic GeometryMathematics::Algebraic Geometry0103 physical sciencesFOS: MathematicsNumber Theory (math.NT)0101 mathematicsAbelian groupAlgebraic Geometry (math.AG)Projective varietyQuotientFunction fieldMathematicsMathematics - Number Theory010102 general mathematics[MATH.MATH-AG] Mathematics [math]/Algebraic Geometry [math.AG][MATH.MATH-CV]Mathematics [math]/Complex Variables [math.CV]Codimension[MATH.MATH-CV] Mathematics [math]/Complex Variables [math.CV][MATH.MATH-AG]Mathematics [math]/Algebraic Geometry [math.AG]010307 mathematical physicsVariety (universal algebra)International Mathematics Research Notices
researchProduct

Quantitative lower bounds to the Euclidean and the Gaussian Cheeger constants

2020

We provide a quantitative lower bound to the Cheeger constant of a set $\Omega$ in both the Euclidean and the Gaussian settings in terms of suitable asymmetry indexes. We provide examples which show that these quantitative estimates are sharp.

Gaussianmedia_common.quotation_subject01 natural sciencesUpper and lower boundsAsymmetryOmegaCombinatoricsSet (abstract data type)Cheeger sets; Cheeger constant; quantitative inequalitiessymbols.namesakeMathematics - Analysis of PDEsEuclidean geometryFOS: MathematicsMathematics::Metric Geometry0101 mathematicsepäyhtälötMathematicsmedia_common49Q10 49Q20 39B62osittaisdifferentiaaliyhtälöt010102 general mathematicsCheeger constantCheeger setsArticlesCheeger constant (graph theory)010101 applied mathematicssymbolsquantitative inequalitiesAnalysis of PDEs (math.AP)Annales Fennici Mathematici
researchProduct

Finite Alphabet Control of Logistic Networks with Discrete Uncertainty

2014

We consider logistic networks in which the control and disturbance inputs take values in finite sets. We derive a necessary and sufficient condition for the existence of robustly control invariant (hyperbox) sets. We show that a stronger version of this condition is sufficient to guarantee robust global attractivity, and we construct a counterexample demonstrating that it is not necessary. Being constructive, our proofs of sufficiency allow us to extract the corresponding robust control laws and to establish the invariance of certain sets. Finally, we highlight parallels between our results and existing results in the literature, and we conclude our study with two simple illustrative exampl…

General Computer ScienceComputer scienceMechanical EngineeringSystems and Control (eess.SY)Invariant (physics)Mathematical proofConstructiveControl and Systems EngineeringOptimization and Control (math.OC)FOS: MathematicsFOS: Electrical engineering electronic engineering information engineeringComputer Science - Systems and ControlApplied mathematicsElectrical and Electronic EngineeringAlphabetRobust controlMathematics - Optimization and ControlFinite setCounterexample
researchProduct