Related papers: On the validity of parametric block correlation ma…
Density matrices of graphs are combinatorial laplacians normalized to have trace one (Braunstein \emph{et al.} \emph{Phys. Rev. A,} \textbf{73}:1, 012320 (2006)). If the vertices of a graph are arranged as an array, then its density matrix…
A symmetric tensor is completely positive (CP) if it is a sum of tensor powers of nonnegative vectors. This paper characterizes completely positive binary tensors. We show that a binary tensor is completely positive if and only if it…
Positive maps applied to a subsystem of a bipartite quantum state constitute a central tool in characterising entanglement. In the multipartite case, however, the direct application of a positive but not completely positive map cannot…
A ring element $\,a\in R\,$ is said to be of {\it right stable range one\/} if, for any $\,t\in R$, $\,aR+tR=R\,$ implies that $\,a+t\,b\,$ is a unit in $\,R\,$ for some $\,b\in R$. Similarly, $\,a\in R\,$ is said to be of {\it left stable…
We prove that if $B$ is a $p$-block with non-trivial defect group $D$ of a finite $p$-solvable group $G$, then $\ell(B) < p^r$, where $r$ is the sectional rank of $D$. We remark that there are infinitely many $p$-blocks $B$ with non-Abelian…
A block graph is a graph in which every block is a complete graph. Let $G$ be a block graph and let $A(G)$ be its (0,1)-adjacency matrix. Graph $G$ is called nonsingular (singular) if $A(G)$ is nonsingular (singular). Characterizing…
We provide a decomposition that is sufficient in showing when a symmetric tridiagonal matrix $A$ is completely positive. Our decomposition can be applied to a wide range of matrices. We give alternate proofs for a number of related results…
Some real functions f induce mean of positive numbers and the matrix monotonicity gives a possibility for means of positive definite matrices. Moreover, such a function f can define linear mapping beta on matrices (which is basic in the…
Our approach to structural matrix rings defines them over preordered directed graphs. A grading of a structural matrix ring is called a good grading if its standard unit matrices are homogeneous. For a group $G$, a $G$ -grading set is a set…
Sylvester's criterion characterizes positive definite (PD) and positive semidefinite (PSD) matrices without the need of eigendecomposition. It states that a symmetric matrix is PD if and only if all of its leading principal minors are…
A group is coherent if all its finitely generated subgroups are finitely presented. In this article we provide a criterion for positively determining the coherence of a group. This criterion is based upon the notion of the perimeter of a…
In this paper we prove, under mild conditions, that the positive definiteness of the circulant matrix appearing in the circulant embedding method is always guaranteed, provided the enclosing cube is sufficiently large. We examine in detail…
In this study, a pairwise comparison matrix is generalized to the case when coefficients create Lie group $G$, non necessarily abelian. A necessary and sufficient criterion for pairwise comparisons matrices to be consistent is provided.…
We give a necessary and sufficient condition for a prime to be an integer group determinant for an arbitrary abelian $p$-group of the form ${\rm C}_{p} \times H$, where ${\rm C}_{p}$ is the cyclic group of order $p$. Also, we show that…
Suppose that $B$ is a Brauer $p$-block of a finite group $G$ with a unique modular character $\varphi$. We prove that $\varphi$ is liftable to an ordinary character of $G$ (which moreover is $p$-rational for odd $p$). This confirms the…
Symbolic regression that aims to detect underlying data-driven models has become increasingly important for industrial data analysis. For most existing algorithms such as genetic programming (GP), the convergence speed might be too slow for…
We consider two algorithms which can be used for proving positivity of sequences that are defined by a linear recurrence equation with polynomial coefficients (P-finite sequences). Both algorithms have in common that while they do succeed…
We prove that whenever the selfmapping $(M_1,\dots,M_p)\colon I^p \to I^p$, ($p \in \mathbb{N}$ and $M_i$-s are $p$-variable means on the interval $I$) is invariant with respect to some continuous and strictly monotone mean $K \colon I^p…
We establish a sharp inequality between the blocks of positive partitioned matrices and conjecture a triangle type inequality for contractions: Given three contactions A,B,C, we conjecture that the constant c=3/4 is sharp in the triangle…
A $n\times n$ matrix $A$ has normal defect one if it is not normal, however can be embedded as a north-western block into a normal matrix of size $(n+1)\times (n+1)$. The latter is called a minimal normal completion of $A$. A construction…