Related papers: Partial smoothness of the numerical radius at matr…
Sections of line bundles on 2 dimensional surfaces in 3 dimensional space can have many distinct shapes. For practical purposes we prefer smooth sections that are visibly easy to follow. This is why smoothing operators have been developed…
We consider the class of polynomial optimization problems $\inf \{f(x):x\in K\}$ for which the quadratic module generated by the polynomials that define $K$ and the polynomial $c-f$ (for some scalar $c$) is Archimedean. For such problems,…
Polynomial factorization in conventional sense is an ill-posed problem due to its discontinuity with respect to coefficient perturbations, making it a challenge for numerical computation using empirical data. As a regularization, this paper…
It has been shown that if $T$ is a complex matrix, then {\small\begin{align*} \omega(T)&=\frac{1}{n}\sup\left\{|\mathrm{Tr}\ X|;\ X\in W^n(T)\right\}\\ &=\frac{1}{n}\sup\left\{\|X\|_1;\ X\in W^n(T)\right\}\\ &= \sup\left\{ \omega(X);\ X\in…
We construct and study the space C(\R^d,n) of all partitions of \R^d into n non-empty open convex regions (n-partitions). A representation on the upper hemisphere of an n-sphere is used to obtain a metric and thus a topology on this space.…
We show that the nonzero roots of the torsion polynomials associated to the infinite cyclic covers of a given compact, connected, orientable 3-manifold M are contained in a compact part of the complex plane a priori determined by M. This…
Let $\mathcal{A}$ be the class of all analytic functions $f$ defined on the open unit disk $\mathbb{D}$ with the normalization $f(0)=0=f^{\prime}(0)-1$. This paper examines the radius of concavity for various subclasses of $\mathcal{A}$,…
We improve a bound due to the second author on number of rational points on smooth surfaces in $\mathbb{P}^3$ over finite fields and look at families of surfaces that achieve or nearly achieve this bound, for which we compute their exact…
A zero-dimensional polynomial ideal may have a lot of complex zeros. But sometimes, only some of them are needed. In this paper, for a zero-dimensional ideal $I$, we study its complex zeros that locate in another variety $\textbf{V}(J)$…
It is well known that many problems in interval computation are intractable, which restricts our attempts to solve large problems in reasonable time. This does not mean, however, that all problems are computationally hard. Identifying…
We state and give self contained proofs of semidefinite programming characterizations of the numerical radius and its dual norm for matrices. We show that the computation of the numerical radius and its dual norm within $\varepsilon$…
We study the differential structure of the set of real logarithms of a non-singular real matrix, under the assumption that the matrix is either semi-simple or orthogonal.
Rotation Averaging is a non-convex optimization problem that determines orientations of a collection of cameras from their images of a 3D scene. The problem has been studied using a variety of distances and robustifiers. The intrinsic (or…
Polytopes are the basic finite data structures for convex sets: they appear as feasible regions in linear optimization, as geometric summaries in algorithms, and as random objects in stochastic geometry. A natural geometric question is…
Solutions of partial differential equations can often be written as surface integrals having a kernel related to a singular fundamental solution. Special methods are needed to evaluate the integral accurately at points on or near the…
We consider linear optimization over a fixed compact convex feasible region that is semi-algebraic (or, more generally, "tame"). Generically, we prove that the optimal solution is unique and lies on a unique manifold, around which the…
In this paper, we investigate the generalized numerical radius $\omega_N$, associated with a matrix norm $N$ defined by $\omega_N(X) = \sup_{\theta \in \mathbb{R}} N(\operatorname{Re}(e^{i\theta}X))$. We focus on matrices whose numerical…
The paper deals with cubic 1-variable polynomials whose Julia sets are connected. Fixing a bounded type rotation number, we obtain a slice of such polynomials with the origin being a fixed Siegel point of the specified rotation number. Such…
Algebraic lattices are those obtained from modules in the ring of integers of algebraic number fields through the canonical or twisted embeddings. In turn, well-rounded lattices are those with maximal cardinality of linearly independent…
This paper is the second in a series where we attempt to give a complete description of the space of all embedded minimal surfaces of fixed genus in a fixed (but arbitrary) closed 3-manifold. The key for understanding such surfaces is to…