33 citations · 95 across the 14 of their papers we have counts for
14 papers · 1 filter
Counting q-Matroids
Benjamin Jany, Relinde Jurrius, Rudi Pendavingh
-Matroids, a -analogue of classical matroids have attracted a lot of attention over the last decade, yet their enumeration remains largely unexplored. In this paper, we study…
The incidence matrix of a -ary graph
Michela Ceria, Relinde Jurrius
In this preprint we discuss a definition of a -ary graph. Furthermore, we describe how to make an incidence matrix for it, with an eye on the corresponding -matroid.
Representability of the direct sum of uniform q-matroids
Gianira N. Alfarano, Relinde Jurrius, Alessandro Neri +1
There are many similarities between the theories of matroids and -matroids. However, when dealing with the direct sum of -matroids many differences arise. Most notably, it ha…
A q-analogue of delta-matroids and related concepts
Michela Ceria, Trygve Johnsen, Relinde Jurrius
We define and study q-delta-matroids, and q-g-matroids. These objects are analogues, for finite-dimensional vector spaces over finite fields, of delta-matroids and g-matroids arisi…
Alternatives for the -matroid axioms of independent spaces, bases, and spanning spaces
Michela Ceria, Relinde Jurrius
It is well known that in q-matroids, axioms for independent spaces, bases, and spanning spaces differ from the classical case of matroids, since the straightforward q-analogue of t…
Combinatorial Derived Matroids
Olga Kuznetsova, Ragnar Freij-Hollanti, Relinde Jurrius
Let be an arbitrary matroid with circuits . We propose a definition of a derived matroid that has as its ground set . Unlike previous attem…
The direct sum of -matroids
Michela Ceria, Relinde Jurrius
For classical matroids, the direct sum is one of the most straightforward methods to make a new matroid out of existing ones. This paper defines a direct sum for -matroids, the…
Weighted Subspace Designs from -Polymatroids
Eimear Byrne, Michela Ceria, Sorina Ionica +1
The Assmus-Mattson theorem gives a way to identify block designs arising from codes. This result was broadened to matroids and weighted designs. In this work we present a further t…
Constructions of New q-Cryptomorphisms
Eimear Byrne, Michela Ceria, Relinde Jurrius
In the theory of classical matroids, there are several known equivalent axiomatic systems that define a matroid, which are described as matroid cryptomorphisms. A q-matroid is a q-…
Constructions of new matroids and designs over GF(q)
Eimear Byrne, Michela Ceria, Sorina Ionica +2
A perfect matroid design (PMD) is a matroid whose flats of the same rank all have the same size. In this paper we introduce the q-analogue of a PMD and its properties. In order to…
The Tutte q-Polynomial
Guus Bollen, Henry Crapo, Relinde Jurrius
-Matroids are defined on complemented modular support lattices. Minors of length 2 are of four types as in a "classical" matroid. Tutte polynomials of matroids are calc…
Defining the q-analogue of a matroid
Relinde Jurrius, Ruud Pellikaan
This paper defines the q-analogue of a matroid and establishes several properties like duality, restriction and contraction. We discuss possible ways to define a q-matroid, and why…
Relations between Möbius and coboundary polynomial
Relinde Jurrius
It is known that, in general, the coboundary polynomial and the Möbius polynomial of a matroid do not determine each other. Less is known about more specific cases. In this paper,…
Weight enumeration of codes from finite spaces
Relinde Jurrius
We study the generalized and extended weight enumerator of the q-ary Simplex code and the q-ary first order Reed-Muller code. For our calculations we use that these codes correspon…