Related papers: Unconditional reflexive polytopes
For any given finite group, Schulte and Williams (2015) establish the existence of a convex polytope whose combinatorial automorphisms form a group isomorphic to the given group. We provide here a shorter proof for a stronger result: the…
We settle the Hadwiger-Boltyanski Illumination Conjecture for all 1-unconditional convex bodies in ${\mathbb R}^3$ and in ${\mathbb R}^4$. Moreover, we settle the conjecture for those higher-dimensional 1-unconditional convex bodies which…
In this article, we study the automorphism group of the cyclic orbifold of a vertex operator algebra associated with a rootless even lattice for a lift of a fixed-point free isometry of odd prime order $p$. We prove that such a cyclic…
This is both an expository and research paper where we advocate a systematic study of continuous analogues of finite partially ordered sets, convex polytopes, oriented matroids, arrangements of subspaces, finite simplicial complexes, and…
The set of all perfect matchings of a plane (weakly) elementary bipartite graph equipped with a partial order is a poset, moreover the poset is a finite distributive lattice and its Hasse diagram is isomorphic to $Z$-transformation directed…
A Coxeter polytope is a convex polytope in a real projective space equipped with linear reflections in its facets, such that the orbits of the polytope under the action of the group generated by the linear reflections tessellate a convex…
In this paper we address the graph matching problem. Following the recent works of \cite{zaslavskiy2009path,Vestner2017} we analyze and generalize the idea of concave relaxations. We introduce the concepts of conditionally concave and…
We show that smooth and strongly convex bodies in the symplectic $\mathbb R^{2n}$ for $n>1$ with all characteristics planar, or all outer billiard trajectories planar are affine symplectic images of balls.
We prove that weakly unconditionally Cauchy (w.u.C.) series and unconditionally converging (u.c.) series are preserved under the action of polynomials or holomorphic functions on Banach spaces, with natural restrictions in the latter case.…
We characterize the polytopes in $\mathbb{R}^d$ (not necessarily convex or connected ones) which multi-tile the space by translations along a given lattice. We also give a necessary and sufficient condition for two polytopes in…
We present equivalent conditions for a space $X$ with an unconditional basis to admit an equivalent norm with a strictly convex dual norm.
We give necessary and sufficient conditions for an integral polynomial without linear factors to be the characteristic polynomial of an isometry of some even, unimodular lattice of given signature. This gives rise to Hasse principle…
We provide a characterization of the compressed lattice polytopes in terms of their facet defining inequalities and we show that every compressed lattice polytope is affinely isomorphic to a 0/1-polytope. As an application, we characterize…
The perfect matching complex of a simple graph $G$ is a simplicial complex having facets (maximal faces) as the perfect matchings of $G$. This article discusses the perfect matching complex of polygonal line tilings and the $\left(2 \times…
A reflexive Banach space with an unconditional basis admits an equivalent $1$-unconditional $2R$ norm and embeds into a reflexive space with a $1$-symmetric $2R$ norm. Partial results on $1$-symmetric $2R$ renormings of spaces with a…
The \lq\lq effective geometry" formalism is used to study the perturbations of a perfect barotropic Newtonian self-gravitating rotating and compressible fluid coupled with gravitational backreaction. The case of a uniformly rotating…
Sponges were recently proposed as a generalization of lattices, focussing on joins/meets of sets, while letting go of associativity/transitivity. In this work we provide tools for characterizing and constructing sponges on metric spaces and…
For any field $K$ and for a completely arbitrary graph $E$, we characterize the Leavitt path algebras $L_K(E)$ that are indecomposable (as a direct sum of two-sided ideals) in terms of the underlying graph. When the algebra decomposes, it…
Given a locally finite simple graph so that its degree is not bounded, every self-adjoint realization of the adjacency matrix is unbounded from above. In this note we give an optimal condition to ensure it is also unbounded from below. We…
If we fix the angles at the vertices of a convex planar $n$-gon, the lengths of its edges must satisfy two linear constraints in order for it to close up. If we also require unit perimeter, our vectors of $n$ edge lengths form a convex…