Albert Garreta
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Albert Garreta has a total of 51 co-authors. Here are the top co-authors by number of shared publications:
- Alexei Myasnikov
Stevens Institute of Technology, Hoboken, USA
5 shared publications - Denis Ovchinnikov
Stevens Institute of Technology NJ USA
5 shared publications A. Bahmanyar
Dunlap Institute for Astronomy and Astrophysics, University of Toronto, 50 St. George St., Toronto, ON M5S 3H4, Canada
1 shared publication- Alex I. Malz
Space Telescope Science Institute
1 shared publication Alexei Miasnikov
1 shared publication- Ashish A. Mahabal
California Institute of Technology
1 shared publication
Latest Publications
- 4 November 2026
- Published by Springer Nature
- p. 365-397
A Simplified Round-by-Round Soundness Proof of FRI
- 4 November 2026
- Published by Springer Nature
- p. 365-397
A Simplified Round-by-Round Soundness Proof of FRI
- Open Access
- 31 May 2024
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Privacy and Security
- Vol. 27 (2) , 1-29
A Decentralized Private Data Marketplace using Blockchain and Secure Multi-Party Computation
Big data has proven to be a very useful tool for companies and users, but companies with larger datasets have ended being more competitive than the others thanks to machine learning or artificial intelligence. Secure multi-party computation (SMPC) allows the smaller companies to jointly train arbitrary models on their private data while assuring privacy, and thus gives data owners the ability to perform what are currently known as federated learning algorithms. Besides, with a blockchain it is possible to coordinate and audit those computations in a decentralized way. In this document, we consider a private data marketplace as a space where researchers and data owners meet to agree the use of private data for statistics or more complex model trainings. This document presents a candidate architecure for a private data marketplace by combining SMPC and a public, general-purpose blockchain. Such a marketplace is proposed as a smart contract deployed in the blockchain, while the privacy preserving computation is held by SMPC.
- 31 May 2024
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Privacy and Security
- Vol. 27 (2) , 1-29
Open AccessA Decentralized Private Data Marketplace using Blockchain and Secure Multi-Party Computation
Big data has proven to be a very useful tool for companies and users, but companies with larger datasets have ended being more competitive than the others thanks to machine learning or artificial intelligence. Secure multi-party computation (SMPC) allows the smaller companies to jointly train arbitrary models on their private data while assuring privacy, and thus gives data owners the ability to perform what are currently known as federated learning algorithms. Besides, with a blockchain it is possible to coordinate and audit those computations in a decentralized way. In this document, we consider a private data marketplace as a space where researchers and data owners meet to agree the use of private data for statistics or more complex model trainings. This document presents a candidate architecure for a private data marketplace by combining SMPC and a public, general-purpose blockchain. Such a marketplace is proposed as a smart contract deployed in the blockchain, while the privacy preserving computation is held by SMPC.
- Open Access
- 21 July 2023
- Published by American Astronomical Society in The Astrophysical Journal Supplement Series
- Vol. 267 (2) , 25
Results of the Photometric LSST Astronomical Time-series Classification Challenge (PLAsTiCC)
Next-generation surveys like the Legacy Survey of Space and Time (LSST) on the Vera C. Rubin Observatory (Rubin) will generate orders of magnitude more discoveries of transients and variable stars than previous surveys. To prepare for this data deluge, we developed the Photometric LSST Astronomical Time-series Classification Challenge (PLAsTiCC), a competition that aimed to catalyze the development of robust classifiers under LSST-like conditions of a nonrepresentative training set for a large photometric test set of imbalanced classes. Over 1000 teams participated in PLAsTiCC, which was hosted in the Kaggle data science competition platform between 2018 September 28 and 2018 December 17, ultimately identifying three winners in 2019 February. Participants produced classifiers employing a diverse set of machine-learning techniques including hybrid combinations and ensemble averages of a range of approaches, among them boosted decision trees, neural networks, and multilayer perceptrons. The strong performance of the top three classifiers on Type Ia supernovae and kilonovae represent a major improvement over the current state of the art within astronomy. This paper summarizes the most promising methods and evaluates their results in detail, highlighting future directions both for classifier development and simulation needs for a next-generation PLAsTiCC data set.
- 21 July 2023
- Published by American Astronomical Society in The Astrophysical Journal Supplement Series
- Vol. 267 (2) , 25
Open AccessResults of the Photometric LSST Astronomical Time-series Classification Challenge (PLAsTiCC)
Next-generation surveys like the Legacy Survey of Space and Time (LSST) on the Vera C. Rubin Observatory (Rubin) will generate orders of magnitude more discoveries of transients and variable stars than previous surveys. To prepare for this data deluge, we developed the Photometric LSST Astronomical Time-series Classification Challenge (PLAsTiCC), a competition that aimed to catalyze the development of robust classifiers under LSST-like conditions of a nonrepresentative training set for a large photometric test set of imbalanced classes. Over 1000 teams participated in PLAsTiCC, which was hosted in the Kaggle data science competition platform between 2018 September 28 and 2018 December 17, ultimately identifying three winners in 2019 February. Participants produced classifiers employing a diverse set of machine-learning techniques including hybrid combinations and ensemble averages of a range of approaches, among them boosted decision trees, neural networks, and multilayer perceptrons. The strong performance of the top three classifiers on Type Ia supernovae and kilonovae represent a major improvement over the current state of the art within astronomy. This paper summarizes the most promising methods and evaluates their results in detail, highlighting future directions both for classifier development and simulation needs for a next-generation PLAsTiCC data set.
- 9 December 2020
- Published by Walter de Gruyter GmbH in Journal of Group Theory
- Vol. 24 (3) , 453-466
Metabelian groups: Full-rank presentations, randomness and Diophantine problems
We study metabelian groups 𝐺 given by full rank finite presentationsin the variety ℳ of metabelian groups. We prove that 𝐺 is a product of a free metabelian subgroup of rank and a virtually abelian normal subgroup, and that if , then the Diophantine problem of 𝐺 is undecidable, while it is decidable if . We further prove that if , then, in any direct decomposition of 𝐺, all factors, except one, are virtually abelian. Since finite presentations have full rank asymptotically almost surely, metabelian groups finitely presented in the variety of metabelian groups satisfy all the aforementioned properties asymptotically almost surely. - 9 December 2020
- Published by Walter de Gruyter GmbH in Journal of Group Theory
- Vol. 24 (3) , 453-466
Metabelian groups: Full-rank presentations, randomness and Diophantine problems
We study metabelian groups 𝐺 given by full rank finite presentationsin the variety ℳ of metabelian groups. We prove that 𝐺 is a product of a free metabelian subgroup of rank and a virtually abelian normal subgroup, and that if , then the Diophantine problem of 𝐺 is undecidable, while it is decidable if . We further prove that if , then, in any direct decomposition of 𝐺, all factors, except one, are virtually abelian. Since finite presentations have full rank asymptotically almost surely, metabelian groups finitely presented in the variety of metabelian groups satisfy all the aforementioned properties asymptotically almost surely. - Open Access
Full rank presentations and nilpotent groups: structure, Diophantine problem, and genericity
We study finitely generated nilpotent groups $G$ given by full rank finite presentations $\langle A \mid R\rangle$ in the variety $\mathcal{N}_c$ of nilpotent groups of class at most $c$, where $c \geq 2$. We prove that if the deficiency $|A| - |R| $ is at least $2$ then the group $G$ is virtually free nilpotent, it is quasi finitely axiomatizable (in particular, first-order rigid), and it is almost (up to finite factors) directly indecomposable. One of the main results of the paper is that the Diophantine problem in nilpotent groups given by full rank finite presentations $\langle A \mid R\rangle$ is undecidable if $|A| - |R| \geq 2$ and decidable otherwise. We show that this class of groups is rather large since finite presentations asymptotically almost surely have full rank, so a random nilpotent group in the few relators model has a full rank presentation asymptotically almost surely. Full rank presentations give one a useful tool to approach random nilpotent groups and study their properties. Note, that the results above significantly improve our understanding of the Diophantine problem in finitely generated nilpotent groups: from a few special examples of groups with undecidable Diophantine problem we got to the place where we know that the Diophantine problem in all "typical" nilpotent groups is also undecidable.Open AccessFull rank presentations and nilpotent groups: structure, Diophantine problem, and genericity
We study finitely generated nilpotent groups $G$ given by full rank finite presentations $\langle A \mid R\rangle$ in the variety $\mathcal{N}_c$ of nilpotent groups of class at most $c$, where $c \geq 2$. We prove that if the deficiency $|A| - |R| $ is at least $2$ then the group $G$ is virtually free nilpotent, it is quasi finitely axiomatizable (in particular, first-order rigid), and it is almost (up to finite factors) directly indecomposable. One of the main results of the paper is that the Diophantine problem in nilpotent groups given by full rank finite presentations $\langle A \mid R\rangle$ is undecidable if $|A| - |R| \geq 2$ and decidable otherwise. We show that this class of groups is rather large since finite presentations asymptotically almost surely have full rank, so a random nilpotent group in the few relators model has a full rank presentation asymptotically almost surely. Full rank presentations give one a useful tool to approach random nilpotent groups and study their properties. Note, that the results above significantly improve our understanding of the Diophantine problem in finitely generated nilpotent groups: from a few special examples of groups with undecidable Diophantine problem we got to the place where we know that the Diophantine problem in all "typical" nilpotent groups is also undecidable. - 1 August 2020
- Published by Elsevier in Journal of Algebra
- Vol. 556, 1-34
Full rank presentations and nilpotent groups: Structure, Diophantine problem, and genericity
- 1 August 2020
- Published by Elsevier in Journal of Algebra
- Vol. 556, 1-34
Full rank presentations and nilpotent groups: Structure, Diophantine problem, and genericity
- Open Access
Diophantine problems in solvable groups
We study the Diophantine problem (decidability of finite systems of equations) in different classes of finitely generated solvable groups (nilpotent, polycyclic, metabelian, free solvable, etc), which satisfy some natural "non-commutativity" conditions. For each group $G$ in one of these classes, we prove that there exists a ring of algebraic integers $O$ that is interpretable in $G$ by finite systems of equations (e-interpretable), and hence that the Diophantine problem in $O$ is polynomial time reducible to the Diophantine problem in $G$. One of the major open conjectures in number theory states that the Diophantine problem in any such $O$ is undecidable. If true this would imply that the Diophantine problem in any such $G$ is also undecidable. Furthermore, we show that for many particular groups $G$ as above, the ring $O$ is isomorphic to the ring of integers $\mathbb{Z}$, so the Diophantine problem in $G$ is, indeed, undecidable. This holds, in particular, for free nilpotent or free solvable non-abelian groups, as well as for non-abelian generalized Heisenberg groups and uni-triangular groups $UT(n,\mathbb{Z}), n \geq 3$. Then we apply these results to non-solvable groups that contain non-virtually abelian maximal finitely generated nilpotent subgroups. For instance, we show that the Diophantine problem is undecidable in the groups $GL(3,\mathbb{Z}), SL(3,\mathbb{Z}), T(3,\mathbb{Z})$.Open AccessDiophantine problems in solvable groups
We study the Diophantine problem (decidability of finite systems of equations) in different classes of finitely generated solvable groups (nilpotent, polycyclic, metabelian, free solvable, etc), which satisfy some natural "non-commutativity" conditions. For each group $G$ in one of these classes, we prove that there exists a ring of algebraic integers $O$ that is interpretable in $G$ by finite systems of equations (e-interpretable), and hence that the Diophantine problem in $O$ is polynomial time reducible to the Diophantine problem in $G$. One of the major open conjectures in number theory states that the Diophantine problem in any such $O$ is undecidable. If true this would imply that the Diophantine problem in any such $G$ is also undecidable. Furthermore, we show that for many particular groups $G$ as above, the ring $O$ is isomorphic to the ring of integers $\mathbb{Z}$, so the Diophantine problem in $G$ is, indeed, undecidable. This holds, in particular, for free nilpotent or free solvable non-abelian groups, as well as for non-abelian generalized Heisenberg groups and uni-triangular groups $UT(n,\mathbb{Z}), n \geq 3$. Then we apply these results to non-solvable groups that contain non-virtually abelian maximal finitely generated nilpotent subgroups. For instance, we show that the Diophantine problem is undecidable in the groups $GL(3,\mathbb{Z}), SL(3,\mathbb{Z}), T(3,\mathbb{Z})$. - Open Access
- 21 February 2020
- Published by World Scientific Pub Co Pte Ltd in Bulletin of Mathematical Sciences
- Vol. 10 (01)
Diophantine problems in solvable groups
- 21 February 2020
- Published by World Scientific Pub Co Pte Ltd in Bulletin of Mathematical Sciences
- Vol. 10 (01)
Open AccessDiophantine problems in solvable groups
- Open Access
On the positive theory of groups acting on trees
We study the positive theory of groups acting on trees and show that under the presence of weak small cancellation elements, the positive theory of the group is trivial, i.e. coincides with the positive theory of a non-abelian free group. Our results apply to a wide class of groups, including non-virtually solvable fundamental groups of $3$-manifold groups, generalised Baumslag-Solitar groups and almost all one-relator groups and graph products of groups. It follows that groups in the class satisfy a number of algebraic properties: for instance, their verbal subgroups have infinite width and, although some groups in the class are simple, they cannot be boundedly simple. In order to prove these results we describe a uniform way for constructing (weak) small cancellation tuples from (weakly) stable elements. This result of interest in its own is fundamental to obtain corollaries of general nature such as a quantifier reduction for positive sentences or the preservation of the non-trivial positive theory under extensions of groups.
Open AccessOn the positive theory of groups acting on trees
We study the positive theory of groups acting on trees and show that under the presence of weak small cancellation elements, the positive theory of the group is trivial, i.e. coincides with the positive theory of a non-abelian free group. Our results apply to a wide class of groups, including non-virtually solvable fundamental groups of $3$-manifold groups, generalised Baumslag-Solitar groups and almost all one-relator groups and graph products of groups. It follows that groups in the class satisfy a number of algebraic properties: for instance, their verbal subgroups have infinite width and, although some groups in the class are simple, they cannot be boundedly simple. In order to prove these results we describe a uniform way for constructing (weak) small cancellation tuples from (weakly) stable elements. This result of interest in its own is fundamental to obtain corollaries of general nature such as a quantifier reduction for positive sentences or the preservation of the non-trivial positive theory under extensions of groups.
- 18 January 2017
- Published by Walter de Gruyter GmbH in Groups - Complexity - Cryptology
- Vol. 9 (2) , 99-115
Random nilpotent groups, polycyclic presentations, and Diophantine problems
We introduce a model of random finitely generated, torsion-free, 2-step nilpotent groups (in short,
- 18 January 2017
- Published by Walter de Gruyter GmbH in Groups - Complexity - Cryptology
- Vol. 9 (2) , 99-115
Random nilpotent groups, polycyclic presentations, and Diophantine problems
We introduce a model of random finitely generated, torsion-free, 2-step nilpotent groups (in short,