English
Related papers

Related papers: Matroid base polytope decomposition II : sequence …

200 papers

A partitioned matroid $(M, \{X_1,X_2,\dots,X_n\})$ consists of a matroid $M$ and a partition $\{X_1,X_2,\dots,X_n\}$ of its ground set. As such structures arise frequently in structural matroid theory, this paper introduces a general…

Combinatorics · Mathematics 2025-04-17 Nick Brettell , James Oxley , Charles Semple , Geoff Whittle

It is known that there exist hyperplane arrangements with same underlying matroid that admit non-homotopy equivalent complement manifolds. In this work we show that, in any rank, complex central hyperplane arrangements with up to 7…

Combinatorics · Mathematics 2017-01-31 Matteo Gallet , Elia Saini

We are interested in expanding our understanding of symplectic matroids by exploring the properties of a class of symplectic matroids with a "lattice of flats". Taking a well-behaved family of subdivisions of the cross polytope we obtain a…

Combinatorics · Mathematics 2026-01-08 Or Raz

We study totally geodesic planes in hyperbolic 3-manifolds $M$ having incompressible core and degenerate ends. We prove a Ratner-type phenomenon: a closed minimal $PSL(2,R)-$invariant subset of $M$ is either an immersed totally geodesic…

Geometric Topology · Mathematics 2016-04-08 Mahan Mj

We show that the number of lines in an $m$--homogeneous supersolvable line arrangement is upper bounded by $3m-3$ and we classify the $m$--homogeneous supersolvable line arrangements with two modular points up-to lattice-isotopy. A lower…

Algebraic Geometry · Mathematics 2019-10-09 Takuro Abe , Alexandru Dimca

Let $M$ be a complex manifold. We prove that a compact submanifold $S\subset M$ with splitting tangent sequence (called a splitting submanifold) is rational homogeneous when $M$ is in a large class of rational homogeneous spaces of Picard…

Algebraic Geometry · Mathematics 2022-01-19 Cong Ding

We consider three forms of composition of matroids, each of which extends the category of bimatroids to a rigid monoidal category. Many well-known constructions are functorial or defined by morphisms in these categories. Motivating examples…

Combinatorics · Mathematics 2024-03-07 Kevin Purbhoo

In this article we show that for every collection $\mathcal{C}$ of an even number of polynomials, all of the same degree $d>2$ and in general position, there exist two hyperbolic $3$-orbifolds $M_1$ and $M_2$ with a M\"obius morphism…

Dynamical Systems · Mathematics 2019-07-31 Carlos Cabrera , Peter Makienko , Guillermo Sienra

By [R. Bautista, P. Gabriel, A.V Roiter., L. Salmeron, Representation-finite algebras and multiplicative basis. Invent. Math. 81 (1985) 217-285.], a finite-dimensional algebra having finitely many isoclasses of indecomposable…

Representation Theory · Mathematics 2007-11-17 Andrej V. Roiter , Vladimir V. Sergeichuk

The lattice of flats $\mathcal L_M$ of a matroid $M$ is combinatorially well-behaved and, when $M$ is realizable, admits a geometric model in the form of a "Schubert variety of hyperplane arrangement". In contrast, the lattice of flats of a…

Algebraic Geometry · Mathematics 2025-09-19 Colin Crowley , Connor Simpson , Botong Wang

Polar decompositions of quaternion matrices with respect to a given indefinite inner product are studied. Necessary and sufficient conditions for the existence of an $H$-polar decomposition are found. In the process an equivalent to Witt's…

Functional Analysis · Mathematics 2021-06-22 G. J. Groenewald , D. B. Janse van Rensburg , A. C. M. Ran , F. Theron , M. van Straaten

We explore a combinatorial theory of linear dependency in complex space, "complex matroids", with foundations analogous to those for oriented matroids. We give multiple equivalent axiomatizations of complex matroids, showing that this…

Combinatorics · Mathematics 2013-03-27 Laura Anderson , Emanuele Delucchi

We show that the minimal number of skewed hyperplanes that cover the hypercube $\{0,1\}^{n}$ is at least $\frac{n}{2}+1$, and there are infinitely many $n$'s when the hypercube can be covered with $n-\log_{2}(n)+1$ skewed hyperplanes. The…

Combinatorics · Mathematics 2025-10-06 Paata Ivanisvili , Ohad Klein , Roman Vershynin

Understanding the structure of indecomposable $n$-dimensional persistence modules is a difficult problem, yet is foundational for studying multipersistence. To this end, Buchet and Escolar showed that any finitely presented rectangular…

Algebraic Topology · Mathematics 2020-11-03 Samantha Moore

We investigate an approach to matroid complexity that involves describing a matroid via a list of independent sets, bases, circuits, or some other family of subsets of the ground set. The computational complexity of algorithmic problems…

Combinatorics · Mathematics 2007-09-10 Dillon Mayhew

Let $\mathcal B=\mathcal B_{k,n,p}$ be a random collection of $k$-subsets of $[n]$ where each possible set is present independently with probability $p$. Let $\cal E_{\mathcal B}$ be the event that $\mathcal B$ defines the set of bases of a…

Combinatorics · Mathematics 2026-05-11 Patrick Bennett , Alan Frieze

We establish the following splitter theorem for graphs and its generalization for matroids: Let $G$ and $H$ be $3$-connected simple graphs such that $G$ has an $H$-minor and $k:=|V(G)|-|V(H)|\ge 2$. Let $n:=\left\lceil k/2\right\rceil+1$.…

Combinatorics · Mathematics 2017-12-13 João Paulo Costalonga

Tropical geometry gives a bound on the ranks of divisors on curves in terms of the combinatorics of the dual graph of a degeneration. We show that for a family of examples, curves realizing this bound might only exist over certain…

Algebraic Geometry · Mathematics 2018-06-18 Dustin Cartwright

We show that any infinite matroid can be reconstructed from the torsos of a tree-decomposition over its 2-separations, together with local information at the ends of the tree. We show that if the matroid is tame then this local information…

Combinatorics · Mathematics 2016-06-15 Nathan Bowler , Johannes Carmesin , Luke Postle

We study whether for a given planar family F there is an m such that any finite set of points can be 3-colored such that any member of F that contains at least m points contains two points with different colors. We conjecture that if F is a…

Combinatorics · Mathematics 2019-04-17 Balázs Keszegh , Dömötör Pálvölgyi