Related papers: Characterization of half-radial matrices

We show that there is a query expressible in first-order logic over the reals that returns, on any given semi-algebraic set A, for every point a radius around which A is conical. We obtain this result by combining famous results from…

A vertex subset S of a graph G is said to 2-dominate the graph if each vertex not in S has at least two neighbors in it. As usual, the associated parameter is the minimum cardinal of a 2-dominating set, which is called the 2-domination…

Let $A$ be a positive bounded linear operator acting on a complex Hilbert space $\big(\mathcal{H}, \langle \cdot\mid \cdot\rangle \big)$. Let $\omega_A(T)$ and ${\|T\|}_A$ denote the $A$-numerical radius and the $A$-operator seminorm of an…

A sufficient condition for $\bar{\partial}$ to have closed range is given for pseudoconvex, possibly unbounded domains in $\mathbb{C}^n$.

The induced Ramsey number $R_{\mathrm{ind}}(H; r)$ of a graph $H$ is the minimum number $N$ such that there exists a graph with $N$ vertices for which all $r$-colourings of its edges contain a monochromatic induced copy of $H$. Our main…

The nonnegative rank of an entrywise nonnegative matrix A of size mxn is the smallest integer r such that A can be written as A=UV where U is mxr and V is rxn and U and V are both nonnegative. The nonnegative rank arises in different areas…

The smallest $r$ so that a metric $r$-ball covers a metric space $M$ is called the radius of $M$. The volume of a metric $r$-ball in the space form of constant curvature $k$ is an upper bound for the volume of any Riemannian manifold with…

Let $A$ be a positive (semidefinite) bounded linear operator acting on a complex Hilbert space $\big(\mathcal{H}, \langle \cdot\mid \cdot\rangle \big)$. The semi-inner product ${\langle x\mid y\rangle}_A := \langle Ax\mid y\rangle$, $x,…

Let $S$ be a commutative noetherian ring. The extensions of matrix factorizations of non-zerodivisors $x_1,\dots,x_n$ of $S$ form a full subcategory of finitely generated modules over the quotient ring $S/(x_1\cdots x_n)$. In this paper, we…

Let $v(x)$ be the numerical radius of an element $x$ in a $C^*$-algebra $\mathfrak{A}$. First, we prove several numerical radius inequalities in $\mathfrak{A}$. Particularly, we present a refinement of the triangle inequality for the…

Let $R$ be an order in an algebraic number field. If $R$ is a principal order, then many explicit results on its arithmetic are available. Among others, $R$ is half-factorial if and only if the class group of $R$ has at most two elements.…

It is known that semi-magic square matrices form a 2-graded algebra or superalgebra with the even and odd subspaces under centre-point reflection symmetry as the two components. We show that other symmetries which have been studied for…

We consider the problem of minimizing a polynomial function over the integer lattice. Though impossible in general, we use a known sufficient condition for the existence of continuous minimizers to guarantee the existence of integer…

We consider the set E of curves with positive algebraic curvature, whose extremities and tangents in their extremities are given. For each of the curves of E, we define the minimum of the radius of curvature. We first prove that there…

The set of minimal primes of a ring is a very important set as far the spectrum of a ring is concerned as every prime contains a minimal prime. So, knowing the minimal primes is the first (important and difficult) step in describing the…

Correlation matrices (positive semidefinite matrices with ones on the diagonal) are of fundamental interest in quantum information theory. In this work we introduce and study the set of $r$-decomposable correlation matrices: those that can…

The $R$-hulloid, in the Euclidean space $\mathbb{R}^3$, of the set of vertices $V$ of a tetrahedron $T$ is the minimal closed set containing $V$ such that its complement is the union of open balls of radius $R$. When $R$ is greater than the…

Baker and Rumely's tau lower bound conjecture claims that if the tau constant of a metrized graph is divided by its total length, this ratio must be bounded below by a positive constant for all metrized graphs. We construct several families…

Since the transformative workshop by the American Institute of Mathematics on the minimum rank of a graph, two longstanding open problems have captivated the community interested in the minimum rank of graphs: the graph complement…

Let $P$ be a polytope defined by the system $A x \leq b$, where $A \in R^{m \times n}$, $b \in R^m$, and $\text{rank}(A) = n$. We give a short geometric proof of the following tight upper bound on the number of vertices of $P$: $$ n! \cdot…