The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

Displaying 41 – 60 of 140

Showing per page

Clean matrices over commutative rings

Huanyin Chen (2009)

Czechoslovak Mathematical Journal

A matrix A M n ( R ) is e -clean provided there exists an idempotent E M n ( R ) such that A - E GL n ( R ) and det E = e . We get a general criterion of e -cleanness for the matrix [ [ a 1 , a 2 , , a n + 1 ] ] . Under the n -stable range condition, it is shown that [ [ a 1 , a 2 , , a n + 1 ] ] is 0 -clean iff ( a 1 , a 2 , , a n + 1 ) = 1 . As an application, we prove that the 0 -cleanness and unit-regularity for such n × n matrix over a Dedekind domain coincide for all n 3 . The analogous for ( s , 2 ) property is also obtained.

Clifford algebras, Fourier transforms and singular convolution operators on Lipschitz surfaces.

Chun Li, Alan McIntosh, Tao Qian (1994)

Revista Matemática Iberoamericana

In the Fourier theory of functions of one variable, it is common to extend a function and its Fourier transform holomorphically to domains in the complex plane C, and to use the power of complex function theory. This depends on first extending the exponential function eixξ of the real variables x and ξ to a function eizζ which depends holomorphically on both the complex variables z and ζ .Our thesis is this. The natural analog in higher dimensions is to extend a function of m real variables monogenically...

Clifford algebras, Möbius transformations, Vahlen matrices, and B -loops

Jimmie Lawson (2010)

Commentationes Mathematicae Universitatis Carolinae

In this paper we show that well-known relationships connecting the Clifford algebra on negative euclidean space, Vahlen matrices, and Möbius transformations extend to connections with the Möbius loop or gyrogroup on the open unit ball B in n -dimensional euclidean space n . One notable achievement is a compact, convenient formula for the Möbius loop operation a * b = ( a + b ) ( 1 - a b ) - 1 , where the operations on the right are those arising from the Clifford algebra (a formula comparable to ( w + z ) ( 1 + w ¯ z ) - 1 for the Möbius loop multiplication...

Coalescing Fiedler and core vertices

Didar A. Ali, John Baptist Gauci, Irene Sciriha, Khidir R. Sharaf (2016)

Czechoslovak Mathematical Journal

The nullity of a graph G is the multiplicity of zero as an eigenvalue in the spectrum of its adjacency matrix. From the interlacing theorem, derived from Cauchy’s inequalities for matrices, a vertex of a graph can be a core vertex if, on deleting the vertex, the nullity decreases, or a Fiedler vertex, otherwise. We adopt a graph theoretical approach to determine conditions required for the identification of a pair of prescribed types of root vertices of two graphs to form a cut-vertex of unique...

Combinatorial aspects of generalized complementary basic matrices

Miroslav Fiedler, Frank Hall (2013)

Open Mathematics

This paper extends some properties of the generalized complementary basic matrices, in particular, in a combinatorial direction. These include inheritance (such as for Alternating Sign Matrices), spectral, and sign pattern matrix (including sign nonsingularity) properties.

Currently displaying 41 – 60 of 140