English
Related papers

Related papers: The Varchenko Determinant for Oriented Matroids

200 papers

In this note we generalize the convolution formula for the Tutte polynomial of Kook-Reiner-Stanton and Etienne-Las Vergnas to a more general setting that includes both arithmetic matroids and delta-matroids. As corollaries, we obtain new…

Combinatorics · Mathematics 2017-04-24 Spencer Backman , Matthias Lenz

We study multiple orthogonal polynomials exploiting their explicit determinantal representation in terms of moments. Our reasoning follows that applied to solve the Hermite-Pad\'{e} approximation and interpolation problems. We study also…

Exactly Solvable and Integrable Systems · Physics 2026-03-17 Adam Doliwa

In this paper, we give a new axioms system based on nonseparable flats with their ranks to define a matroid. We deduce a polynomial time algorithm for deciding if a given matroid (respectively, arbitrary structure) is an uniform matroid.…

Combinatorics · Mathematics 2024-02-15 Brahim Chaourar

The generalised Wronskian of differential order $k\geqslant 1$ for $N$ functions $f_1$, $\ldots$, $f_N$ in $d\geqslant 1$ independent variables $x^1$, $\ldots$, $x^d$ is the determinant of the matrix with these functions' derivatives…

Rings and Algebras · Mathematics 2025-12-24 Arthemy V. Kiselev

We introduce the active partition of the ground set of an oriented matroid perspective (or quotient, or strong map) on a linearly ordered ground set. The reorientations obtained by arbitrarily reorienting parts of the active partition share…

Combinatorics · Mathematics 2018-07-19 Emeric Gioan

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 study higher order determinantal varieties obtained by considering generic $m\times n$ ($m \le n$) matrices over rings of the form $F[t]/(t^k)$, and for some fixed $r$, setting the coefficients of powers of $t$ of all $r \times r$ minors…

Algebraic Geometry · Mathematics 2007-05-23 Tomaz Kosir , B. A. Sethuraman

Matroids give rise to several natural constructions of polytopes. Inspired by this, we examine polytopes that arise from the signed circuits of an oriented matroid. We give the dimensions of these polytopes arising from graphical oriented…

Combinatorics · Mathematics 2025-01-03 Laura Escobar , Jodi McWhirter

Generalizing a theorem of the first two authors and Geelen for planes, we show that, for a real-representable matroid $M$, either the average hyperplane-size in $M$ is at most a constant depending only on its rank, or each hyperplane of $M$…

Combinatorics · Mathematics 2025-09-03 Rutger Campbell , Matthew E. Kroeker , Ben Lund

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.

Data Structures and Algorithms · Computer Science 2011-02-18 José A. Soto

We initiate the axiomatic study of affine oriented matroids (AOMs) on arbitrary ground sets, obtaining fundamental notions such as minors, reorientations and a natural embedding into the frame work of Complexes of Oriented Matroids. The…

Combinatorics · Mathematics 2024-04-09 Emanuele Delucchi , Kolja Knauer

We propose a new algorithm for computing validated bounds for the solutions to the first order variational equations associated to ODEs. These validated solutions are the kernel of numerics computer-assisted proofs in dynamical systems…

Numerical Analysis · Mathematics 2020-10-15 Irmina Walawska , Daniel Wilczak

A (global) determinantal representation of hypersurface in P^n is a matrix, whose entries are linear forms in homogeneous coordinates and whose determinant defines the hypersurface. We study the properties of such representations for…

Algebraic Geometry · Mathematics 2012-09-19 Dmitry Kerner , Victor Vinnikov

In 1993, Csima and Sawyer proved that in a non-pencil arrangement of n pseudolines, there are at least $\frac{6}{13}n$ simple points of intersection. Since pseudoline arrangements are the topological representations of reorientation classes…

Combinatorics · Mathematics 2021-02-01 Lamar Chidiac , Winfried Hochstättler

We give a Las Vegas algorithm which computes the shifted Popov form of an $m \times m$ nonsingular polynomial matrix of degree $d$ in expected $\widetilde{\mathcal{O}}(m^\omega d)$ field operations, where $\omega$ is the exponent of matrix…

Symbolic Computation · Computer Science 2016-05-13 Vincent Neiger

We give new characterizations for the class of uniformly dense matroids and study applications of these characterizations to graphic and real representable matroids. We show that a matroid is uniformly dense if and only if its base polytope…

Combinatorics · Mathematics 2026-02-03 Karel Devriendt , Raffaella Mulas

This paper investigates the question of uniqueness of the reduced oriented matroid structure arising from root systems of a Coxeter group in real vector spaces. We settle the question for finite Coxeter groups, irreducible affine Weyl…

Representation Theory · Mathematics 2017-10-12 Matthew Dyer , Weijia Wang

We extend the Birkhoff's theorem in Lovelock gravity for arbitrary base manifolds using an elementary method. In particular, it is shown that any solution of the form of a warped product of a two-dimensional transverse space and an…

General Relativity and Quantum Cosmology · Physics 2015-09-21 Sourya Ray

The model theory based notion of the first order convergence unifies the notions of the left-convergence for dense structures and the Benjamini-Schramm convergence for sparse structures. It is known that every first order convergent…

Combinatorics · Mathematics 2016-08-16 Frantisek Kardos , Daniel Kral , Anita Liebenau , Lukas Mach

Matroids generalize the familiar notion of linear dependence from linear algebra. Following a brief discussion of founding work in computability and matroids, we use the techniques of reverse mathematics to determine the logical strength of…

Logic · Mathematics 2016-04-19 Jeffry L. Hirst , Carl Mummert