Abstract. We show that two naturally occurring matroids representable over Q are equal: the cyclotomic matroid µn represented by the n th roots of unity 1, ζ, ζ 2,..., ζ n−1 inside the cyclotomic extension Q(ζ), and a direct sum of copies of a certain simplicial matroid, considered originally by Bolker in the context of transportation polytopes. A result of Adin leads to an upper bound for the number of Q-bases for Q(ζ) among the n th roots of unity, which is tight if and only if n has at most two odd prime factors. In addition, we study the Tutte polynomial of µn in the case that n has two prime factors. 1
The first author introduced the circuit–cocircuit reversal system of an oriented matroid, and showed...
International audienceWe introduce the notion of arithmetic matroid, whose main example is provided ...
In [8], we have presented the history of auxiliary primes from Legendre’s proof of the quadratic rec...
Abstract. We show that two naturally occurring matroids representable over Q are equal: the cyclotom...
This is the author's accepted manuscript.We show that two naturally occurring matroids representable...
AbstractIn [On Mills's conjecture on matroids with many common bases, Discrete Math. 240 (2001) 271–...
Let b(M) and c(M), respectively, be the number of bases and circuits of a matroid M. For any given m...
AbstractLemos (Discrete Math. 240 (2001) 271–276) proved a conjecture of Mills (Discrete Math. 203 (...
Abstract. De Loera et al. 2009, showed that when the rank is fixed the Ehrhart polynomial of a matro...
We prove that if a matroid M contains two disjoint bases (or, du-ally, if its ground set is the unio...
AbstractIn an earlier paper we defined a class of matroids whose circuit are combinatorial generaliz...
International audienceThe first author introduced the circuit–cocircuit reversal system of an orient...
This thesis considers circular flow-type and circular chromatic-type parameters ($phi$ and $chi$, re...
We consider different ways of describing a matroid to a Turing machine by listing the members of var...
Quirk and Seymour have shown that a connected simple graph has at least as many spanning trees as ci...
The first author introduced the circuit–cocircuit reversal system of an oriented matroid, and showed...
International audienceWe introduce the notion of arithmetic matroid, whose main example is provided ...
In [8], we have presented the history of auxiliary primes from Legendre’s proof of the quadratic rec...
Abstract. We show that two naturally occurring matroids representable over Q are equal: the cyclotom...
This is the author's accepted manuscript.We show that two naturally occurring matroids representable...
AbstractIn [On Mills's conjecture on matroids with many common bases, Discrete Math. 240 (2001) 271–...
Let b(M) and c(M), respectively, be the number of bases and circuits of a matroid M. For any given m...
AbstractLemos (Discrete Math. 240 (2001) 271–276) proved a conjecture of Mills (Discrete Math. 203 (...
Abstract. De Loera et al. 2009, showed that when the rank is fixed the Ehrhart polynomial of a matro...
We prove that if a matroid M contains two disjoint bases (or, du-ally, if its ground set is the unio...
AbstractIn an earlier paper we defined a class of matroids whose circuit are combinatorial generaliz...
International audienceThe first author introduced the circuit–cocircuit reversal system of an orient...
This thesis considers circular flow-type and circular chromatic-type parameters ($phi$ and $chi$, re...
We consider different ways of describing a matroid to a Turing machine by listing the members of var...
Quirk and Seymour have shown that a connected simple graph has at least as many spanning trees as ci...
The first author introduced the circuit–cocircuit reversal system of an oriented matroid, and showed...
International audienceWe introduce the notion of arithmetic matroid, whose main example is provided ...
In [8], we have presented the history of auxiliary primes from Legendre’s proof of the quadratic rec...