English
Related papers

Related papers: Mutations and (Non-)Euclideaness in oriented matro…

200 papers

A fundamental question in parallel computation, posed by Karp, Upfal, and Wigderson (FOCS 1985, JCSS 1988), asks: \emph{given only independence-oracle access to a matroid on $n$ elements, how many rounds are required to find a basis using…

Data Structures and Algorithms · Computer Science 2025-11-10 Sanjeev Khanna , Aaron Putterman , Junkai Song

In contrast to matroids, vf-safe delta-matroids have three kinds of minors and are closed under the operations of twist and loop complementation. We show that the delta-matroids representable over GF(4) with respect to the nontrivial…

Combinatorics · Mathematics 2014-05-16 Robert Brijder , Hendrik Jan Hoogeboom

It is conjectured that for fixed $A$, $r \ge 1$, and $d \ge 1$, there is a uniform bound on the size of the torsion submodule of a Drinfeld $A$-module of rank $r$ over a degree $d$ extension $L$ of the fraction field $K$ of $A$. We verify…

Number Theory · Mathematics 2016-09-06 Bjorn Poonen

It is well known that the space of oriented lines of Euclidean space has a natural symplectic structure. Moreover, given an immersed, oriented hypersurface S the set of oriented lines that cross S orthogonally is a Lagrangian submanifold.…

Differential Geometry · Mathematics 2015-07-15 Henri Anciaux , Pierre Bayard

Let $M$ be a matroid and let $Q$, $R$, $S$ and $T$ be subsets of the ground set such that the smallest separation that separates $Q$ from $R$ has order $k$ and the smallest separation that separates $S$ from $T$ has order $l$. We prove that…

Combinatorics · Mathematics 2014-03-06 Rong Chen , Geoff Whittle

Correlated materials with competing spin-orbit and crystal-field interactions can host composite spin-orbital magnons that are highly susceptible to structural and electronic perturbations, enabling the control of magnetic dynamics beyond…

We construct, for every $r \ge 3$ and every prime power $q > 10$, a rank-$r$ matroid with no $U_{2,q+2}$-minor, having more hyperplanes than the rank-$r$ projective geometry over $\mathrm{GF}(q)$.

Combinatorics · Mathematics 2018-05-21 Adam Brown , Peter Nelson

In an $\mathsf{L}$-embedding of a graph, each vertex is represented by an $\mathsf{L}$-segment, and two segments intersect each other if and only if the corresponding vertices are adjacent in the graph. If the corner of each…

Computational Geometry · Computer Science 2017-03-07 Abu Reyan Ahmed , Felice De Luca , Sabin Devkota , Alon Efrat , Md Iqbal Hossain , Stephen Kobourov , Jixian Li , Sammi Abida Salma , Eric Welch

The Tutte polynomial is a fundamental invariant of graphs and matroids. In this article, we define a generalization of the Tutte polynomial to oriented graphs and regular oriented matroids. To any regular oriented matroid $N$, we associate…

Combinatorics · Mathematics 2023-10-12 Jordan Awan , Olivier Bernardi

Let $A$ and $B$ be sets in a finite vector space. In this paper, we study the magnitude of the set $A\cap f(B)$, where $f$ runs through a set of transformations. More precisely, we will focus on the cases that the set of transformations is…

Combinatorics · Mathematics 2025-11-27 Thang Pham , Semin Yoo

Star configurations are certain unions of linear subspaces of projective space that have been studied extensively. We develop a framework for studying a substantial generalization, which we call matroid configurations, whose ideals…

Algebraic Geometry · Mathematics 2015-07-03 A. V. Geramita , B. Harbourne , J. Migliore , U. Nagel

If S is a set of matroids, then the matroid M is S-fragile if, for every element e in E(M), either M\e or M/e has no minor isomorphic to a member of S. Excluded-minor characterizations often depend, implicitly or explicitly, on…

Combinatorics · Mathematics 2015-05-01 Carolyn Chun , Deborah Chun , Dillon Mayhew , Stefan H. M. van Zwam

Let $M$ be a matroid. We study the expansions of $M$ mainly to see how the combinatorial properties of $M$ and its expansions are related to each other. It is shown that $M$ is a graphic, binary or a transversal matroid if and only if an…

Combinatorics · Mathematics 2017-05-29 Rahim Rahmati-Asghar

The theory of matroids has been generalized to oriented matroids and, recently, to arithmetic matroids. We want to give a definition of "oriented arithmetic matroid" and prove some properties like the "uniqueness of orientation".

Combinatorics · Mathematics 2020-07-20 Roberto Pagaria

We survey, complete, and modify a proof, involving knot theory, of Stiefel's theorem that all orientable $3$-manifolds are parallelizable. The completion of the proof is done by using the relationship between the tangent bundle and normal…

Geometric Topology · Mathematics 2023-06-01 Dionne Ibarra

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

In [27], we provided results on the $p$-modulus of the family of all bases of matroids and showed that it recovers various concepts in matroid theory, including strength, fractional arboricity, and principal partitions. In particular, the…

Combinatorics · Mathematics 2026-04-15 Huy Truong , Pietro Poggi-Corradini

Let $R$ be a discrete valuation domain with field of fractions $Q$ and maximal ideal generated by $\pi$. Let $\Lambda$ be an $R$-order such that $Q\Lambda$ is a separable $Q$-algebra. Maranda showed that there exists $k\in\mathbb{N}$ such…

Representation Theory · Mathematics 2024-12-23 Lorna Gregory

A sweep of a point configuration is any ordered partition induced by a linear functional. Posets of sweeps of planar point configurations were formalized and abstracted by Goodman and Pollack under the theory of allowable sequences of…

Combinatorics · Mathematics 2023-10-26 Arnau Padrol , Eva Philippe

The expansion axiom of matroids requires only the existence of some kind of independent sets, not the uniqueness of them. This causes that the base families of some matroids can be reduced while the unions of the base families of these…

Discrete Mathematics · Computer Science 2013-07-11 Hua Yao , William Zhu