Related papers: Patchworking Oriented Matroids

Indirect hex-dominant meshing methods rely on the detection of adjacent tetrahedra an algorithm that performs this identification and builds the set of all possible combinations of tetrahedral elements of an input mesh T into hexahedra,…

Starting from any finite simple graph, one can build a reflexive polytope known as a symmetric edge polytope. The first goal of this paper is to show that symmetric edge polytopes are intrinsically matroidal objects: more precisely, we…

We introduce a new iterative rounding technique to round a point in a matroid polytope subject to further matroid constraints. This technique returns an independent set in one matroid with limited violations of the other ones. On top of the…

The aim of the paper is to clarify the nature of combinatorial structures associated with maps on closed compact surfaces. We prove that maps give rise to Lagrangian matroids representable in a setting provided by cohomology of the surface…

The investigation of combinatorial diameters of polyhedra is a classical topic in linear programming due to its connection with the possibility of an efficient pivot rule for the simplex method. We are interested in the diameters of…

An origami manifold is a manifold equipped with a closed 2-form which is symplectic except on a hypersurface where it is like the pullback of a symplectic form by a folding map and its kernel fibrates with oriented circle fibers over a…

This article is a survey of matroid theory aimed at algebraic geometers. Matroids are combinatorial abstractions of linear subspaces and hyperplane arrangements. Not all matroids come from linear subspaces; those that do are said to be…

Origami-based mechanical metamaterials have recently received significant scientific interest due to their versatile and reconfigurable architectures. However, it is often challenging to account for all possible geometrical configurations…

We introduce tropical matroid Schubert varieties, a tropical analogue of arrangement Schubert varieties associated with realisable matroids. We prove that the tropical cohomology ring of the tropical matroid Schubert variety associated to…

We provide a natural definition of an elliptic arrangement, extending the classical framework to an elliptic curve E with complex multiplication. We analyse the intersections of elements of the arrangement and their connected components as…

For certain tropical quartic curves the existing techniques could not predict the lifting behavior of their bitangents over the real numbers. We close this gap by using patchworking techniques. Further, this paper provides an analysis of…

The orientation of cell division is a major determinant of three-dimensional plant morphogenesis. Whether and how a simple division orientation rule explains the establishment of symmetric body plans is a fundamental question. Testing such…

We introduce the minor-closed, dual-closed class of multi-path matroids. We give a polynomial-time algorithm for computing the Tutte polynomial of a multi-path matroid, we describe their basis activities, and we prove some basic structural…

Speyer recognized that matroids encode the same data as a special class of tropical linear spaces and Shaw interpreted tropically certain basic matroid constructions; additionally, Frenk developed the perspective of tropical linear spaces…

It is well known that not every combinatorial configuration admits a geometric realization with points and lines. Moreover, some of them do not even admit realizations with pseudoline arrangements, i.e., they are not topological. In this…

This thesis is basically devoted to matroids -- fundamental structure of combinatorial optimization -- though some of our results concern simplicial complexes, or Euclidean spaces. We study old and new problems for these structures, with…

In this paper we study algorithmic aspects of tropical intersection theory. We analyse how divisors and intersection products on tropical cycles can actually be computed using polyhedral geometry. The main focus of this paper is the study…

In this paper we present a new technique to construct neighborly polytopes, and use it to prove a lower bound of ((r+d)^((r/2+d/2)^2))/(r^((r/2)^2)d^((d/2)^2)e^(3rd/4)) for the number of combinatorial types of vertex-labeled neighborly…

Genevois introduced and investigated mediangle graphs as a common generalization of median graphs (1-sekeleta of CAT(0) cube complexes) and Coxeter graphs (Cayley graphs of Coxeter systems) and studied groups acting on them. He asked if…

Given $d$ row vectors of $n$ tropical numbers, $d<n$, the tropical Stiefel map constructs a version of their row space, whose Pl\"ucker coordinates are tropical determinants. We explicitly describe the fibers of this map. From the viewpoint…