activity
20122022
most citedApplications of Bar Code to involutive divisions and a greedy algorithm for complete sets

1 citations · 1 across the 6 of their papers we have counts for

collaborators

9 papers

math.CO2022

On large partial ovoids of symplectic and Hermitian polar spaces

Michela Ceria, Jan De Beule, Francesco Pavese +1

In this paper we provide constructive lower bounds on the sizes of the largest partial ovoids of the symplectic polar spaces , odd square, $q \not\equiv 0 \pmod…

math.CO2021

On near-MDS codes and caps

Michela Ceria, Antonio Cossidente, Giuseppe Marino +1

Several classes of near-MDS codes of are described. They are obtained either by considering the intersection of an elliptic quadric ovoid and a Suzuki-Tits ovoid of…

math.CO2021

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-…

math.CO2019

Macaulay, Lazard and the Syndrome Variety

Michela Ceria

In this paper we consider the four syndrom varieties , i.e. the set of all error locations corresponding to errors of weight , ${\sf Z}_{ns}^\ti…

math.CO2019

Bar Code and Janet-like division

Michela Ceria

Bar Codes are combinatorial objects encoding many properties of monomial ideals. In this paper we employ these objects to study Janet-like divisions. Given a finite set of terms U,…

math.CO20191 cited

Applications of Bar Code to involutive divisions and a greedy algorithm for complete sets

Michela Ceria

In this paper, we describe how to get Janet decomposition for a finite set of terms and detect completeness of that set by means of the associated Bar Code. Moreover, we explain an…