---
OA_place: publisher
OA_type: hybrid
_id: '18170'
abstract:
- lang: eng
  text: 'This study presents a graphene field-effect transistor (gFET) biosensor with
    dual detection capabilities for SARS-CoV-2: one RNA detection assay to confirm
    viral positivity and the other for nucleocapsid (N-)protein detection as a proxy
    for infectiousness of the patient. This technology can be rapidly adapted to emerging
    infectious diseases, making an essential tool to contain future pandemics. To
    detect viral RNA, the highly conserved E-gene of the virus was targeted, allowing
    for the determination of SARS-CoV-2 presence or absence using nasopharyngeal swab
    samples. For N-protein detection, specific antibodies were used. Tested on 213
    clinical nasopharyngeal samples, the gFET biosensor showed good correlation with
    RT-PCR cycle threshold values, proving its high sensitivity in detecting SARS-CoV-2
    RNA. Specificity was confirmed using 21 pre-pandemic samples positive for other
    respiratory viruses. The gFET biosensor had a limit of detection (LOD) for N-protein
    of 0.9 pM, establishing a foundation for the development of a sensitive tool for
    monitoring active viral infection. Results of gFET based N-protein detection corresponded
    to the results of virus culture in all 16 available clinical samples and thus
    it also proved its capability to serve as a proxy for infectivity. Overall, these
    findings support the potential of the gFET biosensor as a point-of-care device
    for rapid diagnosis of SARS-CoV-2 infection and indirect assessment of infectiousness
    in patients, providing additional information for clinical and public health decision-making.'
acknowledgement: 'This research was funded in whole by the Austrian Science Fund (FWF)
  [P 35103-B, Grant-DOI: 10.55776/P35103]. For open access purposes, the author has
  applied a CC BY public copyright license to any author-accepted manuscript version
  arising from this submission. We would like to thank Olfert Landt for advice on
  ssDNA probe design; Rui Qiang Chen, Jennifer Stock, and Christine Wukotitsch for
  their excellent support with ONT sequencing; Christoph Köppl and Andreas Fischer
  for excellent support in recombinant N protein expression and purification; and
  the whole team at the division of clinical virology for their support with standard
  diagnostics.'
article_number: '116807'
article_processing_charge: Yes (in subscription journal)
article_type: original
author:
- first_name: Anna Nele
  full_name: Herdina, Anna Nele
  last_name: Herdina
- first_name: Anil
  full_name: Bozdogan, Anil
  last_name: Bozdogan
- first_name: Patrik
  full_name: Aspermair, Patrik
  last_name: Aspermair
- first_name: Jakub
  full_name: Dostalek, Jakub
  last_name: Dostalek
- first_name: Miriam
  full_name: Klausberger, Miriam
  last_name: Klausberger
- first_name: Nico
  full_name: Lingg, Nico
  last_name: Lingg
- first_name: Monika
  full_name: Cserjan-Puschmann, Monika
  last_name: Cserjan-Puschmann
- first_name: Patricia Pereira
  full_name: Aguilar, Patricia Pereira
  last_name: Aguilar
- first_name: Simone
  full_name: Auer, Simone
  last_name: Auer
- first_name: Halil
  full_name: Demirtas, Halil
  last_name: Demirtas
- first_name: Jakob
  full_name: Andersson, Jakob
  id: 3a5f4167-9bd9-11ed-bd12-a1446d38776f
  last_name: Andersson
- first_name: Felix
  full_name: Lötsch, Felix
  last_name: Lötsch
- first_name: Barbara
  full_name: Holzer, Barbara
  last_name: Holzer
- first_name: Adi
  full_name: Steinrigl, Adi
  last_name: Steinrigl
- first_name: Florian
  full_name: Thalhammer, Florian
  last_name: Thalhammer
- first_name: Julia
  full_name: Schellnegger, Julia
  last_name: Schellnegger
- first_name: Monika
  full_name: Breuer, Monika
  last_name: Breuer
- first_name: Wolfgang
  full_name: Knoll, Wolfgang
  last_name: Knoll
- first_name: Robert
  full_name: Strassl, Robert
  last_name: Strassl
citation:
  ama: 'Herdina AN, Bozdogan A, Aspermair P, et al. Bridging basic science and applied
    diagnostics: Comprehensive viral diagnostics enabled by graphene-based electronic
    biosensor technology advancements. <i>Biosensors and Bioelectronics</i>. 2025;267.
    doi:<a href="https://doi.org/10.1016/j.bios.2024.116807">10.1016/j.bios.2024.116807</a>'
  apa: 'Herdina, A. N., Bozdogan, A., Aspermair, P., Dostalek, J., Klausberger, M.,
    Lingg, N., … Strassl, R. (2025). Bridging basic science and applied diagnostics:
    Comprehensive viral diagnostics enabled by graphene-based electronic biosensor
    technology advancements. <i>Biosensors and Bioelectronics</i>. Elsevier. <a href="https://doi.org/10.1016/j.bios.2024.116807">https://doi.org/10.1016/j.bios.2024.116807</a>'
  chicago: 'Herdina, Anna Nele, Anil Bozdogan, Patrik Aspermair, Jakub Dostalek, Miriam
    Klausberger, Nico Lingg, Monika Cserjan-Puschmann, et al. “Bridging Basic Science
    and Applied Diagnostics: Comprehensive Viral Diagnostics Enabled by Graphene-Based
    Electronic Biosensor Technology Advancements.” <i>Biosensors and Bioelectronics</i>.
    Elsevier, 2025. <a href="https://doi.org/10.1016/j.bios.2024.116807">https://doi.org/10.1016/j.bios.2024.116807</a>.'
  ieee: 'A. N. Herdina <i>et al.</i>, “Bridging basic science and applied diagnostics:
    Comprehensive viral diagnostics enabled by graphene-based electronic biosensor
    technology advancements,” <i>Biosensors and Bioelectronics</i>, vol. 267. Elsevier,
    2025.'
  ista: 'Herdina AN, Bozdogan A, Aspermair P, Dostalek J, Klausberger M, Lingg N,
    Cserjan-Puschmann M, Aguilar PP, Auer S, Demirtas H, Andersson J, Lötsch F, Holzer
    B, Steinrigl A, Thalhammer F, Schellnegger J, Breuer M, Knoll W, Strassl R. 2025.
    Bridging basic science and applied diagnostics: Comprehensive viral diagnostics
    enabled by graphene-based electronic biosensor technology advancements. Biosensors
    and Bioelectronics. 267, 116807.'
  mla: 'Herdina, Anna Nele, et al. “Bridging Basic Science and Applied Diagnostics:
    Comprehensive Viral Diagnostics Enabled by Graphene-Based Electronic Biosensor
    Technology Advancements.” <i>Biosensors and Bioelectronics</i>, vol. 267, 116807,
    Elsevier, 2025, doi:<a href="https://doi.org/10.1016/j.bios.2024.116807">10.1016/j.bios.2024.116807</a>.'
  short: A.N. Herdina, A. Bozdogan, P. Aspermair, J. Dostalek, M. Klausberger, N.
    Lingg, M. Cserjan-Puschmann, P.P. Aguilar, S. Auer, H. Demirtas, J. Andersson,
    F. Lötsch, B. Holzer, A. Steinrigl, F. Thalhammer, J. Schellnegger, M. Breuer,
    W. Knoll, R. Strassl, Biosensors and Bioelectronics 267 (2025).
date_created: 2024-10-06T22:01:11Z
date_published: 2025-01-01T00:00:00Z
date_updated: 2025-02-27T12:34:07Z
day: '01'
ddc:
- '570'
department:
- _id: LeSa
doi: 10.1016/j.bios.2024.116807
external_id:
  isi:
  - '001328413700001'
  pmid:
  - '39341071'
file:
- access_level: open_access
  checksum: 208ac27dab27af792d198fcb74af8756
  content_type: application/pdf
  creator: dernst
  date_created: 2025-01-13T11:14:32Z
  date_updated: 2025-01-13T11:14:32Z
  file_id: '18843'
  file_name: 2025_BiosensorsBioelectronics_Herdina.pdf
  file_size: 4135372
  relation: main_file
  success: 1
file_date_updated: 2025-01-13T11:14:32Z
fulldoi: https://doi.org/10.1016/j.bios.2024.116807
has_accepted_license: '1'
intvolume: '       267'
isi: 1
language:
- iso: eng
license: https://creativecommons.org/licenses/by/4.0/
month: '01'
oa: 1
oa_version: Published Version
pmid: 1
publication: Biosensors and Bioelectronics
publication_identifier:
  eissn:
  - 1873-4235
  issn:
  - 0956-5663
publication_status: published
publisher: Elsevier
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Bridging basic science and applied diagnostics: Comprehensive viral diagnostics
  enabled by graphene-based electronic biosensor technology advancements'
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: 267
year: '2025'
...
---
OA_place: repository
OA_type: green
_id: '22021'
abstract:
- lang: eng
  text: "We establish global well-posedness for both the defocusing and\r\nfocusing
    complex-valued modified Korteweg–de Vries equations on the real line\r\nin modulation
    spaces Ms,2p (R), for all 1 \x14 p < 1 and 0 \x14 s < 3/2 − 1/p. We\r\nwill also
    show that such solutions admit global-in-time bounds in these spaces\r\nand that
    equicontinuous sets of initial data lead to equicontinuous ensembles\r\nof orbits.
    Indeed, such information forms a crucial part of our well-posedness\r\nargument."
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Saikatul
  full_name: Haque, Saikatul
  last_name: Haque
- first_name: Rowan
  full_name: Killip, Rowan
  last_name: Killip
- first_name: Monica
  full_name: Visan, Monica
  id: 056daca0-b8d1-11f0-964f-f91054abf8ca
  last_name: Visan
- first_name: Yunfeng
  full_name: Zhang, Yunfeng
  last_name: Zhang
citation:
  ama: Haque S, Killip R, Vişan M, Zhang Y.  Global well-posedness and equicontinuity
    for modified Korteweg–de Vries equations in modulation spaces. <i>Pure and Applied
    Analysis</i>. 2025;7(3):615-637. doi:<a href="https://doi.org/10.2140/paa.2025.7.615">10.2140/paa.2025.7.615</a>
  apa: Haque, S., Killip, R., Vişan, M., &#38; Zhang, Y. (2025).  Global well-posedness
    and equicontinuity for modified Korteweg–de Vries equations in modulation spaces.
    <i>Pure and Applied Analysis</i>. Mathematical Sciences Publishers. <a href="https://doi.org/10.2140/paa.2025.7.615">https://doi.org/10.2140/paa.2025.7.615</a>
  chicago: Haque, Saikatul, Rowan Killip, Monica Vişan, and Yunfeng Zhang. “ Global
    Well-Posedness and Equicontinuity for Modified Korteweg–de Vries Equations in
    Modulation Spaces.” <i>Pure and Applied Analysis</i>. Mathematical Sciences Publishers,
    2025. <a href="https://doi.org/10.2140/paa.2025.7.615">https://doi.org/10.2140/paa.2025.7.615</a>.
  ieee: S. Haque, R. Killip, M. Vişan, and Y. Zhang, “ Global well-posedness and equicontinuity
    for modified Korteweg–de Vries equations in modulation spaces,” <i>Pure and Applied
    Analysis</i>, vol. 7, no. 3. Mathematical Sciences Publishers, pp. 615–637, 2025.
  ista: Haque S, Killip R, Vişan M, Zhang Y. 2025.  Global well-posedness and equicontinuity
    for modified Korteweg–de Vries equations in modulation spaces. Pure and Applied
    Analysis. 7(3), 615–637.
  mla: Haque, Saikatul, et al. “ Global Well-Posedness and Equicontinuity for Modified
    Korteweg–de Vries Equations in Modulation Spaces.” <i>Pure and Applied Analysis</i>,
    vol. 7, no. 3, Mathematical Sciences Publishers, 2025, pp. 615–37, doi:<a href="https://doi.org/10.2140/paa.2025.7.615">10.2140/paa.2025.7.615</a>.
  short: S. Haque, R. Killip, M. Vişan, Y. Zhang, Pure and Applied Analysis 7 (2025)
    615–637.
das_tickbox: '1'
date_created: 2026-06-19T07:30:23Z
date_published: 2025-06-18T00:00:00Z
date_updated: 2026-06-24T13:22:40Z
day: '18'
doi: 10.2140/paa.2025.7.615
extern: '1'
external_id:
  arxiv:
  - '2411.05300'
fulldoi: https://doi.org/10.2140/paa.2025.7.615
intvolume: '         7'
issue: '3'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://doi.org/10.48550/arXiv.2411.05300
mathsc:
- 35Q53
- 35Q55
- 37K10
month: '06'
oa: 1
oa_version: Preprint
page: 615-637
publication: Pure and Applied Analysis
publication_identifier:
  eissn:
  - 2578-5885
  issn:
  - 2578-5893
publication_status: published
publisher: Mathematical Sciences Publishers
quality_controlled: '1'
scopus_import: '1'
status: public
title: ' Global well-posedness and equicontinuity for modified Korteweg–de Vries equations
  in modulation spaces'
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 7
year: '2025'
...
---
OA_place: repository
OA_type: green
_id: '22027'
abstract:
- lang: eng
  text: We demonstrate that in three space dimensions, the scattering behaviour of
    semilinear wave equations with quintic-type nonlinearities uniquely determines
    the nonlinearity. The nonlinearity is permitted to depend on both space and time.
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Nicholas
  full_name: Hu, Nicholas
  last_name: Hu
- first_name: Rowan
  full_name: Killip, Rowan
  last_name: Killip
- first_name: Monica
  full_name: Visan, Monica
  id: 056daca0-b8d1-11f0-964f-f91054abf8ca
  last_name: Visan
citation:
  ama: Hu N, Killip R, Vişan M. Deconvolutional determination of the nonlinearity
    in a semilinear wave equation. <i>Pure and Applied Analysis</i>. 2025;7(1):1-17.
    doi:<a href="https://doi.org/10.2140/paa.2025.7.1">10.2140/paa.2025.7.1</a>
  apa: Hu, N., Killip, R., &#38; Vişan, M. (2025). Deconvolutional determination of
    the nonlinearity in a semilinear wave equation. <i>Pure and Applied Analysis</i>.
    Mathematical Sciences Publishers. <a href="https://doi.org/10.2140/paa.2025.7.1">https://doi.org/10.2140/paa.2025.7.1</a>
  chicago: Hu, Nicholas, Rowan Killip, and Monica Vişan. “Deconvolutional Determination
    of the Nonlinearity in a Semilinear Wave Equation.” <i>Pure and Applied Analysis</i>.
    Mathematical Sciences Publishers, 2025. <a href="https://doi.org/10.2140/paa.2025.7.1">https://doi.org/10.2140/paa.2025.7.1</a>.
  ieee: N. Hu, R. Killip, and M. Vişan, “Deconvolutional determination of the nonlinearity
    in a semilinear wave equation,” <i>Pure and Applied Analysis</i>, vol. 7, no.
    1. Mathematical Sciences Publishers, pp. 1–17, 2025.
  ista: Hu N, Killip R, Vişan M. 2025. Deconvolutional determination of the nonlinearity
    in a semilinear wave equation. Pure and Applied Analysis. 7(1), 1–17.
  mla: Hu, Nicholas, et al. “Deconvolutional Determination of the Nonlinearity in
    a Semilinear Wave Equation.” <i>Pure and Applied Analysis</i>, vol. 7, no. 1,
    Mathematical Sciences Publishers, 2025, pp. 1–17, doi:<a href="https://doi.org/10.2140/paa.2025.7.1">10.2140/paa.2025.7.1</a>.
  short: N. Hu, R. Killip, M. Vişan, Pure and Applied Analysis 7 (2025) 1–17.
date_created: 2026-06-19T07:36:00Z
date_published: 2025-01-22T00:00:00Z
date_updated: 2026-06-24T13:24:38Z
day: '22'
doi: 10.2140/paa.2025.7.1
extern: '1'
external_id:
  arxiv:
  - '2307.00829'
fulldoi: https://doi.org/10.2140/paa.2025.7.1
intvolume: '         7'
issue: '1'
keyword:
- dispersive equations
- nonlinear wave equation
- semilinear wave equation
- scattering
- inverse scattering
- deconvolution
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://doi.org/10.48550/arXiv.2307.00829
mathsc:
- 35L70
- 35P25
- 35R30
month: '01'
oa: 1
oa_version: Preprint
page: 1-17
publication: Pure and Applied Analysis
publication_identifier:
  eissn:
  - 2578-5885
  issn:
  - 2578-5893
publication_status: published
publisher: Mathematical Sciences Publishers
quality_controlled: '1'
scopus_import: '1'
status: public
title: Deconvolutional determination of the nonlinearity in a semilinear wave equation
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 7
year: '2025'
...
---
OA_place: repository
OA_type: green
_id: '22044'
abstract:
- lang: eng
  text: We prove that the small-data scattering map uniquely determines the nonlinearity
    for a wide class of gauge-invariant, intercritical nonlinear Schrödinger equations.
    We use the Born approximation to reduce the analysis to a deconvolution problem
    involving the distribution function for linear Schrödinger solutions. We then
    solve this deconvolution problem using the Beurling–Lax Theorem.
article_number: '015021'
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Rowan
  full_name: Killip, Rowan
  last_name: Killip
- first_name: Jason
  full_name: Murphy, Jason
  last_name: Murphy
- first_name: Monica
  full_name: Visan, Monica
  id: 056daca0-b8d1-11f0-964f-f91054abf8ca
  last_name: Visan
