Sciweavers

EJC
2000
13 years 4 months ago
Cyclic Polytopes and Oriented Matroids
Consider the moment curve in the real Euclidean space Rd defined parametrically by the map : R Rd , t (t) = (t, t2 , . . . , td ). The cyclic d-polytope Cd(t1, . . . , tn) is t...
Raul Cordovil, Pierre Duchet
CPC
2000
65views more  CPC 2000»
13 years 4 months ago
Simple Matroids With Bounded Cocircuit Size
We examine the specialization to simple matroids of certain problems in extremal matroid theory that are concerned with bounded cocircuit size. Assume that each cocircuit of a simp...
Joseph E. Bonin, Talmage James Reid
JUCS
2007
105views more  JUCS 2007»
13 years 4 months ago
Graded Sparse Graphs and Matroids
: Sparse graphs and their associated matroids play an important role in rigidity theory, where they capture the combinatorics of some families of generic minimally rigid structures...
Audrey Lee, Ileana Streinu, Louis Theran
JCT
2007
118views more  JCT 2007»
13 years 4 months ago
Excluding a planar graph from GF(q)-representable matroids
Abstract. We prove that a binary matroid with huge branchwidth contains the cycle matroid of a large grid as a minor. This implies that an infinite antichain of binary matroids ca...
Jim Geelen, Bert Gerards, Geoff Whittle
JCT
2006
110views more  JCT 2006»
13 years 4 months ago
Branch-width, parse trees, and monadic second-order logic for matroids
Abstract. We introduce "matroid parse trees" which, using only a limited amount of information at each node, can build up the vector representations of matroids of bounde...
Petr Hlinený
JCT
2006
79views more  JCT 2006»
13 years 4 months ago
A characterization of cocircuit graphs of uniform oriented matroids
The cocircuit graph of an oriented matroid is the 1-skeleton of the cellular decomposition induced by the Topological Representation Theorem due to Folkman and Lawrence (1978) [J....
Juan José Montellano-Ballesteros, Ricardo S...
JCT
2006
69views more  JCT 2006»
13 years 4 months ago
The Bergman complex of a matroid and phylogenetic trees
We study the Bergman complex B(M) of a matroid M: a polyhedral complex which arises in algebraic geometry, but which we describe purely combinatorially. We prove that a natural su...
Federico Ardila, Caroline J. Klivans
COMBINATORICS
2007
54views more  COMBINATORICS 2007»
13 years 4 months ago
Matroid Automorphisms of the F4 Root System
Let F4 be the root system associated with the 24-cell, and let M(F4) be the simple linear dependence matroid corresponding to this root system. We determine the automorphism group...
Stephanie Fried, Aydin Gerek, Gary Gordon, Andrija...
DM
2006
99views more  DM 2006»
13 years 5 months ago
Bias matroids with unique graphical representations
Given a 3-connected biased graph with three node-disjoint unbalanced circles, at most one of which is a loop, we describe how the bias matroid of is uniquely represented by .
Daniel C. Slilaty
DM
2006
95views more  DM 2006»
13 years 5 months ago
Extending a matroid by a cocircuit
Our main result describes how to extend a matroid so that its ground set is a modular hyperplane of the larger matroid. This result yields a new way to view Dowling lattices and ne...
Joseph E. Bonin