---
_id: '10772'
abstract:
- lang: eng
  text: We introduce tropical corals, balanced trees in a half-space, and show that
    they correspond to holomorphic polygons capturing the product rule in Lagrangian
    Floer theory for the elliptic curve. We then prove a correspondence theorem equating
    counts of tropical corals to punctured log Gromov–Witten invariants of the Tate
    curve. This implies that the homogeneous coordinate ring of the mirror to the
    Tate curve is isomorphic to the degree-zero part of symplectic cohomology, confirming
    a prediction of homological mirror symmetry.
acknowledgement: 'This paper is based on my PhD thesis, which would not be possible
  without the support of my advisor Bernd Siebert. I also thank Dan Abramovich, Mohammed
  Abouzaid, Mark Gross, Tom Coates and Dimitri Zvonkine for many useful conversations.
  Finally, I thank the anonymous referees for their many insightful comments and valuable
  suggestions which have resulted in major improvements to this article. This project
  has received funding from the EuropeanResearch Council (ERC) under the European
  Union’s Horizon 2020 research and innovation programme (Grant Agreement Number:
  682603), and from Fondation Mathématique Jacques Hadamard. '
article_processing_charge: Yes (via OA deal)
article_type: original
arxiv: 1
author:
- first_name: Nuroemuer Huelya
  full_name: Arguez, Nuroemuer Huelya
  id: 3c26b22e-c843-11eb-aa56-d38ffa0bdd08
  last_name: Arguez
citation:
  ama: Arguez NH. Mirror symmetry for the Tate curve via tropical and log corals.
    <i>Journal of the London Mathematical Society</i>. 2022;105(1):343-411. doi:<a
    href="https://doi.org/10.1112/jlms.12515">10.1112/jlms.12515</a>
  apa: Arguez, N. H. (2022). Mirror symmetry for the Tate curve via tropical and log
    corals. <i>Journal of the London Mathematical Society</i>. London Mathematical
    Society. <a href="https://doi.org/10.1112/jlms.12515">https://doi.org/10.1112/jlms.12515</a>
  chicago: Arguez, Nuroemuer Huelya. “Mirror Symmetry for the Tate Curve via Tropical
    and Log Corals.” <i>Journal of the London Mathematical Society</i>. London Mathematical
    Society, 2022. <a href="https://doi.org/10.1112/jlms.12515">https://doi.org/10.1112/jlms.12515</a>.
  ieee: N. H. Arguez, “Mirror symmetry for the Tate curve via tropical and log corals,”
    <i>Journal of the London Mathematical Society</i>, vol. 105, no. 1. London Mathematical
    Society, pp. 343–411, 2022.
  ista: Arguez NH. 2022. Mirror symmetry for the Tate curve via tropical and log corals.
    Journal of the London Mathematical Society. 105(1), 343–411.
  mla: Arguez, Nuroemuer Huelya. “Mirror Symmetry for the Tate Curve via Tropical
    and Log Corals.” <i>Journal of the London Mathematical Society</i>, vol. 105,
    no. 1, London Mathematical Society, 2022, pp. 343–411, doi:<a href="https://doi.org/10.1112/jlms.12515">10.1112/jlms.12515</a>.
  short: N.H. Arguez, Journal of the London Mathematical Society 105 (2022) 343–411.
corr_author: '1'
date_created: 2022-02-20T23:01:33Z
date_published: 2022-02-05T00:00:00Z
date_updated: 2024-10-09T21:01:37Z
day: '05'
ddc:
- '510'
department:
- _id: TaHa
doi: 10.1112/jlms.12515
external_id:
  arxiv:
  - '1712.10260'
  isi:
  - '000751600600001'
file:
- access_level: open_access
  checksum: 8bd0fd9694be894a191857ddf27678f0
  content_type: application/pdf
  creator: dernst
  date_created: 2022-02-21T11:22:58Z
  date_updated: 2022-02-21T11:22:58Z
  file_id: '10783'
  file_name: 2022_JournLondonMathSociety_Arguez.pdf
  file_size: 936873
  relation: main_file
  success: 1
file_date_updated: 2022-02-21T11:22:58Z
has_accepted_license: '1'
intvolume: '       105'
isi: 1
issue: '1'
language:
- iso: eng
month: '02'
oa: 1
oa_version: Published Version
page: 343-411
publication: Journal of the London Mathematical Society
publication_identifier:
  eissn:
  - 1469-7750
  issn:
  - 0024-6107
publication_status: published
publisher: London Mathematical Society
quality_controlled: '1'
scopus_import: '1'
status: public
title: Mirror symmetry for the Tate curve via tropical and log corals
tmp:
  image: /images/cc_by_nc_nd.png
  legal_code_url: https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode
  name: Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International
    (CC BY-NC-ND 4.0)
  short: CC BY-NC-ND (4.0)
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 105
year: '2022'
...
---
_id: '10773'
abstract:
- lang: eng
  text: The Voronoi tessellation in Rd is defined by locally minimizing the power
    distance to given weighted points. Symmetrically, the Delaunay mosaic can be defined
    by locally maximizing the negative power distance to other such points. We prove
    that the average of the two piecewise quadratic functions is piecewise linear,
    and that all three functions have the same critical points and values. Discretizing
    the two piecewise quadratic functions, we get the alpha shapes as sublevel sets
    of the discrete function on the Delaunay mosaic, and analogous shapes as superlevel
    sets of the discrete function on the Voronoi tessellation. For the same non-critical
    value, the corresponding shapes are disjoint, separated by a narrow channel that
    contains no critical points but the entire level set of the piecewise linear function.
acknowledgement: Open access funding provided by the Institute of Science and Technology
  (IST Austria).
article_processing_charge: Yes (via OA deal)
article_type: original
author:
- first_name: Ranita
  full_name: Biswas, Ranita
  id: 3C2B033E-F248-11E8-B48F-1D18A9856A87
  last_name: Biswas
  orcid: 0000-0002-5372-7890
- first_name: Sebastiano
  full_name: Cultrera Di Montesano, Sebastiano
  id: 34D2A09C-F248-11E8-B48F-1D18A9856A87
  last_name: Cultrera Di Montesano
  orcid: 0000-0001-6249-0832
- first_name: Herbert
  full_name: Edelsbrunner, Herbert
  id: 3FB178DA-F248-11E8-B48F-1D18A9856A87
  last_name: Edelsbrunner
  orcid: 0000-0002-9823-6833
- first_name: Morteza
  full_name: Saghafian, Morteza
  last_name: Saghafian
citation:
  ama: Biswas R, Cultrera di Montesano S, Edelsbrunner H, Saghafian M. Continuous
    and discrete radius functions on Voronoi tessellations and Delaunay mosaics. <i>Discrete
    and Computational Geometry</i>. 2022;67:811-842. doi:<a href="https://doi.org/10.1007/s00454-022-00371-2">10.1007/s00454-022-00371-2</a>
  apa: Biswas, R., Cultrera di Montesano, S., Edelsbrunner, H., &#38; Saghafian, M.
    (2022). Continuous and discrete radius functions on Voronoi tessellations and
    Delaunay mosaics. <i>Discrete and Computational Geometry</i>. Springer Nature.
    <a href="https://doi.org/10.1007/s00454-022-00371-2">https://doi.org/10.1007/s00454-022-00371-2</a>
  chicago: Biswas, Ranita, Sebastiano Cultrera di Montesano, Herbert Edelsbrunner,
    and Morteza Saghafian. “Continuous and Discrete Radius Functions on Voronoi Tessellations
    and Delaunay Mosaics.” <i>Discrete and Computational Geometry</i>. Springer Nature,
    2022. <a href="https://doi.org/10.1007/s00454-022-00371-2">https://doi.org/10.1007/s00454-022-00371-2</a>.
  ieee: R. Biswas, S. Cultrera di Montesano, H. Edelsbrunner, and M. Saghafian, “Continuous
    and discrete radius functions on Voronoi tessellations and Delaunay mosaics,”
    <i>Discrete and Computational Geometry</i>, vol. 67. Springer Nature, pp. 811–842,
    2022.
  ista: Biswas R, Cultrera di Montesano S, Edelsbrunner H, Saghafian M. 2022. Continuous
    and discrete radius functions on Voronoi tessellations and Delaunay mosaics. Discrete
    and Computational Geometry. 67, 811–842.
  mla: Biswas, Ranita, et al. “Continuous and Discrete Radius Functions on Voronoi
    Tessellations and Delaunay Mosaics.” <i>Discrete and Computational Geometry</i>,
    vol. 67, Springer Nature, 2022, pp. 811–42, doi:<a href="https://doi.org/10.1007/s00454-022-00371-2">10.1007/s00454-022-00371-2</a>.
  short: R. Biswas, S. Cultrera di Montesano, H. Edelsbrunner, M. Saghafian, Discrete
    and Computational Geometry 67 (2022) 811–842.
corr_author: '1'
date_created: 2022-02-20T23:01:34Z
date_published: 2022-04-01T00:00:00Z
date_updated: 2024-10-09T21:01:38Z
day: '01'
ddc:
- '510'
department:
- _id: HeEd
doi: 10.1007/s00454-022-00371-2
external_id:
  isi:
  - '000752175300002'
file:
- access_level: open_access
  checksum: 9383d3b70561bacee905e335dc922680
  content_type: application/pdf
  creator: dernst
  date_created: 2022-08-02T06:07:55Z
  date_updated: 2022-08-02T06:07:55Z
  file_id: '11718'
  file_name: 2022_DiscreteCompGeometry_Biswas.pdf
  file_size: 2518111
  relation: main_file
  success: 1
file_date_updated: 2022-08-02T06:07:55Z
has_accepted_license: '1'
intvolume: '        67'
isi: 1
language:
- iso: eng
month: '04'
oa: 1
oa_version: Published Version
page: 811-842
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: Continuous and discrete radius functions on Voronoi tessellations and Delaunay
  mosaics
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: 67
year: '2022'
...
---
_id: '10774'
abstract:
- lang: eng
  text: We study the problem of specifying sequential information-flow properties
    of systems. Information-flow properties are hyperproperties, as they compare different
    traces of a system. Sequential information-flow properties can express changes,
    over time, in the information-flow constraints. For example, information-flow
    constraints during an initialization phase of a system may be different from information-flow
    constraints that are required during the operation phase. We formalize several
    variants of interpreting sequential information-flow constraints, which arise
    from different assumptions about what can be observed of the system. For this
    purpose, we introduce a first-order logic, called Hypertrace Logic, with both
    trace and time quantifiers for specifying linear-time hyperproperties. We prove
    that HyperLTL, which corresponds to a fragment of Hypertrace Logic with restricted
    quantifier prefixes, cannot specify the majority of the studied variants of sequential
    information flow, including all variants in which the transition between sequential
    phases (such as initialization and operation) happens asynchronously. Our results
    rely on new equivalences between sets of traces that cannot be distinguished by
    certain classes of formulas from Hypertrace Logic. This presents a new approach
    to proving inexpressiveness results for HyperLTL.
acknowledgement: This work was funded in part by the Wittgenstein Award Z211-N23 of
  the Austrian Science Fund (FWF) and by the FWF project W1255-N23.
alternative_title:
- LNCS
article_processing_charge: No
arxiv: 1
author:
- first_name: Ezio
  full_name: Bartocci, Ezio
  last_name: Bartocci
- first_name: Thomas
  full_name: Ferrere, Thomas
  id: 40960E6E-F248-11E8-B48F-1D18A9856A87
  last_name: Ferrere
  orcid: 0000-0001-5199-3143
- first_name: Thomas A
  full_name: Henzinger, Thomas A
  id: 40876CD8-F248-11E8-B48F-1D18A9856A87
  last_name: Henzinger
  orcid: 0000-0002-2985-7724
- first_name: Dejan
  full_name: Nickovic, Dejan
  id: 41BCEE5C-F248-11E8-B48F-1D18A9856A87
  last_name: Nickovic
- first_name: Ana Oliveira
  full_name: Da Costa, Ana Oliveira
  last_name: Da Costa
