نتایج جستجو برای: clifford semigroup
تعداد نتایج: 9205 فیلتر نتایج به سال:
In this paper we investigate some properties of congruences on ternary semigroups. We also define the notion of congruence on a ternary semigroup generated by a relation and we determine the method of obtaining a congruence on a ternary semigroup T from a relation R on T. Furthermore we study the lattice of congruences on a ternary semigroup and we show that this lattice is not generally modular...
We study the notion of Γ-graded commutative algebra for an arbitrary abelian group Γ. The main examples are the Clifford algebras already treated in [2]. We prove that the Clifford algebras are the only simple finitedimensional associative graded commutative algebras over R or C. Our approach also leads to non-associative graded commutative algebras extending the Clifford algebras.
Clifford algebras are naturally associated with quadratic forms. These algebras are Z2 -graded by construction. However, only a Zn -gradation induced by a choice of a basis, or even better, by a Chevalley vector space isomorphism Cl(V ) ↔ ∧ V and an ordering, guarantees a multivector decomposition into scalars, vectors, tensors, and so on, mandatory in physics. We show that the Chevalley isomor...
Euclidean Clifford analysis is a higher dimensional function theory offering a refinement of classical harmonic analysis. The theory is centred around the concept of monogenic functions, which constitute the kernel of a first order vector valued, rotation invariant, differential operator ∂ called the Dirac operator, which factorizes the Laplacian. More recently, Hermitean Clifford analysis has ...
A homogeneous space G/H is said to have a compact Clifford-Klein form if there exists a discrete subgroup Γ of G that acts properly discontinuously on G/H, such that the quotient space Γ\G/H is compact. When n is even, we find every closed, connected subgroup H of G = SO(2, n), such that G/H has a compact Clifford-Klein form, but our classification is not quite complete when n is odd. The work ...
We prove the following results: (1) Every group is a maximal subgroup of some free idempotent generated semigroup. (2) Every finitely presented group is a maximal subgroup of some free idempotent generated semigroup arising from a finite semigroup. (3) Every group is a maximal subgroup of some free regular idempotent generated semigroup. (4) Every finite group is a maximal subgroup of some free...
Inspired by the results of [APR], we propose combinatorial Gelfand models for semigroup algebras of some finite semigroups, which include the symmetric inverse semigroup, the dual symmetric inverse semigroup, the maximal factorizable subsemigroup in the dual symmetric inverse semigroup, and the factor power of the symmetric group. Furthermore we extend the Gelfand model for the semigroup algebr...
Fault-tolerant quantum computation is a basic problem in quantum computation, and teleportation is one of the main techniques in this theory. Using teleportation on stabilizer codes, the most well-known quantum codes, Pauli gates and Clifford operators can be applied fault-tolerantly. Indeed, this technique can be generalized for an extended set of gates, the so called Ck hierarchy gates, intro...
We present a new algorithm for classical simulation of quantum circuits over the Clifford+T gate set. The runtime of the algorithm is polynomial in the number of qubits and the number of Clifford gates in the circuit but exponential in the number of T gates. The exponential scaling is sufficiently mild that the algorithm can be used in practice to simulate medium-sized quantum circuits dominate...
Abstract. A homogeneous space G/H is said to have a compact Clifford-Klein form if there exists a discrete subgroup Γ of G that acts properly on G/H such that the quotient space Γ\G/H is compact. When n is even, we find every closed connected subgroup H of G = SO(2, n), such that G/H has a compact Clifford-Klein form, but our classification is not quite complete when n is odd. The work reveals ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید