Related papers: Algebraic Boundaries of Convex Semi-algebraic Sets
We characterize conservative median algebras and semilattices by means of forbidden substructures and by providing their representation as chains. Moreover, using a dual equivalence between median algebras and certain topological…
${\cal U}$ntil now the representation (i.e. plotting) of curve in Parallel Coordinates is constructed from the point $\leftrightarrow$ line duality. The result is a ``line-curve'' which is seen as the envelope of it's tangents. Usually this…
Any finite dimensional semisimple algebra A over a field K is isomorphic to a direct sum of finite dimensional full matrix rings over suitable division rings. In this paper we will consider the special case where all division rings are…
We study associative multiplications in semi-simple associative algebras over C compatible with the usual one or, in other words, linear deformations of semi-simple associative algebras over C. It turns out that these deformations are in…
For infinite-dimensional groups $G\supset K$ the double cosets $K\setminus G/K$ quite often admit a structure of a semigroup; these semigroups act in $K$-fixed vectors of unitary representations of $G$. We show that such semigroups can be…
Numerical semigroup rings are investigated from the relative viewpoint. It is known that algebraic properties such as singularities of a numerical semigroup ring are properties of a flat numerical semigroup algebra. In this paper, we show…
We investigate the combinatorial structure of subspaces of the exterior algebra of a finite-dimensional real vector space, working in parallel with the extremal combinatorics of hypergraphs. Using initial monomials, projections of the…
In this paper, we introduce quasi-convex subsets in Alxandrov spaces with lower curvature bound, which include not only all closed convex subsets without boundary but also all extremal subsets. Moreover, we explore several essential…
In this note we explore duality in reverse convex optimization with reverse convex inequality constraints. While we are examining the special case of a finite index set of the inequality constraints, we are primarily interested in the…
We study the structure of the set of algebraic curvature operators satisfying a sectional curvature bound under the light of the emerging field of Convex Algebraic Geometry. More precisely, we determine in which dimensions $n$ this convex…
We study the dependence on various parameters of the exceptional set in Vojta's conjecture. In particular, by making use of certain elliptic surfaces, we answer in the negative the often-raised question of whether Vojta's conjecture holds…
In this paper we introduce and study a topological abelian group of convex bodies, analogous to the scissors congruence group and McMullen's polytope algebra, with the universal property that continuous valuations on convex bodies…
Motivated by conjectures of Demailly, Green-Griffiths, Lang, and Vojta, we show that several notions related to hyperbolicity behave similarly in families. We apply our results to show the persistence of arithmetic hyperbolicity along field…
We give a lower bound for the Gaussian curvature of convex level sets of minimal graphs and the solutions to semilinear elliptic equations with the norm of boundary gradient and the Gaussian curvature of the boundary.
Barycentric algebras are an abstraction of the notion of convex sets, defined by a set of equations. We study semitopological and topological barycentric algebras, in the spirit of a previous study by Klaus Keimel on semitopological and…
We study finite groups that occur as combinatorial automorphism groups or geometric symmetry groups of convex polytopes. When $\Gamma$ is a subgroup of the combinatorial automorphism group of a convex $d$-polytope, $d\geq 3$, then there…
We study the algebraic exceptional set of a three-component curve $B$ with normal crossings on a Hirzebruch surface $\mathbb{F}_e$. If $K_{\mathbb{F}_{e}}+B$ is big and no component of $B$ is a fiber or the rational curve with negative…
Polygons are described as almost-convex if their perimeter differs from the perimeter of their minimum bounding rectangle by twice their `concavity index', $m$. Such polygons are called \emph{$m$-convex} polygons and are characterised by…
We consider the problem of approximating the reachable set of a discrete-time polynomial system from a semialgebraic set of initial conditions under general semialgebraic set constraints. Assuming inclusion in a given simple set like a box…
We prove new bounds on the number of incidences between points and higher degree algebraic curves. The key ingredient is an improved initial bound, which is valid for all fields. Then we apply the polynomial method to obtain global bounds…