activity
20112026
most citedSigned graphs and the freeness of the Weyl subarrangements of type

13 citations · 33 across the 22 of their papers we have counts for

collaborators

30 papers

math.CO2026

Inductive approach to chromatic and characteristic polynomials

Madison Cox, Michele Torielli

In this article we describe a new inductive approach to compute the chromatic polynomial of simple graphs and the characteristic polynomial of central hyperplane arrangements.

math.CO2026

Enumerative combinatorics package for CoCoA

Akin Scott, Michele Torielli

We introduce the package combinatorics for the software CoCoA. This package provides a data structure and the necessary methods for computing several known enumerative combinatoria…

math.AC2024

A new iterative algorithm for comprehensive Grobner systems

Anna Maria Bigatti, Elisa Palezzato, Michele Torielli

A Comprehensive Grobner system for a parametric ideal I in K(A)[X] represents the collection of all Grobner bases of the ideals I' in K[X] obtained as the values of the parameters…

math.CO2024

Freeness of hyperplane arrangements associated with gain graphs

Daisuke Suyama, Michele Torielli, Shuhei Tsujie

Athanasiadis studied arrangements obtained by adding shifted hyperplanes to the braid arrangement. Similarly, Bailey studied arrangements obtained by adding tilted hyperplanes to t…

math.AG2023

Lefschetz properties and the Jacobian algebra of 3-dimensional hyperplane arrangements

Simone Marchesi, Elisa Palezzato, Michele Torielli

In this article, we study the weak and strong Lefschetz of higher dimensional quotients and dimension 1 almost complete intersections. We then apply the obtained results to the stu…

math.CO2023

Total outer-connected domination number of middle graphs

Farshad Kazemnejad, Behnaz Pahlavsay, Elisa Palezzato +1

In this paper, we study the total outer-connected domination number of the middle graph of a simple graph and we obtain tight bounds for this number in terms of the order of the mi…