Related papers: Linear maps on nonnegative symmetric matrices pres…
Let $\{\phi_s\}_{s\in S}$ be a commutative semigroup of completely positive, contractive, and weak*-continuous linear maps acting on a von Neumann algebra $N$. Assume there exists a semigroup $\{\alpha_s\}_{s\in S}$ of weak*-continuous…
The spectra of signed matrices have played a fundamental role in social sciences, graph theory, and control theory. In this work, we investigate the computational problems of identifying symmetric signings of matrices with natural spectral…
Let A= (a_{ij}) be a symmetric non-negative integer 2k x 2k matrix. A is homogeneous if a_{ij} + a_{kl}=a_{il} + a_{kj} for any choice of the four indexes. Let A be a homogeneous matrix and let F be a general form in C[x_1, \dots x_n] with…
Let $E$ be an elliptic curve, with identity $O$, and let $C$ be a cyclic subgroup of odd order $N$, over an algebraically closed field $k$ with $\operatorname{char} k \nmid N$. For $P \in C$, let $s_P$ be a rational function with divisor $N…
Fillmore Theorem says that if A is an nxn complex non-scalar matrix and {\gamma}_1,...,{\gamma}_{n} are complex numbers with {\gamma}_1+...+{\gamma}_{n}=trA, then there exists a matrix B similar to A with diagonal entries…
For a field $R$ of characteristic $p\ge 0$ and a matrix $c$ in the full $n\times n$ matrix algebra $M_n(R)$ over $R$, let $S_n(c,R)$ be the centralizer algebra of $c$ in $M_n(R)$. We show that $S_n(c,R)$ is a Frobenius-finite,…
Let G be an undirected graph on n vertices and let S(G) be the set of all real symmetric n x n matrices whose nonzero off-diagonal entries occur in exactly the positions corresponding to the edges of G. The inverse inertia problem for G…
For a given rational number $x$ and an integer $s\geq 1$, let us consider a generalized polylogarithmic function, often called the Lerch function, defined by $$\Phi_{s}(x,z)= \sum_{k=0}^{\infty}\frac{z^{k+1}}{(k+x+1)^s}\enspace.$$ We prove…
A well known upper bound for the independence number $\alpha(G)$ of a graph $G$, due to Cvetkovi\'{c}, is that \begin{equation*} \alpha(G) \le n^0 + \min\{n^+ , n^-\} \end{equation*} where $(n^+, n^0, n^-)$ is the inertia of $G$. We prove…
Let $\mathcal A$ be an $\mathbb F$-algebra and $\omega \in \mathcal A\langle x_1, \ldots, x_m \rangle$ which defines a map $\mathcal A^m \rightarrow \mathcal A$ by evaluation, called a polynomial map with constant. We consider $\mathcal {A}…
Let $n$ be a positive integer and $X = [x_{ij}]_{1 \leq i, j \leq n}$ be an $n \times n$\linebreak \noindent sized matrix of independent random variables having joint uniform distribution $$\hbox{Pr} {x_{ij} = k \hbox{for} 1 \leq k \leq n}…
An independent set in a graph is a set of pairwise non-adjacent vertices, and a(G) is the size of a maximum independent set in the graph G. If s_{k} is the number of independent sets of cardinality k in G, then…
The condition number of a diagonally scaled matrix, for appropriately chosen scaling matrices, is often less than that of the original. Equilibration scales a matrix so that the scaled matrix's row and column norms are equal. Scaling can be…
An independent set in a graph is a set of pairwise non-adjacent vertices. The independence number $\alpha{(G)}$ is the size of a maximum independent set in the graph $G$. The independence polynomial of a graph is the generating function for…
Let $ex(n, P)$ be the maximum possible number of ones in any 0-1 matrix of dimensions $n \times n$ that avoids $P$. Matrix $P$ is called minimally non-linear if $ex(n, P) = \omega(n)$ but $ex(n, P') = O(n)$ for every strict subpattern $P'$…
Let $L_n$ be the free metabelian Leibniz algebra generated by the set $X_n=\{x_1,\ldots,x_n\}$ over a field $K$ of characteristic zero. This is the free algebra of rank $n$ in the variety of solvable of class $2$ Leibniz algebras. We call…
This paper considers matrix convex sets invariant under several types of rotations. It is known that matrix convex sets that are free semialgebraic are solution sets of Linear Matrix Inequalities (LMIs); they are called free spectrahedra.…
We consider the problem of comparison-sorting an $n$-permutation $S$ that avoids some $k$-permutation $\pi$. Chalermsook, Goswami, Kozma, Mehlhorn, and Saranurak prove that when $S$ is sorted by inserting the elements into the GreedyFuture…
Define a $(n^4+n^2)/2\times (n^4+n^2)/2$ symmetric $B$. $(ij)(kl)$ is an index where $i,j,k,l\in [n]$, $(ab)$ is an unordered pair and $(kl)$ is an ordered pair when $i\neq j$, otherwise it is also an unordered pair. $B((ij)(kl),(ab)(xy))$…
Let $H_n =\sum\limits_{k=1}^n \frac{1}{k}$ be the $n$-th harmonic number. Euler extended it to complex arguments and defined $H_r$ for any complex number $r$ except for the negative integers. In this paper, we give a new proof of the…