citation:
  ama: Killip R, Murphy J, Vişan M. Determination of Schrödinger nonlinearities from
    the scattering map. <i>Nonlinearity</i>. 2025;38(1). doi:<a href="https://doi.org/10.1088/1361-6544/ada1bf">10.1088/1361-6544/ada1bf</a>
  apa: Killip, R., Murphy, J., &#38; Vişan, M. (2025). Determination of Schrödinger
    nonlinearities from the scattering map. <i>Nonlinearity</i>. IOP Publishing. <a
    href="https://doi.org/10.1088/1361-6544/ada1bf">https://doi.org/10.1088/1361-6544/ada1bf</a>
  chicago: Killip, Rowan, Jason Murphy, and Monica Vişan. “Determination of Schrödinger
    Nonlinearities from the Scattering Map.” <i>Nonlinearity</i>. IOP Publishing,
    2025. <a href="https://doi.org/10.1088/1361-6544/ada1bf">https://doi.org/10.1088/1361-6544/ada1bf</a>.
  ieee: R. Killip, J. Murphy, and M. Vişan, “Determination of Schrödinger nonlinearities
    from the scattering map,” <i>Nonlinearity</i>, vol. 38, no. 1. IOP Publishing,
    2025.
  ista: Killip R, Murphy J, Vişan M. 2025. Determination of Schrödinger nonlinearities
    from the scattering map. Nonlinearity. 38(1), 015021.
  mla: Killip, Rowan, et al. “Determination of Schrödinger Nonlinearities from the
    Scattering Map.” <i>Nonlinearity</i>, vol. 38, no. 1, 015021, IOP Publishing,
    2025, doi:<a href="https://doi.org/10.1088/1361-6544/ada1bf">10.1088/1361-6544/ada1bf</a>.
  short: R. Killip, J. Murphy, M. Vişan, Nonlinearity 38 (2025).
das_tickbox: '1'
date_created: 2026-06-19T07:47:06Z
date_published: 2025-01-01T00:00:00Z
date_updated: 2026-06-25T07:46:14Z
day: '01'
doi: 10.1088/1361-6544/ada1bf
extern: '1'
external_id:
  arxiv:
  - '2402.03218'
fulldoi: https://doi.org/10.1088/1361-6544/ada1bf
intvolume: '        38'
issue: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://doi.org/10.48550/arXiv.2402.03218
month: '01'
oa: 1
oa_version: Preprint
publication: Nonlinearity
publication_identifier:
  eissn:
  - 1361-6544
  issn:
  - 0951-7715
publication_status: published
publisher: IOP Publishing
quality_controlled: '1'
scopus_import: '1'
status: public
title: Determination of Schrödinger nonlinearities from the scattering map
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 38
year: '2025'
...
---
OA_place: repository
OA_type: green
_id: '22069'
abstract:
- lang: eng
  text: "For slowly-varying initial data, solutions to the Ablowitz–Ladik system have
    been proven to converge to solutions of the cubic Schrödinger equation. In this
    paper we show that in the continuum limit, solutions to the Ablowitz–Ladik system
    with H^1 initial data may also converge to solutions of the modified Korteweg–de
    Vries equation. To exhibit this new limiting behavior, it suffices that the initial
    data is supported near the inflection points of the dispersion relation associated
    with the Ablowitz–Ladik system.\r\n\r\nOur arguments employ harmonic analysis
    tools, Strichartz estimates, and the conservation of mass and energy. Correspondingly,
    they are applicable beyond the completely integrable models of greatest interest
    to us."
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Rowan
  full_name: Killip, Rowan
  last_name: Killip
- first_name: Zhimeng
  full_name: Ouyang, Zhimeng
  last_name: Ouyang
- first_name: Monica
  full_name: Visan, Monica
  id: 056daca0-b8d1-11f0-964f-f91054abf8ca
  last_name: Visan
- first_name: Lei
  full_name: Wu, Lei
  last_name: Wu
citation:
  ama: Killip R, Ouyang Z, Vişan M, Wu L. The modified Korteweg–de Vries limit of
    the Ablowitz–Ladik system. <i>Discrete and Continuous Dynamical Systems</i>. 2025;45(3):821-846.
    doi:<a href="https://doi.org/10.3934/dcds.2024114">10.3934/dcds.2024114</a>
  apa: Killip, R., Ouyang, Z., Vişan, M., &#38; Wu, L. (2025). The modified Korteweg–de
    Vries limit of the Ablowitz–Ladik system. <i>Discrete and Continuous Dynamical
    Systems</i>. American Institute of Mathematical Sciences. <a href="https://doi.org/10.3934/dcds.2024114">https://doi.org/10.3934/dcds.2024114</a>
  chicago: Killip, Rowan, Zhimeng Ouyang, Monica Vişan, and Lei Wu. “The Modified
    Korteweg–de Vries Limit of the Ablowitz–Ladik System.” <i>Discrete and Continuous
    Dynamical Systems</i>. American Institute of Mathematical Sciences, 2025. <a href="https://doi.org/10.3934/dcds.2024114">https://doi.org/10.3934/dcds.2024114</a>.
  ieee: R. Killip, Z. Ouyang, M. Vişan, and L. Wu, “The modified Korteweg–de Vries
    limit of the Ablowitz–Ladik system,” <i>Discrete and Continuous Dynamical Systems</i>,
    vol. 45, no. 3. American Institute of Mathematical Sciences, pp. 821–846, 2025.
  ista: Killip R, Ouyang Z, Vişan M, Wu L. 2025. The modified Korteweg–de Vries limit
    of the Ablowitz–Ladik system. Discrete and Continuous Dynamical Systems. 45(3),
    821–846.
  mla: Killip, Rowan, et al. “The Modified Korteweg–de Vries Limit of the Ablowitz–Ladik
    System.” <i>Discrete and Continuous Dynamical Systems</i>, vol. 45, no. 3, American
    Institute of Mathematical Sciences, 2025, pp. 821–46, doi:<a href="https://doi.org/10.3934/dcds.2024114">10.3934/dcds.2024114</a>.
  short: R. Killip, Z. Ouyang, M. Vişan, L. Wu, Discrete and Continuous Dynamical
    Systems 45 (2025) 821–846.
das_tickbox: '1'
date_created: 2026-06-19T08:20:28Z
date_published: 2025-03-01T00:00:00Z
date_updated: 2026-06-30T07:34:20Z
day: '01'
ddc:
- '500'
doi: 10.3934/dcds.2024114
extern: '1'
external_id:
  arxiv:
  - '2404.02366'
fulldoi: https://doi.org/10.3934/dcds.2024114
intvolume: '        45'
issue: '3'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://doi.org/10.48550/arXiv.2404.02366
mathsc:
- 37J70
- 37K10
- 37K60
- 35Q53
- 35Q55
month: '03'
oa: 1
oa_version: Preprint
page: 821-846
publication: Discrete and Continuous Dynamical Systems
publication_identifier:
  eissn:
  - 1553-5231
  issn:
  - 1078-0947
publication_status: published
publisher: American Institute of Mathematical Sciences
quality_controlled: '1'
scopus_import: '1'
status: public
title: The modified Korteweg–de Vries limit of the Ablowitz–Ladik system
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 45
year: '2025'
...
---
OA_place: repository
OA_type: green
_id: '22083'
abstract:
- lang: eng
  text: We prove global well-posedness for the cubic nonlinear Schrödinger equation
    with nonlinearity concentrated on a homogeneous Poisson process.
article_number: '095020'
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Benjamin
  full_name: Harrop-Griffiths, Benjamin
  last_name: Harrop-Griffiths
- first_name: Rowan
  full_name: Killip, Rowan
  last_name: Killip
- first_name: Monica
  full_name: Visan, Monica
  id: 056daca0-b8d1-11f0-964f-f91054abf8ca
  last_name: Visan
citation:
  ama: Harrop-Griffiths B, Killip R, Vişan M. The nonlinear Schrödinger equation with
    sprinkled nonlinearity. <i>Nonlinearity</i>. 2025;38(9). doi:<a href="https://doi.org/10.1088/1361-6544/ae022e">10.1088/1361-6544/ae022e</a>
  apa: Harrop-Griffiths, B., Killip, R., &#38; Vişan, M. (2025). The nonlinear Schrödinger
    equation with sprinkled nonlinearity. <i>Nonlinearity</i>. IOP Publishing. <a
    href="https://doi.org/10.1088/1361-6544/ae022e">https://doi.org/10.1088/1361-6544/ae022e</a>
  chicago: Harrop-Griffiths, Benjamin, Rowan Killip, and Monica Vişan. “The Nonlinear
    Schrödinger Equation with Sprinkled Nonlinearity.” <i>Nonlinearity</i>. IOP Publishing,
    2025. <a href="https://doi.org/10.1088/1361-6544/ae022e">https://doi.org/10.1088/1361-6544/ae022e</a>.
  ieee: B. Harrop-Griffiths, R. Killip, and M. Vişan, “The nonlinear Schrödinger equation
    with sprinkled nonlinearity,” <i>Nonlinearity</i>, vol. 38, no. 9. IOP Publishing,
    2025.
  ista: Harrop-Griffiths B, Killip R, Vişan M. 2025. The nonlinear Schrödinger equation
    with sprinkled nonlinearity. Nonlinearity. 38(9), 095020.
  mla: Harrop-Griffiths, Benjamin, et al. “The Nonlinear Schrödinger Equation with
    Sprinkled Nonlinearity.” <i>Nonlinearity</i>, vol. 38, no. 9, 095020, IOP Publishing,
    2025, doi:<a href="https://doi.org/10.1088/1361-6544/ae022e">10.1088/1361-6544/ae022e</a>.
  short: B. Harrop-Griffiths, R. Killip, M. Vişan, Nonlinearity 38 (2025).
das_tickbox: '1'
date_created: 2026-06-19T08:27:54Z
date_published: 2025-09-15T00:00:00Z
date_updated: 2026-07-01T07:17:44Z
day: '15'
doi: 10.1088/1361-6544/ae022e
extern: '1'
external_id:
  arxiv:
  - '2405.01246'
fulldoi: https://doi.org/10.1088/1361-6544/ae022e
intvolume: '        38'
issue: '9'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://doi.org/10.48550/arXiv.2405.01246
month: '09'
oa: 1
oa_version: Preprint
publication: Nonlinearity
publication_identifier:
  eissn:
  - 1361-6544
  issn:
  - 0951-7715
publication_status: published
publisher: IOP Publishing
quality_controlled: '1'
scopus_import: '1'
status: public
title: The nonlinear Schrödinger equation with sprinkled nonlinearity
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 38
year: '2025'
...
---
OA_place: publisher
OA_type: gold
_id: '22120'
article_number: EGU25-17446
article_processing_charge: No
author:
- first_name: José M
  full_name: Muñoz Hermosilla, José M
  id: e1037a6d-646e-11ef-b402-e0ed9ab0901e
  last_name: Muñoz Hermosilla
  orcid: 0000-0002-1990-8508
- first_name: Evan
  full_name: Miles, Evan
  last_name: Miles
- first_name: Michael
  full_name: McCarthy, Michael
  id: 22a2674a-61ce-11ee-94b5-d18813baf16f
  last_name: McCarthy
- first_name: Florian
  full_name: Hardmeier, Florian
  last_name: Hardmeier
- first_name: Juan Vicente
  full_name: Melo Velasco, Juan Vicente
  id: 2611dec0-b9c6-11ed-9bea-a81c2b17a549
  last_name: Melo Velasco
- first_name: Guillaume
  full_name: Jouvet, Guillaume
  last_name: Jouvet
- first_name: Francesca
  full_name: Pellicciotti, Francesca
  id: b28f055a-81ea-11ed-b70c-a9fe7f7b0e70
  last_name: Pellicciotti
  orcid: 0000-0002-5554-8087
citation:
  ama: 'Muñoz Hermosilla JM, Miles E, McCarthy M, et al. Towards reconstructing debris
    supply to reproduce the historic changes in debris extent at a Swiss glacier.
    In: <i>EGU General Assembly 2025</i>. European Geosciences Union; 2025. doi:<a
    href="https://doi.org/10.5194/egusphere-egu25-17446">10.5194/egusphere-egu25-17446</a>'
  apa: 'Muñoz Hermosilla, J. M., Miles, E., McCarthy, M., Hardmeier, F., Melo Velasco,
    J. V., Jouvet, G., &#38; Pellicciotti, F. (2025). Towards reconstructing debris
    supply to reproduce the historic changes in debris extent at a Swiss glacier.
    In <i>EGU General Assembly 2025</i>. Vienna, Austria &#38; Virtual: European Geosciences
    Union. <a href="https://doi.org/10.5194/egusphere-egu25-17446">https://doi.org/10.5194/egusphere-egu25-17446</a>'
  chicago: Muñoz Hermosilla, José M, Evan Miles, Michael McCarthy, Florian Hardmeier,
    Juan Vicente Melo Velasco, Guillaume Jouvet, and Francesca Pellicciotti. “Towards
    Reconstructing Debris Supply to Reproduce the Historic Changes in Debris Extent
    at a Swiss Glacier.” In <i>EGU General Assembly 2025</i>. European Geosciences
    Union, 2025. <a href="https://doi.org/10.5194/egusphere-egu25-17446">https://doi.org/10.5194/egusphere-egu25-17446</a>.
  ieee: J. M. Muñoz Hermosilla <i>et al.</i>, “Towards reconstructing debris supply
    to reproduce the historic changes in debris extent at a Swiss glacier,” in <i>EGU
    General Assembly 2025</i>, Vienna, Austria &#38; Virtual, 2025.
  ista: Muñoz Hermosilla JM, Miles E, McCarthy M, Hardmeier F, Melo Velasco JV, Jouvet
    G, Pellicciotti F. 2025. Towards reconstructing debris supply to reproduce the
    historic changes in debris extent at a Swiss glacier. EGU General Assembly 2025.
    EGU General Assembly, EGU25-17446.
  mla: Muñoz Hermosilla, José M., et al. “Towards Reconstructing Debris Supply to
    Reproduce the Historic Changes in Debris Extent at a Swiss Glacier.” <i>EGU General
    Assembly 2025</i>, EGU25-17446, European Geosciences Union, 2025, doi:<a href="https://doi.org/10.5194/egusphere-egu25-17446">10.5194/egusphere-egu25-17446</a>.
  short: J.M. Muñoz Hermosilla, E. Miles, M. McCarthy, F. Hardmeier, J.V. Melo Velasco,
    G. Jouvet, F. Pellicciotti, in:, EGU General Assembly 2025, European Geosciences
    Union, 2025.
conference:
  end_date: 2025-05-02
  location: Vienna, Austria & Virtual
  name: EGU General Assembly
  start_date: 2025-04-27
date_created: 2026-06-22T12:17:47Z
date_published: 2025-05-14T00:00:00Z
date_updated: 2026-07-02T06:41:43Z
day: '14'
ddc:
- '550'
department:
- _id: FrPe
- _id: GradSch
doi: 10.5194/egusphere-egu25-17446
fulldoi: https://doi.org/10.5194/egusphere-egu25-17446
has_accepted_license: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://doi.org/10.5194/egusphere-egu25-17446
month: '05'
oa: 1
oa_version: Published Version
publication: EGU General Assembly 2025
publication_status: published
publisher: European Geosciences Union
status: public
title: Towards reconstructing debris supply to reproduce the historic changes in debris
  extent at a Swiss glacier
tmp:
  image: /images/cc_by.png
  legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
  name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
  short: CC BY (4.0)
type: conference_abstract
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2025'
...
---
DOAJ_listed: '1'
OA_place: publisher
OA_type: diamond
PlanS_conform: '1'
_id: '21263'
abstract:
- lang: eng
  text: Two landmark results in combinatorial random matrix theory, due to Komlós
    and Costello–Tao–Vu, show that discrete random matrices and symmetric discrete
    random matrices are typically nonsingular. In particular, in the language of graph
    theory, when p is a fixed constant, the biadjacency matrix of a random Erdős–Rényi
    bipartite graph G(n,n,p) and the adjacency matrix of an Erdős–Rényi random graph
    G(n,p) are both nonsingular with high probability. However, very sparse random
    graphs (i.e., where p is allowed to decay rapidly with n) are typically singular,
    due to the presence of “local” dependencies such as isolated vertices and pairs
    of degree-1 vertices with the same neighbour. In this paper, we give a combinatorial
    description of the rank of a sparse random graph G(n,n,c/n) or G(n,c/n) in terms
    of such local dependencies, for all constants c=e (and we present some evidence
    that the situation is very different for c=e). This gives an essentially complete
    answer to a question raised by Vu (2014). As applications of our main theorem
    and its proof, we also determine the asymptotic singularity probability of the
    2-core of a sparse random graph, we show that the rank of a sparse random graph
    is extremely well approximated by its matching number, and we deduce a central
    limit theorem for the rank of G(n,c/n).
acknowledgement: "We would like to thank Noga Alon for suggesting that our main result
  gives\r\na linear-time algorithm for computing the rank. We also thank the referees
  for a number of thoughtful comments and suggestions. Glasgow was supported by NSF
  graduate research fellowship program award DGE1656518. Kwan was supported by ERC
  Starting Grant “RANDSTRUCT” No. 101076777. Sah and Sawhney were supported by NSF
  Graduate Research Fellowship Program DGE-1745302.\r\n"
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Margalit
  full_name: Glasgow, Margalit
  last_name: Glasgow
- 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: Ashwin
  full_name: Sah, Ashwin
  last_name: Sah
- first_name: Mehtaab
  full_name: Sawhney, Mehtaab
  last_name: Sawhney
citation:
  ama: Glasgow M, Kwan MA, Sah A, Sawhney M. The exact rank of sparse random graphs.
    <i>Journal of the European Mathematical Society</i>. 2025. doi:<a href="https://doi.org/10.4171/jems/1692">10.4171/jems/1692</a>
  apa: Glasgow, M., Kwan, M. A., Sah, A., &#38; Sawhney, M. (2025). The exact rank
    of sparse random graphs. <i>Journal of the European Mathematical Society</i>.
    EMS Press. <a href="https://doi.org/10.4171/jems/1692">https://doi.org/10.4171/jems/1692</a>
  chicago: Glasgow, Margalit, Matthew Alan Kwan, Ashwin Sah, and Mehtaab Sawhney.
    “The Exact Rank of Sparse Random Graphs.” <i>Journal of the European Mathematical
    Society</i>. EMS Press, 2025. <a href="https://doi.org/10.4171/jems/1692">https://doi.org/10.4171/jems/1692</a>.
  ieee: M. Glasgow, M. A. Kwan, A. Sah, and M. Sawhney, “The exact rank of sparse
    random graphs,” <i>Journal of the European Mathematical Society</i>. EMS Press,
    2025.
  ista: Glasgow M, Kwan MA, Sah A, Sawhney M. 2025. The exact rank of sparse random
    graphs. Journal of the European Mathematical Society.
  mla: Glasgow, Margalit, et al. “The Exact Rank of Sparse Random Graphs.” <i>Journal
    of the European Mathematical Society</i>, EMS Press, 2025, doi:<a href="https://doi.org/10.4171/jems/1692">10.4171/jems/1692</a>.
  short: M. Glasgow, M.A. Kwan, A. Sah, M. Sawhney, Journal of the European Mathematical
    Society (2025).
