Maximal- and minimal symmetric solutions of fully fuzzy linear systems

In this paper, we shall propose a new method to obtain symmetric solutions of a fully fuzzy linear system (FFLS) based on a 1-cut expansion. To this end, we solve the 1-cut of a FFLS (in the present paper, we assumed that the 1-cut of a FFLS is a crisp linear system or equivalently, the matrix coefficient and right hand side have triangular shapes), then some unknown symmetric spreads are allocated to each row of a 1-cut of a FFLS. So, after some manipulations, the original FFLS is transformed to solving 2n linear equations to find the symmetric spreads. However, our method always give us a fuzzy number vector solution. Moreover, using the proposed method leads to determining the maximal- and minimal symmetric solutions of the FFLS which are placed in a Tolerable Solution Set and a Controllable Solution Set, respectively. However, the obtained solutions could be interpreted as bounded symmetric solutions of the FFLS which are useful for a large number of multiplications existing between two fuzzy numbers. Finally, some numerical examples are given to illustrate the ability of the proposed method.     

A new computational method for solving fully fuzzy linear systems of triangular fuzzy numbers

In this paper, a new computational method is proposed to solve fully fuzzy linear systems (FFLS) of triangular fuzzy numbers based on the computation of row reduced echelon form for solving the crisp linear system of equations. The method is illustrated by solving three numerical examples. As compared to the existing methods, the proposed method is easy to understand and to apply for solving FFLS occurring in real life situations and scientific applications. The primary advantage of the proposed method is that, by using it, the consistency of the FFLS can be checked easily and nature of the solutions of an FFLS can also be obtained which may be unique or infinite.     

Branching Rules for General Linear Groups

In this article we give a branching rule for Harish–Chandra restriction from the general linear group Gl _n (q) to the Levi subgroup Gl _n?1(q) × Gl₁(q) in the case of the unipotent block.     

Solution to fuzzy system of linear equations with crisp coefficients

This paper presents a new and simple method to solve fuzzy real system of linear equations by solving two n × n crisp systems of linear equations. In an original system, the coefficient matrix is considered as real crisp, whereas an unknown variable vector and right hand side vector are considered as fuzzy. The general system is initially solved by adding and subtracting the left and right bounds of the vectors respectively. Then obtained solutions are used to get a final solution of the original system. The proposed method is used to solve five example problems. The results obtained are also compared with the known solutions and found to be in good agreement with them.     

A comparison of automorphicL-functions in a theta series lifting for unitary groups

A relation between automorphicL-functions forU(n,n+1)×GL(n) and those forU(n,n)×GL(n) in a theta series lifting is studied by using the Rankin-Selberg method.     

Linear Operators that Preserve Commuting Pairs of Nonnegative Real Matrices

A pair of n×n matrices (A, B) is called a commuting pair if AB=BA. We characterize the linear operators that preserve the set of commuting pairs of matrices over a subsemiring of nonnegative real numbers.     

On the Dot Product Graph of a Commutative Ring

Let A be a commutative ring with nonzero identity, 1 ≤ n < ∞ be an integer, and R = A × A × … ×A (n times). The total dot product graph of R is the (undirected) graph TD(R) with vertices R* = R?{(0, 0,…, 0)}, and two distinct vertices x and y are adjacent if and only if x·y = 0 ∈ A (where x·y denote the normal dot product of x and y). Let Z(R) denote the set of all zero-divisors of R. Then the zero-divisor dot product graph of R is the induced subgraph ZD(R) of TD(R) with vertices Z(R)* = Z(R)?{(0, 0,…, 0)}. It follows that each edge (path) of the classical zero-divisor graph Γ(R) is an edge (path) of ZD(R). We observe that if n = 1, then TD(R) is a disconnected graph and ZD(R) is identical to the well-known zero-divisor graph of R in the sense of Beck–Anderson–Livingston, and hence it is connected. In this paper, we study both graphs TD(R) and ZD(R). For a commutative ring A and n ≥ 3, we show that TD(R) (ZD(R)) is connected with diameter two (at most three) and with girth three. Among other things, for n ≥ 2, we show that ZD(R) is identical to the zero-divisor graph of R if and only if either n = 2 and A is an integral domain or R is ring-isomorphic to ?₂ × ?₂ × ?₂.     

Linear operators preserving unitarily invariant norms of matrices

Let F _{m × n} be the set of all m × n matrices over the field F = C or R Denote by U_n (F) the group of all n × n unitary or orthogonal matrices according as F = C or F-R. A norm N() on F m ×n, is unitarily invariant if N(UAV) = N(A): for all A ∈ F _m×n U ∈ U _m (F). and V ∈ U_n (F). We characterize those linear operators T F _{m × n} → F _{m × n} which satisfy N (T(A)) = N(A)for all A ∈ F _{m × n}

for a given unitarily invariant norm N(). It is shown that the problem is equivalent to characterizing those operators which preserve certain subsets in F _{m × n} To develop the theory we prove some results concerning unitary operators on F _{m × n} which are of independent interest.     

On Generators of the Tame Automorphism Group of Free Metabelian Lie Algebras

