نتایج جستجو برای: lower triangular matrix
تعداد نتایج: 1052134 فیلتر نتایج به سال:
We show that for piecewise hereditary algebras, the periodicity of the Coxeter transformation implies the nonnegativity of the Euler form. Contrary to previous assumptions, the condition of piecewise heredity cannot be omitted, even for triangular algebras, as demonstrated by incidence algebras of posets. We also find that the only condition on a matrix A needed to express certain products of r...
In this paper, a closed-loop subspace identification approach through an orthogonal projection and subsequent singular value decomposition is proposed. As a by-product of this development, it explains why some existing subspace methods may deliver a bias in the presence of the feedback control and suggests a remedy to eliminate the bias. Furthermore, as the proposed method is a projection based...
In this paper, left derivations and Jordan left derivations in full and upper triangular matrix rings over unital associative rings are characterized.
It has been known for at least thirty years that certain nilpotent groups cannot be Kähler groups, i.e., fundamental groups of compact Kähler manifolds. The best known examples are lattices in the three-dimensional real or complex Heisenberg groups. It is also known that lattices in certain other standard nilpotent Lie groups, e.g., the full group of upper triangular matrices and the free k-ste...
Recently, Jeĺınek derived that the number of self-dual interval orders of reduced size n is twice the number of row-Fishburn matrices of size n by using generating functions. In this paper, we present a bijective proof of this relation by establishing a bijection between two variations of upper-triangular matrices of nonnegative integers. Using the bijection, we provide a combinatorial proof of...
The aim of the present paper is to carry on the research of Czédli in determining the maximum number of rectangular islands on a rectangular grid. We estimate the maximum of the number of triangular islands on a triangular grid.
We consider wreath product decompositions for semigroups of triangular matrices. We exhibit an explicit wreath product decomposition for the semigroup of all n× n upper triangular matrices over a given field k, in terms of aperiodic semigroups and affine groups over k. In the case that k is finite this decomposition is optimal, in the sense that the number of group terms is equal to the group c...
For a function f : {0, 1} → R and an invertible linear transformation L ∈ GLn(2), we consider the function Lf : {0, 1} → R defined by Lf(x) = f(Lx). We raise two conjectures: First, we conjecture that if f is Boolean and monotone then I(Lf) ≥ I(f), where I(f) is the total influence of f . Second, we conjecture that if both f and L(f) are monotone, then f = L(f) (up to a permutation of the coord...
Abstract. Let B+ ⊂ GLn(R) denote the subgroup of upper triangular n × nmatrices with positive entries on the main diagonal. A matrix M ∈ B+ is called totally positive if the determinants of all its minors not containing a row or column lying completely under the main diagonal are positive. We give a simple determinantal equation for the boundary of all positive upper triangular matrices in B+.
This note employs recurrence techniques to obtain entry-wise optimal inequalities for inverses of triangular matrices whose entries satisfy some monotonicity constraints. The derived bounds are easily computable.
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید