English
Related papers

Related papers: Internally $4$-connected binary matroids with ever…

200 papers

A theory of single-element extensions of integer polymatroids analogous to that of matroids is developed. We present an algorithm to generate a catalog of $2$-polymatroids, up to isomorphism. When we implemented this algorithm on a…

Combinatorics · Mathematics 2014-07-22 Thomas J. Savitsky

For each integer $n\ge 2$, we construct infinitely many $n$-component Brunnian links of 3-balls in $S^4$. Our main tool is the third author's result on the existence of splitting spheres for the trivial two-component link of $2$-spheres in…

Geometric Topology · Mathematics 2026-03-09 Seungwon Kim , Gheehyun Nahm , Alison Tatsuoka

In the model every quark or lepton is identified with a quartet of four "more elementary" particles. One particle in a quartet is a massive spin-0 boson and other three particles are massless spin-1/2 fermions.

High Energy Physics - Phenomenology · Physics 2007-05-23 N. G. Marchuk

Subject to hypotheses based on the matroid structure theory of Geelen, Gerards, and Whittle, we completely characterize the highly connected members of the class of golden-mean matroids and several other closely related classes of…

Combinatorics · Mathematics 2021-01-13 Kevin Grace

A transversal matroid $M$ of rank $r$ on $[n]$ can be associated to a family of binary matrices corresponding to different presentations of $M$. We describe those matrices which arise from unique maximal presentations of size $r$- giving a…

Combinatorics · Mathematics 2019-09-11 Austin Alderete

If $G$ is a looped graph, then its adjacency matrix represents a binary matroid $M_{A}(G)$ on $V(G)$. $M_{A}(G)$ may be obtained from the delta-matroid represented by the adjacency matrix of $G$, but $M_{A}(G)$ is less sensitive to the…

Combinatorics · Mathematics 2013-09-04 Robert Brijder , Hendrik Jan Hoogeboom , Lorenzo Traldi

Motivated by many practical applications, in this paper we study {\em budget feasible mechanisms} where the goal is to procure independent sets from matroids. More specifically, we are given a matroid $\mathcal{M}=(E,\mathcal{I})$ where…

Computer Science and Game Theory · Computer Science 2021-03-10 Stefano Leonardi , Gianpiero Monaco , Piotr Sankowski , Qiang Zhang

A clutter consists of a finite set and a collection of pairwise incomparable subsets. Clutters are natural generalisations of matroids, and they have similar operations of deletion and contraction. We introduce a notion of connectivity for…

Combinatorics · Mathematics 2017-03-06 Amanda Cameron , Dillon Mayhew

We construct six unitary trace invariants for 2 by 2 quaternionic matrices which separate the unitary similarity classes of such matrices, and show that this set is minimal. We prove two quaternionic versions of a well known…

Commutative Algebra · Mathematics 2009-03-18 Dragomir Z. Djokovic , Benjamin H. Smith

We introduce a binary matroid M(IAS(G)) associated with a looped simple graph G. M(IAS(G)) classifies G up to local equivalence, and determines the delta-matroid and isotropic system associated with G. Moreover, a parametrized form of its…

Combinatorics · Mathematics 2014-11-11 Lorenzo Traldi

In this note, we prove that every 4-connected optimal 2-planar graph is Hamiltonian-connected. Furthermore, we show that the 4-connectedness condition is sharp by constructing infinitely many 3-connected optimal 2-planar graphs that are…

Combinatorics · Mathematics 2026-05-05 Licheng Zhang , Yuanqiu Huang , Zhangdong Ouyang

We characterise the following property by six obstructions: given a graphic matroid $M$ and a set $X$ of its elements, when is $M$ the cycle matroid of a graph $G$ such that $X$ is a connected edge set in $G$?

Combinatorics · Mathematics 2017-09-15 Johannes Carmesin

We study an explicit construction of planar open books with four binding components on any three-manifold which is given by integral surgery on three component pure braid closures. This construction is general, indeed any planar open book…

Geometric Topology · Mathematics 2014-10-01 Yanki Lekili

Planes are familiar mathematical objects which lie at the subtle boundary between continuous geometry and discrete combinatorics. A plane is geometrical, certainly, but the ways that two planes can interact break cleanly into discrete sets:…

History and Overview · Mathematics 2025-04-17 Stefan Forcey

Adhesive polymatroids were defined by F. Mat\'u\v{s} motivated by entropy functions. Two polymatroids are adhesive if they can be glued together along their joint part in a modular way; and are one-adhesive, if one of them has a single…

Information Theory · Computer Science 2019-08-28 Laszlo Csirmaz

We show that almost every matroid contains the rank-3 whirl $\mathcal{W}^3$ or the complete-graphic matroid $M(K_4)$ as a minor.

Combinatorics · Mathematics 2021-11-24 Jorn van der Pol

Let $s,n \ge 2$ be integers. We give a qualitative structural description of every matroid $M$ that is spanned by a frame matroid of a complete graph and has no $U_{s,2s}$-minor and no rank-$n$ projective geometry minor, showing that every…

Combinatorics · Mathematics 2016-02-17 Jim Geelen , Peter Nelson

Let $M$ be a 3-connected binary matroid and let $Y(M)$ be the set of elements of $M$ avoiding at least $r(M)+1$ non-separating cocircuits of $M$. Lemos proved that $M$ is non-graphic if and only if $Y(M)\neq\emp$. We generalize this result…

Combinatorics · Mathematics 2012-11-27 João Paulo Costalonga

We consider two-site XXX Heisenberg magnets with different boundary conditions, which are integrable systems on so(4) possessing additional cubic and quartic integrals of motion. The separated variables for these models are constructed…

Exactly Solvable and Integrable Systems · Physics 2009-11-10 A. V. Tsiganov , O. V. Goremykin

We construct an infinite family of simply connected, pairwise nondiffeomorphic 4-manifolds, all homeomorphic to 3CP^2 blown up at 9 points.

Geometric Topology · Mathematics 2007-05-23 Andras I Stipsicz , Zoltan Szabo