We prove that the tame automorphism group TAut(M _n ) of a free metabelian Lie algebra M _n in n variables over a field k is generated by a single nonlinear automorphism modulo all linear automorphisms if n ≥ 4 except the case when n = 4 and char(k) ≠ 3. If char(k) = 3, then TAut(M ₄) is generated by two automorphisms modulo all linear automorphisms. We also prove that the tame automorphism group TAut(M ₃) cannot be generated by any finite number of automorphisms modulo all linear automorphisms.     

Lattice-Ordered Matrix Algebras Over Real GCD-Domains

Let R ? ? be a GCD-domain. In this article, Weinberg's conjecture on the n × n matrix algebra M _n (R) (n ≥ 2) is proved. Moreover, all the lattice orders (up to isomorphisms) on a full 2 × 2 matrix algebra over R are obtained.     

Maps preserving square-zero matrices on the algebra consisting of all upper triangular matrices

Let F be a field, T _n (F) (respectively, N _n (F)) the matrix algebra consisting of all n × n upper triangular matrices (respectively, strictly upper triangular matrices) over F. A ∈ T _n (F) is said to be square zero if A ² = 0. In this article, we firstly characterize non-singular linear maps on N _n (F) preserving square-zero matrices in both directions, then by using it we determine non-singular linear maps on T _n (F) preserving square-zero matrices in both directions.     

Singular Manakov flows and geodesic flows on homogeneous spaces of SO(N)

We prove complete integrability of the Manakov-type SO(n)-invariant geodesic flows on homogeneous spaces SO(n)/SO(k₁) ×⋯× SO(k _r ), for any choice of k ₁,…,k _r , k ₁ + ⋯ + k _r ⩽ n. In particular, a new proof of the integrability of a Manakov symmetric rigid body motion around a fixed point is presented. Also, the proof of integrability of the SO(n)-invariant Einstein metrics on SO(k ₁ + k ₂ + k ₃)/SO(k ₁) × SO(k ₂) × SO(k ₃) and on the Stiefel manifolds V (n, k) = SO(n)/SO(k) is given.     

Inertially arbitrary patterns

An n×n sign pattern matrix A is an inertially arbitrary pattern (IAP) if each non-negative triple (r s t) with r+s+t=n is the inertia of a matrix with sign pattern A. This paper considers the n×n(n2) skew-symmetric sign pattern S_n with each upper off-diagonal entry positive, the (1,1) entry negative, the (n n) entry positive, and every other diagonal entry zero. We prove that S_n is an IAP.     

Chromatic numbers of products of graphs: The directed and undirected versions of the Poljak‐Rödl function

Let f(n) = min{χ(G × H) : G and H are n‐chromatic digraphs} and g(n) = min{χ(G × H) : G and H are n‐chromatic graphs}. We prove that f is bounded if and only if g is bounded. © 2005 Wiley Periodicals, Inc. J Graph Theory     

On k-spaces of real matrices

It is shown that if W is a linear subspace of real n × n matrices, such that rank (A) = k for all 0 ≠ A ∈ W, then dim W≤ n. If dim W = n.5≤ n is prime, and 2 is primitive modulo n then k =1.     

Group construction of covering arrays

A covering array t‐CA (n, k, g) is a k × n array on a set of g symbols with the property that in each t × n subarray, every t × 1 column appears at least once. This paper improves many of the best known upper bounds on n for covering arrays, 2‐CA (n, k, g) with g + 1 ≤ k ≤ 2g, for g = 3 · · · 12 by a construction which in many of these cases produces a 2‐CA (n, k, g) with n = k (g ? 1) + 1. The construction is an extension of an algebraic method used by Chateauneuf, Colbourn, and Kreher which uses an array and a group action on the array. © 2004 Wiley Periodicals, Inc. J Combin Designs 13: 70–77, 2005.     

The Cauchy problem for quasilinear SG‐hyperbolic systems

We study the Cauchy problem for a class of quasilinear hyperbolic systems with coefficients depending on (t, x) ∈ [0, T ] × ?ⁿ and presenting a linear growth for |x | → ∞. We prove well‐posedness in the Schwartz space ?? (?ⁿ ). The result is obtained by deriving an energy estimate for the solution of the linearized problem in some weighted Sobolev spaces and applying a fixed point argument. (© 2007 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Gauge-Invariant Characterization of Yang–Mills–Higgs Equations

Let C → M be the bundle of connections of a principal G-bundle P → M over a pseudo-Riemannian manifold (M,g) of signature (n⁺, n⁻) and let E → M be the associated bundle with P under a linear representation of G on a finite-dimensional vector space. For an arbitrary Lie group G, the O(n⁺, n⁻) × G-invariant quadratic Lagrangians on J¹(C × _M E) are characterized. In particular, for a simple Lie group the Yang–Mills and Yang–Mills–Higgs Lagrangians are characterized, up to an scalar factor, to be the only O(n⁺, n⁻) × G-invariant quadratic Lagrangians. These results are also analyzed on several examples of interest in gauge theory. Submitted: May 19, 2005; Accepted: April 25, 2006     

Discriminants in characteristic two

The Kronecker-Weierstrass theory of pencils is extended to give a necessary and sufficient condition that two 2×m×n tensors are equivalent. The connection between equivalence class representatives and the triple transitivity of PGL(2,F) is discussed. One consequence of the discussion is that the number of inequivalent 2×3×n tensors is finite. An efficient algorithm is given for testing the condition which ultimately depends on a fast pattern matching algorithm.