Related papers: Geometry of ample/lopsided sets
Coquand's cubical set model for homotopy type theory provides the basis for a computational interpretation of the univalence axiom and some higher inductive types, as implemented in the cubical proof assistant. This paper contributes to the…
Mirror graphs were introduced by Bre\v{s}ar et al. in 2004 as an intriguing class of graphs: vertex-transitive, isometrically embeddable into hypercubes, having a strong connection with regular maps and polytope structure. In this article…
We provide a new characterization of convex geometries via a multivariate version of an identity that was originally proved by Maneva, Mossel and Wainwright for certain combinatorial objects arising in the context of the k-SAT problem. We…
For a family $\mathcal{C}$ of properly embedded curves in the 2-dimensional disk $\mathbb{D}^{2}$ satisfying certain uniqueness properties, we consider convex polygons $P\subset \mathbb{D}^{2}$ and define a metric $d$ on $P$ such that…
We show that a homeomorphism of Euclidean space is quasiconformal if and only if at each point there exists a sequence of uncentered open sets with bounded eccentricity shrinking to that point whose images also have bounded eccentricity.…
We study the problem of reconfiguring odd matchings, that is, matchings that cover all but a single vertex. Our reconfiguration operation is a so-called flip where the unmatched vertex of the first matching gets matched, while consequently…
Birkhoff's 1937 dual representation of finite distributive lattices via finite posets was in 1970 extended to a dual representation of arbitrary distributive lattices via compact totally order-disconnected topological spaces by Priestley.…
This paper considers the planar figure of a combinatorial polytope or tessellation identified by the Coxeter symbol $k_{i,j}$ , inscribed in a conic, satisfying the geometric constraint that each octahedral cell has a centre. This…
In the first half of twentieth century the theory of complex analytic functions and of their zerosets was fully developed. The definition of holomorphic function has a local nature. Germs of holomorphic functions form a distinguished…
In this paper, we present a new method for computing the f-vector of a marked order polytope. Namely, given an arbitrary (polyhedral) subdivision of an arbitrary convex polytope, we construct a cochain complex (over the two-element field…
Polytope theory has produced a great number of remarkably simple and complete characterization results for face-number sets or f-vector sets of classes of polytopes. We observe that in most cases these sets can be described as the…
The intersection data of a hyperplane arrangement is described by a geometric lattice, or equivalently a simple matroid. There is a rich interplay between this combinatorial structure and the topology of the arrangement complement. In this…
These lectures on the combinatorics and geometry of 0/1-polytopes are meant as an \emph{introduction} and \emph{invitation}. Rather than heading for an extensive survey on 0/1-polytopes I present some interesting aspects of these objects;…
Polyhedral products were defined by Bahri, Bendersky, Cohen and Gitler, to be spaces obtained as unions of certain product spaces indexed by the simplices of an abstract simplicial complex. In this paper we give a very general homotopy…
Frobenius algebras in the category of sets and relations ($\mathbf{Rel}$) serve as a unifying framework for various algebraic and combinatorial structures, including groupoids, effect algebras, and abstract circles. Recently, a nerve…
We use Constraint Satisfaction Methods to construct and enumerate finite $L$-algebras up to isomorphism. These objects were recently introduced by Rump and appear in Garside theory, algebraic logic, and the study of the combinatorial…
In this paper, we will answer one of the questions proposed by Bodur, Del~Pia, Dey, Molinaro and Pokutta in 2017. Specifically, we show that the k-aggregation closure of a covering set is a polyhedron. The proof technique is based on an…
In pure integer linear programming it is often desirable to work with polyhedra that are full-dimensional, and it is well known that it is possible to reduce any polyhedron to a full-dimensional one in polynomial time. More precisely, using…
This thesis is a study of large sets of unit vectors in $\cx^n$ such that the absolute value of their standard inner products takes on only a small number of values. We begin with bounds: what is the maximal size of a set of lines with only…
One of possible cryptomorphic definitions of a partially ordered set (= a poset) $P$ on a non-empty finite basic set $N$ is in terms of the set ${\cal L}(P)$ of all its linear extensions, that is, in terms of the set of total orders of $N$…