Related papers: Symmetric Tensor Matroids, Dual Rigidity Matroids,…
The famous Braess paradox describes the following phenomenon: It might happen that the improvement of resources, like building a new street within a congested network, may in fact lead to larger costs for the players in an equilibrium. In…
Blasiak verified a conjecture of White for graphic matroids by showing that the toric ideal of a graphic matroid is generated by quadrics. In this paper, we extend this result to frame matroids satisfying a linearity condition. Such classes…
Geelen, Gerards, and Whittle [3] announced the following result: let $q = p^k$ be a prime power, and let $\mathcal{M}$ be a proper minor-closed class of $\mathrm{GF}(q)$-representable matroids, which does not contain $\mathrm{PG}(r-1,p)$…
A matroid is a machine capturing linearity of mathematical objects and producing combinatorial structures. Matroid structure arises everywhere since linearity is a ubiquitous concept. One natural way to obtain matroids is by considering…
For a matroid $M$, an element $e$ such that both $M\backslash e$ and $M/e$ are regular is called a regular element of $M$. We determine completely the structure of non-regular matroids with at least two regular elements. Besides four small…
Starting from the definition of a stiffness matrix, the authors present a new formulation of the Cartesian stiffness matrix of parallel mechanisms. The proposed formulation is more general than any other stiffness matrix found in the…
We explore various aspects of implementing the full M-theory U-duality group E_{d+1}, and thus Lorentz invariance, in the finite N matrix theory (DLCQ of M-theory) on d-tori: (1) We generalize the analysis of U-duality orbits of BPS states…
In this paper we study the number of $k$-neighborly reorientations of an oriented matroid, leading to study $k$-Roudneff's conjecture, the case $k=1$ being the original statement conjectured in 1991. We first prove the conjecture for the…
Matroid intersection is a classical optimization problem where, given two matroids over the same ground set, the goal is to find the largest common independent set. In this paper, we show that there exists a certain "sparsifer": a subset of…
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…
Inspired by Kontsevich's graphic orbifold Euler characteristic we define a virtual Euler characteristic for any finite set of isomorphism classes of matroids of rank $r$. Our main result provides a simple formula for the virtual Euler…
A symmetric tensor is a higher order generalization of a symmetric matrix. In this paper, we study various properties of symmetric tensors in relation to a decomposition into a sum of symmetric outer product of vectors. A rank-1 order-k…
For matroids M and N on disjoint sets S and T, a semidirect sum of M and N is a matroid K on the union of S and T that, like the direct sum and the free product, has the restriction of K to S equal to M and the contraction of K to T equal…
We construct $(2n)^2\times (2n)^2$ unitary braid matrices $\hat{R}$ for $n\geq 2$ generalizing the class known for $n=1$. A set of $(2n)\times (2n)$ matrices $(I,J,K,L)$ are defined. $\hat{R}$ is expressed in terms of their tensor products…
It has been conjectured that asymptotically almost all matroids are sparse paving, i.e. that $s(n) \sim m(n)$, where $m(n)$ denotes the number of matroids on a fixed groundset of size $n$, and $s(n)$ the number of sparse paving matroids. In…
The notion of thin sums matroids was invented to extend the notion of representability to non-finitary matroids. A matroid is tame if every circuit-cocircuit intersection is finite. We prove that a tame matroid is a thin sums matroid over a…
A subset $S$ of $\mathbb R^d$ has the Borsuk property if it can be decomposed into at most $d+1$ parts of diameter smaller than $S$. This is an important geometric property, inspired by a conjecture of Borsuk from the 1930s, which has…
We study the combinatorial, algebraic and geometric properties of the free product operation on matroids. After giving cryptomorphic definitions of free product in terms of independent sets, bases, circuits, closure, flats and rank…
We give a combinatorial characterization of generic frameworks that are minimally rigid under the additional constraint of maintaining symmetry with respect to a finite order rotation or a reflection. To establish these results we develop a…
Let $\mathfrak{g}$ be a symmetrizable Kac-Moody algebra, $U_q(\mathfrak{g})$ its quantum group, and $U_q(\mathfrak{k}) \subset U_q(\mathfrak{g})$ a quantum symmetric pair subalgebra determined by a Lie algebra automorphism $\theta$. We…