corr_author: '1'
das_tickbox: '1'
date_created: 2026-02-17T07:41:59Z
date_published: 2025-09-02T00:00:00Z
date_updated: 2026-07-06T11:51:31Z
day: '02'
ddc:
- '510'
department:
- _id: MaKw
doi: 10.4171/jems/1692
external_id:
  arxiv:
  - '2303.05435'
fulldoi: https://doi.org/10.4171/jems/1692
has_accepted_license: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://doi.org/10.4171/JEMS/1692
month: '09'
oa: 1
oa_version: Published Version
project:
- _id: bd95085b-d553-11ed-ba76-e55d3349be45
  grant_number: '101076777'
  name: Randomness and structure in combinatorics
publication: Journal of the European Mathematical Society
publication_identifier:
  eissn:
  - 1435-9863
  issn:
  - 1435-9855
publication_status: epub_ahead
publisher: EMS Press
quality_controlled: '1'
status: public
title: The exact rank of sparse random graphs
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
year: '2025'
...
---
OA_place: publisher
OA_type: hybrid
PlanS_conform: '1'
_id: '20656'
abstract:
- lang: eng
  text: Phytohormone auxin and its directional transport mediate much of the remarkably
    plastic development of higher plants. Positive feedback between auxin signaling
    and transport is a prerequisite for (1) self-organizing processes, including vascular
    tissue formation, and (2) directional growth responses such as gravitropism. Here,
    we identify a mechanism by which auxin signaling directly targets PIN auxin transporters.
    Via the cell-surface AUXIN-BINDING PROTEIN1 (ABP1)-TRANSMEMBRANE KINASE 1 (TMK1)
    receptor module, auxin rapidly induces phosphorylation and thus stabilization
    of PIN2. Following gravistimulation, initial auxin asymmetry activates autophosphorylation
    of the TMK1 kinase. This induces TMK1 interaction with and phosphorylation of
    PIN2, stabilizing PIN2 at the lower root side, thus reinforcing asymmetric auxin
    flow for root bending. Upstream of TMK1 in this regulation, ABP1 acts redundantly
    with the root-expressed ABP1-LIKE 3 (ABL3) auxin receptor. Such positive feedback
    between cell-surface auxin signaling and PIN-mediated polar auxin transport is
    fundamental for robust root gravitropism and presumably for other self-organizing
    developmental phenomena.
acknowledged_ssus:
- _id: Bio
- _id: LifeSc
acknowledgement: We gratefully acknowledge Tongda Xu for experimental, material, and
  conceptual support. We thank William Gray for providing material, Nataliia Gnyliukh
  and Ema Cervenova for help with manuscript preparation, and Julia Schmid for help
  with cloning. We thank Dolf Weijers, Mark Roosjen, and Andre Kuhn for discussions
  and support with phospho-proteomic analyses. We thank the Bioimaging and Life Science
  facilities at the Institute of Science and Technology Austria (ISTA) for their excellent
  service and assistance. The research leading to these results has received funding
  from the European Union (ERC, CYNIPS, 101142681) and Austrian Science Fund (FWF;
  I 6123-B) to J.F., and Y.J. was funded by ERC no. 3363360-APPL under FP/2007-2013.
  L.R. was supported by the FP7-PEOPLE-2011-COFUND ISTFELLOW program (IC1023FELL01)
  and the European Molecular Biology Organization (EMBO) long-term postdoctoral fellowship
  (ALTF 985-2016). S.T. was supported by the National Natural Science Foundation of
  China (32321001, 32570366). The work of J.H. was supported by the project JG_2024_003
  implemented within the Palacký University Young Researcher Grant.
article_processing_charge: Yes (via OA deal)
article_type: original
author:
- first_name: Lesia
  full_name: Rodriguez Solovey, Lesia
  id: 3922B506-F248-11E8-B48F-1D18A9856A87
  last_name: Rodriguez Solovey
  orcid: 0000-0002-7244-7237
- first_name: Lukas
  full_name: Fiedler, Lukas
  id: 7c417475-8972-11ed-ae7b-8b674ca26986
  last_name: Fiedler
- first_name: Minxia
  full_name: Zou, Minxia
  id: 5c243f41-03f3-11ec-841c-96faf48a7ef9
  last_name: Zou
- first_name: Caterina
  full_name: Giannini, Caterina
  id: e3fdddd5-f6e0-11ea-865d-ca99ee6367f4
  last_name: Giannini
- first_name: Aline
  full_name: Monzer, Aline
  id: 2DB5D88C-D7B3-11E9-B8FD-7907E6697425
  last_name: Monzer
- first_name: Dmitrii
  full_name: Vladimirtsev, Dmitrii
  id: 60466724-5355-11ee-ae5a-fa55e8f99c3d
  last_name: Vladimirtsev
- first_name: Marek
  full_name: Randuch, Marek
  id: 6ac4636d-15b2-11ec-abd3-fb8df79972ae
  last_name: Randuch
- first_name: Yongfan
  full_name: Yu, Yongfan
  last_name: Yu
- first_name: Zuzana
  full_name: Gelová, Zuzana
  id: 0AE74790-0E0B-11E9-ABC7-1ACFE5697425
  last_name: Gelová
  orcid: 0000-0003-4783-1752
- first_name: Inge
  full_name: Verstraeten, Inge
  id: 362BF7FE-F248-11E8-B48F-1D18A9856A87
  last_name: Verstraeten
  orcid: 0000-0001-7241-2328
- first_name: Jakub
  full_name: Hajny, Jakub
  id: 4800CC20-F248-11E8-B48F-1D18A9856A87
  last_name: Hajny
  orcid: 0000-0003-2140-7195
- first_name: Meng
  full_name: Chen, Meng
  last_name: Chen
- first_name: Shutang
  full_name: Tan, Shutang
  id: 2DE75584-F248-11E8-B48F-1D18A9856A87
  last_name: Tan
  orcid: 0000-0002-0471-8285
- first_name: Lukas
  full_name: Hörmayer, Lukas
  id: 2EEE7A2A-F248-11E8-B48F-1D18A9856A87
  last_name: Hörmayer
  orcid: 0000-0001-8295-2926
- first_name: Lanxin
  full_name: Li, Lanxin
  id: 367EF8FA-F248-11E8-B48F-1D18A9856A87
  last_name: Li
  orcid: 0000-0002-5607-272X
- first_name: Maria Mar
  full_name: Marques-Bueno, Maria Mar
  last_name: Marques-Bueno
- first_name: Zainab
  full_name: Quddoos, Zainab
  id: 32ff3c64-04a0-11f0-a50f-d0c45bfac466
  last_name: Quddoos
- first_name: Gergely
  full_name: Molnar, Gergely
  id: 34F1AF46-F248-11E8-B48F-1D18A9856A87
  last_name: Molnar
- first_name: Ivan
  full_name: Kulich, Ivan
  id: 57a1567c-8314-11eb-9063-c9ddc3451a54
  last_name: Kulich
- first_name: Yvon
  full_name: Jaillais, Yvon
  last_name: Jaillais
- first_name: Jiří
  full_name: Friml, Jiří
  id: 4159519E-F248-11E8-B48F-1D18A9856A87
  last_name: Friml
  orcid: 0000-0002-8302-7596
citation:
  ama: Rodriguez Solovey L, Fiedler L, Zou M, et al. ABP1/ABL3-TMK1 cell-surface auxin
    signaling targets PIN2-mediated auxin fluxes for root gravitropism. <i>Cell</i>.
    2025;188(22):6138-6150.e17. doi:<a href="https://doi.org/10.1016/j.cell.2025.08.026">10.1016/j.cell.2025.08.026</a>
  apa: Rodriguez Solovey, L., Fiedler, L., Zou, M., Giannini, C., Monzer, A., Vladimirtsev,
    D., … Friml, J. (2025). ABP1/ABL3-TMK1 cell-surface auxin signaling targets PIN2-mediated
    auxin fluxes for root gravitropism. <i>Cell</i>. Elsevier. <a href="https://doi.org/10.1016/j.cell.2025.08.026">https://doi.org/10.1016/j.cell.2025.08.026</a>
  chicago: Rodriguez Solovey, Lesia, Lukas Fiedler, Minxia Zou, Caterina Giannini,
    Aline Monzer, Dmitrii Vladimirtsev, Marek Randuch, et al. “ABP1/ABL3-TMK1 Cell-Surface
    Auxin Signaling Targets PIN2-Mediated Auxin Fluxes for Root Gravitropism.” <i>Cell</i>.
    Elsevier, 2025. <a href="https://doi.org/10.1016/j.cell.2025.08.026">https://doi.org/10.1016/j.cell.2025.08.026</a>.
  ieee: L. Rodriguez Solovey <i>et al.</i>, “ABP1/ABL3-TMK1 cell-surface auxin signaling
    targets PIN2-mediated auxin fluxes for root gravitropism,” <i>Cell</i>, vol. 188,
    no. 22. Elsevier, p. 6138–6150.e17, 2025.
  ista: Rodriguez Solovey L, Fiedler L, Zou M, Giannini C, Monzer A, Vladimirtsev
    D, Randuch M, Yu Y, Gelová Z, Verstraeten I, Hajny J, Chen M, Tan S, Hörmayer
    L, Li L, Marques-Bueno MM, Quddoos Z, Molnar G, Kulich I, Jaillais Y, Friml J.
    2025. ABP1/ABL3-TMK1 cell-surface auxin signaling targets PIN2-mediated auxin
    fluxes for root gravitropism. Cell. 188(22), 6138–6150.e17.
  mla: Rodriguez Solovey, Lesia, et al. “ABP1/ABL3-TMK1 Cell-Surface Auxin Signaling
    Targets PIN2-Mediated Auxin Fluxes for Root Gravitropism.” <i>Cell</i>, vol. 188,
    no. 22, Elsevier, 2025, p. 6138–6150.e17, doi:<a href="https://doi.org/10.1016/j.cell.2025.08.026">10.1016/j.cell.2025.08.026</a>.
  short: L. Rodriguez Solovey, L. Fiedler, M. Zou, C. Giannini, A. Monzer, D. Vladimirtsev,
    M. Randuch, Y. Yu, Z. Gelová, I. Verstraeten, J. Hajny, M. Chen, S. Tan, L. Hörmayer,
    L. Li, M.M. Marques-Bueno, Z. Quddoos, G. Molnar, I. Kulich, Y. Jaillais, J. Friml,
    Cell 188 (2025) 6138–6150.e17.
corr_author: '1'
date_created: 2025-11-19T09:44:31Z
date_published: 2025-10-30T00:00:00Z
date_updated: 2026-07-06T12:51:13Z
day: '30'
ddc:
- '580'
department:
- _id: JiFr
- _id: XiFe
doi: 10.1016/j.cell.2025.08.026
ec_funded: 1
external_id:
  isi:
  - '001616077900005'
  pmid:
  - '41043433'
file:
- access_level: open_access
  checksum: 8ac396a0806ad7f2e4e7a0c1eed712ce
  content_type: application/pdf
  creator: dernst
  date_created: 2025-11-24T10:55:18Z
  date_updated: 2025-11-24T10:55:18Z
  file_id: '20679'
  file_name: 2025_Cell_Rodriguez.pdf
  file_size: 17825465
  relation: main_file
  success: 1
file_date_updated: 2025-11-24T10:55:18Z
fulldoi: https://doi.org/10.1016/j.cell.2025.08.026
has_accepted_license: '1'
intvolume: '       188'
isi: 1
issue: '22'
language:
- iso: eng
month: '10'
oa: 1
oa_version: Published Version
page: 6138-6150.e17
pmid: 1
project:
- _id: 8f347782-16d5-11f0-9cad-8c19706ee739
  grant_number: '101142681'
  name: Cyclic nucleotides as second messengers in plants
- _id: bd76d395-d553-11ed-ba76-f678c14f9033
  grant_number: I06123
  name: Peptide receptors for auxin canalization in Arabidopsis
- _id: 26060676-B435-11E9-9278-68D0E5697425
  grant_number: ALTF 985-2016
  name: Cell surface receptor complexes for auxin signaling in plants
- _id: 25681D80-B435-11E9-9278-68D0E5697425
  call_identifier: FP7
  grant_number: '291734'
  name: International IST Postdoc Fellowship Programme
publication: Cell
publication_identifier:
  issn:
  - 0092-8674
publication_status: published
publisher: Elsevier
quality_controlled: '1'
related_material:
  record:
  - id: '19399'
    relation: earlier_version
    status: public
status: public
title: ABP1/ABL3-TMK1 cell-surface auxin signaling targets PIN2-mediated auxin fluxes
  for root gravitropism
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: 188
year: '2025'
...
---
OA_place: publisher
_id: '20441'
abstract:
- lang: eng
  text: "Epithelial spreading plays a pivotal role in the development of organisms
    especially those\r\nsuch as zebrafish which require the epithelial enveloping
    layer (EVL) to spread to cover the\r\nsubstantial yolk surface during gastrulation.
    Epiboly requires the transition of the epithelium\r\nwith cuboidal cells to form
    a thin, flat squamous epithelial sheet. During this transition, the\r\ncells show
    tissue-scale mechanosensation with mechanisms such as direct mechanical control\r\nover
    the axis of cell division.\r\nCytoskeletal intermediate filaments play a crucial
    role in vertebrate cells, not only facilitating\r\nmechanical stability but also
    helping facilitate the mechanosensitive response of the cell.\r\nMechanosenstivity
    displayed by intermediate filaments is due not just to their interesting\r\nphysical
    properties but also to their interactions with other cytoskeletal elements such
    as actin\r\nand microtubules. Keratin is the predominant intermediate filament
    expressed in the EVL.\r\nIt expresses concomitantly with the gastrulation movements
    of the developing embryo. Our\r\nwork focuses on understanding the role and dynamics
    of the keratin cytoskeletal network in\r\nmodulating the physical aspects of EVL
    spreading. We demonstrated with the combination of\r\nphysical characterisation
    and manipulations of the EVL, utilising a variety of biophysical tools\r\nand
    microscopy, the mechanistic role of keratin in tissue spreading.\r\nGenerating
    novel genetic morphants and mutants, we probe the effect that the loss of the\r\nkeratin
    network has on the physiology of the epithelium and the developing embryo. We\r\nshow
    that the changing organisation of the keratin network is important for changing
    EVL\r\nphysical properties as the stress imposed on the EVL increases during epiboly.
    By modelling\r\nthe epithelium, we study how the mechanical heterogeneity in an
    epithelium can feed back into\r\na mechanical loop to the maturation of the keratin
    network and hence affect the mechanics\r\nof the epithelium. However, unlike what
    would be predicted by the effect of intermediate\r\nfilaments in acting as a security
    belt and increasing the resistance of the epithelium, we observe\r\nthat loss
    of keratin leads to a delay in the EVL movement. Using both local aspirations
    of the\r\nYSL and EVL ablations, we demonstrate the mechanistic facilitation of
    actin mechanosensation\r\nin a keratin-dependent manner.\r\nFurthermore, using
    chemical inhibitors of microtubule polymerisation, we provide insight into\r\nthe
    mechanisms underlying the organisation and distribution of keratin. Interestingly,
    the\r\nphenotype observed upon this loss of microtubules shows that keratins interact
    with the nucleus\r\nthrough microtubular interactions. Together with these diverse
    observations, we describe\r\nthe mechanosensory feedback between resilience and
    that is critical for uniform and robust\r\nspreading of the epithelium."
acknowledged_ssus:
- _id: Bio
- _id: LifeSc
acknowledgement: "I would also like to thank the LSF and Cryo facility at ISTA, which
  have been helpful in my\r\nexperiments. I would also like to acknowledge FWF, grant
  DOI 10.55776/PAT5044023 and JKU Nanocell grant DOI \r\n10.55776/W1250 for providing
  funding for my PhD research. EMBO and FWF for providing funding for travel grants
  to attend conferences."
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Suyash
  full_name: Naik, Suyash
  id: 2C0B105C-F248-11E8-B48F-1D18A9856A87
  last_name: Naik
  orcid: 0000-0001-8421-5508
citation:
  ama: Naik S. Keratins act as global coordinators of tissue spreading through mechanosensitive
    feedback. 2025. doi:<a href="https://doi.org/10.15479/AT-ISTA-20441">10.15479/AT-ISTA-20441</a>
  apa: Naik, S. (2025). <i>Keratins act as global coordinators of tissue spreading
    through mechanosensitive feedback</i>. Institute of Science and Technology Austria.
    <a href="https://doi.org/10.15479/AT-ISTA-20441">https://doi.org/10.15479/AT-ISTA-20441</a>
  chicago: Naik, Suyash. “Keratins Act as Global Coordinators of Tissue Spreading
    through Mechanosensitive Feedback.” Institute of Science and Technology Austria,
    2025. <a href="https://doi.org/10.15479/AT-ISTA-20441">https://doi.org/10.15479/AT-ISTA-20441</a>.
  ieee: S. Naik, “Keratins act as global coordinators of tissue spreading through
    mechanosensitive feedback,” Institute of Science and Technology Austria, 2025.
  ista: Naik S. 2025. Keratins act as global coordinators of tissue spreading through
    mechanosensitive feedback. Institute of Science and Technology Austria.
  mla: Naik, Suyash. <i>Keratins Act as Global Coordinators of Tissue Spreading through
    Mechanosensitive Feedback</i>. Institute of Science and Technology Austria, 2025,
    doi:<a href="https://doi.org/10.15479/AT-ISTA-20441">10.15479/AT-ISTA-20441</a>.
  short: S. Naik, Keratins Act as Global Coordinators of Tissue Spreading through
    Mechanosensitive Feedback, Institute of Science and Technology Austria, 2025.
