Search results for " Combinatoric"

showing 10 items of 299 documents

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

On the ∗-cocharacter sequence of 3×3 matrices

2000

Abstract Let M 3 (F) be the algebra of 3×3 matrices with involution * over a field F of characteristic zero. We study the ∗ -polynomial identities of M 3 (F) , where ∗=t is the transpose involution, through the representation theory of the hyperoctahedral group B n . After decomposing the space of multilinear ∗ -polynomial identities of degree n under the B n -action, we determine which irreducible B n -modules appear with non-zero multiplicity. In symbols, we write the nth ∗ -cocharacter χ n (M 3 (F),*)=∑ r=0 n ∑ λ⊢r,h(λ)⩽6 μ⊢n−r,h(μ)⩽3 m λ,μ χ λ,μ , where λ and μ are partitions of r and n−r , respectively, χ λ,μ is the irreducible B n -character associated to the pair (λ,μ) and m λ,μ ⩾0 i…

Discrete mathematicsNumerical AnalysisMultilinear mapAlgebra and Number TheoryMultiplicity (mathematics)Hyperoctahedral groupRepresentation theoryPolynomial identitiesCombinatoricsMatrices with involutionCocharacter sequenceDiscrete Mathematics and CombinatoricsGeometry and TopologyMathematicsLinear Algebra and its Applications
researchProduct

Fixed points and completeness on partial metric spaces

2015