citation:
  ama: 'Bartocci E, Ferrere T, Henzinger TA, Nickovic D, Da Costa AO. Flavors of sequential
    information flow. In: <i>Lecture Notes in Computer Science (Including Subseries
    Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)</i>.
    Vol 13182. Springer Nature; 2022:1-19. doi:<a href="https://doi.org/10.1007/978-3-030-94583-1_1">10.1007/978-3-030-94583-1_1</a>'
  apa: 'Bartocci, E., Ferrere, T., Henzinger, T. A., Nickovic, D., &#38; Da Costa,
    A. O. (2022). Flavors of sequential information flow. In <i>Lecture Notes in Computer
    Science (including subseries Lecture Notes in Artificial Intelligence and Lecture
    Notes in Bioinformatics)</i> (Vol. 13182, pp. 1–19). Philadelphia, PA, United
    States: Springer Nature. <a href="https://doi.org/10.1007/978-3-030-94583-1_1">https://doi.org/10.1007/978-3-030-94583-1_1</a>'
  chicago: Bartocci, Ezio, Thomas Ferrere, Thomas A Henzinger, Dejan Nickovic, and
    Ana Oliveira Da Costa. “Flavors of Sequential Information Flow.” In <i>Lecture
    Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence
    and Lecture Notes in Bioinformatics)</i>, 13182:1–19. Springer Nature, 2022. <a
    href="https://doi.org/10.1007/978-3-030-94583-1_1">https://doi.org/10.1007/978-3-030-94583-1_1</a>.
  ieee: E. Bartocci, T. Ferrere, T. A. Henzinger, D. Nickovic, and A. O. Da Costa,
    “Flavors of sequential information flow,” in <i>Lecture Notes in Computer Science
    (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes
    in Bioinformatics)</i>, Philadelphia, PA, United States, 2022, vol. 13182, pp.
    1–19.
  ista: 'Bartocci E, Ferrere T, Henzinger TA, Nickovic D, Da Costa AO. 2022. Flavors
    of sequential information flow. Lecture Notes in Computer Science (including subseries
    Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics).
    VMCAI: Verifcation, Model Checking, and Abstract Interpretation, LNCS, vol. 13182,
    1–19.'
  mla: Bartocci, Ezio, et al. “Flavors of Sequential Information Flow.” <i>Lecture
    Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence
    and Lecture Notes in Bioinformatics)</i>, vol. 13182, Springer Nature, 2022, pp.
    1–19, doi:<a href="https://doi.org/10.1007/978-3-030-94583-1_1">10.1007/978-3-030-94583-1_1</a>.
  short: E. Bartocci, T. Ferrere, T.A. Henzinger, D. Nickovic, A.O. Da Costa, in:,
    Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial
    Intelligence and Lecture Notes in Bioinformatics), Springer Nature, 2022, pp.
    1–19.
conference:
  end_date: 2022-01-18
  location: Philadelphia, PA, United States
  name: 'VMCAI: Verifcation, Model Checking, and Abstract Interpretation'
  start_date: 2022-01-16
date_created: 2022-02-20T23:01:34Z
date_published: 2022-01-14T00:00:00Z
date_updated: 2026-04-16T09:13:43Z
day: '14'
department:
- _id: ToHe
doi: 10.1007/978-3-030-94583-1_1
external_id:
  arxiv:
  - '2105.02013'
  isi:
  - '001059208500001'
intvolume: '     13182'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: ' https://doi.org/10.48550/arXiv.2105.02013'
month: '01'
oa: 1
oa_version: Preprint
page: 1-19
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: Lecture Notes in Computer Science (including subseries Lecture Notes
  in Artificial Intelligence and Lecture Notes in Bioinformatics)
publication_identifier:
  eisbn:
  - '9783030945831'
  eissn:
  - 1611-3349
  isbn:
  - '9783030945824'
  issn:
  - 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Flavors of sequential information flow
type: conference
user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd
volume: 13182
year: '2022'
...
---
_id: '10775'
abstract:
- lang: eng
  text: List-decodability of Reed–Solomon codes has received a lot of attention, but
    the best-possible dependence between the parameters is still not well-understood.
    In this work, we focus on the case where the list-decoding radius is of the form
    r = 1-ε for ε tending to zero. Our main result states that there exist Reed–Solomon
    codes with rate Ω(ε) which are (1 - ε, O(1/ε))-list-decodable, meaning that any
    Hamming ball of radius 1-ε contains at most O(1/ε) codewords. This trade-off between
    rate and list-decoding radius is best-possible for any code with list size less
    than exponential in the block length. By achieving this trade-off between rate
    and list-decoding radius we improve a recent result of Guo, Li, Shangguan, Tamo,
    and Wootters, and resolve the main motivating question of their work. Moreover,
    while their result requires the field to be exponentially large in the block length,
    we only need the field size to be polynomially large (and in fact, almost-linear
    suffices). We deduce our main result from a more general theorem, in which we
    prove good list-decodability properties of random puncturings of any given code
    with very large distance.
acknowledgement: Research supported by NSF Award DMS-1953990.
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Asaf
  full_name: Ferber, Asaf
  last_name: Ferber
- first_name: Matthew Alan
  full_name: Kwan, Matthew Alan
  id: 5fca0887-a1db-11eb-95d1-ca9d5e0453b3
  last_name: Kwan
  orcid: 0000-0002-4003-7567
- first_name: Lisa
  full_name: Sauermann, Lisa
  last_name: Sauermann
citation:
  ama: Ferber A, Kwan MA, Sauermann L. List-decodability with large radius for Reed-Solomon
    codes. <i>IEEE Transactions on Information Theory</i>. 2022;68(6):3823-3828. doi:<a
    href="https://doi.org/10.1109/TIT.2022.3148779">10.1109/TIT.2022.3148779</a>
  apa: Ferber, A., Kwan, M. A., &#38; Sauermann, L. (2022). List-decodability with
    large radius for Reed-Solomon codes. <i>IEEE Transactions on Information Theory</i>.
    IEEE. <a href="https://doi.org/10.1109/TIT.2022.3148779">https://doi.org/10.1109/TIT.2022.3148779</a>
  chicago: Ferber, Asaf, Matthew Alan Kwan, and Lisa Sauermann. “List-Decodability
    with Large Radius for Reed-Solomon Codes.” <i>IEEE Transactions on Information
    Theory</i>. IEEE, 2022. <a href="https://doi.org/10.1109/TIT.2022.3148779">https://doi.org/10.1109/TIT.2022.3148779</a>.
  ieee: A. Ferber, M. A. Kwan, and L. Sauermann, “List-decodability with large radius
    for Reed-Solomon codes,” <i>IEEE Transactions on Information Theory</i>, vol.
    68, no. 6. IEEE, pp. 3823–3828, 2022.
  ista: Ferber A, Kwan MA, Sauermann L. 2022. List-decodability with large radius
    for Reed-Solomon codes. IEEE Transactions on Information Theory. 68(6), 3823–3828.
  mla: Ferber, Asaf, et al. “List-Decodability with Large Radius for Reed-Solomon
    Codes.” <i>IEEE Transactions on Information Theory</i>, vol. 68, no. 6, IEEE,
    2022, pp. 3823–28, doi:<a href="https://doi.org/10.1109/TIT.2022.3148779">10.1109/TIT.2022.3148779</a>.
  short: A. Ferber, M.A. Kwan, L. Sauermann, IEEE Transactions on Information Theory
    68 (2022) 3823–3828.
corr_author: '1'
date_created: 2022-02-20T23:01:34Z
date_published: 2022-06-01T00:00:00Z
date_updated: 2025-07-10T11:50:08Z
day: '01'
department:
- _id: MaKw
doi: 10.1109/TIT.2022.3148779
external_id:
  arxiv:
  - '2012.10584'
  isi:
  - '000799622500022'
intvolume: '        68'
isi: 1
issue: '6'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://arxiv.org/abs/2012.10584
month: '06'
oa: 1
oa_version: Preprint
page: 3823-3828
publication: IEEE Transactions on Information Theory
publication_identifier:
  eissn:
  - 1557-9654
  issn:
  - 0018-9448
publication_status: published
publisher: IEEE
quality_controlled: '1'
related_material:
  record:
  - id: '11145'
    relation: earlier_version
    status: public
scopus_import: '1'
status: public
title: List-decodability with large radius for Reed-Solomon codes
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 68
year: '2022'
...
---
_id: '10776'
abstract:
- lang: eng
  text: 'Let K be a convex body in Rn (i.e., a compact convex set with nonempty interior).
    Given a point p in the interior of K, a hyperplane h passing through p is called
    barycentric if p is the barycenter of K∩h. In 1961, Grünbaum raised the question
    whether, for every K, there exists an interior point p through which there are
    at least n+1 distinct barycentric hyperplanes. Two years later, this was seemingly
    resolved affirmatively by showing that this is the case if p=p0 is the point of
    maximal depth in K. However, while working on a related question, we noticed that
    one of the auxiliary claims in the proof is incorrect. Here, we provide a counterexample;
    this re-opens Grünbaum’s question. It follows from known results that for n≥2,
    there are always at least three distinct barycentric cuts through the point p0∈K
    of maximal depth. Using tools related to Morse theory we are able to improve this
    bound: four distinct barycentric cuts through p0 are guaranteed if n≥3.'
acknowledgement: The work by Zuzana Patáková has been partially supported by Charles
  University Research Center Program No. UNCE/SCI/022, and part of it was done during
  her research stay at IST Austria. The work by Martin Tancer is supported by the
  GAČR Grant 19-04113Y and by the Charles University Projects PRIMUS/17/SCI/3 and
  UNCE/SCI/004.
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Zuzana
  full_name: Patakova, Zuzana
  id: 48B57058-F248-11E8-B48F-1D18A9856A87
  last_name: Patakova
  orcid: 0000-0002-3975-1683
- first_name: Martin
  full_name: Tancer, Martin
  last_name: Tancer
- first_name: Uli
  full_name: Wagner, Uli
  id: 36690CA2-F248-11E8-B48F-1D18A9856A87
  last_name: Wagner
  orcid: 0000-0002-1494-0568
citation:
  ama: Patakova Z, Tancer M, Wagner U. Barycentric cuts through a convex body. <i>Discrete
    and Computational Geometry</i>. 2022;68:1133-1154. doi:<a href="https://doi.org/10.1007/s00454-021-00364-7">10.1007/s00454-021-00364-7</a>
  apa: Patakova, Z., Tancer, M., &#38; Wagner, U. (2022). Barycentric cuts through
    a convex body. <i>Discrete and Computational Geometry</i>. Springer Nature. <a
    href="https://doi.org/10.1007/s00454-021-00364-7">https://doi.org/10.1007/s00454-021-00364-7</a>
  chicago: Patakova, Zuzana, Martin Tancer, and Uli Wagner. “Barycentric Cuts through
    a Convex Body.” <i>Discrete and Computational Geometry</i>. Springer Nature, 2022.
    <a href="https://doi.org/10.1007/s00454-021-00364-7">https://doi.org/10.1007/s00454-021-00364-7</a>.
  ieee: Z. Patakova, M. Tancer, and U. Wagner, “Barycentric cuts through a convex
    body,” <i>Discrete and Computational Geometry</i>, vol. 68. Springer Nature, pp.
    1133–1154, 2022.
  ista: Patakova Z, Tancer M, Wagner U. 2022. Barycentric cuts through a convex body.
    Discrete and Computational Geometry. 68, 1133–1154.
  mla: Patakova, Zuzana, et al. “Barycentric Cuts through a Convex Body.” <i>Discrete
    and Computational Geometry</i>, vol. 68, Springer Nature, 2022, pp. 1133–54, doi:<a
    href="https://doi.org/10.1007/s00454-021-00364-7">10.1007/s00454-021-00364-7</a>.
  short: Z. Patakova, M. Tancer, U. Wagner, Discrete and Computational Geometry 68
    (2022) 1133–1154.
date_created: 2022-02-20T23:01:35Z
date_published: 2022-12-01T00:00:00Z
date_updated: 2023-08-02T14:38:58Z
day: '01'
department:
- _id: UlWa
doi: 10.1007/s00454-021-00364-7
external_id:
  arxiv:
  - '2003.13536'
  isi:
  - '000750681500001'
intvolume: '        68'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://arxiv.org/abs/2003.13536
month: '12'
oa: 1
oa_version: Preprint
page: 1133-1154
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: Barycentric cuts through a convex body
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 68
year: '2022'
...
---
_id: '10787'
abstract:
- lang: eng
  text: "A species distributed across diverse environments may adapt to local conditions.
    We ask how quickly such a species changes its range in response to changed conditions.
    Szép et al. (Szép E, Sachdeva H, Barton NH. 2021 Polygenic local adaptation in
    metapopulations: a stochastic eco-evolutionary model. Evolution75, 1030–1045 (doi:10.1111/evo.14210))
    used the infinite island model to find the stationary distribution of allele frequencies
    and deme sizes. We extend this to find how a metapopulation responds to changes
    in carrying capacity, selection strength, or migration rate when deme sizes are
    fixed. We further develop a ‘fixed-state’ approximation. Under this approximation,
    polymorphism is only possible for a narrow range of habitat proportions when selection
    is weak compared to drift, but for a much wider range otherwise. When rates of
    selection or migration relative to drift change in a single deme of the metapopulation,
    the population takes a time of order m−1 to reach the new equilibrium. However,
    even with many loci, there can be substantial fluctuations in net adaptation,
    because at each locus, alleles randomly get lost or fixed. Thus, in a finite metapopulation,
    variation may gradually be lost by chance, even if it would persist in an infinite
    metapopulation. When conditions change across the whole metapopulation, there
    can be rapid change, which is predicted well by the fixed-state approximation.
    This work helps towards an understanding of how metapopulations extend their range
    across diverse environments.\r\nThis article is part of the theme issue ‘Species’
    ranges in the face of changing environments (Part II)’."
acknowledgement: This research was partly funded by the Austrian Science Fund (FWF)
  [FWF P-32896B].
article_processing_charge: No
article_type: original
author:
- first_name: Nicholas H
  full_name: Barton, Nicholas H
  id: 4880FE40-F248-11E8-B48F-1D18A9856A87
  last_name: Barton
  orcid: 0000-0002-8548-5240
- first_name: Oluwafunmilola O
  full_name: Olusanya, Oluwafunmilola O
  id: 41AD96DC-F248-11E8-B48F-1D18A9856A87
  last_name: Olusanya
  orcid: 0000-0003-1971-8314
