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 61 – 80 of 269

Showing per page

Diffeomorphisms of Rn with oscillatory jacobians.

Waldyr M. Oliva, Nelson M. Kuhl, Luiz T. Magalhâes (1993)

Publicacions Matemàtiques

The paper presents, mainly, two results: a new proof of the spectral properties of oscillatory matrices and a transversality theorem for diffeomorphisms of Rn with oscillatory jacobian at every point and such that NM(f(x) - f(y)) ≤ NM(x - y) for all elements x,y ∈ Rn, where NM(x) - 1 denotes the maximum number of sign changes in the components zi of z ∈ Rn, where all zi are non zero and z varies in a small neighborhood of x. An application to a semiimplicit discretization of the scalar heat equation...

Distance matrices perturbed by Laplacians

Balaji Ramamurthy, Ravindra Bhalchandra Bapat, Shivani Goel (2020)

Applications of Mathematics

Let T be a tree with n vertices. To each edge of T we assign a weight which is a positive definite matrix of some fixed order, say, s . Let D i j denote the sum of all the weights lying in the path connecting the vertices i and j of T . We now say that D i j is the distance between i and j . Define D : = [ D i j ] , where D i i is the s × s null matrix and for i j , D i j is the distance between i and j . Let G be an arbitrary connected weighted graph with n vertices, where each weight is a positive definite matrix of order s . If i and...

Exponents of two-colored digraphs

Yan Ling Shao, Yubin Gao (2009)

Czechoslovak Mathematical Journal

We consider the primitive two-colored digraphs whose uncolored digraph has n + s vertices and consists of one n -cycle and one ( n - 3 ) -cycle. We give bounds on the exponents and characterizations of extremal two-colored digraphs.

Currently displaying 61 – 80 of 269