English
Related papers

Related papers: The internally 4-connected binary matroids with no…

200 papers

We show if the flow polynomial of a bridgeless graph G has only integral roots, then G is the dual graph to a planar chordal graph. We also show that for 3-connected cubic graphs, the same conclusion holds under the weaker hypothesis that…

Combinatorics · Mathematics 2009-09-11 Joseph P. S. Kung , Gordon F. Royle

In this paper we establish a variation of the Splitter Theorem. Let $M$ and $N$ be simple 3-connected matroids. We say that $x\in E(M)$ is vertically $N$-contractible if $si(M/x)$ is a 3-connected matroid with an $N$-minor. Whittle (for…

Combinatorics · Mathematics 2015-09-02 João Paulo Costalonga

In this paper we prove a conjecture of Bryant, Griffiths, and Yang concerning the characteristic variety for the determined isometric embedding system. In particular, we show that the characteristic variety is not smooth for any dimension…

Differential Geometry · Mathematics 2014-01-17 Qing Han , Marcus Khuri

Molecular chirality is actively researched in a variety of areas of biology, including biochemistry, physiology, pharmacology, etc., and today many chiral compounds are widely known to exhibit biological properties. The molecular structure…

Geometric Topology · Mathematics 2020-05-12 Howon Choi , Hyoungjun Kim , Sungjong No

Matroids are often represented as oracles since there are no unified and compact representations for general matroids. This paper initiates the study of binary decision diagrams (BDDs) and zero-suppressed binary decision diagrams (ZDDs) as…

Combinatorics · Mathematics 2024-04-24 Hiromi Emoto , Yuni Iwamasa , Shin-ichi Minato

This paper explicitly details the relation between $M$-matrices, nonnegative roots of nonnegative matrices, and the embedding problem for finite-state stationary Markov chains. The set of nonsingular nonnegative matrices with arbitrary…

Functional Analysis · Mathematics 2022-11-29 Alexander Van-Brunt

Splitting operation in Matroid Theory does not preserve graphicness, connectedness, cographicness, etc. Also, the splitting of binary gammoid does not necessarily be binary gammoid after splitting. We have characterized a class of graphic…

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

We construct a new type of locally homeomorphic quasiregular mappings in the 3-sphere and discuss their relation to the M.A.Lavrentiev problem, the Zorich map with an essential singularity at infinity, the Fatou's problem and a quasiregular…

Complex Variables · Mathematics 2018-10-17 Boris N. Apanasov

Let ${\bf A}={\bf A}_{n,m,k}$ be a random $n\times m$ matrix over $\mathbf{GF}_2$ wher each column consists of $k$ randomly chosen ones. Let $M$ be an arbirary fixed binary matroid. We show that if $m/n$ and $k$ are sufficiently large then…

Combinatorics · Mathematics 2019-03-13 Colin Cooper , Alan Frieze , Wesley Pegden

Given any connected, open 3-manifold $U$ having finitely many ends, a non-compact 3-manifold $M$ is constructed having the following properties: the interior of $M$ is homeomorphic to $U$; the boundary of $M$ is the disjoint union of…

Geometric Topology · Mathematics 2016-09-06 Robert Myers

Inspired by a recent result of Brakensiek et al. that symmetric tensor matroids and rigidity matroids are linked by matroid duality, we define abstract symmetric tensor matroids as a dual concept to abstract rigidity matroids and establish…

Combinatorics · Mathematics 2025-03-20 Bill Jackson , Shin-ichi Tanigawa

We construct a new family of minimal non-orientable matroids of rank three. Some of these matroids embed in Desarguesian projective planes. This answers a question of Ziegler: for every prime power $q$, find a minimal non-orientable…

Combinatorics · Mathematics 2022-02-22 Rigoberto Florez , David Forge

In this work, we consider matroid theory. After presenting three different (but equivalent) definitions of matroids, we mention some of the most important theorems of such theory. In particular, we note that every matroid has a dual matroid…

High Energy Physics - Theory · Physics 2014-11-18 J. A. Nieto

We prove, by means of an exact structural description, that every simple triangle-free binary matroid $M$ with $|M| > \tfrac{33}{128}2^{r(M)}$ has critical number at most $2$.

Combinatorics · Mathematics 2015-09-09 Rutger Campbell , Jim Geelen , Peter Nelson

For any compact connected submanifold $K$ of $\mathbb{R}^n$, let $\Lambda_K$ denote its unit conormal bundle, which is a Legendrian submanifold of the unit cotangent bundle of $\mathbb{R}^n$. In this paper, we give examples of pairs…

Symplectic Geometry · Mathematics 2026-02-12 Yukihiro Okamoto

If EE is a set of matroids, then ex(EE) denotes the set of matroids that have no minor isomorphic to a member of EE. If EE' is a subset of EE, we say that EE' is /superfluous/ if ex(EE - EE') - ex(EE) contains only finitely many 3-connected…

Combinatorics · Mathematics 2011-11-01 Rhiannon Hall , Dillon Mayhew , Stefan H. M. van Zwam

Let G be a noncyclic group of order 4, and let K be the ring Z of rational integers, the localization of Z at the prime 2 and the ring of 2-adic integers, respectively. We describe, up to conjugacy, all of the indecomposable subgroups in…

Representation Theory · Mathematics 2007-05-23 V. A. Bovdi , V. P. Rudko

Let $M$ be an arbitrary matroid with circuits $\mathcal{C}(M)$. We propose a definition of a derived matroid $\delta M$ that has as its ground set $\mathcal{C}(M)$. Unlike previous attempts of such a definition, our definition applies to…

Combinatorics · Mathematics 2022-12-22 Olga Kuznetsova , Ragnar Freij-Hollanti , Relinde Jurrius

A graph is chordal if every cycle of length at least four has a chord. In 1961, Dirac characterized chordal graphs as those graphs that can be built from complete graphs by repeated clique-sums. Generalizing this, we consider the class of…

Combinatorics · Mathematics 2024-05-03 James Dylan Douthitt , James Oxley

We associate to every matroid M a polynomial with integer coefficients, which we call the Kazhdan-Lusztig polynomial of M, in analogy with Kazhdan-Lusztig polynomials in representation theory. We conjecture that the coefficients are always…

Combinatorics · Mathematics 2016-07-04 Ben Elias , Nicholas Proudfoot , Max Wakefield