Related papers: Characterization of half-radial matrices
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…
We consider a bipartite version of the color degree matrix problem. A bipartite graph $G(U,V,E)$ is half-regular if all vertices in $U$ have the same degree. We give necessary and sufficient conditions for a bipartite degree matrix (also…
Let $H$ be a numerical semigroup minimally generated by an almost arithmetic sequence. We give a description of a possible row-factorization $(\RF)$ matrix for each pseudo-Frobenius element of $H.$ Further, when $H$ is symmetric and has…
The condition number of solutions to full rank linear least-squares problem are shown to be given by an optimization problem that involves nuclear norms of rank 2 matrices. The condition number is with respect to the least-squares…
Given a generic semidefinite program, specified by matrices with rational entries, each coordinate of its optimal solution is an algebraic number. We study the degree of the minimal polynomials of these algebraic numbers. Geometrically,…
This paper considers metric balls $B(p,R)$ in two dimensional Riemannian manifolds when $R$ is less than half the convexity radius. We prove that $Area(B(p,R)) \geq \frac{8}{\pi}R^2$. This inequality has long been conjectured for $R$ less…
A subset of $\mathbb{F}_q^2$ is called an arc if it does not contain three collinear points. We show that there are at most $\binom{(1 + o(1))q}{m}$ arcs of size $m \gg q^{1/2} (\log q)^{3/2}$, nearly matching a trivial lower bound…
A Graph is called 2-self-centered if its diameter and radius both equal to 2. In this paper, we begin characterizing these graphs by characterizing edge-maximal 2-self-centered graphs via their complements. Then we split characterizing…
This paper is devoted to matrices with hyperbolical Krein space numerical range. This shape characterizes the 2-by-2 case and persists for certain classes of matrices, independently of their size. Ne\-cessary and sufficient conditions for…
One of the great miracles of random matrix theory is that, in the $N \to \infty$ limit, many otherwise intractable matrix problems with horrendously complicated finite-$N$ expressions admit remarkably simple and elegant asymptotic…
We show that the Specht ideal of a two-rowed partition is perfect over an arbitrary field, provided that the characteristic is either zero or bounded below by the size of the second row of the partition, and we show this lower bound is…
The covering radius problem is a question in coding theory concerned with finding the minimum radius $r$ such that, given a code that is a subset of an underlying metric space, balls of radius $r$ over its code words cover the entire metric…
A celebrated theorem of Lind states that a positive real number is equal to the spectral radius of some integral primitive matrix, if and only if, it is a Perron algebraic integer. Given a Perron number $p$, we prove that there is an…
In this paper we consider the H\'enon problem in a ball. We prove the existence of (at least) one branch of nonradial solutions that bifurcate from the radial ones and that this branch is unbounded.
It is shown that a commutative B\'ezout ring $R$ with compact minimal prime spectrum is an elementary divisor ring if and only if so is $R/L$ for each minimal prime ideal $L$. This result is obtained by using the quotient space…
It is known that every closed curve of length \leq 4 in R^n (n>0) can be surrounded by a sphere of radius 1, and that this is the best bound. Letting S denote the circle of circumference 4, with the arc-length metric, we here express this…
A binary code with covering radius $R$ is a subset $C$ of the hypercube $Q_n=\{0,1\}^n$ such that every $x\in Q_n$ is within Hamming distance $R$ of some codeword $c\in C$, where $R$ is as small as possible. For a fixed coordinate…
Consider $\mathcal{H}$ is a complex Hilbert space and $A$ is a positive operator on $\mathcal{H}.$ The mapping $\langle\cdot,\cdot\rangle_A: \mathcal{H}\times \mathcal{H} \to \mathbb {C}$, defined as $\left\langle…
A graph is called $K$-almost regular if its maximum degree is at most $K$ times the minimum degree. Erd\H{o}s and Simonovits showed that for a constant $0< \varepsilon< 1$ and a sufficiently large integer $n$, any $n$-vertex graph with more…
A rational pseudo-rotation $f$ of the torus is a homeomorphism homotopic to the identity with a rotation set consisting of a single vector $v$ of rational coordinates. We give a classification for rational pseudo-rotations with an invariant…