English
Related papers

Related papers: Canonical matrices with entries integers modulo p

200 papers

We consider a family of pairs of m-by-p and m-by-q matrices, in which some entries are required to be zero and the others are arbitrary, with respect to transformations (A,B)--> (SAR,SBL) with nonsingular S, R, L. We prove that almost all…

Representation Theory · Mathematics 2007-10-08 Tatyana N. Gaiduk , Vladimir V. Sergeichuk

In this paper many classes of sets of matrices with entries in F (F=R, F=C, F=H) are introduced. Each class with the corresponding topology determines a real analytical, complex or symplectic manifold for F=R, F=C or F=H respectively. Any…

Differential Geometry · Mathematics 2007-05-23 Kostadin Trencevski , Samet Kera

First, we prove that the set of $n\times n$ complex matrices is the closure of a certain open subset whose elements have a very specific canonical form under congruence, which is uniquely determined up to the values of some parameters, but…

Spectral Theory · Mathematics 2025-12-16 Fernando De Terán , Froilán M. Dopico

We study the concept of canonical characteristic set of a characterizable differential ideal. We propose an efficient algorithm that transforms any characteristic set into the canonical one. We prove the basic properties of canonical…

Commutative Algebra · Mathematics 2009-02-25 Oleg Golubitsky , Marina Kondratieva , Alexey Ovchinnikov

Canonical matrices are given for (a) bilinear forms over an algebraically closed or real closed field; (b) sesquilinear forms over an algebraically closed field and over real quaternions with any nonidentity involution; and (c) sesquilinear…

Representation Theory · Mathematics 2007-12-17 Roger A. Horn , Vladimir V. Sergeichuk

We exhibit an explicit, deterministic algorithm for finding a canonical form for a positive definite matrix under unimodular integral transformations. We use characteristic sets of short vectors and partition-backtracking graph software.…

Number Theory · Mathematics 2020-11-17 Mathieu Dutour Sikirić , Anna Haensch , John Voight , Wessel P. J. van Woerden

In the work are defined the concepts semi-canonical and canonical binary matrix. What is described is an algorithm solving the combinatorial problem for finding the semi-canonical matrices in the set \Lambda_n^k consisting of all n\times n…

Data Structures and Algorithms · Computer Science 2014-04-28 Krasimir Yordzhev

In this article, we introduce a notion of an exponential matrix, which is a polynomial matrix with exponential properties, and a notion of an equivalence relation of two exponential matrices, and then we initiate to study classifying…

Representation Theory · Mathematics 2018-10-10 Ryuji Tanimoto

This paper establishes that every positive-definite matrix can be written as a positive linear combination of outer products of integer-valued vectors whose entries are bounded by the geometric mean of the condition number and the dimension…

Metric Geometry · Mathematics 2015-08-05 Joel A. Tropp

We consider the problem of computing matrix polynomials $p(X)$, where $X$ is a large dense matrix, with as few matrix-matrix multiplications as possible. More precisely, let $\Pi_{2^{m}}^*$ represent the set of polynomials computable with…

Numerical Analysis · Mathematics 2025-08-14 Elias Jarlebring , Gustaf Lorentzon

An observable canonical form is formulated for the set of rational systems on a variety each of which is a single-input-single-output, affine in the input, and a minimal realization of its response map. The equivalence relation for the…

Optimization and Control · Mathematics 2018-05-07 Jana Nemcova , Jan H. van Schuppen

We consider a large class of matrix problems, which includes the problem of classifying arbitrary systems of linear mappings. For every matrix problem from this class, we construct Belitskii's algorithm for reducing a matrix to a canonical…

Representation Theory · Mathematics 2007-09-18 Vladimir V. Sergeichuk

Left-right and conjugation actions on matrix tuples have received considerable attention in theoretical computer science due to their connections with polynomial identity testing, group isomorphism, and tensor isomorphism. In this paper, we…

Data Structures and Algorithms · Computer Science 2024-09-20 Youming Qiao , Xiaorui Sun

A symmetric positive semi-definite matrix A is called completely positive if there exists a matrix B with nonnegative entries such that A=BB^T. If B is such a matrix with a minimal number p of columns, then p is called the cp-rank of A. In…

Rings and Algebras · Mathematics 2016-04-22 Jan Brandts , Michal Krizek

Using $\mathcal{P}$-canonical forms of matrices, we derive the minimal polynomial of the Kronecker product of a given family of matrices in terms of the minimal polynomials of these matrices. This, allows us to prove that the product…

Rings and Algebras · Mathematics 2021-10-01 Mohammed Mouçouf

Canonical matrices of (a) bilinear and sesquilinear forms, (b) pairs of forms, in which every form is symmetric or skew-symmetric, and (c) pairs of Hermitian forms are given over finite fields of characteristic not 2 and over finite…

Representation Theory · Mathematics 2010-11-16 Vladimir V. Sergeichuk

An interval matrix is a matrix whose entries are intervals in the set of real numbers. We generalize this concept, which has been broadly studied, to other fields. Precisely we define a rational interval matrix to be a matrix whose entries…

Rings and Algebras · Mathematics 2019-04-30 Elena Rubei

Let $L$ be a linear operator on univariate polynomials of bounded degree taking values in real symmetric matrices, whose moment matrix is positive semidefinite. Assume that $L$ admits a positive matrix-valued representing measure $\mu$. Any…

Functional Analysis · Mathematics 2025-11-25 Aljaž Zalar , Igor Zobovič

Let the columns of a $p \times q$ matrix $M$ over any ring be partitioned into $n$ blocks, $M = [M_1, ..., M_n]$. If no $p \times p$ submatrix of $M$ with columns from distinct blocks $M_i$ is invertible, then there is an invertible $p…

Combinatorics · Mathematics 2011-03-09 Stephan Foldes , Erkko Lehtonen

A criterion is given for a type in a finite rank stable theory to be (almost) internal to a given nonmodular minimal type. The motivation comes from results of Campana which give criteria for compact complex analytic spaces to be algebraic…

Logic · Mathematics 2007-05-29 Rahim Moosa , Anand PIllay
‹ Prev 1 2 3 10 Next ›