Related papers: Oriented matroid structures on rank 3 root systems

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…

For a matroid with an ordered (or "labelled") basis, a basis exchange step removes one element with label $l$ and replaces it by a new element that results in a new basis, and with the new element assigned label $l$. We prove that one…

In this paper, we show that via a novel construction every rank-3 root system induces a root system of rank 4. Via the Cartan-Dieudonn\'e theorem, an even number of successive Coxeter reflections yields rotations that in a Clifford algebra…

Let w be an elliptic element of the Weyl group of a connected reductive group G. Let X be the set of pairs (g,B) where g is an element of G, B is a Borel subgroup of G and B,gBg^{-1} are in relative position w. Then G acts naturally on X.…

We provide a new axiom system for flag matroids, characterize representability of uniform flag matroids, and give forbidden minor characterizations of full flag matroids that are representable over $\mathbb{F}_2$ and $\mathbb{F}_3$ along…

A (pseudo-)metric $D$ on a finite set $X$ is said to be a `tree metric' if there is a finite tree with leaf set $X$ and non-negative edge weights so that, for all $x,y \in X$, $D(x,y)$ is the path distance in the tree between $x$ and $y$.…

We extend vector configurations to more general objects that have nicer combinatorial and topological properties, called weighted pseudosphere arrangements. These are defined as a weighted variant of arrangements of pseudospheres, as in the…

We study an abstract notion of tree structure which lies at the common core of various tree-like discrete structures commonly used in combinatorics: trees in graphs, order trees, nested subsets of a set, tree-decompositions of graphs and…

Neighborly polytopes are those that maximize the number of faces in each dimension among all polytopes with the same number of vertices. Despite their extremal properties they form a surprisingly rich class of polytopes, which has been…

We describe explicit multiplicative excellent families of rational elliptic surfaces with Galois group isomorphic to the Weyl group of the root lattices E_7 or E_8. The Weierstrass coefficients of each family are related by an invertible…

Consider a matroid $M$ whose ground set is equipped with a labeling to an abelian group. A basis of $M$ is called $F$-avoiding if the sum of the labels of its elements is not in a forbidden label set $F$. H\"orsch, Imolay, Mizutani, Oki,…

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…

The V-systems are special finite sets of covectors which appeared in the theory of the generalized Witten-Dijkgraaf-Verlinde-Verlinde (WDVV) equations. Several families of V-systems are known but their classification is an open problem. We…

We define a multiple Dirichlet series whose group of functional equations is the Weyl group of the affine Kac-Moody root system $\tilde{A}_n$, generalizing the theory of multiple Dirichlet series for finite Weyl groups. The construction is…

We generalize the (signed) Varchenko matrix of a hyperplane arrangement to complexes of oriented matroids and show that its determinant has a nice factorization. This extends previous results on hyperplane arrangements and oriented…

For all positive integers $t$ exceeding one, a matroid has the cyclic $(t-1,t)$-property if its ground set has a cyclic ordering $\sigma$ such that every set of $t-1$ consecutive elements in $\sigma$ is contained in a $t$-element circuit…

We translate the concept of restriction of an arrangement in terms of Hopf algebras. In consequence, every Nichols algebra gives rise to a simplicial complex decorated by Nichols algebras with restricted root systems. As applications, some…

We relate the notion of matroid pathwidth to the minimum trellis state-complexity (which we term trellis-width) of a linear code, and to the pathwidth of a graph. By reducing from the problem of computing the pathwidth of a graph, we show…

The foundation of a matroid is a canonical algebraic invariant which classifies representations of the matroid up to rescaling equivalence. Foundations of matroids are pastures, a simultaneous generalization of partial fields and…

Estimating the linear dimensionality of a data set in the presence of noise is a common problem. However, data may also be corrupted by monotone nonlinear distortion that preserves the ordering of matrix entries but causes linear methods…