Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2610.32798

Proximity Theorem and FPT Algorithm for Minimum Group-labeled Matroid Bases

Siyue Liu·Taihei Oki·Chao Xu
View original source ↗Read source document ↗Export metadata ↓

Abstract

Let $M$ be a matroid, let $\ell:E(M)\to G$ be a labeling of its elements by an abelian group, and let $F\subseteq G$ be finite. A base is $F$-avoiding if the label sum of its elements is not in $F$. We prove that, for arbitrary costs, a min-cost $F$-avoiding base can be obtained from any min-cost base using at most $|F|$ exchanges. This resolves the weighted proximity conjecture by Hörsch, Imolay, Mizutani, Oki, and Schwarcz. Our main technical tool is to replace the assumption of Schrijver--Seymour Conjecture in Liu and Xu's earlier work with Kemperman--Scherk Theorem. The proximity theorem combined with approaches in earlier work gives an FPT algorithm that finds a min-cost $F$-avoiding base parameterized by $|G|$. We additionally give an FPT algorithm parameterized by $|F|$, answering a question of Hörsch et al.

Explore related subjects

math.COcs.DS

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Siyue Liu, Taihei Oki, Chao Xu. 2026-10-23. Proximity Theorem and FPT Algorithm for Minimum Group-labeled Matroid Bases. https://arxiv.org/abs/2610.32798

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

The evolution of random subgraphs of the permutahedron

In their seminal paper introducing the theory of random graphs, Erdős and Rényi considered the evolution of the structure of a random subgraph of $K_n$ as the density increases from $0$ to $1$, identifying two key points in this evolution -- the percolation threshold, where the order of the largest component seemingly jumps from logarithmic to linear in size, and the connectivity threshold, where the subgraph becomes connected. Similar phenomena have been observed in many other random graph models, and in particular, works of Ajtai, Komlós and Szemerédi and of Erdős and Spencer determine corresponding thresholds for random subgraphs of the hypercube. The permutahedron, like the hypercube, has many equivalent representations, and arises as a natural object of study in many areas of combinatorics. In particular, as a highly-symmetric simple polytope, like the $n$-simplex and $n$-cube, percolation on the permutahedron arises naturally as an analogue to the Erdős-Rényi random graph and the percolated hypercube. We determine the percolation threshold and the connectivity threshold for random subgraphs of the permutahedron. Along the way we develop a novel graph exploration technique which can be used to find exponentially large clusters after percolation in high-dimensional geometric graphs, and we initiate the study of the isoperimetric properties of the permutahedron.

math.CO↗
arXiv2026

Chromatic Ramsey numbers and two-color Turán densities

Given a graph $G$, its $2$-color Turán number $\mathrm{ex}^{(2)}(n,G)$ is the maximum number of edges in an $n$-vertex graph, such that the edges can be colored with two colors avoiding a monochromatic copy of $G$. Let $π^{(2)}(G)=\lim_{n\to\infty}\mathrm{ex}^{(2)}(n,G)/\binom{n}{2}$ be the $2$-color Turán density of $G$. What real numbers in the interval $(0,1)$ are realized as the $2$-color Turán density of some graph? It is known that $π^{(2)}(G)=1-(R_χ(G)-1)^{-1}$, where $R_χ(G)$ is the chromatic Ramsey number of $G$. Burr, Erdős, and Lovász showed that $(k-1)^2+1\leq{R_χ(G)}\leq{R(k)}$, for any $k$-chromatic graph $G$, where $R(k)$ is the classical Ramsey number. However, it is an open problem to determine how many distinct values between $(k-1)^{2}+1$ and $R(k)$ can be realized as $R_χ(G)$ of some $k$-chromatic graph $G$ for general $k$. In this paper, among others, we prove that there are $Ω(k)$ different values of $R_χ(G)$ among $k$-chromatic graphs $G$. This sheds more light onto the possible $2$-color Turán densities of graphs.

math.CO↗
arXiv2026

Subset selection problems in planar point sets

Given a finite point set satisfying condition $\mathcal{A}$, the subset selection problem asks, how large of a subset satisfying condition $\mathcal{B}$ can be extracted? In this paper, we make progress on three instances of subset selection problems in planar point sets. Let $n,s\in\mathbb{N}$ with $n\geq s$, and let $P\subseteq\mathbb{R}^2$ be a set of $n$ points, where at most $s$ points lie on the same line. Firstly, we select a general position subset of $P$. This problem was proposed by Erdős under the regime when $s$ is a constant. For $s$ being non-constant, we give new lower and upper bounds on the maximum size of such a subset. In particular, we show that in the worst case such a set can have size at most $O(n^{5/6+o(1)}/\sqrt{s})$ when $3\leq s\leq n^{1/3}$ and $O(n/s)$ when $n^{1/3}\leq s\leq n$. Secondly, we select a monotone general position subset of $P$, that is, a subset in general position where the points are ordered from left to right and their $y$-coordinates are either non-decreasing or non-increasing. We present bounds on the maximum size of such a subset. In particular, when $s=Ω(\sqrt{n})$, our upper and lower bounds differ at most by a logarithmic factor. Lastly, we select a subset of $P$ with pairwise distinct slopes. This problem was initially studied by Erdős, Graham, Ruzsa, and Taylor on the grid. We show that for $s=O(\sqrt{n})$ such a subset of size $Ω((n/\log{s})^{1/3})$ can always be found in $P$. When $s=Θ(\sqrt{n})$, this matches a lower bound given by Zhang on the grid. As for the upper bound, we show that in the worst case such a subset has size at most $O(\sqrt{n})$ for $2\leq s\leq n^{3/8}$ and $O((n/s)^{4/5})$ for $n^{3/8}\leq s=O(\sqrt{n})$. The proofs use a wide range of tools such as incidence geometry, probabilistic methods, the hypergraph container method, and additive combinatorics.

math.CO↗