All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Previous Page 12 Next

Displaying 221 – 240 of 368

Showing per page

On the decidability of semigroup freeness∗

Julien Cassaigne, Francois Nicolas (2012)

RAIRO - Theoretical Informatics and Applications

This paper deals with the decidability of semigroup freeness. More precisely, the freeness problem over a semigroup S is defined as: given a finite subset X ⊆ S, decide whether each element of S has at most one factorization over X. To date, the decidabilities of the following two freeness problems have been closely examined. In 1953, Sardinas and Patterson proposed a now famous algorithm for the freeness problem over the free monoids....

On the decidability of semigroup freeness

Julien Cassaigne, Francois Nicolas (2012)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

This paper deals with the decidability of semigroup freeness. More precisely, the freeness problem over a semigroup S is defined as: given a finite subset X ⊆ S, decide whether each element of S has at most one factorization over X. To date, the decidabilities of the following two freeness problems have been closely examined. In 1953, Sardinas and Patterson proposed a now famous algorithm for the freeness problem over the free monoids. In 1991, Klarner, Birget and Satterfield proved the undecidability...

On the decidability of semigroup freeness∗

Julien Cassaigne, Francois Nicolas (2012)

RAIRO - Theoretical Informatics and Applications

This paper deals with the decidability of semigroup freeness. More precisely, the freeness problem over a semigroup S is defined as: given a finite subset X ⊆ S, decide whether each element of S has at most one factorization over X. To date, the decidabilities of the following two freeness problems have been closely examined. In 1953, Sardinas and Patterson proposed a now famous algorithm for the freeness problem over the free monoids....

On The Determinant of q-Distance Matrix of a Graph

Hong-Hai Li, Li Su, Jing Zhang (2014)

Discussiones Mathematicae Graph Theory

In this note, we show how the determinant of the q-distance matrix Dq(T) of a weighted directed graph G can be expressed in terms of the corresponding determinants for the blocks of G, and thus generalize the results obtained by Graham et al. [R.L. Graham, A.J. Hoffman and H. Hosoya, On the distance matrix of a directed graph, J. Graph Theory 1 (1977) 85-88]. Further, by means of the result, we determine the determinant of the q-distance matrix of the graph obtained from a connected weighted graph...

On the doubling of quadratic algebras

Lars Lindberg (2004)

Colloquium Mathematicae

The concept of doubling, which was introduced around 1840 by Graves and Hamilton, associates with any quadratic algebra 𝓐 over a field k of characteristic not 2 its double 𝓥(𝓐 ) = 𝓐 × 𝓐 with multiplication (w,x)(y,z) = (wy - z̅x,xy̅ + zw). This yields an endofunctor on the category of all quadratic k-algebras which is faithful but not full. We study in which respect the division property of a quadratic k-algebra is preserved under doubling and, provided this is the case, whether the...

On the Drazin index of regular elements

Pedro Patrício, António Costa (2009)

Open Mathematics

It is known that the existence of the group inverse a # of a ring element a is equivalent to the invertibility of a 2 a − + 1 − aa −, independently of the choice of the von Neumann inverse a − of a. In this paper, we relate the Drazin index of a to the Drazin index of a 2 a − + 1 − aa −. We give an alternative characterization when considering matrices over an algebraically closed field. We close with some questions and remarks.

Currently displaying 221 – 240 of 368