citation:
  ama: 'Barton NH, Olusanya OO. The response of a metapopulation to a changing environment.
    <i>Philosophical Transactions of the Royal Society B: Biological Sciences</i>.
    2022;377(1848). doi:<a href="https://doi.org/10.1098/rstb.2021.0009">10.1098/rstb.2021.0009</a>'
  apa: 'Barton, N. H., &#38; Olusanya, O. O. (2022). The response of a metapopulation
    to a changing environment. <i>Philosophical Transactions of the Royal Society
    B: Biological Sciences</i>. The Royal Society. <a href="https://doi.org/10.1098/rstb.2021.0009">https://doi.org/10.1098/rstb.2021.0009</a>'
  chicago: 'Barton, Nicholas H, and Oluwafunmilola O Olusanya. “The Response of a
    Metapopulation to a Changing Environment.” <i>Philosophical Transactions of the
    Royal Society B: Biological Sciences</i>. The Royal Society, 2022. <a href="https://doi.org/10.1098/rstb.2021.0009">https://doi.org/10.1098/rstb.2021.0009</a>.'
  ieee: 'N. H. Barton and O. O. Olusanya, “The response of a metapopulation to a changing
    environment,” <i>Philosophical Transactions of the Royal Society B: Biological
    Sciences</i>, vol. 377, no. 1848. The Royal Society, 2022.'
  ista: 'Barton NH, Olusanya OO. 2022. The response of a metapopulation to a changing
    environment. Philosophical Transactions of the Royal Society B: Biological Sciences.
    377(1848).'
  mla: 'Barton, Nicholas H., and Oluwafunmilola O. Olusanya. “The Response of a Metapopulation
    to a Changing Environment.” <i>Philosophical Transactions of the Royal Society
    B: Biological Sciences</i>, vol. 377, no. 1848, The Royal Society, 2022, doi:<a
    href="https://doi.org/10.1098/rstb.2021.0009">10.1098/rstb.2021.0009</a>.'
  short: 'N.H. Barton, O.O. Olusanya, Philosophical Transactions of the Royal Society
    B: Biological Sciences 377 (2022).'
corr_author: '1'
date_created: 2022-02-21T16:08:10Z
date_published: 2022-04-11T00:00:00Z
date_updated: 2026-04-07T12:54:28Z
day: '11'
ddc:
- '570'
department:
- _id: GradSch
- _id: NiBa
doi: 10.1098/rstb.2021.0009
external_id:
  isi:
  - '000758140300001'
  pmid:
  - '35184588'
file:
- access_level: open_access
  checksum: 3b0243738f01bf3c07e0d7e8dc64f71d
  content_type: application/pdf
  creator: dernst
  date_created: 2022-08-02T06:14:32Z
  date_updated: 2022-08-02T06:14:32Z
  file_id: '11719'
  file_name: 2022_PhilosophicalTransactionsRSB_Barton.pdf
  file_size: 1349672
  relation: main_file
  success: 1
file_date_updated: 2022-08-02T06:14:32Z
has_accepted_license: '1'
intvolume: '       377'
isi: 1
issue: '1848'
keyword:
- General Agricultural and Biological Sciences
- General Biochemistry
- Genetics and Molecular Biology
language:
- iso: eng
month: '04'
oa: 1
oa_version: Published Version
pmid: 1
project:
- _id: c08d3278-5a5b-11eb-8a69-fdb09b55f4b8
  grant_number: P32896
  name: Causes and consequences of population fragmentation
publication: 'Philosophical Transactions of the Royal Society B: Biological Sciences'
publication_identifier:
  eissn:
  - 1471-2970
  issn:
  - 0962-8436
publication_status: published
publisher: The Royal Society
quality_controlled: '1'
related_material:
  record:
  - id: '14711'
    relation: dissertation_contains
    status: public
scopus_import: '1'
status: public
title: The response of a metapopulation to a changing environment
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: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 377
year: '2022'
...
---
_id: '10788'
abstract:
- lang: eng
  text: "We determine an asymptotic formula for the number of integral points of\r\nbounded
    height on a certain toric variety, which is incompatible with part of a\r\npreprint
    by Chambert-Loir and Tschinkel. We provide an alternative\r\ninterpretation of
    the asymptotic formula we get. To do so, we construct an\r\nanalogue of Peyre's
    constant $\\alpha$ and describe its relation to a new\r\nobstruction to the Zariski
    density of integral points in certain regions of\r\nvarieties."
acknowledgement: "Part of this work was conducted as a guest at the Institut de Mathématiques
  de Jussieu–Paris Rive Gauche invited by Antoine Chambert-Loir and funded by DAAD.\r\nDuring
  this time, I had interesting and fruitful discussions on the interpretation of the
  result for\r\nthe toric variety discussed in Section 3 with Antoine Chambert-Loir.
  I wish to thank him for these\r\nopportunities and for his useful remarks on earlier
  versions of this article. This work was partly\r\nfunded by FWF grant P 32428-N35."
article_number: '2202.10909'
article_processing_charge: No
arxiv: 1
author:
- first_name: Florian Alexander
  full_name: Wilsch, Florian Alexander
  id: 560601DA-8D36-11E9-A136-7AC1E5697425
  last_name: Wilsch
  orcid: 0000-0001-7302-8256
citation:
  ama: Wilsch FA. Integral points of bounded height on a certain toric variety. <i>arXiv</i>.
    doi:<a href="https://doi.org/10.48550/arXiv.2202.10909">10.48550/arXiv.2202.10909</a>
  apa: Wilsch, F. A. (n.d.). Integral points of bounded height on a certain toric
    variety. <i>arXiv</i>. <a href="https://doi.org/10.48550/arXiv.2202.10909">https://doi.org/10.48550/arXiv.2202.10909</a>
  chicago: Wilsch, Florian Alexander. “Integral Points of Bounded Height on a Certain
    Toric Variety.” <i>ArXiv</i>, n.d. <a href="https://doi.org/10.48550/arXiv.2202.10909">https://doi.org/10.48550/arXiv.2202.10909</a>.
  ieee: F. A. Wilsch, “Integral points of bounded height on a certain toric variety,”
    <i>arXiv</i>. .
  ista: Wilsch FA. Integral points of bounded height on a certain toric variety. arXiv,
    2202.10909.
  mla: Wilsch, Florian Alexander. “Integral Points of Bounded Height on a Certain
    Toric Variety.” <i>ArXiv</i>, 2202.10909, doi:<a href="https://doi.org/10.48550/arXiv.2202.10909">10.48550/arXiv.2202.10909</a>.
  short: F.A. Wilsch, ArXiv (n.d.).
corr_author: '1'
date_created: 2022-02-23T09:04:43Z
date_published: 2022-02-22T00:00:00Z
date_updated: 2025-04-15T07:39:01Z
day: '22'
department:
- _id: TiBr
doi: 10.48550/arXiv.2202.10909
external_id:
  arxiv:
  - '2202.10909'
keyword:
- Integral point
- toric variety
- Manin's conjecture
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://arxiv.org/abs/2202.10909
month: '02'
oa: 1
oa_version: Preprint
project:
- _id: 26AEDAB2-B435-11E9-9278-68D0E5697425
  call_identifier: FWF
  grant_number: P32428
  name: New frontiers of the Manin conjecture
publication: arXiv
publication_status: submitted
status: public
title: Integral points of bounded height on a certain toric variety
type: preprint
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2022'
...
---
_id: '10791'
abstract:
- lang: eng
  text: The mammalian neocortex is composed of diverse neuronal and glial cell classes
    that broadly arrange in six distinct laminae. Cortical layers emerge during development
    and defects in the developmental programs that orchestrate cortical lamination
    are associated with neurodevelopmental diseases. The developmental principle of
    cortical layer formation depends on concerted radial projection neuron migration,
    from their birthplace to their final target position. Radial migration occurs
    in defined sequential steps, regulated by a large array of signaling pathways.
    However, based on genetic loss-of-function experiments, most studies have thus
    far focused on the role of cell-autonomous gene function. Yet, cortical neuron
    migration in situ is a complex process and migrating neurons traverse along diverse
    cellular compartments and environments. The role of tissue-wide properties and
    genetic state in radial neuron migration is however not clear. Here we utilized
    mosaic analysis with double markers (MADM) technology to either sparsely or globally
    delete gene function, followed by quantitative single-cell phenotyping. The MADM-based
    gene ablation paradigms in combination with computational modeling demonstrated
    that global tissue-wide effects predominate cell-autonomous gene function albeit
    in a gene-specific manner. Our results thus suggest that the genetic landscape
    in a tissue critically affects the overall migration phenotype of individual cortical
    projection neurons. In a broader context, our findings imply that global tissue-wide
    effects represent an essential component of the underlying etiology associated
    with focal malformations of cortical development in particular, and neurological
    diseases in general.
acknowledged_ssus:
- _id: LifeSc
- _id: PreCl
- _id: Bio
acknowledgement: "A.H.H. was a recipient of a DOC Fellowship (24812) of the Austrian
  Academy of Sciences. This work also received support from IST Austria institutional
  funds; the People Programme (Marie Curie Actions) of the European Union’s Seventh
  Framework Programme (FP7/2007–2013) under REA grant agreement No 618444 to S.H.\r\nAPC
  funding was obtained by IST Austria institutional funds.\r\nWe thank A. Sommer and
  C. Czepe (VBCF GmbH, NGS Unit), L. Andersen, J. Sonntag and J. Renno for technical
  support and/or initial experiments; M. Sixt, J. Nimpf and all members of the Hippenmeyer
  lab for discussion. This research was supported by the Scientific Service Units
  of IST Austria through resources provided by the Imaging and Optics Facility, Lab
  Support Facility and Preclinical Facility."
article_number: kvac009
article_processing_charge: No
article_type: original
author:
- first_name: Andi H
  full_name: Hansen, Andi H
  id: 38853E16-F248-11E8-B48F-1D18A9856A87
  last_name: Hansen
- first_name: Florian
  full_name: Pauler, Florian
  id: 48EA0138-F248-11E8-B48F-1D18A9856A87
  last_name: Pauler
  orcid: 0000-0002-7462-0048
- first_name: Michael
  full_name: Riedl, Michael
  id: 3BE60946-F248-11E8-B48F-1D18A9856A87
  last_name: Riedl
  orcid: 0000-0003-4844-6311
- first_name: Carmen
  full_name: Streicher, Carmen
  id: 36BCB99C-F248-11E8-B48F-1D18A9856A87
  last_name: Streicher
- first_name: Anna-Magdalena
  full_name: Heger, Anna-Magdalena
  id: 4B76FFD2-F248-11E8-B48F-1D18A9856A87
  last_name: Heger
- first_name: Susanne
  full_name: Laukoter, Susanne
  id: 2D6B7A9A-F248-11E8-B48F-1D18A9856A87
  last_name: Laukoter
  orcid: 0000-0002-7903-3010
- first_name: Christoph M
  full_name: Sommer, Christoph M
  id: 4DF26D8C-F248-11E8-B48F-1D18A9856A87
  last_name: Sommer
  orcid: 0000-0003-1216-9105
- first_name: Armel
  full_name: Nicolas, Armel
  id: 2A103192-F248-11E8-B48F-1D18A9856A87
  last_name: Nicolas
- first_name: Björn
  full_name: Hof, Björn
  id: 3A374330-F248-11E8-B48F-1D18A9856A87
  last_name: Hof
  orcid: 0000-0003-2057-2754
- first_name: Li Huei
  full_name: Tsai, Li Huei
  last_name: Tsai
- first_name: Thomas
  full_name: Rülicke, Thomas
  last_name: Rülicke
- first_name: Simon
  full_name: Hippenmeyer, Simon
  id: 37B36620-F248-11E8-B48F-1D18A9856A87
  last_name: Hippenmeyer
  orcid: 0000-0003-2279-1061
citation:
  ama: Hansen AH, Pauler F, Riedl M, et al. Tissue-wide effects override cell-intrinsic
    gene function in radial neuron migration. <i>Oxford Open Neuroscience</i>. 2022;1(1).
    doi:<a href="https://doi.org/10.1093/oons/kvac009">10.1093/oons/kvac009</a>
  apa: Hansen, A. H., Pauler, F., Riedl, M., Streicher, C., Heger, A.-M., Laukoter,
    S., … Hippenmeyer, S. (2022). Tissue-wide effects override cell-intrinsic gene
    function in radial neuron migration. <i>Oxford Open Neuroscience</i>. Oxford University
    Press. <a href="https://doi.org/10.1093/oons/kvac009">https://doi.org/10.1093/oons/kvac009</a>
  chicago: Hansen, Andi H, Florian Pauler, Michael Riedl, Carmen Streicher, Anna-Magdalena
    Heger, Susanne Laukoter, Christoph M Sommer, et al. “Tissue-Wide Effects Override
    Cell-Intrinsic Gene Function in Radial Neuron Migration.” <i>Oxford Open Neuroscience</i>.
    Oxford University Press, 2022. <a href="https://doi.org/10.1093/oons/kvac009">https://doi.org/10.1093/oons/kvac009</a>.
  ieee: A. H. Hansen <i>et al.</i>, “Tissue-wide effects override cell-intrinsic gene
    function in radial neuron migration,” <i>Oxford Open Neuroscience</i>, vol. 1,
    no. 1. Oxford University Press, 2022.
  ista: Hansen AH, Pauler F, Riedl M, Streicher C, Heger A-M, Laukoter S, Sommer CM,
    Nicolas A, Hof B, Tsai LH, Rülicke T, Hippenmeyer S. 2022. Tissue-wide effects
    override cell-intrinsic gene function in radial neuron migration. Oxford Open
    Neuroscience. 1(1), kvac009.
  mla: Hansen, Andi H., et al. “Tissue-Wide Effects Override Cell-Intrinsic Gene Function
    in Radial Neuron Migration.” <i>Oxford Open Neuroscience</i>, vol. 1, no. 1, kvac009,
    Oxford University Press, 2022, doi:<a href="https://doi.org/10.1093/oons/kvac009">10.1093/oons/kvac009</a>.
  short: A.H. Hansen, F. Pauler, M. Riedl, C. Streicher, A.-M. Heger, S. Laukoter,
    C.M. Sommer, A. Nicolas, B. Hof, L.H. Tsai, T. Rülicke, S. Hippenmeyer, Oxford
    Open Neuroscience 1 (2022).