corr_author: '1'
date_created: 2025-10-10T14:58:30Z
date_published: 2025-10-12T00:00:00Z
date_updated: 2026-07-06T12:51:41Z
day: '12'
ddc:
- '596'
- '597'
- '532'
degree_awarded: PhD
department:
- _id: GradSch
- _id: CaHe
- _id: EdHa
doi: 10.15479/AT-ISTA-20441
file:
- access_level: open_access
  checksum: 2892f04d4a5c18677871c3e06ac1244a
  content_type: application/pdf
  creator: snaik
  date_created: 2025-10-28T13:10:08Z
  date_updated: 2025-10-28T13:10:08Z
  file_id: '20567'
  file_name: Thesis_PDFA_.pdf
  file_size: 6846189
  relation: main_file
  success: 1
- access_level: open_access
  checksum: 15934d4465cd0e9b7c32678da9a33a2f
  content_type: application/zip
  creator: snaik
  date_created: 2025-10-28T13:10:26Z
  date_updated: 2025-10-28T13:10:26Z
  file_id: '20568'
  file_name: Thesis.zip
  file_size: 8839300
  relation: source_file
file_date_updated: 2025-10-28T13:10:26Z
fulldoi: https://doi.org/10.15479/AT-ISTA-20441
has_accepted_license: '1'
language:
- iso: eng
license: https://creativecommons.org/licenses/by-sa/4.0/
month: '10'
oa: 1
oa_version: Published Version
page: '105'
project:
- _id: 8f060199-16d5-11f0-9cad-f3253b266c46
  grant_number: PAT 5044023
  name: Keratins in epithelial tissue spreading
- _id: 25AA5F24-B435-11E9-9278-68D0E5697425
  call_identifier: FWF
  grant_number: W 1250-B20
  name: Nano-Analytics of Cellular Systems
publication_identifier:
  isbn:
  - 978-3-99078-069-5
  issn:
  - 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
related_material:
  record:
  - id: '20465'
    relation: part_of_dissertation
    status: public
status: public
supervisor:
- 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: Edouard B
  full_name: Hannezo, Edouard B
  id: 3A9DB764-F248-11E8-B48F-1D18A9856A87
  last_name: Hannezo
  orcid: 0000-0001-6005-1561
title: Keratins act as global coordinators of tissue spreading through mechanosensitive
  feedback
tmp:
  image: /images/cc_by_sa.png
  legal_code_url: https://creativecommons.org/licenses/by-sa/4.0/legalcode
  name: Creative Commons Attribution-ShareAlike 4.0 International Public License (CC
    BY-SA 4.0)
  short: CC BY-SA (4.0)
type: dissertation
user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd
year: '2025'
...
---
OA_place: publisher
_id: '20920'
abstract:
- lang: eng
  text: "Verifiable Delay Functions (VDFs) introduced by Boneh et al. (CRYPTO'18)
    are functions that require a prescribed number of sequential steps T to evaluate,
    yet their output can be verified in time much faster than T. Since their introduction,
    VDFs have gained a lot of attention due to their applications in blockchain protocols,
    randomness beacons, timestamping and deniability. This thesis explores the theory
    and applications of VDFs, focusing on enhancing their soundness, efficiency and
    practicality.\r\n\r\nThe only practical VDFs known to date are based on repeated
    squaring in hidden order groups. Consider the function VDF(x,T)=x^(2^T).\r\nThe
    iterated squaring assumption states that, for a random group element x, the result
    of VDF cannot be computed significantly faster than performing T sequential squarings
    if the group order is unknown. To make the result verifiable a prover can compute
    a proof of exponentiation (PoE) \\pi. Given \\pi, the output of VDF can be verified
    in time much less than T.\r\n\r\nWe first present new constructions of statistically
    sound proofs of exponentiation, which are an important building block in the construction
    of SNARKs (Succinct Non-Interactive Argument of Knowledge). Statistical soundness
    means that the proofs remain secure against computationally unbounded adversaries,
    in particular, it remains secure even when the group order is known. We thereby
    address limitations in previous PoE protocols which either required (non-standard)
    hardness assumptions or a lot of parallel repetitions. Our construction significantly
    reduces the proof size of statistically sound PoEs that allow for a structured
    exponent, which leads to better efficiency of SNARKs and other applications.\r\n\r\nSecondly,
    we introduce improved batching techniques for PoEs, which allow multiple proofs
    to be aggregated and verified with minimal overhead. These protocols optimize
    communication and computation complexity in large-scale blockchain environments
    and enable scalable remote benchmarking of parallel computation resources.\r\n\r\nWe
    then construct VDFs with enhanced properties such as zero-knowledge and watermarkability.
    It was shown by Arun, Bonneau and Clark (ASIACRYPT'22) that these features enable
    new cryptographic primitives called short-lived proofs and signatures. The validity
    of such proofs and signatures expires after a predefined amount of time T, i.e.,
    they are deniable after time T. Our constructions improve upon the constructions
    by Arun, Bonneau and Clark in several dimensions (faster forging times, arguably
    weaker assumptions).\r\n\r\nFinally, we apply PoEs in the realm of primality testing,
    providing cryptographically sound proofs of non-primality for large Proth numbers.
    This work gives a surprising application of VDFs in the area of computational
    number theory.\r\n\r\nTogether, our contributions advance both the theoretical
    foundations and the real-world usability of VDFs in general and in particular
    of PoEs, making them more adaptable and secure for current and emerging cryptographic
    applications."
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Charlotte
  full_name: Hoffmann, Charlotte
  id: 0f78d746-dc7d-11ea-9b2f-83f92091afe7
  last_name: Hoffmann
  orcid: 0000-0003-2027-5549
citation:
  ama: Hoffmann C. Theory and applications of verifiable delay functions. 2025. doi:<a
    href="https://doi.org/10.15479/AT-ISTA-20920">10.15479/AT-ISTA-20920</a>
  apa: Hoffmann, C. (2025). <i>Theory and applications of verifiable delay functions</i>.
    Institute of Science and Technology Austria. <a href="https://doi.org/10.15479/AT-ISTA-20920">https://doi.org/10.15479/AT-ISTA-20920</a>
  chicago: Hoffmann, Charlotte. “Theory and Applications of Verifiable Delay Functions.”
    Institute of Science and Technology Austria, 2025. <a href="https://doi.org/10.15479/AT-ISTA-20920">https://doi.org/10.15479/AT-ISTA-20920</a>.
  ieee: C. Hoffmann, “Theory and applications of verifiable delay functions,” Institute
    of Science and Technology Austria, 2025.
  ista: Hoffmann C. 2025. Theory and applications of verifiable delay functions. Institute
    of Science and Technology Austria.
  mla: Hoffmann, Charlotte. <i>Theory and Applications of Verifiable Delay Functions</i>.
    Institute of Science and Technology Austria, 2025, doi:<a href="https://doi.org/10.15479/AT-ISTA-20920">10.15479/AT-ISTA-20920</a>.
  short: C. Hoffmann, Theory and Applications of Verifiable Delay Functions, Institute
    of Science and Technology Austria, 2025.
corr_author: '1'
date_created: 2026-01-02T10:46:47Z
date_published: 2025-12-31T00:00:00Z
date_updated: 2026-07-06T13:15:27Z
day: '31'
ddc:
- '004'
degree_awarded: PhD
department:
- _id: GradSch
- _id: KrPi
doi: 10.15479/AT-ISTA-20920
file:
- access_level: closed
  checksum: 8a099fbf54963bd0be38f7ce73658682
  content_type: application/x-zip-compressed
  creator: choffman
  date_created: 2026-01-02T10:39:16Z
  date_updated: 2026-01-02T10:39:16Z
  file_id: '20921'
  file_name: 2025_Hoffmann_Charlotte_Source.zip
  file_size: 8355494
  relation: source_file
- access_level: open_access
  checksum: 9521c07bfb2bb5b14a49c09fcfc96474
  content_type: application/pdf
  creator: choffman
  date_created: 2026-01-02T10:39:26Z
  date_updated: 2026-01-02T10:39:26Z
  file_id: '20922'
  file_name: 2025_Hoffmann_Charlotte_Thesis.pdf
  file_size: 2258804
  relation: main_file
  success: 1
file_date_updated: 2026-01-02T10:39:26Z
fulldoi: https://doi.org/10.15479/AT-ISTA-20920
has_accepted_license: '1'
language:
- iso: eng
license: https://creativecommons.org/licenses/by-nc-sa/4.0/
month: '12'
oa: 1
oa_version: Published Version
page: '116'
publication_identifier:
  issn:
  - 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
related_material:
  record:
  - id: '13143'
    relation: part_of_dissertation
    status: public
  - id: '12176'
    relation: part_of_dissertation
    status: public
  - id: '20556'
    relation: earlier_version
    status: public
  - id: '19778'
    relation: part_of_dissertation
    status: public
  - id: '20701'
    relation: part_of_dissertation
    status: public
status: public
supervisor:
- first_name: Krzysztof Z
  full_name: Pietrzak, Krzysztof Z
  id: 3E04A7AA-F248-11E8-B48F-1D18A9856A87
  last_name: Pietrzak
  orcid: 0000-0002-9139-1654
title: Theory and applications of verifiable delay functions
tmp:
  image: /images/cc_by_nc_sa.png
  legal_code_url: https://creativecommons.org/licenses/by-nc-sa/4.0/legalcode
  name: Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC
    BY-NC-SA 4.0)
  short: CC BY-NC-SA (4.0)
type: dissertation
user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd
year: '2025'
...
---
OA_place: publisher
_id: '20556'
abstract:
- lang: eng
  text: "Verifiable Delay Functions (VDFs) introduced by Boneh et al. (CRYPTO'18)
    are functions that require a prescribed number of sequential steps T to evaluate,
    yet their output can be verified in time much faster than T. Since their introduction,
    VDFs have gained a lot of attention due to their applications in blockchain protocols,
    randomness beacons, timestamping and deniability. This thesis explores the theory
    and applications of VDFs, focusing on enhancing their soundness, efficiency and
    practicality.\r\n\r\nThe only practical VDFs known to date are based on repeated
    squaring in hidden order groups. Consider the function VDF(x,T)=x^(2^T).\r\nThe
    iterated squaring assumption states that, for a random group element x, the result
    of VDF cannot be computed significantly faster than performing T sequential squarings
    if the group order is unknown. To make the result verifiable a prover can compute
    a proof of exponentiation (PoE) \\pi. Given \\pi, the output of VDF can be verified
    in time much less than T.\r\n\r\nWe first present new constructions of statistically
    sound proofs of exponentiation, which are an important building block in the construction
    of SNARKs (Succinct Non-Interactive Argument of Knowledge). Statistical soundness
    means that the proofs remain secure against computationally unbounded adversaries,
    in particular, it remains secure even when the group order is known. We thereby
    address limitations in previous PoE protocols which either required (non-standard)
    hardness assumptions or a lot of parallel repetitions. Our construction significantly
    reduces the proof size of statistically sound PoEs that allow for a structured
    exponent, which leads to better efficiency of SNARKs and other applications.\r\n\r\nSecondly,
    we introduce improved batching techniques for PoEs, which allow multiple proofs
    to be aggregated and verified with minimal overhead. These protocols optimize
    communication and computation complexity in large-scale blockchain environments
    and enable scalable remote benchmarking of parallel computation resources.\r\n\r\nWe
    then construct VDFs with enhanced properties such as zero-knowledge and watermarkability.
    It was shown by Arun, Bonneau and Clark (ASIACRYPT'22) that these features enable
    new cryptographic primitives called short-lived proofs and signatures. The validity
    of such proofs and signatures expires after a predefined amount of time T, i.e.,
    they are deniable after time T. Our constructions improve upon the constructions
    by Arun, Bonneau and Clark in several dimensions (faster forging times, arguably
    weaker assumptions).\r\n\r\nFinally, we apply PoEs in the realm of primality testing,
    providing cryptographically sound proofs of non-primality for large Proth numbers.
    This work gives a surprising application of VDFs in the area of computational
    number theory.\r\n\r\nTogether, our contributions advance both the theoretical
    foundations and the real-world usability of VDFs in general and in particular
    of PoEs, making them more adaptable and secure for current and emerging cryptographic
    applications."
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Charlotte
  full_name: Hoffmann, Charlotte
  id: 0f78d746-dc7d-11ea-9b2f-83f92091afe7
  last_name: Hoffmann
  orcid: 0000-0003-2027-5549
citation:
  ama: Hoffmann C. Theory and applications of verifiable delay functions. 2025. doi:<a
    href="https://doi.org/10.15479/AT-ISTA-20556">10.15479/AT-ISTA-20556</a>
  apa: Hoffmann, C. (2025). <i>Theory and applications of verifiable delay functions</i>.
    Institute of Science and Technology Austria. <a href="https://doi.org/10.15479/AT-ISTA-20556">https://doi.org/10.15479/AT-ISTA-20556</a>
  chicago: Hoffmann, Charlotte. “Theory and Applications of Verifiable Delay Functions.”
    Institute of Science and Technology Austria, 2025. <a href="https://doi.org/10.15479/AT-ISTA-20556">https://doi.org/10.15479/AT-ISTA-20556</a>.
  ieee: C. Hoffmann, “Theory and applications of verifiable delay functions,” Institute
    of Science and Technology Austria, 2025.
  ista: Hoffmann C. 2025. Theory and applications of verifiable delay functions. Institute
    of Science and Technology Austria.
  mla: Hoffmann, Charlotte. <i>Theory and Applications of Verifiable Delay Functions</i>.
    Institute of Science and Technology Austria, 2025, doi:<a href="https://doi.org/10.15479/AT-ISTA-20556">10.15479/AT-ISTA-20556</a>.
  short: C. Hoffmann, Theory and Applications of Verifiable Delay Functions, Institute
    of Science and Technology Austria, 2025.
corr_author: '1'
date_created: 2025-10-27T14:16:56Z
date_published: 2025-10-31T00:00:00Z
date_updated: 2026-07-06T13:15:27Z
day: '31'
ddc:
- '004'
degree_awarded: PhD
department:
- _id: GradSch
- _id: KrPi
doi: 10.15479/AT-ISTA-20556
file:
- access_level: closed
  checksum: 1fffa4e2c33dd0b9f883d615504a2858
  content_type: application/pdf
  creator: choffman
  date_created: 2025-10-28T14:33:03Z
  date_updated: 2026-01-08T14:11:39Z
  file_id: '20573'
  file_name: 2025_Hoffmann_Charlotte_Thesis.pdf
  file_size: 2259304
  relation: main_file
- access_level: closed
  checksum: 076ea98a1f0a86c3bbc990b6b9460dc2
  content_type: application/x-zip-compressed
  creator: choffman
  date_created: 2025-10-28T14:35:06Z
  date_updated: 2025-11-11T09:34:54Z
  file_id: '20574'
  file_name: 2025_Hoffmann_Charlotte_Source.zip
  file_size: 9987633
  relation: source_file
file_date_updated: 2026-01-08T14:11:39Z
fulldoi: https://doi.org/10.15479/AT-ISTA-20556
has_accepted_license: '1'
language:
- iso: eng
month: '10'
oa_version: Published Version
page: '116'
publication_identifier:
  issn:
  - 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
related_material:
  record:
  - id: '13143'
    relation: part_of_dissertation
    status: public
  - id: '12176'
    relation: part_of_dissertation
    status: public
  - id: '20920'
    relation: later_version
    status: public
  - id: '19778'
    relation: part_of_dissertation
    status: public
  - id: '20701'
    relation: part_of_dissertation
    status: public
status: public
supervisor:
- first_name: Krzysztof Z
  full_name: Pietrzak, Krzysztof Z
  id: 3E04A7AA-F248-11E8-B48F-1D18A9856A87
  last_name: Pietrzak
  orcid: 0000-0002-9139-1654
title: Theory and applications of verifiable delay functions
tmp:
  image: /images/cc_by_nc_sa.png
  legal_code_url: https://creativecommons.org/licenses/by-nc-sa/4.0/legalcode
  name: Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC
    BY-NC-SA 4.0)
  short: CC BY-NC-SA (4.0)
type: dissertation
user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd
year: '2025'
...
---
OA_place: repository
OA_type: green
_id: '10011'
abstract:
- lang: eng
  text: We propose a new weak solution concept for (two-phase) mean curvature flow
    which enjoys both (unconditional) existence and (weak-strong) uniqueness properties.
    These solutions are evolving varifolds, just as in Brakke's formulation, but are
    coupled to the phase volumes by a simple transport equation. First, we show that,
    in the exact same setup as in Ilmanen's proof [J. Differential Geom. 38, 417-461,
    (1993)], any limit point of solutions to the Allen-Cahn equation is a varifold
    solution in our sense. Second, we prove that any calibrated flow in the sense
    of Fischer et al. [arXiv:2003.05478] - and hence any classical solution to mean
    curvature flow-is unique in the class of our new varifold solutions. This is in
    sharp contrast to the case of Brakke flows, which a priori may disappear at any
    given time and are therefore fatally non-unique. Finally, we propose an extension
    of the solution concept to the multi-phase case which is at least guaranteed to
    satisfy a weak-strong uniqueness principle.
acknowledgement: This project has received funding from the European Research Council
  (ERC) under the European Union’s Horizon 2020 research and innovation programme
  (grant agreement No 948819), and from the Deutsche Forschungsgemeinschaft (DFG,
  German Research Foundation) under Germany’s Excellence Strategy – EXC-2047/1 – 390685813.
  The content of this paper was developed and parts of it were written during a visit
  of the first author to the Hausdorff Center of Mathematics (HCM), University of
  Bonn. The hospitality and the support of HCM are gratefully acknowledged.
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Sebastian
  full_name: Hensel, Sebastian
  id: 4D23B7DA-F248-11E8-B48F-1D18A9856A87
  last_name: Hensel
  orcid: 0000-0001-7252-8072
- first_name: Tim
  full_name: Laux, Tim
  last_name: Laux
