English
Related papers

Related papers: Parallel Translates of Represented Matroids

200 papers

We consider decompositions of topes of the oriented matroid realizable as the arrangement of coordinate hyperplanes in $\mathbb{R}^{2^t}$, with respect to a distinguished symmetric $2\cdot 2^t$-cycle in its hypercube graph of topes…

Combinatorics · Mathematics 2021-08-04 Andrey O. Matveev

A matroid $M$ is an ordered pair $(E,I)$, where $E$ is a finite set called the ground set and a collection $I\subset 2^{E}$ called the independent sets which satisfy the conditions: (i) $\emptyset \in I$, (ii) $I'\subset I \in I$ implies…

Computational Complexity · Computer Science 2024-08-21 Eun Jung Kim , Arnaud de Mesmay , Tillmann Miltzow

Over a finite field $\mathbb{F}_{q^m}$, the evaluation of skew polynomials is intimately related to the evaluation of linearized polynomials. This connection allows one to relate the concept of polynomial independence defined for skew…

Information Theory · Computer Science 2016-10-26 Siyu Liu , Felice Manganiello , Frank R. Kschischang

Let \A be a complex hyperplane arrangement, and let $X$ be a modular element of arbitrary rank in the intersection lattice of \A. We show that projection along $X$ restricts to a fiber bundle projection of the complement of \A to the…

Combinatorics · Mathematics 2007-05-23 Michael J. Falk , Nicholas J. Proudfoot

A classic problem in matroid theory is to find subspace arrangements, specifically hyperplane and pseudosphere arrangements, whose intersection posets are isomorphic to a prescribed geometric lattice. Engstr\"om recently showed how to…

Combinatorics · Mathematics 2019-09-04 Steven Klee , Matthew T. Stamps

We consider hyperplane arrangements generated by generic points and study their intersection lattices. These arrangements are known to be equivalent to discriminantal arrangements. We show a fundamental structure of the intersection…

Combinatorics · Mathematics 2013-01-17 Hiroshi Koizumi , Yasuhide Numata , Akimichi Takemura

For a reduced hyperplane arrangement we prove the analytic Twisted Logarithmic Comparison Theorem, subject to mild combinatorial arithmetic conditions on the weights defining the twist. This gives a quasi-isomorphism between the twisted…

Algebraic Geometry · Mathematics 2024-10-15 Daniel Bath

Generalizing a theorem of the first two authors and Geelen for planes, we show that, for a real-representable matroid $M$, either the average hyperplane-size in $M$ is at most a constant depending only on its rank, or each hyperplane of $M$…

Combinatorics · Mathematics 2025-09-03 Rutger Campbell , Matthew E. Kroeker , Ben Lund

We prove that if M is a vertically 4-connected matroid with a modular flat X of rank at least three, then every representation of M | X over a finite field F extends to a unique F-representation of M. A corollary is that when F has order q,…

Combinatorics · Mathematics 2013-04-25 Jim Geelen , Rohan Kapadia

An arrangement of hyperplanes is a finite collection of hyperplanes in a real Euclidean space. To such a collection one associates the characteristic polynomial that encodes the combinatorics of intersections of the hyperplanes. Finding the…

Combinatorics · Mathematics 2019-04-19 A. R. Balasubramanian

Hetyei recently introduced a hyperplane arrangement (called the homogenized Linial arrangement) and used the finite field method of Athanasiadis to show that its number of regions is a median Genocchi number. These numbers count a class of…

Combinatorics · Mathematics 2019-05-14 Alexander Lazar , Michelle L. Wachs

A matroid is a machine capturing linearity of mathematical objects and producing combinatorial structures. Matroid structure arises everywhere since linearity is a ubiquitous concept. One natural way to obtain matroids is by considering…

Combinatorics · Mathematics 2023-03-14 Jaeho Shin

We construct a combinatorial generalization of the Leray models for hyperplane arrangement complements. Given a matroid and some combinatorial blowup data, we give a presentation for a bigraded (commutative) differential-graded algebra. If…

Combinatorics · Mathematics 2022-03-30 Christin Bibby , Graham Denham , Eva Maria Feichtner

Tropical oriented matroids were defined by Ardila and Develin in 2007. They are a tropical analogue of classical oriented matroids in the sense that they encode the properties of the types of points in an arrangement of tropical hyperplanes…

Combinatorics · Mathematics 2012-12-11 Silke Horn

We define and study "semimatroids", a class of objects which abstracts the dependence properties of an affine hyperplane arrangement. We show that geometric semilattices are precisely the posets of flats of semimatroids. We define and…

Combinatorics · Mathematics 2007-05-23 Federico Ardila

Let A be a subspace arrangement and let chi(A,t) be the characteristic polynomial of its intersection lattice L(A). We show that if the subspaces in A are taken from L(B_n), where B_n is the type B Weyl arrangement, then chi(A,t) counts a…

Combinatorics · Mathematics 2007-05-23 Andreas Blass , Bruce E. Sagan

This paper is devoted to the classification problems concerning extended deformations of convex polyhedra and real hyperplane arrangements in the following senses: combinatorial equivalence of face posets, normal equivalence on normal fans…

Combinatorics · Mathematics 2024-08-08 Houshan Fu , Boxuan Li , Chunming Tang , Suijie Wang

We study the combinatorial properties of a tropical hyperplane arrangement. We define tropical oriented matroids, and prove that they share many of the properties of ordinary oriented matroids. We show that a tropical oriented matroid…

Combinatorics · Mathematics 2007-06-25 Federico Ardila , Mike Develin

A topological hyperplane is a subspace of R^n (or a homeomorph of it) that is topologically equivalent to an ordinary straight hyperplane. An arrangement of topological hyperplanes in R^n is a finite set H such that k topological…

Combinatorics · Mathematics 2010-01-24 David Forge , Thomas Zaslavsky

In the study of algebras related to non-classical logics, (distributive) semilattices are always present in the background. For example, the algebraic semantic of the $\{\rightarrow,\wedge,\top\}$-fragment of intuitionistic logic is the…

Logic · Mathematics 2018-10-22 Sergio A. Celani , Ma. Paula Menchón