English
Related papers

Related papers: Vertically N-contractible elements in 3-connected …

200 papers

Rota's basis conjecture, open since 1989, states that if B_1, B_2, ..., B_n are n bases of a vector space of rank n, then there is an nxn grid of vectors such that the vectors in the ith row are precisely the elements of B_i and such that…

Combinatorics · Mathematics 2008-09-09 Timothy Y. Chow

In a series of papers the authors proved that twisted Alexander polynomials detect fibered 3-manifolds, and they showed that this implies that a closed 3-manifold N is fibered if and only if S^1 x N is symplectic. In this note we summarize…

Geometric Topology · Mathematics 2010-01-05 Stefan Friedl , Stefano Vidussi

A bar-joint framework $(G,p)$ in $\mathbb{R}^d$ is rigid if the only edge-length preserving continuous motions of the vertices arise from isometries of $\mathbb{R}^d$. It is known that, when $(G,p)$ is generic, its rigidity depends only on…

Combinatorics · Mathematics 2023-03-27 Georg Grasegger , Hakan Guler , Bill Jackson , Anthony Nixon

Given a matroid together with a coloring of its ground set, a subset of its elements is called rainbow colored if no two of its elements have the same color. We show that if a binary matroid of rank $r$ is colored with exactly $r$ colors,…

Combinatorics · Mathematics 2021-09-02 Kristóf Bérczi , Tamás Schwarcz

We prove that the extension complexity of the independence polytope of every regular matroid on $n$ elements is $O(n^6)$. Past results of Wong and Martin on extended formulations of the spanning tree polytope of a graph imply a $O(n^2)$…

Combinatorics · Mathematics 2019-12-23 Manuel Aprile , Samuel Fiorini

We show that if the ground set of a matroid can be partitioned into $k\ge 2$ bases, then for any given subset $S$ of the ground set, there is a partition into $k$ bases such that the sizes of the intersections of the bases with $S$ may…

Combinatorics · Mathematics 2025-12-02 Hannaneh Akrami , Siyue Liu , Roshan Raj , László A. Végh

We present a simple proof of the fact that the base (and independence) polytope of a rank $n$ regular matroid over $m$ elements has an extension complexity $O(mn)$.

Discrete Mathematics · Computer Science 2017-02-08 Rohit Gurjar , Nisheeth K. Vishnoi

We give a cohomological criterion for a parabolic vector bundle on a curve to be semistable. It says that a parabolic vector bundle $E$ with rational parabolic weights is semistable if and only if there is another parabolic vector bundle…

Algebraic Geometry · Mathematics 2011-10-25 Indranil Biswas , Ajneet Dhillon

We introduce a notion of "quasi-right-veering" for closed braids, which plays an analogous role to "right-veering" for open books. We show that a transverse link $K$ in a contact 3-manifold $(M,\xi)$ is non-loose if and only if every braid…

Geometric Topology · Mathematics 2018-07-13 Tetsuya Ito , Keiko Kawamuro

Stanley conjectured in 1977 that the $h$-vector of a matroid simplicial complex is a pure $O$-sequence. We give simple constructive proofs that the conjecture is true for matroids of rank less than or equal to 3, and corank 2. We used…

Combinatorics · Mathematics 2011-06-15 Jesus DeLoera , Yvonne Kemper , Steven Klee

We give a sufficient condition for an almost alternating link diagram to represent a non-splittable link. The main theorem gives us a way to see if a given almost alternating link diagram represents a splittable link without increasing…

Geometric Topology · Mathematics 2007-05-23 Tatsuya Tsukamoto

This paper presents the first in a series of results that allow us to develop a theory providing finer control over the complexity of normalisation, and in particular of cut elimination. By considering atoms as self-dual non-commutative…

Logic in Computer Science · Computer Science 2022-07-01 Andrea Aler Tubella , Alessio Guglielmi

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

In general, the splitting operation on binary matroids does not preserve the graphicness and cographicness properties of binary matroids. In this paper, we obtain a characterization of the class of graphic matroids whose splitting with…

Combinatorics · Mathematics 2023-10-06 S. D. Solanki , Ganesh Mundhe , S. B. Dhotre

We introduce the families of solvable and nilpotent matroids, examining their realization spaces, closures, and associated matroid and circuit varieties. We study their realizability, as well as the irreducible decomposition of their…

Combinatorics · Mathematics 2025-10-29 Emiliano Liwski , Fatemeh Mohammadi

A set $S\subseteq\{0,1\}^E$ of binary vectors, with positions indexed by $E$, is said to be a \textit{powerful code} if, for all $X\subseteq E$, the number of vectors in $S$ that are zero in the positions indexed by $X$ is a power of 2. By…

Combinatorics · Mathematics 2017-05-23 Graham E. Farr , Andrew Y. Z. Wang

A graph $G$ is called collapsible if for every even subset $R\subseteq V(G)$, there is a spanning connected subgraph $H$ of $G$ such that $R$ is the set of vertices of odd degree in $H$. A graph is the reduction of $G$ if it is obtained…

Combinatorics · Mathematics 2016-01-08 Wei-Guo Chen , Zhi-Hong Chen , Mei Lu

Let $G$ be a matroid on ground set \A. The Orlik-Solomon algebra $A(G)$ is the quotient of the exterior algebra \E on \A by the ideal \I generated by circuit boundaries. The quadratic closure $\bar{A}(G)$ of $A(G)$ is the quotient of \E by…

Combinatorics · Mathematics 2007-05-23 Michael Falk

We study noninvolutive set-theoretic solutions $(X,r)$ of the Yang-Baxter equations in terms of the properties of the canonically associated algebraic objects-the braided monoid $S(X,r)$, the quadratic Yang-Baxter algebra $A= A(\textbf{k},…

Quantum Algebra · Mathematics 2025-08-19 Tatiana Gateva-Ivanova

Let $M$ to be a matroid defined on a finite set $E$ and $L\subset E$. $L$ is locked in $M$ if $M|L$ and $M^*|(E\backslash L)$ are 2-connected, and $min\{r(L), r^*(E\backslash L)\} \geq 2$. In this paper, we prove that the nontrivial facets…

Computational Complexity · Computer Science 2017-02-24 Brahim Chaourar