Search results for "Combinatorics"

showing 10 items of 1770 documents

Periodic Solutions of the Second Order Quadratic Rational Difference Equation $$x_{n+1}=\frac{\alpha }{(1+x_n)x_{n-1}} $$ x n + 1 = α ( 1 + x n ) x n…

2016

The aim of this article is to investigate the periodic nature of solutions of a rational difference equation $$x_{n+1}=\frac{\alpha }{(1+x_n)x_{n-1}}. {(*)} $$ We explore Open Problem 3.3 given in Amleh et al. (Int J Differ Equ 3(1):1–35, 2008, [2]) that requires to determine all periodic solutions of the equation (*). We conclude that for the equation (*) there are no periodic solution with prime period 3 and 4. Period 7 is first period for which exists nonnegative parameter \(\alpha \) and nonnegative initial conditions.

CombinatoricsEquilibrium pointQuadratic equationRational difference equationPeriod (periodic table)Differential equationOpen problemMathematical analysisOrder (ring theory)Prime (order theory)Mathematics
researchProduct

Covering and differentiation

1995

CombinatoricsEuclidean distanceDiscrete mathematicsConvex geometryEuclidean spaceEuclidean geometryAffine spaceBall (mathematics)Euclidean distance matrixGaussian measureMathematics
researchProduct

Poincaré Week in Göttingen, 22–28 April 1909

2018

When Paul Wolfskehl died in 1906, his will established a prize for the first mathematician who could supply a proof of Fermat’s Last Theorem, or give a counterexample refuting it. The interest from this prize money was later used to bring world-renowned mathematicians to Gottingen to deliver a series of lectures. Hilbert was apparently very pleased with this arrangement, and once jested that the only thing that kept him from proving Fermat’s famous conjecture was the thought of killing the goose that laid these golden eggs.

CombinatoricsFermat's Last Theoremsymbols.namesakeConjectureSeries (mathematics)PhilosophyPoincaré conjecturesymbolsCounterexample
researchProduct

Hypergraph functor and attachment

2010

Using an arbitrary variety of algebras, the paper introduces a fuzzified version of the notion of attachment in a complete lattice of Guido, to provide a common framework for the concept of hypergraph functor considered by different authors in the literature. The new notion also gives rise to a category of variable-basis topological spaces which is a proper supercategory of the respective category of Rodabaugh.

CombinatoricsFiber functorClosed categoryFunctorArtificial IntelligenceLogicMathematics::Category TheoryConcrete categoryUniversal propertyCone (category theory)Variety (universal algebra)Topological spaceMathematicsFuzzy Sets and Systems
researchProduct

Group-graded algebras with polynomial identity

1998

LetG be a finite group and letR=Σg∈GRg be any associative algebra over a field such that the subspacesRg satisfyRgRh⊆Rgh. We prove that ifR1 satisfies a PI of degreed, thenR satisfies a PI of degree bounded by an explicit function ofd and the order ofG. This result implies the following: ifH is a finite-dimensional semisimple commutative Hopfalgebra andR is anyH-module algebra withRH satisfying a PI of degreed, thenR satisfies a PI of degree bounded by an explicit function ofd and the dimension ofH.

CombinatoricsFiltered algebraSymmetric algebraIncidence algebraGeneral MathematicsAssociative algebraDivision algebraAlgebra representationCellular algebraComposition algebraMathematics
researchProduct

On σ-subnormal closure

2020

Let σ={σi:i∈I} be a partition of the set P of all prime numbers. A subgroup A of a finite group G is called σ-subnormal in G if there is a chain of subgroups A=A0⊆A1⊆⋯⊆An=G with Ai−1 normal in Ai o...

CombinatoricsFinite groupAlgebra and Number Theory010102 general mathematicsPrime numberPartition (number theory)010103 numerical & computational mathematics0101 mathematics01 natural sciencesMathematicsCommunications in Algebra
researchProduct

The minimal number of characters over a normal p-subgroup

2007

Abstract If N is a normal p-subgroup of a finite group G and θ ∈ Irr ( N ) is a G-invariant irreducible character of N, then the number | Irr ( G | θ ) | of irreducible characters of G over θ is always greater than or equal to the number k p ′ ( G / N ) of conjugacy classes of G / N consisting of p ′ -elements. In this paper, we investigate when there is equality.

CombinatoricsFinite groupAlgebra and Number TheoryCharacter (mathematics)Brauer's theorem on induced charactersConjugacy classCharacter tableCharactersCounting charactersFinite groupsNormal p-subgroupsMathematicsJournal of Algebra
researchProduct

p-Parts of Brauer character degrees

2014

Abstract Let G be a finite group and let p be an odd prime. Under certain conditions on the p-parts of the degrees of its irreducible p-Brauer characters, we prove the solvability of G. As a consequence, we answer a question proposed by B. Huppert in 1991: If G has exactly two distinct irreducible p-Brauer character degrees, then is G solvable? We also determine the structure of non-solvable groups with exactly two irreducible 2-Brauer character degrees.

CombinatoricsFinite groupAlgebra and Number TheoryCharacter (mathematics)Brauer's theorem on induced charactersSolvable groupStructure (category theory)Mathematics::Representation TheoryPrime (order theory)MathematicsJournal of Algebra
researchProduct

Finite Group Elements where No Irreducible Character Vanishes

1999

AbstractIn this paper, we consider elements x of a finite group G with the property that χ(x)≠0 for all irreducible characters χ of G. If G is solvable and x has odd order, we show that x must lie in the Fitting subgroup F(G).

CombinatoricsFinite groupAlgebra and Number TheoryCharacter (mathematics)Character tableOrder (group theory)(gK)-moduleFitting subgroupMathematicsJournal of Algebra
researchProduct

Real constituents of permutation characters

2022

Abstract We prove a broad generalization of a theorem of W. Burnside about the existence of real characters of finite groups to permutation characters. If G is a finite group, under the necessary hypothesis of O 2 ′ ( G ) = G , we can also give some control on the parity of multiplicities of the constituents of permutation characters (a result that needs the Classification of Finite Simple Groups). Along the way, we give a new characterization of the 2-closed finite groups using odd-order real elements of the group. All this can be seen as a contribution to Brauer's Problem 11 which asks how much information about subgroups of a finite group can be determined by the character table.

CombinatoricsFinite groupAlgebra and Number TheoryCharacter tableClassification of finite simple groupsParity (mathematics)MathematicsJournal of Algebra
researchProduct