---
_id: '10671'
abstract:
- lang: eng
text: We introduce a new class of time-continuous recurrent neural network models.
Instead of declaring a learning system’s dynamics by implicit nonlinearities,
we construct networks of linear first-order dynamical systems modulated via nonlinear
interlinked gates. The resulting models represent dynamical systems with varying
(i.e., liquid) time-constants coupled to their hidden state, with outputs being
computed by numerical differential equation solvers. These neural networks exhibit
stable and bounded behavior, yield superior expressivity within the family of
neural ordinary differential equations, and give rise to improved performance
on time-series prediction tasks. To demonstrate these properties, we first take
a theoretical approach to find bounds over their dynamics, and compute their expressive
power by the trajectory length measure in a latent trajectory space. We then conduct
a series of time-series prediction experiments to manifest the approximation capability
of Liquid Time-Constant Networks (LTCs) compared to classical and modern RNNs.
acknowledgement: "R.H. and D.R. are partially supported by Boeing. R.H. and R.G. were
partially supported by the Horizon-2020 ECSEL\r\nProject grant No. 783163 (iDev40).
M.L. was supported in part by the Austrian Science Fund (FWF) under grant Z211-N23
(Wittgenstein Award). A.A. is supported by the National Science Foundation (NSF)
Graduate Research Fellowship Program. This research work is partially drawn from
the PhD dissertation of R.H."
alternative_title:
- Technical Tracks
article_processing_charge: No
arxiv: 1
author:
- first_name: Ramin
full_name: Hasani, Ramin
last_name: Hasani
- first_name: Mathias
full_name: Lechner, Mathias
id: 3DC22916-F248-11E8-B48F-1D18A9856A87
last_name: Lechner
- first_name: Alexander
full_name: Amini, Alexander
last_name: Amini
- first_name: Daniela
full_name: Rus, Daniela
last_name: Rus
- first_name: Radu
full_name: Grosu, Radu
last_name: Grosu
citation:
ama: 'Hasani R, Lechner M, Amini A, Rus D, Grosu R. Liquid time-constant networks.
In: Proceedings of the AAAI Conference on Artificial Intelligence. Vol
35. AAAI Press; 2021:7657-7666.'
apa: 'Hasani, R., Lechner, M., Amini, A., Rus, D., & Grosu, R. (2021). Liquid
time-constant networks. In Proceedings of the AAAI Conference on Artificial
Intelligence (Vol. 35, pp. 7657–7666). Virtual: AAAI Press.'
chicago: Hasani, Ramin, Mathias Lechner, Alexander Amini, Daniela Rus, and Radu
Grosu. “Liquid Time-Constant Networks.” In Proceedings of the AAAI Conference
on Artificial Intelligence, 35:7657–66. AAAI Press, 2021.
ieee: R. Hasani, M. Lechner, A. Amini, D. Rus, and R. Grosu, “Liquid time-constant
networks,” in Proceedings of the AAAI Conference on Artificial Intelligence,
Virtual, 2021, vol. 35, no. 9, pp. 7657–7666.
ista: 'Hasani R, Lechner M, Amini A, Rus D, Grosu R. 2021. Liquid time-constant
networks. Proceedings of the AAAI Conference on Artificial Intelligence. AAAI:
Association for the Advancement of Artificial Intelligence, Technical Tracks,
vol. 35, 7657–7666.'
mla: Hasani, Ramin, et al. “Liquid Time-Constant Networks.” Proceedings of the
AAAI Conference on Artificial Intelligence, vol. 35, no. 9, AAAI Press, 2021,
pp. 7657–66.
short: R. Hasani, M. Lechner, A. Amini, D. Rus, R. Grosu, in:, Proceedings of the
AAAI Conference on Artificial Intelligence, AAAI Press, 2021, pp. 7657–7666.
conference:
end_date: 2021-02-09
location: Virtual
name: 'AAAI: Association for the Advancement of Artificial Intelligence'
start_date: 2021-02-02
corr_author: '1'
date_created: 2022-01-25T15:48:36Z
date_published: 2021-05-28T00:00:00Z
date_updated: 2025-04-15T06:25:56Z
day: '28'
ddc:
- '000'
department:
- _id: GradSch
- _id: ToHe
external_id:
arxiv:
- '2006.04439'
file:
- access_level: open_access
checksum: 0f06995fba06dbcfa7ed965fc66027ff
content_type: application/pdf
creator: mlechner
date_created: 2022-01-26T07:36:03Z
date_updated: 2022-01-26T07:36:03Z
file_id: '10678'
file_name: 16936-Article Text-20430-1-2-20210518 (1).pdf
file_size: 4302669
relation: main_file
success: 1
file_date_updated: 2022-01-26T07:36:03Z
has_accepted_license: '1'
intvolume: ' 35'
issue: '9'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://ojs.aaai.org/index.php/AAAI/article/view/16936
month: '05'
oa: 1
oa_version: Published Version
page: 7657-7666
project:
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z211
name: Formal methods for the design and analysis of complex systems
publication: Proceedings of the AAAI Conference on Artificial Intelligence
publication_identifier:
eissn:
- 2374-3468
isbn:
- 978-1-57735-866-4
issn:
- 2159-5399
publication_status: published
publisher: AAAI Press
quality_controlled: '1'
status: public
title: Liquid time-constant networks
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 35
year: '2021'
...
---
_id: '10674'
abstract:
- lang: eng
text: 'In two-player games on graphs, the players move a token through a graph to
produce an infinite path, which determines the winner of the game. Such games
are central in formal methods since they model the interaction between a non-terminating
system and its environment. In bidding games the players bid for the right to
move the token: in each round, the players simultaneously submit bids, and the
higher bidder moves the token and pays the other player. Bidding games are known
to have a clean and elegant mathematical structure that relies on the ability
of the players to submit arbitrarily small bids. Many applications, however, require
a fixed granularity for the bids, which can represent, for example, the monetary
value expressed in cents. We study, for the first time, the combination of discrete-bidding
and infinite-duration games. Our most important result proves that these games
form a large determined subclass of concurrent games, where determinacy is the
strong property that there always exists exactly one player who can guarantee
winning the game. In particular, we show that, in contrast to non-discrete bidding
games, the mechanism with which tied bids are resolved plays an important role
in discrete-bidding games. We study several natural tie-breaking mechanisms and
show that, while some do not admit determinacy, most natural mechanisms imply
determinacy for every pair of initial budgets.'
acknowledgement: "This research was supported in part by the Austrian Science Fund
(FWF) under grants S11402-N23 (RiSE/SHiNE), Z211-N23 (Wittgenstein Award), and M
2369-N33 (Meitner fellowship).\r\n"
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Milad
full_name: Aghajohari, Milad
last_name: Aghajohari
- first_name: Guy
full_name: Avni, Guy
id: 463C8BC2-F248-11E8-B48F-1D18A9856A87
last_name: Avni
orcid: 0000-0001-5588-8287
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000-0002-2985-7724
citation:
ama: Aghajohari M, Avni G, Henzinger TA. Determinacy in discrete-bidding infinite-duration
games. Logical Methods in Computer Science. 2021;17(1):10:1-10:23. doi:10.23638/LMCS-17(1:10)2021
apa: Aghajohari, M., Avni, G., & Henzinger, T. A. (2021). Determinacy in discrete-bidding
infinite-duration games. Logical Methods in Computer Science. International
Federation for Computational Logic. https://doi.org/10.23638/LMCS-17(1:10)2021
chicago: Aghajohari, Milad, Guy Avni, and Thomas A Henzinger. “Determinacy in Discrete-Bidding
Infinite-Duration Games.” Logical Methods in Computer Science. International
Federation for Computational Logic, 2021. https://doi.org/10.23638/LMCS-17(1:10)2021.
ieee: M. Aghajohari, G. Avni, and T. A. Henzinger, “Determinacy in discrete-bidding
infinite-duration games,” Logical Methods in Computer Science, vol. 17,
no. 1. International Federation for Computational Logic, p. 10:1-10:23, 2021.
ista: Aghajohari M, Avni G, Henzinger TA. 2021. Determinacy in discrete-bidding
infinite-duration games. Logical Methods in Computer Science. 17(1), 10:1-10:23.
mla: Aghajohari, Milad, et al. “Determinacy in Discrete-Bidding Infinite-Duration
Games.” Logical Methods in Computer Science, vol. 17, no. 1, International
Federation for Computational Logic, 2021, p. 10:1-10:23, doi:10.23638/LMCS-17(1:10)2021.
short: M. Aghajohari, G. Avni, T.A. Henzinger, Logical Methods in Computer Science
17 (2021) 10:1-10:23.
corr_author: '1'
date_created: 2022-01-25T16:32:13Z
date_published: 2021-02-03T00:00:00Z
date_updated: 2025-04-15T06:25:56Z
day: '03'
ddc:
- '510'
department:
- _id: ToHe
doi: 10.23638/LMCS-17(1:10)2021
external_id:
arxiv:
- '1905.03588'
isi:
- '000658724600010'
file:
- access_level: open_access
checksum: b35586a50ed1ca8f44767de116d18d81
content_type: application/pdf
creator: alisjak
date_created: 2022-01-26T08:04:50Z
date_updated: 2022-01-26T08:04:50Z
file_id: '10690'
file_name: 2021_LMCS_AGHAJOHAR.pdf
file_size: 819878
relation: main_file
success: 1
file_date_updated: 2022-01-26T08:04:50Z
has_accepted_license: '1'
intvolume: ' 17'
isi: 1
issue: '1'
keyword:
- computer science
- computer science and game theory
- logic in computer science
language:
- iso: eng
license: https://creativecommons.org/licenses/by/4.0/
month: '02'
oa: 1
oa_version: Published Version
page: 10:1-10:23
project:
- _id: 264B3912-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: M02369
name: Formal Methods meets Algorithmic Game Theory
- _id: 25F2ACDE-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11402-N23
name: Rigorous Systems Engineering
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z211
name: Formal methods for the design and analysis of complex systems
publication: Logical Methods in Computer Science
publication_identifier:
eissn:
- 1860-5974
publication_status: published
publisher: International Federation for Computational Logic
quality_controlled: '1'
scopus_import: '1'
status: public
title: Determinacy in discrete-bidding infinite-duration games
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 17
year: '2021'
...
---
_id: '10688'
abstract:
- lang: eng
text: "Civl is a static verifier for concurrent programs designed around the conceptual
framework of layered refinement,\r\nwhich views the task of verifying a program
as a sequence of program simplification steps each justified by its own invariant.
Civl verifies a layered concurrent program that compactly expresses all the programs
in this sequence and the supporting invariants. This paper presents the design
and implementation of the Civl verifier."
acknowledgement: This research was performed while Bernhard Kragl was at IST Austria,
supported in part by the Austrian Science Fund (FWF) under grant Z211-N23 (Wittgenstein
Award).
alternative_title:
- Conference Series
article_processing_charge: No
author:
- first_name: Bernhard
full_name: Kragl, Bernhard
id: 320FC952-F248-11E8-B48F-1D18A9856A87
last_name: Kragl
orcid: 0000-0001-7745-9117
- first_name: Shaz
full_name: Qadeer, Shaz
last_name: Qadeer
citation:
ama: 'Kragl B, Qadeer S. The Civl verifier. In: Ruzica P, Whalen MW, eds. Proceedings
of the 21st Conference on Formal Methods in Computer-Aided Design. Vol 2.
TU Wien Academic Press; 2021:143–152. doi:10.34727/2021/isbn.978-3-85448-046-4_23'
apa: 'Kragl, B., & Qadeer, S. (2021). The Civl verifier. In P. Ruzica &
M. W. Whalen (Eds.), Proceedings of the 21st Conference on Formal Methods in
Computer-Aided Design (Vol. 2, pp. 143–152). Virtual: TU Wien Academic Press.
https://doi.org/10.34727/2021/isbn.978-3-85448-046-4_23'
chicago: Kragl, Bernhard, and Shaz Qadeer. “The Civl Verifier.” In Proceedings
of the 21st Conference on Formal Methods in Computer-Aided Design, edited
by Piskac Ruzica and Michael W. Whalen, 2:143–152. TU Wien Academic Press, 2021.
https://doi.org/10.34727/2021/isbn.978-3-85448-046-4_23.
ieee: B. Kragl and S. Qadeer, “The Civl verifier,” in Proceedings of the 21st
Conference on Formal Methods in Computer-Aided Design, Virtual, 2021, vol.
2, pp. 143–152.
ista: 'Kragl B, Qadeer S. 2021. The Civl verifier. Proceedings of the 21st Conference
on Formal Methods in Computer-Aided Design. FMCAD: Formal Methods in Computer-Aided
Design, Conference Series, vol. 2, 143–152.'
mla: Kragl, Bernhard, and Shaz Qadeer. “The Civl Verifier.” Proceedings of the
21st Conference on Formal Methods in Computer-Aided Design, edited by Piskac
Ruzica and Michael W. Whalen, vol. 2, TU Wien Academic Press, 2021, pp. 143–152,
doi:10.34727/2021/isbn.978-3-85448-046-4_23.
short: B. Kragl, S. Qadeer, in:, P. Ruzica, M.W. Whalen (Eds.), Proceedings of the
21st Conference on Formal Methods in Computer-Aided Design, TU Wien Academic Press,
2021, pp. 143–152.
conference:
end_date: 2021-10-22
location: Virtual
name: 'FMCAD: Formal Methods in Computer-Aided Design'
start_date: 2021-10-20
corr_author: '1'
date_created: 2022-01-26T08:01:30Z
date_published: 2021-10-01T00:00:00Z
date_updated: 2025-04-15T06:25:56Z
day: '01'
ddc:
- '000'
department:
- _id: ToHe
doi: 10.34727/2021/isbn.978-3-85448-046-4_23
editor:
- first_name: Piskac
full_name: Ruzica, Piskac
last_name: Ruzica
- first_name: Michael W.
full_name: Whalen, Michael W.
last_name: Whalen
file:
- access_level: open_access
checksum: 35438ac9f9750340b7f8ae4ae3220d9f
content_type: application/pdf
creator: cchlebak
date_created: 2022-01-26T08:04:29Z
date_updated: 2022-01-26T08:04:29Z
file_id: '10689'
file_name: 2021_FCAD2021_Kragl.pdf
file_size: 390555
relation: main_file
success: 1
file_date_updated: 2022-01-26T08:04:29Z
has_accepted_license: '1'
intvolume: ' 2'
language:
- iso: eng
month: '10'
oa: 1
oa_version: Published Version
page: 143–152
project:
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z211
name: Formal methods for the design and analysis of complex systems
publication: Proceedings of the 21st Conference on Formal Methods in Computer-Aided
Design
publication_identifier:
isbn:
- 978-3-85448-046-4
publication_status: published
publisher: TU Wien Academic Press
quality_controlled: '1'
scopus_import: '1'
status: public
title: The Civl verifier
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: conference
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
volume: 2
year: '2021'
...
---
_id: '10694'
abstract:
- lang: eng
text: 'In a two-player zero-sum graph game the players move a token throughout a
graph to produce an infinite path, which determines the winner or payoff of the
game. Traditionally, the players alternate turns in moving the token. In bidding
games, however, the players have budgets, and in each turn, we hold an “auction”
(bidding) to determine which player moves the token: both players simultaneously
submit bids and the higher bidder moves the token. The bidding mechanisms differ
in their payment schemes. Bidding games were largely studied with variants of
first-price bidding in which only the higher bidder pays his bid. We focus on
all-pay bidding, where both players pay their bids. Finite-duration all-pay bidding
games were studied and shown to be technically more challenging than their first-price
counterparts. We study for the first time, infinite-duration all-pay bidding games.
Our most interesting results are for mean-payoff objectives: we portray a complete
picture for games played on strongly-connected graphs. We study both pure (deterministic)
and mixed (probabilistic) strategies and completely characterize the optimal and
almost-sure (with probability 1) payoffs the players can respectively guarantee.
We show that mean-payoff games under all-pay bidding exhibit the intriguing mathematical
properties of their first-price counterparts; namely, an equivalence with random-turn
games in which in each turn, the player who moves is selected according to a (biased)
coin toss. The equivalences for all-pay bidding are more intricate and unexpected
than for first-price bidding.'
acknowledgement: This research was supported in part by the Austrian Science Fund
(FWF) under grant Z211-N23 (Wittgenstein Award), ERC CoG 863818 (FoRM-SMArt), and
by the European Union's Horizon 2020 research and innovation programme under the
Marie Skłodowska-Curie Grant Agreement No. 665385.
article_processing_charge: No
arxiv: 1
author:
- first_name: Guy
full_name: Avni, Guy
id: 463C8BC2-F248-11E8-B48F-1D18A9856A87
last_name: Avni
orcid: 0000-0001-5588-8287
- first_name: Ismael R
full_name: Jecker, Ismael R
id: 85D7C63E-7D5D-11E9-9C0F-98C4E5697425
last_name: Jecker
- first_name: Dorde
full_name: Zikelic, Dorde
id: 294AA7A6-F248-11E8-B48F-1D18A9856A87
last_name: Zikelic
orcid: 0000-0002-4681-1699
citation:
ama: 'Avni G, Jecker IR, Zikelic D. Infinite-duration all-pay bidding games. In:
Marx D, ed. Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms.
Society for Industrial and Applied Mathematics; 2021:617-636. doi:10.1137/1.9781611976465.38'
apa: 'Avni, G., Jecker, I. R., & Zikelic, D. (2021). Infinite-duration all-pay
bidding games. In D. Marx (Ed.), Proceedings of the 2021 ACM-SIAM Symposium
on Discrete Algorithms (pp. 617–636). Virtual: Society for Industrial and
Applied Mathematics. https://doi.org/10.1137/1.9781611976465.38'
chicago: Avni, Guy, Ismael R Jecker, and Dorde Zikelic. “Infinite-Duration All-Pay
Bidding Games.” In Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms,
edited by Dániel Marx, 617–36. Society for Industrial and Applied Mathematics,
2021. https://doi.org/10.1137/1.9781611976465.38.
ieee: G. Avni, I. R. Jecker, and D. Zikelic, “Infinite-duration all-pay bidding
games,” in Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms,
Virtual, 2021, pp. 617–636.
ista: 'Avni G, Jecker IR, Zikelic D. 2021. Infinite-duration all-pay bidding games.
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms. SODA: Symposium
on Discrete Algorithms, 617–636.'
mla: Avni, Guy, et al. “Infinite-Duration All-Pay Bidding Games.” Proceedings
of the 2021 ACM-SIAM Symposium on Discrete Algorithms, edited by Dániel Marx,
Society for Industrial and Applied Mathematics, 2021, pp. 617–36, doi:10.1137/1.9781611976465.38.
short: G. Avni, I.R. Jecker, D. Zikelic, in:, D. Marx (Ed.), Proceedings of the
2021 ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied
Mathematics, 2021, pp. 617–636.
conference:
end_date: 2021-01-13
location: Virtual
name: 'SODA: Symposium on Discrete Algorithms'
start_date: 2021-01-10
corr_author: '1'
date_created: 2022-01-27T12:11:23Z
date_published: 2021-01-01T00:00:00Z
date_updated: 2025-04-15T06:26:15Z
day: '01'
department:
- _id: GradSch
- _id: KrCh
doi: 10.1137/1.9781611976465.38
ec_funded: 1
editor:
- first_name: Dániel
full_name: Marx, Dániel
last_name: Marx
external_id:
arxiv:
- '2005.06636'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/2005.06636
month: '01'
oa: 1
oa_version: Preprint
page: 617-636
project:
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z211
name: Formal methods for the design and analysis of complex systems
- _id: 0599E47C-7A3F-11EA-A408-12923DDC885E
call_identifier: H2020
grant_number: '863818'
name: 'Formal Methods for Stochastic Models: Algorithms and Applications'
- _id: 2564DBCA-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '665385'
name: International IST Doctoral Program
publication: Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms
publication_identifier:
isbn:
- 978-1-61197-646-5
publication_status: published
publisher: Society for Industrial and Applied Mathematics
quality_controlled: '1'
scopus_import: '1'
status: public
title: Infinite-duration all-pay bidding games
type: conference
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
year: '2021'
...
---
_id: '10711'
abstract:
- lang: eng
text: In this paper, we investigate the distribution of the maximum of partial sums
of families of m -periodic complex-valued functions satisfying certain conditions.
We obtain precise uniform estimates for the distribution function of this maximum
in a near-optimal range. Our results apply to partial sums of Kloosterman sums
and other families of ℓ -adic trace functions, and are as strong as those obtained
by Bober, Goldmakher, Granville and Koukoulopoulos for character sums. In particular,
we improve on the recent work of the third author for Birch sums. However, unlike
character sums, we are able to construct families of m -periodic complex-valued
functions which satisfy our conditions, but for which the Pólya–Vinogradov inequality
is sharp.
acknowledgement: We would like to thank the anonymous referees for carefully reading
the paper and for their remarks and suggestions.
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Pascal
full_name: Autissier, Pascal
last_name: Autissier
- first_name: Dante
full_name: Bonolis, Dante
id: 6A459894-5FDD-11E9-AF35-BB24E6697425
last_name: Bonolis
- first_name: Youness
full_name: Lamzouri, Youness
last_name: Lamzouri
citation:
ama: Autissier P, Bonolis D, Lamzouri Y. The distribution of the maximum of partial
sums of Kloosterman sums and other trace functions. Compositio Mathematica.
2021;157(7):1610-1651. doi:10.1112/s0010437x21007351
apa: Autissier, P., Bonolis, D., & Lamzouri, Y. (2021). The distribution of
the maximum of partial sums of Kloosterman sums and other trace functions. Compositio
Mathematica. Cambridge University Press. https://doi.org/10.1112/s0010437x21007351
chicago: Autissier, Pascal, Dante Bonolis, and Youness Lamzouri. “The Distribution
of the Maximum of Partial Sums of Kloosterman Sums and Other Trace Functions.”
Compositio Mathematica. Cambridge University Press, 2021. https://doi.org/10.1112/s0010437x21007351.
ieee: P. Autissier, D. Bonolis, and Y. Lamzouri, “The distribution of the maximum
of partial sums of Kloosterman sums and other trace functions,” Compositio
Mathematica, vol. 157, no. 7. Cambridge University Press, pp. 1610–1651, 2021.
ista: Autissier P, Bonolis D, Lamzouri Y. 2021. The distribution of the maximum
of partial sums of Kloosterman sums and other trace functions. Compositio Mathematica.
157(7), 1610–1651.
mla: Autissier, Pascal, et al. “The Distribution of the Maximum of Partial Sums
of Kloosterman Sums and Other Trace Functions.” Compositio Mathematica,
vol. 157, no. 7, Cambridge University Press, 2021, pp. 1610–51, doi:10.1112/s0010437x21007351.
short: P. Autissier, D. Bonolis, Y. Lamzouri, Compositio Mathematica 157 (2021)
1610–1651.
corr_author: '1'
date_created: 2022-02-01T08:10:43Z
date_published: 2021-06-28T00:00:00Z
date_updated: 2024-10-21T06:02:06Z
day: '28'
department:
- _id: TiBr
doi: 10.1112/s0010437x21007351
external_id:
arxiv:
- '1909.03266'
isi:
- '000667289300001'
intvolume: ' 157'
isi: 1
issue: '7'
keyword:
- Algebra and Number Theory
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1909.03266
month: '06'
oa: 1
oa_version: Preprint
page: 1610-1651
publication: Compositio Mathematica
publication_identifier:
eissn:
- 1570-5846
issn:
- 0010-437X
publication_status: published
publisher: Cambridge University Press
quality_controlled: '1'
scopus_import: '1'
status: public
title: The distribution of the maximum of partial sums of Kloosterman sums and other
trace functions
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 157
year: '2021'
...
---
_id: '10738'
abstract:
- lang: eng
text: We prove an adiabatic theorem for the Landau–Pekar equations. This allows
us to derive new results on the accuracy of their use as effective equations for
the time evolution generated by the Fröhlich Hamiltonian with large coupling constant
α. In particular, we show that the time evolution of Pekar product states with
coherent phonon field and the electron being trapped by the phonons is well approximated
by the Landau–Pekar equations until times short compared to α2.
acknowledgement: "N. L. and R. S. gratefully acknowledge financial support by the
European Research Council\r\n(ERC) under the European Union’s Horizon 2020 research
and innovation programme (grant\r\nagreement No 694227). B. S. acknowledges support
from the Swiss National Science Foundation (grant 200020_172623) and from the NCCR
SwissMAP. N. L. would like to thank\r\nAndreas Deuchert and David Mitrouskas for
interesting discussions. B. S. and R. S. would\r\nlike to thank Rupert Frank for
stimulating discussions about the time-evolution of a polaron.\r\n"
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Nikolai K
full_name: Leopold, Nikolai K
id: 4BC40BEC-F248-11E8-B48F-1D18A9856A87
last_name: Leopold
orcid: 0000-0002-0495-6822
- first_name: Simone Anna Elvira
full_name: Rademacher, Simone Anna Elvira
id: 856966FE-A408-11E9-977E-802DE6697425
last_name: Rademacher
orcid: 0000-0001-5059-4466
- first_name: Benjamin
full_name: Schlein, Benjamin
last_name: Schlein
- first_name: Robert
full_name: Seiringer, Robert
id: 4AFD0470-F248-11E8-B48F-1D18A9856A87
last_name: Seiringer
orcid: 0000-0002-6781-0521
citation:
ama: 'Leopold NK, Rademacher SAE, Schlein B, Seiringer R. The Landau–Pekar equations:
Adiabatic theorem and accuracy. Analysis and PDE. 2021;14(7):2079-2100.
doi:10.2140/APDE.2021.14.2079'
apa: 'Leopold, N. K., Rademacher, S. A. E., Schlein, B., & Seiringer, R. (2021). The
Landau–Pekar equations: Adiabatic theorem and accuracy. Analysis and PDE.
Mathematical Sciences Publishers. https://doi.org/10.2140/APDE.2021.14.2079'
chicago: 'Leopold, Nikolai K, Simone Anna Elvira Rademacher, Benjamin Schlein, and
Robert Seiringer. “ The Landau–Pekar Equations: Adiabatic Theorem and Accuracy.”
Analysis and PDE. Mathematical Sciences Publishers, 2021. https://doi.org/10.2140/APDE.2021.14.2079.'
ieee: 'N. K. Leopold, S. A. E. Rademacher, B. Schlein, and R. Seiringer, “ The Landau–Pekar
equations: Adiabatic theorem and accuracy,” Analysis and PDE, vol. 14,
no. 7. Mathematical Sciences Publishers, pp. 2079–2100, 2021.'
ista: 'Leopold NK, Rademacher SAE, Schlein B, Seiringer R. 2021. The Landau–Pekar
equations: Adiabatic theorem and accuracy. Analysis and PDE. 14(7), 2079–2100.'
mla: 'Leopold, Nikolai K., et al. “ The Landau–Pekar Equations: Adiabatic Theorem
and Accuracy.” Analysis and PDE, vol. 14, no. 7, Mathematical Sciences
Publishers, 2021, pp. 2079–100, doi:10.2140/APDE.2021.14.2079.'
short: N.K. Leopold, S.A.E. Rademacher, B. Schlein, R. Seiringer, Analysis and PDE
14 (2021) 2079–2100.
corr_author: '1'
date_created: 2022-02-06T23:01:33Z
date_published: 2021-11-10T00:00:00Z
date_updated: 2025-04-14T07:26:53Z
day: '10'
department:
- _id: RoSe
doi: 10.2140/APDE.2021.14.2079
ec_funded: 1
external_id:
arxiv:
- '1904.12532'
isi:
- '000733976600004'
intvolume: ' 14'
isi: 1
issue: '7'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1904.12532
month: '11'
oa: 1
oa_version: Preprint
page: 2079-2100
project:
- _id: 25C6DC12-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '694227'
name: Analysis of quantum many-body systems
publication: Analysis and PDE
publication_identifier:
eissn:
- 1948-206X
issn:
- 2157-5045
publication_status: published
publisher: Mathematical Sciences Publishers
quality_controlled: '1'
scopus_import: '1'
status: public
title: ' The Landau–Pekar equations: Adiabatic theorem and accuracy'
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 14
year: '2021'
...
---
_id: '10762'
abstract:
- lang: eng
text: Methods inspired from machine learning have recently attracted great interest
in the computational study of quantum many-particle systems. So far, however,
it has proven challenging to deal with microscopic models in which the total number
of particles is not conserved. To address this issue, we propose a new variant
of neural network states, which we term neural coherent states. Taking the Fröhlich
impurity model as a case study, we show that neural coherent states can learn
the ground state of non-additive systems very well. In particular, we observe
substantial improvement over the standard coherent state estimates in the most
challenging intermediate coupling regime. Our approach is generic and does not
assume specific details of the system, suggesting wide applications.
acknowledgement: "We acknowledge fruitful discussions with Giacomo Bighin, Giammarco
Fabiani, Areg Ghazaryan, Christoph\r\nLampert, and Artem Volosniev at various stages
of this work. W.R. is a recipient of a DOC Fellowship of the\r\nAustrian Academy
of Sciences and has received funding from the EU Horizon 2020 programme under the
Marie\r\nSkłodowska-Curie Grant Agreement No. 665385. M. L. acknowledges support
by the European Research Council (ERC) Starting Grant No. 801770 (ANGULON). This
work is part of the Shell-NWO/FOM-initiative “Computational sciences for energy
research” of Shell and Chemical Sciences, Earth and Life Sciences, Physical Sciences,
FOM and STW."
article_processing_charge: No
arxiv: 1
author:
- first_name: Wojciech
full_name: Rzadkowski, Wojciech
id: 48C55298-F248-11E8-B48F-1D18A9856A87
last_name: Rzadkowski
orcid: 0000-0002-1106-4419
- first_name: Mikhail
full_name: Lemeshko, Mikhail
id: 37CB05FA-F248-11E8-B48F-1D18A9856A87
last_name: Lemeshko
orcid: 0000-0002-6990-7802
- first_name: Johan H.
full_name: Mentink, Johan H.
last_name: Mentink
citation:
ama: Rzadkowski W, Lemeshko M, Mentink JH. Artificial neural network states for
non-additive systems. arXiv. doi:10.48550/arXiv.2105.15193
apa: Rzadkowski, W., Lemeshko, M., & Mentink, J. H. (n.d.). Artificial neural
network states for non-additive systems. arXiv. https://doi.org/10.48550/arXiv.2105.15193
chicago: Rzadkowski, Wojciech, Mikhail Lemeshko, and Johan H. Mentink. “Artificial
Neural Network States for Non-Additive Systems.” ArXiv, n.d. https://doi.org/10.48550/arXiv.2105.15193.
ieee: W. Rzadkowski, M. Lemeshko, and J. H. Mentink, “Artificial neural network
states for non-additive systems,” arXiv. .
ista: Rzadkowski W, Lemeshko M, Mentink JH. Artificial neural network states for
non-additive systems. arXiv, 10.48550/arXiv.2105.15193.
mla: Rzadkowski, Wojciech, et al. “Artificial Neural Network States for Non-Additive
Systems.” ArXiv, doi:10.48550/arXiv.2105.15193.
short: W. Rzadkowski, M. Lemeshko, J.H. Mentink, ArXiv (n.d.).
corr_author: '1'
date_created: 2022-02-17T11:18:57Z
date_published: 2021-05-31T00:00:00Z
date_updated: 2026-04-07T14:20:12Z
day: '31'
department:
- _id: MiLe
doi: 10.48550/arXiv.2105.15193
ec_funded: 1
external_id:
arxiv:
- '2105.15193'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/2105.15193
month: '05'
oa: 1
oa_version: Preprint
page: '2105.15193'
project:
- _id: 2688CF98-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '801770'
name: 'Angulon: physics and applications of a new quasiparticle'
- _id: 2564DBCA-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '665385'
name: International IST Doctoral Program
publication: arXiv
publication_status: draft
related_material:
record:
- id: '10759'
relation: dissertation_contains
status: public
status: public
title: Artificial neural network states for non-additive systems
type: preprint
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2021'
...
---
_id: '10803'
abstract:
- lang: eng
text: Given the abundance of applications of ranking in recent years, addressing
fairness concerns around automated ranking systems becomes necessary for increasing
the trust among end-users. Previous work on fair ranking has mostly focused on
application-specific fairness notions, often tailored to online advertising, and
it rarely considers learning as part of the process. In this work, we show how
to transfer numerous fairness notions from binary classification to a learning
to rank setting. Our formalism allows us to design methods for incorporating fairness
objectives with provable generalization guarantees. An extensive experimental
evaluation shows that our method can improve ranking fairness substantially with
no or only little loss of model quality.
article_number: '2102.05996'
article_processing_charge: No
arxiv: 1
author:
- first_name: Nikola H
full_name: Konstantinov, Nikola H
id: 4B9D76E4-F248-11E8-B48F-1D18A9856A87
last_name: Konstantinov
orcid: 0009-0009-5204-7621
- first_name: Christoph
full_name: Lampert, Christoph
id: 40C20FD2-F248-11E8-B48F-1D18A9856A87
last_name: Lampert
orcid: 0000-0002-4561-241X
citation:
ama: Konstantinov NH, Lampert C. Fairness through regularization for learning to
rank. arXiv. doi:10.48550/arXiv.2102.05996
apa: Konstantinov, N. H., & Lampert, C. (n.d.). Fairness through regularization
for learning to rank. arXiv. https://doi.org/10.48550/arXiv.2102.05996
chicago: Konstantinov, Nikola H, and Christoph Lampert. “Fairness through Regularization
for Learning to Rank.” ArXiv, n.d. https://doi.org/10.48550/arXiv.2102.05996.
ieee: N. H. Konstantinov and C. Lampert, “Fairness through regularization for learning
to rank,” arXiv. .
ista: Konstantinov NH, Lampert C. Fairness through regularization for learning to
rank. arXiv, 2102.05996.
mla: Konstantinov, Nikola H., and Christoph Lampert. “Fairness through Regularization
for Learning to Rank.” ArXiv, 2102.05996, doi:10.48550/arXiv.2102.05996.
short: N.H. Konstantinov, C. Lampert, ArXiv (n.d.).
corr_author: '1'
date_created: 2022-02-28T14:13:59Z
date_published: 2021-06-07T00:00:00Z
date_updated: 2026-04-07T14:19:48Z
day: '07'
department:
- _id: ChLa
doi: 10.48550/arXiv.2102.05996
external_id:
arxiv:
- '2102.05996'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/2102.05996
month: '06'
oa: 1
oa_version: Preprint
publication: arXiv
publication_status: draft
related_material:
record:
- id: '10799'
relation: dissertation_contains
status: public
status: public
title: Fairness through regularization for learning to rank
type: preprint
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2021'
...
---
_id: '10806'
abstract:
- lang: eng
text: Ligands are a fundamental part of nanocrystals. They control and direct nanocrystal
syntheses and provide colloidal stability. Bound ligands also affect the nanocrystals’
chemical reactivity and electronic structure. Surface chemistry is thus crucial
to understand nanocrystal properties and functionality. Here, we investigate the
synthesis of metal oxide nanocrystals (CeO2-x, ZnO, and NiO) from metal nitrate
precursors, in the presence of oleylamine ligands. Surprisingly, the nanocrystals
are capped exclusively with a fatty acid instead of oleylamine. Analysis of the
reaction mixtures with nuclear magnetic resonance spectroscopy revealed several
reaction byproducts and intermediates that are common to the decomposition of
Ce, Zn, Ni, and Zr nitrate precursors. Our evidence supports the oxidation of
alkylamine and formation of a carboxylic acid, thus unraveling this counterintuitive
surface chemistry.
acknowledgement: 'This work was financially supported by IST Austria and the Werner
Siemens Foundation. M.C. has received funding from the European Union’s Horizon
2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement
No. 665385. The work was also financially supported by University of Basel, SNSF
NCCR Molecular Systems Engineering (project number: 182895) and SNSF R’equip (project
number: 189622). J.L. is a Serra Húnter Fellow and is grateful to ICREA Academia
program and MICINN/FEDER RTI2018-093996-B-C31 and GC 2017 SGR 128 projects.'
article_processing_charge: Yes (via OA deal)
article_type: original
author:
- first_name: Mariano
full_name: Calcabrini, Mariano
id: 45D7531A-F248-11E8-B48F-1D18A9856A87
last_name: Calcabrini
orcid: 0000-0003-4566-5877
- first_name: Dietger
full_name: Van den Eynden, Dietger
last_name: Van den Eynden
- first_name: Sergi
full_name: Sanchez Ribot, Sergi
id: ddae5a59-f6e0-11ea-865d-d9dc61e77a2a
last_name: Sanchez Ribot
- first_name: Rohan
full_name: Pokratath, Rohan
last_name: Pokratath
- first_name: Jordi
full_name: Llorca, Jordi
last_name: Llorca
- first_name: Jonathan
full_name: De Roo, Jonathan
last_name: De Roo
- first_name: Maria
full_name: Ibáñez, Maria
id: 43C61214-F248-11E8-B48F-1D18A9856A87
last_name: Ibáñez
orcid: 0000-0001-5013-2843
citation:
ama: 'Calcabrini M, Van den Eynden D, Sanchez Ribot S, et al. Ligand conversion
in nanocrystal synthesis: The oxidation of alkylamines to fatty acids by nitrate.
JACS Au. 2021;1(11):1898-1903. doi:10.1021/jacsau.1c00349'
apa: 'Calcabrini, M., Van den Eynden, D., Sanchez Ribot, S., Pokratath, R., Llorca,
J., De Roo, J., & Ibáñez, M. (2021). Ligand conversion in nanocrystal synthesis:
The oxidation of alkylamines to fatty acids by nitrate. JACS Au. American
Chemical Society. https://doi.org/10.1021/jacsau.1c00349'
chicago: 'Calcabrini, Mariano, Dietger Van den Eynden, Sergi Sanchez Ribot, Rohan
Pokratath, Jordi Llorca, Jonathan De Roo, and Maria Ibáñez. “Ligand Conversion
in Nanocrystal Synthesis: The Oxidation of Alkylamines to Fatty Acids by Nitrate.”
JACS Au. American Chemical Society, 2021. https://doi.org/10.1021/jacsau.1c00349.'
ieee: 'M. Calcabrini et al., “Ligand conversion in nanocrystal synthesis:
The oxidation of alkylamines to fatty acids by nitrate,” JACS Au, vol.
1, no. 11. American Chemical Society, pp. 1898–1903, 2021.'
ista: 'Calcabrini M, Van den Eynden D, Sanchez Ribot S, Pokratath R, Llorca J, De
Roo J, Ibáñez M. 2021. Ligand conversion in nanocrystal synthesis: The oxidation
of alkylamines to fatty acids by nitrate. JACS Au. 1(11), 1898–1903.'
mla: 'Calcabrini, Mariano, et al. “Ligand Conversion in Nanocrystal Synthesis: The
Oxidation of Alkylamines to Fatty Acids by Nitrate.” JACS Au, vol. 1, no.
11, American Chemical Society, 2021, pp. 1898–903, doi:10.1021/jacsau.1c00349.'
short: M. Calcabrini, D. Van den Eynden, S. Sanchez Ribot, R. Pokratath, J. Llorca,
J. De Roo, M. Ibáñez, JACS Au 1 (2021) 1898–1903.
corr_author: '1'
date_created: 2022-03-02T15:24:16Z
date_published: 2021-11-22T00:00:00Z
date_updated: 2026-04-07T13:26:13Z
day: '22'
ddc:
- '540'
department:
- _id: MaIb
doi: 10.1021/jacsau.1c00349
ec_funded: 1
file:
- access_level: open_access
checksum: 1c66a35369e911312a359111420318a9
content_type: application/pdf
creator: cchlebak
date_created: 2022-03-02T15:33:18Z
date_updated: 2022-03-02T15:33:18Z
file_id: '10807'
file_name: 2021_JACSAu_Calcabrini.pdf
file_size: 1257973
relation: main_file
success: 1
file_date_updated: 2022-03-02T15:33:18Z
has_accepted_license: '1'
intvolume: ' 1'
issue: '11'
keyword:
- general medicine
language:
- iso: eng
month: '11'
oa: 1
oa_version: Published Version
page: 1898-1903
project:
- _id: 2564DBCA-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '665385'
name: International IST Doctoral Program
- _id: 9B8F7476-BA93-11EA-9121-9846C619BF3A
name: 'HighTE: The Werner Siemens Laboratory for the High Throughput Discovery of
Semiconductors for Waste Heat Recovery'
- _id: B67AFEDC-15C9-11EA-A837-991A96BB2854
name: IST Austria Open Access Fund
publication: JACS Au
publication_identifier:
eissn:
- 2691-3704
issn:
- 2691-3704
publication_status: published
publisher: American Chemical Society
quality_controlled: '1'
related_material:
link:
- relation: earlier_version
url: https://doi.org/10.26434/chemrxiv-2021-cn2fr
record:
- id: '12885'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: 'Ligand conversion in nanocrystal synthesis: The oxidation of alkylamines to
fatty acids by nitrate'
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
volume: 1
year: '2021'
...
---
_id: '10809'
abstract:
- lang: eng
text: Thermoelectric materials are engines that convert heat into an electrical
current. Intuitively, the efficiency of this process depends on how many electrons
(charge carriers) can move and how easily they do so, how much energy those moving
electrons transport, and how easily the temperature gradient is maintained. In
terms of material properties, an excellent thermoelectric material requires a
high electrical conductivity σ, a high Seebeck coefficient S (a measure of the
induced thermoelectric voltage as a function of temperature gradient), and a low
thermal conductivity κ. The challenge is that these three properties are strongly
interrelated in a conflicting manner (1). On page 722 of this issue, Roychowdhury
et al. (2) have found a way to partially break these ties in silver antimony telluride
(AgSbTe2) with the addition of cadmium (Cd) cations, which increase the ordering
in this inherently disordered thermoelectric material.
article_processing_charge: No
article_type: letter_note
author:
- first_name: Yu
full_name: Liu, Yu
id: 2A70014E-F248-11E8-B48F-1D18A9856A87
last_name: Liu
orcid: 0000-0001-7313-6740
- first_name: Maria
full_name: Ibáñez, Maria
id: 43C61214-F248-11E8-B48F-1D18A9856A87
last_name: Ibáñez
orcid: 0000-0001-5013-2843
citation:
ama: Liu Y, Ibáñez M. Tidying up the mess. Science. 2021;371(6530):678-679.
doi:10.1126/science.abg0886
apa: Liu, Y., & Ibáñez, M. (2021). Tidying up the mess. Science. American
Association for the Advancement of Science. https://doi.org/10.1126/science.abg0886
chicago: Liu, Yu, and Maria Ibáñez. “Tidying up the Mess.” Science. American
Association for the Advancement of Science, 2021. https://doi.org/10.1126/science.abg0886.
ieee: Y. Liu and M. Ibáñez, “Tidying up the mess,” Science, vol. 371, no.
6530. American Association for the Advancement of Science, pp. 678–679, 2021.
ista: Liu Y, Ibáñez M. 2021. Tidying up the mess. Science. 371(6530), 678–679.
mla: Liu, Yu, and Maria Ibáñez. “Tidying up the Mess.” Science, vol. 371,
no. 6530, American Association for the Advancement of Science, 2021, pp. 678–79,
doi:10.1126/science.abg0886.
short: Y. Liu, M. Ibáñez, Science 371 (2021) 678–679.
corr_author: '1'
date_created: 2022-03-03T09:51:48Z
date_published: 2021-02-12T00:00:00Z
date_updated: 2024-10-09T21:01:45Z
day: '12'
department:
- _id: MaIb
doi: 10.1126/science.abg0886
external_id:
isi:
- '000617551600027'
pmid:
- '33574201'
intvolume: ' 371'
isi: 1
issue: '6530'
keyword:
- multidisciplinary
language:
- iso: eng
month: '02'
oa_version: None
page: 678-679
pmid: 1
publication: Science
publication_identifier:
eissn:
- 1095-9203
issn:
- 0036-8075
publication_status: published
publisher: American Association for the Advancement of Science
quality_controlled: '1'
scopus_import: '1'
status: public
title: Tidying up the mess
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 371
year: '2021'
...
---
_id: '7685'
abstract:
- lang: eng
text: We consider a gas of interacting bosons trapped in a box of side length one
in the Gross–Pitaevskii limit. We review the proof of the validity of Bogoliubov’s
prediction for the ground state energy and the low-energy excitation spectrum.
This note is based on joint work with C. Brennecke, S. Cenatiempo and B. Schlein.
article_number: '2060006'
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Chiara
full_name: Boccato, Chiara
id: 342E7E22-F248-11E8-B48F-1D18A9856A87
last_name: Boccato
citation:
ama: Boccato C. The excitation spectrum of the Bose gas in the Gross-Pitaevskii
regime. Reviews in Mathematical Physics. 2021;33(1). doi:10.1142/S0129055X20600065
apa: Boccato, C. (2021). The excitation spectrum of the Bose gas in the Gross-Pitaevskii
regime. Reviews in Mathematical Physics. World Scientific Publishing. https://doi.org/10.1142/S0129055X20600065
chicago: Boccato, Chiara. “The Excitation Spectrum of the Bose Gas in the Gross-Pitaevskii
Regime.” Reviews in Mathematical Physics. World Scientific Publishing,
2021. https://doi.org/10.1142/S0129055X20600065.
ieee: C. Boccato, “The excitation spectrum of the Bose gas in the Gross-Pitaevskii
regime,” Reviews in Mathematical Physics, vol. 33, no. 1. World Scientific
Publishing, 2021.
ista: Boccato C. 2021. The excitation spectrum of the Bose gas in the Gross-Pitaevskii
regime. Reviews in Mathematical Physics. 33(1), 2060006.
mla: Boccato, Chiara. “The Excitation Spectrum of the Bose Gas in the Gross-Pitaevskii
Regime.” Reviews in Mathematical Physics, vol. 33, no. 1, 2060006, World
Scientific Publishing, 2021, doi:10.1142/S0129055X20600065.
short: C. Boccato, Reviews in Mathematical Physics 33 (2021).
date_created: 2020-04-26T22:00:45Z
date_published: 2021-01-01T00:00:00Z
date_updated: 2025-05-14T10:49:57Z
day: '01'
department:
- _id: RoSe
doi: 10.1142/S0129055X20600065
ec_funded: 1
external_id:
arxiv:
- '2001.00497'
isi:
- '000613313200007'
intvolume: ' 33'
isi: 1
issue: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/2001.00497
month: '01'
oa: 1
oa_version: Preprint
project:
- _id: 25C6DC12-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '694227'
name: Analysis of quantum many-body systems
publication: Reviews in Mathematical Physics
publication_identifier:
issn:
- 0129-055X
publication_status: published
publisher: World Scientific Publishing
quality_controlled: '1'
scopus_import: '1'
status: public
title: The excitation spectrum of the Bose gas in the Gross-Pitaevskii regime
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 33
year: '2021'
...
---
_id: '7900'
abstract:
- lang: eng
text: Hartree–Fock theory has been justified as a mean-field approximation for fermionic
systems. However, it suffers from some defects in predicting physical properties,
making necessary a theory of quantum correlations. Recently, bosonization of many-body
correlations has been rigorously justified as an upper bound on the correlation
energy at high density with weak interactions. We review the bosonic approximation,
deriving an effective Hamiltonian. We then show that for systems with Coulomb
interaction this effective theory predicts collective excitations (plasmons) in
accordance with the random phase approximation of Bohm and Pines, and with experimental
observation.
article_number: '2060009'
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Niels P
full_name: Benedikter, Niels P
id: 3DE6C32A-F248-11E8-B48F-1D18A9856A87
last_name: Benedikter
orcid: 0000-0002-1071-6091
citation:
ama: Benedikter NP. Bosonic collective excitations in Fermi gases. Reviews in
Mathematical Physics. 2021;33(1). doi:10.1142/s0129055x20600090
apa: Benedikter, N. P. (2021). Bosonic collective excitations in Fermi gases. Reviews
in Mathematical Physics. World Scientific Publishing. https://doi.org/10.1142/s0129055x20600090
chicago: Benedikter, Niels P. “Bosonic Collective Excitations in Fermi Gases.” Reviews
in Mathematical Physics. World Scientific Publishing, 2021. https://doi.org/10.1142/s0129055x20600090.
ieee: N. P. Benedikter, “Bosonic collective excitations in Fermi gases,” Reviews
in Mathematical Physics, vol. 33, no. 1. World Scientific Publishing, 2021.
ista: Benedikter NP. 2021. Bosonic collective excitations in Fermi gases. Reviews
in Mathematical Physics. 33(1), 2060009.
mla: Benedikter, Niels P. “Bosonic Collective Excitations in Fermi Gases.” Reviews
in Mathematical Physics, vol. 33, no. 1, 2060009, World Scientific Publishing,
2021, doi:10.1142/s0129055x20600090.
short: N.P. Benedikter, Reviews in Mathematical Physics 33 (2021).
date_created: 2020-05-28T16:47:55Z
date_published: 2021-01-01T00:00:00Z
date_updated: 2025-05-14T10:49:46Z
day: '01'
department:
- _id: RoSe
doi: 10.1142/s0129055x20600090
ec_funded: 1
external_id:
arxiv:
- '1910.08190'
isi:
- '000613313200010'
intvolume: ' 33'
isi: 1
issue: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1910.08190
month: '01'
oa: 1
oa_version: Preprint
project:
- _id: 25C6DC12-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '694227'
name: Analysis of quantum many-body systems
publication: Reviews in Mathematical Physics
publication_identifier:
eissn:
- 1793-6659
issn:
- 0129-055X
publication_status: published
publisher: World Scientific Publishing
quality_controlled: '1'
scopus_import: '1'
status: public
title: Bosonic collective excitations in Fermi gases
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 33
year: '2021'
...
---
_id: '7901'
abstract:
- lang: eng
text: We derive rigorously the leading order of the correlation energy of a Fermi
gas in a scaling regime of high density and weak interaction. The result verifies
the prediction of the random-phase approximation. Our proof refines the method
of collective bosonization in three dimensions. We approximately diagonalize an
effective Hamiltonian describing approximately bosonic collective excitations
around the Hartree–Fock state, while showing that gapless and non-collective excitations
have only a negligible effect on the ground state energy.
acknowledgement: We thank Christian Hainzl for helpful discussions and a referee for
very careful reading of the paper and many helpful suggestions. NB and RS were supported
by the European Research Council (ERC) under the European Union’s Horizon 2020 research
and innovation programme (grant agreement No. 694227). Part of the research of NB
was conducted on the RZD18 Nice–Milan–Vienna–Moscow. NB thanks Elliott H. Lieb and
Peter Otte for explanations about the Luttinger model. PTN has received funding
from the Deutsche Forschungsgemeinschaft (DFG, German Research Foundation) under
Germany’s Excellence Strategy (EXC-2111-390814868). MP acknowledges financial support
from the European Research Council (ERC) under the European Union’s Horizon 2020
research and innovation programme (ERC StG MaMBoQ, grant agreement No. 802901).
BS gratefully acknowledges financial support from the NCCR SwissMAP, from the Swiss
National Science Foundation through the Grant “Dynamical and energetic properties
of Bose-Einstein condensates” and from the European Research Council through the
ERC-AdG CLaQS (grant agreement No. 834782). All authors acknowledge support for
workshop participation from Mathematisches Forschungsinstitut Oberwolfach (Leibniz
Association). NB, PTN, BS, and RS acknowledge support for workshop participation
from Fondation des Treilles.
article_processing_charge: Yes (via OA deal)
article_type: original
arxiv: 1
author:
- first_name: Niels P
full_name: Benedikter, Niels P
id: 3DE6C32A-F248-11E8-B48F-1D18A9856A87
last_name: Benedikter
orcid: 0000-0002-1071-6091
- first_name: Phan Thành
full_name: Nam, Phan Thành
last_name: Nam
- first_name: Marcello
full_name: Porta, Marcello
last_name: Porta
- first_name: Benjamin
full_name: Schlein, Benjamin
last_name: Schlein
- first_name: Robert
full_name: Seiringer, Robert
id: 4AFD0470-F248-11E8-B48F-1D18A9856A87
last_name: Seiringer
orcid: 0000-0002-6781-0521
citation:
ama: Benedikter NP, Nam PT, Porta M, Schlein B, Seiringer R. Correlation energy
of a weakly interacting Fermi gas. Inventiones Mathematicae. 2021;225:885-979.
doi:10.1007/s00222-021-01041-5
apa: Benedikter, N. P., Nam, P. T., Porta, M., Schlein, B., & Seiringer, R.
(2021). Correlation energy of a weakly interacting Fermi gas. Inventiones Mathematicae.
Springer. https://doi.org/10.1007/s00222-021-01041-5
chicago: Benedikter, Niels P, Phan Thành Nam, Marcello Porta, Benjamin Schlein,
and Robert Seiringer. “Correlation Energy of a Weakly Interacting Fermi Gas.”
Inventiones Mathematicae. Springer, 2021. https://doi.org/10.1007/s00222-021-01041-5.
ieee: N. P. Benedikter, P. T. Nam, M. Porta, B. Schlein, and R. Seiringer, “Correlation
energy of a weakly interacting Fermi gas,” Inventiones Mathematicae, vol.
225. Springer, pp. 885–979, 2021.
ista: Benedikter NP, Nam PT, Porta M, Schlein B, Seiringer R. 2021. Correlation
energy of a weakly interacting Fermi gas. Inventiones Mathematicae. 225, 885–979.
mla: Benedikter, Niels P., et al. “Correlation Energy of a Weakly Interacting Fermi
Gas.” Inventiones Mathematicae, vol. 225, Springer, 2021, pp. 885–979,
doi:10.1007/s00222-021-01041-5.
short: N.P. Benedikter, P.T. Nam, M. Porta, B. Schlein, R. Seiringer, Inventiones
Mathematicae 225 (2021) 885–979.
date_created: 2020-05-28T16:48:20Z
date_published: 2021-05-03T00:00:00Z
date_updated: 2025-04-14T07:27:00Z
day: '03'
ddc:
- '510'
department:
- _id: RoSe
doi: 10.1007/s00222-021-01041-5
ec_funded: 1
external_id:
arxiv:
- '2005.08933'
isi:
- '000646573600001'
file:
- access_level: open_access
checksum: f38c79dfd828cdc7f49a34b37b83d376
content_type: application/pdf
creator: dernst
date_created: 2022-05-16T12:23:40Z
date_updated: 2022-05-16T12:23:40Z
file_id: '11386'
file_name: 2021_InventMath_Benedikter.pdf
file_size: 1089319
relation: main_file
success: 1
file_date_updated: 2022-05-16T12:23:40Z
has_accepted_license: '1'
intvolume: ' 225'
isi: 1
language:
- iso: eng
month: '05'
oa: 1
oa_version: Published Version
page: 885-979
project:
- _id: B67AFEDC-15C9-11EA-A837-991A96BB2854
name: IST Austria Open Access Fund
- _id: 25C6DC12-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '694227'
name: Analysis of quantum many-body systems
publication: Inventiones Mathematicae
publication_identifier:
eissn:
- 1432-1297
issn:
- 0020-9910
publication_status: published
publisher: Springer
quality_controlled: '1'
scopus_import: '1'
status: public
title: Correlation energy of a weakly interacting Fermi gas
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 225
year: '2021'
...
---
_id: '7905'
abstract:
- lang: eng
text: We investigate a sheaf-theoretic interpretation of stratification learning
from geometric and topological perspectives. Our main result is the construction
of stratification learning algorithms framed in terms of a sheaf on a partially
ordered set with the Alexandroff topology. We prove that the resulting decomposition
is the unique minimal stratification for which the strata are homogeneous and
the given sheaf is constructible. In particular, when we choose to work with the
local homology sheaf, our algorithm gives an alternative to the local homology
transfer algorithm given in Bendich et al. (Proceedings of the 23rd Annual ACM-SIAM
Symposium on Discrete Algorithms, pp. 1355–1370, ACM, New York, 2012), and the
cohomology stratification algorithm given in Nanda (Found. Comput. Math. 20(2),
195–222, 2020). Additionally, we give examples of stratifications based on the
geometric techniques of Breiding et al. (Rev. Mat. Complut. 31(3), 545–593, 2018),
illustrating how the sheaf-theoretic approach can be used to study stratifications
from both topological and geometric perspectives. This approach also points toward
future applications of sheaf theory in the study of topological data analysis
by illustrating the utility of the language of sheaf theory in generalizing existing
algorithms.
acknowledgement: Open access funding provided by Institute of Science and Technology
(IST Austria). This work was partially supported by NSF IIS-1513616 and NSF ABI-1661375.
The authors would like to thank the anonymous referees for their insightful comments.
article_processing_charge: Yes (via OA deal)
article_type: original
arxiv: 1
author:
- first_name: Adam
full_name: Brown, Adam
id: 70B7FDF6-608D-11E9-9333-8535E6697425
last_name: Brown
- first_name: Bei
full_name: Wang, Bei
last_name: Wang
citation:
ama: Brown A, Wang B. Sheaf-theoretic stratification learning from geometric and
topological perspectives. Discrete and Computational Geometry. 2021;65:1166-1198.
doi:10.1007/s00454-020-00206-y
apa: Brown, A., & Wang, B. (2021). Sheaf-theoretic stratification learning from
geometric and topological perspectives. Discrete and Computational Geometry.
Springer Nature. https://doi.org/10.1007/s00454-020-00206-y
chicago: Brown, Adam, and Bei Wang. “Sheaf-Theoretic Stratification Learning from
Geometric and Topological Perspectives.” Discrete and Computational Geometry.
Springer Nature, 2021. https://doi.org/10.1007/s00454-020-00206-y.
ieee: A. Brown and B. Wang, “Sheaf-theoretic stratification learning from geometric
and topological perspectives,” Discrete and Computational Geometry, vol.
65. Springer Nature, pp. 1166–1198, 2021.
ista: Brown A, Wang B. 2021. Sheaf-theoretic stratification learning from geometric
and topological perspectives. Discrete and Computational Geometry. 65, 1166–1198.
mla: Brown, Adam, and Bei Wang. “Sheaf-Theoretic Stratification Learning from Geometric
and Topological Perspectives.” Discrete and Computational Geometry, vol.
65, Springer Nature, 2021, pp. 1166–98, doi:10.1007/s00454-020-00206-y.
short: A. Brown, B. Wang, Discrete and Computational Geometry 65 (2021) 1166–1198.
corr_author: '1'
date_created: 2020-05-30T10:26:04Z
date_published: 2021-06-01T00:00:00Z
date_updated: 2025-04-15T06:53:15Z
day: '01'
ddc:
- '510'
department:
- _id: HeEd
doi: 10.1007/s00454-020-00206-y
external_id:
arxiv:
- '1712.07734'
isi:
- '000536324700001'
file:
- access_level: open_access
checksum: 487a84ea5841b75f04f66d7ebd71b67e
content_type: application/pdf
creator: dernst
date_created: 2020-11-25T09:06:41Z
date_updated: 2020-11-25T09:06:41Z
file_id: '8803'
file_name: 2020_DiscreteCompGeometry_Brown.pdf
file_size: 1013730
relation: main_file
success: 1
file_date_updated: 2020-11-25T09:06:41Z
has_accepted_license: '1'
intvolume: ' 65'
isi: 1
language:
- iso: eng
month: '06'
oa: 1
oa_version: Published Version
page: 1166-1198
project:
- _id: B67AFEDC-15C9-11EA-A837-991A96BB2854
name: IST Austria Open Access Fund
publication: Discrete and Computational Geometry
publication_identifier:
eissn:
- 1432-0444
issn:
- 0179-5376
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Sheaf-theoretic stratification learning from geometric and topological perspectives
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 65
year: '2021'
...
---
_id: '7925'
abstract:
- lang: eng
text: In this paper, we introduce a relaxed CQ method with alternated inertial step
for solving split feasibility problems. We give convergence of the sequence generated
by our method under some suitable assumptions. Some numerical implementations
from sparse signal and image deblurring are reported to show the efficiency of
our method.
acknowledgement: Open access funding provided by Institute of Science and Technology
(IST Austria). The authors are grateful to the referees for their insightful comments
which have improved the earlier version of the manuscript greatly. The first author
has received funding from the European Research Council (ERC) under the European
Union’s Seventh Framework Program (FP7-2007-2013) (Grant agreement No. 616160).
article_processing_charge: Yes (via OA deal)
article_type: original
author:
- first_name: Yekini
full_name: Shehu, Yekini
id: 3FC7CB58-F248-11E8-B48F-1D18A9856A87
last_name: Shehu
orcid: 0000-0001-9224-7139
- first_name: Aviv
full_name: Gibali, Aviv
last_name: Gibali
citation:
ama: Shehu Y, Gibali A. New inertial relaxed method for solving split feasibilities.
Optimization Letters. 2021;15:2109-2126. doi:10.1007/s11590-020-01603-1
apa: Shehu, Y., & Gibali, A. (2021). New inertial relaxed method for solving
split feasibilities. Optimization Letters. Springer Nature. https://doi.org/10.1007/s11590-020-01603-1
chicago: Shehu, Yekini, and Aviv Gibali. “New Inertial Relaxed Method for Solving
Split Feasibilities.” Optimization Letters. Springer Nature, 2021. https://doi.org/10.1007/s11590-020-01603-1.
ieee: Y. Shehu and A. Gibali, “New inertial relaxed method for solving split feasibilities,”
Optimization Letters, vol. 15. Springer Nature, pp. 2109–2126, 2021.
ista: Shehu Y, Gibali A. 2021. New inertial relaxed method for solving split feasibilities.
Optimization Letters. 15, 2109–2126.
mla: Shehu, Yekini, and Aviv Gibali. “New Inertial Relaxed Method for Solving Split
Feasibilities.” Optimization Letters, vol. 15, Springer Nature, 2021, pp.
2109–26, doi:10.1007/s11590-020-01603-1.
short: Y. Shehu, A. Gibali, Optimization Letters 15 (2021) 2109–2126.
corr_author: '1'
date_created: 2020-06-04T11:28:33Z
date_published: 2021-09-01T00:00:00Z
date_updated: 2024-11-04T13:52:35Z
day: '01'
ddc:
- '510'
department:
- _id: VlKo
doi: 10.1007/s11590-020-01603-1
ec_funded: 1
external_id:
isi:
- '000537342300001'
file:
- access_level: open_access
checksum: 63c5f31cd04626152a19f97a2476281b
content_type: application/pdf
creator: kschuh
date_created: 2024-03-07T14:58:51Z
date_updated: 2024-03-07T14:58:51Z
file_id: '15089'
file_name: 2021_OptimizationLetters_Shehu.pdf
file_size: 2148882
relation: main_file
success: 1
file_date_updated: 2024-03-07T14:58:51Z
has_accepted_license: '1'
intvolume: ' 15'
isi: 1
language:
- iso: eng
month: '09'
oa: 1
oa_version: Published Version
page: 2109-2126
project:
- _id: 25FBA906-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '616160'
name: 'Discrete Optimization in Computer Vision: Theory and Practice'
- _id: B67AFEDC-15C9-11EA-A837-991A96BB2854
name: IST Austria Open Access Fund
publication: Optimization Letters
publication_identifier:
eissn:
- 1862-4480
issn:
- 1862-4472
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: New inertial relaxed method for solving split feasibilities
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 15
year: '2021'
...
---
_id: '7939'
abstract:
- lang: eng
text: "We design fast deterministic algorithms for distance computation in the Congested
Clique model. Our key contributions include:\r\n A (2+ϵ)-approximation for
all-pairs shortest paths in O(log2n/ϵ) rounds on unweighted undirected graphs.
With a small additional additive factor, this also applies for weighted graphs.
This is the first sub-polynomial constant-factor approximation for APSP in this
model.\r\n A (1+ϵ)-approximation for multi-source shortest paths from O(n−−√)
sources in O(log2n/ϵ) rounds on weighted undirected graphs. This is the first
sub-polynomial algorithm obtaining this approximation for a set of sources of
polynomial size.\r\n\r\nOur main techniques are new distance tools that are obtained
via improved algorithms for sparse matrix multiplication, which we leverage to
construct efficient hopsets and shortest paths. Furthermore, our techniques extend
to additional distance problems for which we improve upon the state-of-the-art,
including diameter approximation, and an exact single-source shortest paths algorithm
for weighted undirected graphs in O~(n1/6) rounds. "
acknowledgement: Open access funding provided by Institute of Science and Technology
(IST Austria). We thank Mohsen Ghaffari, Michael Elkin and Merav Parter for fruitful
discussions. This project has received funding from the European Union’s Horizon
2020 Research And Innovation Program under Grant Agreement No. 755839.
article_processing_charge: Yes (via OA deal)
article_type: original
arxiv: 1
author:
- first_name: Keren
full_name: Censor-Hillel, Keren
last_name: Censor-Hillel
- first_name: Michal
full_name: Dory, Michal
last_name: Dory
- first_name: Janne
full_name: Korhonen, Janne
id: C5402D42-15BC-11E9-A202-CA2BE6697425
last_name: Korhonen
- first_name: Dean
full_name: Leitersdorf, Dean
last_name: Leitersdorf
citation:
ama: Censor-Hillel K, Dory M, Korhonen J, Leitersdorf D. Fast approximate shortest
paths in the congested clique. Distributed Computing. 2021;34:463-487.
doi:10.1007/s00446-020-00380-5
apa: Censor-Hillel, K., Dory, M., Korhonen, J., & Leitersdorf, D. (2021). Fast
approximate shortest paths in the congested clique. Distributed Computing.
Springer Nature. https://doi.org/10.1007/s00446-020-00380-5
chicago: Censor-Hillel, Keren, Michal Dory, Janne Korhonen, and Dean Leitersdorf.
“Fast Approximate Shortest Paths in the Congested Clique.” Distributed Computing.
Springer Nature, 2021. https://doi.org/10.1007/s00446-020-00380-5.
ieee: K. Censor-Hillel, M. Dory, J. Korhonen, and D. Leitersdorf, “Fast approximate
shortest paths in the congested clique,” Distributed Computing, vol. 34.
Springer Nature, pp. 463–487, 2021.
ista: Censor-Hillel K, Dory M, Korhonen J, Leitersdorf D. 2021. Fast approximate
shortest paths in the congested clique. Distributed Computing. 34, 463–487.
mla: Censor-Hillel, Keren, et al. “Fast Approximate Shortest Paths in the Congested
Clique.” Distributed Computing, vol. 34, Springer Nature, 2021, pp. 463–87,
doi:10.1007/s00446-020-00380-5.
short: K. Censor-Hillel, M. Dory, J. Korhonen, D. Leitersdorf, Distributed Computing
34 (2021) 463–487.
corr_author: '1'
date_created: 2020-06-07T22:00:54Z
date_published: 2021-12-01T00:00:00Z
date_updated: 2026-06-18T19:28:41Z
day: '01'
ddc:
- '000'
department:
- _id: DaAl
doi: 10.1007/s00446-020-00380-5
external_id:
arxiv:
- '1903.05956'
isi:
- '000556444600001'
intvolume: ' 34'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1007/s00446-020-00380-5
month: '12'
oa: 1
oa_version: Published Version
page: 463-487
project:
- _id: B67AFEDC-15C9-11EA-A837-991A96BB2854
name: IST Austria Open Access Fund
publication: Distributed Computing
publication_identifier:
eissn:
- 1432-0452
issn:
- 0178-2770
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
related_material:
record:
- id: '6933'
relation: earlier_version
status: public
scopus_import: '1'
status: public
title: Fast approximate shortest paths in the congested clique
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 34
year: '2021'
...
---
_id: '7941'
abstract:
- lang: eng
text: Expansion microscopy is a recently developed super-resolution imaging technique,
which provides an alternative to optics-based methods such as deterministic approaches
(e.g. STED) or stochastic approaches (e.g. PALM/STORM). The idea behind expansion
microscopy is to embed the biological sample in a swellable gel, and then to expand
it isotropically, thereby increasing the distance between the fluorophores. This
approach breaks the diffraction barrier by simply separating the emission point-spread-functions
of the fluorophores. The resolution attainable in expansion microscopy is thus
directly dependent on the separation that can be achieved, i.e. on the expansion
factor. The original implementation of the technique achieved an expansion factor
of fourfold, for a resolution of 70–80 nm. The subsequently developed X10 method
achieves an expansion factor of 10-fold, for a resolution of 25–30 nm. This technique
can be implemented with minimal technical requirements on any standard fluorescence
microscope, and is more easily applied for multi-color imaging than either deterministic
or stochastic super-resolution approaches. This renders X10 expansion microscopy
a highly promising tool for new biological discoveries, as discussed here, and
as demonstrated by several recent applications.
article_processing_charge: No
author:
- first_name: Sven M
full_name: Truckenbrodt, Sven M
id: 45812BD4-F248-11E8-B48F-1D18A9856A87
last_name: Truckenbrodt
- first_name: Silvio O.
full_name: Rizzoli, Silvio O.
last_name: Rizzoli
citation:
ama: 'Truckenbrodt SM, Rizzoli SO. Simple multi-color super-resolution by X10 microscopy.
In: Methods in Cell Biology. Vol 161. Elsevier; 2021:33-56. doi:10.1016/bs.mcb.2020.04.016'
apa: Truckenbrodt, S. M., & Rizzoli, S. O. (2021). Simple multi-color super-resolution
by X10 microscopy. In Methods in Cell Biology (Vol. 161, pp. 33–56). Elsevier.
https://doi.org/10.1016/bs.mcb.2020.04.016
chicago: Truckenbrodt, Sven M, and Silvio O. Rizzoli. “Simple Multi-Color Super-Resolution
by X10 Microscopy.” In Methods in Cell Biology, 161:33–56. Elsevier, 2021.
https://doi.org/10.1016/bs.mcb.2020.04.016.
ieee: S. M. Truckenbrodt and S. O. Rizzoli, “Simple multi-color super-resolution
by X10 microscopy,” in Methods in Cell Biology, vol. 161, Elsevier, 2021,
pp. 33–56.
ista: 'Truckenbrodt SM, Rizzoli SO. 2021.Simple multi-color super-resolution by
X10 microscopy. In: Methods in Cell Biology. vol. 161, 33–56.'
mla: Truckenbrodt, Sven M., and Silvio O. Rizzoli. “Simple Multi-Color Super-Resolution
by X10 Microscopy.” Methods in Cell Biology, vol. 161, Elsevier, 2021,
pp. 33–56, doi:10.1016/bs.mcb.2020.04.016.
short: S.M. Truckenbrodt, S.O. Rizzoli, in:, Methods in Cell Biology, Elsevier,
2021, pp. 33–56.
corr_author: '1'
date_created: 2020-06-07T22:00:55Z
date_published: 2021-01-01T00:00:00Z
date_updated: 2024-10-09T20:59:36Z
day: '01'
department:
- _id: JoDa
doi: 10.1016/bs.mcb.2020.04.016
external_id:
pmid:
- '33478696'
intvolume: ' 161'
language:
- iso: eng
month: '01'
oa_version: None
page: 33-56
pmid: 1
publication: Methods in Cell Biology
publication_identifier:
isbn:
- 978012820807-6
issn:
- 0091-679X
publication_status: published
publisher: Elsevier
quality_controlled: '1'
scopus_import: '1'
status: public
title: Simple multi-color super-resolution by X10 microscopy
type: book_chapter
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 161
year: '2021'
...
---
_id: '8196'
abstract:
- lang: eng
text: This paper aims to obtain a strong convergence result for a Douglas–Rachford
splitting method with inertial extrapolation step for finding a zero of the sum
of two set-valued maximal monotone operators without any further assumption of
uniform monotonicity on any of the involved maximal monotone operators. Furthermore,
our proposed method is easy to implement and the inertial factor in our proposed
method is a natural choice. Our method of proof is of independent interest. Finally,
some numerical implementations are given to confirm the theoretical analysis.
acknowledgement: Open access funding provided by Institute of Science and Technology
(IST Austria). The project of Yekini Shehu has received funding from the European
Research Council (ERC) under the European Union’s Seventh Framework Program (FP7—2007–2013)
(Grant Agreement No. 616160). The authors are grateful to the anonymous referees
and the handling Editor for their comments and suggestions which have improved the
earlier version of the manuscript greatly.
article_processing_charge: Yes (via OA deal)
article_type: original
author:
- first_name: Yekini
full_name: Shehu, Yekini
id: 3FC7CB58-F248-11E8-B48F-1D18A9856A87
last_name: Shehu
orcid: 0000-0001-9224-7139
- first_name: Qiao-Li
full_name: Dong, Qiao-Li
last_name: Dong
- first_name: Lu-Lu
full_name: Liu, Lu-Lu
last_name: Liu
- first_name: Jen-Chih
full_name: Yao, Jen-Chih
last_name: Yao
citation:
ama: Shehu Y, Dong Q-L, Liu L-L, Yao J-C. New strong convergence method for the
sum of two maximal monotone operators. Optimization and Engineering. 2021;22:2627-2653.
doi:10.1007/s11081-020-09544-5
apa: Shehu, Y., Dong, Q.-L., Liu, L.-L., & Yao, J.-C. (2021). New strong convergence
method for the sum of two maximal monotone operators. Optimization and Engineering.
Springer Nature. https://doi.org/10.1007/s11081-020-09544-5
chicago: Shehu, Yekini, Qiao-Li Dong, Lu-Lu Liu, and Jen-Chih Yao. “New Strong Convergence
Method for the Sum of Two Maximal Monotone Operators.” Optimization and Engineering.
Springer Nature, 2021. https://doi.org/10.1007/s11081-020-09544-5.
ieee: Y. Shehu, Q.-L. Dong, L.-L. Liu, and J.-C. Yao, “New strong convergence method
for the sum of two maximal monotone operators,” Optimization and Engineering,
vol. 22. Springer Nature, pp. 2627–2653, 2021.
ista: Shehu Y, Dong Q-L, Liu L-L, Yao J-C. 2021. New strong convergence method for
the sum of two maximal monotone operators. Optimization and Engineering. 22, 2627–2653.
mla: Shehu, Yekini, et al. “New Strong Convergence Method for the Sum of Two Maximal
Monotone Operators.” Optimization and Engineering, vol. 22, Springer Nature,
2021, pp. 2627–53, doi:10.1007/s11081-020-09544-5.
short: Y. Shehu, Q.-L. Dong, L.-L. Liu, J.-C. Yao, Optimization and Engineering
22 (2021) 2627–2653.
corr_author: '1'
date_created: 2020-08-03T14:29:57Z
date_published: 2021-02-25T00:00:00Z
date_updated: 2024-11-04T13:52:38Z
day: '25'
ddc:
- '510'
department:
- _id: VlKo
doi: 10.1007/s11081-020-09544-5
ec_funded: 1
external_id:
isi:
- '000559345400001'
file:
- access_level: open_access
content_type: application/pdf
creator: dernst
date_created: 2020-08-03T15:24:39Z
date_updated: 2020-08-03T15:24:39Z
file_id: '8197'
file_name: 2020_OptimizationEngineering_Shehu.pdf
file_size: 2137860
relation: main_file
success: 1
file_date_updated: 2020-08-03T15:24:39Z
has_accepted_license: '1'
intvolume: ' 22'
isi: 1
language:
- iso: eng
month: '02'
oa: 1
oa_version: Published Version
page: 2627-2653
project:
- _id: B67AFEDC-15C9-11EA-A837-991A96BB2854
name: IST Austria Open Access Fund
- _id: 25FBA906-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '616160'
name: 'Discrete Optimization in Computer Vision: Theory and Practice'
publication: Optimization and Engineering
publication_identifier:
eissn:
- 1573-2924
issn:
- 1389-4420
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: New strong convergence method for the sum of two maximal monotone operators
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 22
year: '2021'
...
---
_id: '8198'
abstract:
- lang: eng
text: We investigate how the critical driving amplitude at the Floquet many-body
localized (MBL) to ergodic phase transition differs between smooth and nonsmooth
drives. To this end, we numerically study a disordered spin-1/2 chain which is
periodically driven by a sine or square-wave drive over a wide range of driving
frequencies. In both cases the critical driving amplitude increases monotonically
with the frequency, and at large frequencies it is identical for the two drives.
However, at low and intermediate frequencies the critical amplitude of the square-wave
drive depends strongly on the frequency, while that of the sinusoidal drive is
almost constant over a wide frequency range. By analyzing the density of drive-induced
resonances we conclude that this difference is due to resonances induced by the
higher harmonics which are present (absent) in the Fourier spectrum of the square-wave
(sine) drive. Furthermore, we suggest a numerically efficient method for estimating
the frequency dependence of the critical driving amplitudes for different drives
which is based on calculating the density of drive-induced resonances. We conclude
that delocalization occurs once the density of drive-induced resonances reaches
a critical value determined only by the static system.
acknowledgement: We thank Y. Bar Lev, T. Biadse, and, particularly, E. Bairey and
B. Katzir for illuminating discussions and their many insights and help. The authors
thank N. Lindner for his support throughout this project. We are further grateful
to M. Serbyn, A. Kamenev, A. Turner, and S. de Nicola for reading the manuscript
and providing good feedback and suggestions. We acknowledge financial support from
the Defense Advanced Research Projects Agency through the DRINQS program, Grant
No. D18AC00025. T.G. was in part supported by an Aly Kaufman Fellowship at the Technion.
T.G. acknowledges funding from the Institute of Science and Technology (IST) Austria
and from the European Union’s Horizon 2020 research and innovation program under
Marie SkłodowskaCurie Grant Agreement No. 754411.under the Marie Skłodowska-Curie
Grant Agreement No.754411.
article_number: '214204'
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Asaf A.
full_name: Diringer, Asaf A.
last_name: Diringer
- first_name: Tobias
full_name: Gulden, Tobias
id: 1083E038-9F73-11E9-A4B5-532AE6697425
last_name: Gulden
orcid: 0000-0001-6814-7541
citation:
ama: Diringer AA, Gulden T. Impact of drive harmonics on the stability of Floquet
many-body localization. Physical Review B. 2021;103(21). doi:10.1103/PhysRevB.103.214204
apa: Diringer, A. A., & Gulden, T. (2021). Impact of drive harmonics on the
stability of Floquet many-body localization. Physical Review B. American
Physical Society. https://doi.org/10.1103/PhysRevB.103.214204
chicago: Diringer, Asaf A., and Tobias Gulden. “Impact of Drive Harmonics on the
Stability of Floquet Many-Body Localization.” Physical Review B. American
Physical Society, 2021. https://doi.org/10.1103/PhysRevB.103.214204.
ieee: A. A. Diringer and T. Gulden, “Impact of drive harmonics on the stability
of Floquet many-body localization,” Physical Review B, vol. 103, no. 21.
American Physical Society, 2021.
ista: Diringer AA, Gulden T. 2021. Impact of drive harmonics on the stability of
Floquet many-body localization. Physical Review B. 103(21), 214204.
mla: Diringer, Asaf A., and Tobias Gulden. “Impact of Drive Harmonics on the Stability
of Floquet Many-Body Localization.” Physical Review B, vol. 103, no. 21,
214204, American Physical Society, 2021, doi:10.1103/PhysRevB.103.214204.
short: A.A. Diringer, T. Gulden, Physical Review B 103 (2021).
date_created: 2020-08-04T13:03:40Z
date_published: 2021-06-21T00:00:00Z
date_updated: 2026-04-02T14:02:07Z
day: '21'
department:
- _id: MaSe
doi: 10.1103/PhysRevB.103.214204
ec_funded: 1
external_id:
arxiv:
- '2007.14879'
isi:
- '000664429700005'
intvolume: ' 103'
isi: 1
issue: '21'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/2007.14879
month: '06'
oa: 1
oa_version: Preprint
project:
- _id: 260C2330-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '754411'
name: ISTplus - Postdoctoral Fellowships
publication: Physical Review B
publication_identifier:
eissn:
- 2469-9969
issn:
- 2469-9950
publication_status: published
publisher: American Physical Society
quality_controlled: '1'
scopus_import: '1'
status: public
title: Impact of drive harmonics on the stability of Floquet many-body localization
type: journal_article
user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd
volume: 103
year: '2021'
...
---
_id: '8248'
abstract:
- lang: eng
text: 'We consider the following setting: suppose that we are given a manifold M
in Rd with positive reach. Moreover assume that we have an embedded simplical
complex A without boundary, whose vertex set lies on the manifold, is sufficiently
dense and such that all simplices in A have sufficient quality. We prove that
if, locally, interiors of the projection of the simplices onto the tangent space
do not intersect, then A is a triangulation of the manifold, that is, they are
homeomorphic.'
acknowledgement: "Open access funding provided by the Institute of Science and Technology
(IST Austria). Arijit Ghosh is supported by the Ramanujan Fellowship (No. SB/S2/RJN-064/2015),
India.\r\nThis work has been funded by the European Research Council under the European
Union’s ERC Grant Agreement number 339025 GUDHI (Algorithmic Foundations of Geometric
Understanding in Higher Dimensions). The third author is supported by Ramanujan
Fellowship (No. SB/S2/RJN-064/2015), India. The fifth author also received funding
from the European Union’s Horizon 2020 research and innovation programme under the
Marie Skłodowska-Curie Grant Agreement No. 754411."
article_processing_charge: Yes (via OA deal)
article_type: original
author:
- first_name: Jean-Daniel
full_name: Boissonnat, Jean-Daniel
last_name: Boissonnat
- first_name: Ramsay
full_name: Dyer, Ramsay
last_name: Dyer
- first_name: Arijit
full_name: Ghosh, Arijit
last_name: Ghosh
- first_name: Andre
full_name: Lieutier, Andre
last_name: Lieutier
- first_name: Mathijs
full_name: Wintraecken, Mathijs
id: 307CFBC8-F248-11E8-B48F-1D18A9856A87
last_name: Wintraecken
orcid: 0000-0002-7472-2220
citation:
ama: Boissonnat J-D, Dyer R, Ghosh A, Lieutier A, Wintraecken M. Local conditions
for triangulating submanifolds of Euclidean space. Discrete and Computational
Geometry. 2021;66:666-686. doi:10.1007/s00454-020-00233-9
apa: Boissonnat, J.-D., Dyer, R., Ghosh, A., Lieutier, A., & Wintraecken, M.
(2021). Local conditions for triangulating submanifolds of Euclidean space. Discrete
and Computational Geometry. Springer Nature. https://doi.org/10.1007/s00454-020-00233-9
chicago: Boissonnat, Jean-Daniel, Ramsay Dyer, Arijit Ghosh, Andre Lieutier, and
Mathijs Wintraecken. “Local Conditions for Triangulating Submanifolds of Euclidean
Space.” Discrete and Computational Geometry. Springer Nature, 2021. https://doi.org/10.1007/s00454-020-00233-9.
ieee: J.-D. Boissonnat, R. Dyer, A. Ghosh, A. Lieutier, and M. Wintraecken, “Local
conditions for triangulating submanifolds of Euclidean space,” Discrete and
Computational Geometry, vol. 66. Springer Nature, pp. 666–686, 2021.
ista: Boissonnat J-D, Dyer R, Ghosh A, Lieutier A, Wintraecken M. 2021. Local conditions
for triangulating submanifolds of Euclidean space. Discrete and Computational
Geometry. 66, 666–686.
mla: Boissonnat, Jean-Daniel, et al. “Local Conditions for Triangulating Submanifolds
of Euclidean Space.” Discrete and Computational Geometry, vol. 66, Springer
Nature, 2021, pp. 666–86, doi:10.1007/s00454-020-00233-9.
short: J.-D. Boissonnat, R. Dyer, A. Ghosh, A. Lieutier, M. Wintraecken, Discrete
and Computational Geometry 66 (2021) 666–686.
corr_author: '1'
date_created: 2020-08-11T07:11:51Z
date_published: 2021-09-01T00:00:00Z
date_updated: 2025-04-14T07:44:05Z
day: '01'
ddc:
- '510'
department:
- _id: HeEd
doi: 10.1007/s00454-020-00233-9
ec_funded: 1
external_id:
isi:
- '000558119300001'
has_accepted_license: '1'
intvolume: ' 66'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1007/s00454-020-00233-9
month: '09'
oa: 1
oa_version: Published Version
page: 666-686
project:
- _id: 260C2330-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '754411'
name: ISTplus - Postdoctoral Fellowships
publication: Discrete and Computational Geometry
publication_identifier:
eissn:
- 1432-0444
issn:
- 0179-5376
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Local conditions for triangulating submanifolds of Euclidean space
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 66
year: '2021'
...