English
Related papers

Related papers: Unavoidable flats in matroids representable over p…

200 papers

Recently, it was proved by B\'erczi and Schwarcz that the problem of factorizing a matroid into rainbow bases with respect to a given partition of its ground set is algorithmically intractable. On the other hand, many special cases were…

Combinatorics · Mathematics 2023-05-30 Florian Hörsch , Tomáš Kaiser , Matthias Kriesell

We show that if the ground set of a matroid can be partitioned into $k\ge 2$ bases, then for any given subset $S$ of the ground set, there is a partition into $k$ bases such that the sizes of the intersections of the bases with $S$ may…

Combinatorics · Mathematics 2025-12-02 Hannaneh Akrami , Siyue Liu , Roshan Raj , László A. Végh

Balogh and Bollob\'as [{\em Combinatorica 25, 2005}] prove that for any $k$ there is a constant $f(k)$ such that any set system with at least $f(k)$ sets reduces to a $k$-star, an $k$-costar or an $k$-chain. They proved $f(k)<(2k)^{2^k}$.…

Combinatorics · Mathematics 2014-09-30 Richard P. Anstee , Linyuan Lu

This article studies two notions of generalized matroid representations motivated by algorithmic information theory and cryptographic secret sharing. The first (entropic representability) involves discrete random variables, while the second…

Combinatorics · Mathematics 2026-05-28 Lukas Kühne , Geva Yashfe

We study the class of 2-dimensional affine k-domains R satisfying ML(R) = k, where k is an arbitrary field of characteristic zero. In particular, we obtain the following result: Let R be a localization of a polynomial ring in finitely many…

Algebraic Geometry · Mathematics 2007-05-23 Daniel Daigle

We study the following Steinberg-type problem on circular coloring: for an odd integer $k\ge 3$, what is the smallest number $f(k)$ such that every planar graph of girth $k$ without cycles of length from $k+1$ to $f(k)$ admits a…

Combinatorics · Mathematics 2020-07-02 Xiaolan Hu , Jiaao Li

We introduce various quantities that can be defined for an arbitrary matroid, and show that certain conditions on these quantities imply that a matroid is not representable over $\mathbb{F}_q$ where $q$ is a prime power. Mostly, for a…

Combinatorics · Mathematics 2023-06-01 J. Sun , S. B. Damelin

A real symmetric matrix $M$ is completely positive semidefinite if it admits a Gram representation by (Hermitian) positive semidefinite matrices of any size $d$. The smallest such $d$ is called the (complex) completely positive semidefinite…

Optimization and Control · Mathematics 2016-10-27 Sander Gribling , David de Laat , Monique Laurent

This article is a survey of matroid theory aimed at algebraic geometers. Matroids are combinatorial abstractions of linear subspaces and hyperplane arrangements. Not all matroids come from linear subspaces; those that do are said to be…

Algebraic Geometry · Mathematics 2014-09-12 Eric Katz

We say that a graph $H$ is planar unavoidable if there is a planar graph $G$ such that any red/blue coloring of the edges of $G$ contains a monochromatic copy of $H$, otherwise we say that $H$ is planar avoidable. I.e., $H$ is planar…

Combinatorics · Mathematics 2018-12-04 Maria Axenovich , Carsten Thomassen , Ursula Schade , Torsten Ueckerdt

If $M$ is a matroid, then a simple matroid $M'$ with the same rank as $M$ is an adjoint of $M$ if there is an inclusion-reversing embedding $\phi$ of the lattice of flats of $M$ into the lattice of flats of $M'$ such that $\phi$ maps the…

Combinatorics · Mathematics 2025-02-25 Kevin Grace

We give the following extension of Barany's colorful Caratheodory theorem: Let M be an oriented matroid and N a matroid with rank function r, both defined on the same ground set V and satisfying rank(M) < rank(N). If every subset A of V…

Combinatorics · Mathematics 2013-09-03 Andreas Holmsen

Let $p\geq 7$ be a prime and $n>1$ be a natural number. We show that there exist infinitely many Galois representations $\varrho:Gal(\bar{\mathbb{Q}}/\mathbb{Q})\rightarrow GL_{n}(\mathbb{Z}_p)$ which are unramified outside $\{p, \infty\}$…

Number Theory · Mathematics 2023-09-08 Anwesh Ray

The natural matroid of an integer polymatroid was introduced to show that a simple construction of integer polymatroids from matroids yields all integer polymatroids. As we illustrate, the natural matroid can shed much more light on integer…

Combinatorics · Mathematics 2024-08-07 Joseph E. Bonin , Carolyn Chun , Tara Fife

Given a separable nonconstant polynomial $f(x)$ with integer coefficients, we consider the set $S$ consisting of the squarefree parts of all the rational values of $f(x)$, and study its behavior modulo primes. Fixing a prime $p$, we…

Number Theory · Mathematics 2014-07-21 David Krumm

It is possible to write the indicator function of any matroid polytope as an integer combination of indicator functions of Schubert matroid polytopes. In this way, every matroid on $n$ elements of rank $r$ can be thought of as a lattice…

Combinatorics · Mathematics 2025-08-14 Luis Ferroni , Alex Fink

We study the following Independent Stable Set problem. Let G be an undirected graph and M = (V(G),I) be a matroid whose elements are the vertices of G. For an integer k\geq 1, the task is to decide whether G contains a set S\subseteq V(G)…

Data Structures and Algorithms · Computer Science 2024-04-08 Fedor V. Fomin , Petr A. Golovach , Tuukka Korhonen , Saket Saurabh

We study canonical models of $\left(\mathbb{Z}/k\mathbb{Z}\right)^n$- covers of the projective line, tamely ramified at exactly $n+1$ points each of index $k$, when $k,n\geq 2$ and the characteristic of the ground field $K$ is either zero…

Algebraic Geometry · Mathematics 2023-04-07 Kostas Karagiannis

We obtained some sufficient and necessary conditions of existence of faithful irreducible representations of a soluble group $G$ of finite rank over a field $k$. It was shown that the existence of such representations strongly depends on…

Group Theory · Mathematics 2012-08-14 A. V. Tushev

In Euclidean Ramsey Theory usually we are looking for monochromatic configurations in the Euclidean space, whose points are colored with a fixed number of colors. In the canonical version, the number of colors is arbitrary, and we are…

Combinatorics · Mathematics 2026-02-03 Panna Gehér , Arsenii Sagdeev , Géza Tóth
‹ Prev 1 4 5 6 7 8 10 Next ›