Search results for "REPRESENTATION"

showing 10 items of 1710 documents

Uncertainty Measures, Realizations and Entropies*

1997

This paper presents the axiomatic foundations of uncertainty theories arising in quantum theory and artificial intelligence. Plausibility measures and additive uncertainty measures are investigated. The representation of uncertainty measures by random sets in spaces of events forms a common base for the treatment of an appropriate integration theory as well as for a reasonable decision theory.

Discrete mathematicsDecision theoryFeature integration theoryBase (topology)Representation (mathematics)Mathematical economicsAxiomMathematics
researchProduct

Defining relations of minimal degree of the trace algebra of 3×3 matrices

2008

Abstract The trace algebra C n d over a field of characteristic 0 is generated by all traces of products of d generic n × n matrices, n , d ⩾ 2 . Minimal sets of generators of C n d are known for n = 2 and n = 3 for any d as well as for n = 4 and n = 5 and d = 2 . The defining relations between the generators are found for n = 2 and any d and for n = 3 , d = 2 only. Starting with the generating set of C 3 d given by Abeasis and Pittaluga in 1989, we have shown that the minimal degree of the set of defining relations of C 3 d is equal to 7 for any d ⩾ 3 . We have determined all relations of minimal degree. For d = 3 we have also found the defining relations of degree 8. The proofs are based …

Discrete mathematicsDefining relationsTrace algebrasAlgebra and Number TheoryTrace (linear algebra)Degree (graph theory)Matrix invariantsGeneral linear groupField (mathematics)Representation theoryCombinatoricsSet (abstract data type)AlgebraGeneric matricesInvariants of tensorsGenerating set of a groupMathematicsJournal of Algebra
researchProduct

Universal Lyndon Words

2014

A word w over an alphabet Σ is a Lyndon word if there exists an order defined on Σ for which w is lexicographically smaller than all of its conjugates (other than itself). We introduce and study universal Lyndon words, which are words over an n-letter alphabet that have length n! and such that all the conjugates are Lyndon words. We show that universal Lyndon words exist for every n and exhibit combinatorial and structural properties of these words. We then define particular prefix codes, which we call Hamiltonian lex-codes, and show that every Hamiltonian lex-code is in bijection with the set of the shortest unrepeated prefixes of the conjugates of a universal Lyndon word. This allows us t…

Discrete mathematicsExistential quantificationLyndon word Universal cycle Universal Lyndon wordComputer Science::Computation and Language (Computational Linguistics and Natural Language and Speech Processing)Lyndon word Universal cycle Universal Lyndon word Lex-codeLexicographical orderLyndon wordUniversal Lyndon wordLyndon wordsPrefixCombinatoricsMathematics::Group TheoryCombinatorics on wordsComputer Science::Discrete MathematicsUniversal cycleBijectionAlphabetMathematics::Representation TheoryComputer Science::Formal Languages and Automata TheoryMathematics
researchProduct

Absolutely Convergent Extensions of Nonclosable Positive Linear Functionals

2010

The existence of extensions of a positive linear functional ω defined on a dense *-subalgebra \({\mathfrak{A}_0}\) of a topological *-algebra \({\mathfrak{A}}\), satisfying certain regularity conditions, is examined. The main interest is focused on the case where ω is nonclosable and sufficient conditions for the existence of an absolutely convergent extension of ω are given.

Discrete mathematicsExtensions Positive linear functionalsSettore MAT/05 - Analisi MatematicaPositive linear functionalGeneral MathematicsSubalgebraExtension (predicate logic)Algebra over a fieldMathematics::Representation TheoryAbsolute convergenceMathematicsMediterranean Journal of Mathematics
researchProduct

Representation and factorization theorems for almost-Lp-spaces

2019

The first and fourth authors gratefully acknowledge the support of Ministerio de Ciencia, Innovacibn y Universidades (Spain), Agencia Estatal de Investigaciones, and FEDER, under projects MTM2014-53009-P (J.M. Calabuig) and MTM2016-77054-C2-1-P (E.A. Sanchez Perez).

Discrete mathematicsFactorizationGeneral MathematicsBanach lattice010102 general mathematicsRepresentation (systemics)010103 numerical & computational mathematics0101 mathematics01 natural sciencesMathematicsIndagationes Mathematicae
researchProduct

Constructive proofs of representation theorems in separable Hilbert space

1964

Discrete mathematicsHilbert's second problemPure mathematicsHilbert manifoldRiesz representation theoremApplied MathematicsGeneral MathematicsRigged Hilbert spaceCylinder set measureHilbert's basis theoremConstructivesymbols.namesakesymbolsKuiper's theoremMathematicsCommunications on Pure and Applied Mathematics
researchProduct

An integral representation for decomposable measures of measurable functions

1994

We start with a measurem on a measurable space (Ω,A), decomposable with respect to an Archimedeant-conorm ⊥ on a real interval [0,M], which generalizes an additive measure. Using the integral introduced by the second author, a Radon-Nikodym type theorem, needed in what follows, is given.

Discrete mathematicsIntegral representationMarkov kernelMeasurable functionApplied MathematicsGeneral MathematicsDiscrete Mathematics and CombinatoricsInterval (graph theory)Type (model theory)Space (mathematics)Measure (mathematics)MathematicsAequationes Mathematicae
researchProduct

On Rough Sets in Topological Boolean Algebras

1994

We have focused on rough sets in topological Boolean algebras. Our main ideas on rough sets are taken from concepts of Pawlak [4] and certain generalizations of his constructions which were offered by Wiweger [7]. One of the most important results of this note is a characterization of the rough sets determined by regular open and regular closed elements.

Discrete mathematicsInterior algebraRough setField of setsBoolean algebras canonically definedCharacterization (mathematics)Stone's representation theorem for Boolean algebrasTopologyComplete Boolean algebraMathematics
researchProduct

Symmetric (79, 27, 9)-designs Admitting a Faithful Action of a Frobenius Group of Order 39

1997

AbstractIn this paper we present the classification of symmetric designs with parameters (79, 27, 9) on which a non-abelian group of order 39 acts faithfully. In particular, we show that such a group acts semi-standardly with 7 orbits. Using the method of tactical decompositions, we are able to construct exactly 1320 non-isomorphic designs. The orders of the full automorphism groups of these designs all divide 8 · 3 · 13.

Discrete mathematicsKlein four-groupG-moduleQuaternion groupAlternating groupOuter automorphism groupGroup representationsymmetric design; Frobenius group; orbit structureTheoretical Computer ScienceCombinatoricsComputational Theory and MathematicsSymmetric groupDiscrete Mathematics and CombinatoricsGeometry and TopologyFrobenius groupMathematicsEuropean Journal of Combinatorics
researchProduct

On the structure of the ultradistributions of Beurling type

2008

Let O be a nonempty open set of the k-dimensional euclidean space Rk. In this paper, we give a structure theorem on the ultradistributions of Beurling type in O. Also, other structure results on certain ultradistributions are obtained, in terms of complex Borel measures in O.

Discrete mathematicsMathematics::Functional AnalysisPure mathematicsAlgebra and Number TheoryEuclidean spaceRiesz–Markov–Kakutani representation theoremApplied MathematicsOpen setStructure (category theory)Banach spaceType (model theory)Computational MathematicsLocally convex topological vector spaceGeometry and TopologyAnalysisStructured program theoremMathematicsRevista de la Real Academia de Ciencias Exactas, Fisicas y Naturales. Serie A. Matematicas
researchProduct