Related papers: On LP-orientations of cubes and crosspolytopes
We study polar orbitopes, i.e. convex hulls of orbits of a polar representation of a compact Lie group. The face structure is studied by means of the gradient momentum map and it is shown that every face is exposed and is again a polar…
We obtain a necessary and sufficient condition on a polynomial $P(t_1,t_2)$ for the $\ell^{p}$ boundedness of the discrete double Hilbert transforms associated with $P(t)$ for $1 < p < \infty$. The proof is based on the multi-parameter…
We prove that deciding whether the edge set of a graph can be partitionned into two spanning trees with orientation constraints is NP-complete. If P $\neq$ NP then this disproves a conjecture of Recski.
We prove that the separating curve graph of a connected, compact, orientable surface with genus at least 3 and a single boundary component is not relatively hyperbolic. This completes the classification of when the separating curve graph is…
A number of techniques in Lorentzian geometry, such as those used in the proofs of singularity theorems, depend on certain smooth coverings retaining interesting global geometric properties, including causal ones. In this note we give…
We give two examples which show that rational nef and anti-nef polytopes are not uniform even for klt surface pairs, answering a question of Chen-Han. We also show that rational nef polytopes are uniform when the Cartier indices are…
Graphons $W$ can be used as stochastic models to sample graphs $G_n$ on $n$ nodes for $n$ arbitrarily large. A graphon $W$ is said to have the $H$-property if $G_n$ admits a decomposition into disjoint cycles with probability one as $n$…
We investigate necessary conditions for the existence of projections of polytopes that preserve full k-skeleta. More precisely, given the combinatorics of a polytope and the dimension e of the target space, what are obstructions to the…
A Hamiltonian embedding is an embedding of a graph $G$ such that the boundary of each face is a Hamiltonian cycle of $G$. It is shown that the hypercube graph $Q_n$ admits such an embedding on an orientable surface when $n$ is a power of 2.…
Given a unit vector $\textbf{v}\in\mathbb{R}^3$ and $\lambda\in\mathbb{R}$, a translating $\lambda$-soliton is a surface in $\mathbb{R}^3$ whose mean curvature $H$ satisfies $H=\langle N,\textbf{v}\rangle+\lambda,\ |\textbf{v}|=1$, where…
In a recent paper Y. Hu has given a sufficient condition for the fundamental group of the r-th cyclic branched covering of S^3 along a prime knot to be left-orderable in terms of representations of the knot group. Applying her criterion to…
Physical transformations are described by linear maps that are completely positive and trace preserving (CPTP). However, maps that are positive (P) but not completely positive (CP) are instrumental to derive separability/entanglement…
In this note we show that the crucial orientation condition for commutative geometries fails for the natural spectral triple of an orbifold M/G.
Set operations are well understood for convex sets but become considerably more challenging in the non-convex case due to the loss of structural properties in their representation. Constrained polynomial zonotopes (CPZs) offer an effective…
The polytope containment problem is deciding whether a polytope is a contained within another polytope. This problem is rooted in computational convexity, and arises in applications such as verification and control of dynamical systems. The…
In this paper, we first prove that the totally real discs lying in certain Levi flat hypersurfaces are polynomially convex. As applications we prove that the totally real discs lying in the boundary of certain polynomial polyhedra are…
In this paper we give necessary and sufficient conditions for a knot type to admit non-loose Legendrian and transverse representatives in some overtwisted contact structure, classify all non-loose rational unknots in lens spaces, and…
We present necessary and sufficient conditions to have global hypoellipticity for a class of complex-valued coefficient first order evolution equations defined on $\mathbb{T}^1 \times G$, where $G$ is a compact Lie group. First, we show…
Finite smooth digraphs, that is, finite directed graphs without sources and sinks, can be partially ordered via pp-constructability. We give a complete description of this poset and, in particular, we prove that it is a distributive…
We consider, for complete bipartite graphs, the convex hulls of characteristic vectors of all matchings, extended by a binary entry indicating whether the matching contains two specific edges. These polytopes are associated to the quadratic…