corr_author: '1'
date_created: 2022-02-25T07:52:11Z
date_published: 2022-07-07T00:00:00Z
date_updated: 2026-04-07T13:29:13Z
day: '07'
ddc:
- '570'
department:
- _id: SiHi
- _id: BjHo
- _id: LifeSc
- _id: EM-Fac
doi: 10.1093/oons/kvac009
ec_funded: 1
external_id:
  pmid:
  - '38596707'
file:
- access_level: open_access
  checksum: 822e76e056c07099d1fb27d1ece5941b
  content_type: application/pdf
  creator: dernst
  date_created: 2023-08-16T08:00:30Z
  date_updated: 2023-08-16T08:00:30Z
  file_id: '14061'
  file_name: 2023_OxfordOpenNeuroscience_Hansen.pdf
  file_size: 4846551
  relation: main_file
  success: 1
file_date_updated: 2023-08-16T08:00:30Z
has_accepted_license: '1'
intvolume: '         1'
issue: '1'
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
pmid: 1
project:
- _id: 25D61E48-B435-11E9-9278-68D0E5697425
  call_identifier: FP7
  grant_number: '618444'
  name: Molecular Mechanisms of Cerebral Cortex Development
- _id: 2625A13E-B435-11E9-9278-68D0E5697425
  grant_number: '24812'
  name: Molecular mechanisms of radial neuronal migration
publication: Oxford Open Neuroscience
publication_identifier:
  eissn:
  - 2753-149X
publication_status: published
publisher: Oxford University Press
quality_controlled: '1'
related_material:
  record:
  - id: '12726'
    relation: dissertation_contains
    status: public
  - id: '14530'
    relation: dissertation_contains
    status: public
status: public
title: Tissue-wide effects override cell-intrinsic gene function in radial neuron
  migration
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: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 1
year: '2022'
...
---
_id: '10792'
abstract:
- lang: eng
  text: "Background\r\nProper cerebral cortical development depends on the tightly
    orchestrated migration of newly born neurons from the inner ventricular and subventricular
    zones to the outer cortical plate. Any disturbance in this process during prenatal
    stages may lead to neuronal migration disorders (NMDs), which can vary in extent
    from focal to global. Furthermore, NMDs show a substantial comorbidity with other
    neurodevelopmental disorders, notably autism spectrum disorders (ASDs). Our previous
    work demonstrated focal neuronal migration defects in mice carrying loss-of-function
    alleles of the recognized autism risk gene WDFY3. However, the cellular origins
    of these defects in Wdfy3 mutant mice remain elusive and uncovering it will provide
    critical insight into WDFY3-dependent disease pathology .\r\nMethods\r\nHere,
    in an effort to untangle the origins of NMDs in Wdfy3lacZ mice, we employed mosaic
    analysis with double markers (MADM). MADM technology enabled us to genetically
    distinctly track and phenotypically analyze mutant and wild type cells concomitantly
    in vivo using immunofluorescent techniques.\r\nResults\r\nWe revealed a cell autonomous
    requirement of WDFY3 for accurate laminar positioning of cortical projection neurons
    and elimination of mispositioned cells during early postnatal life. In addition,
    we identified significant deviations in dendritic arborization, as well as synaptic
    density and morphology between wild type, heterozygous, and homozygous Wdfy3 mutant
    neurons in Wdfy3-MADM reporter mice at postnatal stages. Limitations While Wdfy3
    mutant mice have provided valuable insight into prenatal aspects of ASD pathology
    that remain inaccessible to investigation in humans, like most animal models,
    they do not a perfectly replicate all aspects of human ASD biology. The lack of
    human data makes it indeterminate whether morphological deviations described here
    apply to ASD patients.\r\nConclusions\r\n\uFEFFOur genetic approach revealed several
    cell autonomous requirements of Wdfy3 in neuronal development that could underly
    the pathogenic mechanisms of WDFY3-related ASD conditions. The results are also
    consistent with findings in other ASD animal models and patients and suggest an
    important role for Wdfy3 in regulating neuronal function and interconnectivity
    in postnatal life."
article_processing_charge: No
author:
- first_name: Zachary
  full_name: Schaaf, Zachary
  last_name: Schaaf
- first_name: Lyvin
  full_name: Tat, Lyvin
  last_name: Tat
- first_name: Noemi
  full_name: Cannizzaro, Noemi
  last_name: Cannizzaro
- first_name: Ralph
  full_name: Green, Ralph
  last_name: Green
- first_name: Thomas
  full_name: Rülicke, Thomas
  last_name: Rülicke
- first_name: Simon
  full_name: Hippenmeyer, Simon
  id: 37B36620-F248-11E8-B48F-1D18A9856A87
  last_name: Hippenmeyer
  orcid: 0000-0003-2279-1061
- first_name: K
  full_name: Zarbalis, K
  last_name: Zarbalis
citation:
  ama: Schaaf Z, Tat L, Cannizzaro N, et al. WDFY3 cell autonomously controls neuronal
    migration. doi:<a href="https://doi.org/10.21203/rs.3.rs-1316167/v1">10.21203/rs.3.rs-1316167/v1</a>
  apa: Schaaf, Z., Tat, L., Cannizzaro, N., Green, R., Rülicke, T., Hippenmeyer, S.,
    &#38; Zarbalis, K. (n.d.). WDFY3 cell autonomously controls neuronal migration.
    Research Square. <a href="https://doi.org/10.21203/rs.3.rs-1316167/v1">https://doi.org/10.21203/rs.3.rs-1316167/v1</a>
  chicago: Schaaf, Zachary, Lyvin Tat, Noemi Cannizzaro, Ralph Green, Thomas Rülicke,
    Simon Hippenmeyer, and K Zarbalis. “WDFY3 Cell Autonomously Controls Neuronal
    Migration.” Research Square, n.d. <a href="https://doi.org/10.21203/rs.3.rs-1316167/v1">https://doi.org/10.21203/rs.3.rs-1316167/v1</a>.
  ieee: Z. Schaaf <i>et al.</i>, “WDFY3 cell autonomously controls neuronal migration.”
    Research Square.
  ista: Schaaf Z, Tat L, Cannizzaro N, Green R, Rülicke T, Hippenmeyer S, Zarbalis
    K. WDFY3 cell autonomously controls neuronal migration. <a href="https://doi.org/10.21203/rs.3.rs-1316167/v1">10.21203/rs.3.rs-1316167/v1</a>.
  mla: Schaaf, Zachary, et al. <i>WDFY3 Cell Autonomously Controls Neuronal Migration</i>.
    Research Square, doi:<a href="https://doi.org/10.21203/rs.3.rs-1316167/v1">10.21203/rs.3.rs-1316167/v1</a>.
  short: Z. Schaaf, L. Tat, N. Cannizzaro, R. Green, T. Rülicke, S. Hippenmeyer, K.
    Zarbalis, (n.d.).
date_created: 2022-02-25T07:53:26Z
date_published: 2022-02-16T00:00:00Z
date_updated: 2023-10-17T13:06:52Z
day: '16'
department:
- _id: SiHi
doi: 10.21203/rs.3.rs-1316167/v1
external_id:
  pmid:
  - PPR454733
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://doi.org/10.21203/rs.3.rs-1316167/v1
month: '02'
oa: 1
oa_version: Preprint
page: '30'
pmid: 1
publication_identifier:
  eissn:
  - 2693-5015
publication_status: submitted
publisher: Research Square
status: public
title: WDFY3 cell autonomously controls neuronal migration
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: preprint
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2022'
...
---
_id: '10797'
abstract:
- lang: eng
  text: We consider symmetric partial exclusion and inclusion processes in a general
    graph in contact with reservoirs, where we allow both for edge disorder and well-chosen
    site disorder. We extend the classical dualities to this context and then we derive
    new orthogonal polynomial dualities. From the classical dualities, we derive the
    uniqueness of the non-equilibrium steady state and obtain correlation inequalities.
    Starting from the orthogonal polynomial dualities, we show universal properties
    of n-point correlation functions in the non-equilibrium steady state for systems
    with at most two different reservoir parameters, such as a chain with reservoirs
    at left and right ends.
- lang: fre
  text: Nous considérons des processus d’exclusion partielle, et des processus d’inclusion
    sur un graphe général en contact avec des réservoirs. Nous autorisons la présence
    de inhomogenéités sur les arrêts ainsi que sur les sommets du graph. Nous généralisons
    les “dualités classiques” dans ce contexte et nous démontrons des nouvelles dualités
    orthogonales. À partir des dualités classiques, nous démontrons l’unicité de l’état
    stationnaire non-équilibre, ainsi que des inégalités de corrélation. À partir
    des dualités orthogonales nous démontrons des propriétés universelles des fonctions
    de corrélation à n points dans l’état stationnaire non-équilibre pour des systèmes
    avec deux paramètres de réservoirs inégaux, comme par exemple une chaîne avec
    des réservoirs à droite et à gauche.
acknowledgement: The authors would like to thank Gioia Carinci and Cristian Giardinà
  for useful discussions. F.R. and S.F. thank Jean-René Chazottes for a stay at CPHT
  (Institut Polytechnique de Paris), in the realm of Chaire d’Alembert (Paris-Saclay
  University), where part of this work was performed. S.F. acknowledges Simona Villa
  for her support in creating the picture. S.F. acknowledges financial support from
  NWO via the grant TOP1.17.019. F.S. acknowledges financial support from the European
  Union’s Horizon 2020 research and innovation programme under the Marie-Skłodowska-Curie
  grant agreement No. 754411.
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Simone
  full_name: Floreani, Simone
  last_name: Floreani
- first_name: Frank
  full_name: Redig, Frank
  last_name: Redig
- first_name: Federico
  full_name: Sau, Federico
  id: E1836206-9F16-11E9-8814-AEFDE5697425
  last_name: Sau
citation:
  ama: Floreani S, Redig F, Sau F. Orthogonal polynomial duality of boundary driven
    particle systems and non-equilibrium correlations. <i>Annales de l’institut Henri
    Poincare (B) Probability and Statistics</i>. 2022;58(1):220-247. doi:<a href="https://doi.org/10.1214/21-AIHP1163">10.1214/21-AIHP1163</a>
  apa: Floreani, S., Redig, F., &#38; Sau, F. (2022). Orthogonal polynomial duality
    of boundary driven particle systems and non-equilibrium correlations. <i>Annales
    de l’institut Henri Poincare (B) Probability and Statistics</i>. Institute of
    Mathematical Statistics. <a href="https://doi.org/10.1214/21-AIHP1163">https://doi.org/10.1214/21-AIHP1163</a>
  chicago: Floreani, Simone, Frank Redig, and Federico Sau. “Orthogonal Polynomial
    Duality of Boundary Driven Particle Systems and Non-Equilibrium Correlations.”
    <i>Annales de l’institut Henri Poincare (B) Probability and Statistics</i>. Institute
    of Mathematical Statistics, 2022. <a href="https://doi.org/10.1214/21-AIHP1163">https://doi.org/10.1214/21-AIHP1163</a>.
  ieee: S. Floreani, F. Redig, and F. Sau, “Orthogonal polynomial duality of boundary
    driven particle systems and non-equilibrium correlations,” <i>Annales de l’institut
    Henri Poincare (B) Probability and Statistics</i>, vol. 58, no. 1. Institute of
    Mathematical Statistics, pp. 220–247, 2022.
  ista: Floreani S, Redig F, Sau F. 2022. Orthogonal polynomial duality of boundary
    driven particle systems and non-equilibrium correlations. Annales de l’institut
    Henri Poincare (B) Probability and Statistics. 58(1), 220–247.
  mla: Floreani, Simone, et al. “Orthogonal Polynomial Duality of Boundary Driven
    Particle Systems and Non-Equilibrium Correlations.” <i>Annales de l’institut Henri
    Poincare (B) Probability and Statistics</i>, vol. 58, no. 1, Institute of Mathematical
    Statistics, 2022, pp. 220–47, doi:<a href="https://doi.org/10.1214/21-AIHP1163">10.1214/21-AIHP1163</a>.
  short: S. Floreani, F. Redig, F. Sau, Annales de l’institut Henri Poincare (B) Probability
    and Statistics 58 (2022) 220–247.
date_created: 2022-02-27T23:01:50Z
date_published: 2022-02-01T00:00:00Z
date_updated: 2025-04-14T07:43:48Z
day: '01'
department:
- _id: JaMa
doi: 10.1214/21-AIHP1163
ec_funded: 1
external_id:
  arxiv:
  - '2007.08272'
  isi:
  - '000752489300010'