citation:
  ama: 'Hensel S, Laux T. A new varifold solution concept for mean curvature flow:
    Convergence of  the Allen-Cahn equation and weak-strong uniqueness. <i>Journal
    of Differential Geometry</i>. 2025;130:209-268. doi:<a href="https://doi.org/10.4310/jdg/1747065796">10.4310/jdg/1747065796</a>'
  apa: 'Hensel, S., &#38; Laux, T. (2025). A new varifold solution concept for mean
    curvature flow: Convergence of  the Allen-Cahn equation and weak-strong uniqueness.
    <i>Journal of Differential Geometry</i>. International Press of Boston. <a href="https://doi.org/10.4310/jdg/1747065796">https://doi.org/10.4310/jdg/1747065796</a>'
  chicago: 'Hensel, Sebastian, and Tim Laux. “A New Varifold Solution Concept for
    Mean Curvature Flow: Convergence of  the Allen-Cahn Equation and Weak-Strong Uniqueness.”
    <i>Journal of Differential Geometry</i>. International Press of Boston, 2025.
    <a href="https://doi.org/10.4310/jdg/1747065796">https://doi.org/10.4310/jdg/1747065796</a>.'
  ieee: 'S. Hensel and T. Laux, “A new varifold solution concept for mean curvature
    flow: Convergence of  the Allen-Cahn equation and weak-strong uniqueness,” <i>Journal
    of Differential Geometry</i>, vol. 130. International Press of Boston, pp. 209–268,
    2025.'
  ista: 'Hensel S, Laux T. 2025. A new varifold solution concept for mean curvature
    flow: Convergence of  the Allen-Cahn equation and weak-strong uniqueness. Journal
    of Differential Geometry. 130, 209–268.'
  mla: 'Hensel, Sebastian, and Tim Laux. “A New Varifold Solution Concept for Mean
    Curvature Flow: Convergence of  the Allen-Cahn Equation and Weak-Strong Uniqueness.”
    <i>Journal of Differential Geometry</i>, vol. 130, International Press of Boston,
    2025, pp. 209–68, doi:<a href="https://doi.org/10.4310/jdg/1747065796">10.4310/jdg/1747065796</a>.'
  short: S. Hensel, T. Laux, Journal of Differential Geometry 130 (2025) 209–268.
corr_author: '1'
das_tickbox: '1'
date_created: 2021-09-13T12:17:10Z
date_published: 2025-05-01T00:00:00Z
date_updated: 2026-07-06T13:37:21Z
day: '01'
department:
- _id: JuFi
doi: 10.4310/jdg/1747065796
ec_funded: 1
external_id:
  arxiv:
  - '2109.04233'
fulldoi: https://doi.org/10.4310/jdg/1747065796
intvolume: '       130'
keyword:
- Mean curvature flow
- gradient flows
- varifolds
- weak solutions
- weak-strong uniqueness
- calibrated geometry
- gradient-flow calibrations
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://arxiv.org/abs/2109.04233
month: '05'
oa: 1
oa_version: Preprint
page: 209-268
project:
- _id: 0aa76401-070f-11eb-9043-b5bb049fa26d
  call_identifier: H2020
  grant_number: '948819'
  name: Bridging Scales in Random Materials
publication: Journal of Differential Geometry
publication_identifier:
  eissn:
  - 1945-743X
  issn:
  - 0022-040X
publication_status: published
publisher: International Press of Boston
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'A new varifold solution concept for mean curvature flow: Convergence of  the
  Allen-Cahn equation and weak-strong uniqueness'
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 130
year: '2025'
...
---
OA_place: publisher
OA_type: gold
_id: '20004'
abstract:
- lang: eng
  text: "A long-standing conjecture of Eckhoff, Linhart, and Welzl, which would generalize
    McMullen’s Upper Bound Theorem for polytopes and refine asymptotic bounds due
    to Clarkson, asserts that for k ⩽ ⌊(n-d-2)/2⌋, the complexity of the (⩽ k)-level
    in a simple arrangement of n hemispheres in S^d is maximized for arrangements
    that are polar duals of neighborly d-polytopes. We prove this conjecture in the
    case n = d+4. By Gale duality, this implies the following result about crossing
    numbers: In every spherical arc drawing of K_n in S² (given by a set V ⊂ S² of
    n unit vectors connected by spherical arcs), the number of crossings is at least
    1/4 ⌊n/2⌋ ⌊(n-1)/2⌋ ⌊(n-2)/2⌋ ⌊(n-3)/2⌋. This lower bound is attained if every
    open linear halfspace contains at least ⌊(n-2)/2⌋ of the vectors in V.\r\nMoreover,
    we determine the space of all linear and affine relations that hold between the
    face numbers of levels in simple arrangements of n hemispheres in S^d. This completes
    a long line of research on such relations, answers a question posed by Andrzejak
    and Welzl in 2003, and generalizes the classical fact that the Dehn-Sommerville
    relations generate all linear relations between the face numbers of simple polytopes
    (which correspond to the 0-level).\r\nTo prove these results, we introduce the
    notion of the g-matrix, which encodes the face numbers of levels in an arrangement
    and generalizes the classical g-vector of a polytope."
alternative_title:
- LIPIcs
article_number: '75'
article_processing_charge: Yes
arxiv: 1
author:
- first_name: Elizaveta
  full_name: Streltsova, Elizaveta
  id: 57a170da-dc96-11ea-b7c8-ab3565071bf7
  last_name: Streltsova
- first_name: Uli
  full_name: Wagner, Uli
  id: 36690CA2-F248-11E8-B48F-1D18A9856A87
  last_name: Wagner
  orcid: 0000-0002-1494-0568
citation:
  ama: 'Streltsova E, Wagner U. Levels in arrangements: Linear relations, the g-matrix,
    and applications to crossing numbers. In: <i>41st International Symposium on Computational
    Geometry</i>. Vol 332. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2025.
    doi:<a href="https://doi.org/10.4230/LIPIcs.SoCG.2025.75">10.4230/LIPIcs.SoCG.2025.75</a>'
  apa: 'Streltsova, E., &#38; Wagner, U. (2025). Levels in arrangements: Linear relations,
    the g-matrix, and applications to crossing numbers. In <i>41st International Symposium
    on Computational Geometry</i> (Vol. 332). Kanazawa, Japan: Schloss Dagstuhl -
    Leibniz-Zentrum für Informatik. <a href="https://doi.org/10.4230/LIPIcs.SoCG.2025.75">https://doi.org/10.4230/LIPIcs.SoCG.2025.75</a>'
  chicago: 'Streltsova, Elizaveta, and Uli Wagner. “Levels in Arrangements: Linear
    Relations, the g-Matrix, and Applications to Crossing Numbers.” In <i>41st International
    Symposium on Computational Geometry</i>, Vol. 332. Schloss Dagstuhl - Leibniz-Zentrum
    für Informatik, 2025. <a href="https://doi.org/10.4230/LIPIcs.SoCG.2025.75">https://doi.org/10.4230/LIPIcs.SoCG.2025.75</a>.'
  ieee: 'E. Streltsova and U. Wagner, “Levels in arrangements: Linear relations, the
    g-matrix, and applications to crossing numbers,” in <i>41st International Symposium
    on Computational Geometry</i>, Kanazawa, Japan, 2025, vol. 332.'
  ista: 'Streltsova E, Wagner U. 2025. Levels in arrangements: Linear relations, the
    g-matrix, and applications to crossing numbers. 41st International Symposium on
    Computational Geometry. SoCG: Symposium on Computational Geometry, LIPIcs, vol.
    332, 75.'
  mla: 'Streltsova, Elizaveta, and Uli Wagner. “Levels in Arrangements: Linear Relations,
    the g-Matrix, and Applications to Crossing Numbers.” <i>41st International Symposium
    on Computational Geometry</i>, vol. 332, 75, Schloss Dagstuhl - Leibniz-Zentrum
    für Informatik, 2025, doi:<a href="https://doi.org/10.4230/LIPIcs.SoCG.2025.75">10.4230/LIPIcs.SoCG.2025.75</a>.'
  short: E. Streltsova, U. Wagner, in:, 41st International Symposium on Computational
    Geometry, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025.
conference:
  end_date: 2025-06-27
  location: Kanazawa, Japan
  name: 'SoCG: Symposium on Computational Geometry'
  start_date: 2025-06-23
corr_author: '1'
das_tickbox: '1'
date_created: 2025-07-13T22:01:22Z
date_published: 2025-06-20T00:00:00Z
date_updated: 2026-07-07T13:03:16Z
day: '20'
ddc:
- '510'
department:
- _id: UlWa
doi: 10.4230/LIPIcs.SoCG.2025.75
external_id:
  arxiv:
  - '2504.07752'
  - '2504.07770'
file:
- access_level: open_access
  checksum: a8f7feb1aa3b896e31195841a989d622
  content_type: application/pdf
  creator: dernst
  date_created: 2025-07-14T07:11:04Z
  date_updated: 2025-07-14T07:11:04Z
  file_id: '20015'
  file_name: 2025_LIPIcs.SoCG_Streltsova.pdf
  file_size: 952807
  relation: main_file
  success: 1
file_date_updated: 2025-07-14T07:11:04Z
fulldoi: https://doi.org/10.4230/LIPIcs.SoCG.2025.75
has_accepted_license: '1'
intvolume: '       332'
language:
- iso: eng
month: '06'
oa: 1
oa_version: Published Version
publication: 41st International Symposium on Computational Geometry
publication_identifier:
  eissn:
  - 1868-8969
  isbn:
  - '9783959773706'
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Levels in arrangements: Linear relations, the g-matrix, and applications to
  crossing numbers'
tmp:
  image: /images/cc_by.png
  legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
  name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
  short: CC BY (4.0)
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 332
year: '2025'
...
---
OA_place: publisher
OA_type: hybrid
_id: '19733'
abstract:
- lang: eng
  text: One of the most striking quantum phenomena is superposition, where one particle
    simultaneously inhabits different states. Most methods to verify coherent superposition
    are indirect, in that they require the distinct states to be recombined. Here,
    we adapt an xor game, in which a “test” photon is placed in a superposition of
    two orthogonal spatial modes, and each mode is sent to separated parties who perform
    local measurements on their modes without reinterfering the original modes. We
    show that by using a second identical “measurement” photon the parties are nonetheless
    able to verify if the test photon was placed in coherent superposition of the
    two spatial modes. We then turn this game into a resource-efficient verification
    scheme, obtaining a confidence that the particle is superposed which approaches
    unity exponentially fast. We demonstrate our scheme using a single photon, obtaining
    a 99% confidence that the particle is superposed with only 37 copies. Our work
    shows the utility of xor games to verify quantum resources, allowing us to efficiently
    detect quantum superposition without reinterfering the superposed modes.
acknowledgement: This project has received funding from the European Union's Horizon
  2020 and Horizon Europe research and innovation programmes under Grant Agreements
  No. 899368 (EPIQUS) and No. 101135288 (EPIQUE), the Marie Skłodowska-Curie Grant
  Agreement No. 956071 (AppQInfo), and the QuantERA II Programme under Grant Agreement
  No. 101017733 (PhoMemtor). The financial support by the Austrian Federal Ministry
  of Labour and Economy, the National Foundation for Research, Technology and Development,
  and the Christian Doppler Research Association is gratefully acknowledged. L.A.R.
  acknowledges support from the Erwin Schrödinger Center for Quantum Science & Technology
  (ESQ Discovery). This research was funded in whole or in part from the Austrian
  Science Fund (FWF) through [Grant No. 10.55776/COE1] (Quantum Science Austria),
  [Grant No. 10.55776/F71] (BeyondC), [Grant No. 10.55776/FG5] (Research Group 5),
  [Grant No. 10.55776/I6002] (PhoMemtor), and [Grant No. 10.55776/P36994] (Quantum
  Interference).
article_number: L050402
article_processing_charge: No
article_type: letter_note
arxiv: 1
author:
- first_name: Daniel
  full_name: Kun, Daniel
  last_name: Kun
- first_name: Karl T
  full_name: Strömberg, Karl T
  id: 68011cd2-da32-11ee-a930-b2774c7aba5f
  last_name: Strömberg
- first_name: Michele
  full_name: Spagnolo, Michele
  last_name: Spagnolo
- first_name: Borivoje
  full_name: Dakić, Borivoje
  last_name: Dakić
- first_name: Lee A.
  full_name: Rozema, Lee A.
  last_name: Rozema
- first_name: Philip
  full_name: Walther, Philip
  last_name: Walther
citation:
  ama: Kun D, Strömberg KT, Spagnolo M, Dakić B, Rozema LA, Walther P. Direct and
    efficient detection of quantum superposition. <i>Physical Review A</i>. 2025;111(5).
    doi:<a href="https://doi.org/10.1103/PhysRevA.111.L050402">10.1103/PhysRevA.111.L050402</a>
  apa: Kun, D., Strömberg, K. T., Spagnolo, M., Dakić, B., Rozema, L. A., &#38; Walther,
    P. (2025). Direct and efficient detection of quantum superposition. <i>Physical
    Review A</i>. American Physical Society. <a href="https://doi.org/10.1103/PhysRevA.111.L050402">https://doi.org/10.1103/PhysRevA.111.L050402</a>
  chicago: Kun, Daniel, Karl T Strömberg, Michele Spagnolo, Borivoje Dakić, Lee A.
    Rozema, and Philip Walther. “Direct and Efficient Detection of Quantum Superposition.”
    <i>Physical Review A</i>. American Physical Society, 2025. <a href="https://doi.org/10.1103/PhysRevA.111.L050402">https://doi.org/10.1103/PhysRevA.111.L050402</a>.
  ieee: D. Kun, K. T. Strömberg, M. Spagnolo, B. Dakić, L. A. Rozema, and P. Walther,
    “Direct and efficient detection of quantum superposition,” <i>Physical Review
    A</i>, vol. 111, no. 5. American Physical Society, 2025.
  ista: Kun D, Strömberg KT, Spagnolo M, Dakić B, Rozema LA, Walther P. 2025. Direct
    and efficient detection of quantum superposition. Physical Review A. 111(5), L050402.
  mla: Kun, Daniel, et al. “Direct and Efficient Detection of Quantum Superposition.”
    <i>Physical Review A</i>, vol. 111, no. 5, L050402, American Physical Society,
    2025, doi:<a href="https://doi.org/10.1103/PhysRevA.111.L050402">10.1103/PhysRevA.111.L050402</a>.
  short: D. Kun, K.T. Strömberg, M. Spagnolo, B. Dakić, L.A. Rozema, P. Walther, Physical
    Review A 111 (2025).
das_tickbox: '1'
dataavailabilitystatement: Data that support the findings of this study are openly
  available at Zenodo.
date_created: 2025-05-25T22:16:54Z
date_published: 2025-05-16T00:00:00Z
date_updated: 2026-07-07T14:05:51Z
day: '16'
ddc:
- '530'
department:
- _id: OnHo
doi: 10.1103/PhysRevA.111.L050402
external_id:
  arxiv:
  - '2405.08065'
  isi:
  - '001501941500006'
file:
- access_level: open_access
  checksum: b83295a8f597b7781d8e7bfa3b393b42
  content_type: application/pdf
  creator: dernst
  date_created: 2025-05-28T09:16:03Z
  date_updated: 2025-05-28T09:16:03Z
  file_id: '19755'
  file_name: 2025_PhysReviewA_Kun.pdf
  file_size: 571784
  relation: main_file
  success: 1
file_date_updated: 2025-05-28T09:16:03Z
fulldoi: https://doi.org/10.1103/PhysRevA.111.L050402
has_accepted_license: '1'
intvolume: '       111'
isi: 1
issue: '5'
language:
- iso: eng
month: '05'
oa: 1
oa_version: Published Version
publication: Physical Review A
publication_identifier:
  eissn:
  - 2469-9934
  issn:
  - 2469-9926
publication_status: published
publisher: American Physical Society
quality_controlled: '1'
related_material:
  record:
  - id: '22142'
    relation: research_data
    status: public
researchdata_availability: yes
scopus_import: '1'
status: public
supplementarymaterial: yes
title: Direct and efficient detection of quantum superposition
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: 68b8ca59-c5b3-11ee-8790-cd641c68093d
volume: 111
year: '2025'
...
---
OA_place: repository
OA_type: green
_id: '22142'
abstract:
- lang: eng
  text: "Data to generate Figures from the Letter \"Direct and Efficient Detection
    of Quantum Superposition\" published in APS Physical Review A.\r\nThe code can
    be found on the provided GitLab repository."
article_processing_charge: No
author:
- first_name: Daniel
  full_name: Kun, Daniel
  last_name: Kun
citation:
  ama: Kun D. Direct And Efficient Detection of Quantum Superposition - Data and Figures.
    2025. doi:<a href="https://doi.org/10.5281/zenodo.13375452">10.5281/zenodo.13375452</a>
  apa: Kun, D. (2025). Direct And Efficient Detection of Quantum Superposition - Data
    and Figures. Zenodo. <a href="https://doi.org/10.5281/zenodo.13375452">https://doi.org/10.5281/zenodo.13375452</a>
  chicago: Kun, Daniel. “Direct And Efficient Detection of Quantum Superposition -
    Data and Figures.” Zenodo, 2025. <a href="https://doi.org/10.5281/zenodo.13375452">https://doi.org/10.5281/zenodo.13375452</a>.
  ieee: D. Kun, “Direct And Efficient Detection of Quantum Superposition - Data and
    Figures.” Zenodo, 2025.
  ista: Kun D. 2025. Direct And Efficient Detection of Quantum Superposition - Data
    and Figures, Zenodo, <a href="https://doi.org/10.5281/zenodo.13375452">10.5281/zenodo.13375452</a>.
  mla: Kun, Daniel. <i>Direct And Efficient Detection of Quantum Superposition - Data
    and Figures</i>. Zenodo, 2025, doi:<a href="https://doi.org/10.5281/zenodo.13375452">10.5281/zenodo.13375452</a>.
  short: D. Kun, (2025).
contributor:
- contributor_type: researcher
  first_name: Lee
  last_name: Rozema
- contributor_type: researcher
  first_name: Teodor
  last_name: Stroemberg
- contributor_type: supervisor
  first_name: Philip
  last_name: Walther
- contributor_type: supervisor
  first_name: Borivoje
  last_name: Dakic
date_created: 2026-06-25T11:08:53Z
date_published: 2025-04-24T00:00:00Z
date_updated: 2026-07-07T14:05:51Z
day: '24'
ddc:
- '530'
department:
- _id: OnHo
doi: 10.5281/zenodo.13375452
fulldoi: https://doi.org/10.5281/zenodo.13375452
main_file_link:
- open_access: '1'
  url: https://doi.org/10.5281/zenodo.13375452
