English
Related papers

Related papers: On $k$-idempotent 0-1 matrices

200 papers

A k-magic square of order n is an arrangement of the numbers from 0 to kn-1 in an n by n matrix, such that each row and each column has exactly k filled cells, each number occurs exactly once, and the sum of the entries of any row or any…

Combinatorics · Mathematics 2018-05-01 Abdollah Khodkar , David Leach

A group of matrices $G$ with entries in a number field $K$ is defined to be numerical if $G$ has a finite index subgroup of matrices whose entries are algebraic integers. It is shown that an irreducible or completely reducible subgroup of…

Group Theory · Mathematics 2019-11-27 María Teresa Lozano , José María Montesinos-Amilibia

Fix a field F. A zero-nonzero pattern A is said to be potentially nilpotent over F if there exists a matrix with entries in F with zero-nonzero pattern A that allows nilpotence. In this paper we initiate an investigation into which…

Rings and Algebras · Mathematics 2008-12-03 Kevin N. Vander Meulen , Adam Van Tuyl

Consider $k\ge 2$ distinct, linearly independent, homogeneous linear recurrences of order $k$ satisfying the same recurrence relation. We prove that the recurrences are related to a decomposable form of degree $k$, and there is a very broad…

Number Theory · Mathematics 2023-08-29 Kalman Gyory , Attila Petho , Laszlo Szalay

Let $\mathbb{K}$ be a field such that $char(\mathbb{K})\nmid k$ and $char(\mathbb{K})\nmid k+1$. We describe all $(k+1)$-potent matrices over the group of upper triangular matrix. In the case that $\mathbb{K}$ is a finite field we show how…

Rings and Algebras · Mathematics 2020-09-10 Ivan Gargate , Michael Gargate

Let $D$ be the ring of integers of a quadratic number field $\mathbb{Q}[\sqrt{d}]$. We study the factorizations of $2 \times 2$ matrices over $D$ into idempotent factors. When $d < 0$ there exist singular matrices that do not admit…

Commutative Algebra · Mathematics 2023-12-14 Laura Cossu , Paolo Zanardo

In this paper we find a third order unimodular matrix, none of whose entries is $1$ or $-1$, such that when each entry of the matrix is replaced by its cube, the resulting matrix is also unimodular. Further, we find third order square…

Number Theory · Mathematics 2021-10-26 Ajai Choudhry

An $n$ by $n$ skew-symmetric type $(-1,1)$-matrix $K=[k_{i,j}]$ has $1$'s on the main diagonal and $\pm 1$'s elsewhere with $k_{i,j}=-k_{j,i}$. The largest possible determinant of such a matrix $K$ is an interesting problem. The literature…

Combinatorics · Mathematics 2013-12-02 V. Álvarez , J. A. Armario , M. D. Frau , F. Gudiel

We study algebraic properties of matrices whose rows are mutual neighbours, and are also neigbours of 0 ("neighbour" in the sense of a certain nilpotency condition). The intended application is in synthetic differential geometry. For a…

Rings and Algebras · Mathematics 2007-05-23 Anders Kock

In some matrix formations, factorizations and transformations, we need special matrices with some properties and we wish that such matrices should be easily and simply generated and of integers. In this paper, we propose a zero-sum rule for…

Combinatorics · Mathematics 2021-06-25 Pengwei Hao , Chao Zhang , Huahan Hao

We know that if there are $k$ distinct prime factors of $n \in \mathbb{N}$, then the ring $\mathbb{Z}_n$ of integers modulo $n$ has exactly $2^k$ idempotent elements. In this article, we try to describe all the idempotents of $\mathbb{Z}_n$…

Number Theory · Mathematics 2024-10-21 Suman Mondal , Dhiren Kumar Basnet

We give upper bounds for the determinant of an $n\times n$ zero-one matrix containing $kn$ ones for integral $k$. Our results improve upon a result of Ryser for $k=o(n^{1/3})$. For fixed $k\ge 3$ it was an open question whether Hadamard's…

Combinatorics · Mathematics 2019-03-04 Daniel Scheinerman

The work considers an equivalence relation in the set of all $n\times m$ matrices with entries in the set $[p]=\{ 0,1,\ldots , p-1 \}$. In each element of the factor-set generated by this relation, we define the concept of canonical matrix,…

Combinatorics · Mathematics 2021-08-02 Krasimir Yordzhev

For $n\ge 2$ and fixed $k\ge 1$, we study when a square matrix $A$ over an arbitrary field $\mathbb{F}$ can be decomposed as $T+N$ where $T$ is a torsion matrix and $N$ is a nilpotent matrix with $N^k=0$. For fields of prime characteristic,…

Rings and Algebras · Mathematics 2024-03-25 Peter Danchev , Esther García , Miguel Gómez Lozano

Let $G=(V,E)$ be an undirected graph without loops and multiple edges. A subset $C\subseteq V$ is called \emph{identifying} if for every vertex $x\in V$ the intersection of $C$ and the closed neighbourhood of $x$ is nonempty, and these…

Combinatorics · Mathematics 2009-02-04 Sylvain Gravier , Svante Janson , Tero Laihonen , Sanna Ranto

A 0-1 matrix $M$ is saturating for a 0-1 matrix $P$ if $M$ does not contain a submatrix that can be turned into $P$ by flipping any number of its $1$-entries to $0$-entries, and changing any $0$-entry to $1$-entry of $M$ introduces a copy…

Combinatorics · Mathematics 2022-08-29 Shen-Fu Tsai

Let $\mathbb{F}$ be a field. We show that given any $n$th degree monic polynomial $q(x)\in \mathbb{F}[x]$ and any matrix $A\in\mathbb{M}_n(\mathbb{F})$ whose trace coincides with the trace of $q(x)$ and consisting in its main diagonal of…

Rings and Algebras · Mathematics 2025-07-09 Peter Danchev , Esther García , Miguel Gómez Lozano

We consider a continuous analogue of Babai et al.'s and Cai et al.'s problem of solving multiplicative matrix equations. Given $k+1$ square matrices $A_{1}, \ldots, A_{k}, C$, all of the same dimension, whose entries are real algebraic, we…

Discrete Mathematics · Computer Science 2017-01-18 Joël Ouaknine , Amaury Pouly , João Sousa-Pinto , James Worrell

We give an asymptotic expression for the number of nonsingular integer n-by-n-matrices with primitive row vectors, determinant k, and Euclidean matrix norm less than T, for large T. We also investigate the density of matrices with primitive…

Number Theory · Mathematics 2013-09-03 Samuel Holmin

Let $k\ge2$ be an integer. A natural number $n$ is called $k$-perfect if $\sigma(n)=kn.$ For any integer $r\ge1$ we prove that the number of odd $k$-perfect numbers with at most $r$ distinct prime factors is bounded by $k4^{r^3}$.

Number Theory · Mathematics 2011-02-23 Shi-Chao Chen , Hao Luo