intvolume: '        58'
isi: 1
issue: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://arxiv.org/abs/2007.08272
month: '02'
oa: 1
oa_version: Preprint
page: 220-247
project:
- _id: 260C2330-B435-11E9-9278-68D0E5697425
  call_identifier: H2020
  grant_number: '754411'
  name: ISTplus - Postdoctoral Fellowships
publication: Annales de l'institut Henri Poincare (B) Probability and Statistics
publication_identifier:
  issn:
  - 0246-0203
publication_status: published
publisher: Institute of Mathematical Statistics
quality_controlled: '1'
scopus_import: '1'
status: public
title: Orthogonal polynomial duality of boundary driven particle systems and non-equilibrium
  correlations
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 58
year: '2022'
...
---
OA_place: publisher
_id: '10799'
abstract:
- lang: eng
  text: "Because of the increasing popularity of machine learning methods, it is becoming
    important to understand the impact of learned components on automated decision-making
    systems and to guarantee that their consequences are beneficial to society. In
    other words, it is necessary to ensure that machine learning is sufficiently trustworthy
    to be used in real-world applications. This thesis studies two properties of machine
    learning models that are highly desirable for the\r\nsake of reliability: robustness
    and fairness. In the first part of the thesis we study the robustness of learning
    algorithms to training data corruption. Previous work has shown that machine learning
    models are vulnerable to a range\r\nof training set issues, varying from label
    noise through systematic biases to worst-case data manipulations. This is an especially
    relevant problem from a present perspective, since modern machine learning methods
    are particularly data hungry and therefore practitioners often have to rely on
    data collected from various external sources, e.g. from the Internet, from app
    users or via crowdsourcing. Naturally, such sources vary greatly in the quality
    and reliability of the\r\ndata they provide. With these considerations in mind,
    we study the problem of designing machine learning algorithms that are robust
    to corruptions in data coming from multiple sources. We show that, in contrast
    to the case of a single dataset with outliers, successful learning within this
    model is possible both theoretically and practically, even under worst-case data
    corruptions. The second part of this thesis deals with fairness-aware machine
    learning. There are multiple areas where machine learning models have shown promising
    results, but where careful considerations are required, in order to avoid discrimanative
    decisions taken by such learned components. Ensuring fairness can be particularly
    challenging, because real-world training datasets are expected to contain various
    forms of historical bias that may affect the learning process. In this thesis
    we show that data corruption can indeed render the problem of achieving fairness
    impossible, by tightly characterizing the theoretical limits of fair learning
    under worst-case data manipulations. However, assuming access to clean data, we
    also show how fairness-aware learning can be made practical in contexts beyond
    binary classification, in particular in the challenging learning to rank setting."
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Nikola H
  full_name: Konstantinov, Nikola H
  id: 4B9D76E4-F248-11E8-B48F-1D18A9856A87
  last_name: Konstantinov
  orcid: 0009-0009-5204-7621
citation:
  ama: Konstantinov NH. Robustness and fairness in machine learning. 2022. doi:<a
    href="https://doi.org/10.15479/at:ista:10799">10.15479/at:ista:10799</a>
  apa: Konstantinov, N. H. (2022). <i>Robustness and fairness in machine learning</i>.
    Institute of Science and Technology Austria. <a href="https://doi.org/10.15479/at:ista:10799">https://doi.org/10.15479/at:ista:10799</a>
  chicago: Konstantinov, Nikola H. “Robustness and Fairness in Machine Learning.”
    Institute of Science and Technology Austria, 2022. <a href="https://doi.org/10.15479/at:ista:10799">https://doi.org/10.15479/at:ista:10799</a>.
  ieee: N. H. Konstantinov, “Robustness and fairness in machine learning,” Institute
    of Science and Technology Austria, 2022.
  ista: Konstantinov NH. 2022. Robustness and fairness in machine learning. Institute
    of Science and Technology Austria.
  mla: Konstantinov, Nikola H. <i>Robustness and Fairness in Machine Learning</i>.
    Institute of Science and Technology Austria, 2022, doi:<a href="https://doi.org/10.15479/at:ista:10799">10.15479/at:ista:10799</a>.
  short: N.H. Konstantinov, Robustness and Fairness in Machine Learning, Institute
    of Science and Technology Austria, 2022.
corr_author: '1'
date_created: 2022-02-28T13:03:49Z
date_published: 2022-03-08T00:00:00Z
date_updated: 2026-04-07T14:19:48Z
day: '08'
ddc:
- '000'
degree_awarded: PhD
department:
- _id: GradSch
- _id: ChLa
doi: 10.15479/at:ista:10799
ec_funded: 1
file:
- access_level: open_access
  checksum: 626bc523ae8822d20e635d0e2d95182e
  content_type: application/pdf
  creator: nkonstan
  date_created: 2022-03-06T11:42:54Z
  date_updated: 2022-03-06T11:42:54Z
  file_id: '10823'
  file_name: thesis.pdf
  file_size: 4204905
  relation: main_file
  success: 1
- access_level: closed
  checksum: e2ca2b88350ac8ea1515b948885cbcb1
  content_type: application/x-zip-compressed
  creator: nkonstan
  date_created: 2022-03-06T11:42:57Z
  date_updated: 2022-03-10T12:11:48Z
  file_id: '10824'
  file_name: thesis.zip
  file_size: 22841103
  relation: source_file
file_date_updated: 2022-03-10T12:11:48Z
has_accepted_license: '1'
keyword:
- robustness
- fairness
- machine learning
- PAC learning
- adversarial learning
language:
- iso: eng
month: '03'
oa: 1
oa_version: Published Version
page: '176'
project:
- _id: 2564DBCA-B435-11E9-9278-68D0E5697425
  call_identifier: H2020
  grant_number: '665385'
  name: International IST Doctoral Program
publication_identifier:
  isbn:
  - 978-3-99078-015-2
  issn:
  - 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
related_material:
  record:
  - id: '10802'
    relation: part_of_dissertation
    status: public
  - id: '10803'
    relation: part_of_dissertation
    status: public
  - id: '6590'
    relation: part_of_dissertation
    status: public
  - id: '8724'
    relation: part_of_dissertation
    status: public
status: public
supervisor:
- first_name: Christoph
  full_name: Lampert, Christoph
  id: 40C20FD2-F248-11E8-B48F-1D18A9856A87
  last_name: Lampert
  orcid: 0000-0001-8622-7887
title: Robustness and fairness in machine learning
type: dissertation
user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd
year: '2022'
...
---
_id: '10802'
abstract:
- lang: eng
  text: "Addressing fairness concerns about machine learning models is a crucial step
    towards their long-term adoption in real-world automated systems. While many approaches
    have been developed for training fair models from data, little is known about
    the robustness of these methods to data corruption. In this work we consider fairness-aware
    learning under worst-case data manipulations. We show that an adversary can in
    some situations force any learner to return an overly biased classifier, regardless
    of the sample size and with or without degrading\r\naccuracy, and that the strength
    of the excess bias increases for learning problems with underrepresented protected
    groups in the data. We also prove that our hardness results are tight up to constant
    factors. To this end, we study two natural learning algorithms that optimize for
    both accuracy and fairness and show that these algorithms enjoy guarantees that
    are order-optimal in terms of the corruption ratio and the protected groups frequencies
    in the large data\r\nlimit."
acknowledgement: The authors thank Eugenia Iofinova and Bernd Prach for providing
  feedback on early versions of this paper. This publication was made possible by
  an ETH AI Center postdoctoral fellowship to Nikola Konstantinov.
article_processing_charge: No
article_type: original
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-aware PAC learning from corrupted data.
    <i>Journal of Machine Learning Research</i>. 2022;23:1-60.
  apa: Konstantinov, N. H., &#38; Lampert, C. (2022). Fairness-aware PAC learning
    from corrupted data. <i>Journal of Machine Learning Research</i>. ML Research
    Press.
  chicago: Konstantinov, Nikola H, and Christoph Lampert. “Fairness-Aware PAC Learning
    from Corrupted Data.” <i>Journal of Machine Learning Research</i>. ML Research
    Press, 2022.
  ieee: N. H. Konstantinov and C. Lampert, “Fairness-aware PAC learning from corrupted
    data,” <i>Journal of Machine Learning Research</i>, vol. 23. ML Research Press,
    pp. 1–60, 2022.
  ista: Konstantinov NH, Lampert C. 2022. Fairness-aware PAC learning from corrupted
    data. Journal of Machine Learning Research. 23, 1–60.
  mla: Konstantinov, Nikola H., and Christoph Lampert. “Fairness-Aware PAC Learning
    from Corrupted Data.” <i>Journal of Machine Learning Research</i>, vol. 23, ML
    Research Press, 2022, pp. 1–60.
  short: N.H. Konstantinov, C. Lampert, Journal of Machine Learning Research 23 (2022)
    1–60.
corr_author: '1'
date_created: 2022-02-28T14:05:42Z
date_published: 2022-05-01T00:00:00Z
date_updated: 2026-04-07T14:19:48Z
day: '01'
ddc:
- '004'
department:
- _id: ChLa
external_id:
  arxiv:
  - '2102.06004'
file:
- access_level: open_access
  checksum: 9cac897b54a0ddf3a553a2c33e88cfda
  content_type: application/pdf
  creator: kschuh
  date_created: 2022-07-12T15:08:28Z
  date_updated: 2022-07-12T15:08:28Z
  file_id: '11570'
  file_name: 2022_JournalMachineLearningResearch_Konstantinov.pdf
  file_size: 551862
  relation: main_file
  success: 1
file_date_updated: 2022-07-12T15:08:28Z
has_accepted_license: '1'
intvolume: '        23'
keyword:
- Fairness
- robustness
- data poisoning
- trustworthy machine learning
- PAC learning
language:
- iso: eng
month: '05'
oa: 1
oa_version: Published Version
page: 1-60
publication: Journal of Machine Learning Research
publication_identifier:
  eissn:
  - 1533-7928
  issn:
  - 1532-4435
publication_status: published
publisher: ML Research Press
quality_controlled: '1'
related_material:
  record:
  - id: '13241'
    relation: shorter_version
    status: public
  - id: '10799'
    relation: dissertation_contains
    status: public
scopus_import: '1'
status: public
title: Fairness-aware PAC learning from corrupted data
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: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 23
year: '2022'
...
---
_id: '10812'
abstract:
- lang: eng
  text: Several promising strategies based on combining or cycling different antibiotics
    have been proposed to increase efficacy and counteract resistance evolution, but
    we still lack a deep understanding of the physiological responses and genetic
    mechanisms that underlie antibiotic interactions and the clinical applicability
    of these strategies. In antibiotic-exposed bacteria, the combined effects of physiological
    stress responses and emerging resistance mutations (occurring at different time
    scales) generate complex and often unpredictable dynamics. In this Review, we
    present our current understanding of bacterial cell physiology and genetics of
    responses to antibiotics. We emphasize recently discovered mechanisms of synergistic
    and antagonistic drug interactions, hysteresis in temporal interactions between
    antibiotics that arise from microbial physiology and interactions between antibiotics
    and resistance mutations that can cause collateral sensitivity or cross-resistance.
    We discuss possible connections between the different phenomena and indicate relevant
    research directions. A better and more unified understanding of drug and genetic
    interactions is likely to advance antibiotic therapy.
acknowledgement: The authors thank B. Kavčič and H. Schulenburg for constructive feedback
  on the manuscript.
article_processing_charge: No
article_type: review
author:
- first_name: Roderich
  full_name: Römhild, Roderich
  id: 68E56E44-62B0-11EA-B963-444F3DDC885E
  last_name: Römhild
  orcid: 0000-0001-9480-5261
- first_name: Mark Tobias
  full_name: Bollenbach, Mark Tobias
  id: 3E6DB97A-F248-11E8-B48F-1D18A9856A87
  last_name: Bollenbach
  orcid: 0000-0003-4398-476X
- first_name: Dan I.
  full_name: Andersson, Dan I.
  last_name: Andersson
citation:
  ama: Römhild R, Bollenbach MT, Andersson DI. The physiology and genetics of bacterial
    responses to antibiotic combinations. <i>Nature Reviews Microbiology</i>. 2022;20:478-490.
    doi:<a href="https://doi.org/10.1038/s41579-022-00700-5">10.1038/s41579-022-00700-5</a>
  apa: Römhild, R., Bollenbach, M. T., &#38; Andersson, D. I. (2022). The physiology
    and genetics of bacterial responses to antibiotic combinations. <i>Nature Reviews
    Microbiology</i>. Springer Nature. <a href="https://doi.org/10.1038/s41579-022-00700-5">https://doi.org/10.1038/s41579-022-00700-5</a>
  chicago: Römhild, Roderich, Mark Tobias Bollenbach, and Dan I. Andersson. “The Physiology
    and Genetics of Bacterial Responses to Antibiotic Combinations.” <i>Nature Reviews
    Microbiology</i>. Springer Nature, 2022. <a href="https://doi.org/10.1038/s41579-022-00700-5">https://doi.org/10.1038/s41579-022-00700-5</a>.
  ieee: R. Römhild, M. T. Bollenbach, and D. I. Andersson, “The physiology and genetics
    of bacterial responses to antibiotic combinations,” <i>Nature Reviews Microbiology</i>,
    vol. 20. Springer Nature, pp. 478–490, 2022.
  ista: Römhild R, Bollenbach MT, Andersson DI. 2022. The physiology and genetics
    of bacterial responses to antibiotic combinations. Nature Reviews Microbiology.
    20, 478–490.
  mla: Römhild, Roderich, et al. “The Physiology and Genetics of Bacterial Responses
    to Antibiotic Combinations.” <i>Nature Reviews Microbiology</i>, vol. 20, Springer
    Nature, 2022, pp. 478–90, doi:<a href="https://doi.org/10.1038/s41579-022-00700-5">10.1038/s41579-022-00700-5</a>.
  short: R. Römhild, M.T. Bollenbach, D.I. Andersson, Nature Reviews Microbiology
    20 (2022) 478–490.
