---
DOAJ_listed: '1'
OA_place: publisher
OA_type: gold
PlanS_conform: '1'
_id: '22303'
abstract:
- lang: eng
  text: "We present the discovery of AT 2024wpp (‘Whippet’), a fast and luminous 18cow-like
    transient. At a redshift of z = 0 . 0868 , revealed by Keck Cosmic Web Imager
    spectroscopy of its faint star-forming host, it is the fourth-nearest example
    of its class to date. Rapid identification of the source in the Zwicky Transient
    Facility data stream permitted ultraviolet-through- optical observations to be
    obtained prior to peak, allowing the first determination of the peak bolometric
    luminosity ( 2 ×1045 erg s−1 ), maximum photospheric radius ( 1015 cm), and total
    radiated energy ( 1051 erg) of an 18cow-like object. We present results from a
    comprehensive multiwavelength observing campaign, including a far-ultraviolet
    spectrum from the Cosmic Origins Spectrograph on the Hubble Space Telescope and
    deep imaging extending > 100 d post-explosion from the Very Large Telescope, Hubble
    Space Telescope , Very Large Array, and Atacama Large Millimetre Array. We interpret
    the observations under a model in which a rapidly accreting central engine blows
    a fast ( ∼0.2 c ) wind into the surrounding medium and irradiates it with X-rays.
    The high Doppler velocities and intense ionization within this wind prevent identifiable
    spectroscopic features from appearing in the ejecta or in the surrounding circumstellar
    material. Weak H and He signatures do emerge in the spectra after 35 d in the
    form of double-peaked narrow lines. Each peak is individually narrow (full width
    δv ∼3000 km s−1 ) but the two components are separated by \x03v ∼6600 km s−1 ,
    indicating stable structures of denser material, possibly representing streams
    of tidal ejecta or an ablated companion star."
acknowledgement: "We thank Eliot Quataert, Luc Dessart, Ben Margalit, Ross Ferguson,
  Aaron Tohuvavohu, Brad Cenko, and Jamie Kennea for useful discussions. We thank
  the referee for helpful suggestions that improved the manuscript.\r\n\r\nBased on
  observations obtained with the Samuel Oschin Telescope 48-in. and the 60-in. Telescope
  at the Palomar Observatory as part of the Zwicky Transient Facility project. ZTF
  is supported by the National Science Foundation under grant no. AST-2034437 and
  a collaboration including Caltech, IPAC, the Oskar Klein Center at Stockholm University,
  the University of Maryland, University of California, Berkeley, the University of
  Wisconsin at Milwaukee, University of Warwick, Ruhr University Bochum, Cornell University,
  Northwestern University and Drexel University. Operations are conducted by COO,
  IPAC, and UW.\r\n\r\nThe Liverpool Telescope is operated on the island of La Palma
  by Liverpool John Moores University in the Spanish Observatorio del Roque de los
  Muchachos of the Instituto de Astrofisica de Canarias with financial support from
  the UK Science and Technology Facilities Council.\r\n\r\nBased on observations made
  with the Nordic Optical Telescope, owned in collaboration by the University of Turku
  and Aarhus University, and operated jointly by Aarhus University, the University
  of Turku and the University of Oslo, representing Denmark, Finland and Norway, the
  University of Iceland and Stockholm University at the Observatorio del Roque de
  los Muchachos, La Palma, Spain, of the Instituto de Astrofisica de Canarias. The
  NOT data were obtained under program ID 68–501.\r\n\r\nThis work made use of data
  supplied by the UK Swift Science Data Centre at the University of Leicester. We
  are grateful to Phil Evans, Aaron Tohuvavohu, and Jamie Kennea for advice on the
  Swift/XRT data reduction.\r\n\r\nSome of the data presented herein were obtained
  at the W. M. Keck Observatory, which is operated as a scientific partnership among
  the California Institute of Technology, the University of California, and NASA.
  The Observatory was made possible by the generous financial support of the W. M.
  Keck Foundation. The authors wish to recognize and acknowledge the very significant
  cultural role and reverence that the summit of Maunakea has always had within the
  indigenous Hawaiian community. We are most fortunate to have the opportunity to
  conduct observations from this mountain.\r\n\r\nSome observations reported here
  were obtained at the MMT Observatory, a joint facility of the University of Arizona
  and the Smithsonian Institution.\r\n\r\nThe National Radio Astronomy Observatory
  and Green Bank Observatory are facilities of the U.S. National Science Foundation
  operated under cooperative agreement by Associated Universities, Inc. This paper
  makes use of the following ALMA data: ADS/JAO.ALMA no. 2023.1.01730.T ALMA is a
  partnership of ESO (representing its member states), NSF (USA) and NINS (Japan),
  together with NRC (Canada), NSTC and ASIAA (Taiwan), and KASI (Republic of Korea),
  in cooperation with the Republic of Chile. The Joint ALMA Observatory is operated
  by ESO, AUI/NRAO, and NAOJ.\r\n\r\nBased on observations collected at the European
  Organisation for Astronomical Research in the Southern Hemisphere under ESO programme
  2114.D-5014(E). We thank John Pritchard and Paula Sanchez Saez, and the entire observatory
  staff, for their excellent support.\r\n\r\nBased on observations collected at the
  European Organisation for Astronomical Research in the Southern Hemisphere, Chile,
  as part of ePESSTO+ (the advanced Public ESO Spectroscopic Survey for Transient
  Objects Survey – PI: Inserra). ePESSTO+ observations were obtained under ESO program
  ID 112.25JQ.\r\n\r\nThis research is based on observations made with the NASA/ESA
  Hubble Space Telescope obtained from the Space Telescope Science Institute, which
  is operated by the Association of Universities for Research in Astronomy, Inc.,
  under NASA contract NAS 5–26555. These observations are associated with programs
  16714, 17477, and 17889.\r\n\r\nBased on observations obtained at the Southern Astrophysical
  Research (SOAR) telescope, which is a joint project of the Ministério da Ciência,
  Tecnologia e Inovações (MCTI/LNA) do Brasil, the US National Science Foundation’s
  NOIRLab, the University of North Carolina at Chapel Hill (UNC), and Michigan State
  University (MSU).\r\n\r\nThe Pan-STARRS1 Surveys (PS1) and the PS1 public science
  archive have been made possible through contributions by the Institute for Astronomy,
  the University of Hawaii, the Pan-STARRS Project Office, the Max-Planck Society
  and its participating institutes, the Max Planck Institute for Astronomy, Heidelberg
  and the Max Planck Institute for Extraterrestrial Physics, Garching, The Johns Hopkins
  University, Durham University, the University of Edinburgh, the Queen’s University
  Belfast, the Harvard-Smithsonian Center for Astrophysics, the Las Cumbres Observatory
  Global Telescope Network Incorporated, the National Central University of Taiwan,
  the Space Telescope Science Institute, the National Aeronautics and Space Administration
  under grant no. NNX08AR22G issued through the Planetary Science Division of the
  NASA Science Mission Directorate, the National Science Foundation grant no. AST–1238877,
  the University of Maryland, Eotvos Lorand University (ELTE), the Los Alamos National
  Laboratory, and the Gordon and Betty Moore Foundation.\r\n\r\nThis research made
  use of ccdproc, an astropy package for image reduction (M. Craig et al. 2025).\r\n\r\nGS
  and AYQH acknowledge support in part from a Sloan Research Fellowship (award no.
  FG-2024-21320) from the Alfred P. Sloan Foundation. CS and AYQH acknowledge support
  in part from National Aeronautics and Space Administration (NASA) grant 80NSSC24K0377,
  from HST grant HST-GO-17477.006-A, and from a Scialog award from the Research Corporation
  for Science Advancement (‘Early Science with the LSST’).\r\n\r\nPC acknowledges
  support from the Zhejiang Provincial Top-Level Research Support Program.\r\n\r\nIA
  and JC are supported by the National Science Foundation award AST 2505775, NASA
  grant 24-ADAP24-0159, Scialog award SA-LSST-2024-102a, and the Discovery Alliance
  Catalyst Fellowship Mentors award 2025-62192-CM-19\r\n\r\nAA acknowledges support
  from the Ministry of Education Yushan Fellow Program (MOE-111-YSFMS-0008-001-P1)
  and from the National Science and Technology Council, Taiwan (NSTC 114-2112-M-008-021-MY3).\r\n\r\nT-WC
  acknowledges support from the Ministry of Education Yushan Fellow Program (MOE-111-YSFMS-0008-001-P1)
  and from the National Science and Technology Council, Taiwan (NSTC 114-2112-M-008-021-MY3).\r\n\r\nERC
  acknowledges support from the National Aeronautics and Space Administration through
  the Astrophysics Theory Program, grant 80NSSC24K0897.\r\n\r\nGD acknowledges support
  from the European Union’s Horizon Europe research and innovation programme under
  the Marie Skłodowska-Curie grant agreement no. 101199369.\r\n\r\nDF’s contribution
  to this material is based upon work supported by the National Science Foundation
  under award no. AST-2401779.\r\n\r\nAGY’s research is supported by ISF, IMOS, and
  BSF grants, as well as the André Deloro Institute for Space and Optics Research,
  the Center for Experimental Physics, a WIS-MIT Sagol grant, the Norman E Alexander
  Family M Foundation ULTRASAT Data Center Fund, and Yeda-Sela; AGY is the incumbent
  of the The Arlyn Imberman Professorial Chair.\r\n\r\nLG acknowledges financial support
  from AGAUR, CSIC, MCIN, and AEI 10.13039/501100011033 under projects PID2023-151307NB-I00,
  PIE 20215AT016, and CEX2020-001058-M.\r\n\r\nMG acknowledges support from an STFC
  PhD studentship and from the Faculty of Science and Technology at Lancaster University.\r\n\r\nCPG
  acknowledges financial support from the Secretary of Universities and Research (Government
  of Catalonia) and by the Horizon 2020 Research and Innovation Programme of the European
  Union under the Marie Skłodowska-Curie and the Beatriu de Pinós 2021 BP 00168 programme,
  from the Spanish Ministerio de Ciencia e Innovación (MCIN) and the Agencia Estatal
  de Investigación (AEI) 10.13039/501100011033 under the PID2023-151307NB-I00 SNNEXT
  project, from Centro Superior de Investigaciones Científicas (CSIC) under the PIE
  project 20215AT016 and the program Unidad de Excelencia María de Maeztu CEX2020-001058-M,
  and from the Departament de Recerca i Universitats de la Generalitat de Catalunya
  through the 2021-SGR-01270 grant.\r\n\r\nCL is supported by DoE award no.  DE-SC0025599.\r\n\r\nZwicky
  Transient Facility, W. M. Keck Observatory, and MMT Observatory access was supported
  by Northwestern University and the Center for Interdisciplinary Exploration and
  Research in Astrophysics (CIERA).\r\n\r\nAM gratefully acknowledges support from
  an STFC PhD studentship and the Faculty of Science and Technology at Lancaster University.\r\n\r\nTEMB
  is funded by Horizon Europe ERC grant no. 101125877.\r\n\r\nMN is supported by the
  European Research Council (ERC) under the European Union’s Horizon 2020 research
  and innovation programme (grant agreement no. 948381).\r\n\r\nNR is supported by
  a Northwestern University Presidential Fellowship Award. We gratefully acknowledge
  the support of the NSF-Simons AI-Institute for the Sky (SkAI) via grants NSF AST-2421845
  and Simons Foundation MPS-AI-00010513.\r\n\r\nAS acknowledges the Warwick Astrophysics
  PhD prize scholarship made possible thanks to a generous philanthropic donation.\r\n\r\nSJS
  acknowledges funding from STFC grant ST/Y001605/1, a Royal Society Research Professorship
  and the Hintze Family Charitable Foundation."
article_number: stag678
article_processing_charge: Yes
article_type: original
arxiv: 1
author:
- first_name: Daniel A
  full_name: Perley, Daniel A
  last_name: Perley
- first_name: Anna Y Q
  full_name: Ho, Anna Y Q
  last_name: Ho
- first_name: Zoë
  full_name: McGrath, Zoë
  last_name: McGrath
- first_name: Michael
  full_name: Camilo, Michael
  last_name: Camilo
- first_name: Cassie
  full_name: Sevilla, Cassie
  last_name: Sevilla
- first_name: Ping
  full_name: Chen, Ping
  last_name: Chen
- first_name: Genevieve
  full_name: Schroeder, Genevieve
  last_name: Schroeder
- first_name: Taya
  full_name: Govreen-Segal, Taya
  last_name: Govreen-Segal
- first_name: Aleksandra
  full_name: Bochenek, Aleksandra
  last_name: Bochenek
- first_name: Yu-Jing
  full_name: Qin, Yu-Jing
  last_name: Qin
- first_name: James H
  full_name: Gillanders, James H
  last_name: Gillanders
- first_name: Benjamin
  full_name: Amend, Benjamin
  last_name: Amend
- first_name: Joseph P
  full_name: Anderson, Joseph P
  last_name: Anderson
- first_name: Igor
  full_name: Andreoni, Igor
  last_name: Andreoni
- first_name: Amar
  full_name: Aryan, Amar
  last_name: Aryan
- first_name: Eric C
  full_name: Bellm, Eric C
  last_name: Bellm
- first_name: Joshua S
  full_name: Bloom, Joshua S
  last_name: Bloom
- first_name: Thomas
  full_name: de Boer, Thomas
  last_name: de Boer
- first_name: Jonathan
  full_name: Carney, Jonathan
  last_name: Carney
- first_name: Ilaria
  full_name: Caiazzo, Ilaria
  id: 8ae5b6e7-2a03-11ee-914d-b58ed7a3b47d
  last_name: Caiazzo
  orcid: 0000-0002-4770-5388
- first_name: Ken C
  full_name: Chambers, Ken C
  last_name: Chambers
- first_name: Panos
  full_name: Charalampopoulos, Panos
  last_name: Charalampopoulos
- first_name: Ting-Wan
  full_name: Chen, Ting-Wan
  last_name: Chen
- first_name: Tracy X
  full_name: Chen, Tracy X
  last_name: Chen
- first_name: Eric R
  full_name: Coughlin, Eric R
  last_name: Coughlin
- first_name: Michael
  full_name: Coughlin, Michael
  last_name: Coughlin
- first_name: Michel
  full_name: Dennefeld, Michel
  last_name: Dennefeld
- first_name: Georgios
  full_name: Dimitriadis, Georgios
  last_name: Dimitriadis
- first_name: Christoffer
  full_name: Fremling, Christoffer
  last_name: Fremling
- first_name: Danielle
  full_name: Frostig, Danielle
  last_name: Frostig
- first_name: Avishay
  full_name: Gal-Yam, Avishay
  last_name: Gal-Yam
- first_name: Lluís
  full_name: Galbany, Lluís
  last_name: Galbany
- first_name: Anjashay
  full_name: Gangopadhyay, Anjashay
  last_name: Gangopadhyay
- first_name: Melzie
  full_name: Ghendrih, Melzie
  last_name: Ghendrih
- first_name: Matthew J
  full_name: Graham, Matthew J
  last_name: Graham
- first_name: Mariusz
  full_name: Gromadzki, Mariusz
  last_name: Gromadzki
- first_name: Steven L
  full_name: Groom, Steven L
  last_name: Groom
- first_name: Claudia P
  full_name: Gutiérrez, Claudia P
  last_name: Gutiérrez
- first_name: K -Ryan
  full_name: Hinds, K -Ryan
  last_name: Hinds
- first_name: Mark E
  full_name: Huber, Mark E
  last_name: Huber
- first_name: Cosimo
  full_name: Inserra, Cosimo
  last_name: Inserra
- first_name: Benjamin C
  full_name: Kaiser, Benjamin C
  last_name: Kaiser
