Related papers: Reconfiguring Ordered Bases of a Matroid
We propose a model for recoverable robust optimization with commitment. Given a combinatorial optimization problem and uncertainty about elements that may fail, we ask for a robust solution that, after the failing elements are revealed, can…
The element splitting operation on a graphic matroid, in general may not yield a cographic matroid. In this paper, we give a necessary and sufficient condition for the graphic matroid to yield cographic matroid under the element splitting…
Parametric model order reduction by matrix interpolation allows for efficient prediction of the behavior of dynamic systems without requiring knowledge about the underlying parametric dependency. Within this approach, reduced models are…
Parametric model order reduction using reduced basis methods can be an effective tool for obtaining quickly solvable reduced order models of parametrized partial differential equation problems. With speedups that can reach several orders of…
We continue the study of Adin, Alon and Roichman [arXiv:2502.14398, 2025] on the number of steps required to sort $n$ labelled points on a circle by transpositions. Imagine that the vertices of a cycle of length $n$ are labelled by the…
For rearranging objects on tabletops with overhand grasps, temporarily relocating objects to some buffer space may be necessary. This raises the natural question of how many simultaneous storage spaces, or "running buffers", are required so…
An ordered labeled tree is a tree in which the nodes are labeled and the left-to-right order among siblings is relevant. The edit distance between two ordered labeled trees is the minimum cost of changing one tree into the other through a…
In this paper, we study how the degrees of the elements in a minimal $\mu$-basis of a parametrized surface behave. For an arbitrary rational surface parametrization $P(s,t)=(a_1(s,t),a_2(s,t),a_3(s,t),a_4(s,t)) \in \mathbb{F}[s,t]^4$ over…
Consider a finite sequence of permutations of the elements 1,...,n, with the property that each element changes its position by at most 1 from any permutation to the next. We call such a sequence a tangle, and we define a move of element i…
Matrix reordering permutes the rows and columns of a matrix to reveal meaningful visual patterns, such as blocks that represent clusters. A comprehensive collection of matrices, along with a scoring method for measuring the quality of…
In this paper, we investigate the importance of column scaling in relating two signed-graphic representations of the same matroid. We used the Sage Mathematics software to generate many examples of signed-graphic matroids and their…
The active bijection for oriented matroids (and real hyperplane arrangements, and graphs, as particular cases) is introduced and investigated by the authors in a series of papers. Given any oriented matroid defined on a linearly ordered…
When considering motion planning for a swarm of $n$ labeled robots, we need to rearrange a given start configuration into a desired target configuration via a sequence of parallel, collision-free robot motions. The objective is to reach the…
Let M to be a matroid defined on a finite set E. A subset L of E is locked in M if L is 2-connected in M, the complement of L is 2-connected in the dual M*, and min{r(L), r*(complement of L)} is greater than 1. In this paper, we prove that…
It is known that a graded lattice of rank n is supersolvable if and only if it has an EL-labelling where the labels along any maximal chain are exactly the numbers 1,2,...,n without repetition. These labellings are called S_n EL-labellings,…
Matrix completion, i.e., the exact and provable recovery of a low-rank matrix from a small subset of its elements, is currently only known to be possible if the matrix satisfies a restrictive structural constraint---known as {\em…
We construct oriented matroids of rank 3 on 13 points whose realization spaces are disconnected. They are defined on smaller points than the known examples with this property. Moreover, we construct the one on 13 points whose realization…
We give a simple polynomial time approximation scheme for the weighted matroid matching problem on strongly base orderable matroids. We also show that even the unweighted version of this problem is NP-complete and not in oracle-coNP.
Border bases can be considered to be the natural extension of Gr\"obner bases that have several advantages. Unfortunately, to date the classical border basis algorithm relies on (degree-compatible) term orderings and implicitly on reduced…
One of the most intriguing unsolved questions of matroid optimization is the characterization of the existence of $k$ disjoint common bases of two matroids. The significance of the problem is well-illustrated by the long list of conjectures…