English
Related papers

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

200 papers

A matroid $N$ is a lift of a binary matroid $M$, if $N=Q\backslash X$ when $Q/X=M$ for some binary matroid $Q$ and $X \subseteq E(Q)$ and is called an elementary lift of $M$, if $|X|=1$. A splitting operation on a binary matroid can result…

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

We show that no minimal vertex triangulation of a closed, connected, orientable 2-manifold of genus 6 admits a polyhedral embedding in R^3. We also provide examples of minimal vertex triangulations of closed, connected, orientable…

Metric Geometry · Mathematics 2008-01-18 Lars Schewe

We discuss characterizations of the decoupleability, partial and full, of trilinear or completely symmetric real $n\times n\times n$ tensors, which inform on the structure of certain coupled KPZ equations. Informally, when the tensor is…

Probability · Mathematics 2025-08-07 Boliang Fu , Tadahisa Funaki , Sunder Sethuraman , Shankar Venkataramani

Consider a random $n\times m$ matrix $A$ over the finite field of order $q$ where every column has precisely $k$ nonzero elements, and let $M[A]$ be the matroid represented by $A$. In the case that q=2, Cooper, Frieze and Pegden (RS\&A…

Combinatorics · Mathematics 2024-01-22 Pu Gao , Peter Nelson

A biased graph is a graph with a class of selected circles ("cycles", "circuits"), called "balanced", such that no theta subgraph contains exactly two balanced circles. A biased graph has two natural matroids, the frame matroid and the lift…

Combinatorics · Mathematics 2021-06-16 Rigoberto Flórez , Thomas Zaslavsky

We prove that the knots and links in the infinite set of $3$-highly twisted $2m$-plats, with $m \geq 2$, are all hyperbolic. This should be compared with a result of Futer-Purcell for $6$-highly twisted diagrams. While their proof uses…

Geometric Topology · Mathematics 2021-11-30 Nir Lazarovich , Yoav Moriah , Tali Pinsky

In this paper, we investigate the classes of matroid intersection admitting a solution for the problem of partitioning the ground set $E$ into $k$ common independent sets, where $E$ can be partitioned into $k$ independent sets in each of…

Combinatorics · Mathematics 2019-01-29 Kenjiro Takazawa , Yu Yokoi

We prove a general result concerning cyclic orderings of the elements of a matroid. For each matroid $M$, weight function $\omega:E(M)\rightarrow\mathbb{N}$, and positive integer $D$, the following are equivalent. (1) For all $A\subseteq…

Combinatorics · Mathematics 2011-07-20 Jan van den Heuvel , Stéphan Thomassé

Matroids over skew tracts provide an algebraic framework simultaneously generalizing the notions of linear subspaces, matroids, oriented matroids, phased matroids, and some other ``matroids with extra structure". A single-element extension…

Combinatorics · Mathematics 2025-12-24 Ting Su

We present a strengthening of the countable Menger theorem (edge version) of R. Aharoni. Let $ D=(V,A) $ be a countable digraph with $ s\neq t\in V $ and let $\mathcal{M}=\bigoplus_{v\in V}\mathcal{M}_v $ be a matroid on $ A $ where $…

Combinatorics · Mathematics 2017-05-02 Attila Joó

Hasunuma [J. Graph Theory 102 (2023) 423-435] conjectured that for any tree $T$ of order $m$, every $k$-connected (or $k$-edge-connected) graph $G$ with minimum degree at least $k+m-1$ contains a tree $T'\cong T$ such that $G-E(T')$ is…

Combinatorics · Mathematics 2023-03-08 Qing Yang , Yingzhi Tian

Let $G$ be a connected $n$-vertex graph in a proper minor-closed class $\mathcal G$. We prove that the extension complexity of the spanning tree polytope of $G$ is $O(n^{3/2})$. This improves on the $O(n^2)$ bounds following from the work…

Combinatorics · Mathematics 2021-12-21 Manuel Aprile , Samuel Fiorini , Tony Huynh , Gwenaël Joret , David R. Wood

If $C_1$ and $C_2$ are circuits in a matroid $M$ with $e_1$ in $C_1-C_2$ and $e$ in $C_1\cap C_2$, then $M$ has a circuit $C_3$ such that $e\in C_3\subseteq (C_1\cup C_2)-e$. This strong circuit elimination axiom is inherently asymmetric. A…

Combinatorics · Mathematics 2025-08-04 Christine Cho , James Oxley , Suijie Wang

Motivated by the characterization of the lattice of cyclic flats of a matroid, the convolution of a ranked lattice and a discrete measure is defined, generalizing polymatroid convolution. Using the convolution technique we prove that if a…

Combinatorics · Mathematics 2019-10-03 Laszlo Csirmaz

A flat of a matroid is cyclic if it is a union of circuits. The cyclic flats of a matroid form a lattice under inclusion. We study these lattices and explore matroids from the perspective of cyclic flats. In particular, we show that every…

Combinatorics · Mathematics 2024-08-07 Joseph E. Bonin , Anna de Mier

The components of K*-vectors associated to a simple oriented matroid M are the numbers of general or special tope committees for M. Using the principle of inclusion-exclusion, we determine how the reorientations of M on one-element subsets…

Combinatorics · Mathematics 2010-10-19 Andrey O. Matveev

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

We complete the explicit study of a three-fold divisorial contraction whose exceptional divisor contracts to a point, by treating the case where the point downstairs is a singularity of index $n \ge 2$. We prove that if this singularity is…

Algebraic Geometry · Mathematics 2007-05-23 Masayuki Kawakita

For smooth manifolds $M$ and $N$, let $\Ebar(M, N)$ be the homotopy fiber of the map $\Emb(M, N)\longrightarrow \Imm(M, N)$. Consider the functor from the category of Euclidean spaces to the category of spectra, defined by the formula…

Algebraic Topology · Mathematics 2014-02-26 Gregory Arone

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