English
Related papers

Related papers: Canonical matrices with entries integers modulo p

200 papers

Let X be a finite set and let k be a commutative ring. We consider the k-algebra of the monoid of all relations on X, modulo the ideal generated by the relations factorizing through a set of cardinality strictly smaller than Card(X), called…

Representation Theory · Mathematics 2013-10-30 Serge Bouc , Jacques Thévenaz

For a nonsingular integer matrix A, we study the growth of the order of A modulo N. We say that a matrix is exceptional if it is diagonalizable, and a power of the matrix has all eigenvalues equal to powers of a single rational integer, or…

Number Theory · Mathematics 2009-11-10 Pietro Corvaja , Zeev Rudnick , Umberto Zannier

We classify irreducible unitary representations of the group of all infinite matrices over a $p$-adic field ($p\ne 2$) with integer elements equipped with a natural topology. Any irreducible representation passes through a group $GL$ of…

Representation Theory · Mathematics 2021-08-24 Yury A. Neretin

In this survey paper we study parametric versions of writing a matrix in $SL_n (\mathbb{C})$ as a product of lower and upper unitriangular matrices in interchanging order as well as generalizations to other classical groups. We give an…

Complex Variables · Mathematics 2026-01-06 Gaofeng Huang , Frank Kutzschebauch

We define a notion of grading of a monoid T in a monoidal category C, relative to a class of morphisms M (which provide a notion of M-subobject). We show that, under reasonable conditions (including that M forms a factorization system),…

Logic in Computer Science · Computer Science 2023-08-01 Flavien Breuvart , Dylan McDermott , Tarmo Uustalu

The work considers the set $\Lambda_n^k$ of all $n\times n$ binary matrices having the same number of $k$ units in each row and each column. The article specifically focuses on the matrices whose rows and columns are sorted…

Combinatorics · Mathematics 2026-03-02 Krasimir Yordzhev

We study the computation of canonical bases of sets of univariate relations $(p_1,\ldots,p_m) \in \mathbb{K}[x]^{m}$ such that $p_1 f_1 + \cdots + p_m f_m = 0$; here, the input elements $f_1,\ldots,f_m$ are from a quotient…

Symbolic Computation · Computer Science 2017-05-31 Vincent Neiger , Thi Xuan Vu

A real symmetric matrix $M$ is completely positive semidefinite if it admits a Gram representation by (Hermitian) positive semidefinite matrices of any size $d$. The smallest such $d$ is called the (complex) completely positive semidefinite…

Optimization and Control · Mathematics 2016-10-27 Sander Gribling , David de Laat , Monique Laurent

Let $L$ be a linear operator on univariate polynomials of bounded degree, mapping into real symmetric matrices, such that its moment matrix is positive definite. It is known that $L$ admits a finitely atomic positive matrix-valued…

Functional Analysis · Mathematics 2025-09-01 Aljaž Zalar , Igor Zobovič

We study the problem of low-rank matrix completion for symmetric matrices. The minimum rank of a completion of a generic partially specified symmetric matrix depends only on the location of the specified entries, and not their values, if…

Combinatorics · Mathematics 2020-10-16 Daniel Irving Bernstein , Grigoriy Blekherman , Kisun Lee

A lonesum matrix is a $(0,1)$-matrix that is uniquely determined by its row and column sum vectors. In this paper, we introduce lonesum decomposable matrices and study their properties. We provide a necessary and sufficient condition for a…

Combinatorics · Mathematics 2017-01-26 Ken Kamano

This paper considers a restriction to non-negative matrix factorization in which at least one matrix factor is stochastic. That is, the elements of the matrix factors are non-negative and the columns of one matrix factor sum to 1. This…

Machine Learning · Statistics 2016-09-20 Christopher Adams

Let $M_n$ be an $n\times n$ random matrix with i.i.d. Bernoulli(p) entries. We show that there is a universal constant $C\geq 1$ such that, whenever $p$ and $n$ satisfy $C\log n/n\leq p\leq C^{-1}$, \begin{align*} {\mathbb…

Probability · Mathematics 2020-04-08 Alexander E. Litvak , Konstantin E. Tikhomirov

The concepts of differentiation and integration for matrices are known. As far as each matrix is differentiable, it is not clear a priori whether a given matrix is integrable or not. Recently some progress was obtained for diagonalizable…

Combinatorics · Mathematics 2023-09-08 Suren Danielyan , Alexander Guterman , Elena Kreines , Fedor Pakovich

We consider the set $\mathcal{M}_n(\mathbb Z; H)$ of $n\times n$-matrices with integer elements of size at most $H$ and obtain a new upper bound on the number of matrices from $\mathcal{M}_n(\mathbb Z; H)$ with a given characteristic…

Number Theory · Mathematics 2024-09-05 Philipp Habegger , Alina Ostafe , Igor E. Shparlinski

It has been known that there exists a canonical system for every finite real reflection group. The first and the third authors obtained an explicit formula for a canonical system in the previous paper. In this article, we first define…

Commutative Algebra · Mathematics 2019-08-15 Norihiro Nakashima , Hiroaki Terao , Shuhei Tsujie

We consider the problem of exact low-rank matrix completion from a geometric viewpoint: given a partially filled matrix M, we keep the positions of specified and unspecified entries fixed, and study how the minimal completion rank depends…

Statistics Theory · Mathematics 2019-09-24 Daniel Irving Bernstein , Grigoriy Blekherman , Rainer Sinn

The equivalence group is determined for systems of linear ordinary differential equations in both the standard form and the normal form. It is then shown that the normal form of linear systems reducible by an invertible point transformation…

Classical Analysis and ODEs · Mathematics 2015-02-26 JC Ndogmo

We investigate the canonical forms of positive partial transposition (PPT) density matrices in ${\cal C}^2 \otimes {\cal C}^M \otimes {\cal C}^N$ composite quantum systems with rank $N$. A general expression for these PPT states are…

Quantum Physics · Physics 2007-05-23 X. H. Wang , S. M. Fei , Z. X. Wang , K. Wu

Two matrices are said to be principal minor equivalent if they have equal corresponding principal minors of all orders. We give a characterization of principal minor equivalence and a deterministic polynomial time algorithm to check if two…

Computational Complexity · Computer Science 2024-10-04 Abhranil Chatterjee , Sumanta Ghosh , Rohit Gurjar , Roshan Raj