- first_name: Mansi M
  full_name: Kasliwal, Mansi M
  last_name: Kasliwal
- first_name: Niilo E
  full_name: Koivisto, Niilo E
  last_name: Koivisto
- first_name: Chien-Cheng
  full_name: Lin, Chien-Cheng
  last_name: Lin
- first_name: Chang
  full_name: Liu, Chang
  last_name: Liu
- first_name: Thomas B
  full_name: Lowe, Thomas B
  last_name: Lowe
- first_name: Eugene
  full_name: Magnier, Eugene
  last_name: Magnier
- first_name: Ashish A
  full_name: Mahabal, Ashish A
  last_name: Mahabal
- first_name: Andrew
  full_name: Milligan, Andrew
  last_name: Milligan
- first_name: Paloma
  full_name: Minguez, Paloma
  last_name: Minguez
- first_name: Geoffrey
  full_name: Mo, Geoffrey
  last_name: Mo
- first_name: Tomás E
  full_name: Müller-Bravo, Tomás E
  last_name: Müller-Bravo
- first_name: Matt
  full_name: Nicholl, Matt
  last_name: Nicholl
- first_name: Priscila J
  full_name: Pessi, Priscila J
  last_name: Pessi
- first_name: Giuliano
  full_name: Pignata, Giuliano
  last_name: Pignata
- first_name: Josiah
  full_name: Purdum, Josiah
  last_name: Purdum
- first_name: Nabeel
  full_name: Rehemtulla, Nabeel
  last_name: Rehemtulla
- first_name: R Michael
  full_name: Rich, R Michael
  last_name: Rich
- first_name: Anwesha
  full_name: Sahu, Anwesha
  last_name: Sahu
- first_name: Avinash
  full_name: Singh, Avinash
  last_name: Singh
- first_name: Stephen J
  full_name: Smartt, Stephen J
  last_name: Smartt
- first_name: Ian A
  full_name: Smith, Ian A
  last_name: Smith
- first_name: Jesper
  full_name: Sollerman, Jesper
  last_name: Sollerman
- first_name: Gokul
  full_name: Srinivasaragavan, Gokul
  last_name: Srinivasaragavan
- first_name: Shubham
  full_name: Srivastav, Shubham
  last_name: Srivastav
- first_name: Robert D
  full_name: Stein, Robert D
  last_name: Stein
- first_name: Steve
  full_name: Schulze, Steve
  last_name: Schulze
- first_name: Jack W
  full_name: Tweddle, Jack W
  last_name: Tweddle
- first_name: Richard
  full_name: Wainscoat, Richard
  last_name: Wainscoat
- first_name: Jacob L
  full_name: Wise, Jacob L
  last_name: Wise
- first_name: Lin
  full_name: Yan, Lin
  last_name: Yan
- first_name: David R
  full_name: Young, David R
  last_name: Young
citation:
  ama: 'Perley DA, Ho AYQ, McGrath Z, et al. AT 2024wpp: An extremely luminous fast
    ultraviolet transient powered by accretion onto a black hole. <i>Monthly Notices
    of the Royal Astronomical Society</i>. 2026;549(1). doi:<a href="https://doi.org/10.1093/mnras/stag678">10.1093/mnras/stag678</a>'
  apa: 'Perley, D. A., Ho, A. Y. Q., McGrath, Z., Camilo, M., Sevilla, C., Chen, P.,
    … Young, D. R. (2026). AT 2024wpp: An extremely luminous fast ultraviolet transient
    powered by accretion onto a black hole. <i>Monthly Notices of the Royal Astronomical
    Society</i>. Oxford University Press. <a href="https://doi.org/10.1093/mnras/stag678">https://doi.org/10.1093/mnras/stag678</a>'
  chicago: 'Perley, Daniel A, Anna Y Q Ho, Zoë McGrath, Michael Camilo, Cassie Sevilla,
    Ping Chen, Genevieve Schroeder, et al. “AT 2024wpp: An Extremely Luminous Fast
    Ultraviolet Transient Powered by Accretion onto a Black Hole.” <i>Monthly Notices
    of the Royal Astronomical Society</i>. Oxford University Press, 2026. <a href="https://doi.org/10.1093/mnras/stag678">https://doi.org/10.1093/mnras/stag678</a>.'
  ieee: 'D. A. Perley <i>et al.</i>, “AT 2024wpp: An extremely luminous fast ultraviolet
    transient powered by accretion onto a black hole,” <i>Monthly Notices of the Royal
    Astronomical Society</i>, vol. 549, no. 1. Oxford University Press, 2026.'
  ista: 'Perley DA, Ho AYQ, McGrath Z, Camilo M, Sevilla C, Chen P, Schroeder G, Govreen-Segal
    T, Bochenek A, Qin Y-J, Gillanders JH, Amend B, Anderson JP, Andreoni I, Aryan
    A, Bellm EC, Bloom JS, de Boer T, Carney J, Caiazzo I, Chambers KC, Charalampopoulos
    P, Chen T-W, Chen TX, Coughlin ER, Coughlin M, Dennefeld M, Dimitriadis G, Fremling
    C, Frostig D, Gal-Yam A, Galbany L, Gangopadhyay A, Ghendrih M, Graham MJ, Gromadzki
    M, Groom SL, Gutiérrez CP, Hinds K-R, Huber ME, Inserra C, Kaiser BC, Kasliwal
    MM, Koivisto NE, Lin C-C, Liu C, Lowe TB, Magnier E, Mahabal AA, Milligan A, Minguez
    P, Mo G, Müller-Bravo TE, Nicholl M, Pessi PJ, Pignata G, Purdum J, Rehemtulla
    N, Rich RM, Sahu A, Singh A, Smartt SJ, Smith IA, Sollerman J, Srinivasaragavan
    G, Srivastav S, Stein RD, Schulze S, Tweddle JW, Wainscoat R, Wise JL, Yan L,
    Young DR. 2026. AT 2024wpp: An extremely luminous fast ultraviolet transient powered
    by accretion onto a black hole. Monthly Notices of the Royal Astronomical Society.
    549(1), stag678.'
  mla: 'Perley, Daniel A., et al. “AT 2024wpp: An Extremely Luminous Fast Ultraviolet
    Transient Powered by Accretion onto a Black Hole.” <i>Monthly Notices of the Royal
    Astronomical Society</i>, vol. 549, no. 1, stag678, Oxford University Press, 2026,
    doi:<a href="https://doi.org/10.1093/mnras/stag678">10.1093/mnras/stag678</a>.'
  short: D.A. Perley, A.Y.Q. Ho, Z. McGrath, M. Camilo, C. Sevilla, P. Chen, G. Schroeder,
    T. Govreen-Segal, A. Bochenek, Y.-J. Qin, J.H. Gillanders, B. Amend, J.P. Anderson,
    I. Andreoni, A. Aryan, E.C. Bellm, J.S. Bloom, T. de Boer, J. Carney, I. Caiazzo,
    K.C. Chambers, P. Charalampopoulos, T.-W. Chen, T.X. Chen, E.R. Coughlin, M. Coughlin,
    M. Dennefeld, G. Dimitriadis, C. Fremling, D. Frostig, A. Gal-Yam, L. Galbany,
    A. Gangopadhyay, M. Ghendrih, M.J. Graham, M. Gromadzki, S.L. Groom, C.P. Gutiérrez,
    K.-R. Hinds, M.E. Huber, C. Inserra, B.C. Kaiser, M.M. Kasliwal, N.E. Koivisto,
    C.-C. Lin, C. Liu, T.B. Lowe, E. Magnier, A.A. Mahabal, A. Milligan, P. Minguez,
    G. Mo, T.E. Müller-Bravo, M. Nicholl, P.J. Pessi, G. Pignata, J. Purdum, N. Rehemtulla,
    R.M. Rich, A. Sahu, A. Singh, S.J. Smartt, I.A. Smith, J. Sollerman, G. Srinivasaragavan,
    S. Srivastav, R.D. Stein, S. Schulze, J.W. Tweddle, R. Wainscoat, J.L. Wise, L.
    Yan, D.R. Young, Monthly Notices of the Royal Astronomical Society 549 (2026).
das_tickbox: '1'
dataavailabilitystatement: All photometry is provided in the supplementary data files.
  Spectroscopy will be made available on WISEREP, and is available on request to the
  lead author.
date_created: 2026-07-13T10:50:10Z
date_published: 2026-06-01T00:00:00Z
date_updated: 2026-07-13T14:36:24Z
day: '01'
ddc:
- '520'
department:
- _id: IlCa
doi: 10.1093/mnras/stag678
external_id:
  arxiv:
  - '2601.03337'
file:
- access_level: open_access
  checksum: a5827b9f68f1731b8c8df18142c0ef38
  content_type: application/pdf
  creator: dernst
  date_created: 2026-07-13T14:35:34Z
  date_updated: 2026-07-13T14:35:34Z
  file_id: '22314'
  file_name: 2026_MNRAS_Perley.pdf
  file_size: 6208809
  relation: main_file
  success: 1
file_date_updated: 2026-07-13T14:35:34Z
fulldoi: https://doi.org/10.1093/mnras/stag678
has_accepted_license: '1'
intvolume: '       549'
issue: '1'
keyword:
- 'stars: black holes'
- 'supernovae: individual: AT2024wpp'
- 'radio continuum: transients'
language:
- iso: eng
license: https://creativecommons.org/licenses/by/4.0/
month: '06'
oa: 1
oa_version: Published Version
publication: Monthly Notices of the Royal Astronomical Society
publication_identifier:
  eissn:
  - 1365-2966
  issn:
  - 0035-8711
publication_status: published
publisher: Oxford University Press
quality_controlled: '1'
researchdata_availability: upon request
scopus_import: '1'
status: public
supplementarymaterial: yes
title: 'AT 2024wpp: An extremely luminous fast ultraviolet transient powered by accretion
  onto a black hole'
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: 549
year: '2026'
...
---
OA_place: repository
OA_type: green
_id: '20585'
abstract:
- lang: eng
  text: Motivated by applications in medical sciences, we study finite chromatic sets
    in Euclidean space from a topological perspective. Based on the persistent homology
    for images, kernels and cokernels, we design provably stable homological quantifiers
    that describe the geometric micro- and macro-structure of how the color classes
    mingle. These can be efficiently computed using chromatic variants of Delaunay
    and alpha complexes, and code that does these computations is provided.
acknowledgement: "This project has received funding from the European Research\r\nCouncil
  (ERC) under the European Union’s Horizon 2020 research and innovation\r\nprogramme,
  grant no. 788183, from the Wittgenstein Prize, Austrian Science Fund\r\n(FWF), grant
  no. Z 342-N31, and from the DFG Collaborative Research Center TRR\r\n109, ‘Discretization
  in Geometry and Dynamics’, Austrian Science Fund (FWF),\r\ngrant no. I 02979-N35."
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Sebastiano
  full_name: Cultrera di Montesano, Sebastiano
  id: 34D2A09C-F248-11E8-B48F-1D18A9856A87
  last_name: Cultrera di Montesano
  orcid: 0000-0001-6249-0832
- first_name: Ondrej
  full_name: Draganov, Ondrej
  id: 2B23F01E-F248-11E8-B48F-1D18A9856A87
  last_name: Draganov
  orcid: 0000-0003-0464-3823
- first_name: Herbert
  full_name: Edelsbrunner, Herbert
  id: 3FB178DA-F248-11E8-B48F-1D18A9856A87
  last_name: Edelsbrunner
  orcid: 0000-0002-9823-6833
- first_name: Morteza
  full_name: Saghafian, Morteza
  id: f86f7148-b140-11ec-9577-95435b8df824
  last_name: Saghafian
citation:
  ama: Cultrera di Montesano S, Draganov O, Edelsbrunner H, Saghafian M. Chromatic
    alpha complexes. <i>Foundations of Data Science</i>. 2026;8:30-62. doi:<a href="https://doi.org/10.3934/fods.2025003">10.3934/fods.2025003</a>
  apa: Cultrera di Montesano, S., Draganov, O., Edelsbrunner, H., &#38; Saghafian,
    M. (2026). Chromatic alpha complexes. <i>Foundations of Data Science</i>. AIMS.
    <a href="https://doi.org/10.3934/fods.2025003">https://doi.org/10.3934/fods.2025003</a>
  chicago: Cultrera di Montesano, Sebastiano, Ondrej Draganov, Herbert Edelsbrunner,
    and Morteza Saghafian. “Chromatic Alpha Complexes.” <i>Foundations of Data Science</i>.
    AIMS, 2026. <a href="https://doi.org/10.3934/fods.2025003">https://doi.org/10.3934/fods.2025003</a>.
  ieee: S. Cultrera di Montesano, O. Draganov, H. Edelsbrunner, and M. Saghafian,
    “Chromatic alpha complexes,” <i>Foundations of Data Science</i>, vol. 8. AIMS,
    pp. 30–62, 2026.
  ista: Cultrera di Montesano S, Draganov O, Edelsbrunner H, Saghafian M. 2026. Chromatic
    alpha complexes. Foundations of Data Science. 8, 30–62.
  mla: Cultrera di Montesano, Sebastiano, et al. “Chromatic Alpha Complexes.” <i>Foundations
    of Data Science</i>, vol. 8, AIMS, 2026, pp. 30–62, doi:<a href="https://doi.org/10.3934/fods.2025003">10.3934/fods.2025003</a>.
  short: S. Cultrera di Montesano, O. Draganov, H. Edelsbrunner, M. Saghafian, Foundations
    of Data Science 8 (2026) 30–62.
corr_author: '1'
date_created: 2025-11-02T23:01:33Z
date_published: 2026-03-01T00:00:00Z
date_updated: 2026-10-02T11:56:12Z
day: '01'
ddc:
- '510'
department:
- _id: HeEd
doi: 10.3934/fods.2025003
ec_funded: 1
external_id:
  arxiv:
  - '2212.03128'
fulldoi: https://doi.org/10.3934/fods.2025003
has_accepted_license: '1'
intvolume: '         8'
keyword:
- Topological data analysis
- Delaunay mosaic
- alpha complex
- chromatic sets
- persistent homology
- kernel/image/cokernel persistent homology
- radius function
- discrete Morse theory
- exact sequences
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://doi.org/10.48550/arXiv.2212.03128
mathsc:
- 62R40
- 55N31
- 68T09
- 57Q70
month: '03'
oa: 1
oa_version: Preprint
page: 30-62
project:
- _id: 266A2E9E-B435-11E9-9278-68D0E5697425
  call_identifier: H2020
  grant_number: '788183'
  name: Alpha Shape Theory Extended
- _id: 268116B8-B435-11E9-9278-68D0E5697425
  call_identifier: FWF
  grant_number: Z00342
  name: Mathematics, Computer Science
- _id: 2561EBF4-B435-11E9-9278-68D0E5697425
  call_identifier: FWF
  grant_number: I02979-N35
  name: Persistence and stability of geometric complexes
publication: Foundations of Data Science
publication_identifier:
  eissn:
  - 2639-8001
publication_status: published
publisher: AIMS
quality_controlled: '1'
related_material:
  record:
  - id: '15091'
    relation: earlier_version
    status: public
scopus_import: '1'
status: public
title: Chromatic alpha complexes
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 8
year: '2026'
...
---
DOAJ_listed: '1'
OA_place: publisher
OA_type: gold
PlanS_conform: '1'
_id: '18706'
abstract:
- lang: eng
  text: "We prove discrete-to-continuum convergence for dynamical optimal transport
    on  Zd\r\n -periodic graphs with cost functional having linear growth at infinity.
    This result provides an answer to a problem left open by Gladbach, Kopfer, Maas,
    and Portinale (Calc Var Partial Differential Equations 62(5), 2023), where the
    convergence behaviour of discrete boundary-value dynamical transport problems
    is proved under the stronger assumption of superlinear growth. Our result extends
    the known literature to some important classes of examples, such as scaling limits
    of  1 -Wasserstein transport problems. Similarly to what happens in the quadratic
    case, the geometry of the graph plays a crucial role in the structure of the limit
    cost function, as we discuss in the final part of this work, which includes some
    visual representations."
