Displaying similar documents to “Vandermonde nets”

Generalized Schröder matrices arising from enumeration of lattice paths

Lin Yang, Sheng-Liang Yang, Tian-Xiao He (2020)

Czechoslovak Mathematical Journal

Similarity:

We introduce a new family of generalized Schröder matrices from the Riordan arrays which are obtained by counting of the weighted lattice paths with steps E = ( 1 , 0 ) , D = ( 1 , 1 ) , N = ( 0 , 1 ) , and D ' = ( 1 , 2 ) and not going above the line y = x . We also consider the half of the generalized Delannoy matrix which is derived from the enumeration of these lattice paths with no restrictions. Correlations between these matrices are considered. By way of illustration, we give several examples of Riordan arrays of combinatorial interest....

A computation of positive one-peak posets that are Tits-sincere

Marcin Gąsiorek, Daniel Simson (2012)

Colloquium Mathematicae

Similarity:

A complete list of positive Tits-sincere one-peak posets is provided by applying combinatorial algorithms and computer calculations using Maple and Python. The problem whether any square integer matrix A ( ) is ℤ-congruent to its transpose A t r is also discussed. An affirmative answer is given for the incidence matrices C I and the Tits matrices C ̂ I of positive one-peak posets I.

Linear preservers of rc-majorization on matrices

Mohammad Soleymani (2024)

Czechoslovak Mathematical Journal

Similarity:

Let A , B be n × m matrices. The concept of matrix majorization means the j th column of A is majorized by the j th column of B and this is done for all j by a doubly stochastic matrix D . We define rc-majorization that extended matrix majorization to columns and rows of matrices. Also, the linear preservers of rc-majorization will be characterized.

Controllable and tolerable generalized eigenvectors of interval max-plus matrices

Matej Gazda, Ján Plavka (2021)

Kybernetika

Similarity:

By max-plus algebra we mean the set of reals equipped with the operations a b = max { a , b } and a b = a + b for a , b . A vector x is said to be a generalized eigenvector of max-plus matrices A , B ( m , n ) if A x = λ B x for some λ . The investigation of properties of generalized eigenvectors is important for the applications. The values of vector or matrix inputs in practice are usually not exact numbers and they can be rather considered as values in some intervals. In this paper the properties of matrices and vectors with inexact (interval)...

-simplicity of interval max-min matrices

Ján Plavka, Štefan Berežný (2018)

Kybernetika

Similarity:

A matrix A is said to have 𝐗 -simple image eigenspace if any eigenvector x belonging to the interval 𝐗 = { x : x ̲ x x ¯ } containing a constant vector is the unique solution of the system A y = x in 𝐗 . The main result of this paper is an extension of 𝐗 -simplicity to interval max-min matrix 𝐀 = { A : A ̲ A A ¯ } distinguishing two possibilities, that at least one matrix or all matrices from a given interval have 𝐗 -simple image eigenspace. 𝐗 -simplicity of interval matrices in max-min algebra are studied and equivalent conditions for...

G-matrices, J -orthogonal matrices, and their sign patterns

Frank J. Hall, Miroslav Rozložník (2016)

Czechoslovak Mathematical Journal

Similarity:

A real matrix A is a G-matrix if A is nonsingular and there exist nonsingular diagonal matrices D 1 and D 2 such that A - T = D 1 A D 2 , where A - T denotes the transpose of the inverse of A . Denote by J = diag ( ± 1 ) a diagonal (signature) matrix, each of whose diagonal entries is + 1 or - 1 . A nonsingular real matrix Q is called J -orthogonal if Q T J Q = J . Many connections are established between these matrices. In particular, a matrix A is a G-matrix if and only if A is diagonally (with positive diagonals) equivalent to a column permutation...

Circulant matrices with orthogonal rows and off-diagonal entries of absolute value 1

Daniel Uzcátegui Contreras, Dardo Goyeneche, Ondřej Turek, Zuzana Václavíková (2021)

Communications in Mathematics

Similarity:

It is known that a real symmetric circulant matrix with diagonal entries d 0 , off-diagonal entries ± 1 and orthogonal rows exists only of order 2 d + 2 (and trivially of order 1 ) [Turek and Goyeneche 2019]. In this paper we consider a complex Hermitian analogy of those matrices. That is, we study the existence and construction of Hermitian circulant matrices having orthogonal rows, diagonal entries d 0 and any complex entries of absolute value 1 off the diagonal. As a particular case, we consider...

Explicit construction of normal lattice configurations

Mordechay B. Levin, Meir Smorodinsky (2005)

Colloquium Mathematicae

Similarity:

We extend Champernowne’s construction of normal numbers to base b to the d case and obtain an explicit construction of a generic point of the d shift transformation of the set 0 , 1 , . . . , b - 1 d .

Construction of uninorms on bounded lattices

Gül Deniz Çaylı, Funda Karaçal (2017)

Kybernetika

Similarity:

In this paper, we propose the general methods, yielding uninorms on the bounded lattice ( L , , 0 , 1 ) , with some additional constraints on e L { 0 , 1 } for a fixed neutral element e L { 0 , 1 } based on underlying an arbitrary triangular norm T e on [ 0 , e ] and an arbitrary triangular conorm S e on [ e , 1 ] . And, some illustrative examples are added for clarity.

Maps on upper triangular matrices preserving zero products

Roksana Słowik (2017)

Czechoslovak Mathematical Journal

Similarity:

Consider 𝒯 n ( F ) —the ring of all n × n upper triangular matrices defined over some field F . A map φ is called a zero product preserver on 𝒯 n ( F ) in both directions if for all x , y 𝒯 n ( F ) the condition x y = 0 is satisfied if and only if φ ( x ) φ ( y ) = 0 . In the present paper such maps are investigated. The full description of bijective zero product preservers is given. Namely, on the set of the matrices that are invertible, the map φ may act in any bijective way, whereas for the zero divisors and zero matrix one can write φ as a...

( 0 , 1 ) -matrices, discrepancy and preservers

LeRoy B. Beasley (2019)

Czechoslovak Mathematical Journal

Similarity:

Let m and n be positive integers, and let R = ( r 1 , ... , r m ) and S = ( s 1 , ... , s n ) be nonnegative integral vectors. Let A ( R , S ) be the set of all m × n ( 0 , 1 ) -matrices with row sum vector R and column vector S . Let R and S be nonincreasing, and let F ( R ) be the m × n ( 0 , 1 ) -matrix, where for each i , the i th row of F ( R , S ) consists of r i 1’s followed by ( n - r i ) 0’s. Let A A ( R , S ) . The discrepancy of A, disc ( A ) , is the number of positions in which F ( R ) has a 1 and A has a 0. In this paper we investigate linear operators mapping m × n matrices over...

Sufficient conditions for a T-partial order obtained from triangular norms to be a lattice

Lifeng Li, Jianke Zhang, Chang Zhou (2019)

Kybernetika

Similarity:

For a t-norm T on a bounded lattice ( L , ) , a partial order T was recently defined and studied. In [11], it was pointed out that the binary relation T is a partial order on L , but ( L , T ) may not be a lattice in general. In this paper, several sufficient conditions under which ( L , T ) is a lattice are given, as an answer to an open problem posed by the authors of [11]. Furthermore, some examples of t-norms on L such that ( L , T ) is a lattice are presented.

Row Hadamard majorization on 𝐌 m , n

Abbas Askarizadeh, Ali Armandnejad (2021)

Czechoslovak Mathematical Journal

Similarity:

An m × n matrix R with nonnegative entries is called row stochastic if the sum of entries on every row of R is 1. Let 𝐌 m , n be the set of all m × n real matrices. For A , B 𝐌 m , n , we say that A is row Hadamard majorized by B (denoted by A R H B ) if there exists an m × n row stochastic matrix R such that A = R B , where X Y is the Hadamard product (entrywise product) of matrices X , Y 𝐌 m , n . In this paper, we consider the concept of row Hadamard majorization as a relation on 𝐌 m , n and characterize the structure of all linear operators T : 𝐌 m , n 𝐌 m , n preserving...

Polynomials with values which are powers of integers

Rachid Boumahdi, Jesse Larone (2018)

Archivum Mathematicum

Similarity:

Let P be a polynomial with integral coefficients. Shapiro showed that if the values of P at infinitely many blocks of consecutive integers are of the form Q ( m ) , where Q is a polynomial with integral coefficients, then P ( x ) = Q ( R ( x ) ) for some polynomial R . In this paper, we show that if the values of P at finitely many blocks of consecutive integers, each greater than a provided bound, are of the form m q where q is an integer greater than 1, then P ( x ) = ( R ( x ) ) q for some polynomial R ( x ) .

Comparison between two types of large sample covariance matrices

Guangming Pan (2014)

Annales de l'I.H.P. Probabilités et statistiques

Similarity:

Let { X i j } , i , j = , be a double array of independent and identically distributed (i.i.d.) real random variables with E X 11 = μ , E | X 11 - μ | 2 = 1 and E | X 11 | 4 l t ; . Consider sample covariance matrices (with/without empirical centering) 𝒮 = 1 n j = 1 n ( 𝐬 j - 𝐬 ¯ ) ( 𝐬 j - 𝐬 ¯ ) T and 𝐒 = 1 n j = 1 n 𝐬 j 𝐬 j T , where 𝐬 ¯ = 1 n j = 1 n 𝐬 j and 𝐬 j = 𝐓 n 1 / 2 ( X 1 j , ... , X p j ) T with ( 𝐓 n 1 / 2 ) 2 = 𝐓 n , non-random symmetric non-negative definite matrix. It is proved that central limit theorems of eigenvalue statistics of 𝒮 and 𝐒 are different as n with p / n approaching a positive constant. Moreover, it is also proved that such a different behavior is not observed in the...