Search results for "formal"

showing 10 items of 1654 documents

Group algebras and Lie nilpotence

2013

Abstract Let ⁎ be an involution of a group algebra FG induced by an involution of the group G. For char F ≠ 2 , we classify the groups G with no 2-elements and with no nonabelian dihedral groups involved whose Lie algebra of ⁎-skew elements is nilpotent.

Discrete mathematicsPure mathematicsAlgebra and Number TheorySimple Lie group010102 general mathematicsMathematics::Rings and AlgebrasUniversal enveloping algebra0102 computer and information sciencesGroup algebraSkew-symmetric element01 natural sciencesRepresentation theoryLie conformal algebraGraded Lie algebraRepresentation of a Lie groupgroup algebra unit010201 computation theory & mathematicsLie nilpotentGroup algebra0101 mathematicsNilpotent groupANÉIS E ÁLGEBRAS ASSOCIATIVOSMathematicsJournal of Algebra
researchProduct

Irreducible Finitary Lie Algebras over Fields of Characteristic Zero

1998

Abstract A Lie subalgebraLof g l K (V) is said to befinitaryif it consists of elements of finite rank. We show that if Char  K  = 0, if dim K  Vis infinite, and ifLacts irreducibly onV, then the derived algebra ofLis simple.

Discrete mathematicsPure mathematicsAlgebra and Number TheorySimple Lie groupNon-associative algebraFundamental representation(gK)-moduleKilling formAffine Lie algebraMathematicsLie conformal algebraGraded Lie algebraJournal of Algebra
researchProduct

Quantum Finite State Transducers

2001

We introduce quantum finite state transducers (qfst), and study the class of relations which they compute. It turns out that they share many features with probabilistic finite state transducers, especially regarding undecidability of emptiness (at least for low probability of success). However, like their 'little brothers', the quantum finite automata, the power of qfst is incomparable to that of their probabilistic counterpart. This we show by discussing a number of characteristic examples.

Discrete mathematicsPure mathematicsFinite-state machineDeterministic finite automatonComputer scienceComputer Science::Logic in Computer ScienceProbabilistic logicQuantum finite automataNondeterministic finite automatonState diagramQuantumComputer Science::Formal Languages and Automata TheoryQuantum computer
researchProduct

Derivations on a Lie Ideal

1988

AbstractIn this paper we prove the following result: let R be a prime ring with no non-zero nil left ideals whose characteristic is different from 2 and let U be a non central Lie ideal of R.If d ≠ 0 is a derivation of R such that d(u) is invertible or nilpotent for all u ∈ U, then either R is a division ring or R is the 2 X 2 matrices over a division ring. Moreover in the last case if the division ring is non commutative, then d is an inner derivation of R.

Discrete mathematicsPure mathematicsGeneral Mathematics010102 general mathematics010103 numerical & computational mathematics01 natural sciencesLie conformal algebralaw.inventionNilpotentInvertible matrixlawPrime ringDivision ringIdeal (ring theory)0101 mathematicsCommutative propertyMathematicsCanadian Mathematical Bulletin
researchProduct

A class of nilpotent Lie algebras admitting a compact subgroup of automorphisms

2017

Abstract The realification of the ( 2 n + 1 ) -dimensional complex Heisenberg Lie algebra is a ( 4 n + 2 ) -dimensional real nilpotent Lie algebra with a 2-dimensional commutator ideal coinciding with the centre, and admitting the compact algebra sp ( n ) of derivations. We investigate, in general, whether a real nilpotent Lie algebra with 2-dimensional commutator ideal coinciding with the centre admits a compact Lie algebra of derivations. This also gives us the occasion to revisit a series of classic results, with the expressed aim of attracting the interest of a broader audience.

Discrete mathematicsPure mathematicsOscillator algebra010102 general mathematicsUniversal enveloping algebra010103 numerical & computational mathematics01 natural sciencesAffine Lie algebraLie conformal algebraGraded Lie algebraNilpotent Lie algebraComputational Theory and MathematicsLie algebraCompact Lie algebraSettore MAT/03 - GeometriaGeometry and Topology0101 mathematicsCompact derivationGeneralized Kac–Moody algebraAnalysisMathematicsDifferential Geometry and its Applications
researchProduct

