Silvia Lassalle
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Silvia Lassalle has a total of 15 co-authors. Here are the top co-authors by number of shared publications:
- Miguel Berasategui
IMAS-UBA-CONICET-Pab I, Facultad de Ciencias Exactas y Naturales, Universidad de Buenos Aires, Buenos Aires, Argentina
8 shared publications - Pablo Manuel Berná
Departamento de Matemáticas, CUNEF Universidad, Madrid, Spain
4 shared publications - Verónica Dimant
Universidad de San Andrés
4 shared publications - Manuel Maestre
Departamento de Análisis Matemático, Universidad de Valencia, Burjasot, Spain
3 shared publications - Pablo Turco
IMAS - UBA - CONICET, Facultad de Ciencias Exactas y Naturales, Universidad de Buenos Aires, Buenos Aires, Argentina
3 shared publications - Daniel Carando
Departamento de Matematica, Facultad de Ciencias Exactas y Naturales, Universidad de Buenos Aires, Buenos Aires, Argentina
2 shared publications
Latest Publications
- 12 August 2025
- Published by Springer Nature in Journal of Fourier Analysis and Applications
- Vol. 31 (4) , 1-23
The Fundamental Functions of the Canonical Basis of Hardy Spaces of Dirichlet Series
- 12 August 2025
- Published by Springer Nature in Journal of Fourier Analysis and Applications
- Vol. 31 (4) , 1-23
The Fundamental Functions of the Canonical Basis of Hardy Spaces of Dirichlet Series
- Open Access
- 1 November 2024
- Published by Springer Nature in Banach Journal of Mathematical Analysis
- Vol. 19 (1) , 1-21
Fibers and Gleason parts for the maximal ideal space of ${\mathcal {A}}_u(B_{\ell _p})$In the early nineties, R. M. Aron, B. Cole, T. W. Gamelin and W. B. Johnson initiated the study of the maximal ideal space (spectrum) of Banach algebras of holomorphic functions defined on the open unit ball of an infinite dimensional complex Banach space. Within this framework, we investigate the fibers and Gleason parts of the spectrum of the algebra of holomorphic and uniformly continuous functions on the unit ball of $$\ell _p$$ ( $$1\le p<\infty $$ ). We show that the inherent geometry of these spaces provides a fundamental ingredient for our results. We prove that whenever $$p\in {\mathbb {N}}$$ ( $$p\ge 2$$ ), the fiber of every $$z\in B_{\ell _p}$$ contains a set of cardinal $$2^{{\mathfrak {c}}}$$ such that any two elements of this set belong to different Gleason parts. For the case $$p=1$$ , we complete the known description of the fibers, showing that, for each $$z\in \overline{B}_{\ell _1''}{\setminus } S_{\ell _1}$$ , the fiber over z is not a singleton. Also, we establish that different fibers over elements in $$S_{\ell _1''}$$ cannot share Gleason parts.- 1 November 2024
- Published by Springer Nature in Banach Journal of Mathematical Analysis
- Vol. 19 (1) , 1-21
Open AccessFibers and Gleason parts for the maximal ideal space of ${\mathcal {A}}_u(B_{\ell _p})$In the early nineties, R. M. Aron, B. Cole, T. W. Gamelin and W. B. Johnson initiated the study of the maximal ideal space (spectrum) of Banach algebras of holomorphic functions defined on the open unit ball of an infinite dimensional complex Banach space. Within this framework, we investigate the fibers and Gleason parts of the spectrum of the algebra of holomorphic and uniformly continuous functions on the unit ball of $$\ell _p$$ ( $$1\le p<\infty $$ ). We show that the inherent geometry of these spaces provides a fundamental ingredient for our results. We prove that whenever $$p\in {\mathbb {N}}$$ ( $$p\ge 2$$ ), the fiber of every $$z\in B_{\ell _p}$$ contains a set of cardinal $$2^{{\mathfrak {c}}}$$ such that any two elements of this set belong to different Gleason parts. For the case $$p=1$$ , we complete the known description of the fibers, showing that, for each $$z\in \overline{B}_{\ell _1''}{\setminus } S_{\ell _1}$$ , the fiber over z is not a singleton. Also, we establish that different fibers over elements in $$S_{\ell _1''}$$ cannot share Gleason parts. - 26 June 2023
- Published by Cambridge University Press (CUP) in Proceedings of the Royal Society of Edinburgh: Section A Mathematics
- Vol. 154 (4) , 1118-1179
Weak weight-semi-greedy Markushevich bases
The main purpose of this paper is to study weight-semi-greedy Markushevich bases, and in particular, find conditions under which such bases are weight-almost greedy. In this context, we prove that, for a large class of weights, the two notions are equivalent. We also show that all weight semi-greedy bases are truncation quasi-greedy and weight-superdemocratic. In all of the above cases, we also bring to the context of weights the weak greedy and Chebyshev greedy algorithms—which are frequently studied in the literature on greedy approximation. In the course of our work, a new property arises naturally and its relation with squeeze symmetric and bidemocratic bases is given. In addition, we study some parameters involving the weak thresholding and Chebyshevian greedy algorithms. Finally, we give examples of conditional bases with some of the weighted greedy-type conditions we study.
- 26 June 2023
- Published by Cambridge University Press (CUP) in Proceedings of the Royal Society of Edinburgh: Section A Mathematics
- Vol. 154 (4) , 1118-1179
Weak weight-semi-greedy Markushevich bases
The main purpose of this paper is to study weight-semi-greedy Markushevich bases, and in particular, find conditions under which such bases are weight-almost greedy. In this context, we prove that, for a large class of weights, the two notions are equivalent. We also show that all weight semi-greedy bases are truncation quasi-greedy and weight-superdemocratic. In all of the above cases, we also bring to the context of weights the weak greedy and Chebyshev greedy algorithms—which are frequently studied in the literature on greedy approximation. In the course of our work, a new property arises naturally and its relation with squeeze symmetric and bidemocratic bases is given. In addition, we study some parameters involving the weak thresholding and Chebyshevian greedy algorithms. Finally, we give examples of conditional bases with some of the weighted greedy-type conditions we study.
- Open Access
Weak weight-semi-greedy Markushevich bases
We introduce and study the notion of weak weight-semi-greedy Markushevich bases - which extends the concepts of weight semi-greedy and weak semi-greedy Markushevich bases. In particular, we study conditions under which such bases are weight almost greedy. We also define the notion of weak weight almost greedy bases, and prove that this formally weaker concept is equivalent to that concept of weight almost greedy bases. Finally, we study some parameters involving the weak thresholding and Chebyshevian greedy algorithms.
Open AccessWeak weight-semi-greedy Markushevich bases
We introduce and study the notion of weak weight-semi-greedy Markushevich bases - which extends the concepts of weight semi-greedy and weak semi-greedy Markushevich bases. In particular, we study conditions under which such bases are weight almost greedy. We also define the notion of weak weight almost greedy bases, and prove that this formally weaker concept is equivalent to that concept of weight almost greedy bases. Finally, we study some parameters involving the weak thresholding and Chebyshevian greedy algorithms.
- 1 March 2023
- Published by Springer Nature in Journal of Fourier Analysis and Applications
- Vol. 29 (2) , 1-37
Weak Greedy Algorithms and the Equivalence Between Semi-greedy and Almost Greedy Markushevich Bases
- 1 March 2023
- Published by Springer Nature in Journal of Fourier Analysis and Applications
- Vol. 29 (2) , 1-37
Weak Greedy Algorithms and the Equivalence Between Semi-greedy and Almost Greedy Markushevich Bases
- Open Access
- 13 December 2022
- Published by Springer Nature in Constructive Approximation
- Vol. 57 (1) , 125-160
Bidemocratic Bases and Their Connections with Other Greedy-Type Bases
In nonlinear greedy approximation theory, bidemocratic bases have traditionally played the role of dualizing democratic, greedy, quasi-greedy, or almost greedy bases. In this article we shift the viewpoint and study them for their own sake, just as we would with any other kind of greedy-type bases. In particular we show that bidemocratic bases need not be quasi-greedy, despite the fact that they retain a strong unconditionality flavor which brings them very close to being quasi-greedy. Our constructive approach gives that for each $$1<p<\infty $$ the space $$\ell _p$$ has a bidemocratic basis which is not quasi-greedy. We also present a novel method for constructing conditional quasi-greedy bases which are bidemocratic, and provide a characterization of bidemocratic bases in terms of the new concepts of truncation quasi-greediness and partially democratic bases.- 13 December 2022
- Published by Springer Nature in Constructive Approximation
- Vol. 57 (1) , 125-160
Open AccessBidemocratic Bases and Their Connections with Other Greedy-Type Bases
In nonlinear greedy approximation theory, bidemocratic bases have traditionally played the role of dualizing democratic, greedy, quasi-greedy, or almost greedy bases. In this article we shift the viewpoint and study them for their own sake, just as we would with any other kind of greedy-type bases. In particular we show that bidemocratic bases need not be quasi-greedy, despite the fact that they retain a strong unconditionality flavor which brings them very close to being quasi-greedy. Our constructive approach gives that for each $$1<p<\infty $$ the space $$\ell _p$$ has a bidemocratic basis which is not quasi-greedy. We also present a novel method for constructing conditional quasi-greedy bases which are bidemocratic, and provide a characterization of bidemocratic bases in terms of the new concepts of truncation quasi-greediness and partially democratic bases. - 1 January 2022
- Published by Institute of Mathematics, Polish Academy of Sciences in Studia Mathematica
- Vol. 267 (1) , 1-17
Weak forms of unconditionality of bases in greedy approximation
We study a new class of bases, weaker than quasi-greedy bases, which retain their unconditionality properties and can provide the same optimality for the thresholding greedy algorithm. We measure how far these bases are from being unconditional and use th
- 1 January 2022
- Published by Institute of Mathematics, Polish Academy of Sciences in Studia Mathematica
- Vol. 267 (1) , 1-17
Weak forms of unconditionality of bases in greedy approximation
We study a new class of bases, weaker than quasi-greedy bases, which retain their unconditionality properties and can provide the same optimality for the thresholding greedy algorithm. We measure how far these bases are from being unconditional and use th
- Open Access
Weak greedy algorithms and the equivalence between semi-greedy and almost greedy Markushevich bases
We introduce and study the notion of weak semi-greedy systems -which is inspired in the concepts of semi-greedy and Branch semi-greedy systems and weak thresholding sets-, and prove that in the context Markushevich bases in infinite dimensional Banach spaces, the notions of \textit{ semi-greedy, branch semi-greedy, weak semi-greedy, and almost greedy} Markushevich bases are all equivalent. This completes and extends some results from \cite{Berna2019}, \cite{Dilworth2003b}, and \cite{Dilworth2012}. We also exhibit an example of a semi-greedy system that is neither almost greedy nor a Markushevich basis, showing that the Markushevich condition cannot be dropped from the equivalence result. In some cases, we obtain improved upper bounds for the corresponding constants of the systems.
Open AccessWeak greedy algorithms and the equivalence between semi-greedy and almost greedy Markushevich bases
We introduce and study the notion of weak semi-greedy systems -which is inspired in the concepts of semi-greedy and Branch semi-greedy systems and weak thresholding sets-, and prove that in the context Markushevich bases in infinite dimensional Banach spaces, the notions of \textit{ semi-greedy, branch semi-greedy, weak semi-greedy, and almost greedy} Markushevich bases are all equivalent. This completes and extends some results from \cite{Berna2019}, \cite{Dilworth2003b}, and \cite{Dilworth2012}. We also exhibit an example of a semi-greedy system that is neither almost greedy nor a Markushevich basis, showing that the Markushevich condition cannot be dropped from the equivalence result. In some cases, we obtain improved upper bounds for the corresponding constants of the systems.
- 8 April 2021
- Published by Springer Nature in Constructive Approximation
- Vol. 54 (3) , 507-528
Strong Partially Greedy Bases and Lebesgue-Type Inequalities
- 8 April 2021
- Published by Springer Nature in Constructive Approximation
- Vol. 54 (3) , 507-528
Strong Partially Greedy Bases and Lebesgue-Type Inequalities
- 1 January 2021
- Published by Institute of Mathematics, Polish Academy of Sciences in Studia Mathematica
- Vol. 257 (3) , 287-294
Lifting some approximation properties from a dual space $X’$ to the Banach space $X$For a fixed Banach operator ideal $\mathcal A $, we characterize $\mathcal A $-compact sets (in the sense of Carl and Stephani) that are determined by $c_0$ via the Banach composition ideal $\mathcal A \circ \mathfrak K_{\infty }$, with $\mathfrak K_{\inf- 1 January 2021
- Published by Institute of Mathematics, Polish Academy of Sciences in Studia Mathematica
- Vol. 257 (3) , 287-294
Lifting some approximation properties from a dual space $X’$ to the Banach space $X$For a fixed Banach operator ideal $\mathcal A $, we characterize $\mathcal A $-compact sets (in the sense of Carl and Stephani) that are determined by $c_0$ via the Banach composition ideal $\mathcal A \circ \mathfrak K_{\infty }$, with $\mathfrak K_{\inf