English
Related papers

Related papers: Computing excluded minors for classes of matroids …

200 papers

We investigate quotients by radical monomial ideals for which $T^2$, the second cotangent cohomology module, vanishes. The dimension of the graded components of $T^2$, and thus their vanishing, depends only on the combinatorics of the…

We show that a simple rank-$r$ matroid with no $(t+1)$-element independent flat has at least as many elements as the matroid $M_{r,t}$ defined as the direct sum of $t$ binary projective geometries whose ranks pairwise differ by at most $1$.…

Combinatorics · Mathematics 2020-11-13 Peter Nelson , Sergey Norin

Generalizing a well known theorem for finite matroids, we prove that for every (infinite) connected matroid M there is a unique tree T such that the nodes of T correspond to minors of M that are either 3-connected or circuits or cocircuits,…

Combinatorics · Mathematics 2015-06-08 Elad Aigner-Horev , Reinhard Diestel , Luke Postle

While dealing with the nontrivial task of classifying Mueller matrices, of special interest is the study of the degenerate Mueller matrices (matrices with vanishing determinant, for which the law of multiplication holds, but there exists no…

General Mathematics · Mathematics 2014-11-12 O. Veko , E. Ovsiyuk , A. Oana , M. Neagu , V. Balan , V. Red'kov

We introduce a module-theoretic approach and a linear-programming method to compute the matricial dimension of numerical semigroups. We use these to compute the matricial dimension of every numerical semigroup with Frobenius number at most…

Combinatorics · Mathematics 2025-10-20 Theo Chinn , Junshu Feng , Stephan Ramon Garcia , Peiting Jiang

We show that for any regular matroid on $m$ elements and any $\alpha \geq 1$, the number of $\alpha$-minimum circuits, or circuits whose size is at most an $\alpha$-multiple of the minimum size of a circuit in the matroid is bounded by…

Data Structures and Algorithms · Computer Science 2018-11-21 Rohit Gurjar , Nisheeth K. Vishnoi

An 'induced restriction' of a simple binary matroid $M$ is a restriction $M|F$, where $F$ is a flat of $M$. We consider the class $\mathcal{M}$ of all simple binary matroids $M$ containing neither a free matroid on three elements (which we…

Combinatorics · Mathematics 2019-11-14 Marthe Bonamy , Frantisek Kardos , Tom Kelly , Peter Nelson , Luke Postle

Maximizing monotone submodular functions under a matroid constraint is a classic algorithmic problem with multiple applications in data mining and machine learning. We study this classic problem in the fully dynamic setting, where elements…

Data Structures and Algorithms · Computer Science 2025-05-26 Paul Dütting , Federico Fusco , Silvio Lattanzi , Ashkan Norouzi-Fard , Morteza Zadimoghaddam

A laminar family is a collection $\mathscr{A}$ of subsets of a set $E$ such that, for any two intersecting sets, one is contained in the other. For a capacity function $c$ on $\mathscr{A}$, let $\mathscr{I}$ be $\{I:|I\cap A| \leq…

Combinatorics · Mathematics 2016-06-28 Tara Fife , James Oxley

The Theta rank of a finite point configuration $V$ is the maximal degree necessary for a sum-of-squares representation of a non-negative linear function on $V$. This is an important invariant for polynomial optimization that is in general…

Combinatorics · Mathematics 2016-11-04 Francesco Grande , Raman Sanyal

We show for each positive integer $a$ that, if $\cM$ is a minor-closed class of matroids not containing all rank-$(a+1)$ uniform matroids, then there exists an integer $n$ such that either every rank-$r$ matroid in $\cM$ can be covered by…

Combinatorics · Mathematics 2012-09-10 Jim Geelen , Peter Nelson

We give an algorithm to compute representatives of the conjugacy classes of semisimple square integral matrices with given minimal and characteristic polynomials. We also give an algorithm to compute the $\mathbb{F}_q$-isomorphism classes…

Number Theory · Mathematics 2025-02-28 Stefano Marseglia

We give polynomial-time randomized algorithms for computing the girth and the cogirth of binary matroids that are low-rank perturbations of graphic matroids.

Combinatorics · Mathematics 2015-10-15 Jim Geelen , Rohan Kapadia

One of the main goals of design theory is to classify, characterize and count various combinatorial objects with some prescribed properties. In most cases, however, one quickly encounters a combinatorial explosion and even if the complete…

Combinatorics · Mathematics 2012-04-24 Ferenc Szöllősi

In this paper we compute the minimum degree of a faithful representation by partial transformations of a finite semigroup admitting a faithful completely reducible matrix representation over the field of complex numbers. This includes all…

Group Theory · Mathematics 2023-06-12 Stuart Margolis , Benjamin Steinberg

We construct the smallest Ree-Tits unital from a group of matrices that is isomorphic to the commutator group of the corresponding Ree group. The matrix description is used to determine configurations in the unital via explicit…

Group Theory · Mathematics 2025-06-04 Markus Johannes Stroppel

An analogue of the Euclidean algorithm for square matrices of size 2 with integral non-negative entries and strictly positive determinant $n$ defines a finite set $\mathcal{R}(n)$ of Euclid-reduced matrices corresponding to elements of…

Number Theory · Mathematics 2022-09-21 Roland Bacher

A vanishing sum of roots of unity is called minimal if no proper, nonempty sub-sum of it vanishes. This paper classifies all minimal vanishing sums of roots of unity of weight at most 16 by hand, thereby uncovering new phenomena beyond the…

Number Theory · Mathematics 2025-12-18 Louis Christie , Kenneth J. Dykema , Igor Klep

We provide a full classification of all families of matroids that are closed under duality and minors, and for which the Tutte polynomial is a universal valuative invariant. There are four inclusion-wise maximal families, two of which are…

Combinatorics · Mathematics 2025-02-10 Luis Ferroni , Benjamin Schröter

We show how to obtain all nonassociative Moufang loops of order less than 64 and 4262 nonassociative Moufang loops of order 64 in a unified way. We conjecture that there are no other nonassociative Moufang loops of order 64. The main idea…

Group Theory · Mathematics 2007-05-23 Petr Vojtěchovský