acknowledgement: L.P. gratefully acknowledges fundings from the Deutsche Forschungsgemeinschaft
  (DFG, German Research Foundation) under Germany’s Excellence Strategy – GZ 2047/1,
  Projekt-ID 390685813. F.Q. gratefully acknowledges support from the Austrian Science
  Fund (FWF) project 10.55776/F65.
article_processing_charge: Yes
article_type: original
author:
- first_name: Lorenzo
  full_name: Portinale, Lorenzo
  id: 30AD2CBC-F248-11E8-B48F-1D18A9856A87
  last_name: Portinale
- first_name: Filippo
  full_name: Quattrocchi, Filippo
  id: 3ebd6ba8-edfb-11eb-afb5-91a9745ba308
  last_name: Quattrocchi
  orcid: 0009-0000-9773-1931
citation:
  ama: Portinale L, Quattrocchi F. Discrete-to-continuum limits of optimal transport
    with linear growth on periodic graphs. <i>European Journal of Applied Mathematics</i>.
    2026;37(3):614-642. doi:<a href="https://doi.org/10.1017/s0956792524000810">10.1017/s0956792524000810</a>
  apa: Portinale, L., &#38; Quattrocchi, F. (2026). Discrete-to-continuum limits of
    optimal transport with linear growth on periodic graphs. <i>European Journal of
    Applied Mathematics</i>. Cambridge University Press. <a href="https://doi.org/10.1017/s0956792524000810">https://doi.org/10.1017/s0956792524000810</a>
  chicago: Portinale, Lorenzo, and Filippo Quattrocchi. “Discrete-to-Continuum Limits
    of Optimal Transport with Linear Growth on Periodic Graphs.” <i>European Journal
    of Applied Mathematics</i>. Cambridge University Press, 2026. <a href="https://doi.org/10.1017/s0956792524000810">https://doi.org/10.1017/s0956792524000810</a>.
  ieee: L. Portinale and F. Quattrocchi, “Discrete-to-continuum limits of optimal
    transport with linear growth on periodic graphs,” <i>European Journal of Applied
    Mathematics</i>, vol. 37, no. 3. Cambridge University Press, pp. 614–642, 2026.
  ista: Portinale L, Quattrocchi F. 2026. Discrete-to-continuum limits of optimal
    transport with linear growth on periodic graphs. European Journal of Applied Mathematics.
    37(3), 614–642.
  mla: Portinale, Lorenzo, and Filippo Quattrocchi. “Discrete-to-Continuum Limits
    of Optimal Transport with Linear Growth on Periodic Graphs.” <i>European Journal
    of Applied Mathematics</i>, vol. 37, no. 3, Cambridge University Press, 2026,
    pp. 614–42, doi:<a href="https://doi.org/10.1017/s0956792524000810">10.1017/s0956792524000810</a>.
  short: L. Portinale, F. Quattrocchi, European Journal of Applied Mathematics 37
    (2026) 614–642.
das_tickbox: '0'
date_created: 2024-12-23T11:03:59Z
date_published: 2026-06-01T00:00:00Z
date_updated: 2026-10-28T23:31:05Z
day: '01'
ddc:
- '500'
department:
- _id: GradSch
- _id: JaMa
doi: 10.1017/s0956792524000810
external_id:
  isi:
  - '001381435800001'
file:
- access_level: open_access
  checksum: d038f4d00cbfbde2672c17138eab21c9
  content_type: application/pdf
  creator: dernst
  date_created: 2026-07-23T05:55:03Z
  date_updated: 2026-07-23T05:55:03Z
  file_id: '22386'
  file_name: 2026_EuropJourAppliedMath_Portinale.pdf
  file_size: 612317
  relation: main_file
  success: 1
file_date_updated: 2026-07-23T05:55:03Z
fulldoi: https://doi.org/10.1017/s0956792524000810
has_accepted_license: '1'
intvolume: '        37'
isi: 1
issue: '3'
keyword:
- optimal transport
- discrete-to-continuum
- homogenisation
- linear growth
- gamma-convergence
language:
- iso: eng
month: '06'
oa: 1
oa_version: Published Version
page: 614-642
project:
- _id: fc31cba2-9c52-11eb-aca3-ff467d239cd2
  grant_number: F6504
  name: Taming Complexity in Partial Differential Systems
publication: European Journal of Applied Mathematics
publication_identifier:
  eissn:
  - 1469-4425
  issn:
  - 0956-7925
publication_status: published
publisher: Cambridge University Press
quality_controlled: '1'
related_material:
  record:
  - id: '20563'
    relation: dissertation_contains
    status: public
researchdata_availability: no
scopus_import: '1'
status: public
supplementarymaterial: no
title: Discrete-to-continuum limits of optimal transport with linear growth on periodic
  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: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 37
year: '2026'
...
---
OA_place: publisher
OA_type: hybrid
_id: '10045'
abstract:
- lang: eng
  text: "Given a fixed finite metric space (V,μ), the {\\em minimum 0-extension problem},
    denoted as 0-Ext[μ], is equivalent to the following optimization problem: minimize
    function of the form minx∈Vn∑ifi(xi)+∑ijcijμ(xi,xj) where cij,cvi are given nonnegative
    costs and fi:V→R are functions given by fi(xi)=∑v∈Vcviμ(xi,v). The computational
    complexity of 0-Ext[μ] has been recently established by Karzanov and by Hirai:
    if metric μ is {\\em orientable modular} then 0-Ext[μ] can be solved in polynomial
    time, otherwise 0-Ext[μ] is NP-hard. To prove the tractability part, Hirai developed
    a theory of discrete convex functions on orientable modular graphs generalizing
    several known classes of functions in discrete convex analysis, such as L♮-convex
    functions. We consider a more general version of the problem in which unary functions
    fi(xi) can additionally have terms of the form cuv;iμ(xi,{u,v}) for {u,v}∈F, where
    set F⊆(V2) is fixed. We extend the complexity classification above by providing
    an explicit condition on (μ,F) for the problem to be tractable. In order to prove
    the tractability part, we generalize Hirai's theory and define a larger class
    of discrete convex functions. It covers, in particular, another well-known class
    of functions, namely submodular functions on an integer lattice. Finally, we improve
    the complexity of Hirai's algorithm for solving 0-Ext on orientable modular graphs.\r\n"
acknowledgement: We thank the anonymous reviewers for their careful reading of our
  manuscript and their many insightful comments and suggestions. Open access funding
  provided by Institute of Science and Technology (IST Austria).
article_processing_charge: Yes (via OA deal)
article_type: original
arxiv: 1
author:
- first_name: Martin
  full_name: Dvorak, Martin
  id: 40ED02A8-C8B4-11E9-A9C0-453BE6697425
  last_name: Dvorak
  orcid: 0000-0001-5293-214X
- first_name: Vladimir
  full_name: Kolmogorov, Vladimir
  id: 3D50B0BA-F248-11E8-B48F-1D18A9856A87
  last_name: Kolmogorov
citation:
  ama: Dvorak M, Kolmogorov V. Generalized minimum 0-extension problem and discrete
    convexity. <i>Mathematical Programming</i>. 2025;209:279-322. doi:<a href="https://doi.org/10.1007/s10107-024-02064-5">10.1007/s10107-024-02064-5</a>
  apa: Dvorak, M., &#38; Kolmogorov, V. (2025). Generalized minimum 0-extension problem
    and discrete convexity. <i>Mathematical Programming</i>. Springer Nature. <a href="https://doi.org/10.1007/s10107-024-02064-5">https://doi.org/10.1007/s10107-024-02064-5</a>
  chicago: Dvorak, Martin, and Vladimir Kolmogorov. “Generalized Minimum 0-Extension
    Problem and Discrete Convexity.” <i>Mathematical Programming</i>. Springer Nature,
    2025. <a href="https://doi.org/10.1007/s10107-024-02064-5">https://doi.org/10.1007/s10107-024-02064-5</a>.
  ieee: M. Dvorak and V. Kolmogorov, “Generalized minimum 0-extension problem and
    discrete convexity,” <i>Mathematical Programming</i>, vol. 209. Springer Nature,
    pp. 279–322, 2025.
  ista: Dvorak M, Kolmogorov V. 2025. Generalized minimum 0-extension problem and
    discrete convexity. Mathematical Programming. 209, 279–322.
  mla: Dvorak, Martin, and Vladimir Kolmogorov. “Generalized Minimum 0-Extension Problem
    and Discrete Convexity.” <i>Mathematical Programming</i>, vol. 209, Springer Nature,
    2025, pp. 279–322, doi:<a href="https://doi.org/10.1007/s10107-024-02064-5">10.1007/s10107-024-02064-5</a>.
  short: M. Dvorak, V. Kolmogorov, Mathematical Programming 209 (2025) 279–322.
corr_author: '1'
das_tickbox: '0'
date_created: 2021-09-27T10:48:23Z
date_published: 2025-01-01T00:00:00Z
date_updated: 2026-10-02T11:45:16Z
day: '01'
ddc:
- '004'
department:
- _id: GradSch
- _id: VlKo
doi: 10.1007/s10107-024-02064-5
external_id:
  arxiv:
  - '2109.10203'
  isi:
  - '001176563300001'
file:
- access_level: open_access
  checksum: 25d9bd490719b45eca84f4d93a06c69f
  content_type: application/pdf
  creator: dernst
  date_created: 2025-04-16T09:36:08Z
  date_updated: 2025-04-16T09:36:08Z
  file_id: '19578'
  file_name: 2025_MathProgramming_Dvorak.pdf
  file_size: 839510
  relation: main_file
  success: 1
file_date_updated: 2025-04-16T09:36:08Z
fulldoi: https://doi.org/10.1007/s10107-024-02064-5
has_accepted_license: '1'
intvolume: '       209'
isi: 1
keyword:
- minimum 0-extension problem
- metric labeling problem
- discrete metric spaces
- metric extensions
- computational complexity
- valued constraint satisfaction problems
- discrete convex analysis
- L-convex functions
language:
- iso: eng
month: '01'
oa: 1
oa_version: Published Version
page: 279-322
publication: Mathematical Programming
publication_identifier:
  eissn:
  - 1436-4646
  issn:
  - 0025-5610
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
researchdata_availability: no
scopus_import: '1'
status: public
supplementarymaterial: no
title: Generalized minimum 0-extension problem and discrete convexity
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: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 209
year: '2025'
...
---
OA_place: publisher
_id: '18979'
abstract:
- lang: eng
  text: "Topological Data Analysis (TDA) is a discipline utilizing the mathematical
    field of topology to study data, most prominently collections of point sets. This
    thesis summarizes three projects related to computations in TDA.\r\n\r\nThe first
    one establishes a variant of TDA for chromatic point sets, where each point is
    given a color. For example, we are given positions of cells within a tumor microenvironment,
    and color the cancerous cells red, and the immune cells blue.\r\n\r\nThe aim is
    then to give a quantitative description of how the two or more sets of points
    spatially interact. Building on image, kernel and cokernel variants of persistent
    homology, we suggest six-packs of persistent diagrams as such a descriptor.\r\n\r\nWe
    describe a construction of a chromatic alpha complex, which enables  efficient
    computation of several variants of the six-packs. We give topological descriptions
    of natural subcomplexes of the chromatic alpha complex, and show that the radii
    of the simplices form a discrete Morse function. Finally, we provide an implementation
    of the presented chromatic TDA pipeline.\r\n\r\nThe second part aims to translate
    a powerful tool of sheaf theory to elementary terms using labeled matrices. The
    goal is to enable their use in computational settings. We show that derived categories
    of sheaves over finite posets have, up to isomorphism, unique objects---minimal
    injective resolutions---and give a concrete algorithm to compute them. We further
    describe simple algorithms to compute derived pushforwards and pullbacks for monotonic
    maps, and their proper variants for inclusions, and demonstrate their tractability
    by providing an implementation. Finally, we suggest a discrete definition of microsupport
    and show desirable properties inspired by discrete Morse theory.\r\n\r\nIn the
    last part, we present a collection of observations about collapses. We give a
    characterization of collapsibility in terms of unitriangular submatrices of the
    boundary matrix, a cotree-tree decomposition, and the optimal solution to a variant
    of the Procrustes problem. We establish relation between dual collapses and relative
    Morse theory and pose several open questions. Finally, focusing on complexes embedded
    in the three-dimensional Euclidean space, we describe a relation between the collapsibility
    and the triviality of a polygonal knot."
acknowledgement: "The research presented in this thesis was funded with the Wittgenstein
  Prize,\r\nAustrian Science Fund (FWF), grant no. Z 342-N31, and from the DFG Collaborative
  Research\r\nCenter TRR 109, ‘Discretization in Geometry and Dynamics’, Austrian
  Science Fund (FWF),\r\ngrant no. I 02979-N35.\r\n"
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Ondrej
  full_name: Draganov, Ondrej
  id: 2B23F01E-F248-11E8-B48F-1D18A9856A87
  last_name: Draganov
  orcid: 0000-0003-0464-3823
citation:
  ama: Draganov O. Structures and computations in topological data analysis. 2025.
    doi:<a href="https://doi.org/10.15479/at:ista:18979">10.15479/at:ista:18979</a>
  apa: Draganov, O. (2025). <i>Structures and computations in topological data analysis</i>.
    Institute of Science and Technology Austria. <a href="https://doi.org/10.15479/at:ista:18979">https://doi.org/10.15479/at:ista:18979</a>
  chicago: Draganov, Ondrej. “Structures and Computations in Topological Data Analysis.”
    Institute of Science and Technology Austria, 2025. <a href="https://doi.org/10.15479/at:ista:18979">https://doi.org/10.15479/at:ista:18979</a>.
  ieee: O. Draganov, “Structures and computations in topological data analysis,” Institute
    of Science and Technology Austria, 2025.
  ista: Draganov O. 2025. Structures and computations in topological data analysis.
    Institute of Science and Technology Austria.
  mla: Draganov, Ondrej. <i>Structures and Computations in Topological Data Analysis</i>.
    Institute of Science and Technology Austria, 2025, doi:<a href="https://doi.org/10.15479/at:ista:18979">10.15479/at:ista:18979</a>.
  short: O. Draganov, Structures and Computations in Topological Data Analysis, Institute
    of Science and Technology Austria, 2025.
corr_author: '1'
date_created: 2025-01-31T17:04:40Z
date_published: 2025-02-03T00:00:00Z
date_updated: 2026-10-02T11:57:00Z
day: '03'
ddc:
- '514'
- '004'
degree_awarded: PhD
department:
- _id: GradSch
- _id: HeEd
doi: 10.15479/at:ista:18979
file:
- access_level: closed
  checksum: af6567e5d35e5eb330b8925ae37f1998
  content_type: application/zip
  creator: odragano
  date_created: 2025-01-31T16:58:30Z
  date_updated: 2025-01-31T16:58:30Z
  file_id: '18983'
  file_name: Thesis.zip
  file_size: 11899491
  relation: source_file
- access_level: open_access
  checksum: c3fef68e35b9dc2020b2ca6006da6343
  content_type: application/pdf
  creator: odragano
  date_created: 2025-02-04T16:22:07Z
  date_updated: 2025-02-04T16:22:07Z
  file_id: '19000'
  file_name: Thesis.pdf
  file_size: 8857514
  relation: main_file
