Related papers: Extension complexity and realization spaces of hyp…
We give a combinatorial formula for the Ehrhart $h^*$-vector of the hypersimplex. In particular, we show that $h^{*}_{d}(\Delta_{k,n})$ is the number of hypersimplicial decorated ordered set partitions of type $(k,n)$ with winding number…
On a complex manifold $(M,J)$, we interpret complex symplectic and pseudo-K\"ahler structures as symplectic forms with respect to which $J$ is, respectively, symmetric and skew-symmetric. We classify complex symplectic structures on…
The complexity of a homogeneous space $G/H$ under a reductive group $G$ is by definition the codimension of generic orbits in $G/H$ of a Borel subgroup $B\subseteq G$. We give a representation-theoretic interpretation of this number as the…
We study smooth projective varieties with small dual variety using methods from symplectic topology. We prove the affine parts of such varieties are subcritical, and that the hyperplane class is invertible in their quantum cohomology. We…
We give a simple interpretation of the adapted complex structure of Lempert-Szoke and Guillemin-Stenzel: it is given by a polar decomposition of the complexified manifold. We then give a twistorial construction of an SO(3)-invariant…
We give a formula in terms of multidimensional resultants for an equation for the flex locus of a projective hypersurface, generalizing a classical result of Salmon for surfaces. Using this formula, we compute the dimension of this flex…
This is a survey on tropical polytopes from the combinatorial point of view and with a focus on algorithms. Tropical convexity is interesting because it relates a number of combinatorial concepts including ordinary convexity, monomial…
Consider the regular $n$-simplex $\Delta_n$ - it is formed by the convex-hull of $n+1$ points in Euclidean space, with each pair of points being in distance exactly one from each other. We prove an exact bound on the width of $\Delta_n$…
We survey known results about the complexity of surjective homomorphism problems, studied in the context of related problems in the literature such as list homomorphism, retraction and compaction. In comparison with these problems,…
This monograph presents a detailed analysis of hypercomplex numbers in 2, 3 and 4 dimensions, then presents the properties of hypercomplex numbers in 5 and 6 dimensions. It continues with a detailed analysis of hypercomplex numbers in n…
For a fixed $k\in\{1,\dots,d\}$ consider random vectors $X_0,\dots, X_{k}\in\mathbb R^d$ with an arbitrary spherically symmetric joint density function. Let $A$ be any non-singular $d\times d$ matrix. We show that the $k$-dimensional volume…
We prove inequalities relating the absolute value of the determinant of n+1 linearly independent unit vectors in an n+1 dimensional complex vector space and the projective distances from the vertices to the hyperplanes containing the…
Number Decision Diagrams (NDD) provide a natural finite symbolic representation for regular set of integer vectors encoded as strings of digit vectors (least or most significant digit first). The convex hull of the set of vectors…
Convex neural codes are combinatorial structures describing the intersection pattern of a collection of convex sets. Inductively pierced codes are a particularly nice subclass of neural codes introduced in the information visualization…
For any nonempty, compact and fiberwise convex set $K$ in $T^*\mathbb{R}^n$, we prove an isomorphism between symplectic homology of $K$ and a certain relative homology of loop spaces of $\mathbb{R}^n$. We also prove a formula which computes…
The convex hull of n+1 affinely independent vertices of the unit n-cube Cn is called a 0/1-simplex. It is nonobtuse if none its dihedral angles is obtuse, and acute if additionally none of them is right. In terms of linear algebra, acute…
We study approximations of polytopes in the standard model for computing polytopes using Minkowski sums and (convex hulls of) unions. Specifically, we study the ability to approximate a target polytope by polytopes of a given depth. Our…
For a finite separable field extension K/k, all subfields can be obtained by intersecting so-called principal subfields of K/k. In this work we present a way to quickly compute these intersections. If the number of subfields is high, then…
The tropical convex hull of a finite set of points in tropical projective space has a natural structure of a cellular free resolution. Therefore, methods from computational commutative algebra can be used to compute tropical convex hulls.…
Composite minimization involves a collection of smooth functions which are aggregated in a nonsmooth manner. In the convex setting, we design an algorithm by linearizing each smooth component in accordance with its main curvature. The…