Sara Marziali
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Sara Marziali has a total of 16 co-authors. Here are the top co-authors by number of shared publications:
- Monica Bianchini
Department of Information Engineering and Mathematics (DIISM), University of Siena, 53100 Siena, Italy
3 shared publications - Giuseppe Alessio D'Inverno
Department of Information Engineering and Mathematics, University of Siena, Via Roma 56, Siena, 53100, Italy
2 shared publications - Luca Chiantini
Dipartmento di Ingegneria dell’Informazione e Scienze Matematiche, Università di Siena, Siena, Italy
2 shared publications - Alessia Lucia Prete
Fondazione Toscana Life Sciences, Via Fiorentina 1, 53100 Siena, Italy
1 shared publication - Barbara Toniella Corradini
University of Siena
1 shared publication - Ben Cullen1 shared publication
Latest Publications
- Open Access
- 1 June 2026
- Published by Elsevier in Advances in Applied Mathematics
- Vol. 180
Product of tensors and description of networks
- 1 June 2026
- Published by Elsevier in Advances in Applied Mathematics
- Vol. 180
Open AccessProduct of tensors and description of networks
- Open Access
Waring decompositions of special binomials
We determine the Waring rank of homogeneous polynomials of the form $x^ky^kz^k + \ell^{3k}$ where $\ell$ is a linear form. The result is based on the study of the Hilbert function and the resolution of special configurations of points in $\mathbb{P}^2$. As a byproduct of our result, we show that the monomial $x^ky^kz^k$ does not have irredundant decompositions of length $(k+1)^2 +1$.Open AccessWaring decompositions of special binomials
We determine the Waring rank of homogeneous polynomials of the form $x^ky^kz^k + \ell^{3k}$ where $\ell$ is a linear form. The result is based on the study of the Hilbert function and the resolution of special configurations of points in $\mathbb{P}^2$. As a byproduct of our result, we show that the monomial $x^ky^kz^k$ does not have irredundant decompositions of length $(k+1)^2 +1$. - Open Access
- 31 October 2025
- Published by Elsevier in Neurocomputing
- Vol. 661
Training dynamics of GANs through the lens of persistent homology
- 31 October 2025
- Published by Elsevier in Neurocomputing
- Vol. 661
Open AccessTraining dynamics of GANs through the lens of persistent homology
- Open Access
- 22 August 2024
- Published by Springer Nature in ANNALI DELL'UNIVERSITA' DI FERRARA
- Vol. 70 (4) , 1767-1783
Boolean operators and neural networks
We compute the homogeneous ideals of varieties, in a projective space of tensors, associated to different choices of the Boolean operators that describe the decision process in small neural networks. We prove that, starting with networks with three nodes, the varieties associated to different Boolean operators are all distinct.
- 22 August 2024
- Published by Springer Nature in ANNALI DELL'UNIVERSITA' DI FERRARA
- Vol. 70 (4) , 1767-1783
Open AccessBoolean operators and neural networks
We compute the homogeneous ideals of varieties, in a projective space of tensors, associated to different choices of the Boolean operators that describe the decision process in small neural networks. We prove that, starting with networks with three nodes, the varieties associated to different Boolean operators are all distinct.
- Open Access
- 10 August 2024
- Published by MDPI AG in Electronics
- Vol. 13 (16) , 3161
Generated or Not Generated (GNG): The Importance of Background in the Detection of Fake Images
Facial biometrics are widely used to reliably and conveniently recognize people in photos, in videos, or from real-time webcam streams. It is therefore of fundamental importance to detect synthetic faces in images in order to reduce the vulnerability of biometrics-based security systems. Furthermore, manipulated images of faces can be intentionally shared on social media to spread fake news related to the targeted individual. This paper shows how fake face recognition models may mainly rely on the information contained in the background when dealing with generated faces, thus reducing their effectiveness. Specifically, a classifier is trained to separate fake images from real ones, using their representation in a latent space. Subsequently, the faces are segmented and the background removed, and the detection procedure is performed again, observing a significant drop in classification accuracy. Finally, an explainability tool (SHAP) is used to highlight the salient areas of the image, showing that the background and face contours crucially influence the classifier decision.
- 10 August 2024
- Published by MDPI AG in Electronics
- Vol. 13 (16) , 3161
Open AccessGenerated or Not Generated (GNG): The Importance of Background in the Detection of Fake Images
Facial biometrics are widely used to reliably and conveniently recognize people in photos, in videos, or from real-time webcam streams. It is therefore of fundamental importance to detect synthetic faces in images in order to reduce the vulnerability of biometrics-based security systems. Furthermore, manipulated images of faces can be intentionally shared on social media to spread fake news related to the targeted individual. This paper shows how fake face recognition models may mainly rely on the information contained in the background when dealing with generated faces, thus reducing their effectiveness. Specifically, a classifier is trained to separate fake images from real ones, using their representation in a latent space. Subsequently, the faces are segmented and the background removed, and the detection procedure is performed again, observing a significant drop in classification accuracy. Finally, an explainability tool (SHAP) is used to highlight the salient areas of the image, showing that the background and face contours crucially influence the classifier decision.
- 1 January 2024
- Published by Springer Nature
- p. 443-455
A Discrete Geometry Method for Atom Depth Computation in Complex Molecular Systems
- 1 January 2024
- Published by Springer Nature
- p. 443-455
A Discrete Geometry Method for Atom Depth Computation in Complex Molecular Systems