file_date_updated: 2025-02-04T16:22:07Z
fulldoi: https://doi.org/10.15479/at:ista:18979
has_accepted_license: '1'
keyword:
- topological data analysis
- chromatic point set
- alpha complex
- persistent homology
- six pack
- sheaf
- microlocal discrete Morse
- injective resolution
- collapse
- knot
- discrete Morse theory
language:
- iso: eng
month: '02'
oa: 1
oa_version: Published Version
page: '140'
project:
- _id: 2561EBF4-B435-11E9-9278-68D0E5697425
  call_identifier: FWF
  grant_number: I02979-N35
  name: Persistence and stability of geometric complexes
- _id: 268116B8-B435-11E9-9278-68D0E5697425
  call_identifier: FWF
  grant_number: Z00342
  name: Mathematics, Computer Science
publication_identifier:
  issn:
  - 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
related_material:
  record:
  - id: '15091'
    relation: part_of_dissertation
    status: public
  - id: '18981'
    relation: part_of_dissertation
    status: public
status: public
supervisor:
- first_name: Herbert
  full_name: Edelsbrunner, Herbert
  id: 3FB178DA-F248-11E8-B48F-1D18A9856A87
  last_name: Edelsbrunner
  orcid: 0000-0002-9823-6833
title: Structures and computations in topological data analysis
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: dissertation
user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd
year: '2025'
...
---
OA_place: publisher
OA_type: hybrid
PlanS_conform: '1'
_id: '12311'
abstract:
- lang: eng
  text: In this note, we prove a formula for the cancellation exponent  kv,n between
    division polynomials  ψn  and  ϕn  associated with a sequence  {nP}n∈N of points
    on an elliptic curve  E  defined over a discrete valuation field  K. The formula
    greatly generalizes the previously known special cases and treats also the case
    of non-standard Kodaira types for non-perfect residue fields.
acknowledgement: Silverman, and Paul Voutier for the comments on the earlier version
  of this paper. The first author acknowledges the support by Dioscuri programme initiated
  by the Max Planck Society, jointly managed with the National Science Centre (Poland),
  and mutually funded by the Polish Ministry of Science and Higher Education and the
  German Federal Ministry of Education and Research. The second author has been supported
  by MIUR (Italy) through PRIN 2017 ‘Geometric, algebraic and analytic methods in
  arithmetic’ and has received funding from the European Union's Horizon 2020 research
  and innovation programme under the Marie Skłodowska-Curie Grant Agreement No. 101034413.
article_processing_charge: Yes (via OA deal)
article_type: original
arxiv: 1
author:
- first_name: Bartosz
  full_name: Naskręcki, Bartosz
  last_name: Naskręcki
- first_name: Matteo
  full_name: Verzobio, Matteo
  id: 7aa8f170-131e-11ed-88e1-a9efd01027cb
  last_name: Verzobio
  orcid: 0000-0002-0854-0306
citation:
  ama: 'Naskręcki B, Verzobio M. Common valuations of division polynomials. <i>Proceedings
    of the Royal Society of Edinburgh Section A: Mathematics</i>. 2025;155(5):1646-1660.
    doi:<a href="https://doi.org/10.1017/prm.2024.7">10.1017/prm.2024.7</a>'
  apa: 'Naskręcki, B., &#38; Verzobio, M. (2025). Common valuations of division polynomials.
    <i>Proceedings of the Royal Society of Edinburgh Section A: Mathematics</i>. Cambridge
    University Press. <a href="https://doi.org/10.1017/prm.2024.7">https://doi.org/10.1017/prm.2024.7</a>'
  chicago: 'Naskręcki, Bartosz, and Matteo Verzobio. “Common Valuations of Division
    Polynomials.” <i>Proceedings of the Royal Society of Edinburgh Section A: Mathematics</i>.
    Cambridge University Press, 2025. <a href="https://doi.org/10.1017/prm.2024.7">https://doi.org/10.1017/prm.2024.7</a>.'
  ieee: 'B. Naskręcki and M. Verzobio, “Common valuations of division polynomials,”
    <i>Proceedings of the Royal Society of Edinburgh Section A: Mathematics</i>, vol.
    155, no. 5. Cambridge University Press, pp. 1646–1660, 2025.'
  ista: 'Naskręcki B, Verzobio M. 2025. Common valuations of division polynomials.
    Proceedings of the Royal Society of Edinburgh Section A: Mathematics. 155(5),
    1646–1660.'
  mla: 'Naskręcki, Bartosz, and Matteo Verzobio. “Common Valuations of Division Polynomials.”
    <i>Proceedings of the Royal Society of Edinburgh Section A: Mathematics</i>, vol.
    155, no. 5, Cambridge University Press, 2025, pp. 1646–60, doi:<a href="https://doi.org/10.1017/prm.2024.7">10.1017/prm.2024.7</a>.'
  short: 'B. Naskręcki, M. Verzobio, Proceedings of the Royal Society of Edinburgh
    Section A: Mathematics 155 (2025) 1646–1660.'
corr_author: '1'
das_tickbox: '0'
date_created: 2023-01-16T11:45:22Z
date_published: 2025-10-01T00:00:00Z
date_updated: 2026-10-21T11:01:35Z
day: '01'
ddc:
- '510'
department:
- _id: TiBr
doi: 10.1017/prm.2024.7
ec_funded: 1
external_id:
  arxiv:
  - '2203.02015'
  isi:
  - '001174907100001'
file:
- access_level: open_access
  checksum: c5ec6e29aca2fb4533cb95fac409a0b2
  content_type: application/pdf
  creator: dernst
  date_created: 2025-12-30T06:45:47Z
  date_updated: 2025-12-30T06:45:47Z
  file_id: '20878'
  file_name: 2025_ProceedingsRoyalSocEdinburghA_Naskrecki.pdf
  file_size: 477624
  relation: main_file
  success: 1
file_date_updated: 2025-12-30T06:45:47Z
fulldoi: https://doi.org/10.1017/prm.2024.7
has_accepted_license: '1'
intvolume: '       155'
isi: 1
issue: '5'
keyword:
- Elliptic curves
- Néron models
- division polynomials
- height functions
- discrete valuation rings
language:
- iso: eng
month: '10'
oa: 1
oa_version: Published Version
page: 1646-1660
project:
- _id: fc2ed2f7-9c52-11eb-aca3-c01059dda49c
  call_identifier: H2020
  grant_number: '101034413'
  name: 'IST-BRIDGE: International postdoctoral program'
publication: 'Proceedings of the Royal Society of Edinburgh Section A: Mathematics'
publication_identifier:
  eissn:
  - 1473-7124
  issn:
  - 0308-2105
publication_status: published
publisher: Cambridge University Press
quality_controlled: '1'
researchdata_availability: no
scopus_import: '1'
status: public
supplementarymaterial: no
title: Common valuations of division polynomials
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: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 155
year: '2025'
...
---
OA_place: repository
OA_type: green
_id: '21528'
abstract:
- lang: eng
  text: We present a framework for the end-to-end optimization of metasurface imaging
    systems that reconstruct targets using compressed sensing, a technique for solving
    underdetermined imaging problems when the target object exhibits sparsity (e.g.,
    the object can be described by a small number of nonzero values, but the positions
    of these values are unknown). We nest an iterative, unapproximated compressed
    sensing reconstruction algorithm into our end-to-end optimization pipeline, resulting
    in an interpretable, data-efficient method for maximally leveraging metaoptics
    to exploit object sparsity. We apply our framework to super-resolution imaging
    and high-resolution depth imaging with a phase-change material. In both situations,
    our end-to-end framework effectively optimizes metasurface structures for compressed
    sensing recovery, automatically balancing a number of complicated design considerations
    to select an imaging measurement matrix from a complex, physically constrained
    manifold with millions of dimensions. The optimized metasurface imaging systems
    are robust to noise, significantly improving over random scattering surfaces and
    approaching the ideal compressed sensing performance of a Gaussian matrix, showing
    how a physical metasurface system can demonstrably approach the mathematical limits
    of compressed sensing.
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Gaurav
  full_name: Arya, Gaurav
  last_name: Arya
- first_name: William F.
  full_name: Li, William F.
  last_name: Li
- first_name: Charles
  full_name: Roques-Carmes, Charles
  id: e2e68fc9-6505-11ef-a541-eb4e72cc3e82
  last_name: Roques-Carmes
- first_name: Marin
  full_name: Soljačić, Marin
  last_name: Soljačić
- first_name: Steven G.
  full_name: Johnson, Steven G.
  last_name: Johnson
- first_name: Zin
  full_name: Lin, Zin
  last_name: Lin
citation:
  ama: Arya G, Li WF, Roques-Carmes C, Soljačić M, Johnson SG, Lin Z. End-to-end optimization
    of metasurfaces for imaging with compressed sensing. <i>ACS Photonics</i>. 2024;11(5):2077-2087.
    doi:<a href="https://doi.org/10.1021/acsphotonics.4c00259">10.1021/acsphotonics.4c00259</a>
  apa: Arya, G., Li, W. F., Roques-Carmes, C., Soljačić, M., Johnson, S. G., &#38;
    Lin, Z. (2024). End-to-end optimization of metasurfaces for imaging with compressed
    sensing. <i>ACS Photonics</i>. American Chemical Society. <a href="https://doi.org/10.1021/acsphotonics.4c00259">https://doi.org/10.1021/acsphotonics.4c00259</a>
  chicago: Arya, Gaurav, William F. Li, Charles Roques-Carmes, Marin Soljačić, Steven
    G. Johnson, and Zin Lin. “End-to-End Optimization of Metasurfaces for Imaging
    with Compressed Sensing.” <i>ACS Photonics</i>. American Chemical Society, 2024.
    <a href="https://doi.org/10.1021/acsphotonics.4c00259">https://doi.org/10.1021/acsphotonics.4c00259</a>.
  ieee: G. Arya, W. F. Li, C. Roques-Carmes, M. Soljačić, S. G. Johnson, and Z. Lin,
    “End-to-end optimization of metasurfaces for imaging with compressed sensing,”
    <i>ACS Photonics</i>, vol. 11, no. 5. American Chemical Society, pp. 2077–2087,
    2024.
  ista: Arya G, Li WF, Roques-Carmes C, Soljačić M, Johnson SG, Lin Z. 2024. End-to-end
    optimization of metasurfaces for imaging with compressed sensing. ACS Photonics.
    11(5), 2077–2087.
  mla: Arya, Gaurav, et al. “End-to-End Optimization of Metasurfaces for Imaging with
    Compressed Sensing.” <i>ACS Photonics</i>, vol. 11, no. 5, American Chemical Society,
    2024, pp. 2077–87, doi:<a href="https://doi.org/10.1021/acsphotonics.4c00259">10.1021/acsphotonics.4c00259</a>.
  short: G. Arya, W.F. Li, C. Roques-Carmes, M. Soljačić, S.G. Johnson, Z. Lin, ACS
    Photonics 11 (2024) 2077–2087.
date_created: 2026-03-30T12:22:47Z
date_published: 2024-04-23T00:00:00Z
date_updated: 2026-04-27T09:03:21Z
day: '23'
ddc:
- '530'
doi: 10.1021/acsphotonics.4c00259
extern: '1'
external_id:
  arxiv:
  - '2201.12348'
fulldoi: https://doi.org/10.1021/acsphotonics.4c00259
intvolume: '        11'
issue: '5'
keyword:
- end-to-end
- optimization
- metasurface
- imaging
- compressed sensing
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://doi.org/10.48550/arXiv.2201.12348
month: '04'
oa: 1
oa_version: Preprint
page: 2077-2087
publication: ACS Photonics
publication_identifier:
  eissn:
  - 2330-4022
publication_status: published
publisher: American Chemical Society
quality_controlled: '1'
scopus_import: '1'
status: public
title: End-to-end optimization of metasurfaces for imaging with compressed sensing
type: journal_article
user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd
volume: 11
year: '2024'
...
---
OA_place: repository
OA_type: green
_id: '21672'
abstract:
- lang: eng
  text: We present a framework for the end-to-end optimization of metasurface imaging
    systems that reconstruct targets using compressed sensing, a technique for solving
    underdetermined imaging problems when the target object exhibits sparsity (i.e.
    the object can be described by a small number of non-zero values, but the positions
    of these values are unknown). We nest an iterative, unapproximated compressed
    sensing reconstruction algorithm into our end-to-end optimization pipeline, resulting
    in an interpretable, data-efficient method for maximally leveraging metaoptics
    to exploit object sparsity. We apply our framework to super-resolution imaging
    and high-resolution depth imaging with a phase-change material. In both situations,
    our end-to-end framework computationally discovers optimal metasurface structures
    for compressed sensing recovery, automatically balancing a number of complicated
    design considerations to select an imaging measurement matrix from a complex,
    physically constrained manifold with millions ofdimensions. The optimized metasurface
    imaging systems are robust to noise, significantly improving over random scattering
    surfaces and approaching the ideal compressed sensing performance of a Gaussian
    matrix, showing how a physical metasurface system can demonstrably approach the
    mathematical limits of compressed sensing.
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Gaurav
  full_name: Arya, Gaurav
  last_name: Arya
- first_name: William F.
  full_name: Li, William F.
  last_name: Li
- first_name: Charles
  full_name: Roques-Carmes, Charles
  id: e2e68fc9-6505-11ef-a541-eb4e72cc3e82
  last_name: Roques-Carmes
- first_name: Marin
  full_name: Soljačić, Marin
  last_name: Soljačić
- first_name: Steven G.
  full_name: Johnson, Steven G.
  last_name: Johnson
- first_name: Zin
  full_name: Lin, Zin
  last_name: Lin
citation:
  ama: Arya G, Li WF, Roques-Carmes C, Soljačić M, Johnson SG, Lin Z. End-to-end optimization
    of metasurfaces for imaging with compressed sensing. <i>ACS Photonics</i>. 2024.
    doi:<a href="https://doi.org/10.1021/acsphotonics.4c00259">10.1021/acsphotonics.4c00259</a>
  apa: Arya, G., Li, W. F., Roques-Carmes, C., Soljačić, M., Johnson, S. G., &#38;
    Lin, Z. (2024). End-to-end optimization of metasurfaces for imaging with compressed
    sensing. <i>ACS Photonics</i>. American Chemical Society. <a href="https://doi.org/10.1021/acsphotonics.4c00259">https://doi.org/10.1021/acsphotonics.4c00259</a>
  chicago: Arya, Gaurav, William F. Li, Charles Roques-Carmes, Marin Soljačić, Steven
    G. Johnson, and Zin Lin. “End-to-End Optimization of Metasurfaces for Imaging
    with Compressed Sensing.” <i>ACS Photonics</i>. American Chemical Society, 2024.
    <a href="https://doi.org/10.1021/acsphotonics.4c00259">https://doi.org/10.1021/acsphotonics.4c00259</a>.
  ieee: G. Arya, W. F. Li, C. Roques-Carmes, M. Soljačić, S. G. Johnson, and Z. Lin,
    “End-to-end optimization of metasurfaces for imaging with compressed sensing,”
    <i>ACS Photonics</i>. American Chemical Society, 2024.
  ista: Arya G, Li WF, Roques-Carmes C, Soljačić M, Johnson SG, Lin Z. 2024. End-to-end
    optimization of metasurfaces for imaging with compressed sensing. ACS Photonics.
  mla: Arya, Gaurav, et al. “End-to-End Optimization of Metasurfaces for Imaging with
    Compressed Sensing.” <i>ACS Photonics</i>, American Chemical Society, 2024, doi:<a
    href="https://doi.org/10.1021/acsphotonics.4c00259">10.1021/acsphotonics.4c00259</a>.
  short: G. Arya, W.F. Li, C. Roques-Carmes, M. Soljačić, S.G. Johnson, Z. Lin, ACS
    Photonics (2024).
date_created: 2026-04-09T09:10:41Z
date_published: 2024-04-23T00:00:00Z
date_updated: 2026-04-27T09:23:04Z
day: '23'
ddc:
- '530'
doi: 10.1021/acsphotonics.4c00259
extern: '1'
external_id:
  arxiv:
  - '2201.12348'
