Search results for "Number"

showing 10 items of 3939 documents

Fixed point results on metric and partial metric spaces via simulation functions

2015

We prove existence and uniqueness of fixed point, by using a simulation function and a lower semi-continuous function in the setting of metric space. As consequences of this study, we deduce several related fixed point results, in metric and partial metric spaces. An example is given to support the new theory.

Discrete mathematicsMetric spaceNonlinear contractionAlgebra and Number TheoryPartial metric spaceSimulation functionSettore MAT/05 - Analisi MatematicaMetric (mathematics)Fixed pointFixed pointMetric spaceAnalysisMathematics
researchProduct

Shadow trees of Mandelbrot sets

2003

Discrete mathematicsMisiurewicz pointAlgebra and Number TheoryShadowExternal rayMandelbrot setComplex quadratic polynomialMandelboxMathematicsFundamenta Mathematicae
researchProduct

Brauer characters and coprime action

2016

Abstract It is an open problem to show that under a coprime action, the number of invariant Brauer characters of a finite group is the number of the Brauer characters of the fixed point subgroup. We prove that this is true if the non-abelian simple groups satisfy a stronger condition.

Discrete mathematicsModular representation theoryPure mathematicsFinite groupAlgebra and Number TheoryBrauer's theorem on induced charactersCoprime integers010102 general mathematics02 engineering and technologyFixed point021001 nanoscience & nanotechnology01 natural sciencesSimple group0101 mathematicsInvariant (mathematics)Mathematics::Representation Theory0210 nano-technologyBrauer groupMathematicsJournal of Algebra
researchProduct

A new Euler–Mahonian constructive bijection

2011

AbstractUsing generating functions, MacMahon proved in 1916 the remarkable fact that the major index has the same distribution as the inversion number for multiset permutations, and in 1968 Foata gave a constructive bijection proving MacMahon’s result. Since then, many refinements have been derived, consisting of adding new constraints or new statistics.Here we give a new simple constructive bijection between the set of permutations with a given number of inversions and those with a given major index. We introduce a new statistic, mix, related to the Lehmer code, and using our new bijection we show that the bistatistic (mix,INV) is Euler–Mahonian. Finally, we introduce the McMahon code for …

Discrete mathematicsMultisetMathematics::CombinatoricsApplied MathematicsMajor indexMajor indexConstructiveCombinatoricssymbols.namesakeConstructive bijectionLehmer codeBijectionEuler's formulasymbolsInversion numberDiscrete Mathematics and CombinatoricsPermutation (bi)statisticStatisticMathematicsDiscrete Applied Mathematics
researchProduct

Quantum Finite Automata and Probabilistic Reversible Automata: R-trivial Idempotent Languages

2011

We study the recognition of R-trivial idempotent (R1) languages by various models of "decide-and-halt" quantum finite automata (QFA) and probabilistic reversible automata (DH-PRA). We introduce bistochastic QFA (MM-BQFA), a model which generalizes both Nayak's enhanced QFA and DH-PRA. We apply tools from algebraic automata theory and systems of linear inequalities to give a complete characterization of R1 languages recognized by all these models. We also find that "forbidden constructions" known so far do not include all of the languages that cannot be recognized by measure-many QFA.

Discrete mathematicsNested wordIdempotenceQuantum finite automataAutomata theoryComputer Science::Computational ComplexityAlgebraic numberω-automatonCharacterization (mathematics)Computer Science::Formal Languages and Automata TheoryMathematicsAutomaton
researchProduct

Finite Groups with Only One NonLinear Irreducible Representation

2012

Let 𝕂 be an algebraically closed field. We classify the finite groups having exactly one irreducible 𝕂-representation of degree bigger than one. The case where the characteristic of 𝕂 is zero, was done by G. Seitz in 1968.

Discrete mathematicsNonlinear systemAlgebra and Number TheoryDegree (graph theory)Irreducible representationZero (complex analysis)Algebraically closed fieldMathematicsCommunications in Algebra
researchProduct

On the Russo-Dye Theorem for positive linear maps

2019

Abstract We revisit a classical result, the Russo-Dye Theorem, stating that every positive linear map attains its norm at the identity.

Discrete mathematicsNumerical AnalysisAlgebra and Number Theory010102 general mathematics010103 numerical & computational mathematics01 natural sciencesFunctional Analysis (math.FA)Linear mapMathematics - Functional Analysis47A30 15A60Norm (mathematics)FOS: MathematicsDiscrete Mathematics and CombinatoricsGeometry and Topology0101 mathematicsMathematics
researchProduct

Some properties of [tr(Q2p)]12p with application to linear minimax estimation

1990

Abstract A nondifferentiable minimization problem is considered which occurs in linear minimax estimation. This problem is solved by replacing the nondifferentiable maximal eigenvalue of a real nonnegative definite matrix Q with [tr( Q 2 p )] 1/2 p . It is shown that any descent algorithm with inexact step-length rule can be used to obtain linear minimax estimators for the parameter vector of a parameter-restricted linear model.

Discrete mathematicsNumerical AnalysisAlgebra and Number TheoryMinimization problemLinear modelMathematics::Optimization and ControlMinimaxMinimax approximation algorithmMatrix (mathematics)Discrete Mathematics and CombinatoricsGeometry and TopologyMinimax estimatorDescent algorithmEigenvalues and eigenvectorsMathematicsLinear Algebra and its Applications
researchProduct

The structure of the state representation of shift invariant controllable and observable group codes

2000

AbstractIn this paper an investigation on the structure of the canonical trellis section of shift invariant, l-controllable and m-observable group codes is carried out. Necessary and sufficient conditions for a set of group homomorphisms in order that they represent the trellis section of this class of codes are established.

Discrete mathematicsNumerical AnalysisAlgebra and Number TheoryObservableCanonical representationsBehavioral analysisGroup codeGroup codesDiscrete Mathematics and CombinatoricsHomomorphismCanonical formGeometry and TopologyInvariant (mathematics)Behavioral approachState representationComputer Science::Information TheoryMathematics
researchProduct

On the Bishop–Phelps–Bollobás theorem for multilinear mappings

2017

Abstract We study the Bishop–Phelps–Bollobas property and the Bishop–Phelps–Bollobas property for numerical radius. Our main aim is to extend some known results about norm or numerical radius attaining operators to multilinear and polynomial cases. We characterize the pair ( l 1 ( X ) , Y ) to have the BPBp for bilinear forms and prove that on L 1 ( μ ) the numerical radius and the norm of a multilinear mapping are the same. We also show that L 1 ( μ ) fails the BPBp-nu for multilinear mappings although L 1 ( μ ) satisfies it in the operator case for every measure μ.

Discrete mathematicsNumerical AnalysisMultilinear mapAlgebra and Number Theory010102 general mathematicsBilinear form01 natural sciences010101 applied mathematicsOperator (computer programming)Discrete Mathematics and CombinatoricsGeometry and Topology0101 mathematicsBishop–Phelps theoremMathematicsLinear Algebra and its Applications
researchProduct