Related papers: Concerning partition regular matrices
Several natural partial orders on integral partitions, such as the embeddability, the stable embeddability, the bulk embeddability and the supermajorization, raise in the quantum computation, bin-packing and matrix analysis. We find the…
A symmetric $m\times m$ matrix $M$ with entries taken from $\{0,1,\ast\}$ gives rise to a graph partition problem, asking whether a graph can be partitioned into $m$ vertex sets matched to the rows (and corresponding columns) of $M$ such…
A set A of natural numbers is finitely embeddable in another such set B if every finite subset of A has a rightward translate that is a subset of B. This notion of finite embeddability arose in combinatorial number theory, but in this paper…
We investigate the problem asking when any square matrix whose entries lie in a finite field of characteristic 2 is decomposable into the sum of a diagonalizable matrix and a nilpotent matrix with index of nilpotency at most 2 and, as a…
We classify the pairs of conjugate partitions whose regularisations are images of each other under the Mullineux map. This classification proves a conjecture of Lyle, answering a question of Bessenrodt, Olsson and Xu.
Recently, Blecher and Knopfmacher explored the notion of fixed points in integer partitions. Here, we distinguish partitions with a fixed point by which value is fixed and analyze the resulting triangle of integers. In particular, we…
Let $\mathfrak{g}$ be a finite-dimensional simple Lie algebra over an algebraically closed field of characteristic 0. In this paper we classify all regular decompositions of $\mathfrak{g}$ and its irreducible root system $\Delta$. A regular…
Positive semidefinite Hermitian matrices that are not fully specified can be completed provided their underlying graph is chordal. If the matrix is positive definite the completion can be uniquely characterized as the matrix that maximizes…
In this paper we consider the decomposition of positive semidefinite matrices as a sum of rank one matrices. We introduce and investigate the properties of various measures of optimality of such decompositions. For some classes of positive…
The combined matrix is a very useful concept for many applications. Almost strictly sign regular (ASSR) matrices form an important structured class of matrices with two possible zero patterns, which are either type-I staircase or type-II…
In this paper, we consider mixed sums of generalized polygonal numbers. Specifically, we obtain a finiteness condition for universality of such sums; this means that it suffices to check representability of a finite subset of the positive…
We characterize sequences of positive integers $(a_1,a_2,\ldots,a_n)$ for which the $2\times2$ matrix $\left( \begin{array}{cc} a_n&-1 1&0 \end{array} \right) \left( \begin{array}{cc} a_{n-1}&-1 1&0 \end{array} \right) \cdots \left(…
The study of integer partitions and their congruences dates back to 1919 when Ramanujan discovered his famous congruences for the partition function, $p(n)$. Since then, many other kinds of partition functions have been discovered, as well…
Let P be a polygon whose vertices have been colored (labeled) cyclically with the numbers 1,2,...,c. Motivated by conjectures of Propp, we are led to consider partitions of P into k-gons which are proper in the sense that each k-gon…
A coloring of vertices of a graph is called perfect if, for every vertex, the collection of colors of its neighbors depends only on its own color. The correspondent color partition of vertices is called equitable. We note that a number of…
Ferrers graphs and tables of partitions are treated as vectors. Matrix operations are used for simple proofs of identities concerning partitions. Interpreting partitions as vectors gives a possibility to generalize partitions on negative…
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…
In this paper we generalise the notion of linearity (in the sense of Lawvere) to a category C equipped with a compatible sum structure and product structure. In this context, any morphism f from an n-fold sum to an n-fold product has a…
Given a parity-check matrix $H_m$ of a $q$-ary Hamming code, we consider a partition of the columns into two subsets. Then, we consider the two codes that have these submatrices as parity-check matrices. We say that anyone of these two…
Given $d \in \mathbb{N}$, we establish sum-product estimates for finite, non-empty subsets of $\mathbb{R}^d$. This is equivalent to a sum-product result for sets of diagonal matrices. In particular, let $A$ be a finite, non-empty set of $d…