month: '4'
oa: 1
oa_version: Published Version
publisher: Zenodo
related_material:
  record:
  - id: '19733'
    relation: used_in_publication
    status: public
status: public
title: Direct And Efficient Detection of Quantum Superposition - Data and Figures
type: research_data_reference
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
year: '2025'
...
---
OA_place: repository
OA_type: green
_id: '22155'
abstract:
- lang: eng
  text: "The canonical Ramsey theorem of Erdős and Rado implies that for any graph
    \U0001D43B, any edge-coloring (with an arbitrary number of colors) of a sufficiently
    large complete graph \U0001D43E\U0001D441 contains a monochromatic, lexicographic,
    or rainbow copy of \U0001D43B. The least such \U0001D441 is called the Erdős–Rado
    number of \U0001D43B, denoted by \U0001D438⁢\U0001D445⁡(\U0001D43B). Erdős–Rado
    numbers of cliques have received considerable attention, and in this paper we
    extend this line of research by studying Erdős–Rado numbers of sparse graphs.
    For example, we prove that if \U0001D43B has bounded degree, then \U0001D438⁢\U0001D445⁡(\U0001D43B)
    is polynomial in |\U0001D449⁡(\U0001D43B)| if \U0001D43B is bipartite but exponential
    in general. We also study the closely related problem of constrained Ramsey numbers.
    For a given tree S and given path \U0001D443\U0001D461, we study the minimum \U0001D441
    such that every edge-coloring of \U0001D43E\U0001D441 contains a monochromatic
    copy of S or a rainbow copy of \U0001D443\U0001D461. We prove a nearly optimal
    upper bound for this problem, which differs from the best known lower bound by
    a function of inverse Ackermann type."
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Lior
  full_name: Gishboliner, Lior
  last_name: Gishboliner
- first_name: Aleksa
  full_name: Milojević, Aleksa
  last_name: Milojević
- first_name: Benny
  full_name: Sudakov, Benny
  last_name: Sudakov
- first_name: Yuval
  full_name: Wigderson, Yuval
  id: 2d0023a0-1567-11f0-833d-d5c1e476d4b5
  last_name: Wigderson
citation:
  ama: Gishboliner L, Milojević A, Sudakov B, Wigderson Y. Canonical Ramsey numbers
    of sparse graphs. <i>SIAM Journal on Discrete Mathematics</i>. 2025;39(3):1491-1519.
    doi:<a href="https://doi.org/10.1137/24m1714964">10.1137/24m1714964</a>
  apa: Gishboliner, L., Milojević, A., Sudakov, B., &#38; Wigderson, Y. (2025). Canonical
    Ramsey numbers of sparse graphs. <i>SIAM Journal on Discrete Mathematics</i>.
    Society for Industrial &#38; Applied Mathematics. <a href="https://doi.org/10.1137/24m1714964">https://doi.org/10.1137/24m1714964</a>
  chicago: Gishboliner, Lior, Aleksa Milojević, Benny Sudakov, and Yuval Wigderson.
    “Canonical Ramsey Numbers of Sparse Graphs.” <i>SIAM Journal on Discrete Mathematics</i>.
    Society for Industrial &#38; Applied Mathematics, 2025. <a href="https://doi.org/10.1137/24m1714964">https://doi.org/10.1137/24m1714964</a>.
  ieee: L. Gishboliner, A. Milojević, B. Sudakov, and Y. Wigderson, “Canonical Ramsey
    numbers of sparse graphs,” <i>SIAM Journal on Discrete Mathematics</i>, vol. 39,
    no. 3. Society for Industrial &#38; Applied Mathematics, pp. 1491–1519, 2025.
  ista: Gishboliner L, Milojević A, Sudakov B, Wigderson Y. 2025. Canonical Ramsey
    numbers of sparse graphs. SIAM Journal on Discrete Mathematics. 39(3), 1491–1519.
  mla: Gishboliner, Lior, et al. “Canonical Ramsey Numbers of Sparse Graphs.” <i>SIAM
    Journal on Discrete Mathematics</i>, vol. 39, no. 3, Society for Industrial &#38;
    Applied Mathematics, 2025, pp. 1491–519, doi:<a href="https://doi.org/10.1137/24m1714964">10.1137/24m1714964</a>.
  short: L. Gishboliner, A. Milojević, B. Sudakov, Y. Wigderson, SIAM Journal on Discrete
    Mathematics 39 (2025) 1491–1519.
date_created: 2026-06-29T10:49:48Z
date_published: 2025-09-01T00:00:00Z
date_updated: 2026-07-08T07:38:44Z
day: '01'
doi: 10.1137/24m1714964
extern: '1'
external_id:
  arxiv:
  - '2410.08644'
fulldoi: https://doi.org/10.1137/24m1714964
intvolume: '        39'
issue: '3'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://doi.org/10.48550/arXiv.2410.08644
mathsc:
- 05D10
month: '09'
oa: 1
oa_version: Preprint
page: 1491-1519
publication: SIAM Journal on Discrete Mathematics
publication_identifier:
  eissn:
  - 1095-7146
  issn:
  - 0895-4801
publication_status: published
publisher: Society for Industrial & Applied Mathematics
quality_controlled: '1'
scopus_import: '1'
status: public
title: Canonical Ramsey numbers of sparse graphs
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 39
year: '2025'
...
---
DOAJ_listed: '1'
OA_place: publisher
OA_type: gold
_id: '19636'
abstract:
- lang: eng
  text: This summary of the second Terrestrial Very-Long-Baseline Atom Interferometry
    (TVLBAI) Workshop provides a comprehensive overview of our meeting held in London
    in April 2024 (Second Terrestrial Very-Long-Baseline Atom Interferometry Workshop,
    Imperial College, April 2024), building on the initial discussions during the
    inaugural workshop held at CERN in March 2023 (First Terrestrial Very-Long-Baseline
    Atom Interferometry Workshop, CERN, March 2023). Like the summary of the first
    workshop (Abend et al. in AVS Quantum Sci. 6:024701, 2024), this document records
    a critical milestone for the international atom interferometry community. It documents
    our concerted efforts to evaluate progress, address emerging challenges, and refine
    strategic directions for future large-scale atom interferometry projects. Our
    commitment to collaboration is manifested by the integration of diverse expertise
    and the coordination of international resources, all aimed at advancing the frontiers
    of atom interferometry physics and technology, as set out in a Memorandum of Understanding
    signed by over 50 institutions (Memorandum of Understanding for the Terrestrial
    Very Long Baseline Atom Interferometer Study).
acknowledgement: "We acknowledge the support of the CERN Physics Beyond Collider activity,
  the CERN Quantum Technology Initiative, the Long Range Broad Agency Announcement
  (BAA) for the Navy and Marine Corps Science and Technology programme, Hannover Leibniz
  University, and the Physics Department at Imperial College London, whose contributions
  were instrumental in supporting the workshop that laid the foundation for this paper.\r\nThe
  workshop was partially funded by contributions from the Long Range Broad Agency
  Announcement (BAA) for the Navy and Marine Corps Science and Technology programme,
  Hannover Leibniz University, and the Physics Department at Imperial College London."
article_number: '42'
article_processing_charge: Yes
article_type: review
arxiv: 1
author:
- first_name: Adam
  full_name: Abdalla, Adam
  last_name: Abdalla
- first_name: Mahiro
  full_name: Abe, Mahiro
  last_name: Abe
- first_name: Sven
  full_name: Abend, Sven
  last_name: Abend
- first_name: Mouine
  full_name: Abidi, Mouine
  last_name: Abidi
- first_name: Monika
  full_name: Aidelsburger, Monika
  last_name: Aidelsburger
- first_name: Ashkan
  full_name: Alibabaei, Ashkan
  last_name: Alibabaei
- first_name: Baptiste
  full_name: Allard, Baptiste
  last_name: Allard
- first_name: John
  full_name: Antoniadis, John
  last_name: Antoniadis
- first_name: Gianluigi
  full_name: Arduini, Gianluigi
  last_name: Arduini
- first_name: Nadja
  full_name: Augst, Nadja
  last_name: Augst
- first_name: Philippos
  full_name: Balamatsias, Philippos
  last_name: Balamatsias
- first_name: Antun
  full_name: Balaž, Antun
  last_name: Balaž
- first_name: Hannah
  full_name: Banks, Hannah
  last_name: Banks
- first_name: Rachel L.
  full_name: Barcklay, Rachel L.
  last_name: Barcklay
- first_name: Michele
  full_name: Barone, Michele
  last_name: Barone
- first_name: Michele
  full_name: Barsanti, Michele
  last_name: Barsanti
- first_name: Mark G.
  full_name: Bason, Mark G.
  last_name: Bason
- first_name: Angelo
  full_name: Bassi, Angelo
  last_name: Bassi
- first_name: Jean Baptiste
  full_name: Bayle, Jean Baptiste
  last_name: Bayle
- first_name: Charles F.A.
  full_name: Baynham, Charles F.A.
  last_name: Baynham
- first_name: Quentin
  full_name: Beaufils, Quentin
  last_name: Beaufils
- first_name: Sélyan
  full_name: Beldjoudi, Sélyan
  last_name: Beldjoudi
- first_name: Aleksandar
  full_name: Belić, Aleksandar
  last_name: Belić
- first_name: Shayne
  full_name: Bennetts, Shayne
  last_name: Bennetts
- first_name: Jose
  full_name: Bernabeu, Jose
  last_name: Bernabeu
- first_name: Andrea
  full_name: Bertoldi, Andrea
  last_name: Bertoldi
- first_name: Clara
  full_name: Bigard, Clara
  last_name: Bigard
- first_name: N. P.
  full_name: Bigelow, N. P.
  last_name: Bigelow
- first_name: Robert
  full_name: Bingham, Robert
  last_name: Bingham
- first_name: Diego
  full_name: Blas, Diego
  last_name: Blas
- first_name: Alexey
  full_name: Bobrick, Alexey
  last_name: Bobrick
- first_name: Samuel
  full_name: Boehringer, Samuel
  last_name: Boehringer
- first_name: Aleksandar
  full_name: Bogojević, Aleksandar
  last_name: Bogojević
- first_name: Kai
  full_name: Bongs, Kai
  last_name: Bongs
- first_name: Daniela
  full_name: Bortoletto, Daniela
  last_name: Bortoletto
- first_name: Philippe
  full_name: Bouyer, Philippe
  last_name: Bouyer
- first_name: Christian
  full_name: Brand, Christian
  last_name: Brand
- first_name: Oliver
  full_name: Buchmueller, Oliver
  last_name: Buchmueller
- first_name: Gabriela
  full_name: Buica, Gabriela
  last_name: Buica
- first_name: Sergio
  full_name: Calatroni, Sergio
  last_name: Calatroni
- first_name: Léo
  full_name: Calmels, Léo
  last_name: Calmels
- first_name: Priscilla
  full_name: Canizares, Priscilla
  last_name: Canizares
- first_name: Benjamin
  full_name: Canuel, Benjamin
  last_name: Canuel
- first_name: Ana
  full_name: Caramete, Ana
  last_name: Caramete
- first_name: Laurentiu Ioan
  full_name: Caramete, Laurentiu Ioan
  last_name: Caramete
- first_name: Matteo
  full_name: Carlesso, Matteo
  last_name: Carlesso
- first_name: John
  full_name: Carlton, John
  last_name: Carlton
- first_name: Samuel P.
  full_name: Carman, Samuel P.
  last_name: Carman
- first_name: Andrew
  full_name: Carroll, Andrew
  last_name: Carroll
- first_name: Mateo
  full_name: Casariego, Mateo
  last_name: Casariego
- first_name: Minoas
  full_name: Chairetis, Minoas
  last_name: Chairetis
- first_name: Vassilis
  full_name: Charmandaris, Vassilis
  last_name: Charmandaris
- first_name: Upasna
  full_name: Chauhan, Upasna
  last_name: Chauhan
- first_name: Jiajun
  full_name: Chen, Jiajun
  last_name: Chen
- first_name: Maria Luisa Maria Luisa Marilù
  full_name: Chiofalo, Maria Luisa Maria Luisa Marilù
  last_name: Chiofalo
- first_name: Donatella
  full_name: Ciampini, Donatella
  last_name: Ciampini
- first_name: Alessia
  full_name: Cimbri, Alessia
  last_name: Cimbri
- first_name: Pierre
  full_name: Cladé, Pierre
  last_name: Cladé
- first_name: Jonathon
  full_name: Coleman, Jonathon
  last_name: Coleman
- first_name: Florin Lucian
  full_name: Constantin, Florin Lucian
  last_name: Constantin
- first_name: Carlo R.
  full_name: Contaldi, Carlo R.
  last_name: Contaldi
- first_name: Robin
  full_name: Corgier, Robin
  last_name: Corgier
- first_name: Bineet
  full_name: Dash, Bineet
  last_name: Dash
- first_name: G. J.
  full_name: Davies, G. J.
  last_name: Davies
- first_name: Claudia
  full_name: De Rham, Claudia
  last_name: De Rham
- first_name: Albert
  full_name: De Roeck, Albert
  last_name: De Roeck
- first_name: Daniel
  full_name: Derr, Daniel
  last_name: Derr
- first_name: Soumyodeep
  full_name: Dey, Soumyodeep
  last_name: Dey
- first_name: Fabio
  full_name: Di Pumpo, Fabio
  last_name: Di Pumpo
- first_name: Goran S.
  full_name: Djordjevic, Goran S.
  last_name: Djordjevic
- first_name: Babette
  full_name: Döbrich, Babette
  last_name: Döbrich
- first_name: Peter
  full_name: Dornan, Peter
  last_name: Dornan
- first_name: Michael
  full_name: Doser, Michael
  last_name: Doser
- first_name: Giannis
  full_name: Drougakis, Giannis
  last_name: Drougakis
- first_name: Jacob
  full_name: Dunningham, Jacob
  last_name: Dunningham
- first_name: Alisher
  full_name: Duspayev, Alisher
  last_name: Duspayev
- first_name: Sajan
  full_name: Easo, Sajan
  last_name: Easo
- first_name: Joshua
  full_name: Eby, Joshua
  last_name: Eby
- first_name: Maxim
  full_name: Efremov, Maxim
  last_name: Efremov
- first_name: Gedminas
  full_name: Elertas, Gedminas
  last_name: Elertas
- first_name: John
  full_name: Ellis, John
  last_name: Ellis
- first_name: Nicholas
  full_name: Entin, Nicholas
  last_name: Entin
- first_name: Stephen
  full_name: Fairhurst, Stephen
  last_name: Fairhurst
- first_name: Mattia
  full_name: Fanì, Mattia
  last_name: Fanì
- first_name: Farida
  full_name: Fassi, Farida
  last_name: Fassi
- first_name: Pierre
  full_name: Fayet, Pierre
  last_name: Fayet
- first_name: Daniel
  full_name: Felea, Daniel
  last_name: Felea
- first_name: Jie
  full_name: Feng, Jie
  last_name: Feng
- first_name: Robert
  full_name: Flack, Robert
  last_name: Flack
- first_name: Chris
  full_name: Foot, Chris
  last_name: Foot
- first_name: Tim
  full_name: Freegarde, Tim
  last_name: Freegarde
- first_name: Elina
  full_name: Fuchs, Elina
  last_name: Fuchs
- first_name: Naceur
  full_name: Gaaloul, Naceur
  last_name: Gaaloul
- first_name: Dongfeng
  full_name: Gao, Dongfeng
  last_name: Gao
- first_name: Susan
  full_name: Gardner, Susan
  last_name: Gardner
- first_name: Barry M.
  full_name: Garraway, Barry M.
  last_name: Garraway
- first_name: Carlos L.
  full_name: Garrido Alzar, Carlos L.
  last_name: Garrido Alzar
- first_name: Alexandre
  full_name: Gauguet, Alexandre
  last_name: Gauguet
- first_name: Enno
  full_name: Giese, Enno
  last_name: Giese
- first_name: Patrick
  full_name: Gill, Patrick
  last_name: Gill
- first_name: Gian F.
  full_name: Giudice, Gian F.
  last_name: Giudice
- first_name: Eric P.
  full_name: Glasbrenner, Eric P.
  last_name: Glasbrenner
- first_name: Jonah
  full_name: Glick, Jonah
  last_name: Glick
- first_name: Peter W.
  full_name: Graham, Peter W.
  last_name: Graham
- first_name: Eduardo
  full_name: Granados, Eduardo
  last_name: Granados
- first_name: Paul F.
  full_name: Griffin, Paul F.
  last_name: Griffin
- first_name: Jordan
  full_name: Gué, Jordan
  last_name: Gué
- first_name: Saïda
  full_name: Guellati-Khelifa, Saïda
  last_name: Guellati-Khelifa
- first_name: Subhadeep
  full_name: Gupta, Subhadeep
  last_name: Gupta
- first_name: Vishu
  full_name: Gupta, Vishu
  last_name: Gupta
- first_name: Lucia
  full_name: Hackermueller, Lucia
  last_name: Hackermueller
- first_name: Martin
  full_name: Haehnelt, Martin
  last_name: Haehnelt
- first_name: Timo
  full_name: Hakulinen, Timo
  last_name: Hakulinen
- first_name: Klemens
  full_name: Hammerer, Klemens
  last_name: Hammerer
- first_name: Ekim T.
  full_name: Hanımeli, Ekim T.
  last_name: Hanımeli
- first_name: Tiffany
  full_name: Harte, Tiffany
  last_name: Harte
- first_name: Sabrina
  full_name: Hartmann, Sabrina
  last_name: Hartmann
- first_name: Leonie
  full_name: Hawkins, Leonie
  last_name: Hawkins
- first_name: Aurelien
  full_name: Hees, Aurelien
  last_name: Hees
- first_name: Alexander
  full_name: Herbst, Alexander
  last_name: Herbst
- first_name: Thomas M.
  full_name: Hird, Thomas M.
  last_name: Hird
- first_name: Richard
  full_name: Hobson, Richard
  last_name: Hobson
- first_name: Jason
  full_name: Hogan, Jason
  last_name: Hogan
