English
Related papers

Related papers: Fan-extensions in fragile matroids

200 papers

In this study, all rings are commutative with non-zero identity and all modules are considered to be unital. Let $M$ be a left $R$-module. A proper submodule $N$ of $M$ is called an $S$-$weakly$ $prime$ submodule if $0_{M}\neq f(m)\in N$…

Commutative Algebra · Mathematics 2020-05-19 Emel Aslankarayigit Ugurlu

Let (M,F) be a closed manifold with a Riemannian foliation. We show that the secondary characteristic classes of the Molino's commuting sheaf of (M,F) vanish if (M,F) is developable and the fundamental group of M is of polynomial growth. By…

Differential Geometry · Mathematics 2010-09-07 Hiraku Nozawa

This is a study of weakly integral braided fusion categories with elementary fusion rules to determine which possess nondegenerately braided extensions of theoretically minimal dimension, or equivalently in this case, which satisfy the…

Quantum Algebra · Mathematics 2021-09-10 Andrew Schopieray

The singleton and doubleton minors of a polymatroid $\rho$ encode a surprising amount of information about the structural complexity of $\rho$. Given any polymatroid $\rho$, we can subtract from it a maximally-separated polymatroid,…

Combinatorics · Mathematics 2023-12-01 Fiona Young

In this paper we introduce a $q$-analogue of the single-element extensions of matroids for $q$-matroids, which we call one-dimensional extensions. To enumerate such extensions, we define a $q$-analogue of modular cuts and define a certain…

Combinatorics · Mathematics 2025-11-17 Koji Imamura , Shinya Kawabuchi , Keisuke Shiromoto

A number of properties of spherical Artin groups extend to Garside groups, defined as the groups of fractions of monoids where least common multiples exist, there is no nontrivial unit, and some additional finiteness conditions are…

Group Theory · Mathematics 2007-05-23 Patrick Dehornoy

We call an oriented matroid Mandel if it has an extension in general position which makes all programs with that extension Euclidean. If $L$ is the minimum number of mutations adjacent to an element of the groundset, we call an oriented…

Combinatorics · Mathematics 2025-02-20 Michael Wilhelmi

We study weaker variations of the property of flatness in matroid theory. We show that these variations form a chain of increasingly stronger properties all implying pseudomodularity on its lattice of flats. We show examples in the gammoid…

Combinatorics · Mathematics 2018-01-24 Jorge Alberto Olarte

For a matroid of rank $r$ and a non-negative integer $k$, an element is called $k$-loose if every circuit containing it has size greater than $r-k$. Zaslavsky and the author characterized all binary matroids with a $1$-loose element. In…

Combinatorics · Mathematics 2025-03-17 Jagdeep Singh

Let M be a closed manifold and f be a diffeomorphism on M. We show that if f has a nontrivial dominated splitting TM=E\oplus F, then f can not be minimal. The proof mainly use Mane's argument and Liao's selecting lemma.

Dynamical Systems · Mathematics 2024-04-02 Pengfei Zhang

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

Let AG(3,2)xU(1,1) denote the binary matroid obtained from the direct sum of AG(3,2) and a coloop by completing the 3-point lines between every element in AG(3,2) and the coloop. We prove that every internally 4-connected binary matroid…

Combinatorics · Mathematics 2012-02-20 Dillon Mayhew , Gordon Royle

An affine tropical fan is called regular if it supports a reduced 0-dimensional complete intersection. For some cases the classification of regular fans is already complete. It was proved by Fink that tropical varieties of degree 1 are…

Combinatorics · Mathematics 2025-12-19 Linxuan Li

Homogeneous matroids are characterized by the property that strength equals fractional arboricity, and arise in the study of base modulus [22]. For graphic matroids, Cunningham [9] provided efficient algorithms for calculating graph…

Combinatorics · Mathematics 2024-08-02 Huy Truong , Pietro Poggi-Corradini

Let $\cM$ be a minor-closed class of matroids that does not contain arbitrarily long lines. The growth rate function, $h:\bN\rightarrow \bN$ of $\cM$ is given by $$h(n) = \max(|M|\, : \, M\in \cM, simple, rank-$n$).$$ The Growth Rate…

Combinatorics · Mathematics 2011-11-01 Jim Geelen , Peter Nelson

In this paper we discuss the boundedness of the Fatou components for the sine family and the extended sine family, mainly when the parameter \lambda has modulus greater than 1 and the map is post-critically bounded.

Dynamical Systems · Mathematics 2019-10-24 F. R. Martinez , G. Sienra

When massless particles are involved, the traditional scattering matrix ($S$-matrix) does not exist: it has no rigorous non-perturbative definition and has infrared divergences in its perturbative expansion. The problem can be traced to the…

High Energy Physics - Theory · Physics 2023-02-01 Holmfridur Hannesdottir , Matthew D. Schwartz

We consider a finite-dimensional vector space $W\subset K^E$ over an arbitrary field $K$ and an arbitrary set $E$. We show that the set $C(W)\subset 2^E$ consisting of the minimal supports of $W$ are the circuits of a matroid on $E$. In…

One characterization of binary matroids is that the symmetric difference of every pair of intersecting circuits is a disjoint union of circuits. This paper considers circuit-difference matroids, that is, those matroids in which the…

Combinatorics · Mathematics 2020-08-11 George Drummond , Tara Fife , Kevin Grace , James Oxley

For all positive integers $s$ and $t$ exceeding one, a matroid $M$ on $n$ elements is {\em nearly $(s, t)$-cyclic} if there is a cyclic ordering $\sigma$ of its ground set such that every $s-1$ consecutive elements of $\sigma$ are contained…

Combinatorics · Mathematics 2022-06-24 Nick Brettell , Charles Semple , Gerry Toft