On quantum mechanics and generalized Clifford algebras

In this note we give elementary examples of the naturalness of generalized Clifford algebras appearance, in some particular quantum mechanical models. First Weyl’s program [1] for quantum kinematics for the case of simplest Galois fieldsZ _n is realized in terms of generalized Clifford algebras. Dynamics might then be introduced, following the ideas of Hanney and Berry [2], as shown in [3]. Second the coherent state picture of the finite dimensional “Z _n — Quantum Mechanics” is presented. In the last part the known coherent states ofq-deformed quantum oscillators (q≡ω) are explicitly shown in the generalized Grassman algebras and the generalized Clifford algebras settings. Presented atThe Polish-Mexican Seminar, Kazimierz Dolny, August 1998 — Poland. 176     

Presentations of the Schützenberger Product of n Groups

ABSTRACT

In this article, we first consider n × n upper-triangular matrices with entries in a given semiring k. Matrices of this form with invertible diagonal entries form a monoid B _n (k). We show that B _n (k) splits as a semidirect product of the monoid of unitriangular matrices U _n (k) by the group of diagonal matrices. When the semiring is a field, B _n (k) is actually a group and we recover a well-known result from the theory of groups and Lie algebras. Pursuing the analogy with the group case, we show that U _n (k) is the ordered set product of n(n ? 1)/2 commutative monoids (the root subgroups in the group case). Finally, we give two different presentations of the Schützenberger product of n groups G ₁,…, G _n , given a monoid presentation ?A _i  | R _i ? of each group G _i . We also obtain as a special case presentations for the monoid of all n × n unitriangular Boolean matrices.     

Maximal subgroups of the minimal ideal of a free profinite monoid are free

We answer a question of Margolis from 1997 by establishing that the maximal subgroup of the minimal ideal of a finitely generated free profinite monoid is a free profinite group. More generally, if H is variety of finite groups closed under extension and containing ℤ/pℤ for infinitely may primes p, the corresponding result holds for free pro-$ \bar H $ \bar H monoids.     

The Menger property for infinite ordered sets

It is shown that, if an ordered set P contains at most k pairwise disjoint maximal chains, where k is finite, then every finite family of maximal chains in P has a cutset of size at most k. As a corollary of this, we obtain the following Menger-type result that, if in addition, P contains k pairwise disjoint complete maximal chains, then the whole family, M (P), of maximal chains in P has a cutset of size k. We also give a direct proof of this result. We give an example of an ordered set P in which every maximal chain is complete, P does not contain infinitely many pairwise disjoint maximal chains (but arbitrarily large finite families of pairwise disjoint maximal chains), and yet M (P) does not have a cutset of size <x, where x is any given (infinite) cardinal. This shows that the finiteness of k in the above corollary is essential and disproves a conjecture of Zaguia.     

Clifford-algebraic random walks on the hypercube

The n-dimensional hypercube is a simple graph on 2ⁿ vertices labeled by binary strings, or words, of length n. Pairs of vertices are adjacent if and only if they differ in exactly one position as binary words; i.e., the Hamming distance between the words is one. A discrete-time random walk is easily defined on the hypercube by “flipping” a randomly selected digit from 0 to 1 or vice-versa at each time step. By associating the words as blades in a Clifford algebra of particular signature, combinatorial properties of the geometric product can be used to represent this random walk as a sequence within the algebra. A closed-form formula is revealed which yields probability distributions on the vertices of the hypercube at any time k ≥ 0 by a formal power series expansion of elements in the algebra. Furthermore, by inducing a walk on a larger Clifford algebra, probabilities of self-avoiding walks and expected first hitting times of specific vertices are recovered. Moreover, because the Clifford algebras used in the current work are canonically isomorphic to fermion algebras, everything appearing here can be rewritten using fermion creation/annihilation operators, making the discussion relevant to quantum mechanics and/or quantum computing.     

Large classes of infinite k‐cop‐win graphs

While finite cop‐win finite graphs possess a good structural characterization, none is known for infinite cop‐win graphs. As evidence that such a characterization might not exist, we provide as large as possible classes of infinite graphs with finite cop number. More precisely, for each infinite cardinal κ and each positive integer k, we construct 2^κ non‐isomorphic k‐cop‐win graphs satisfying additional properties such as vertex‐transitivity, or having universal endomorphism monoid and automorphism group. © 2010 Wiley Periodicals, Inc. J Graph Theory 65: 334–342, 2010     

Clifford semigroups as functors and their cohomology

We prove that the category of Clifford semigroups and prehomomorphisms CSP\mathcal{CSP} is isomorphic to a certain subcategory of the category of diagrams over groups. Under this isomorphism, Clifford semigroups are identified with certain functors. As an application of the isomorphism theorem, we show that the category with objects commutative inverse semigroups having the same semilattice of idempotents and with morphisms, the inverse semigroup homomorphisms that fix the semilattice, imbeds into a category of right modules over a certain ring. Also we find a very close relationship between the cohomology groups of a commutative inverse monoid and the cohomology groups of the colimit group of the functor giving the monoid.     

Direct sums and refinement

In this paper we present a division theorem for the pseudovariety of semigroups OP generated by all semigroups of orientation preserving full transformations on a finite chain, which is achieved by using a natural representation of a certain monoid of transformations of a set X as a monoid of transformations of a subset of X.     

The reverse spelling of an FPrt-universal word in two letters