fulldoi: https://doi.org/10.1021/acsphotonics.4c00259
keyword:
- end-to-end
- optimization
- metasurface
- imaging
- compressed sensing
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://doi.org/10.48550/arXiv.2201.12348
month: '04'
oa: 1
oa_version: Preprint
publication: ACS Photonics
publication_identifier:
  eissn:
  - 2330-4022
publication_status: published
publisher: American Chemical Society
quality_controlled: '1'
scopus_import: '1'
status: public
title: End-to-end optimization of metasurfaces for imaging with compressed sensing
type: journal_article
user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd
year: '2024'
...
---
_id: '12287'
abstract:
- lang: eng
  text: We present criteria for establishing a triangulation of a manifold. Given
    a manifold M, a simplicial complex A, and a map H from the underlying space of
    A to M, our criteria are presented in local coordinate charts for M, and ensure
    that H is a homeomorphism. These criteria do not require a differentiable structure,
    or even an explicit metric on M. No Delaunay property of A is assumed. The result
    provides a triangulation guarantee for algorithms that construct a simplicial
    complex by working in local coordinate patches. Because the criteria are easily
    verified in such a setting, they are expected to be of general use.
acknowledgement: "This work has been funded by the European Research Council under
  the European Union’s ERC Grant Agreement number 339025 GUDHI (Algorithmic Foundations
  of Geometric Understanding in Higher Dimensions). Arijit Ghosh is supported by Ramanujan
  Fellowship (No. SB/S2/RJN-064/2015). Part of this work was done when Arijit Ghosh
  was a Researcher at Max-Planck-Institute for Informatics, Germany, supported by
  the IndoGerman Max Planck Center for Computer Science (IMPECS). Mathijs Wintraecken
  also received funding from the European Union’s Horizon 2020 research and innovation
  programme under the Marie Skłodowska-Curie grant agreement No. 754411 and the Austrian
  Science Fund (FWF): M-3073. A part of the results described in this paper were presented
  at SoCG 2018 and in [3]. \r\nOpen access funding provided by the Austrian Science
  Fund (FWF)."
article_processing_charge: No
article_type: original
author:
- first_name: Jean-Daniel
  full_name: Boissonnat, Jean-Daniel
  last_name: Boissonnat
- first_name: Ramsay
  full_name: Dyer, Ramsay
  last_name: Dyer
- first_name: Arijit
  full_name: Ghosh, Arijit
  last_name: Ghosh
- first_name: Mathijs
  full_name: Wintraecken, Mathijs
  id: 307CFBC8-F248-11E8-B48F-1D18A9856A87
  last_name: Wintraecken
  orcid: 0000-0002-7472-2220
citation:
  ama: Boissonnat J-D, Dyer R, Ghosh A, Wintraecken M. Local criteria for triangulating
    general manifolds. <i>Discrete &#38; Computational Geometry</i>. 2023;69:156-191.
    doi:<a href="https://doi.org/10.1007/s00454-022-00431-7">10.1007/s00454-022-00431-7</a>
  apa: Boissonnat, J.-D., Dyer, R., Ghosh, A., &#38; Wintraecken, M. (2023). Local
    criteria for triangulating general manifolds. <i>Discrete &#38; Computational
    Geometry</i>. Springer Nature. <a href="https://doi.org/10.1007/s00454-022-00431-7">https://doi.org/10.1007/s00454-022-00431-7</a>
  chicago: Boissonnat, Jean-Daniel, Ramsay Dyer, Arijit Ghosh, and Mathijs Wintraecken.
    “Local Criteria for Triangulating General Manifolds.” <i>Discrete &#38; Computational
    Geometry</i>. Springer Nature, 2023. <a href="https://doi.org/10.1007/s00454-022-00431-7">https://doi.org/10.1007/s00454-022-00431-7</a>.
  ieee: J.-D. Boissonnat, R. Dyer, A. Ghosh, and M. Wintraecken, “Local criteria for
    triangulating general manifolds,” <i>Discrete &#38; Computational Geometry</i>,
    vol. 69. Springer Nature, pp. 156–191, 2023.
  ista: Boissonnat J-D, Dyer R, Ghosh A, Wintraecken M. 2023. Local criteria for triangulating
    general manifolds. Discrete &#38; Computational Geometry. 69, 156–191.
  mla: Boissonnat, Jean-Daniel, et al. “Local Criteria for Triangulating General Manifolds.”
    <i>Discrete &#38; Computational Geometry</i>, vol. 69, Springer Nature, 2023,
    pp. 156–91, doi:<a href="https://doi.org/10.1007/s00454-022-00431-7">10.1007/s00454-022-00431-7</a>.
  short: J.-D. Boissonnat, R. Dyer, A. Ghosh, M. Wintraecken, Discrete &#38; Computational
    Geometry 69 (2023) 156–191.
corr_author: '1'
date_created: 2023-01-16T10:04:06Z
date_published: 2023-01-01T00:00:00Z
date_updated: 2025-04-14T07:44:00Z
day: '01'
ddc:
- '510'
department:
- _id: HeEd
doi: 10.1007/s00454-022-00431-7
ec_funded: 1
external_id:
  isi:
  - '000862193600001'
file:
- access_level: open_access
  checksum: 46352e0ee71e460848f88685ca852681
  content_type: application/pdf
  creator: dernst
  date_created: 2023-02-02T11:01:10Z
  date_updated: 2023-02-02T11:01:10Z
  file_id: '12488'
  file_name: 2023_DiscreteCompGeometry_Boissonnat.pdf
  file_size: 582850
  relation: main_file
  success: 1
file_date_updated: 2023-02-02T11:01:10Z
fulldoi: https://doi.org/10.1007/s00454-022-00431-7
has_accepted_license: '1'
intvolume: '        69'
isi: 1
keyword:
- Computational Theory and Mathematics
- Discrete Mathematics and Combinatorics
- Geometry and Topology
- Theoretical Computer Science
language:
- iso: eng
month: '01'
oa: 1
oa_version: Published Version
page: 156-191
project:
- _id: 260C2330-B435-11E9-9278-68D0E5697425
  call_identifier: H2020
  grant_number: '754411'
  name: ISTplus - Postdoctoral Fellowships
- _id: fc390959-9c52-11eb-aca3-afa58bd282b2
  grant_number: M03073
  name: Learning and triangulating manifolds via collapses
publication: Discrete & Computational Geometry
publication_identifier:
  eissn:
  - 1432-0444
  issn:
  - 0179-5376
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Local criteria for triangulating general manifolds
tmp:
  image: /images/cc_by.png
  legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
  name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
  short: CC BY (4.0)
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 69
year: '2023'
...
---
_id: '14499'
abstract:
- lang: eng
  text: "An n-vertex graph is called C-Ramsey if it has no clique or independent set
    of size Clog2n (i.e., if it has near-optimal Ramsey behavior). In this paper,
    we study edge statistics in Ramsey graphs, in particular obtaining very precise
    control of the distribution of the number of edges in a random vertex subset of
    a C-Ramsey graph. This brings together two ongoing lines of research: the study
    of ‘random-like’ properties of Ramsey graphs and the study of small-ball probability
    for low-degree polynomials of independent random variables.\r\n\r\nThe proof proceeds
    via an ‘additive structure’ dichotomy on the degree sequence and involves a wide
    range of different tools from Fourier analysis, random matrix theory, the theory
    of Boolean functions, probabilistic combinatorics and low-rank approximation.
    In particular, a key ingredient is a new sharpened version of the quadratic Carbery–Wright
    theorem on small-ball probability for polynomials of Gaussians, which we believe
    is of independent interest. One of the consequences of our result is the resolution
    of an old conjecture of Erdős and McKay, for which Erdős reiterated in several
    of his open problem collections and for which he offered one of his notorious
    monetary prizes."
acknowledgement: Kwan was supported for part of this work by ERC Starting Grant ‘RANDSTRUCT’
  No. 101076777. Sah and Sawhney were supported by NSF Graduate Research Fellowship
  Program DGE-2141064. Sah was supported by the PD Soros Fellowship. Sauermann was
  supported by NSF Award DMS-2100157, and for part of this work by a Sloan Research
  Fellowship.
article_number: e21
article_processing_charge: Yes
article_type: original
arxiv: 1
author:
- 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: Lisa
  full_name: Sauermann, Lisa
  last_name: Sauermann
- first_name: Mehtaab
  full_name: Sawhney, Mehtaab
  last_name: Sawhney
citation:
  ama: Kwan MA, Sah A, Sauermann L, Sawhney M. Anticoncentration in Ramsey graphs
    and a proof of the Erdős–McKay conjecture. <i>Forum of Mathematics, Pi</i>. 2023;11.
    doi:<a href="https://doi.org/10.1017/fmp.2023.17">10.1017/fmp.2023.17</a>
  apa: Kwan, M. A., Sah, A., Sauermann, L., &#38; Sawhney, M. (2023). Anticoncentration
    in Ramsey graphs and a proof of the Erdős–McKay conjecture. <i>Forum of Mathematics,
    Pi</i>. Cambridge University Press. <a href="https://doi.org/10.1017/fmp.2023.17">https://doi.org/10.1017/fmp.2023.17</a>
  chicago: Kwan, Matthew Alan, Ashwin Sah, Lisa Sauermann, and Mehtaab Sawhney. “Anticoncentration
    in Ramsey Graphs and a Proof of the Erdős–McKay Conjecture.” <i>Forum of Mathematics,
    Pi</i>. Cambridge University Press, 2023. <a href="https://doi.org/10.1017/fmp.2023.17">https://doi.org/10.1017/fmp.2023.17</a>.
  ieee: M. A. Kwan, A. Sah, L. Sauermann, and M. Sawhney, “Anticoncentration in Ramsey
    graphs and a proof of the Erdős–McKay conjecture,” <i>Forum of Mathematics, Pi</i>,
    vol. 11. Cambridge University Press, 2023.
  ista: Kwan MA, Sah A, Sauermann L, Sawhney M. 2023. Anticoncentration in Ramsey
    graphs and a proof of the Erdős–McKay conjecture. Forum of Mathematics, Pi. 11,
    e21.
  mla: Kwan, Matthew Alan, et al. “Anticoncentration in Ramsey Graphs and a Proof
    of the Erdős–McKay Conjecture.” <i>Forum of Mathematics, Pi</i>, vol. 11, e21,
    Cambridge University Press, 2023, doi:<a href="https://doi.org/10.1017/fmp.2023.17">10.1017/fmp.2023.17</a>.
  short: M.A. Kwan, A. Sah, L. Sauermann, M. Sawhney, Forum of Mathematics, Pi 11
    (2023).
corr_author: '1'
date_created: 2023-11-07T09:02:48Z
date_published: 2023-08-24T00:00:00Z
date_updated: 2025-09-09T13:16:15Z
day: '24'
ddc:
- '510'
department:
- _id: MaKw
doi: 10.1017/fmp.2023.17
external_id:
  arxiv:
  - '2208.02874'
  isi:
  - '001123866200001'
file:
- access_level: open_access
  checksum: 54b824098d59073cc87a308d458b0a3e
  content_type: application/pdf
  creator: dernst
  date_created: 2023-11-07T09:16:23Z
  date_updated: 2023-11-07T09:16:23Z
  file_id: '14500'
  file_name: 2023_ForumMathematics_Kwan.pdf
  file_size: 1218719
  relation: main_file
  success: 1
file_date_updated: 2023-11-07T09:16:23Z
fulldoi: https://doi.org/10.1017/fmp.2023.17
has_accepted_license: '1'
intvolume: '        11'
isi: 1
keyword:
- Discrete Mathematics and Combinatorics
- Geometry and Topology
- Mathematical Physics
- Statistics and Probability
- Algebra and Number Theory
- Analysis
language:
- iso: eng
month: '08'
oa: 1
oa_version: Published Version
project:
- _id: bd95085b-d553-11ed-ba76-e55d3349be45
  grant_number: '101076777'
  name: Randomness and structure in combinatorics
publication: Forum of Mathematics, Pi
publication_identifier:
  issn:
  - 2050-5086
publication_status: published
publisher: Cambridge University Press
quality_controlled: '1'
scopus_import: '1'
status: public
title: Anticoncentration in Ramsey graphs and a proof of the Erdős–McKay 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: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 11
year: '2023'
...
---
OA_place: repository
OA_type: green
_id: '22046'
abstract:
- lang: eng
  text: We show that solutions to the Ablowitz–Ladik system converge to solutions
    of the cubic nonlinear Schrödinger equation for merely L2 initial data. Furthermore,
    we consider initial data for this lattice model that excites Fourier modes near
    both critical points of the discrete dispersion relation and demonstrate convergence
    to a decoupled system of nonlinear Schrödinger equations.
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. Continuum limit for the Ablowitz–Ladik system.
    <i>Nonlinearity</i>. 2023;36(7):3751-3775. doi:<a href="https://doi.org/10.1088/1361-6544/acd978">10.1088/1361-6544/acd978</a>
  apa: Killip, R., Ouyang, Z., Vişan, M., &#38; Wu, L. (2023). Continuum limit for
    the Ablowitz–Ladik system. <i>Nonlinearity</i>. IOP Publishing. <a href="https://doi.org/10.1088/1361-6544/acd978">https://doi.org/10.1088/1361-6544/acd978</a>
  chicago: Killip, Rowan, Zhimeng Ouyang, Monica Vişan, and Lei Wu. “Continuum Limit
    for the Ablowitz–Ladik System.” <i>Nonlinearity</i>. IOP Publishing, 2023. <a
    href="https://doi.org/10.1088/1361-6544/acd978">https://doi.org/10.1088/1361-6544/acd978</a>.
  ieee: R. Killip, Z. Ouyang, M. Vişan, and L. Wu, “Continuum limit for the Ablowitz–Ladik
    system,” <i>Nonlinearity</i>, vol. 36, no. 7. IOP Publishing, pp. 3751–3775, 2023.
  ista: Killip R, Ouyang Z, Vişan M, Wu L. 2023. Continuum limit for the Ablowitz–Ladik
    system. Nonlinearity. 36(7), 3751–3775.
  mla: Killip, Rowan, et al. “Continuum Limit for the Ablowitz–Ladik System.” <i>Nonlinearity</i>,
    vol. 36, no. 7, IOP Publishing, 2023, pp. 3751–75, doi:<a href="https://doi.org/10.1088/1361-6544/acd978">10.1088/1361-6544/acd978</a>.
  short: R. Killip, Z. Ouyang, M. Vişan, L. Wu, Nonlinearity 36 (2023) 3751–3775.
das_tickbox: '1'
date_created: 2026-06-19T07:49:24Z
date_published: 2023-06-09T00:00:00Z
date_updated: 2026-06-25T07:54:44Z
day: '09'
doi: 10.1088/1361-6544/acd978
extern: '1'
external_id:
  arxiv:
  - '2206.02720'
