Related papers: On a theorem by Kippenhahn

A conjecture by Rafla from 1988 asserts that every simple drawing of the complete graph $K_n$ admits a plane Hamiltonian cycle. It turned out that already the existence of much simpler non-crossing substructures in such drawings is hard to…

The numerical range of a matrix is studied geometrically via the cone of positive semidefinite matrices (or semidefinite cone for short). In particular it is shown that the feasible set of a two-dimensional linear matrix inequality (LMI),…

The numerical range of a matrix is studied geometrically via the cone of positive semidefinite matrices (or semidefinite cone for short). In particular it is shown that the feasible set of a two-dimensional linear matrix inequality (LMI),…

For every integer $k\geq 2$ and every $R>1$ one can find a dimension $n$ and construct a symmetric convex body $K\subset\mathbb{R}^n$ with $\text{diam}\,Q_{k-1}(K)\geq R\cdot\text{diam}\,Q_k(K)$, where $Q_k(K)$ denotes the $k$-convex hull…

The paper studies the harmonic maps on a direction between a Riemannian space and a generalized Lagrange space. Also, it is proved there that the solutions of C^2 class of certain ODEs or PDEs are harmonic maps, in the sense of this paper.

In this note we examine the volume of the convex hull of two congruent copies of a convex body in Euclidean $n$-space, under some subsets of the isometry group of the space. We prove inequalities for this volume if the two bodies are…

A Lie algebra structure on variation vector fields along an immersed curve in a $2$-dimensional real space form is investigated. This Lie algebra particularized to plane curves is the cornerstone in order to define a Hamiltonian structure…

The Hahn-Banach theorem states that onto each line in every normed space, there is a unitary projection, and Kadec and Snobar proved (using John's ellipsoid) that onto each $n$-dimensional subspace of any real normed space, there is a…

We study properties of convex hulls of (co)adjoint orbits of compact groups, with applications to invariant theory and tensor product decompositions. The notion of partial convex hulls is introduced and applied to define two numerical…

Membranes holomorphically embedded in flat noncompact space are constructed in terms of the degrees of freedom of an infinite collection of 0-branes. To each holomorphic curve we associate infinite-dimensional matrices which are static…

We present an elementary proof of the cross theorem in the case of Reinhardt domains. The results illustrates the well-known interrelations between the holomorphic geometry of a Reinhardt domain and the convex geometry of its logarithmic…

We prove an infinite-dimensional generalization of Zenger's lemma that was used in the proof of the fact that the convex hull of the point spectrum of a linear operator is contained in its numerical range. Two relevant examples are given,…

The Halphen transform of a plane curve is the curve obtained by intersecting the tangent lines of the curve with the corresponding polar lines with respect to some conic. This transform has been introduced by Halphen as a branch…

Reciprocal matrices are tridiagonal matrices $(a_{ij})_{i,j=1}^n$ with constant main diagonal and such that $a_{i,i+1}a_{i+1,i}=1$ for $i=1,\ldots,n-1$. For these matrices, criteria are established under which their Kippenhahn curves…

Let $K$ be a number field and $O_K$ the ring of integers of $K$. In the spirit of Siegel's theorem on integral points on affine algebraic curves, the plane Jacobian conjecture over $K$ is equivalent to the following statement: if $P,Q\in…

Let C be a real nonsingular affine curve of genus one, embedded in affine n-space, whose set of real points is compact. For any polynomial f which is nonnegative on C(R), we prove that there exist polynomials f_i with f \equiv \sum_i f_i^2…

We present a novel technical method for analyzing the hidden convex structure embedded in the joint range of a quadratic mapping defined on a Hilbert space. Our approach stands out by relying exclusively on elementary mathematical…

We study the following range searching problem: Preprocess a set $P$ of $n$ points in the plane with respect to a set $\mathcal{O}$ of $k$ orientations % , for a constant, in the plane so that given an $\mathcal{O}$-oriented convex polygon…

Convex hulls are a fundamental geometric tool used in a number of algorithms. As a side-effect of exhaustive tests for an algorithm for which a convex hull computation was the first step, interesting experimental results were found and are…

Plank problems concern the covering of convex bodies by planks in Euclidean space and are related to famous open problems in convex geometry. In this survey, we introduce plank problems and present surprising applications of plank theorems…