Operators in Rigged Hilbert spaces: some spectral properties

2014

A notion of resolvent set for an operator acting in a rigged Hilbert space $\D \subset \H\subset \D^\times$ is proposed. This set depends on a family of intermediate locally convex spaces living between $\D$ and $\D^\times$, called interspaces. Some properties of the resolvent set and of the corresponding multivalued resolvent function are derived and some examples are discussed.

Discrete mathematicsPure mathematicsResolvent set47L60 47L05Applied MathematicsRigged Hilbert spaces; Operators; Spectral theoryHilbert spaceFunction (mathematics)Resolvent formalismRigged Hilbert spaceFunctional Analysis (math.FA)Mathematics - Functional Analysissymbols.namesakeOperator (computer programming)Rigged Hilbert spaceSettore MAT/05 - Analisi MatematicaLocally convex topological vector spacesymbolsFOS: MathematicsOperatorSpectral theoryAnalysisResolventMathematics
researchProduct

Improved constructions of quantum automata

2008

We present a simple construction of quantum automata which achieve an exponential advantage over classical finite automata. Our automata use \frac{4}{\epsilon} \log 2p + O(1) states to recognize a language that requires p states classically. The construction is both substantially simpler and achieves a better constant in the front of \log p than the previously known construction of Ambainis and Freivalds (quant-ph/9802062). Similarly to Ambainis and Freivalds, our construction is by a probabilistic argument. We consider the possibility to derandomize it and present some results in this direction.

Discrete mathematicsQuantum PhysicsFinite-state machineTheoryofComputation_COMPUTATIONBYABSTRACTDEVICESGeneral Computer ScienceFOS: Physical sciencesω-automatonComputer Science::Computational ComplexityNonlinear Sciences::Cellular Automata and Lattice GasesMobile automatonTheoretical Computer ScienceQuantum finite automataQuantum computationAutomata theoryQuantum finite automataNondeterministic finite automatonExponential advantageQuantum Physics (quant-ph)Computer Science::Formal Languages and Automata TheoryMathematicsQuantum computerQuantum cellular automatonComputer Science(all)
researchProduct

Improved constructions of mixed state quantum automata

2009

Quantum finite automata with mixed states are proved to be super-exponentially more concise rather than quantum finite automata with pure states. It was proved earlier by A. Ambainis and R. Freivalds that quantum finite automata with pure states can have an exponentially smaller number of states than deterministic finite automata recognizing the same language. There was an unpublished ''folk theorem'' proving that quantum finite automata with mixed states are no more super-exponentially more concise than deterministic finite automata. It was not known whether the super-exponential advantage of quantum automata is really achievable. We prove that there is an infinite sequence of distinct int…

Discrete mathematicsQuantum algorithmsNested wordPermutation groupsGeneral Computer Scienceω-automatonTheoretical Computer ScienceCombinatoricsDeterministic finite automatonDFA minimizationDeterministic automatonQuantum finite automataAutomata theoryNondeterministic finite automatonFinite automataComputer Science::Formal Languages and Automata TheoryMathematicsComputer Science(all)Theoretical Computer Science
researchProduct

On a fundamental variational lemma for extremal quasiconformal mappings

1986

Discrete mathematicsQuasiconformal mappingLemma (mathematics)Extremal lengthGeneral MathematicsMathematicsCommentarii Mathematici Helvetici
researchProduct

Geometric Properties of Planar BV -Extension Domains

2009

We investigate geometric properties of those planar domains that are extension for functions with bounded variation.We start from a characterization of such domains given by Burago–Maz'ya and prove that a bounded, simply connected domain is a BV -extension domain if and only if its com- plement is quasiconvex. We further prove that the extension property is a bi-Lipschitz invariant and give applications to Sobolev extension domains.

Discrete mathematicsQuasiconformal mappingMathematics::Analysis of PDEsGeometric propertySobolev spaceQuasiconvex functionExtension domains; Sobolev spaces; Functions with bounded variationPlanarSobolev spacesFunctions with bounded variationBounded functionSimply connected spaceInvariant (mathematics)Extension domainsMathematics
researchProduct