fulldoi: https://doi.org/10.1088/1361-6544/acd978
intvolume: '        36'
issue: '7'
keyword:
- Ablowitz–Ladik
- continuum limit
- cubic NLS
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://doi.org/10.48550/arXiv.2206.02720
mathsc:
- 35Q55
- 37K05
- 37K10
month: '06'
oa: 1
oa_version: Preprint
page: 3751-3775
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: Continuum limit for the Ablowitz–Ladik system
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 36
year: '2023'
...
---
_id: '14466'
abstract:
- lang: eng
  text: The first long-lived turbulent structures observable in planar shear flows
    take the form of localized stripes, inclined with respect to the mean flow direction.
    The dynamics of these stripes is central to transition, and recent studies proposed
    an analogy to directed percolation where the stripes’ proliferation is ultimately
    responsible for the turbulence becoming sustained. In the present study we focus
    on the internal stripe dynamics as well as on the eventual stripe expansion, and
    we compare the underlying mechanisms in pressure- and shear-driven planar flows,
    respectively, plane-Poiseuille and plane-Couette flow. Despite the similarities
    of the overall laminar–turbulence patterns, the stripe proliferation processes
    in the two cases are fundamentally different. Starting from the growth and sustenance
    of individual stripes, we find that in plane-Couette flow new streaks are created
    stochastically throughout the stripe whereas in plane-Poiseuille flow streak creation
    is deterministic and occurs locally at the downstream tip. Because of the up/downstream
    symmetry, Couette stripes, in contrast to Poiseuille stripes, have two weak and
    two strong laminar turbulent interfaces. These differences in symmetry as well
    as in internal growth give rise to two fundamentally different stripe splitting
    mechanisms. In plane-Poiseuille flow splitting is connected to the elongational
    growth of the original stripe, and it results from a break-off/shedding of the
    stripe's tail. In plane-Couette flow splitting follows from a broadening of the
    original stripe and a division along the stripe into two slimmer stripes.
acknowledgement: E.M. acknowledges funding from the ISTplus fellowship programme.
  G.Y. and B.H. acknowledge a grant from the Simons Foundation (662960, BH).
article_number: A21
article_processing_charge: Yes (via OA deal)
article_type: original
arxiv: 1
author:
- first_name: Elena
  full_name: Marensi, Elena
  id: 0BE7553A-1004-11EA-B805-18983DDC885E
  last_name: Marensi
  orcid: 0000-0001-7173-4923
- first_name: Gökhan
  full_name: Yalniz, Gökhan
  id: 66E74FA2-D8BF-11E9-8249-8DE2E5697425
  last_name: Yalniz
  orcid: 0000-0002-8490-9312
- first_name: Björn
  full_name: Hof, Björn
  id: 3A374330-F248-11E8-B48F-1D18A9856A87
  last_name: Hof
  orcid: 0000-0003-2057-2754
citation:
  ama: Marensi E, Yalniz G, Hof B. Dynamics and proliferation of turbulent stripes
    in plane-Poiseuille and plane-Couette flows. <i>Journal of Fluid Mechanics</i>.
    2023;974. doi:<a href="https://doi.org/10.1017/jfm.2023.780">10.1017/jfm.2023.780</a>
  apa: Marensi, E., Yalniz, G., &#38; Hof, B. (2023). Dynamics and proliferation of
    turbulent stripes in plane-Poiseuille and plane-Couette flows. <i>Journal of Fluid
    Mechanics</i>. Cambridge University Press. <a href="https://doi.org/10.1017/jfm.2023.780">https://doi.org/10.1017/jfm.2023.780</a>
  chicago: Marensi, Elena, Gökhan Yalniz, and Björn Hof. “Dynamics and Proliferation
    of Turbulent Stripes in Plane-Poiseuille and Plane-Couette Flows.” <i>Journal
    of Fluid Mechanics</i>. Cambridge University Press, 2023. <a href="https://doi.org/10.1017/jfm.2023.780">https://doi.org/10.1017/jfm.2023.780</a>.
  ieee: E. Marensi, G. Yalniz, and B. Hof, “Dynamics and proliferation of turbulent
    stripes in plane-Poiseuille and plane-Couette flows,” <i>Journal of Fluid Mechanics</i>,
    vol. 974. Cambridge University Press, 2023.
  ista: Marensi E, Yalniz G, Hof B. 2023. Dynamics and proliferation of turbulent
    stripes in plane-Poiseuille and plane-Couette flows. Journal of Fluid Mechanics.
    974, A21.
  mla: Marensi, Elena, et al. “Dynamics and Proliferation of Turbulent Stripes in
    Plane-Poiseuille and Plane-Couette Flows.” <i>Journal of Fluid Mechanics</i>,
    vol. 974, A21, Cambridge University Press, 2023, doi:<a href="https://doi.org/10.1017/jfm.2023.780">10.1017/jfm.2023.780</a>.
  short: E. Marensi, G. Yalniz, B. Hof, Journal of Fluid Mechanics 974 (2023).
corr_author: '1'
date_created: 2023-10-30T09:32:28Z
date_published: 2023-11-10T00:00:00Z
date_updated: 2026-09-02T08:16:31Z
day: '10'
ddc:
- '530'
department:
- _id: GradSch
- _id: BjHo
doi: 10.1017/jfm.2023.780
external_id:
  arxiv:
  - '2212.12406'
  isi:
  - '001088363700001'
file:
- access_level: open_access
  checksum: 17c64c1fb0d5f73252364bf98b0b9e1a
  content_type: application/pdf
  creator: dernst
  date_created: 2024-02-15T09:05:21Z
  date_updated: 2024-02-15T09:05:21Z
  file_id: '14996'
  file_name: 2023_JourFluidMechanics_Marensi.pdf
  file_size: 2804641
  relation: main_file
  success: 1
file_date_updated: 2024-02-15T09:05:21Z
fulldoi: https://doi.org/10.1017/jfm.2023.780
has_accepted_license: '1'
intvolume: '       974'
isi: 1
keyword:
- turbulence
- transition to turbulence
- patterns
language:
- iso: eng
month: '11'
oa: 1
oa_version: Published Version
project:
- _id: 238598C6-32DE-11EA-91FC-C7463DDC885E
  grant_number: '662960'
  name: Revisiting the Turbulence Problem Using Statistical Mechanics
publication: Journal of Fluid Mechanics
publication_identifier:
  eissn:
  - 1469-7645
  issn:
  - 0022-1120
publication_status: published
publisher: Cambridge University Press
quality_controlled: '1'
related_material:
  record:
  - id: '19684'
    relation: dissertation_contains
    status: public
scopus_import: '1'
status: public
title: Dynamics and proliferation of turbulent stripes in plane-Poiseuille and plane-Couette
  flows
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: 974
year: '2023'
...
---
_id: '12129'
abstract:
- lang: eng
  text: 'Given a finite point set P in general position in the plane, a full triangulation
    of P is a maximal straight-line embedded plane graph on P. A partial triangulation
    of P is a full triangulation of some subset P′ of P containing all extreme points
    in P. A bistellar flip on a partial triangulation either flips an edge (called
    edge flip), removes a non-extreme point of degree 3, or adds a point in P∖P′ as
    vertex of degree 3. The bistellar flip graph has all partial triangulations as
    vertices, and a pair of partial triangulations is adjacent if they can be obtained
    from one another by a bistellar flip. The edge flip graph is defined with full
    triangulations as vertices, and edge flips determining the adjacencies. Lawson
    showed in the early seventies that these graphs are connected. The goal of this
    paper is to investigate the structure of these graphs, with emphasis on their
    vertex connectivity. For sets P of n points in the plane in general position,
    we show that the edge flip graph is ⌈n/2−2⌉-vertex connected, and the bistellar
    flip graph is (n−3)-vertex connected; both results are tight. The latter bound
    matches the situation for the subfamily of regular triangulations (i.e., partial
    triangulations obtained by lifting the points to 3-space and projecting back the
    lower convex hull), where (n−3)-vertex connectivity has been known since the late
    eighties through the secondary polytope due to Gelfand, Kapranov, & Zelevinsky
    and Balinski’s Theorem. For the edge flip-graph, we additionally show that the
    vertex connectivity is at least as large as (and hence equal to) the minimum degree
    (i.e., the minimum number of flippable edges in any full triangulation), provided
    that n is large enough. Our methods also yield several other results: (i) The
    edge flip graph can be covered by graphs of polytopes of dimension ⌈n/2−2⌉ (products
    of associahedra) and the bistellar flip graph can be covered by graphs of polytopes
    of dimension n−3 (products of secondary polytopes). (ii) A partial triangulation
    is regular, if it has distance n−3 in the Hasse diagram of the partial order of
    partial subdivisions from the trivial subdivision. (iii) All partial triangulations
    of a point set are regular iff the partial order of partial subdivisions has height
    n−3. (iv) There are arbitrarily large sets P with non-regular partial triangulations
    and such that every proper subset has only regular triangulations, i.e., there
    are no small certificates for the existence of non-regular triangulations.'
acknowledgement: "This is a full and revised version of [38] (on partial triangulations)
  in Proceedings of the 36th Annual International Symposium on Computational Geometry
  (SoCG‘20) and of some of the results in [37] (on full triangulations) in Proceedings
  of the 31st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA‘20).\r\nThis
  research started at the 11th Gremo’s Workshop on Open Problems (GWOP), Alp Sellamatt,
  Switzerland, June 24–28, 2013, motivated by a question posed by Filip Mori´c on
  full triangulations. Research was supported by the Swiss National Science Foundation
  within the collaborative DACH project Arrangements and Drawings as SNSF Project
  200021E-171681, and by IST Austria and Berlin Free University during a sabbatical
  stay of the second author. We thank Michael Joswig, Jesús De Loera, and Francisco
  Santos for helpful discussions on the topics of this paper, and Daniel Bertschinger
  and Valentin Stoppiello for carefully reading earlier versions and for many helpful
  comments.\r\nOpen access funding provided by the Swiss Federal Institute of Technology
  Zürich"
article_processing_charge: No
article_type: original
author:
- first_name: Uli
  full_name: Wagner, Uli
  id: 36690CA2-F248-11E8-B48F-1D18A9856A87
  last_name: Wagner
  orcid: 0000-0002-1494-0568
- first_name: Emo
  full_name: Welzl, Emo
  last_name: Welzl
citation:
  ama: Wagner U, Welzl E. Connectivity of triangulation flip graphs in the plane.
    <i>Discrete &#38; Computational Geometry</i>. 2022;68(4):1227-1284. doi:<a href="https://doi.org/10.1007/s00454-022-00436-2">10.1007/s00454-022-00436-2</a>
  apa: Wagner, U., &#38; Welzl, E. (2022). Connectivity of triangulation flip graphs
    in the plane. <i>Discrete &#38; Computational Geometry</i>. Springer Nature. <a
    href="https://doi.org/10.1007/s00454-022-00436-2">https://doi.org/10.1007/s00454-022-00436-2</a>
  chicago: Wagner, Uli, and Emo Welzl. “Connectivity of Triangulation Flip Graphs
    in the Plane.” <i>Discrete &#38; Computational Geometry</i>. Springer Nature,
    2022. <a href="https://doi.org/10.1007/s00454-022-00436-2">https://doi.org/10.1007/s00454-022-00436-2</a>.
  ieee: U. Wagner and E. Welzl, “Connectivity of triangulation flip graphs in the
    plane,” <i>Discrete &#38; Computational Geometry</i>, vol. 68, no. 4. Springer
    Nature, pp. 1227–1284, 2022.
  ista: Wagner U, Welzl E. 2022. Connectivity of triangulation flip graphs in the
    plane. Discrete &#38; Computational Geometry. 68(4), 1227–1284.
  mla: Wagner, Uli, and Emo Welzl. “Connectivity of Triangulation Flip Graphs in the
    Plane.” <i>Discrete &#38; Computational Geometry</i>, vol. 68, no. 4, Springer
    Nature, 2022, pp. 1227–84, doi:<a href="https://doi.org/10.1007/s00454-022-00436-2">10.1007/s00454-022-00436-2</a>.
  short: U. Wagner, E. Welzl, Discrete &#38; Computational Geometry 68 (2022) 1227–1284.
corr_author: '1'
date_created: 2023-01-12T12:02:28Z
date_published: 2022-11-14T00:00:00Z
date_updated: 2025-07-10T11:54:56Z
day: '14'
ddc:
- '510'
department:
- _id: UlWa
doi: 10.1007/s00454-022-00436-2
external_id:
  isi:
  - '000883222200003'
file:
- access_level: open_access
  checksum: 307e879d09e52eddf5b225d0aaa9213a
  content_type: application/pdf
  creator: dernst
  date_created: 2023-01-23T11:10:03Z
  date_updated: 2023-01-23T11:10:03Z
  file_id: '12345'
  file_name: 2022_DiscreteCompGeometry_Wagner.pdf
  file_size: 1747581
  relation: main_file
  success: 1
file_date_updated: 2023-01-23T11:10:03Z
fulldoi: https://doi.org/10.1007/s00454-022-00436-2
has_accepted_license: '1'
intvolume: '        68'
isi: 1
issue: '4'
keyword:
- Computational Theory and Mathematics
- Discrete Mathematics and Combinatorics
- Geometry and Topology
- Theoretical Computer Science
language:
- iso: eng
month: '11'
oa: 1
oa_version: Published Version
page: 1227-1284
publication: Discrete & Computational Geometry
publication_identifier:
  eissn:
  - 1432-0444
  issn:
  - 0179-5376
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
related_material:
  record:
  - id: '7807'
    relation: earlier_version
    status: public
  - id: '7990'
    relation: earlier_version
    status: public
scopus_import: '1'
status: public
title: Connectivity of triangulation flip graphs in the plane
tmp:
  image: /images/cc_by.png
  legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
  name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
  short: CC BY (4.0)
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 68
year: '2022'
...
---
_id: '12148'
abstract:
- lang: eng
  text: 'We prove a general local law for Wigner matrices that optimally handles observables
    of arbitrary rank and thus unifies the well-known averaged and isotropic local
    laws. As an application, we prove a central limit theorem in quantum unique ergodicity
    (QUE): that is, we show that the quadratic forms of a general deterministic matrix
    A on the bulk eigenvectors of a Wigner matrix have approximately Gaussian fluctuation.
    For the bulk spectrum, we thus generalise our previous result [17] as valid for
    test matrices A of large rank as well as the result of Benigni and Lopatto [7]
    as valid for specific small-rank observables.'
acknowledgement: L.E. acknowledges support by ERC Advanced Grant ‘RMTBeyond’ No. 101020331.
  D.S. acknowledges the support of Dr. Max Rössler, the Walter Haefner Foundation
  and the ETH Zürich Foundation.
article_number: e96
article_processing_charge: No
article_type: original
author:
- first_name: Giorgio
  full_name: Cipolloni, Giorgio
  id: 42198EFA-F248-11E8-B48F-1D18A9856A87
  last_name: Cipolloni
  orcid: 0000-0002-4901-7992
- first_name: László
  full_name: Erdös, László
  id: 4DBD5372-F248-11E8-B48F-1D18A9856A87
  last_name: Erdös
  orcid: 0000-0001-5366-9603
- first_name: Dominik J
  full_name: Schröder, Dominik J
  id: 408ED176-F248-11E8-B48F-1D18A9856A87
  last_name: Schröder
  orcid: 0000-0002-2904-1856
citation:
  ama: Cipolloni G, Erdös L, Schröder DJ. Rank-uniform local law for Wigner matrices.
    <i>Forum of Mathematics, Sigma</i>. 2022;10. doi:<a href="https://doi.org/10.1017/fms.2022.86">10.1017/fms.2022.86</a>
  apa: Cipolloni, G., Erdös, L., &#38; Schröder, D. J. (2022). Rank-uniform local
    law for Wigner matrices. <i>Forum of Mathematics, Sigma</i>. Cambridge University
    Press. <a href="https://doi.org/10.1017/fms.2022.86">https://doi.org/10.1017/fms.2022.86</a>
  chicago: Cipolloni, Giorgio, László Erdös, and Dominik J Schröder. “Rank-Uniform
    Local Law for Wigner Matrices.” <i>Forum of Mathematics, Sigma</i>. Cambridge
    University Press, 2022. <a href="https://doi.org/10.1017/fms.2022.86">https://doi.org/10.1017/fms.2022.86</a>.
  ieee: G. Cipolloni, L. Erdös, and D. J. Schröder, “Rank-uniform local law for Wigner
    matrices,” <i>Forum of Mathematics, Sigma</i>, vol. 10. Cambridge University Press,
    2022.
  ista: Cipolloni G, Erdös L, Schröder DJ. 2022. Rank-uniform local law for Wigner
    matrices. Forum of Mathematics, Sigma. 10, e96.
  mla: Cipolloni, Giorgio, et al. “Rank-Uniform Local Law for Wigner Matrices.” <i>Forum
    of Mathematics, Sigma</i>, vol. 10, e96, Cambridge University Press, 2022, doi:<a
    href="https://doi.org/10.1017/fms.2022.86">10.1017/fms.2022.86</a>.
  short: G. Cipolloni, L. Erdös, D.J. Schröder, Forum of Mathematics, Sigma 10 (2022).