- first_name: Bodil
  full_name: Holst, Bodil
  last_name: Holst
- first_name: Michael
  full_name: Holynski, Michael
  last_name: Holynski
- first_name: Onur
  full_name: Hosten, Onur
  id: 4C02D85E-F248-11E8-B48F-1D18A9856A87
  last_name: Hosten
  orcid: 0000-0002-2031-204X
- first_name: Chung Chuan
  full_name: Hsu, Chung Chuan
  last_name: Hsu
- first_name: Wayne Cheng Wei
  full_name: Huang, Wayne Cheng Wei
  last_name: Huang
- first_name: Kenneth M.
  full_name: Hughes, Kenneth M.
  last_name: Hughes
- first_name: Kamran
  full_name: Hussain, Kamran
  last_name: Hussain
- first_name: Gert
  full_name: Hütsi, Gert
  last_name: Hütsi
- first_name: Antonio
  full_name: Iovino, Antonio
  last_name: Iovino
- first_name: Maria Catalina
  full_name: Isfan, Maria Catalina
  last_name: Isfan
- first_name: Gregor
  full_name: Janson, Gregor
  last_name: Janson
- first_name: Peter
  full_name: Jeglič, Peter
  last_name: Jeglič
- first_name: Philippe
  full_name: Jetzer, Philippe
  last_name: Jetzer
- first_name: Yijun
  full_name: Jiang, Yijun
  last_name: Jiang
- first_name: Gediminas
  full_name: Juzeliūnas, Gediminas
  last_name: Juzeliūnas
- first_name: Wilhelm
  full_name: Kaenders, Wilhelm
  last_name: Kaenders
- first_name: Matti
  full_name: Kalliokoski, Matti
  last_name: Kalliokoski
- first_name: Alex
  full_name: Kehagias, Alex
  last_name: Kehagias
- first_name: Eva
  full_name: Kilian, Eva
  last_name: Kilian
- first_name: Carsten
  full_name: Klempt, Carsten
  last_name: Klempt
- first_name: Peter
  full_name: Knight, Peter
  last_name: Knight
- first_name: Soumen
  full_name: Koley, Soumen
  last_name: Koley
- first_name: Bernd
  full_name: Konrad, Bernd
  last_name: Konrad
- first_name: Tim
  full_name: Kovachy, Tim
  last_name: Kovachy
- first_name: Markus
  full_name: Krutzik, Markus
  last_name: Krutzik
- first_name: Mukesh
  full_name: Kumar, Mukesh
  last_name: Kumar
- first_name: Pradeep
  full_name: Kumar, Pradeep
  last_name: Kumar
- first_name: Hamza
  full_name: Labiad, Hamza
  last_name: Labiad
- first_name: Shau Yu
  full_name: Lan, Shau Yu
  last_name: Lan
- first_name: Arnaud
  full_name: Landragin, Arnaud
  last_name: Landragin
- first_name: Greg
  full_name: Landsberg, Greg
  last_name: Landsberg
- first_name: Mehdi
  full_name: Langlois, Mehdi
  last_name: Langlois
- first_name: Bryony
  full_name: Lanigan, Bryony
  last_name: Lanigan
- first_name: Bruno
  full_name: Leone, Bruno
  last_name: Leone
- first_name: Christophe
  full_name: Le Poncin-Lafitte, Christophe
  last_name: Le Poncin-Lafitte
- first_name: Samuel
  full_name: Lellouch, Samuel
  last_name: Lellouch
- first_name: Marek
  full_name: Lewicki, Marek
  last_name: Lewicki
- first_name: Yu Hung
  full_name: Lien, Yu Hung
  last_name: Lien
- first_name: Lucas
  full_name: Lombriser, Lucas
  last_name: Lombriser
- first_name: Elias Lopez
  full_name: Asamar, Elias Lopez
  last_name: Asamar
- first_name: J. Luis
  full_name: Lopez-Gonzalez, J. Luis
  last_name: Lopez-Gonzalez
- first_name: Chen
  full_name: Lu, Chen
  last_name: Lu
- first_name: Giuseppe Gaetano
  full_name: Luciano, Giuseppe Gaetano
  last_name: Luciano
- first_name: Nathan
  full_name: Lundblad, Nathan
  last_name: Lundblad
- first_name: Cristian
  full_name: De J. López Monjaraz, Cristian
  last_name: De J. López Monjaraz
- first_name: Adam
  full_name: Lowe, Adam
  last_name: Lowe
- first_name: Mažena
  full_name: Mackoit-Sinkevičienė, Mažena
  last_name: Mackoit-Sinkevičienė
- first_name: Michele
  full_name: Maggiore, Michele
  last_name: Maggiore
- first_name: Anirban
  full_name: Majumdar, Anirban
  last_name: Majumdar
- first_name: Konstantinos
  full_name: Makris, Konstantinos
  last_name: Makris
- first_name: Azadeh
  full_name: Maleknejad, Azadeh
  last_name: Maleknejad
- first_name: Anna L.
  full_name: Marchant, Anna L.
  last_name: Marchant
- first_name: Agnese
  full_name: Mariotti, Agnese
  last_name: Mariotti
- first_name: Christos
  full_name: Markou, Christos
  last_name: Markou
- first_name: Barnaby
  full_name: Matthews, Barnaby
  last_name: Matthews
- first_name: Anupam
  full_name: Mazumdar, Anupam
  last_name: Mazumdar
- first_name: Christopher
  full_name: Mccabe, Christopher
  last_name: Mccabe
- first_name: Matthias
  full_name: Meister, Matthias
  last_name: Meister
- first_name: Giorgio
  full_name: Mentasti, Giorgio
  last_name: Mentasti
- first_name: Jonathan
  full_name: Menu, Jonathan
  last_name: Menu
- first_name: Giuseppe
  full_name: Messineo, Giuseppe
  last_name: Messineo
- first_name: Bernd
  full_name: Meyer-Hoppe, Bernd
  last_name: Meyer-Hoppe
- first_name: Salvatore
  full_name: Micalizio, Salvatore
  last_name: Micalizio
- first_name: Federica
  full_name: Migliaccio, Federica
  last_name: Migliaccio
- first_name: Peter
  full_name: Millington, Peter
  last_name: Millington
- first_name: Milan
  full_name: Milosevic, Milan
  last_name: Milosevic
- first_name: Abhay
  full_name: Mishra, Abhay
  last_name: Mishra
- first_name: Jeremiah
  full_name: Mitchell, Jeremiah
  last_name: Mitchell
- first_name: Gavin W.
  full_name: Morley, Gavin W.
  last_name: Morley
- first_name: Noam
  full_name: Mouelle, Noam
  last_name: Mouelle
- first_name: Jürgen
  full_name: Müller, Jürgen
  last_name: Müller
- first_name: David
  full_name: Newbold, David
  last_name: Newbold
- first_name: Wei Tou
  full_name: Ni, Wei Tou
  last_name: Ni
- first_name: Christian
  full_name: Niehof, Christian
  last_name: Niehof
- first_name: Johannes
  full_name: Noller, Johannes
  last_name: Noller
- first_name: Senad
  full_name: Odžak, Senad
  last_name: Odžak
- first_name: Daniel K.L.
  full_name: Oi, Daniel K.L.
  last_name: Oi
- first_name: Andreas
  full_name: Oikonomou, Andreas
  last_name: Oikonomou
- first_name: Yasser
  full_name: Omar, Yasser
  last_name: Omar
- first_name: Chris
  full_name: Overstreet, Chris
  last_name: Overstreet
- first_name: Vishnupriya
  full_name: Puthiya Veettil, Vishnupriya
  last_name: Puthiya Veettil
- first_name: Julia
  full_name: Pahl, Julia
  last_name: Pahl
- first_name: Sean
  full_name: Paling, Sean
  last_name: Paling
- first_name: Zhongyin
  full_name: Pan, Zhongyin
  last_name: Pan
- first_name: George
  full_name: Pappas, George
  last_name: Pappas
- first_name: Vinay
  full_name: Pareek, Vinay
  last_name: Pareek
- first_name: Elizabeth
  full_name: Pasatembou, Elizabeth
  last_name: Pasatembou
- first_name: Mauro
  full_name: Paternostro, Mauro
  last_name: Paternostro
- first_name: Vishal K.
  full_name: Pathak, Vishal K.
  last_name: Pathak
- first_name: Emanuele
  full_name: Pelucchi, Emanuele
  last_name: Pelucchi
- first_name: Franck
  full_name: Pereira Dos Santos, Franck
  last_name: Pereira Dos Santos
- first_name: Achim
  full_name: Peters, Achim
  last_name: Peters
- first_name: Annie
  full_name: Pichery, Annie
  last_name: Pichery
- first_name: Igor
  full_name: Pikovski, Igor
  last_name: Pikovski
- first_name: Apostolos
  full_name: Pilaftsis, Apostolos
  last_name: Pilaftsis
- first_name: Florentina Crenguta
  full_name: Pislan, Florentina Crenguta
  last_name: Pislan
- first_name: Robert
  full_name: Plunkett, Robert
  last_name: Plunkett
- first_name: Rosa
  full_name: Poggiani, Rosa
  last_name: Poggiani
- first_name: Marco
  full_name: Prevedelli, Marco
  last_name: Prevedelli
- first_name: Johann
  full_name: Rafelski, Johann
  last_name: Rafelski
- first_name: Juhan
  full_name: Raidal, Juhan
  last_name: Raidal
- first_name: Martti
  full_name: Raidal, Martti
  last_name: Raidal
- first_name: Ernst Maria
  full_name: Rasel, Ernst Maria
  last_name: Rasel
- first_name: Sébastien
  full_name: Renaux-Petel, Sébastien
  last_name: Renaux-Petel
- first_name: Andrea
  full_name: Richaud, Andrea
  last_name: Richaud
- first_name: Pedro
  full_name: Rivero-Antunez, Pedro
  last_name: Rivero-Antunez
- first_name: Tangui
  full_name: Rodzinka, Tangui
  last_name: Rodzinka
- first_name: Albert
  full_name: Roura, Albert
  last_name: Roura
- first_name: Jan
  full_name: Rudolph, Jan
  last_name: Rudolph
- first_name: Dylan
  full_name: Sabulsky, Dylan
  last_name: Sabulsky
- first_name: Marianna S.
  full_name: Safronova, Marianna S.
  last_name: Safronova
- first_name: Mairi
  full_name: Sakellariadou, Mairi
  last_name: Sakellariadou
- first_name: Leonardo
  full_name: Salvi, Leonardo
  last_name: Salvi
- first_name: Muhammed
  full_name: Sameed, Muhammed
  last_name: Sameed
- first_name: Sumit
  full_name: Sarkar, Sumit
  last_name: Sarkar
- first_name: Patrik
  full_name: Schach, Patrik
  last_name: Schach
- first_name: Stefan Alaric
  full_name: Schäffer, Stefan Alaric
  last_name: Schäffer
- first_name: Jesse
  full_name: Schelfhout, Jesse
  last_name: Schelfhout
- first_name: Manuel
  full_name: Schilling, Manuel
  last_name: Schilling
- first_name: Vladimir
  full_name: Schkolnik, Vladimir
  last_name: Schkolnik
- first_name: Wolfgang P.
  full_name: Schleich, Wolfgang P.
  last_name: Schleich
- first_name: Dennis
  full_name: Schlippert, Dennis
  last_name: Schlippert
- first_name: Ulrich
  full_name: Schneider, Ulrich
  last_name: Schneider
- first_name: Florian
  full_name: Schreck, Florian
  last_name: Schreck
- first_name: Ariel
  full_name: Schwartzman, Ariel
  last_name: Schwartzman
- first_name: Nico
  full_name: Schwersenz, Nico
  last_name: Schwersenz
- first_name: Olga
  full_name: Sergijenko, Olga
  last_name: Sergijenko
- first_name: Haifa Rejeb
  full_name: Sfar, Haifa Rejeb
  last_name: Sfar
- first_name: Lijing
  full_name: Shao, Lijing
  last_name: Shao
- first_name: Ian
  full_name: Shipsey, Ian
  last_name: Shipsey
- first_name: Jing
  full_name: Shu, Jing
  last_name: Shu
- first_name: Yeshpal
  full_name: Singh, Yeshpal
  last_name: Singh
- first_name: Carlos F.
  full_name: Sopuerta, Carlos F.
  last_name: Sopuerta
- first_name: Marianna
  full_name: Sorba, Marianna
  last_name: Sorba
- first_name: Fiodor
  full_name: Sorrentino, Fiodor
  last_name: Sorrentino
- first_name: Alessandro D.A.M.
  full_name: Spallicci, Alessandro D.A.M.
  last_name: Spallicci
- first_name: Petruta
  full_name: Stefanescu, Petruta
  last_name: Stefanescu
- first_name: Nikolaos
  full_name: Stergioulas, Nikolaos
  last_name: Stergioulas
- first_name: Daniel
  full_name: Stoerk, Daniel
  last_name: Stoerk
- first_name: Hrudya
  full_name: Thaivalappil Sunilkumar, Hrudya
  last_name: Thaivalappil Sunilkumar
- first_name: Jannik
  full_name: Ströhle, Jannik
  last_name: Ströhle
- first_name: Zoie
  full_name: Tam, Zoie
  last_name: Tam
- first_name: Dhruv
  full_name: Tandon, Dhruv
  last_name: Tandon
- first_name: Yijun
  full_name: Tang, Yijun
  last_name: Tang
- first_name: Dorothee
  full_name: Tell, Dorothee
  last_name: Tell
- first_name: Jacques
  full_name: Tempere, Jacques
  last_name: Tempere
- first_name: Dylan J.
  full_name: Temples, Dylan J.
  last_name: Temples
- first_name: Rohit P.
  full_name: Thampy, Rohit P.
  last_name: Thampy
- first_name: Ingmari C.
  full_name: Tietje, Ingmari C.
  last_name: Tietje
- first_name: Guglielmo M.
  full_name: Tino, Guglielmo M.
  last_name: Tino
- first_name: Jonathan N.
  full_name: Tinsley, Jonathan N.
  last_name: Tinsley
- first_name: Ovidiu
  full_name: Tintareanu Mircea, Ovidiu
  last_name: Tintareanu Mircea
- first_name: Kimberly
  full_name: Tkalčec, Kimberly
  last_name: Tkalčec
- first_name: Andrew J.
  full_name: Tolley, Andrew J.
  last_name: Tolley
- first_name: Vincenza
  full_name: Tornatore, Vincenza
  last_name: Tornatore
- first_name: Alejandro
  full_name: Torres-Orjuela, Alejandro
  last_name: Torres-Orjuela
- first_name: Philipp
  full_name: Treutlein, Philipp
  last_name: Treutlein
- first_name: Andrea
  full_name: Trombettoni, Andrea
  last_name: Trombettoni
- first_name: Christian
  full_name: Ufrecht, Christian
  last_name: Ufrecht
- first_name: Juan
  full_name: Urrutia, Juan
  last_name: Urrutia
- first_name: Tristan
  full_name: Valenzuela, Tristan
  last_name: Valenzuela
- first_name: Linda R.
  full_name: Valerio, Linda R.
  last_name: Valerio
- first_name: Maurits
  full_name: Van Der Grinten, Maurits
  last_name: Van Der Grinten
- first_name: Ville
  full_name: Vaskonen, Ville
  last_name: Vaskonen
- first_name: Verónica
  full_name: Vázquez-Aceves, Verónica
  last_name: Vázquez-Aceves
- first_name: Hardi
  full_name: Veermäe, Hardi
  last_name: Veermäe
- first_name: Flavio
  full_name: Vetrano, Flavio
  last_name: Vetrano
- first_name: Nikolay V.
  full_name: Vitanov, Nikolay V.
  last_name: Vitanov
- first_name: Wolf
  full_name: Von Klitzing, Wolf
  last_name: Von Klitzing
- first_name: Sebastian
  full_name: Wald, Sebastian
  id: 133F200A-B015-11E9-AD41-0EDAE5697425
  last_name: Wald
  orcid: 0000-0002-5869-1604
- first_name: Thomas
  full_name: Walker, Thomas
  last_name: Walker
- first_name: Reinhold
  full_name: Walser, Reinhold
  last_name: Walser
- first_name: Jin
  full_name: Wang, Jin
  last_name: Wang
- first_name: Yan
  full_name: Wang, Yan
  last_name: Wang
- first_name: C. A.
  full_name: Weidner, C. A.
  last_name: Weidner
- first_name: André
  full_name: Wenzlawski, André
  last_name: Wenzlawski
- first_name: Michael
  full_name: Werner, Michael
  last_name: Werner
- first_name: Lisa
  full_name: Wörner, Lisa
  last_name: Wörner
- first_name: Mohamed E.
  full_name: Yahia, Mohamed E.
  last_name: Yahia
- first_name: Efe
  full_name: Yazgan, Efe
  last_name: Yazgan
- first_name: Emmanuel
  full_name: Zambrini Cruzeiro, Emmanuel
  last_name: Zambrini Cruzeiro
- first_name: M.
  full_name: Zarei, M.
  last_name: Zarei
- first_name: Mingsheng
  full_name: Zhan, Mingsheng
  last_name: Zhan
- first_name: Shengnan
  full_name: Zhang, Shengnan
  last_name: Zhang
- first_name: Lin
  full_name: Zhou, Lin
  last_name: Zhou
- first_name: Erik
  full_name: Zupanič, Erik
  last_name: Zupanič
