English
Related papers

Related papers: The natural matroid of an integer polymatroid

200 papers

It is shown that the set of palindromes is an additive basis for the natural numbers in any base. Specifically, we prove that every natural number can be expressed as the sum of $O(d)$ palindromes in base $d$.

Number Theory · Mathematics 2022-04-19 Yu Gao

The effect of replacing a basis element on the way the basis spans other elements is studied. This leads to a new characterization of binary matroids.

Combinatorics · Mathematics 2012-03-02 Daniel Kotlar

For a lattice polytope $P$, the rank of $P$ is defined by $F-(\dim P+1)$, where $F$ is the number of facets of $P$. In this paper, we study matroid polytopes with small rank. More precisely, we characterize matroid independence polytopes…

Combinatorics · Mathematics 2025-03-31 Masato Konoike , Koji Matsushita

We show that, for any prime $p$ and integer $k \geq 2$, a simple GF($p$)-representable matroid with sufficiently high rank has a rank-$k$ flat which is either independent in $M$, or is a projective or affine geometry. As a corollary we…

Combinatorics · Mathematics 2023-09-28 Jim Geelen , Matthew E. Kroeker

In this article, the ring of polynomials is studied in a systematic way through the theory of monoid rings. As a consequence, this study provides natural and canonical approaches in order to find easy and rigorous proofs and methods for…

Commutative Algebra · Mathematics 2018-02-23 Abolfazl Tarizadeh

We characterize the shifted simple graphs and the $3$-uniform shifted hypergraphs whose inverse image under exterior shifting is the set of bases of a matroid: those are exactly the hypergraphs whose hyperedges form an initial lex-segment.…

Combinatorics · Mathematics 2025-12-04 Lazar Guterman , Eran Nevo

In this article, we prove that every integer can be written as an integer combination of exactly 4 tetrahedral numbers. Moreover, we compute the modular periodicity of platonic numbers.

Number Theory · Mathematics 2019-04-08 Maya Mohsin Ahmed

We give a fully polynomial-time randomised approximation scheme (FPRAS) for the number of bases in a bicircular matroids. This is a natural class of matroids for which counting bases exactly is #P-hard and yet approximate counting can be…

Data Structures and Algorithms · Computer Science 2021-01-27 Heng Guo , Mark Jerrum

We introduce delta-graphic matroids, which are matroids whose bases form graphic delta-matroids. The class of delta-graphic matroids contains graphic matroids as well as cographic matroids and is a proper subclass of the class of regular…

Combinatorics · Mathematics 2022-10-05 Duksang Lee , Sang-il Oum

The Tutte polynomial for matroids is not directly applicable to polymatroids. For instance, deletion-contraction properties do not hold. We construct a polynomial for polymatroids which behaves similarly to the Tutte polynomial of a…

Combinatorics · Mathematics 2016-04-05 Amanda Cameron , Alex Fink

We show the existence of several infinite monochromatic patterns in the integers obtained as values of suitable symmetric polynomials. The simplest example is the following. For every finite coloring of the natural numbers…

Combinatorics · Mathematics 2022-02-16 Mauro Di Nasso

Matrices over the ring of formal power series are considered. Normal forms with respect to various sub-groups of the two-sided transformations are constructed. The construction is based on the special property of the action: it induces a…

Representation Theory · Mathematics 2010-11-04 Genrich Belitskii , Dmitry Kerner

It is well known that linear rank-metric codes give rise to q-polymatroids. Analogously to matroid theory one may ask whether a given q-polymatroid is representable by a rank-metric code. We provide an answer by presenting an example of a…

Information Theory · Computer Science 2022-03-14 Heide Gluesing-Luerssen , Benjamin Jany

This paper introduces Dirichlet matroids, a generalization of graphic matroids arising from electrical networks. We present four main theorems. First, we exhibit a matroid quotient involving geometric duals of networks embedded in surfaces…

Combinatorics · Mathematics 2022-06-02 Bob Lutz

A matroid is $\text{GF}(q)$-regular if it is representable over all proper superfields of the field $\text{GF}(q)$. We show that, for highly connected matroids having a large projective geometry over $\text{GF}(q)$ as a minor, the property…

Combinatorics · Mathematics 2014-01-29 Peter Nelson , Stefan H. M. van Zwam

There are many similarities between the theories of matroids and $q$-matroids. However, when dealing with the direct sum of $q$-matroids many differences arise. Most notably, it has recently been shown that the direct sum of representable…

Combinatorics · Mathematics 2026-03-11 Gianira N. Alfarano , Relinde Jurrius , Alessandro Neri , Ferdinando Zullo

The foundation of a matroid is a canonical algebraic invariant which classifies representations of the matroid up to rescaling equivalence. Foundations of matroids are pastures, a simultaneous generalization of partial fields and…

Combinatorics · Mathematics 2020-08-04 Matthew Baker , Oliver Lorscheid

A new connection between two different necessary conditions for a polymatroid to be linearly representable is presented. Specifically, we prove that the existence of a tensor product with the uniform matroid of rank two on three elements…

Combinatorics · Mathematics 2025-02-20 Carles Padró

We prove that a monomial ideal $I$ generated in a single degree, is polymatroidal if and only if it has linear quotients with respect to the lexicographical ordering of the minimal generators induced by every ordering of variables. We also…

Commutative Algebra · Mathematics 2018-08-21 Somayeh Bandari , Rahim Rahmati-Asghar

In this paper we extend the theory of oriented matroids to Lagrangian orthogonal matroids and their representations, and give a completely natural transformation from a representation of a classical oriented matroid to a representation of…

Combinatorics · Mathematics 2007-05-23 Richard F. Booth
‹ Prev 1 4 5 6 7 8 10 Next ›