corr_author: '1'
date_created: 2023-01-12T12:07:30Z
date_published: 2022-10-27T00:00:00Z
date_updated: 2025-04-14T07:57:18Z
day: '27'
ddc:
- '510'
department:
- _id: LaEr
doi: 10.1017/fms.2022.86
ec_funded: 1
external_id:
  isi:
  - '000873719200001'
file:
- access_level: open_access
  checksum: 94a049aeb1eea5497aa097712a73c400
  content_type: application/pdf
  creator: dernst
  date_created: 2023-01-24T10:02:40Z
  date_updated: 2023-01-24T10:02:40Z
  file_id: '12356'
  file_name: 2022_ForumMath_Cipolloni.pdf
  file_size: 817089
  relation: main_file
  success: 1
file_date_updated: 2023-01-24T10:02:40Z
fulldoi: https://doi.org/10.1017/fms.2022.86
has_accepted_license: '1'
intvolume: '        10'
isi: 1
keyword:
- Computational Mathematics
- Discrete Mathematics and Combinatorics
- Geometry and Topology
- Mathematical Physics
- Statistics and Probability
- Algebra and Number Theory
- Theoretical Computer Science
- Analysis
language:
- iso: eng
month: '10'
oa: 1
oa_version: Published Version
project:
- _id: 62796744-2b32-11ec-9570-940b20777f1d
  call_identifier: H2020
  grant_number: '101020331'
  name: Random matrices beyond Wigner-Dyson-Mehta
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: Rank-uniform local law for Wigner matrices
tmp:
  image: /images/cc_by.png
  legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
  name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
  short: CC BY (4.0)
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 10
year: '2022'
...
---
_id: '12216'
abstract:
- lang: eng
  text: Many trace inequalities can be expressed either as concavity/convexity theorems
    or as monotonicity theorems. A classic example is the joint convexity of the quantum
    relative entropy which is equivalent to the Data Processing Inequality. The latter
    says that quantum operations can never increase the relative entropy. The monotonicity
    versions often have many advantages, and often have direct physical application,
    as in the example just mentioned. Moreover, the monotonicity results are often
    valid for a larger class of maps than, say, quantum operations (which are completely
    positive). In this paper we prove several new monotonicity results, the first
    of which is a monotonicity theorem that has as a simple corollary a celebrated
    concavity theorem of Epstein. Our starting points are the monotonicity versions
    of the Lieb Concavity and the Lieb Convexity Theorems. We also give two new proofs
    of these in their general forms using interpolation. We then prove our new monotonicity
    theorems by several duality arguments.
acknowledgement: Work partially supported by the Lise Meitner fellowship, Austrian
  Science Fund (FWF) M3337.
article_processing_charge: Yes (via OA deal)
article_type: original
author:
- first_name: Eric A.
  full_name: Carlen, Eric A.
  last_name: Carlen
- first_name: Haonan
  full_name: Zhang, Haonan
  id: D8F41E38-9E66-11E9-A9E2-65C2E5697425
  last_name: Zhang
citation:
  ama: Carlen EA, Zhang H. Monotonicity versions of Epstein’s concavity theorem and
    related inequalities. <i>Linear Algebra and its Applications</i>. 2022;654:289-310.
    doi:<a href="https://doi.org/10.1016/j.laa.2022.09.001">10.1016/j.laa.2022.09.001</a>
  apa: Carlen, E. A., &#38; Zhang, H. (2022). Monotonicity versions of Epstein’s concavity
    theorem and related inequalities. <i>Linear Algebra and Its Applications</i>.
    Elsevier. <a href="https://doi.org/10.1016/j.laa.2022.09.001">https://doi.org/10.1016/j.laa.2022.09.001</a>
  chicago: Carlen, Eric A., and Haonan Zhang. “Monotonicity Versions of Epstein’s
    Concavity Theorem and Related Inequalities.” <i>Linear Algebra and Its Applications</i>.
    Elsevier, 2022. <a href="https://doi.org/10.1016/j.laa.2022.09.001">https://doi.org/10.1016/j.laa.2022.09.001</a>.
  ieee: E. A. Carlen and H. Zhang, “Monotonicity versions of Epstein’s concavity theorem
    and related inequalities,” <i>Linear Algebra and its Applications</i>, vol. 654.
    Elsevier, pp. 289–310, 2022.
  ista: Carlen EA, Zhang H. 2022. Monotonicity versions of Epstein’s concavity theorem
    and related inequalities. Linear Algebra and its Applications. 654, 289–310.
  mla: Carlen, Eric A., and Haonan Zhang. “Monotonicity Versions of Epstein’s Concavity
    Theorem and Related Inequalities.” <i>Linear Algebra and Its Applications</i>,
    vol. 654, Elsevier, 2022, pp. 289–310, doi:<a href="https://doi.org/10.1016/j.laa.2022.09.001">10.1016/j.laa.2022.09.001</a>.
  short: E.A. Carlen, H. Zhang, Linear Algebra and Its Applications 654 (2022) 289–310.
corr_author: '1'
date_created: 2023-01-16T09:46:38Z
date_published: 2022-12-01T00:00:00Z
date_updated: 2025-04-14T13:05:27Z
day: '01'
ddc:
- '510'
department:
- _id: JaMa
doi: 10.1016/j.laa.2022.09.001
external_id:
  isi:
  - '000860689600014'
file:
- access_level: open_access
  checksum: cf3cb7e7e34baa967849f01d8f0c1ae4
  content_type: application/pdf
  creator: dernst
  date_created: 2023-01-27T08:08:39Z
  date_updated: 2023-01-27T08:08:39Z
  file_id: '12415'
  file_name: 2022_LinearAlgebra_Carlen.pdf
  file_size: 441184
  relation: main_file
  success: 1
file_date_updated: 2023-01-27T08:08:39Z
fulldoi: https://doi.org/10.1016/j.laa.2022.09.001
has_accepted_license: '1'
intvolume: '       654'
isi: 1
keyword:
- Discrete Mathematics and Combinatorics
- Geometry and Topology
- Numerical Analysis
- Algebra and Number Theory
language:
- iso: eng
month: '12'
oa: 1
oa_version: Published Version
page: 289-310
project:
- _id: eb958bca-77a9-11ec-83b8-c565cb50d8d6
  grant_number: M03337
  name: Curvature-dimension in noncommutative analysis
publication: Linear Algebra and its Applications
publication_identifier:
  issn:
  - 0024-3795
publication_status: published
publisher: Elsevier
quality_controlled: '1'
scopus_import: '1'
status: public
title: Monotonicity versions of Epstein's concavity theorem and related inequalities
tmp:
  image: /images/cc_by.png
  legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
  name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
  short: CC BY (4.0)
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 654
year: '2022'
...
---
_id: '10588'
abstract:
- lang: eng
  text: We prove the Sobolev-to-Lipschitz property for metric measure spaces satisfying
    the quasi curvature-dimension condition recently introduced in Milman (Commun
    Pure Appl Math, to appear). We provide several applications to properties of the
    corresponding heat semigroup. In particular, under the additional assumption of
    infinitesimal Hilbertianity, we show the Varadhan short-time asymptotics for the
    heat semigroup with respect to the distance, and prove the irreducibility of the
    heat semigroup. These results apply in particular to large classes of (ideal)
    sub-Riemannian manifolds.
acknowledgement: "The authors are grateful to Dr. Bang-Xian Han for helpful discussions
  on the Sobolev-to-Lipschitz property on metric measure spaces, and to Professor
  Kazuhiro Kuwae, Professor Emanuel Milman, Dr. Giorgio Stefani, and Dr. Gioacchino
  Antonelli for reading a preliminary version of this work and for their valuable
  comments and suggestions. Finally, they wish to express their gratitude to two anonymous
  Reviewers whose suggestions improved the presentation of this work.\r\n\r\nL.D.S.
  gratefully acknowledges funding of his position by the Austrian Science Fund (FWF)
  grant F65, and by the European Research Council (ERC, grant No. 716117, awarded
  to Prof. Dr. Jan Maas).\r\n\r\nK.S. gratefully acknowledges funding by: the JSPS
  Overseas Research Fellowships, Grant Nr. 290142; World Premier International Research
  Center Initiative (WPI), MEXT, Japan; JSPS Grant-in-Aid for Scientific Research
  on Innovative Areas “Discrete Geometric Analysis for Materials Design”, Grant Number
  17H06465; and the Alexander von Humboldt Stiftung, Humboldt-Forschungsstipendium."
article_processing_charge: Yes (via OA deal)
article_type: original
arxiv: 1
author:
- first_name: Lorenzo
  full_name: Dello Schiavo, Lorenzo
  id: ECEBF480-9E4F-11EA-B557-B0823DDC885E
  last_name: Dello Schiavo
  orcid: 0000-0002-9881-6870
- first_name: Kohei
  full_name: Suzuki, Kohei
  last_name: Suzuki
citation:
  ama: Dello Schiavo L, Suzuki K. Sobolev-to-Lipschitz property on QCD- spaces and
    applications. <i>Mathematische Annalen</i>. 2022;384:1815-1832. doi:<a href="https://doi.org/10.1007/s00208-021-02331-2">10.1007/s00208-021-02331-2</a>
  apa: Dello Schiavo, L., &#38; Suzuki, K. (2022). Sobolev-to-Lipschitz property on
    QCD- spaces and applications. <i>Mathematische Annalen</i>. Springer Nature. <a
    href="https://doi.org/10.1007/s00208-021-02331-2">https://doi.org/10.1007/s00208-021-02331-2</a>
  chicago: Dello Schiavo, Lorenzo, and Kohei Suzuki. “Sobolev-to-Lipschitz Property
    on QCD- Spaces and Applications.” <i>Mathematische Annalen</i>. Springer Nature,
    2022. <a href="https://doi.org/10.1007/s00208-021-02331-2">https://doi.org/10.1007/s00208-021-02331-2</a>.
  ieee: L. Dello Schiavo and K. Suzuki, “Sobolev-to-Lipschitz property on QCD- spaces
    and applications,” <i>Mathematische Annalen</i>, vol. 384. Springer Nature, pp.
    1815–1832, 2022.
  ista: Dello Schiavo L, Suzuki K. 2022. Sobolev-to-Lipschitz property on QCD- spaces
    and applications. Mathematische Annalen. 384, 1815–1832.
  mla: Dello Schiavo, Lorenzo, and Kohei Suzuki. “Sobolev-to-Lipschitz Property on
    QCD- Spaces and Applications.” <i>Mathematische Annalen</i>, vol. 384, Springer
    Nature, 2022, pp. 1815–32, doi:<a href="https://doi.org/10.1007/s00208-021-02331-2">10.1007/s00208-021-02331-2</a>.
  short: L. Dello Schiavo, K. Suzuki, Mathematische Annalen 384 (2022) 1815–1832.
corr_author: '1'
date_created: 2022-01-02T23:01:35Z
date_published: 2022-12-01T00:00:00Z
date_updated: 2025-04-14T07:27:46Z
day: '01'
ddc:
- '510'
department:
- _id: JaMa
doi: 10.1007/s00208-021-02331-2
ec_funded: 1
external_id:
  arxiv:
  - '2110.05137'
  isi:
  - '000734150200001'
file:
- access_level: open_access
  checksum: 2593abbf195e38efa93b6006b1e90eb1
  content_type: application/pdf
  creator: alisjak
  date_created: 2022-01-03T11:08:31Z
  date_updated: 2022-01-03T11:08:31Z
  file_id: '10596'
  file_name: 2021_MathAnn_DelloSchiavo.pdf
  file_size: 410090
  relation: main_file
  success: 1
file_date_updated: 2022-01-03T11:08:31Z
fulldoi: https://doi.org/10.1007/s00208-021-02331-2
has_accepted_license: '1'
intvolume: '       384'
isi: 1
keyword:
- quasi curvature-dimension condition
- sub-riemannian geometry
- Sobolev-to-Lipschitz property
- Varadhan short-time asymptotics
language:
- iso: eng
month: '12'
oa: 1
oa_version: Published Version
page: 1815-1832
project:
- _id: 256E75B8-B435-11E9-9278-68D0E5697425
  call_identifier: H2020
  grant_number: '716117'
  name: Optimal Transport and Stochastic Dynamics
- _id: fc31cba2-9c52-11eb-aca3-ff467d239cd2
  grant_number: F6504
  name: Taming Complexity in Partial Differential Systems
- _id: B67AFEDC-15C9-11EA-A837-991A96BB2854
  name: IST Austria Open Access Fund
publication: Mathematische Annalen
publication_identifier:
  eissn:
  - 1432-1807
  issn:
  - 0025-5831
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Sobolev-to-Lipschitz property on QCD- spaces and applications
tmp:
  image: /images/cc_by.png
  legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
  name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
  short: CC BY (4.0)
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 384
year: '2022'
...
---
_id: '10643'
abstract:
- lang: eng
  text: "We prove a generalised super-adiabatic theorem for extended fermionic systems
    assuming a spectral gap only in the bulk. More precisely, we assume that the infinite
    system has a unique ground state and that the corresponding Gelfand–Naimark–Segal
    Hamiltonian has a spectral gap above its eigenvalue zero. Moreover, we show that
    a similar adiabatic theorem also holds in the bulk of finite systems up to errors
    that vanish faster than any inverse power of the system size, although the corresponding
    finite-volume Hamiltonians need not have a spectral gap.\r\n\r\n"
acknowledgement: J.H. acknowledges partial financial support by the ERC Advanced Grant
  ‘RMTBeyond’ No. 101020331. Support for publication costs from the Deutsche Forschungsgemeinschaft
  and the Open Access Publishing Fund of the University of Tübingen is gratefully
  acknowledged.
article_number: e4
article_processing_charge: Yes
article_type: original
arxiv: 1
author:
- first_name: Sven Joscha
  full_name: Henheik, Sven Joscha
  id: 31d731d7-d235-11ea-ad11-b50331c8d7fb
  last_name: Henheik
  orcid: 0000-0003-1106-327X
- first_name: Stefan
  full_name: Teufel, Stefan
  last_name: Teufel
citation:
  ama: 'Henheik SJ, Teufel S. Adiabatic theorem in the thermodynamic limit: Systems
    with a gap in the bulk. <i>Forum of Mathematics, Sigma</i>. 2022;10. doi:<a href="https://doi.org/10.1017/fms.2021.80">10.1017/fms.2021.80</a>'
  apa: 'Henheik, S. J., &#38; Teufel, S. (2022). Adiabatic theorem in the thermodynamic
    limit: Systems with a gap in the bulk. <i>Forum of Mathematics, Sigma</i>. Cambridge
    University Press. <a href="https://doi.org/10.1017/fms.2021.80">https://doi.org/10.1017/fms.2021.80</a>'
  chicago: 'Henheik, Sven Joscha, and Stefan Teufel. “Adiabatic Theorem in the Thermodynamic
    Limit: Systems with a Gap in the Bulk.” <i>Forum of Mathematics, Sigma</i>. Cambridge
    University Press, 2022. <a href="https://doi.org/10.1017/fms.2021.80">https://doi.org/10.1017/fms.2021.80</a>.'
  ieee: 'S. J. Henheik and S. Teufel, “Adiabatic theorem in the thermodynamic limit:
    Systems with a gap in the bulk,” <i>Forum of Mathematics, Sigma</i>, vol. 10.
    Cambridge University Press, 2022.'
  ista: 'Henheik SJ, Teufel S. 2022. Adiabatic theorem in the thermodynamic limit:
    Systems with a gap in the bulk. Forum of Mathematics, Sigma. 10, e4.'
  mla: 'Henheik, Sven Joscha, and Stefan Teufel. “Adiabatic Theorem in the Thermodynamic
    Limit: Systems with a Gap in the Bulk.” <i>Forum of Mathematics, Sigma</i>, vol.
    10, e4, Cambridge University Press, 2022, doi:<a href="https://doi.org/10.1017/fms.2021.80">10.1017/fms.2021.80</a>.'
  short: S.J. Henheik, S. Teufel, Forum of Mathematics, Sigma 10 (2022).