citation:
  ama: 'Abdalla A, Abe M, Abend S, et al. Terrestrial Very-Long-Baseline Atom Interferometry:
    Summary of the second workshop. <i>EPJ Quantum Technology</i>. 2025;12. doi:<a
    href="https://doi.org/10.1140/epjqt/s40507-025-00344-3">10.1140/epjqt/s40507-025-00344-3</a>'
  apa: 'Abdalla, A., Abe, M., Abend, S., Abidi, M., Aidelsburger, M., Alibabaei, A.,
    … Zupanič, E. (2025). Terrestrial Very-Long-Baseline Atom Interferometry: Summary
    of the second workshop. <i>EPJ Quantum Technology</i>. Springer Nature. <a href="https://doi.org/10.1140/epjqt/s40507-025-00344-3">https://doi.org/10.1140/epjqt/s40507-025-00344-3</a>'
  chicago: 'Abdalla, Adam, Mahiro Abe, Sven Abend, Mouine Abidi, Monika Aidelsburger,
    Ashkan Alibabaei, Baptiste Allard, et al. “Terrestrial Very-Long-Baseline Atom
    Interferometry: Summary of the Second Workshop.” <i>EPJ Quantum Technology</i>.
    Springer Nature, 2025. <a href="https://doi.org/10.1140/epjqt/s40507-025-00344-3">https://doi.org/10.1140/epjqt/s40507-025-00344-3</a>.'
  ieee: 'A. Abdalla <i>et al.</i>, “Terrestrial Very-Long-Baseline Atom Interferometry:
    Summary of the second workshop,” <i>EPJ Quantum Technology</i>, vol. 12. Springer
    Nature, 2025.'
  ista: 'Abdalla A et al. 2025. Terrestrial Very-Long-Baseline Atom Interferometry:
    Summary of the second workshop. EPJ Quantum Technology. 12, 42.'
  mla: 'Abdalla, Adam, et al. “Terrestrial Very-Long-Baseline Atom Interferometry:
    Summary of the Second Workshop.” <i>EPJ Quantum Technology</i>, vol. 12, 42, Springer
    Nature, 2025, doi:<a href="https://doi.org/10.1140/epjqt/s40507-025-00344-3">10.1140/epjqt/s40507-025-00344-3</a>.'
  short: A. Abdalla, M. Abe, S. Abend, M. Abidi, M. Aidelsburger, A. Alibabaei, B.
    Allard, J. Antoniadis, G. Arduini, N. Augst, P. Balamatsias, A. Balaž, H. Banks,
    R.L. Barcklay, M. Barone, M. Barsanti, M.G. Bason, A. Bassi, J.B. Bayle, C.F.A.
    Baynham, Q. Beaufils, S. Beldjoudi, A. Belić, S. Bennetts, J. Bernabeu, A. Bertoldi,
    C. Bigard, N.P. Bigelow, R. Bingham, D. Blas, A. Bobrick, S. Boehringer, A. Bogojević,
    K. Bongs, D. Bortoletto, P. Bouyer, C. Brand, O. Buchmueller, G. Buica, S. Calatroni,
    L. Calmels, P. Canizares, B. Canuel, A. Caramete, L.I. Caramete, M. Carlesso,
    J. Carlton, S.P. Carman, A. Carroll, M. Casariego, M. Chairetis, V. Charmandaris,
    U. Chauhan, J. Chen, M.L.M.L.M. Chiofalo, D. Ciampini, A. Cimbri, P. Cladé, J.
    Coleman, F.L. Constantin, C.R. Contaldi, R. Corgier, B. Dash, G.J. Davies, C.
    De Rham, A. De Roeck, D. Derr, S. Dey, F. Di Pumpo, G.S. Djordjevic, B. Döbrich,
    P. Dornan, M. Doser, G. Drougakis, J. Dunningham, A. Duspayev, S. Easo, J. Eby,
    M. Efremov, G. Elertas, J. Ellis, N. Entin, S. Fairhurst, M. Fanì, F. Fassi, P.
    Fayet, D. Felea, J. Feng, R. Flack, C. Foot, T. Freegarde, E. Fuchs, N. Gaaloul,
    D. Gao, S. Gardner, B.M. Garraway, C.L. Garrido Alzar, A. Gauguet, E. Giese, P.
    Gill, G.F. Giudice, E.P. Glasbrenner, J. Glick, P.W. Graham, E. Granados, P.F.
    Griffin, J. Gué, S. Guellati-Khelifa, S. Gupta, V. Gupta, L. Hackermueller, M.
    Haehnelt, T. Hakulinen, K. Hammerer, E.T. Hanımeli, T. Harte, S. Hartmann, L.
    Hawkins, A. Hees, A. Herbst, T.M. Hird, R. Hobson, J. Hogan, B. Holst, M. Holynski,
    O. Hosten, C.C. Hsu, W.C.W. Huang, K.M. Hughes, K. Hussain, G. Hütsi, A. Iovino,
    M.C. Isfan, G. Janson, P. Jeglič, P. Jetzer, Y. Jiang, G. Juzeliūnas, W. Kaenders,
    M. Kalliokoski, A. Kehagias, E. Kilian, C. Klempt, P. Knight, S. Koley, B. Konrad,
    T. Kovachy, M. Krutzik, M. Kumar, P. Kumar, H. Labiad, S.Y. Lan, A. Landragin,
    G. Landsberg, M. Langlois, B. Lanigan, B. Leone, C. Le Poncin-Lafitte, S. Lellouch,
    M. Lewicki, Y.H. Lien, L. Lombriser, E.L. Asamar, J.L. Lopez-Gonzalez, C. Lu,
    G.G. Luciano, N. Lundblad, C. De J. López Monjaraz, A. Lowe, M. Mackoit-Sinkevičienė,
    M. Maggiore, A. Majumdar, K. Makris, A. Maleknejad, A.L. Marchant, A. Mariotti,
    C. Markou, B. Matthews, A. Mazumdar, C. Mccabe, M. Meister, G. Mentasti, J. Menu,
    G. Messineo, B. Meyer-Hoppe, S. Micalizio, F. Migliaccio, P. Millington, M. Milosevic,
    A. Mishra, J. Mitchell, G.W. Morley, N. Mouelle, J. Müller, D. Newbold, W.T. Ni,
    C. Niehof, J. Noller, S. Odžak, D.K.L. Oi, A. Oikonomou, Y. Omar, C. Overstreet,
    V. Puthiya Veettil, J. Pahl, S. Paling, Z. Pan, G. Pappas, V. Pareek, E. Pasatembou,
    M. Paternostro, V.K. Pathak, E. Pelucchi, F. Pereira Dos Santos, A. Peters, A.
    Pichery, I. Pikovski, A. Pilaftsis, F.C. Pislan, R. Plunkett, R. Poggiani, M.
    Prevedelli, J. Rafelski, J. Raidal, M. Raidal, E.M. Rasel, S. Renaux-Petel, A.
    Richaud, P. Rivero-Antunez, T. Rodzinka, A. Roura, J. Rudolph, D. Sabulsky, M.S.
    Safronova, M. Sakellariadou, L. Salvi, M. Sameed, S. Sarkar, P. Schach, S.A. Schäffer,
    J. Schelfhout, M. Schilling, V. Schkolnik, W.P. Schleich, D. Schlippert, U. Schneider,
    F. Schreck, A. Schwartzman, N. Schwersenz, O. Sergijenko, H.R. Sfar, L. Shao,
    I. Shipsey, J. Shu, Y. Singh, C.F. Sopuerta, M. Sorba, F. Sorrentino, A.D.A.M.
    Spallicci, P. Stefanescu, N. Stergioulas, D. Stoerk, H. Thaivalappil Sunilkumar,
    J. Ströhle, Z. Tam, D. Tandon, Y. Tang, D. Tell, J. Tempere, D.J. Temples, R.P.
    Thampy, I.C. Tietje, G.M. Tino, J.N. Tinsley, O. Tintareanu Mircea, K. Tkalčec,
    A.J. Tolley, V. Tornatore, A. Torres-Orjuela, P. Treutlein, A. Trombettoni, C.
    Ufrecht, J. Urrutia, T. Valenzuela, L.R. Valerio, M. Van Der Grinten, V. Vaskonen,
    V. Vázquez-Aceves, H. Veermäe, F. Vetrano, N.V. Vitanov, W. Von Klitzing, S. Wald,
    T. Walker, R. Walser, J. Wang, Y. Wang, C.A. Weidner, A. Wenzlawski, M. Werner,
    L. Wörner, M.E. Yahia, E. Yazgan, E. Zambrini Cruzeiro, M. Zarei, M. Zhan, S.
    Zhang, L. Zhou, E. Zupanič, EPJ Quantum Technology 12 (2025).
das_tickbox: '1'
dataavailabilitystatement: No datasets were generated or analysed during the current
  study.
date_created: 2025-05-04T22:02:30Z
date_published: 2025-04-03T00:00:00Z
date_updated: 2026-07-08T09:29:52Z
day: '03'
ddc:
- '530'
department:
- _id: OnHo
doi: 10.1140/epjqt/s40507-025-00344-3
external_id:
  arxiv:
  - '2412.14960'
  isi:
  - '001489653300001'
file:
- access_level: open_access
  checksum: 00c7a97d87f7a6314df5b0c2213fbb02
  content_type: application/pdf
  creator: dernst
  date_created: 2025-05-05T10:52:52Z
  date_updated: 2025-05-05T10:52:52Z
  file_id: '19653'
  file_name: 2025_EPJQuantumTech_Abdalla.pdf
  file_size: 14352192
  relation: main_file
  success: 1
file_date_updated: 2025-05-05T10:52:52Z
fulldoi: https://doi.org/10.1140/epjqt/s40507-025-00344-3
has_accepted_license: '1'
intvolume: '        12'
isi: 1
language:
- iso: eng
license: https://creativecommons.org/licenses/by-nc-nd/4.0/
month: '04'
oa: 1
oa_version: Published Version
publication: EPJ Quantum Technology
publication_identifier:
  eissn:
  - 2196-0763
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
researchdata_availability: no
scopus_import: '1'
status: public
supplementarymaterial: no
title: 'Terrestrial Very-Long-Baseline Atom Interferometry: Summary of the second
  workshop'
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: 68b8ca59-c5b3-11ee-8790-cd641c68093d
volume: 12
year: '2025'
...
---
OA_place: repository
OA_type: green
_id: '22157'
abstract:
- lang: eng
  text: "A graph \U0001D43A is said to be Ramsey for a tuple of graphs(\U0001D43B
    1 , … , \U0001D43B\U0001D45F ) if every \U0001D45F-coloring of the edges of \U0001D43A
    con-tains a monochromatic copy of \U0001D43B\U0001D456 in color \U0001D456, for
    some \U0001D456.A fundamental question at the intersection of Ramseytheory and
    the theory of random graphs is to deter-mine the threshold at which the binomial
    randomgraph \U0001D43A\U0001D45B,\U0001D45D becomes asymptotically almost surely
    Ram-sey for a fixed tuple (\U0001D43B 1 , … , \U0001D43B\U0001D45F ), and a famous
    conjectureof Kohayakawa and Kreuter predicts this threshold.Earlier work of Mousset–Nenadov–Samotij,
    Bowtell–Hancock–Hyde, and Kuperwasser–Samotij–Wigdersonhas reduced this probabilistic
    problem to a determinis-tic graph decomposition conjecture. In this paper, weresolve
    this deterministic problem, thus proving theKohayakawa–Kreuter conjecture. Along
    the way, weprove a number of novel graph decomposition resultsthat may be of independent
    interest."
article_number: e70013
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Micha
  full_name: Christoph, Micha
  last_name: Christoph
- first_name: Anders
  full_name: Martinsson, Anders
  last_name: Martinsson
- first_name: Raphael
  full_name: Steiner, Raphael
  last_name: Steiner
- first_name: Yuval
  full_name: Wigderson, Yuval
  id: 2d0023a0-1567-11f0-833d-d5c1e476d4b5
  last_name: Wigderson
citation:
  ama: Christoph M, Martinsson A, Steiner R, Wigderson Y. Resolution of the Kohayakawa–Kreuter
    conjecture. <i>Proceedings of the London Mathematical Society</i>. 2025;130(1).
    doi:<a href="https://doi.org/10.1112/plms.70013">10.1112/plms.70013</a>
  apa: Christoph, M., Martinsson, A., Steiner, R., &#38; Wigderson, Y. (2025). Resolution
    of the Kohayakawa–Kreuter conjecture. <i>Proceedings of the London Mathematical
    Society</i>. Wiley. <a href="https://doi.org/10.1112/plms.70013">https://doi.org/10.1112/plms.70013</a>
  chicago: Christoph, Micha, Anders Martinsson, Raphael Steiner, and Yuval Wigderson.
    “Resolution of the Kohayakawa–Kreuter Conjecture.” <i>Proceedings of the London
    Mathematical Society</i>. Wiley, 2025. <a href="https://doi.org/10.1112/plms.70013">https://doi.org/10.1112/plms.70013</a>.
  ieee: M. Christoph, A. Martinsson, R. Steiner, and Y. Wigderson, “Resolution of
    the Kohayakawa–Kreuter conjecture,” <i>Proceedings of the London Mathematical
    Society</i>, vol. 130, no. 1. Wiley, 2025.
  ista: Christoph M, Martinsson A, Steiner R, Wigderson Y. 2025. Resolution of the
    Kohayakawa–Kreuter conjecture. Proceedings of the London Mathematical Society.
    130(1), e70013.
  mla: Christoph, Micha, et al. “Resolution of the Kohayakawa–Kreuter Conjecture.”
    <i>Proceedings of the London Mathematical Society</i>, vol. 130, no. 1, e70013,
    Wiley, 2025, doi:<a href="https://doi.org/10.1112/plms.70013">10.1112/plms.70013</a>.
  short: M. Christoph, A. Martinsson, R. Steiner, Y. Wigderson, Proceedings of the
    London Mathematical Society 130 (2025).
date_created: 2026-06-29T10:50:35Z
date_published: 2025-01-01T00:00:00Z
date_updated: 2026-07-08T10:24:21Z
day: '01'
ddc:
- '500'
doi: 10.1112/plms.70013
extern: '1'
external_id:
  arxiv:
  - '2402.03045'
fulldoi: https://doi.org/10.1112/plms.70013
intvolume: '       130'
issue: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://doi.org/10.48550/arXiv.2402.03045
mathsc:
- 05C70
- 05D10
- 05C80
month: '01'
oa: 1
oa_version: Preprint
publication: Proceedings of the London Mathematical Society
publication_identifier:
  eissn:
  - 1460-244X
  issn:
  - 0024-6115
publication_status: published
publisher: Wiley
quality_controlled: '1'
scopus_import: '1'
status: public
title: Resolution of the Kohayakawa–Kreuter conjecture
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: 130
year: '2025'
...
---
OA_place: repository
OA_type: green
_id: '22158'
abstract:
- lang: eng
  text: "The triangle removal states that if G contains  edge-disjoint triangles,
    then G contains  triangles. Unfortunately, there are no sensible bounds on the
    order of growth of , and at any rate, it is known that  is not polynomial in .
    Csaba recently obtained an asymmetric variant of the triangle removal, stating
    that if G contains  edge-disjoint triangles, then G contains  copies of . To this
    end, he devised a new variant of Szemerédi’s regularity lemma. We obtain the following
    results:\r\n\r\n• We first give a regularity-free proof of Csaba’s theorem, which
    improves the number of copies of  to the optimal number .\r\n\r\n• We say that
    H is -abundant if every graph containing  edge-disjoint triangles has  copies
    of H. It is easy to see that a -abundant graph must be triangle-free and tripartite.
    Given our first result, it is natural to ask if all triangle-free tripartite graphs
    are -abundant. Our second result is that assuming a well-known conjecture of Ruzsa
    in additive number theory, the answer to this question is negative.\r\n\r\nOur
    proofs use a mix of combinatorial, number-theoretic, probabilistic and Ramsey-type
    arguments."
article_number: e38
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Lior
  full_name: Gishboliner, Lior
  last_name: Gishboliner
- first_name: Asaf
  full_name: Shapira, Asaf
  last_name: Shapira
- first_name: Yuval
  full_name: Wigderson, Yuval
  id: 2d0023a0-1567-11f0-833d-d5c1e476d4b5
  last_name: Wigderson
citation:
  ama: Gishboliner L, Shapira A, Wigderson Y. An efficient asymmetric removal lemma
    and its limitations. <i>Forum of Mathematics, Sigma</i>. 2025;13. doi:<a href="https://doi.org/10.1017/fms.2024.68">10.1017/fms.2024.68</a>
  apa: Gishboliner, L., Shapira, A., &#38; Wigderson, Y. (2025). An efficient asymmetric
    removal lemma and its limitations. <i>Forum of Mathematics, Sigma</i>. Cambridge
    University Press. <a href="https://doi.org/10.1017/fms.2024.68">https://doi.org/10.1017/fms.2024.68</a>
  chicago: Gishboliner, Lior, Asaf Shapira, and Yuval Wigderson. “An Efficient Asymmetric
    Removal Lemma and Its Limitations.” <i>Forum of Mathematics, Sigma</i>. Cambridge
    University Press, 2025. <a href="https://doi.org/10.1017/fms.2024.68">https://doi.org/10.1017/fms.2024.68</a>.
  ieee: L. Gishboliner, A. Shapira, and Y. Wigderson, “An efficient asymmetric removal
    lemma and its limitations,” <i>Forum of Mathematics, Sigma</i>, vol. 13. Cambridge
    University Press, 2025.
  ista: Gishboliner L, Shapira A, Wigderson Y. 2025. An efficient asymmetric removal
    lemma and its limitations. Forum of Mathematics, Sigma. 13, e38.
  mla: Gishboliner, Lior, et al. “An Efficient Asymmetric Removal Lemma and Its Limitations.”
    <i>Forum of Mathematics, Sigma</i>, vol. 13, e38, Cambridge University Press,
    2025, doi:<a href="https://doi.org/10.1017/fms.2024.68">10.1017/fms.2024.68</a>.
  short: L. Gishboliner, A. Shapira, Y. Wigderson, Forum of Mathematics, Sigma 13
    (2025).
date_created: 2026-06-29T10:51:07Z
date_published: 2025-02-10T00:00:00Z
date_updated: 2026-07-08T10:31:22Z
day: '10'
doi: 10.1017/fms.2024.68
extern: '1'
external_id:
  arxiv:
  - '2301.07693'
fulldoi: https://doi.org/10.1017/fms.2024.68
intvolume: '        13'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://doi.org/10.48550/arXiv.2301.07693
mathsc:
- 05C35
- 11B75
month: '02'
oa: 1
oa_version: Preprint
publication: Forum of Mathematics, Sigma
publication_identifier:
  issn:
  - 2050-5094
publication_status: published
publisher: Cambridge University Press
quality_controlled: '1'
scopus_import: '1'
status: public
title: An efficient asymmetric removal lemma and its limitations
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 13
year: '2025'
...