ForX a set the expression Prt(X) denotes the composition monoid of all functionsf X ×X. Fork a positive integer the letterk denotes also the set of all nonnegative integers less thank. Whenk > 1 the expression r_k denotes the connected injective element {<i, i + 1>i k – 1} in Prt (k). We show for every word w=w(x,y) in a two-letter alphabet that if the equation w(x, y)=r_k has a solution =y) ²Prt(k) then ¯w(x,y)=r_k also has a solution in²Prt(k), where ¯w is the word obtained by spelling the wordw backwards. It is a consequence of this theorem that if for every finite setX and for everyf Prt(X) the equation w(x,y)=f has a solution in²Prt(X) then for every suchX andf the equation ¯w(x, y)=f has a solution in²Prt(X).Presented by J. Mycielski.     

Comparing Semigroup and Monoid Presentations for Finite Monoids

 It is known that for any finite group G given by a finite group presentation there exists a finite semigroup presentation for G of the same deficiency, i.e. satisfying . It is also known that the analogous statement does not hold for all finite monoids. In this paper we give a necessary and sufficient condition for a finite monoid M, given by a finite monoid presentation, to have a finite semigroup presentation of the same deficiency.     

ARMENDARIZ RINGS RELATIVE TO A MONOID

ABSTRACT

For a monoid M, we introduce M-Armendariz rings, which are generalizations of Armendariz rings; and we investigate their properties. Every reduced ring is M-Armendariz for any unique product monoid M. We show that if R is a reduced and M-Armendariz ring, then R is M × N-Armendariz, where N is a unique product monoid. It is also shown that a finitely generated Abelian group G is torsion free if and only if there exists a ring R such that R is G-Armendariz. Moreover, we study the relationship between the Baerness and the PP-property of a ring R and those of the monoid ring R[M] in case R is M-Armendariz.     

The Coradical Filtration for Drinfeld Double Ringel-Hall Algebras

Abstract

Let 𝒟(Λ) be the Drinfeld double Ringel-Hall algebra with Λ being any finite dimensional hereditary algebra over a finite field k. We determine the coradical filtration for 𝒟(Λ). As an application, we describe the group of Hopf algebra automorphisms of the Drinfeld double Ringel composition algebra of Λ.     

Finitely generated varieties of distributive double <Emphasis Type="Italic">p</Emphasis>-algebras universal modulo a group

For any monoid M, any universal variety contains arbitrarily large algebras whose endomorphism monoid is isomorphic to M. A variety universal modulo a group G contains arbitrarily large algebras whose endomorphism monoid is isomorphic to the direct product M x G. One of the results of this paper structurally characterizes all finitely generated varieties of distributive double p-algebras universal modulo a group, and shows that any unavoidable direct factor G is a Boolean group with at most eight elements.     

Graph expansions of unipotent monoids

Margolis and Meakin use the Cayley graph of a group presentation to construct E-unitary inverse monoids [11]. This is the technique we refer to as graph expansion. In this paper we consider graph expansions of unipotent monoids, where a monoid is unipotent if it contains a unique idempotent. The monoids arising in this way are E-unitary and belong to the quasivariety of weakly left ample monoids. We give a number of examples of such monoids. We show that the least unipotent congruence on a weakly left ample monoid is given by the same formula as that for the least group congruence on an inverse monoid and we investigate the notion of proper for weakly left ample monoids.

Using graph expansions we construct a functor F^e from the category U of unipotent monoids to the category PWLA of proper weakly left ample monoids. The functor F^e is an expansion in the sense of Birget and Rhodes [2]. If we equip proper weakly left ample monoids with an extra unary operation and denote the corresponding category by PWLA ⁰ then regarded as a functor U→PWLA ⁰ F^e is a left adjoint of the functor F^σ : PWLA ⁰ → U that takes a proper weakly left ample monoid to its greatest unipotent image.

Our main result uses the covering theorem of [8] to construct free weakly left ample monoids.     

Comparing Semigroup and Monoid Presentations for Finite Monoids

 It is known that for any finite group G given by a finite group presentation there exists a finite semigroup presentation for G of the same deficiency, i.e. satisfying . It is also known that the analogous statement does not hold for all finite monoids. In this paper we give a necessary and sufficient condition for a finite monoid M, given by a finite monoid presentation, to have a finite semigroup presentation of the same deficiency. (Received 17 April 2001; in revised form 15 September 2001)     

SEPARABILITY CONDITIONS IN ACTS OVER MONOIDS

We discuss residual finiteness and several related separability conditions for the class of monoid acts, namely weak subact separability, strong subact separability and complete separability. For each of these four separability conditions, we investigate which monoids have the property that all their (finitely generated) acts satisfy the condition. In particular, we prove that: all acts over a finite monoid are completely separable (and hence satisfy the other three separability conditions); all finitely generated acts over a finitely generated commutative monoid are residually finite and strongly subact separable (and hence weakly subact separable); all acts over a commutative idempotent monoid are residually finite and strongly subact separable; and all acts over a Clifford monoid are strongly subact separable.

     

On the admissibility of finite groups over global fields of finite characteristic

Let k be a global field of characteristic p. A finite group G is called k-admissible if there exists a division algebra finite dimensional and central over k which is a crossed product for G. Let G be a finite group with normal Sylow p-subgroup P. If the factor group G/P is k-admissible, then G is k-admissible. A necessary condition is given for a group to be k-admissible: if a finite group G is k-admissible, then every Sylow l-subgroup of G for l ≠ p is metacyclic with some additional restriction. Then it is proved that a metacyclic group G generated by x and y is k-admissible if some relation between x and y is satisfied.     

On Appell Sets and the Fueter-Sce Mapping

It is proved in Clifford algebras generated by an odd number of basis vectors e ₁, ... , e _n , that the recently discussed Appell polynomials in Clifford algebras are the Fueter-Sce extension of the complex monomials z ^k . Furthermore, it is shown, for which complex functions the Fueter-Sce extension and the extension method using Appell polynomials coincide.