Related papers: Geometry of ample/lopsided sets
The absolute sets of local systems on a smooth complex algebraic variety are the subject of a conjecture of N. Budur and B. Wang based on an analogy with special subvarieties of Shimura varieties. An absolute set should be the…
We construct, for any positive integer n, a family of n congruent convex polyhedra in R^3, such that every pair intersects in a common facet. Previously, the largest such family contained only eight polytopes. Our polyhedra are Voronoi…
Given a finite set $E$ and an operator $\sigma:2^{E}\longrightarrow2^{E}$, two sets $X,Y\subseteq E$ are \textit{cospanning} if $\sigma\left( X\right) =\sigma\left( Y\right) $. Corresponding \textit{cospanning equivalence relations} were…
The equidistant set of two nonempty subsets $K$ and $L$ in the Euclidean plane is a set all of whose points have the same distance from $K$ and $L$. Since the classical conics can be also given in this way, equidistant sets can be…
This article introduces a previously unrecognized combinatorial structure underlying configurations of skew lines in $\mathbb{P}^3$, and reveals its deep and surprising connection to the algebro-geometric concept of geproci sets. Given any…
The higher-rank numerical range is a convex compact set generalizing the classical numerical range of a square complex matrix, first appearing in the study of quantum error correction. We will discuss some of the real algebraic and convex…
Faces play a central role in the combinatorial and computational aspects of polyhedra. In this paper, we present the first formalization of faces of polyhedra in the proof assistant Coq. This builds on the formalization of a library…
This paper introduces some inverse sequences of different polyhedra all based on finite approximations of a compact metric space so they can be used to capture the shape type of the original space. It is shown that they are HPol-expansions,…
We examine connections between combinatorial notions that arise in machine learning and topological notions in cubical/simplicial geometry. These connections enable to export results from geometry to machine learning. Our first main result…
We study families of faces for convex semi-algebraic sets via the normal cycle which is a semi-algebraic set similar to the conormal variety in projective duality theory. We propose a convex algebraic notion of a "patch" -- a term recently…
L-convex sets are one of the most fundamental concepts in discrete convex analysis. Furthermore, the Minkowski sum of two L-convex sets, called L2-convex sets, is an intriguing object that is closely related to polymatroid intersection.…
The concept of full points of abstract unitals has been introduced by Korchm\'aros, Siciliano and Sz\H{o}nyi as a tool for the study of projective embeddings of abstract unitals. In this paper we give a more detailed description of the…
In a previous joint work with Aurichi and Magalh\~aes Jr., we showed that the topological spaces arising from the edge-end structure of infinite graphs define a proper subfamily of those obtained through the well-known (vertex-)ends. This…
For a field $\mathbb{F}$ and integers $d, k$ and $\ell$, a set $A \subseteq \mathbb{F}^d$ is called $(k,\ell)$-nearly orthogonal if all vectors in $A$ are non-self-orthogonal and every $k+1$ vectors in $A$ contain $\ell + 1$ pairwise…
Real physical systems with reflective and rotational symmetries such as viruses, fullerenes and quasicrystals have recently been modeled successfully in terms of three-dimensional (affine) Coxeter groups. Motivated by this progress, we…
The notion of "antimatroid with repetition" was conceived by Bjorner, Lovasz and Shor in 1991 as a multiset extension of the notion of antimatroid. When the underlying set consists of only two elements, such two-dimensional antimatroids…
In this paper we develop a theory of convexity for a free Abelian group M (the lattice of integer points), which we call theory of discrete convexity. We characterize those subsets X of the group M that could be call "convex". One property…
Kippenhahn discovered that the numerical range of a complex square matrix is the convex hull of a plane real algebraic curve. Here, we present an example of a convex set, which has a similar algebraic description as the numerical range,…
We apply tropical geometry to study matrix algebras over a field with valuation. Using the shapes of min-max convexity, known as polytropes, we revisit the graduated orders introduced by Plesken and Zassenhaus. These are classified by the…
We introduce the wedge product of two polytopes. The wedge product is described in terms of inequality systems, in terms of vertex coordinates as well as purely combinatorially, from the corresponding data of its constituents. The wedge…