date_created: 2022-03-04T04:33:49Z
date_published: 2022-08-01T00:00:00Z
date_updated: 2023-08-02T14:41:44Z
day: '01'
department:
- _id: CaGu
doi: 10.1038/s41579-022-00700-5
external_id:
  isi:
  - '000763891900001'
  pmid:
  - '35241807'
intvolume: '        20'
isi: 1
keyword:
- General Immunology and Microbiology
- Microbiology
- Infectious Diseases
language:
- iso: eng
month: '08'
oa_version: None
page: 478-490
pmid: 1
publication: Nature Reviews Microbiology
publication_identifier:
  eissn:
  - 1740-1534
  issn:
  - 1740-1526
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: The physiology and genetics of bacterial responses to antibiotic combinations
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 20
year: '2022'
...
---
_id: '10813'
abstract:
- lang: eng
  text: Redox mediators could catalyse otherwise slow and energy-inefficient cycling
    of Li–S and Li–O2 batteries by shuttling electrons or holes between the electrode
    and the solid insulating storage materials. For mediators to work efficiently
    they need to oxidize the solid with fast kinetics but with the lowest possible
    overpotential. However, the dependence of kinetics and overpotential is unclear,
    which hinders informed improvement. Here, we find that when the redox potentials
    of mediators are tuned via, for example, Li+ concentration in the electrolyte,
    they exhibit distinct threshold potentials, where the kinetics accelerate several-fold
    within a range as small as 10 mV. This phenomenon is independent of types of mediator
    and electrolyte. The acceleration originates from the overpotentials required
    to activate fast Li+/e− extraction and the following chemical step at specific
    abundant surface facets. Efficient redox catalysis at insulating solids therefore
    requires careful consideration of the surface conditions of the storage materials
    and electrolyte-dependent redox potentials, which may be tuned by salt concentrations
    or solvents.
acknowledgement: This work was financially supported by the National Natural Science
  Foundation of China (grant nos. 51773092, 21975124, 11874254, 51802187 and U2030206).
  It was further supported by Fujian science & technology innovation laboratory for
  energy devices of China (21C-LAB), Key Research Project of Zhejiang Laboratory (grant
  no. 2021PE0AC02) and the Cultivation Program for the Excellent Doctoral Dissertation
  of Nanjing Tech University. S.A.F. is indebted to IST Austria for support.
article_processing_charge: No
article_type: original
author:
- first_name: Deqing
  full_name: Cao, Deqing
  last_name: Cao
- first_name: Xiaoxiao
  full_name: Shen, Xiaoxiao
  last_name: Shen
- first_name: Aiping
  full_name: Wang, Aiping
  last_name: Wang
- first_name: Fengjiao
  full_name: Yu, Fengjiao
  last_name: Yu
- first_name: Yuping
  full_name: Wu, Yuping
  last_name: Wu
- first_name: Siqi
  full_name: Shi, Siqi
  last_name: Shi
- first_name: Stefan Alexander
  full_name: Freunberger, Stefan Alexander
  id: A8CA28E6-CE23-11E9-AD2D-EC27E6697425
  last_name: Freunberger
  orcid: 0000-0003-2902-5319
- first_name: Yuhui
  full_name: Chen, Yuhui
  last_name: Chen
citation:
  ama: Cao D, Shen X, Wang A, et al. Threshold potentials for fast kinetics during
    mediated redox catalysis of insulators in Li–O2 and Li–S batteries. <i>Nature
    Catalysis</i>. 2022;5:193-201. doi:<a href="https://doi.org/10.1038/s41929-022-00752-z">10.1038/s41929-022-00752-z</a>
  apa: Cao, D., Shen, X., Wang, A., Yu, F., Wu, Y., Shi, S., … Chen, Y. (2022). Threshold
    potentials for fast kinetics during mediated redox catalysis of insulators in
    Li–O2 and Li–S batteries. <i>Nature Catalysis</i>. Springer Nature. <a href="https://doi.org/10.1038/s41929-022-00752-z">https://doi.org/10.1038/s41929-022-00752-z</a>
  chicago: Cao, Deqing, Xiaoxiao Shen, Aiping Wang, Fengjiao Yu, Yuping Wu, Siqi Shi,
    Stefan Alexander Freunberger, and Yuhui Chen. “Threshold Potentials for Fast Kinetics
    during Mediated Redox Catalysis of Insulators in Li–O2 and Li–S Batteries.” <i>Nature
    Catalysis</i>. Springer Nature, 2022. <a href="https://doi.org/10.1038/s41929-022-00752-z">https://doi.org/10.1038/s41929-022-00752-z</a>.
  ieee: D. Cao <i>et al.</i>, “Threshold potentials for fast kinetics during mediated
    redox catalysis of insulators in Li–O2 and Li–S batteries,” <i>Nature Catalysis</i>,
    vol. 5. Springer Nature, pp. 193–201, 2022.
  ista: Cao D, Shen X, Wang A, Yu F, Wu Y, Shi S, Freunberger SA, Chen Y. 2022. Threshold
    potentials for fast kinetics during mediated redox catalysis of insulators in
    Li–O2 and Li–S batteries. Nature Catalysis. 5, 193–201.
  mla: Cao, Deqing, et al. “Threshold Potentials for Fast Kinetics during Mediated
    Redox Catalysis of Insulators in Li–O2 and Li–S Batteries.” <i>Nature Catalysis</i>,
    vol. 5, Springer Nature, 2022, pp. 193–201, doi:<a href="https://doi.org/10.1038/s41929-022-00752-z">10.1038/s41929-022-00752-z</a>.
  short: D. Cao, X. Shen, A. Wang, F. Yu, Y. Wu, S. Shi, S.A. Freunberger, Y. Chen,
    Nature Catalysis 5 (2022) 193–201.
corr_author: '1'
date_created: 2022-03-04T07:50:10Z
date_published: 2022-03-03T00:00:00Z
date_updated: 2024-10-09T21:01:46Z
day: '03'
department:
- _id: StFr
doi: 10.1038/s41929-022-00752-z
external_id:
  isi:
  - '000763879400001'
intvolume: '         5'
isi: 1
keyword:
- Process Chemistry and Technology
- Biochemistry
- Bioengineering
- Catalysis
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://doi.org/10.21203/rs.3.rs-750965/v1
month: '03'
oa: 1
oa_version: Preprint
page: 193-201
publication: Nature Catalysis
publication_identifier:
  issn:
  - 2520-1158
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
related_material:
  record:
  - id: '9978'
    relation: earlier_version
    status: public
scopus_import: '1'
status: public
title: Threshold potentials for fast kinetics during mediated redox catalysis of insulators
  in Li–O2 and Li–S batteries
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 5
year: '2022'
...
---
_id: '9364'
abstract:
- lang: eng
  text: 'Let t : Fp → C be a complex valued function on Fp. A classical problem in
    analytic number theory is bounding the maximum M(t) := max 0≤H<p ∣ 1/√p ∑ 0≤n<H
    t (n) ∣ of the absolute value of the incomplete sums(1/√p)∑0≤n<H t (n). In this
    very general context one of the most important results is the Pólya–Vinogradov
    bound M(t)≤IIˆtII∞ log 3p, where ˆt : Fp → C is the normalized Fourier transform
    of t. In this paper we provide a lower bound for certain incomplete Kloosterman
    sums, namely we prove that for any ε > 0 there exists a large subset of a ∈ F×p
    such that for kl a,1,p : x → e((ax+x) / p) we have M(kla,1,p) ≥ (1−ε/√2π + o(1))
    log log p, as p→∞. Finally, we prove a result on the growth of the moments of
    {M (kla,1,p)}a∈F×p. 2020 Mathematics Subject Classification: 11L03, 11T23 (Primary);
    14F20, 60F10 (Secondary).'
acknowledgement: I am most thankful to my advisor, Emmanuel Kowalski, for suggesting
  this problem and for his guidance during these years. I also would like to thank
  Youness Lamzouri for informing me about his work on sum of incomplete Birch sums
  and Tal Horesh for her suggestions on a previous version of the paper. Finally,
  I am very grateful to the anonymous referee for their careful reading of the manuscript
  and their valuable comments.
article_processing_charge: Yes (via OA deal)
article_type: original
arxiv: 1
author:
- first_name: Dante
  full_name: Bonolis, Dante
  id: 6A459894-5FDD-11E9-AF35-BB24E6697425
  last_name: Bonolis
citation:
  ama: Bonolis D. On the size of the maximum of incomplete Kloosterman sums. <i>Mathematical
    Proceedings of the Cambridge Philosophical Society</i>. 2022;172(3):563-590. doi:<a
    href="https://doi.org/10.1017/S030500412100030X">10.1017/S030500412100030X</a>
  apa: Bonolis, D. (2022). On the size of the maximum of incomplete Kloosterman sums.
    <i>Mathematical Proceedings of the Cambridge Philosophical Society</i>. Cambridge
    University Press. <a href="https://doi.org/10.1017/S030500412100030X">https://doi.org/10.1017/S030500412100030X</a>
  chicago: Bonolis, Dante. “On the Size of the Maximum of Incomplete Kloosterman Sums.”
    <i>Mathematical Proceedings of the Cambridge Philosophical Society</i>. Cambridge
    University Press, 2022. <a href="https://doi.org/10.1017/S030500412100030X">https://doi.org/10.1017/S030500412100030X</a>.
  ieee: D. Bonolis, “On the size of the maximum of incomplete Kloosterman sums,” <i>Mathematical
    Proceedings of the Cambridge Philosophical Society</i>, vol. 172, no. 3. Cambridge
    University Press, pp. 563–590, 2022.
  ista: Bonolis D. 2022. On the size of the maximum of incomplete Kloosterman sums.
    Mathematical Proceedings of the Cambridge Philosophical Society. 172(3), 563–590.
  mla: Bonolis, Dante. “On the Size of the Maximum of Incomplete Kloosterman Sums.”
    <i>Mathematical Proceedings of the Cambridge Philosophical Society</i>, vol. 172,
    no. 3, Cambridge University Press, 2022, pp. 563–90, doi:<a href="https://doi.org/10.1017/S030500412100030X">10.1017/S030500412100030X</a>.
  short: D. Bonolis, Mathematical Proceedings of the Cambridge Philosophical Society
    172 (2022) 563–590.
date_created: 2021-05-02T22:01:29Z
date_published: 2022-05-01T00:00:00Z
date_updated: 2023-08-02T06:47:48Z
day: '01'
ddc:
- '510'
department:
- _id: TiBr
doi: 10.1017/S030500412100030X
external_id:
  arxiv:
  - '1811.10563'
  isi:
  - '000784421500001'
file:
- access_level: open_access
  checksum: 614d2e9b83a78100408e4ee7752a80a8
  content_type: application/pdf
  creator: cchlebak
  date_created: 2021-12-01T14:01:54Z
  date_updated: 2021-12-01T14:01:54Z
  file_id: '10395'
  file_name: 2021_MathProcCamPhilSoc_Bonolis.pdf
  file_size: 334064
  relation: main_file
  success: 1
file_date_updated: 2021-12-01T14:01:54Z
has_accepted_license: '1'
intvolume: '       172'
isi: 1
issue: '3'
language:
- iso: eng
month: '05'
oa: 1
oa_version: Published Version
page: 563 - 590
publication: Mathematical Proceedings of the Cambridge Philosophical Society
publication_identifier:
  eissn:
  - 1469-8064
  issn:
  - 0305-0041
publication_status: published
publisher: Cambridge University Press
quality_controlled: '1'
scopus_import: '1'
status: public
title: On the size of the maximum of incomplete Kloosterman sums
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: 172
year: '2022'
...
---
_id: '9365'
abstract:
- lang: eng
  text: In this paper, we propose a new iterative method with alternated inertial
    step for solving split common null point problem in real Hilbert spaces. We obtain
    weak convergence of the proposed iterative algorithm. Furthermore, we introduce
    the notion of bounded linear regularity property for the split common null point
    problem and obtain the linear convergence property for the new algorithm under
    some mild assumptions. Finally, we provide some numerical examples to demonstrate
    the performance and efficiency of the proposed method.
acknowledgement: The second 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: No
article_type: original
author:
- first_name: Ferdinard U.
  full_name: Ogbuisi, Ferdinard U.
  last_name: Ogbuisi
- first_name: Yekini
  full_name: Shehu, Yekini
  id: 3FC7CB58-F248-11E8-B48F-1D18A9856A87
  last_name: Shehu
  orcid: 0000-0001-9224-7139
- first_name: Jen Chih
  full_name: Yao, Jen Chih
  last_name: Yao
