Related papers: Column-partitioned matrices over rings without inv…

Patterns on numerical semigroups are multivariate linear polynomials, and they are said to be admissible if there exists a numerical semigroup such that evaluated at any nonincreasing sequence of elements of the semigroup gives integers…

Given a block triangular matrix $M$ over a noncommutative ring with invertible diagonal blocks, this work gives two new representations of its inverse $M^{-1}$. Each block element of $M^{-1}$ is explicitly expressed via a quasideterminant…

We examine the structure of the partition algebra $P_n(\delta)$ over a field $k$ of characteristic $p>0$. In particular, we describe the decomposition matrix of $P_n(\delta)$ when $n<p$ and when $n=p$ and $\delta=p-1$.

Algebras generated by strictly positive matrices are described up to similarity, including the commutative, simple, and semisimple cases. We provide sufficient conditions for some block diagonal matrix algebras to be generated by a set of…

Associating to each pre-order on the indices 1,...,n the corresponding structural matrix ring, or incidence algebra, embeds the lattice of n-element pre-orders into the lattice of n x n matrix rings. Rings within the order-convex hull of…

A quadrilateral of factors is an irreducible inclusion of factors $N \subset M$ with intermediate subfactors $P$ and $Q$ such that $P$ and $Q$ generate $M$ and the intersection of $P$ and $Q$ is $N$. We investigate the structure of a…

We prove that over a commutative semiring every symmetric strongly invertible matrix with nonnegative numerical range has a Cholesky decomposition.

We show several ways to round a real matrix to an integer one such that the rounding errors in all rows and columns as well as the whole matrix are less than one. This is a classical problem with applications in many fields, in particular,…

Using an adaptation of Qin Jiushao's method from the 13th century, it is possible to prove that a system of linear modular equations a(i,1) x(i) + ... + a(i,n) x(n) = b(i) mod m(i), i=1, ..., n has integer solutions if m(i)>1 are pairwise…

The main results of this paper are twofold: the first one is a matrix theoretical result. We say that a matriz is superregular if all of its minors that are not trivially zero are nonzero. Given a a times b, a larger than or equal to b,…

Let $W_{k,n}^{i}(m)$ denote a matrix with rows and columns indexed by the $k$-subsets and $n$-subsets, respectively, of an $m$-element set. The row $S$, column $T$ entry of $W_{k,n}^{i}(m)$ is $1$ if $|S \cap T| = i$, and is $0$ otherwise.…

Let K be an algebraic number field of degree d and discriminant D over Q. Let A be an associative algebra over K given by structure constants such that A is isomorphic to the algebra M_n(K) of n by n matrices over K for some positive…

We give sufficient conditions on a matrix A ensuring the existence of a partition of this matrix into two submatrices with extremely small norm of the image of any vector. Under some weak conditions on a matrix A we obtain a partition of A…

In Pacific J. Math. 292 (2018), 223-238, Shareshian and Woodroofe asked if for every positive integer $n$ there exist primes $p$ and $q$ such that, for all integers $k$ with $1 \leq k \leq n-1$, the binomial coefficient $\binom{n}{k}$ is…

We show any matrix of rank $r$ over $\mathbb{F}_q$ can have $\leq \binom{r}{k}(q-1)^k$ distinct columns of weight $k$ if $ k \leq O_q(\sqrt{\log r})$ (up to divisibility issues), and $\leq \binom{r}{k}(q-1)^{r-k}$ distinct columns of…

We consider the problem of finding the number of matrices over a finite field with a certain rank and with support that avoids a subset of the entries. These matrices are a q-analogue of permutations with restricted positions (i.e., rook…

Let $R$ be a commutative ring with identity and a fixed invertible element $q^{\frac{1}{2}}$, and suppose $q+q^{-1}$ is invertible in $R$. For each planar surface $\Sigma_{0,n+1}$, we present its Kauffman bracket skein algebra over $R$ by…

We show that a square-tiling of a $p\times q$ rectangle, where $p$ and $q$ are relatively prime integers, has at least $\log_2p$ squares. If $q>p$ we construct a square-tiling with less than $q/p+C\log p$ squares of integer size, for some…

Partitioning a set into similar, if not, identical, parts is a fundamental research topic in combinatorics. The question of partitioning the integers in various ways has been considered throughout history. Given a set $\{x_1, \ldots, x_n\}$…

Given an ordered triple of positive integers $(n,r,b)$, where $1\leq b\leq\binom{n}{r}$, does there exist a matrix of size $r\times n$ with exactly $b$ invertible submatrices of size $r\times r$? Such a matrix is called an $(n,r,b)$-matrix.…