English
Related papers

Related papers: Corners and simpliciality in oriented matroids and…

200 papers

Let $p$ be an odd prime. Let $P$ be a finite $p$-group of class $2$ and exponent $p$, whose commutator quotient $P/[P,P]$ is of order $p^n$. We define two parameters for $P$ related to central decompositions. The first parameter,…

Combinatorics · Mathematics 2019-06-26 Yinan Li , Youming Qiao

In 1980, Las Vergnas defined a notion of discrete convexity for oriented matroids, which Edelman subsequently related to the theory of anti-exchange closure functions and convex geometries. In this paper, we use generalized matroid activity…

Combinatorics · Mathematics 2021-03-30 Bryan R. Gillespie

We introduce a general framework allowing the systematic study of random manifolds. In order to do so, we will put ourselves in a more general context than usual by allowing the underlying probability space to be non commutative. We…

Dynamical Systems · Mathematics 2018-03-19 Miguel Bermudez

This paper studies the properties of two kinds of matroids: (a) algebraic matroids and (b) finite and infinite matroids whose ground set have some canonical symmetry, for example row and column symmetry and transposition symmetry. For (a)…

Combinatorics · Mathematics 2013-12-16 Franz J. Király , Zvi Rosen , Louis Theran

Consider a collection of points in the plane and the sets of slopes or directions of the lines between pairs of points. It is known that the algebraic matroid on the set of direction constraints between the points is equivalent to the…

Combinatorics · Mathematics 2026-04-27 Sean Dewar , Georg Grasegger , Anthony Nixon , Zvi Rosen , William Sims , Meera Sitharam , David Urizar

This is the last paper of a series of four papers in which we prove the following relaxation of the Loebl-Komlos-Sos Conjecture: For every $\alpha>0$ there exists a number~$k_0$ such that for every $k>k_0$ every $n$-vertex graph $G$ with at…

Combinatorics · Mathematics 2017-07-31 Jan Hladký , János Komlós , Diana Piguet , Miklós Simonovits , Maya J. Stein , Endre Szemerédi

We investigate the iterative behaviour of continuous order preserving subhomogeneous maps that map a polyhedral cone into itself. For these maps we show that every bounded orbit converges to a periodic orbit and, moreover, that there exists…

Dynamical Systems · Mathematics 2007-05-23 Marianne Akian , Stephane Gaubert , Bas Lemmens , Roger Nussbaum

We prove that any compact semi-algebraic set is homeomorphic to the solution space of some art gallery problem. Previous works have established similar universality theorems, but holding only up to homotopy equivalence, rather than…

Computational Geometry · Computer Science 2023-05-30 Jack Stade , Jamie Tucker-Foltz

We investigate the structure of two-dimensional partial cubes, i.e., of isometric subgraphs of hypercubes whose vertex set defines a set family of VC-dimension at most 2. Equivalently, those are the partial cubes which are not contractible…

Combinatorics · Mathematics 2021-05-20 Victor Chepoi , Kolja Knauer , Manon Philibert

In this paper we present a definition of oriented Lagrangian symplectic matroids and their representations. Classical concepts of orientation and this extension may both be thought of as stratifications of thin Schubert cells into unions of…

Combinatorics · Mathematics 2007-05-23 Richard F. Booth , Alexandre V. Borovik , Israel M. Gelfand , Neil White

One of the most important classes of even $\Delta$-matroids arises from orientable ribbon graphs, which play a role analogous to that of graphic matroids in matroid theory. Motivated by a natural correspondence between strong…

Combinatorics · Mathematics 2026-03-09 Changxin Ding , Donggyu Kim

Let $(M,\omega)$ be a symplectic manifold endowed with a agrangian foliation ${\cal L}$, it has been shown by Weinstein [16] hat the symplectic structure of $M$ defines on each leaf of ${\cal L}$, connection which curvature and torsion…

Differential Geometry · Mathematics 2007-05-23 Aristide Tsemo

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…

Combinatorics · Mathematics 2007-05-23 Richard F. Booth , Alexandre V. Borovik , Israel Gelfand

We present the first algorithm to morph graphs on the torus. Given two isotopic essentially 3-connected embeddings of the same graph on the Euclidean flat torus, where the edges in both drawings are geodesics, our algorithm computes a…

Computational Geometry · Computer Science 2020-07-17 Erin Wolf Chambers , Jeff Erickson , Patrick Lin , Salman Parsa

Orthogonal drawings, i.e., embeddings of graphs into grids, are a classic topic in Graph Drawing. Often the goal is to find a drawing that minimizes the number of bends on the edges. A key ingredient for bend minimization algorithms is the…

Computational Geometry · Computer Science 2021-06-11 Lukas Barth , Benjamin Niedermann , Ignaz Rutter , Matthias Wolf

We establish the following two main results on order types of points in general position in the plane (realizable simple planar order types, realizable uniform acyclic oriented matroids of rank $3$): (a) The number of extreme points in an…

Computational Geometry · Computer Science 2022-06-09 Xavier Goaoc , Emo Welzl

A common practice in arithmetic geometry is that of generalizing rational points on projective varieties to integral points on quasi-projective varieties. Following this practice, we demonstrate an analogue of a result of L. Caporaso, J.…

alg-geom · Mathematics 2008-02-03 Dan Abramovich

The classical matrix tree theorem relates the number of spanning trees of a connected graph with the product of the nonzero eigenvalues of its Laplacian matrix. The class of regular matroids generalizes that of graphical matroids, and a…

Combinatorics · Mathematics 2014-05-12 Aaron Dall , Julian Pfeifle

A three-tope committee K* for a simple oriented matroid M is a 3-subset of its maximal covectors such that every positive halfspace of M contains at least two topes from K*. We consider three-tope committees as the vertex sets of triangles…

Combinatorics · Mathematics 2008-12-08 Andrey O. Matveev

An embedding of a graph on an orientable surface is orientably-regular (or rotary, in an equivalent terminology) if the group of orientation-preserving automorphisms of the embedding is transitive (and hence regular) on incident vertex-edge…

Combinatorics · Mathematics 2023-11-17 Stefan Gyurki , Sona Pavlikova , Jozef Siran