Displaying 1801 – 1820 of 3007

Showing per page

On the D -stability problem for real matrices

Russell Johnson, Alberto Tesi (1999)

Bollettino dell'Unione Matematica Italiana

Vengono discusse delle condizioni sufficienti affinchè una matrice reale A delle dimensioni n × n sia diagonalmente (o D -) stabile. Esse includono delle ipotesi geometriche (condizioni degli ortanti), e un criterio che generalizza un criterio di Carlson. Inoltre si discute la D -stabilità robusta per le matrici reali delle dimensioni 4 × 4

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 divisibility of power LCM matrices by power GCD matrices

Jian Rong Zhao, Shaofang Hong, Qunying Liao, Kar-Ping Shum (2007)

Czechoslovak Mathematical Journal

Let S = { x 1 , , x n } be a set of n distinct positive integers and e 1 an integer. Denote the n × n power GCD (resp. power LCM) matrix on S having the e -th power of the greatest common divisor ( x i , x j ) (resp. the e -th power of the least common multiple [ x i , x j ] ) as the ( i , j ) -entry of the matrix by ( ( x i , x j ) e ) (resp. ( [ x i , x j ] e ) ) . We call the set S an odd gcd closed (resp. odd lcm closed) set if every element in S is an odd number and ( x i , x j ) S (resp. [ x i , x j ] S ) for all 1 i , j n . In studying the divisibility of the power LCM and power GCD matrices, Hong conjectured in 2004 that...

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...

Currently displaying 1801 – 1820 of 3007