The algebra of throws is a geometric construction which reveals the underlying algebraic operations of addition and multiplication in a projective plane. In Desarguesian projective planes, the algebra of throws is a well-defined, commutative and associative binary operation. However, when we consider an analogous operation in a more general point-line configuration that comes from rank-3 matroids, none of these properties are guaranteed. We construct lists of forbidden configurations which give polynomial time checks for certain properties. Using these forbidden configurations, we can check whether a configuration has a group structure under this analogous operation. We look at the properties of configurations with such a group structure, a...
This chapter treats error-correcting codes and their weight enumerator as the center of several clos...
AbstractGiven a combinatorial geometry (or “matroid”) M, defined on a finite set E, a certain abelia...
Matroids have a wide variety of distinct, cryptomorphic axiom systems that are capable of defining t...
The algebra of throws is a geometric construction which reveals the underlying algebraic operations ...
The algebra of throws is a geometric construction which reveals the underlying algebraic operations ...
The algebra of throws is a geometric construction which reveals the underlying algebraic operations ...
The algebra of throws is a geometric construction which reveals the underlying algebraic operations ...
AbstractThis article deals with algorithmic and structural aspects related to the computer-aided stu...
This paper studies the properties of two kinds of matroids: (a) algebraic matroids and (b) finite an...
Matroids (also called combinatorial geometries) present a strong combinatorial generalization of gra...
AbstractFor a matroid M, define the algebraic characteristic set χA(M) to be the set of field charac...
A recent progress on the complete enumeration of oriented matroids enables us to generate all combin...
We introduce the notion of an arithmetic matroid whose main example is a list of elements of a finit...
ABSTRACT. Every group is the automorphism group of a rank-3 extension of a rank-3 Dowling geometry. ...
AbstractRecently, Goodman et al. have proven two conjectures by Grünbaum right, showing that any arr...
This chapter treats error-correcting codes and their weight enumerator as the center of several clos...
AbstractGiven a combinatorial geometry (or “matroid”) M, defined on a finite set E, a certain abelia...
Matroids have a wide variety of distinct, cryptomorphic axiom systems that are capable of defining t...
The algebra of throws is a geometric construction which reveals the underlying algebraic operations ...
The algebra of throws is a geometric construction which reveals the underlying algebraic operations ...
The algebra of throws is a geometric construction which reveals the underlying algebraic operations ...
The algebra of throws is a geometric construction which reveals the underlying algebraic operations ...
AbstractThis article deals with algorithmic and structural aspects related to the computer-aided stu...
This paper studies the properties of two kinds of matroids: (a) algebraic matroids and (b) finite an...
Matroids (also called combinatorial geometries) present a strong combinatorial generalization of gra...
AbstractFor a matroid M, define the algebraic characteristic set χA(M) to be the set of field charac...
A recent progress on the complete enumeration of oriented matroids enables us to generate all combin...
We introduce the notion of an arithmetic matroid whose main example is a list of elements of a finit...
ABSTRACT. Every group is the automorphism group of a rank-3 extension of a rank-3 Dowling geometry. ...
AbstractRecently, Goodman et al. have proven two conjectures by Grünbaum right, showing that any arr...
This chapter treats error-correcting codes and their weight enumerator as the center of several clos...
AbstractGiven a combinatorial geometry (or “matroid”) M, defined on a finite set E, a certain abelia...
Matroids have a wide variety of distinct, cryptomorphic axiom systems that are capable of defining t...