Search engine for discovering works of Art, research articles, and books related to Art and Culture
Javascript must be enabled to continue!
Combinatorial Cremona automorphisms and Coxeter arrangement matroids
View through CrossRef
Abstract
We explore birational geometry of matroids by investigating automorphisms of their coarse Bergman fans. Combinatorial Cremona maps provide such automorphisms of Bergman fans which are not induced by matroid automorphisms. We investigate the structure of matroids allowing combinatorial Cremona maps and prove a realizability criterion in the presence of two different Cremonas. We also prove that for all matroids associated to Coxeter arrangements the group of coarse automorphisms of the Bergman fan is generated by the matroid automorphisms and at most one combinatorial Cremona map.
Springer Science and Business Media LLC
Title: Combinatorial Cremona automorphisms and Coxeter arrangement matroids
Description:
Abstract
We explore birational geometry of matroids by investigating automorphisms of their coarse Bergman fans.
Combinatorial Cremona maps provide such automorphisms of Bergman fans which are not induced by matroid automorphisms.
We investigate the structure of matroids allowing combinatorial Cremona maps and prove a realizability criterion in the presence of two different Cremonas.
We also prove that for all matroids associated to Coxeter arrangements the group of coarse automorphisms of the Bergman fan is generated by the matroid automorphisms and at most one combinatorial Cremona map.
Related Results
Chordality in Matroids: In Search of the Converse to Hliněný's Theorem
Chordality in Matroids: In Search of the Converse to Hliněný's Theorem
<p>Bodlaender et al. [7] proved a converse to Courcelle's Theorem for graphs [15] for the class of chordal graphs of bounded treewidth. Hliněný [25] generalised Courcelle's T...
On analogs of Cremona automorphisms for matroid fans
On analogs of Cremona automorphisms for matroid fans
Matroids are combinatorial objects that generalize linear independence. A matroid can be represented geometrically by its Bergman fan and we compare the symmetries of these two obj...
Conjugacy of Coxeter Elements
Conjugacy of Coxeter Elements
For a Coxeter group $(W,S)$, a permutation of the set $S$ is called a Coxeter word and the group element represented by the product is called a Coxeter element. Moving the first l...
Non-representable hyperbolic matroids
Non-representable hyperbolic matroids
The generalized Lax conjecture asserts that each hyperbolicity cone is a linear slice of the cone of positive semidefinite matrices. Hyperbolic polynomials give rise to a class of ...
Matroids, Cyclic Flats, and Polyhedra
Matroids, Cyclic Flats, and Polyhedra
<p>Matroids have a wide variety of distinct, cryptomorphic axiom systems that are capable of defining them. A common feature of these is that they are able to be efficiently ...
Covering Cycle Matroid
Covering Cycle Matroid
Covering is a type of widespread data representation while covering-based rough sets provide an efficient and systematic theory to deal with this type of data. Matroids are based o...
Pythagorean Fuzzy Matroids with Application
Pythagorean Fuzzy Matroids with Application
The Pythagorean fuzzy models deal with graphical and algebraic structures in case of vague information related to membership and non-membership grades. Here, we use Pythagorean fuz...
A Combinatorial Formula for Kazhdan-Lusztig Polynomials of $\rho$-Removed Uniform Matroids
A Combinatorial Formula for Kazhdan-Lusztig Polynomials of $\rho$-Removed Uniform Matroids
Let $\rho$ be a non-negative integer. A $\rho$-removed uniform matroid is a matroid obtained from a uniform matroid by removing a collection of $\rho$ disjoint bases. We present a ...