1942 search results - page 3 / 389 » Matroids from modules |
EJC
2002
13 years 5 months ago
2002
The Orlik-Solomon algebra of a matroid M is the quotient of the exterior algebra on the points by the ideal (M) generated by the boundaries of the circuits of the matroid. There i...
CORR
2007
Springer
13 years 5 months ago
2007
Springer
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 ...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
Properties of Boolean functions on the hypercube that are invariant with respect to linear transformations of the domain are among some of the most well-studied properties in the ...
JUCS
2007
13 years 5 months ago
2007
: 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...
SODA
2012
ACM
11 years 8 months ago
2012
ACM
The Matroid Secretary Problem, introduced by Babaioff et al. (2007), is a generalization of the Classical Secretary Problem. In this problem, elements from a matroid are presente...