corr_author: '1'
date_created: 2022-01-18T16:18:51Z
date_published: 2022-01-18T00:00:00Z
date_updated: 2025-04-14T07:57:17Z
day: '18'
ddc:
- '510'
department:
- _id: GradSch
- _id: LaEr
doi: 10.1017/fms.2021.80
ec_funded: 1
external_id:
  arxiv:
  - '2012.15239'
  isi:
  - '000743615000001'
file:
- access_level: open_access
  checksum: 87592a755adcef22ea590a99dc728dd3
  content_type: application/pdf
  creator: cchlebak
  date_created: 2022-01-19T09:27:43Z
  date_updated: 2022-01-19T09:27:43Z
  file_id: '10646'
  file_name: 2022_ForumMathSigma_Henheik.pdf
  file_size: 705323
  relation: main_file
  success: 1
file_date_updated: 2022-01-19T09:27:43Z
fulldoi: https://doi.org/10.1017/fms.2021.80
has_accepted_license: '1'
intvolume: '        10'
isi: 1
keyword:
- computational mathematics
- discrete mathematics and combinatorics
- geometry and topology
- mathematical physics
- statistics and probability
- algebra and number theory
- theoretical computer science
- analysis
language:
- iso: eng
month: '01'
oa: 1
oa_version: Published Version
project:
- _id: 62796744-2b32-11ec-9570-940b20777f1d
  call_identifier: H2020
  grant_number: '101020331'
  name: Random matrices beyond Wigner-Dyson-Mehta
publication: Forum of Mathematics, Sigma
publication_identifier:
  eissn:
  - 2050-5094
publication_status: published
publisher: Cambridge University Press
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Adiabatic theorem in the thermodynamic limit: Systems with a gap in the bulk'
tmp:
  image: /images/cc_by.png
  legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
  name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
  short: CC BY (4.0)
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 10
year: '2022'
...
---
_id: '12286'
abstract:
- lang: eng
  text: "Inspired by the study of loose cycles in hypergraphs, we define the loose
    core in hypergraphs as a structurewhich mirrors the close relationship between
    cycles and $2$-cores in graphs. We prove that in the $r$-uniform binomial random
    hypergraph $H^r(n,p)$, the order of the loose core undergoes a phase transition
    at a certain critical threshold and determine this order, as well as the number
    of edges, asymptotically in the subcritical and supercritical regimes.&#x0D;\r\nOur
    main tool is an algorithm called CoreConstruct, which enables us to analyse a
    peeling process for the loose core. By analysing this algorithm we determine the
    asymptotic degree distribution of vertices in the loose core and in particular
    how many vertices and edges the loose core contains. As a corollary we obtain
    an improved upper bound on the length of the longest loose cycle in $H^r(n,p)$."
acknowledgement: 'Supported by Austrian Science Fund (FWF): I3747, W1230.'
article_number: P4.13
article_processing_charge: No
article_type: original
author:
- first_name: Oliver
  full_name: Cooley, Oliver
  id: 43f4ddd0-a46b-11ec-8df6-ef3703bd721d
  last_name: Cooley
- first_name: Mihyun
  full_name: Kang, Mihyun
  last_name: Kang
- first_name: Julian
  full_name: Zalla, Julian
  last_name: Zalla
citation:
  ama: Cooley O, Kang M, Zalla J. Loose cores and cycles in random hypergraphs. <i>The
    Electronic Journal of Combinatorics</i>. 2022;29(4). doi:<a href="https://doi.org/10.37236/10794">10.37236/10794</a>
  apa: Cooley, O., Kang, M., &#38; Zalla, J. (2022). Loose cores and cycles in random
    hypergraphs. <i>The Electronic Journal of Combinatorics</i>. Electronic Journal
    of Combinatorics. <a href="https://doi.org/10.37236/10794">https://doi.org/10.37236/10794</a>
  chicago: Cooley, Oliver, Mihyun Kang, and Julian Zalla. “Loose Cores and Cycles
    in Random Hypergraphs.” <i>The Electronic Journal of Combinatorics</i>. Electronic
    Journal of Combinatorics, 2022. <a href="https://doi.org/10.37236/10794">https://doi.org/10.37236/10794</a>.
  ieee: O. Cooley, M. Kang, and J. Zalla, “Loose cores and cycles in random hypergraphs,”
    <i>The Electronic Journal of Combinatorics</i>, vol. 29, no. 4. Electronic Journal
    of Combinatorics, 2022.
  ista: Cooley O, Kang M, Zalla J. 2022. Loose cores and cycles in random hypergraphs.
    The Electronic Journal of Combinatorics. 29(4), P4.13.
  mla: Cooley, Oliver, et al. “Loose Cores and Cycles in Random Hypergraphs.” <i>The
    Electronic Journal of Combinatorics</i>, vol. 29, no. 4, P4.13, Electronic Journal
    of Combinatorics, 2022, doi:<a href="https://doi.org/10.37236/10794">10.37236/10794</a>.
  short: O. Cooley, M. Kang, J. Zalla, The Electronic Journal of Combinatorics 29
    (2022).
date_created: 2023-01-16T10:03:57Z
date_published: 2022-10-21T00:00:00Z
date_updated: 2026-08-04T09:29:03Z
day: '21'
ddc:
- '510'
department:
- _id: MaKw
doi: 10.37236/10794
external_id:
  isi:
  - '000876763300001'
file:
- access_level: open_access
  checksum: 00122b2459f09b5ae43073bfba565e94
  content_type: application/pdf
  creator: dernst
  date_created: 2023-01-30T11:45:13Z
  date_updated: 2023-01-30T11:45:13Z
  file_id: '12462'
  file_name: 2022_ElecJournCombinatorics_Cooley_Kang_Zalla.pdf
  file_size: 626953
  relation: main_file
  success: 1
file_date_updated: 2023-01-30T11:45:13Z
fulldoi: https://doi.org/10.37236/10794
has_accepted_license: '1'
intvolume: '        29'
isi: 1
issue: '4'
keyword:
- Computational Theory and Mathematics
- Geometry and Topology
- Theoretical Computer Science
- Applied Mathematics
- Discrete Mathematics and Combinatorics
language:
- iso: eng
license: https://creativecommons.org/licenses/by-nd/4.0/
month: '10'
oa: 1
oa_version: Published Version
publication: The Electronic Journal of Combinatorics
publication_identifier:
  eissn:
  - 1077-8926
publication_status: published
publisher: Electronic Journal of Combinatorics
quality_controlled: '1'
scopus_import: '1'
status: public
title: Loose cores and cycles in random hypergraphs
tmp:
  image: /image/cc_by_nd.png
  legal_code_url: https://creativecommons.org/licenses/by-nd/4.0/legalcode
  name: Creative Commons Attribution-NoDerivatives 4.0 International (CC BY-ND 4.0)
  short: CC BY-ND (4.0)
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 29
year: '2022'
...
---
_id: '11135'
abstract:
- lang: eng
  text: We consider a correlated NxN Hermitian random matrix with a polynomially decaying
    metric correlation structure. By calculating the trace of the moments of the matrix
    and using the summable decay of the cumulants, we show that its operator norm
    is stochastically dominated by one.
article_number: '2250036'
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Jana
  full_name: Reker, Jana
  id: e796e4f9-dc8d-11ea-abe3-97e26a0323e9
  last_name: Reker
citation:
  ama: 'Reker J. On the operator norm of a Hermitian random matrix with correlated
    entries. <i>Random Matrices: Theory and Applications</i>. 2022;11(4). doi:<a href="https://doi.org/10.1142/s2010326322500368">10.1142/s2010326322500368</a>'
  apa: 'Reker, J. (2022). On the operator norm of a Hermitian random matrix with correlated
    entries. <i>Random Matrices: Theory and Applications</i>. World Scientific Publishing.
    <a href="https://doi.org/10.1142/s2010326322500368">https://doi.org/10.1142/s2010326322500368</a>'
  chicago: 'Reker, Jana. “On the Operator Norm of a Hermitian Random Matrix with Correlated
    Entries.” <i>Random Matrices: Theory and Applications</i>. World Scientific Publishing,
    2022. <a href="https://doi.org/10.1142/s2010326322500368">https://doi.org/10.1142/s2010326322500368</a>.'
  ieee: 'J. Reker, “On the operator norm of a Hermitian random matrix with correlated
    entries,” <i>Random Matrices: Theory and Applications</i>, vol. 11, no. 4. World
    Scientific Publishing, 2022.'
  ista: 'Reker J. 2022. On the operator norm of a Hermitian random matrix with correlated
    entries. Random Matrices: Theory and Applications. 11(4), 2250036.'
  mla: 'Reker, Jana. “On the Operator Norm of a Hermitian Random Matrix with Correlated
    Entries.” <i>Random Matrices: Theory and Applications</i>, vol. 11, no. 4, 2250036,
    World Scientific Publishing, 2022, doi:<a href="https://doi.org/10.1142/s2010326322500368">10.1142/s2010326322500368</a>.'
  short: 'J. Reker, Random Matrices: Theory and Applications 11 (2022).'
corr_author: '1'
date_created: 2022-04-08T07:11:12Z
date_published: 2022-10-01T00:00:00Z
date_updated: 2026-10-02T11:31:29Z
day: '01'
department:
- _id: GradSch
- _id: LaEr
doi: 10.1142/s2010326322500368
external_id:
  arxiv:
  - '2103.03906'
  isi:
  - '000848873800001'
fulldoi: https://doi.org/10.1142/s2010326322500368
intvolume: '        11'
isi: 1
issue: '4'
keyword:
- Discrete Mathematics and Combinatorics
- Statistics
- Probability and Uncertainty
- Statistics and Probability
- Algebra and Number Theory
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: ' https://doi.org/10.48550/arXiv.2103.03906'
month: '10'
oa: 1
oa_version: Preprint
publication: 'Random Matrices: Theory and Applications'
publication_identifier:
  eissn:
  - 2010-3271
  issn:
  - 2010-3263
publication_status: published
publisher: World Scientific Publishing
quality_controlled: '1'
related_material:
  record:
  - id: '17164'
    relation: dissertation_contains
    status: public
scopus_import: '1'
status: public
title: On the operator norm of a Hermitian random matrix with correlated entries
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 11
year: '2022'
...
---
_id: '11446'
abstract:
- lang: eng
  text: Suppose that n is not a prime power and not twice a prime power. We prove
    that for any Hausdorff compactum X with a free action of the symmetric group Sn,
    there exists an Sn-equivariant map X→Rn whose image avoids the diagonal {(x,x,…,x)∈Rn∣x∈R}.
    Previously, the special cases of this statement for certain X were usually proved
    using the equivartiant obstruction theory. Such calculations are difficult and
    may become infeasible past the first (primary) obstruction. We take a different
    approach which allows us to prove the vanishing of all obstructions simultaneously.
    The essential step in the proof is classifying the possible degrees of Sn-equivariant
    maps from the boundary ∂Δn−1 of (n−1)-simplex to itself. Existence of equivariant
    maps between spaces is important for many questions arising from discrete mathematics
    and geometry, such as Kneser’s conjecture, the Square Peg conjecture, the Splitting
    Necklace problem, and the Topological Tverberg conjecture, etc. We demonstrate
    the utility of our result applying it to one such question, a specific instance
    of envy-free division problem.
acknowledgement: S. Avvakumov has received funding from the European Research Council
  under the European Union’s Seventh Framework Programme ERC Grant agreement ERC StG
  716424–CASe. S. Kudrya was supported by the Austrian Academic Exchange Service (OeAD),
  ICM-2019-13577.
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Sergey
  full_name: Avvakumov, Sergey
  id: 3827DAC8-F248-11E8-B48F-1D18A9856A87
  last_name: Avvakumov
  orcid: 0000-0002-7840-5062
- first_name: Sergey
  full_name: Kudrya, Sergey
  id: ecf01965-d252-11ea-95a5-8ada5f6c6a67
  last_name: Kudrya
citation:
  ama: Avvakumov S, Kudrya S. Vanishing of all equivariant obstructions and the mapping
    degree. <i>Discrete &#38; Computational Geometry</i>. 2021;66(3):1202-1216. doi:<a
    href="https://doi.org/10.1007/s00454-021-00299-z">10.1007/s00454-021-00299-z</a>
  apa: Avvakumov, S., &#38; Kudrya, S. (2021). Vanishing of all equivariant obstructions
    and the mapping degree. <i>Discrete &#38; Computational Geometry</i>. Springer
    Nature. <a href="https://doi.org/10.1007/s00454-021-00299-z">https://doi.org/10.1007/s00454-021-00299-z</a>
  chicago: Avvakumov, Sergey, and Sergey Kudrya. “Vanishing of All Equivariant Obstructions
    and the Mapping Degree.” <i>Discrete &#38; Computational Geometry</i>. Springer
    Nature, 2021. <a href="https://doi.org/10.1007/s00454-021-00299-z">https://doi.org/10.1007/s00454-021-00299-z</a>.
  ieee: S. Avvakumov and S. Kudrya, “Vanishing of all equivariant obstructions and
    the mapping degree,” <i>Discrete &#38; Computational Geometry</i>, vol. 66, no.
    3. Springer Nature, pp. 1202–1216, 2021.
  ista: Avvakumov S, Kudrya S. 2021. Vanishing of all equivariant obstructions and
    the mapping degree. Discrete &#38; Computational Geometry. 66(3), 1202–1216.
  mla: Avvakumov, Sergey, and Sergey Kudrya. “Vanishing of All Equivariant Obstructions
    and the Mapping Degree.” <i>Discrete &#38; Computational Geometry</i>, vol. 66,
    no. 3, Springer Nature, 2021, pp. 1202–16, doi:<a href="https://doi.org/10.1007/s00454-021-00299-z">10.1007/s00454-021-00299-z</a>.
  short: S. Avvakumov, S. Kudrya, Discrete &#38; Computational Geometry 66 (2021)
    1202–1216.
corr_author: '1'
date_created: 2022-06-17T08:45:15Z
date_published: 2021-10-01T00:00:00Z
date_updated: 2025-04-14T09:10:06Z
day: '01'
doi: 10.1007/s00454-021-00299-z
extern: '1'
external_id:
  arxiv:
  - '1910.12628'
fulldoi: https://doi.org/10.1007/s00454-021-00299-z
intvolume: '        66'
issue: '3'
keyword:
- Computational Theory and Mathematics
- Discrete Mathematics and Combinatorics
- Geometry and Topology
- Theoretical Computer Science
language:
- iso: eng
month: '10'
oa_version: Preprint
page: 1202-1216
publication: Discrete & Computational Geometry
publication_identifier:
  eissn:
  - 1432-0444
  issn:
  - 0179-5376
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
related_material:
  record:
  - id: '8182'
    relation: earlier_version
    status: public
scopus_import: '1'
status: public
title: Vanishing of all equivariant obstructions and the mapping degree
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 66
year: '2021'
...