citation:
  ama: Ogbuisi FU, Shehu Y, Yao JC. Convergence analysis of new inertial method for
    the split common null point problem. <i>Optimization</i>. 2022;71(13):3767-3795.
    doi:<a href="https://doi.org/10.1080/02331934.2021.1914035">10.1080/02331934.2021.1914035</a>
  apa: Ogbuisi, F. U., Shehu, Y., &#38; Yao, J. C. (2022). Convergence analysis of
    new inertial method for the split common null point problem. <i>Optimization</i>.
    Taylor and Francis. <a href="https://doi.org/10.1080/02331934.2021.1914035">https://doi.org/10.1080/02331934.2021.1914035</a>
  chicago: Ogbuisi, Ferdinard U., Yekini Shehu, and Jen Chih Yao. “Convergence Analysis
    of New Inertial Method for the Split Common Null Point Problem.” <i>Optimization</i>.
    Taylor and Francis, 2022. <a href="https://doi.org/10.1080/02331934.2021.1914035">https://doi.org/10.1080/02331934.2021.1914035</a>.
  ieee: F. U. Ogbuisi, Y. Shehu, and J. C. Yao, “Convergence analysis of new inertial
    method for the split common null point problem,” <i>Optimization</i>, vol. 71,
    no. 13. Taylor and Francis, pp. 3767–3795, 2022.
  ista: Ogbuisi FU, Shehu Y, Yao JC. 2022. Convergence analysis of new inertial method
    for the split common null point problem. Optimization. 71(13), 3767–3795.
  mla: Ogbuisi, Ferdinard U., et al. “Convergence Analysis of New Inertial Method
    for the Split Common Null Point Problem.” <i>Optimization</i>, vol. 71, no. 13,
    Taylor and Francis, 2022, pp. 3767–95, doi:<a href="https://doi.org/10.1080/02331934.2021.1914035">10.1080/02331934.2021.1914035</a>.
  short: F.U. Ogbuisi, Y. Shehu, J.C. Yao, Optimization 71 (2022) 3767–3795.
date_created: 2021-05-02T22:01:29Z
date_published: 2022-11-01T00:00:00Z
date_updated: 2024-11-04T13:52:36Z
day: '01'
department:
- _id: VlKo
doi: 10.1080/02331934.2021.1914035
ec_funded: 1
external_id:
  isi:
  - '000640109300001'
intvolume: '        71'
isi: 1
issue: '13'
language:
- iso: eng
month: '11'
oa_version: None
page: 3767-3795
project:
- _id: 25FBA906-B435-11E9-9278-68D0E5697425
  call_identifier: FP7
  grant_number: '616160'
  name: 'Discrete Optimization in Computer Vision: Theory and Practice'
publication: Optimization
publication_identifier:
  eissn:
  - 1029-4945
  issn:
  - 0233-1934
publication_status: published
publisher: Taylor and Francis
quality_controlled: '1'
scopus_import: '1'
status: public
title: Convergence analysis of new inertial method for the split common null point
  problem
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 71
year: '2022'
...
---
_id: '9469'
abstract:
- lang: eng
  text: In this paper, we consider reflected three-operator splitting methods for
    monotone inclusion problems in real Hilbert spaces. To do this, we first obtain
    weak convergence analysis and nonasymptotic O(1/n) convergence rate of the reflected
    Krasnosel'skiĭ-Mann iteration for finding a fixed point of nonexpansive mapping
    in real Hilbert spaces under some seemingly easy to implement conditions on the
    iterative parameters. We then apply our results to three-operator splitting for
    the monotone inclusion problem and consequently obtain the corresponding convergence
    analysis. Furthermore, we derive reflected primal-dual algorithms for highly structured
    monotone inclusion problems. Some numerical implementations are drawn from splitting
    methods to support the theoretical analysis.
acknowledgement: The authors are grateful to the anonymous referees and the handling
  Editor for their insightful comments which have improved the earlier version of
  the manuscript greatly. The second author is grateful to the University of Hafr
  Al Batin. The last 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: No
article_type: original
author:
- first_name: Olaniyi S.
  full_name: Iyiola, Olaniyi S.
  last_name: Iyiola
- first_name: Cyril D.
  full_name: Enyi, Cyril D.
  last_name: Enyi
- first_name: Yekini
  full_name: Shehu, Yekini
  id: 3FC7CB58-F248-11E8-B48F-1D18A9856A87
  last_name: Shehu
  orcid: 0000-0001-9224-7139
citation:
  ama: Iyiola OS, Enyi CD, Shehu Y. Reflected three-operator splitting method for
    monotone inclusion problem. <i>Optimization Methods and Software</i>. 2022;37(4):1527-1565.
    doi:<a href="https://doi.org/10.1080/10556788.2021.1924715">10.1080/10556788.2021.1924715</a>
  apa: Iyiola, O. S., Enyi, C. D., &#38; Shehu, Y. (2022). Reflected three-operator
    splitting method for monotone inclusion problem. <i>Optimization Methods and Software</i>.
    Taylor and Francis. <a href="https://doi.org/10.1080/10556788.2021.1924715">https://doi.org/10.1080/10556788.2021.1924715</a>
  chicago: Iyiola, Olaniyi S., Cyril D. Enyi, and Yekini Shehu. “Reflected Three-Operator
    Splitting Method for Monotone Inclusion Problem.” <i>Optimization Methods and
    Software</i>. Taylor and Francis, 2022. <a href="https://doi.org/10.1080/10556788.2021.1924715">https://doi.org/10.1080/10556788.2021.1924715</a>.
  ieee: O. S. Iyiola, C. D. Enyi, and Y. Shehu, “Reflected three-operator splitting
    method for monotone inclusion problem,” <i>Optimization Methods and Software</i>,
    vol. 37, no. 4. Taylor and Francis, pp. 1527–1565, 2022.
  ista: Iyiola OS, Enyi CD, Shehu Y. 2022. Reflected three-operator splitting method
    for monotone inclusion problem. Optimization Methods and Software. 37(4), 1527–1565.
  mla: Iyiola, Olaniyi S., et al. “Reflected Three-Operator Splitting Method for Monotone
    Inclusion Problem.” <i>Optimization Methods and Software</i>, vol. 37, no. 4,
    Taylor and Francis, 2022, pp. 1527–65, doi:<a href="https://doi.org/10.1080/10556788.2021.1924715">10.1080/10556788.2021.1924715</a>.
  short: O.S. Iyiola, C.D. Enyi, Y. Shehu, Optimization Methods and Software 37 (2022)
    1527–1565.
corr_author: '1'
date_created: 2021-06-06T22:01:30Z
date_published: 2022-07-01T00:00:00Z
date_updated: 2024-11-04T13:52:36Z
day: '01'
department:
- _id: VlKo
doi: 10.1080/10556788.2021.1924715
ec_funded: 1
external_id:
  isi:
  - '000650507600001'
intvolume: '        37'
isi: 1
issue: '4'
language:
- iso: eng
month: '07'
oa_version: None
page: 1527-1565
project:
- _id: 25FBA906-B435-11E9-9278-68D0E5697425
  call_identifier: FP7
  grant_number: '616160'
  name: 'Discrete Optimization in Computer Vision: Theory and Practice'
publication: Optimization Methods and Software
publication_identifier:
  eissn:
  - 1029-4937
  issn:
  - 1055-6788
publication_status: published
publisher: Taylor and Francis
quality_controlled: '1'
scopus_import: '1'
status: public
title: Reflected three-operator splitting method for monotone inclusion problem
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 37
year: '2022'
...
---
_id: '9649'
abstract:
- lang: eng
  text: "Isomanifolds are the generalization of isosurfaces to arbitrary dimension
    and codimension, i.e. manifolds defined as the zero set of some multivariate vector-valued
    smooth function f : Rd → Rd−n. A natural (and efficient) way to approximate an
    isomanifold is to consider its Piecewise-Linear (PL) approximation based on a
    triangulation T of the ambient space Rd. In this paper, we give conditions under
    which the PL-approximation of an isomanifold is topologically equivalent to the
    isomanifold. The conditions are easy to satisfy in the sense that they can always
    be met by taking a sufficiently\r\nfine triangulation T . This contrasts with
    previous results on the triangulation of manifolds where, in arbitrary dimensions,
    delicate perturbations are needed to guarantee topological correctness, which
    leads to strong limitations in practice. We further give a bound on the Fréchet
    distance between the original isomanifold and its PL-approximation. Finally we
    show analogous results for the PL-approximation of an isomanifold with boundary."
acknowledgement: "First and foremost, we acknowledge Siargey Kachanovich for discussions.
  We thank Herbert Edelsbrunner and all members of his group, all former and current
  members of the Datashape team (formerly known as Geometrica), and André Lieutier
  for encouragement. We further thank the reviewers of Foundations of Computational
  Mathematics and the reviewers and program committee of the Symposium on Computational
  Geometry for their feedback, which improved the exposition.\r\nThis work was 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). This work was also supported by the French government, through the
  3IA Côte d’Azur Investments in the Future project managed by the National Research
  Agency (ANR) with the reference number ANR-19-P3IA-0002. Mathijs Wintraecken 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: Mathijs
  full_name: Wintraecken, Mathijs
  id: 307CFBC8-F248-11E8-B48F-1D18A9856A87
  last_name: Wintraecken
  orcid: 0000-0002-7472-2220
citation:
  ama: Boissonnat J-D, Wintraecken M. The topological correctness of PL approximations
    of isomanifolds. <i>Foundations of Computational Mathematics </i>. 2022;22:967-1012.
    doi:<a href="https://doi.org/10.1007/s10208-021-09520-0">10.1007/s10208-021-09520-0</a>
  apa: Boissonnat, J.-D., &#38; Wintraecken, M. (2022). The topological correctness
    of PL approximations of isomanifolds. <i>Foundations of Computational Mathematics
    </i>. Springer Nature. <a href="https://doi.org/10.1007/s10208-021-09520-0">https://doi.org/10.1007/s10208-021-09520-0</a>
  chicago: Boissonnat, Jean-Daniel, and Mathijs Wintraecken. “The Topological Correctness
    of PL Approximations of Isomanifolds.” <i>Foundations of Computational Mathematics
    </i>. Springer Nature, 2022. <a href="https://doi.org/10.1007/s10208-021-09520-0">https://doi.org/10.1007/s10208-021-09520-0</a>.
  ieee: J.-D. Boissonnat and M. Wintraecken, “The topological correctness of PL approximations
    of isomanifolds,” <i>Foundations of Computational Mathematics </i>, vol. 22. Springer
    Nature, pp. 967–1012, 2022.
  ista: Boissonnat J-D, Wintraecken M. 2022. The topological correctness of PL approximations
    of isomanifolds. Foundations of Computational Mathematics . 22, 967–1012.
  mla: Boissonnat, Jean-Daniel, and Mathijs Wintraecken. “The Topological Correctness
    of PL Approximations of Isomanifolds.” <i>Foundations of Computational Mathematics
    </i>, vol. 22, Springer Nature, 2022, pp. 967–1012, doi:<a href="https://doi.org/10.1007/s10208-021-09520-0">10.1007/s10208-021-09520-0</a>.
  short: J.-D. Boissonnat, M. Wintraecken, Foundations of Computational Mathematics  22
    (2022) 967–1012.
corr_author: '1'
date_created: 2021-07-14T06:44:53Z
date_published: 2022-01-01T00:00:00Z
date_updated: 2025-04-22T13:45:18Z
day: '01'
ddc:
- '516'
department:
- _id: HeEd
doi: 10.1007/s10208-021-09520-0
ec_funded: 1
external_id:
  isi:
  - '000673039600001'
file:
- access_level: open_access
  checksum: f1d372ec3c08ec22e84f8e93e1126b8c
  content_type: application/pdf
  creator: mwintrae
  date_created: 2021-07-14T06:44:36Z
  date_updated: 2021-07-14T06:44:36Z
  file_id: '9650'
  file_name: Boissonnat-Wintraecken2021_Article_TheTopologicalCorrectnessOfPLA.pdf
  file_size: 1455699
  relation: main_file
file_date_updated: 2021-07-14T06:44:36Z
has_accepted_license: '1'
intvolume: '        22'
isi: 1
language:
- iso: eng
month: '01'
oa: 1
oa_version: Published Version
page: 967-1012
project:
- _id: 260C2330-B435-11E9-9278-68D0E5697425
  call_identifier: H2020
  grant_number: '754411'
  name: ISTplus - Postdoctoral Fellowships
publication: 'Foundations of Computational Mathematics '
publication_identifier:
  eissn:
  - 1615-3383
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
related_material:
  record:
  - id: '7952'
    relation: earlier_version
    status: public
scopus_import: '1'
status: public
title: The topological correctness of PL approximations of isomanifolds
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: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 22
year: '2022'
...
---
_id: '9695'
abstract:
- lang: eng
  text: Real-world data typically contain a large number of features that are often
    heterogeneous in nature, relevance, and also units of measure. When assessing
    the similarity between data points, one can build various distance measures using
    subsets of these features. Using the fewest features but still retaining sufficient
    information about the system is crucial in many statistical learning approaches,
    particularly when data are sparse. We introduce a statistical test that can assess
    the relative information retained when using two different distance measures,
    and determine if they are equivalent, independent, or if one is more informative
    than the other. This in turn allows finding the most informative distance measure
    out of a pool of candidates. The approach is applied to find the most relevant
    policy variables for controlling the Covid-19 epidemic and to find compact yet
    informative representations of atomic structures, but its potential applications
    are wide ranging in many branches of science.