Recently, Suzuki [T. Suzuki, A generalized Banach contraction principle that characterizes metric completeness, Proc. Amer. Math. Soc. 136 (2008), 1861-1869] proved a fixed point theorem that is a generalization of the Banach contraction principle and characterizes the metric completeness. Paesano and Vetro [D. Paesano and P. Vetro, Suzuki's type characterizations of completeness for partial metric spaces and fixed points for partially ordered metric spaces, Topology Appl., 159 (2012), 911-920] proved an analogous fixed point result for a selfmapping on a partial metric space that characterizes the partial metric 0-completeness. In this paper we prove a fixed point result for a new class of…

Discrete mathematicsNumerical AnalysisPartial metric 0-completeneControl and OptimizationAlgebra and Number TheoryPartial metric spaceInjective metric spaceOrdered partial metric spaceEquivalence of metricsConvex metric spaceIntrinsic metricMetric spaceSettore MAT/05 - Analisi MatematicaSuzuki fixed point theoremCompleteness (order theory)Metric (mathematics)Discrete Mathematics and CombinatoricsMetric mapFixed and common fixed pointAnalysisMathematicsMiskolc Mathematical Notes
researchProduct

Ordinary and graded cocharacter of the Jordan algebra of 2x2 upper triangular matrices

2014

Abstract Let F be a field of characteristic zero and U J 2 ( F ) be the Jordan algebra of 2 × 2 upper triangular matrices over F . In this paper we give a complete description of the space of multilinear graded and ordinary identities in the language of Young diagrams through the representation theory of a Young subgroup of S n . For every Z 2 -grading of U J 2 ( F ) we compute the multiplicities in the graded cocharacter sequence and furthermore we compute the ordinary cocharacter.

Discrete mathematicsNumerical AnalysisSequenceMultilinear mapPure mathematicsAlgebra and Number TheoryJordan algebraZero (complex analysis)Triangular matrixField (mathematics)Space (mathematics)Representation theoryJordan algebras Polynomial identities Basis of identities Cocharacter Gradings Graded polynomial identitiesSettore MAT/02 - AlgebraDiscrete Mathematics and CombinatoricsGeometry and TopologyMathematics
researchProduct

On computing the degree of convexity of polyominoes

2015

In this paper we present an algorithm which has as input a convex polyomino $P$ and computes its degree of convexity, defined as the smallest integer $k$ such that any two cells of $P$ can be joined by a monotone path inside $P$ with at most $k$ changes of direction. The algorithm uses space $O(m + n)$ to represent a polyomino $P$ with $n$ rows and $m$ columns, and has a running time $O(min(m; r k))$, where $r$ is the number of corners of $P$. Moreover, the algorithm leads naturally to a decomposition of $P$ into simpler polyominoes.

Discrete mathematicsPolyominoDegree (graph theory)Settore INF/01 - InformaticaApplied MathematicsRegular polygonConvexityTheoretical Computer ScienceCombinatoricsMonotone polygonIntegerComputational Theory and MathematicsPath (graph theory)Discrete Mathematics and CombinatoricsGeometry and TopologyRowMathematics
researchProduct

Highly irregular graphs with extreme numbers of edges

1997

Abstract A simple connected graph is highly irregular if each of its vertices is adjacent only to vertices with distinct degrees. In this paper we find: (1) the greatest number of edges of a highly irregular graph with n vertices, where n is an odd integer (for n even this number is given in [1]), (2) the smallest number of edges of a highly irregular graph of given order.

Discrete mathematicsPseudoforestHighly irregular graphEdge-graceful labelingTheoretical Computer ScienceHypercube graphCombinatoricsCycle graphDiscrete Mathematics and CombinatoricsPath graphMultiple edgesComplement graphMathematicsofComputing_DISCRETEMATHEMATICSMathematicsDiscrete Mathematics
researchProduct

Nilpotent Lie algebras with 2-dimensional commutator ideals

2011

Abstract We classify all (finitely dimensional) nilpotent Lie k -algebras h with 2-dimensional commutator ideals h ′ , extending a known result to the case where h ′ is non-central and k is an arbitrary field. It turns out that, while the structure of h depends on the field k if h ′ is central, it is independent of k if h ′ is non-central and is uniquely determined by the dimension of h . In the case where k is algebraically or real closed, we also list all nilpotent Lie k -algebras h with 2-dimensional central commutator ideals h ′ and dim k h ⩽ 11 .

Discrete mathematicsPure mathematicsCommutatorNumerical AnalysisAlgebra and Number TheoryNilpotent Lie algebras Pairs of alternating formsNon-associative algebraCartan subalgebraKilling formCentral seriesPairs of alternating formsAdjoint representation of a Lie algebraNilpotent Lie algebrasLie algebraDiscrete Mathematics and CombinatoricsSettore MAT/03 - GeometriaGeometry and TopologyNilpotent groupMathematicsLinear Algebra and its Applications
researchProduct

Polynomial identities for the Jordan algebra of a degenerate symmetric bilinear form

2013

Let J(n) be the Jordan algebra of a degenerate symmetric bilinear form. In the first section we classify all possible G-gradings on J(n) where G is any group, while in the second part we restrict our attention to a degenerate symmetric bilinear form of rank n - 1, where n is the dimension of the vector space V defining J(n). We prove that in this case the algebra J(n) is PI-equivalent to the Jordan algebra of a nondegenerate bilinear form.

Discrete mathematicsSymmetric algebraNumerical AnalysisPure mathematicsAlgebra and Number TheoryJordan algebraRank (linear algebra)Symmetric bilinear formPolynomial identities gradings Jordan algebraOrthogonal complementBilinear formSettore MAT/02 - AlgebraDiscrete Mathematics and CombinatoricsGeometry and TopologyAlgebra over a fieldMathematicsVector spaceLinear Algebra and its Applications
researchProduct

Set-valued mappings in partially ordered fuzzy metric spaces

2014

Abstract In this paper, we provide coincidence point and fixed point theorems satisfying an implicit relation, which extends and generalizes the result of Gregori and Sapena, for set-valued mappings in complete partially ordered fuzzy metric spaces. Also we prove a fixed point theorem for set-valued mappings on complete partially ordered fuzzy metric spaces which generalizes results of Mihet and Tirado. MSC:54E40, 54E35, 54H25.

Discrete mathematicspartially ordered setApplied MathematicsInjective metric spaceset-valued mappingT-normFixed-point propertyConvex metric spaceLeast fixed pointcoincidence pointfixed pointSettore MAT/05 - Analisi MatematicaDiscrete Mathematics and CombinatoricsDomain theoryfuzzy metric spaceFilter (mathematics)Coincidence pointAnalysisMathematics
researchProduct