acknowledgement: "A.G., C.Z., and A.L. gratefully acknowledge support from the European
  Union’s Horizon 2020 research and innovation program (grant number 824143, MaX ’Materials
  design at the eXascale’ Centre of Excellence). The authors would like to thank M.
  Carli, D. Doimo, and I. Macocco (SISSA) for the discussions, M. Caro (Aalto University)
  for the precious help in using the TurboGap code, and D. Frenkel (University of
  Cambridge) and N. Bernstein (US Naval Research Laboratory) for useful feedback on
  the manuscript.\r\nThis work is supported in part by funds from the European Union’s
  Horizon 2020 research and innovation program (grant number 824143, MaX ’Materials
  design at the eXascale’ Centre of Excellence)."
article_number: pgac039
article_processing_charge: Yes
article_type: original
arxiv: 1
author:
- first_name: Aldo
  full_name: Glielmo, Aldo
  last_name: Glielmo
- first_name: Claudio
  full_name: Zeni, Claudio
  last_name: Zeni
- first_name: Bingqing
  full_name: Cheng, Bingqing
  id: cbe3cda4-d82c-11eb-8dc7-8ff94289fcc9
  last_name: Cheng
  orcid: 0000-0002-3584-9632
- first_name: Gabor
  full_name: Csanyi, Gabor
  last_name: Csanyi
- first_name: Alessandro
  full_name: Laio, Alessandro
  last_name: Laio
citation:
  ama: Glielmo A, Zeni C, Cheng B, Csanyi G, Laio A. Ranking the information content
    of distance measures. <i>PNAS Nexus</i>. 2022;1(2). doi:<a href="https://doi.org/10.1093/pnasnexus/pgac039">10.1093/pnasnexus/pgac039</a>
  apa: Glielmo, A., Zeni, C., Cheng, B., Csanyi, G., &#38; Laio, A. (2022). Ranking
    the information content of distance measures. <i>PNAS Nexus</i>. Oxford University
    Press. <a href="https://doi.org/10.1093/pnasnexus/pgac039">https://doi.org/10.1093/pnasnexus/pgac039</a>
  chicago: Glielmo, Aldo, Claudio Zeni, Bingqing Cheng, Gabor Csanyi, and Alessandro
    Laio. “Ranking the Information Content of Distance Measures.” <i>PNAS Nexus</i>.
    Oxford University Press, 2022. <a href="https://doi.org/10.1093/pnasnexus/pgac039">https://doi.org/10.1093/pnasnexus/pgac039</a>.
  ieee: A. Glielmo, C. Zeni, B. Cheng, G. Csanyi, and A. Laio, “Ranking the information
    content of distance measures,” <i>PNAS Nexus</i>, vol. 1, no. 2. Oxford University
    Press, 2022.
  ista: Glielmo A, Zeni C, Cheng B, Csanyi G, Laio A. 2022. Ranking the information
    content of distance measures. PNAS Nexus. 1(2), pgac039.
  mla: Glielmo, Aldo, et al. “Ranking the Information Content of Distance Measures.”
    <i>PNAS Nexus</i>, vol. 1, no. 2, pgac039, Oxford University Press, 2022, doi:<a
    href="https://doi.org/10.1093/pnasnexus/pgac039">10.1093/pnasnexus/pgac039</a>.
  short: A. Glielmo, C. Zeni, B. Cheng, G. Csanyi, A. Laio, PNAS Nexus 1 (2022).
date_created: 2021-07-20T06:31:53Z
date_published: 2022-05-01T00:00:00Z
date_updated: 2025-06-12T06:23:20Z
day: '01'
ddc:
- '000'
department:
- _id: BiCh
doi: 10.1093/pnasnexus/pgac039
external_id:
  arxiv:
  - '2104.15079'
  pmid:
  - '36713323'
file:
- access_level: open_access
  checksum: f6552854d760eb574ce97abce2c8ef89
  content_type: application/pdf
  creator: dernst
  date_created: 2024-05-29T06:21:33Z
  date_updated: 2024-05-29T06:21:33Z
  file_id: '17080'
  file_name: 2022_PNASNexus_Glielmo.pdf
  file_size: 2005167
  relation: main_file
  success: 1
file_date_updated: 2024-05-29T06:21:33Z
has_accepted_license: '1'
intvolume: '         1'
issue: '2'
language:
- iso: eng
month: '05'
oa: 1
oa_version: Published Version
pmid: 1
publication: PNAS Nexus
publication_identifier:
  eissn:
  - 2752-6542
publication_status: published
publisher: Oxford University Press
quality_controlled: '1'
scopus_import: '1'
status: public
title: Ranking the information content of distance measures
tmp:
  image: /images/cc_by_nc_nd.png
  legal_code_url: https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode
  name: Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International
    (CC BY-NC-ND 4.0)
  short: CC BY-NC-ND (4.0)
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 1
year: '2022'
...
---
_id: '9794'
abstract:
- lang: eng
  text: 'Lymph nodes (LNs) comprise two main structural elements: fibroblastic reticular
    cells that form dedicated niches for immune cell interaction and capsular fibroblasts
    that build a shell around the organ. Immunological challenge causes LNs to increase
    more than tenfold in size within a few days. Here, we characterized the biomechanics
    of LN swelling on the cellular and organ scale. We identified lymphocyte trapping
    by influx and proliferation as drivers of an outward pressure force, causing fibroblastic
    reticular cells of the T-zone (TRCs) and their associated conduits to stretch.
    After an initial phase of relaxation, TRCs sensed the resulting strain through
    cell matrix adhesions, which coordinated local growth and remodeling of the stromal
    network. While the expanded TRC network readopted its typical configuration, a
    massive fibrotic reaction of the organ capsule set in and countered further organ
    expansion. Thus, different fibroblast populations mechanically control LN swelling
    in a multitier fashion.'
acknowledged_ssus:
- _id: Bio
- _id: EM-Fac
- _id: PreCl
- _id: LifeSc
acknowledgement: This research was supported by the Scientific Service Units of IST
  Austria through resources provided by the Imaging and Optics, Electron Microscopy,
  Preclinical and Life Science Facilities. We thank C. Moussion for providing anti-PNAd
  antibody and D. Critchley for Talin1-floxed mice, and E. Papusheva for providing
  a custom 3D channel alignment script. This work was supported by a European Research
  Council grant ERC-CoG-72437 to M.S. M.H. was supported by Czech Sciencundation GACR
  20-24603Y and Charles University PRIMUS/20/MED/013.
article_processing_charge: No
article_type: original
author:
- first_name: Frank P
  full_name: Assen, Frank P
  id: 3A8E7F24-F248-11E8-B48F-1D18A9856A87
  last_name: Assen
  orcid: 0000-0003-3470-6119
- first_name: Jun
  full_name: Abe, Jun
  last_name: Abe
- first_name: Miroslav
  full_name: Hons, Miroslav
  id: 4167FE56-F248-11E8-B48F-1D18A9856A87
  last_name: Hons
  orcid: 0000-0002-6625-3348
- first_name: Robert
  full_name: Hauschild, Robert
  id: 4E01D6B4-F248-11E8-B48F-1D18A9856A87
  last_name: Hauschild
  orcid: 0000-0001-9843-3522
- first_name: Shayan
  full_name: Shamipour, Shayan
  id: 40B34FE2-F248-11E8-B48F-1D18A9856A87
  last_name: Shamipour
- first_name: Walter
  full_name: Kaufmann, Walter
  id: 3F99E422-F248-11E8-B48F-1D18A9856A87
  last_name: Kaufmann
  orcid: 0000-0001-9735-5315
- first_name: Tommaso
  full_name: Costanzo, Tommaso
  id: D93824F4-D9BA-11E9-BB12-F207E6697425
  last_name: Costanzo
  orcid: 0000-0001-9732-3815
- first_name: Gabriel
  full_name: Krens, Gabriel
  id: 2B819732-F248-11E8-B48F-1D18A9856A87
  last_name: Krens
  orcid: 0000-0003-4761-5996
- first_name: Markus
  full_name: Brown, Markus
  id: 3DAB9AFC-F248-11E8-B48F-1D18A9856A87
  last_name: Brown
- first_name: Burkhard
  full_name: Ludewig, Burkhard
  last_name: Ludewig
- first_name: Simon
  full_name: Hippenmeyer, Simon
  id: 37B36620-F248-11E8-B48F-1D18A9856A87
  last_name: Hippenmeyer
  orcid: 0000-0003-2279-1061
- first_name: Carl-Philipp J
  full_name: Heisenberg, Carl-Philipp J
  id: 39427864-F248-11E8-B48F-1D18A9856A87
  last_name: Heisenberg
  orcid: 0000-0002-0912-4566
- first_name: Wolfgang
  full_name: Weninger, Wolfgang
  last_name: Weninger
- first_name: Edouard B
  full_name: Hannezo, Edouard B
  id: 3A9DB764-F248-11E8-B48F-1D18A9856A87
  last_name: Hannezo
  orcid: 0000-0001-6005-1561
- first_name: Sanjiv A.
  full_name: Luther, Sanjiv A.
  last_name: Luther
- first_name: Jens V.
  full_name: Stein, Jens V.
  last_name: Stein
- first_name: Michael K
  full_name: Sixt, Michael K
  id: 41E9FBEA-F248-11E8-B48F-1D18A9856A87
  last_name: Sixt
  orcid: 0000-0002-4561-241X
citation:
  ama: Assen FP, Abe J, Hons M, et al. Multitier mechanics control stromal adaptations
    in swelling lymph nodes. <i>Nature Immunology</i>. 2022;23:1246-1255. doi:<a href="https://doi.org/10.1038/s41590-022-01257-4">10.1038/s41590-022-01257-4</a>
  apa: Assen, F. P., Abe, J., Hons, M., Hauschild, R., Shamipour, S., Kaufmann, W.,
    … Sixt, M. K. (2022). Multitier mechanics control stromal adaptations in swelling
    lymph nodes. <i>Nature Immunology</i>. Springer Nature. <a href="https://doi.org/10.1038/s41590-022-01257-4">https://doi.org/10.1038/s41590-022-01257-4</a>
  chicago: Assen, Frank P, Jun Abe, Miroslav Hons, Robert Hauschild, Shayan Shamipour,
    Walter Kaufmann, Tommaso Costanzo, et al. “Multitier Mechanics Control Stromal
    Adaptations in Swelling Lymph Nodes.” <i>Nature Immunology</i>. Springer Nature,
    2022. <a href="https://doi.org/10.1038/s41590-022-01257-4">https://doi.org/10.1038/s41590-022-01257-4</a>.
  ieee: F. P. Assen <i>et al.</i>, “Multitier mechanics control stromal adaptations
    in swelling lymph nodes,” <i>Nature Immunology</i>, vol. 23. Springer Nature,
    pp. 1246–1255, 2022.
  ista: Assen FP, Abe J, Hons M, Hauschild R, Shamipour S, Kaufmann W, Costanzo T,
    Krens G, Brown M, Ludewig B, Hippenmeyer S, Heisenberg C-PJ, Weninger W, Hannezo
    EB, Luther SA, Stein JV, Sixt MK. 2022. Multitier mechanics control stromal adaptations
    in swelling lymph nodes. Nature Immunology. 23, 1246–1255.
  mla: Assen, Frank P., et al. “Multitier Mechanics Control Stromal Adaptations in
    Swelling Lymph Nodes.” <i>Nature Immunology</i>, vol. 23, Springer Nature, 2022,
    pp. 1246–55, doi:<a href="https://doi.org/10.1038/s41590-022-01257-4">10.1038/s41590-022-01257-4</a>.
  short: F.P. Assen, J. Abe, M. Hons, R. Hauschild, S. Shamipour, W. Kaufmann, T.
    Costanzo, G. Krens, M. Brown, B. Ludewig, S. Hippenmeyer, C.-P.J. Heisenberg,
    W. Weninger, E.B. Hannezo, S.A. Luther, J.V. Stein, M.K. Sixt, Nature Immunology
    23 (2022) 1246–1255.
corr_author: '1'
date_created: 2021-08-06T09:09:11Z
date_published: 2022-07-11T00:00:00Z
date_updated: 2025-06-11T13:52:43Z
day: '11'
ddc:
- '570'
department:
- _id: SiHi
- _id: CaHe
- _id: EdHa
- _id: EM-Fac
- _id: Bio
- _id: MiSi
doi: 10.1038/s41590-022-01257-4
ec_funded: 1
external_id:
  isi:
  - '000822975900002'
  pmid:
  - '35817845'
file:
- access_level: open_access
  checksum: 628e7b49809f22c75b428842efe70c68
  content_type: application/pdf
  creator: dernst
  date_created: 2022-07-25T07:11:32Z
  date_updated: 2022-07-25T07:11:32Z
  file_id: '11642'
  file_name: 2022_NatureImmunology_Assen.pdf
  file_size: 11475325
  relation: main_file
  success: 1
file_date_updated: 2022-07-25T07:11:32Z
has_accepted_license: '1'
intvolume: '        23'
isi: 1
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
page: 1246-1255
pmid: 1
project:
- _id: 25FE9508-B435-11E9-9278-68D0E5697425
  call_identifier: H2020
  grant_number: '724373'
  name: Cellular Navigation Along Spatial Gradients
publication: Nature Immunology
publication_identifier:
  eissn:
  - 1529-2916
  issn:
  - 1529-2908
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Multitier mechanics control stromal adaptations in swelling lymph nodes
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: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 23
year: '2022'
...
