---
OA_place: publisher
OA_type: hybrid
_id: '18527'
abstract:
- lang: eng
text: "Context. Galaxies evolve through a dynamic exchange of material with their
immediate surrounding environment, the so-called circumgalactic medium (CGM).
Understanding the physics of gas flows and the nature of the CGM is fundamental
to studying galaxy evolution, especially at 4 ≤ z ≤ 6 (i.e., after the Epoch of
Reionization) when galaxies rapidly assembled their masses and reached their chemical
maturity. Galactic outflows are predicted to enrich the CGM with metals, although
it has also been suggested that gas stripping in systems undergoing a major merger
may play a role.\r\n\r\nAims. In this work, we explore the metal enrichment of
the medium around merging galaxies at z ∼ 4.5, observed by the ALMA Large Program
to INvestigate [CII] at Early times (ALPINE). To do so, we study the nature of
the [CII] 158 μm emission in the CGM around these systems, using simulations to
help disentangle the mechanisms contributing to the CGM metal pollution.\r\n\r\nMethods.
By adopting an updated classification of major merger systems in the ALPINE survey,
we selected and analyzed merging galaxies whose components can be spatially and/or
spectrally resolved in a robust way. This makes it possible to distinguish between
the [CII] emission coming from the single components of the system and that coming
from the system as a whole. We also made use of the dustyGadget cosmological simulation
to select synthetic analogs of observed galaxies and guide the interpretation
of the observational results.\r\n\r\nResults. We find a large diffuse [CII] envelope
(≳20 kpc) embedding all the merging systems, with at least 25% of the total [CII]
emission coming from the medium between the galaxies. Using predictions from dustyGadget,
we suggest that this emission has a multi-fold nature, with dynamical interactions
between galaxies playing a major role in stripping the gas and enriching the medium
with heavy elements."
acknowledgement: 'The authors would like to thank the anonymous referee for the useful
suggestions which improved this article. This paper is based on data obtained with
the ALMA Observatory, under Large Program 2017.1.00428.L. ALMA is a partnership
of ESO (representing its member states), NSF (USA), and NINS (Japan), together with
NRC (Canada), MOST 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. CDC would like to thank the GESO group at the European Southern Observatory
(ESO) for the useful discussions while preparing this manuscript. The simulated
data underlying this article will be shared on reasonable request to the corresponding
author. CDC acknowledged support from Sapienza University of Rome program “Bando
per la mobilità individuale all’estero” (DR n.1607 del 14 June 2021) during the
visiting period (June-November 2022) at ESO Garching, Germany. LG and RS acknowledge
support from the PRIN 2022 MUR project 2022CB3PJ3 – First Light And Galaxy aSsembly
(FLAGS) funded by the European Union – Next Generation EU, and from the Amaldi Research
Center funded by the MIUR program “Dipartimento di Eccellenza” (CUP:B81I18001170001).
MR acknowledges support from the Narodowe Centrum Nauki (UMO-2020/38/E/ST9/00077)
and support from the Foundation for Polish Science (FNP) under the program START
063.2023. We have benefited from the publicly available software CASA and CARTA
and programming language Python, including the numpy (https://numpy.org), matplotlib
(https://matplotlib.org), scipy (https://scipy.org) and astropy (http://www.astropy.org)
packages. '
article_number: A255
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Claudia
full_name: Di Cesare, Claudia
id: 2d002343-372f-11ef-98ec-a164d20427cb
last_name: Di Cesare
- first_name: M.
full_name: Ginolfi, M.
last_name: Ginolfi
- first_name: L.
full_name: Graziani, L.
last_name: Graziani
- first_name: R.
full_name: Schneider, R.
last_name: Schneider
- first_name: M.
full_name: Romano, M.
last_name: Romano
- first_name: G.
full_name: Popping, G.
last_name: Popping
citation:
ama: Di Cesare C, Ginolfi M, Graziani L, Schneider R, Romano M, Popping G. Carbon
envelopes around merging galaxies at z ~ 4.5. Astronomy & Astrophysics.
2024;690. doi:10.1051/0004-6361/202449164
apa: Di Cesare, C., Ginolfi, M., Graziani, L., Schneider, R., Romano, M., &
Popping, G. (2024). Carbon envelopes around merging galaxies at z ~ 4.5. Astronomy
& Astrophysics. EDP Sciences. https://doi.org/10.1051/0004-6361/202449164
chicago: Di Cesare, Claudia, M. Ginolfi, L. Graziani, R. Schneider, M. Romano, and
G. Popping. “Carbon Envelopes around Merging Galaxies at z ~ 4.5.” Astronomy
& Astrophysics. EDP Sciences, 2024. https://doi.org/10.1051/0004-6361/202449164.
ieee: C. Di Cesare, M. Ginolfi, L. Graziani, R. Schneider, M. Romano, and G. Popping,
“Carbon envelopes around merging galaxies at z ~ 4.5,” Astronomy & Astrophysics,
vol. 690. EDP Sciences, 2024.
ista: Di Cesare C, Ginolfi M, Graziani L, Schneider R, Romano M, Popping G. 2024.
Carbon envelopes around merging galaxies at z ~ 4.5. Astronomy & Astrophysics.
690, A255.
mla: Di Cesare, Claudia, et al. “Carbon Envelopes around Merging Galaxies at z ~
4.5.” Astronomy & Astrophysics, vol. 690, A255, EDP Sciences, 2024,
doi:10.1051/0004-6361/202449164.
short: C. Di Cesare, M. Ginolfi, L. Graziani, R. Schneider, M. Romano, G. Popping,
Astronomy & Astrophysics 690 (2024).
corr_author: '1'
das_tickbox: '1'
date_created: 2024-11-10T23:02:00Z
date_published: 2024-10-01T00:00:00Z
date_updated: 2026-07-08T06:44:39Z
day: '01'
ddc:
- '520'
department:
- _id: JoMa
doi: 10.1051/0004-6361/202449164
external_id:
arxiv:
- '2401.03020'
isi:
- '001332213700013'
file:
- access_level: open_access
checksum: 24c65a64047aba156f39b01425269bdb
content_type: application/pdf
creator: dernst
date_created: 2024-11-11T08:54:11Z
date_updated: 2024-11-11T08:54:11Z
file_id: '18533'
file_name: 2024_AstronomyAstrophysics_diCesare.pdf
file_size: 8033864
relation: main_file
success: 1
file_date_updated: 2024-11-11T08:54:11Z
has_accepted_license: '1'
intvolume: ' 690'
isi: 1
language:
- iso: eng
month: '10'
oa: 1
oa_version: Published Version
publication: Astronomy & Astrophysics
publication_identifier:
eissn:
- 1432-0746
issn:
- 0004-6361
publication_status: published
publisher: EDP Sciences
quality_controlled: '1'
scopus_import: '1'
status: public
title: Carbon envelopes around merging galaxies at z ~ 4.5
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: 690
year: '2024'
...
---
OA_place: publisher
OA_type: hybrid
_id: '22154'
abstract:
- lang: eng
text: 'The inertia bound and ratio bound (also known as the Cvetković bound and
Hoffman bound) are two fundamental inequalities in spectral graph theory, giving
upper bounds on the independence number a(G) of a graph G in terms of spectral
information about a weighted adjacency matrix of G. For both inequalities, given
a graph G, one needs to make a judicious choice of weighted adjacency matrix to
obtain as strong a bound as possible. While there is a well‐established theory
surrounding the ratio bound, the inertia bound is much more mysterious, and its
limits are rather unclear. In fact, only recently did Sinkovic find the first
example of a graph for which the inertia bound is not tight (for any weighted
adjacency matrix), answering a longstanding question of Godsil. We show that the
inertia bound can be extremely far from tight, and in fact can significantly underperform
the ratio bound: for example, one of our results is that for infinitely many n,
there is an n‐vertex graph for which even the unweighted ratio bound can prove
a(G)<4n^3/4, but the inertia bound is always at least n/4. In particular, these
results address questions of Rooney, Sinkovic, and Wocjan–Elphick–Abiad.'
acknowledgement: Open access funding provided by Eidgenossische Technische Hochschule
Zurich.
article_processing_charge: Yes (via OA deal)
article_type: original
arxiv: 1
author:
- first_name: Matthew
full_name: Kwan, Matthew
last_name: Kwan
- first_name: Yuval
full_name: Wigderson, Yuval
id: 2d0023a0-1567-11f0-833d-d5c1e476d4b5
last_name: Wigderson
citation:
ama: Kwan M, Wigderson Y. The inertia bound is far from tight. Bulletin of the
London Mathematical Society. 2024;56(10):3196-3208. doi:10.1112/blms.13127
apa: Kwan, M., & Wigderson, Y. (2024). The inertia bound is far from tight.
Bulletin of the London Mathematical Society. Wiley. https://doi.org/10.1112/blms.13127
chicago: Kwan, Matthew, and Yuval Wigderson. “The Inertia Bound Is Far from Tight.”
Bulletin of the London Mathematical Society. Wiley, 2024. https://doi.org/10.1112/blms.13127.
ieee: M. Kwan and Y. Wigderson, “The inertia bound is far from tight,” Bulletin
of the London Mathematical Society, vol. 56, no. 10. Wiley, pp. 3196–3208,
2024.
ista: Kwan M, Wigderson Y. 2024. The inertia bound is far from tight. Bulletin of
the London Mathematical Society. 56(10), 3196–3208.
mla: Kwan, Matthew, and Yuval Wigderson. “The Inertia Bound Is Far from Tight.”
Bulletin of the London Mathematical Society, vol. 56, no. 10, Wiley, 2024,
pp. 3196–208, doi:10.1112/blms.13127.
short: M. Kwan, Y. Wigderson, Bulletin of the London Mathematical Society 56 (2024)
3196–3208.
date_created: 2026-06-29T10:49:18Z
date_published: 2024-10-01T00:00:00Z
date_updated: 2026-07-08T07:34:36Z
day: '01'
ddc:
- '500'
doi: 10.1112/blms.13127
extern: '1'
external_id:
arxiv:
- '2312.04925'
intvolume: ' 56'
issue: '10'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1112/blms.13127
month: '10'
oa: 1
oa_version: Published Version
page: 3196-3208
publication: Bulletin of the London Mathematical Society
publication_identifier:
eissn:
- 1469-2120
issn:
- 0024-6093
publication_status: published
publisher: Wiley
quality_controlled: '1'
scopus_import: '1'
status: public
title: The inertia bound is far from tight
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: 56
year: '2024'
...
---
APC_amount: 2933,65 EUR
DOAJ_listed: '1'
OA_place: publisher
OA_type: gold
_id: '14980'
abstract:
- lang: eng
text: Precision sensing and manipulation of milligram-scale mechanical oscillators
has attracted growing interest in the fields of table-top explorations of gravity
and tests of quantum mechanics at macroscopic scales. Torsional oscillators present
an opportunity in this regard due to their remarked isolation from environmental
noise. For torsional motion, an effective employment of optical cavities to enhance
optomechanical interactions—as already established for linear oscillators—so far
faced certain challenges. Here, we propose a concept for sensing and manipulating
torsional motion, where exclusively the torsional rotations of a pendulum are
mapped onto the path length of a single two-mirror optical cavity. The concept
inherently alleviates many limitations of previous approaches. A proof-of-principle
experiment is conducted with a rigidly controlled pendulum to explore the sensing
aspects of the concept and to identify practical limitations in a potential state-of-the
art setup. Based on this study, we anticipate development of precision torque
sensors utilizing torsional pendulums that can support sensitivities below 10−19Nm/√Hz,
while the motion of the pendulums are dominated by quantum radiation pressure
noise at sub-microwatts of incoming laser power. These developments will provide
horizons for experiments at the interface of quantum mechanics and gravity.
acknowledgement: "We thank Pere Rosselló for his contributions to the initial modeling
of the presented sensing technique. This work was supported by Institute of Science
and Technology Austria, and\r\nthe European Research Council under Grant No. 101087907
(ERC CoG QuHAMP)."
article_number: '013141'
article_processing_charge: Yes
article_type: original
arxiv: 1
author:
- first_name: Sofya
full_name: Agafonova, Sofya
id: 09501ff6-dca7-11ea-a8ae-b3e0b9166e80
last_name: Agafonova
orcid: 0000-0003-0582-2946
- first_name: Umang
full_name: Mishra, Umang
id: 4328fa4c-f128-11eb-9611-c107b0fe4d51
last_name: Mishra
- first_name: Fritz R
full_name: Diorico, Fritz R
id: 2E054C4C-F248-11E8-B48F-1D18A9856A87
last_name: Diorico
orcid: 0000-0002-4947-8924
- first_name: Onur
full_name: Hosten, Onur
id: 4C02D85E-F248-11E8-B48F-1D18A9856A87
last_name: Hosten
orcid: 0000-0002-2031-204X
citation:
ama: Agafonova S, Mishra U, Diorico FR, Hosten O. Zigzag optical cavity for sensing
and controlling torsional motion. Physical Review Research. 2024;6(1).
doi:10.1103/physrevresearch.6.013141
apa: Agafonova, S., Mishra, U., Diorico, F. R., & Hosten, O. (2024). Zigzag
optical cavity for sensing and controlling torsional motion. Physical Review
Research. American Physical Society. https://doi.org/10.1103/physrevresearch.6.013141
chicago: Agafonova, Sofia, Umang Mishra, Fritz R Diorico, and Onur Hosten. “Zigzag
Optical Cavity for Sensing and Controlling Torsional Motion.” Physical Review
Research. American Physical Society, 2024. https://doi.org/10.1103/physrevresearch.6.013141.
ieee: S. Agafonova, U. Mishra, F. R. Diorico, and O. Hosten, “Zigzag optical cavity
for sensing and controlling torsional motion,” Physical Review Research,
vol. 6, no. 1. American Physical Society, 2024.
ista: Agafonova S, Mishra U, Diorico FR, Hosten O. 2024. Zigzag optical cavity for
sensing and controlling torsional motion. Physical Review Research. 6(1), 013141.
mla: Agafonova, Sofia, et al. “Zigzag Optical Cavity for Sensing and Controlling
Torsional Motion.” Physical Review Research, vol. 6, no. 1, 013141, American
Physical Society, 2024, doi:10.1103/physrevresearch.6.013141.
short: S. Agafonova, U. Mishra, F.R. Diorico, O. Hosten, Physical Review Research
6 (2024).
corr_author: '1'
das_tickbox: '0'
date_created: 2024-02-12T11:42:18Z
date_published: 2024-02-05T00:00:00Z
date_updated: 2026-07-08T07:52:51Z
day: '05'
ddc:
- '530'
department:
- _id: OnHo
doi: 10.1103/physrevresearch.6.013141
external_id:
arxiv:
- '2306.12804'
file:
- access_level: open_access
checksum: 3a39ebffb24c1cc1dd0b547a726dc52d
content_type: application/pdf
creator: dernst
date_created: 2024-02-12T11:46:50Z
date_updated: 2024-02-12T11:46:50Z
file_id: '14981'
file_name: 2024_PhysicalRevResearch_Agafonova.pdf
file_size: 1437167
relation: main_file
success: 1
file_date_updated: 2024-02-12T11:46:50Z
has_accepted_license: '1'
intvolume: ' 6'
issue: '1'
language:
- iso: eng
month: '02'
oa: 1
oa_version: Published Version
project:
- _id: bdb2a702-d553-11ed-ba76-f12e3e5a3bc6
grant_number: '101087907'
name: 'A quantum hybrid of atoms and milligram-scale pendulums: towards gravitational
quantum mechanics'
publication: Physical Review Research
publication_identifier:
eissn:
- 2643-1564
publication_status: published
publisher: American Physical Society
quality_controlled: '1'
researchdata_availability: no
scopus_import: '1'
status: public
supplementarymaterial: no
title: Zigzag optical cavity for sensing and controlling torsional motion
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: 68b8ca59-c5b3-11ee-8790-cd641c68093d
volume: 6
year: '2024'
...
---
APC_amount: 3393,38 EUR
DOAJ_listed: '1'
OA_place: publisher
OA_type: gold
_id: '14802'
abstract:
- lang: eng
text: Frequency-stable lasers form the back bone of precision measurements in science
and technology. Such lasers typically attain their stability through frequency
locking to reference cavities. State-of-the-art locking performances to date had
been achieved using frequency modulation based methods, complemented with active
drift cancellation systems. We demonstrate an all passive, modulation-free laser-cavity
locking technique (squash locking) that utilizes changes in spatial beam ellipticity
for error signal generation, and a coherent polarization post-selection for noise
resilience. By comparing two identically built proof-of-principle systems, we
show a frequency locking instability of 5×10−7 relative to
the cavity linewidth at 10 s averaging. The results surpass the demonstrated performances
of methods engineered over the last five decades, potentially enabling an advancement
in the precision control of lasers, while creating avenues for bridging the performance
gaps between industrial grade lasers with scientific ones due to the afforded
simplicity and scalability.
acknowledgement: We thank Rishabh Sahu and Sebastian Wald for technical contributions
to the experiment. Funding by Institute of Science and Technology Austria.
article_processing_charge: Yes
article_type: original
author:
- first_name: Fritz R
full_name: Diorico, Fritz R
id: 2E054C4C-F248-11E8-B48F-1D18A9856A87
last_name: Diorico
orcid: 0000-0002-4947-8924
- first_name: Artem
full_name: Zhutov, Artem
id: 0f02ed6a-b514-11ee-b891-8379c5f19cb7
last_name: Zhutov
- first_name: Onur
full_name: Hosten, Onur
id: 4C02D85E-F248-11E8-B48F-1D18A9856A87
last_name: Hosten
orcid: 0000-0002-2031-204X
citation:
ama: 'Diorico FR, Zhutov A, Hosten O. Laser-cavity locking utilizing beam ellipticity:
accessing the 10−7 instability scale relative to cavity linewidth.
Optica. 2024;11(1):26-31. doi:10.1364/optica.507451'
apa: 'Diorico, F. R., Zhutov, A., & Hosten, O. (2024). Laser-cavity locking
utilizing beam ellipticity: accessing the 10−7 instability scale relative
to cavity linewidth. Optica. Optica Publishing Group. https://doi.org/10.1364/optica.507451'
chicago: 'Diorico, Fritz R, Artem Zhutov, and Onur Hosten. “Laser-Cavity Locking
Utilizing Beam Ellipticity: Accessing the 10−7 Instability Scale Relative
to Cavity Linewidth.” Optica. Optica Publishing Group, 2024. https://doi.org/10.1364/optica.507451.'
ieee: 'F. R. Diorico, A. Zhutov, and O. Hosten, “Laser-cavity locking utilizing
beam ellipticity: accessing the 10−7 instability scale relative to
cavity linewidth,” Optica, vol. 11, no. 1. Optica Publishing Group, pp.
26–31, 2024.'
ista: 'Diorico FR, Zhutov A, Hosten O. 2024. Laser-cavity locking utilizing beam
ellipticity: accessing the 10−7 instability scale relative to cavity linewidth.
Optica. 11(1), 26–31.'
mla: 'Diorico, Fritz R., et al. “Laser-Cavity Locking Utilizing Beam Ellipticity:
Accessing the 10−7 Instability Scale Relative to Cavity Linewidth.”
Optica, vol. 11, no. 1, Optica Publishing Group, 2024, pp. 26–31, doi:10.1364/optica.507451.'
short: F.R. Diorico, A. Zhutov, O. Hosten, Optica 11 (2024) 26–31.
corr_author: '1'
das_tickbox: '1'
dataavailabilitystatement: Data underlying the results presented in this paper are
not publicly available at this time but may be obtained from the authors upon reasonable
request.
date_created: 2024-01-15T10:25:38Z
date_published: 2024-01-20T00:00:00Z
date_updated: 2026-07-08T08:25:12Z
day: '20'
ddc:
- '530'
department:
- _id: OnHo
doi: 10.1364/optica.507451
external_id:
isi:
- '001202817000004'
file:
- access_level: open_access
checksum: eb99ca7d0fe73e22f121875175546ed7
content_type: application/pdf
creator: dernst
date_created: 2024-01-17T08:53:16Z
date_updated: 2024-01-17T08:53:16Z
file_id: '14824'
file_name: 2023_Optica_Diorico.pdf
file_size: 4558986
relation: main_file
success: 1
file_date_updated: 2024-01-17T08:53:16Z
has_accepted_license: '1'
intvolume: ' 11'
isi: 1
issue: '1'
keyword:
- Atomic and Molecular Physics
- and Optics
- Electronic
- Optical and Magnetic Materials
language:
- iso: eng
month: '01'
oa: 1
oa_version: Published Version
page: 26-31
publication: Optica
publication_identifier:
issn:
- 2334-2536
publication_status: published
publisher: Optica Publishing Group
quality_controlled: '1'
researchdata_availability: upon request
scopus_import: '1'
status: public
supplementarymaterial: no
title: 'Laser-cavity locking utilizing beam ellipticity: accessing the 10−7
instability scale relative to cavity linewidth'
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: 68b8ca59-c5b3-11ee-8790-cd641c68093d
volume: 11
year: '2024'
...
---
OA_place: publisher
_id: '17225'
abstract:
- lang: eng
text: "This thesis describes the development of an atom interferometer designed
to exploit the\r\nadvantages of utilizing quantum entanglement for enhanced precision
measurements beyond\r\nthe standard quantum limit. While the project remains ongoing,
significant progress has been\r\nmade.\r\nA key contribution of this work is the
development of Quantrol, an experimental control\r\nsystem leveraging the ARTIQ
framework. This software enables precise timing and control\r\nwithout requiring
prior knowledge of ARTIQ’s implementation details or coding experience.\r\nThe
interface offers user friendly visual comprehension of the experimental sequence
and\r\nextended capabilities, allowing researchers to scan variables with a simple
click of a mouse.\r\nThe main proposed project is to implement atom interferometric
sequence with squeezed input\r\nstates inside of a dipole trap generated by a
high finesse cavity. The presence of the dipole\r\ntrap allows one dimensional
atomic cloud split while maintaining relatively strong confinement\r\nin other
directions.\r\nWe are currently able to trap and cool 87Rb atoms to few micro
kelvin temperatures, load\r\nthem into the dipole trap and state prepare them
to be used for squeezing and interferometric\r\nsequence."
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Vyacheslav
full_name: Li, Vyacheslav
id: 3A4FAA92-F248-11E8-B48F-1D18A9856A87
last_name: Li
citation:
ama: Li V. Towards a quantum entanglement enhanced atom interferomter. 2024. doi:10.15479/at:ista:17225
apa: Li, V. (2024). Towards a quantum entanglement enhanced atom interferomter.
Institute of Science and Technology Austria. https://doi.org/10.15479/at:ista:17225
chicago: Li, Vyacheslav. “Towards a Quantum Entanglement Enhanced Atom Interferomter.”
Institute of Science and Technology Austria, 2024. https://doi.org/10.15479/at:ista:17225.
ieee: V. Li, “Towards a quantum entanglement enhanced atom interferomter,” Institute
of Science and Technology Austria, 2024.
ista: Li V. 2024. Towards a quantum entanglement enhanced atom interferomter. Institute
of Science and Technology Austria.
mla: Li, Vyacheslav. Towards a Quantum Entanglement Enhanced Atom Interferomter.
Institute of Science and Technology Austria, 2024, doi:10.15479/at:ista:17225.
short: V. Li, Towards a Quantum Entanglement Enhanced Atom Interferomter, Institute
of Science and Technology Austria, 2024.
corr_author: '1'
date_created: 2024-07-11T09:46:48Z
date_published: 2024-07-11T00:00:00Z
date_updated: 2026-07-08T08:50:57Z
day: '11'
ddc:
- '530'
degree_awarded: PhD
department:
- _id: GradSch
- _id: OnHo
doi: 10.15479/at:ista:17225
file:
- access_level: open_access
checksum: 15b2dbe8d2c9ed7ca5dd413827928077
content_type: application/pdf
creator: vli
date_created: 2024-07-11T10:26:22Z
date_updated: 2024-07-11T10:26:22Z
file_id: '17228'
file_name: PhD_Thesis_Vyacheslav_Li_no_signatures_PDFA.pdf
file_size: 6729761
relation: main_file
success: 1
- access_level: closed
checksum: 16e904a11d8d0ebb167cb654ddfc7fe5
content_type: application/x-zip-compressed
creator: vli
date_created: 2024-07-11T10:26:22Z
date_updated: 2024-07-11T10:26:22Z
file_id: '17229'
file_name: PhD Thesis Vyacheslav Li.zip
file_size: 9542859
relation: source_file
file_date_updated: 2024-07-11T10:26:22Z
has_accepted_license: '1'
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
page: '79'
project:
- _id: bdb2a702-d553-11ed-ba76-f12e3e5a3bc6
grant_number: '101087907'
name: 'A quantum hybrid of atoms and milligram-scale pendulums: towards gravitational
quantum mechanics'
publication_identifier:
issn:
- 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
related_material:
record:
- id: '11438'
relation: part_of_dissertation
status: public
status: public
supervisor:
- first_name: Onur
full_name: Hosten, Onur
id: 4C02D85E-F248-11E8-B48F-1D18A9856A87
last_name: Hosten
orcid: 0000-0002-2031-204X
title: Towards a quantum entanglement enhanced atom interferomter
tmp:
image: /images/cc_by_nc_sa.png
legal_code_url: https://creativecommons.org/licenses/by-nc-sa/4.0/legalcode
name: Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC
BY-NC-SA 4.0)
short: CC BY-NC-SA (4.0)
type: dissertation
user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd
year: '2024'
...
---
DOAJ_listed: '1'
OA_place: publisher
OA_type: gold
_id: '15169'
abstract:
- lang: eng
text: Interpretation of extracellular recordings can be challenging due to the long
range of electric field. This challenge can be mitigated by estimating the current
source density (CSD). Here we introduce kCSD-python, an open Python package implementing
Kernel Current Source Density (kCSD) method and related tools to facilitate CSD
analysis of experimental data and the interpretation of results. We show how to
counter the limitations imposed by noise and assumptions in the method itself.
kCSD-python allows CSD estimation for an arbitrary distribution of electrodes
in 1D, 2D, and 3D, assuming distributions of sources in tissue, a slice, or in
a single cell, and includes a range of diagnostic aids. We demonstrate its features
in a Jupyter Notebook tutorial which illustrates a typical analytical workflow
and main functionalities useful in validating analysis results.
acknowledgement: 'The Python implementation of kCSD was started by Grzegorz Parka
during Google Summer of Code project through the International Neuroinformatics
Coordinating Facility. Jan Mąka implemented the first Python version of skCSD class.
This work was supported by the Polish National Science Centre (2013/08/W/NZ4/00691
to DKW; 2015/17/B/ST7/04123 to DKW). '
article_number: e1011941
article_processing_charge: Yes
article_type: original
author:
- first_name: Chaitanya
full_name: Chintaluri, Chaitanya
id: BA06AFEE-A4BA-11EA-AE5C-14673DDC885E
last_name: Chintaluri
orcid: 0000-0003-4252-1608
- first_name: Marta
full_name: Bejtka, Marta
last_name: Bejtka
- first_name: Wladyslaw
full_name: Sredniawa, Wladyslaw
last_name: Sredniawa
- first_name: Michal
full_name: Czerwinski, Michal
last_name: Czerwinski
- first_name: Jakub M.
full_name: Dzik, Jakub M.
last_name: Dzik
- first_name: Joanna
full_name: Jedrzejewska-Szmek, Joanna
last_name: Jedrzejewska-Szmek
- first_name: Daniel K.
full_name: Wojciki, Daniel K.
last_name: Wojciki
citation:
ama: Chintaluri C, Bejtka M, Sredniawa W, et al. kCSD-python, reliable current source
density estimation with quality control. PLoS Computational Biology. 2024;20(3).
doi:10.1371/journal.pcbi.1011941
apa: Chintaluri, C., Bejtka, M., Sredniawa, W., Czerwinski, M., Dzik, J. M., Jedrzejewska-Szmek,
J., & Wojciki, D. K. (2024). kCSD-python, reliable current source density
estimation with quality control. PLoS Computational Biology. Public Library
of Science. https://doi.org/10.1371/journal.pcbi.1011941
chicago: Chintaluri, Chaitanya, Marta Bejtka, Wladyslaw Sredniawa, Michal Czerwinski,
Jakub M. Dzik, Joanna Jedrzejewska-Szmek, and Daniel K. Wojciki. “KCSD-Python,
Reliable Current Source Density Estimation with Quality Control.” PLoS Computational
Biology. Public Library of Science, 2024. https://doi.org/10.1371/journal.pcbi.1011941.
ieee: C. Chintaluri et al., “kCSD-python, reliable current source density
estimation with quality control,” PLoS Computational Biology, vol. 20,
no. 3. Public Library of Science, 2024.
ista: Chintaluri C, Bejtka M, Sredniawa W, Czerwinski M, Dzik JM, Jedrzejewska-Szmek
J, Wojciki DK. 2024. kCSD-python, reliable current source density estimation with
quality control. PLoS Computational Biology. 20(3), e1011941.
mla: Chintaluri, Chaitanya, et al. “KCSD-Python, Reliable Current Source Density
Estimation with Quality Control.” PLoS Computational Biology, vol. 20,
no. 3, e1011941, Public Library of Science, 2024, doi:10.1371/journal.pcbi.1011941.
short: C. Chintaluri, M. Bejtka, W. Sredniawa, M. Czerwinski, J.M. Dzik, J. Jedrzejewska-Szmek,
D.K. Wojciki, PLoS Computational Biology 20 (2024).
corr_author: '1'
das_tickbox: '1'
date_created: 2024-03-24T23:00:59Z
date_published: 2024-03-14T00:00:00Z
date_updated: 2026-07-13T12:30:33Z
day: '14'
ddc:
- '000'
- '570'
department:
- _id: TiVo
doi: 10.1371/journal.pcbi.1011941
external_id:
isi:
- '001190689800001'
pmid:
- '38484020'
file:
- access_level: open_access
checksum: c09718d0d09614642d877d0716ce32e8
content_type: application/pdf
creator: dernst
date_created: 2025-06-25T05:47:36Z
date_updated: 2025-06-25T05:47:36Z
file_id: '19897'
file_name: 2024_PLoSCompBio_Chintaluri.pdf
file_size: 2540277
relation: main_file
success: 1
file_date_updated: 2025-06-25T05:47:36Z
has_accepted_license: '1'
intvolume: ' 20'
isi: 1
issue: '3'
language:
- iso: eng
month: '03'
oa: 1
oa_version: Published Version
pmid: 1
publication: PLoS Computational Biology
publication_identifier:
eissn:
- 1553-7358
issn:
- 1553-734X
publication_status: published
publisher: Public Library of Science
quality_controlled: '1'
related_material:
link:
- relation: software
url: https://github.com/Neuroinflab/kCSD-python
scopus_import: '1'
status: public
title: kCSD-python, reliable current source density estimation with quality control
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: 20
year: '2024'
...
---
OA_place: repository
OA_type: green
_id: '17147'
abstract:
- lang: eng
text: Efficient utilization of large-scale biobank data is crucial for inferring
the genetic basis of disease and predicting health outcomes from the DNA. Yet
we lack efficient, accurate methods that scale to data where electronic health
records are linked to whole genome sequence information. To address this issue,
our paper develops a new algorithmic paradigm based on Approximate Message Passing
(AMP), which is specifically tailored for genomic prediction and association testing.
Our method yields comparable out-of-sample prediction accuracy to the state of
the art on UK Biobank traits, whilst dramatically improving computational complexity,
with a 8x-speed up in the run time. In addition, AMP theory provides a joint association
testing framework, which outperforms the currently used REGENIE method, in roughly
a third of the compute time. This first, truly large-scale application of the
AMP framework lays the foundations for a far wider range of statistical analyses
for hundreds of millions of variables measured on millions of people.
acknowledged_ssus:
- _id: ScienComp
acknowledgement: "This work was supported by a Lopez-Loreta Prize to MM, an SNSF Eccellenza
Grant to MRR (PCEGP3-181181), and core funding from ISTA. The authors thank Philip
Schniter, Matthew Stephens and Pragya Sur for valuable suggestions on an early version
of the work. The authors acknowledge the participants and investigators of the UK
Biobank study. High-performance\r\ncomputing was supported by the Scientific Service
Units (SSU) of IST Austria through resources provided by Scientific Computing (SciComp)."
article_processing_charge: No
author:
- first_name: Al
full_name: Depope, Al
id: 0b77531d-dbcd-11ea-9d1d-a8eee0bf3830
last_name: Depope
- first_name: Marco
full_name: Mondelli, Marco
id: 27EB676C-8706-11E9-9510-7717E6697425
last_name: Mondelli
orcid: 0000-0002-3242-7020
- first_name: Matthew Richard
full_name: Robinson, Matthew Richard
id: E5D42276-F5DA-11E9-8E24-6303E6697425
last_name: Robinson
orcid: 0000-0001-8982-8813
citation:
ama: 'Depope A, Mondelli M, Robinson MR. Inference of genetic effects via approximate
message passing. In: 2024 IEEE International Conference on Acoustics, Speech,
and Signal Processing. IEEE; 2024:13151-13155. doi:10.1109/ICASSP48485.2024.10447198'
apa: 'Depope, A., Mondelli, M., & Robinson, M. R. (2024). Inference of genetic
effects via approximate message passing. In 2024 IEEE International Conference
on Acoustics, Speech, and Signal Processing (pp. 13151–13155). Seoul, Korea:
IEEE. https://doi.org/10.1109/ICASSP48485.2024.10447198'
chicago: Depope, Al, Marco Mondelli, and Matthew Richard Robinson. “Inference of
Genetic Effects via Approximate Message Passing.” In 2024 IEEE International
Conference on Acoustics, Speech, and Signal Processing, 13151–55. IEEE, 2024.
https://doi.org/10.1109/ICASSP48485.2024.10447198.
ieee: A. Depope, M. Mondelli, and M. R. Robinson, “Inference of genetic effects
via approximate message passing,” in 2024 IEEE International Conference on
Acoustics, Speech, and Signal Processing, Seoul, Korea, 2024, pp. 13151–13155.
ista: 'Depope A, Mondelli M, Robinson MR. 2024. Inference of genetic effects via
approximate message passing. 2024 IEEE International Conference on Acoustics,
Speech, and Signal Processing. ICASSP: International Conference on Acoustics,
Speech and Signal Processing, 13151–13155.'
mla: Depope, Al, et al. “Inference of Genetic Effects via Approximate Message Passing.”
2024 IEEE International Conference on Acoustics, Speech, and Signal Processing,
IEEE, 2024, pp. 13151–55, doi:10.1109/ICASSP48485.2024.10447198.
short: A. Depope, M. Mondelli, M.R. Robinson, in:, 2024 IEEE International Conference
on Acoustics, Speech, and Signal Processing, IEEE, 2024, pp. 13151–13155.
conference:
end_date: 2024-04-19
location: Seoul, Korea
name: 'ICASSP: International Conference on Acoustics, Speech and Signal Processing'
start_date: 2024-04-14
corr_author: '1'
date_created: 2024-06-16T22:01:07Z
date_published: 2024-04-19T00:00:00Z
date_updated: 2026-07-13T14:57:55Z
day: '19'
department:
- _id: MaMo
- _id: MaRo
doi: 10.1109/ICASSP48485.2024.10447198
external_id:
isi:
- '001396233806078'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://openreview.net/forum?id=aQYCDxfZV0
month: '04'
oa: 1
oa_version: Submitted Version
page: 13151-13155
project:
- _id: 059876FA-7A3F-11EA-A408-12923DDC885E
name: Prix Lopez-Loretta 2019 - Marco Mondelli
- _id: 9B8D11D6-BA93-11EA-9121-9846C619BF3A
grant_number: PCEGP3_181181
name: Improving estimation and prediction of common complex disease risk
publication: 2024 IEEE International Conference on Acoustics, Speech, and Signal Processing
publication_identifier:
isbn:
- '9798350344851'
issn:
- 1520-6149
publication_status: published
publisher: IEEE
quality_controlled: '1'
scopus_import: '1'
status: public
title: Inference of genetic effects via approximate message passing
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2024'
...
---
OA_place: repository
OA_type: green
_id: '22179'
abstract:
- lang: eng
text: "Burr and Erd˝os in 1975 conjectured, and Chv´atal, R¨odl, Szemer´edi and\r\nTrotter
later proved, that the Ramsey number of any bounded degree\r\ngraph is linear
in the number of vertices. In this paper, we disprove\r\nthe natural directed
analogue of the Burr–Erd˝os conjecture, answering a\r\nquestion of Buci´c, Letzter,
and Sudakov. If H is an acyclic digraph, the\r\noriented Ramsey number of H, denoted
−→r1(H), is the least N such that\r\nevery tournament on N vertices contains a
copy of H. We show that for\r\nany Δ ≥ 2 and any sufficiently large n, there exists
an acyclic digraph H\r\nwith n vertices and maximum degree Δ such that\r\n−→r1(H)
≥ nΩ(Δ2/3/ log5/3 Δ).\r\nThis proves that −→r1(H) is not always linear in the
number of vertices for\r\nbounded-degree H. On the other hand, we show that −→r1(H)
is nearly linear\r\nin the number of vertices for typical bounded-degree acyclic
digraphs H,\r\nand obtain linear or nearly linear bounds for several natural families
of\r\nbounded-degree acyclic digraphs.\r\nFor multiple colors, we prove a quasi-polynomial
upper bound −→rk(H)=\r\n2(log n)Ok(1) for all bounded-degree acyclic digraphs
H on n vertices, where −→rk(H) is the least N such that every k-edge-colored tournament
on N\r\nvertices contains a monochromatic copy of H. For k ≥ 2 and n ≥ 4, we\r\nexhibit
an acyclic digraph H with n vertices and maximum degree 3 such\r\nthat −→rk(H)
≥ nΩ(log n/ log log n), showing that these Ramsey numbers can\r\ngrow faster than
any polynomial in the number of vertices."
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Jacob
full_name: Fox, Jacob
last_name: Fox
- first_name: Xiaoyu
full_name: He, Xiaoyu
last_name: He
- first_name: Yuval
full_name: Wigderson, Yuval
id: 2d0023a0-1567-11f0-833d-d5c1e476d4b5
last_name: Wigderson
citation:
ama: Fox J, He X, Wigderson Y. Ramsey numbers of sparse digraphs. Israel Journal
of Mathematics. 2024;263(1):1-48. doi:10.1007/s11856-024-2624-y
apa: Fox, J., He, X., & Wigderson, Y. (2024). Ramsey numbers of sparse digraphs.
Israel Journal of Mathematics. Springer Nature. https://doi.org/10.1007/s11856-024-2624-y
chicago: Fox, Jacob, Xiaoyu He, and Yuval Wigderson. “Ramsey Numbers of Sparse Digraphs.”
Israel Journal of Mathematics. Springer Nature, 2024. https://doi.org/10.1007/s11856-024-2624-y.
ieee: J. Fox, X. He, and Y. Wigderson, “Ramsey numbers of sparse digraphs,” Israel
Journal of Mathematics, vol. 263, no. 1. Springer Nature, pp. 1–48, 2024.
ista: Fox J, He X, Wigderson Y. 2024. Ramsey numbers of sparse digraphs. Israel
Journal of Mathematics. 263(1), 1–48.
mla: Fox, Jacob, et al. “Ramsey Numbers of Sparse Digraphs.” Israel Journal of
Mathematics, vol. 263, no. 1, Springer Nature, 2024, pp. 1–48, doi:10.1007/s11856-024-2624-y.
short: J. Fox, X. He, Y. Wigderson, Israel Journal of Mathematics 263 (2024) 1–48.
date_created: 2026-06-29T10:59:02Z
date_published: 2024-10-01T00:00:00Z
date_updated: 2026-07-14T09:08:32Z
day: '01'
doi: 10.1007/s11856-024-2624-y
extern: '1'
external_id:
arxiv:
- '2105.02383'
intvolume: ' 263'
issue: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.2105.02383
month: '10'
oa: 1
oa_version: Preprint
page: 1-48
publication: Israel Journal of Mathematics
publication_identifier:
eissn:
- 1565-8511
issn:
- 0021-2172
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Ramsey numbers of sparse digraphs
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 263
year: '2024'
...
---
OA_place: repository
OA_type: green
_id: '22180'
abstract:
- lang: eng
text: Given a graph , its Ramsey number is the minimum so that every two‐coloring
of contains a monochromatic copy of . It was conjectured by Conlon, Fox, and
Sudakov that if one deletes a single vertex from , the Ramsey number can change
by at most a constant factor. We disprove this conjecture, exhibiting an infinite
family of graphs such that deleting a single vertex from each decreases the Ramsey
number by a super‐constant factor. One consequence of this result is the following.
There exists a family of graphs so that in any Ramsey coloring for (i.e., a
coloring of a clique on vertices with no monochromatic copy of ), one of the
color classes has density .
article_processing_charge: No
article_type: original
author:
- first_name: Yuval
full_name: Wigderson, Yuval
id: 2d0023a0-1567-11f0-833d-d5c1e476d4b5
last_name: Wigderson
citation:
ama: Wigderson Y. Ramsey numbers upon vertex deletion. Journal of Graph Theory.
2024;106(3):663-675. doi:10.1002/jgt.23093
apa: Wigderson, Y. (2024). Ramsey numbers upon vertex deletion. Journal of Graph
Theory. Wiley. https://doi.org/10.1002/jgt.23093
chicago: Wigderson, Yuval. “Ramsey Numbers upon Vertex Deletion.” Journal of
Graph Theory. Wiley, 2024. https://doi.org/10.1002/jgt.23093.
ieee: Y. Wigderson, “Ramsey numbers upon vertex deletion,” Journal of Graph Theory,
vol. 106, no. 3. Wiley, pp. 663–675, 2024.
ista: Wigderson Y. 2024. Ramsey numbers upon vertex deletion. Journal of Graph Theory.
106(3), 663–675.
mla: Wigderson, Yuval. “Ramsey Numbers upon Vertex Deletion.” Journal of Graph
Theory, vol. 106, no. 3, Wiley, 2024, pp. 663–75, doi:10.1002/jgt.23093.
short: Y. Wigderson, Journal of Graph Theory 106 (2024) 663–675.
date_created: 2026-06-29T10:59:24Z
date_published: 2024-07-01T00:00:00Z
date_updated: 2026-07-14T09:10:28Z
day: '01'
doi: 10.1002/jgt.23093
extern: '1'
external_id:
unknown:
- '2208.11181'
intvolume: ' 106'
issue: '3'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.2208.11181
month: '07'
oa: 1
oa_version: Preprint
page: 663-675
publication: Journal of Graph Theory
publication_identifier:
eissn:
- 1097-0118
issn:
- 0364-9024
publication_status: published
publisher: Wiley
quality_controlled: '1'
scopus_import: '1'
status: public
title: Ramsey numbers upon vertex deletion
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 106
year: '2024'
...
---
OA_place: repository
OA_type: green
_id: '22190'
abstract:
- lang: eng
text: "We consider the set of \U0001D45A×\U0001D45B matrices with rational entries
having numerator and denominator of size at most H and obtain various upper bounds
on the number of such matrices of a given rank, or with a given determinant, or
a given characteristic polynomial. We also consider similar questions for matrices
whose entries are Egyptian fractions."
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Muhammad
full_name: Afifurrahman, Muhammad
last_name: Afifurrahman
- first_name: Vivian Zieve
full_name: Kuperberg, Vivian Zieve
id: c3bac823-112d-11f0-a3f5-c264f852e697
last_name: Kuperberg
- first_name: Alina
full_name: Ostafe, Alina
last_name: Ostafe
- first_name: Igor E.
full_name: Shparlinski, Igor E.
last_name: Shparlinski
citation:
ama: Afifurrahman M, Kuperberg VZ, Ostafe A, Shparlinski IE. Statistics of ranks,
determinants and characteristic polynomials of rational matrices. Forum Mathematicum.
2024;37(4). doi:10.1515/forum-2024-0114
apa: Afifurrahman, M., Kuperberg, V. Z., Ostafe, A., & Shparlinski, I. E. (2024).
Statistics of ranks, determinants and characteristic polynomials of rational matrices.
Forum Mathematicum. De Gruyter. https://doi.org/10.1515/forum-2024-0114
chicago: Afifurrahman, Muhammad, Vivian Zieve Kuperberg, Alina Ostafe, and Igor
E. Shparlinski. “Statistics of Ranks, Determinants and Characteristic Polynomials
of Rational Matrices.” Forum Mathematicum. De Gruyter, 2024. https://doi.org/10.1515/forum-2024-0114.
ieee: M. Afifurrahman, V. Z. Kuperberg, A. Ostafe, and I. E. Shparlinski, “Statistics
of ranks, determinants and characteristic polynomials of rational matrices,” Forum
Mathematicum, vol. 37, no. 4. De Gruyter, 2024.
ista: Afifurrahman M, Kuperberg VZ, Ostafe A, Shparlinski IE. 2024. Statistics of
ranks, determinants and characteristic polynomials of rational matrices. Forum
Mathematicum. 37(4).
mla: Afifurrahman, Muhammad, et al. “Statistics of Ranks, Determinants and Characteristic
Polynomials of Rational Matrices.” Forum Mathematicum, vol. 37, no. 4,
De Gruyter, 2024, doi:10.1515/forum-2024-0114.
short: M. Afifurrahman, V.Z. Kuperberg, A. Ostafe, I.E. Shparlinski, Forum Mathematicum
37 (2024).
date_created: 2026-06-29T12:55:47Z
date_published: 2024-01-01T00:00:00Z
date_updated: 2026-07-14T10:48:41Z
doi: 10.1515/forum-2024-0114
extern: '1'
external_id:
arxiv:
- '2401.10086'
intvolume: ' 37'
issue: '4'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.2401.10086
mathsc:
- 11C20
- 15B36
- 15B52
month: '01'
oa: 1
oa_version: Preprint
publication: Forum Mathematicum
publication_identifier:
eissn:
- 1435-5337
issn:
- 0933-7741
publication_status: published
publisher: De Gruyter
quality_controlled: '1'
scopus_import: '1'
status: public
title: Statistics of ranks, determinants and characteristic polynomials of rational
matrices
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 37
year: '2024'
...
---
OA_place: repository
OA_type: green
_id: '22197'
abstract:
- lang: eng
text: "We study the distribution of consecutive sums of two squares\r\nin arithmetic
progressions. If {En}n∈N is the sequence of\r\nsums of two squares in increasing
order, we show that for\r\nany modulus q and any congruence classes a1, a2, a3
mod q\r\nwhich are admissible in the sense that there are solutions\r\nto x2 +
y2 ≡ ai mod q, there exist infinitely many n with\r\nEn+i−1 ≡ ai mod q, for i
=1, 2, 3. We also show that for\r\nany r1, r2 ≥ 1, there exist infinitely many
n with En+i−1 ≡\r\na1 mod q for 1 ≤ i ≤ r1 and En+i−1 ≡ a2 mod q for\r\nr1 +1
≤ i ≤ r1 + r2"
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Noam
full_name: Kimmel, Noam
last_name: Kimmel
- first_name: Vivian Zieve
full_name: Kuperberg, Vivian Zieve
id: c3bac823-112d-11f0-a3f5-c264f852e697
last_name: Kuperberg
citation:
ama: Kimmel N, Kuperberg VZ. Consecutive runs of sums of two squares. Journal
of Number Theory. 2024;264:135-147. doi:10.1016/j.jnt.2024.05.003
apa: Kimmel, N., & Kuperberg, V. Z. (2024). Consecutive runs of sums of two
squares. Journal of Number Theory. Elsevier. https://doi.org/10.1016/j.jnt.2024.05.003
chicago: Kimmel, Noam, and Vivian Zieve Kuperberg. “Consecutive Runs of Sums of
Two Squares.” Journal of Number Theory. Elsevier, 2024. https://doi.org/10.1016/j.jnt.2024.05.003.
ieee: N. Kimmel and V. Z. Kuperberg, “Consecutive runs of sums of two squares,”
Journal of Number Theory, vol. 264. Elsevier, pp. 135–147, 2024.
ista: Kimmel N, Kuperberg VZ. 2024. Consecutive runs of sums of two squares. Journal
of Number Theory. 264, 135–147.
mla: Kimmel, Noam, and Vivian Zieve Kuperberg. “Consecutive Runs of Sums of Two
Squares.” Journal of Number Theory, vol. 264, Elsevier, 2024, pp. 135–47,
doi:10.1016/j.jnt.2024.05.003.
short: N. Kimmel, V.Z. Kuperberg, Journal of Number Theory 264 (2024) 135–147.
date_created: 2026-06-29T12:58:28Z
date_published: 2024-11-01T00:00:00Z
date_updated: 2026-07-14T11:10:45Z
day: '01'
doi: 10.1016/j.jnt.2024.05.003
extern: '1'
external_id:
arxiv:
- '2306.12855'
intvolume: ' 264'
language:
- iso: eng
main_file_link:
- url: https://doi.org/10.48550/arXiv.2306.12855
month: '11'
oa_version: Preprint
page: 135-147
publication: Journal of Number Theory
publication_identifier:
issn:
- 0022-314X
publication_status: published
publisher: Elsevier
quality_controlled: '1'
scopus_import: '1'
status: public
title: Consecutive runs of sums of two squares
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 264
year: '2024'
...
---
OA_place: publisher
OA_type: hybrid
PlanS_conform: '1'
_id: '22209'
abstract:
- lang: eng
text: The curvature of elongated microscopic building blocks plays a crucial role
on their self-assembly into orientationally ordered phases. While rod-like molecules
form a handful of liquid crystal (LC) phases, curved or banana-shaped molecules
show more than fifty phases, with fascinating physical properties, such as chirality
or polarity. Despite the fundamental and technological importance of these so-called
‘banana-shaped liquid crystals’, little is known about their microscopic details
at the single-molecule level. Curved colloidal liquid crystals—liquid crystals
formed by curved colloidal rods—are excellent model systems to optically resolve
the structure and dynamics of curved building blocks within these condensed phases.
Recent advances in the synthesis of curved rod-like particles have unlocked the
potential for studying—at the single-particle level—the intimate relationship
between shape and phase symmetry, and even confirmed the stability of elusive
LC phases. Further developments in this nascent field promise exciting findings,
such as the first observation of the colloidal twist-bend nematic phase or the
fabrication of functional materials with curvature-dependent properties. In this
Report on Progress, we will highlight recent advances in the synthesis and assembly
of curved colloidal liquid crystals and discuss the upcoming challenges and opportunities
of this field.
article_number: '094601'
article_processing_charge: No
article_type: review
author:
- first_name: Carla
full_name: Fernández-Rico, Carla
id: 492def71-6250-11f0-b278-d41dbd241b62
last_name: Fernández-Rico
- first_name: Roel P A
full_name: Dullens, Roel P A
last_name: Dullens
citation:
ama: 'Fernández-Rico C, Dullens RPA. Liquid crystals from curved colloidal rods:
Waves, twists and more. Reports on Progress in Physics. 2024;87(9). doi:10.1088/1361-6633/ad627b'
apa: 'Fernández-Rico, C., & Dullens, R. P. A. (2024). Liquid crystals from curved
colloidal rods: Waves, twists and more. Reports on Progress in Physics.
IOP Publishing. https://doi.org/10.1088/1361-6633/ad627b'
chicago: 'Fernández-Rico, Carla, and Roel P A Dullens. “Liquid Crystals from Curved
Colloidal Rods: Waves, Twists and More.” Reports on Progress in Physics.
IOP Publishing, 2024. https://doi.org/10.1088/1361-6633/ad627b.'
ieee: 'C. Fernández-Rico and R. P. A. Dullens, “Liquid crystals from curved colloidal
rods: Waves, twists and more,” Reports on Progress in Physics, vol. 87,
no. 9. IOP Publishing, 2024.'
ista: 'Fernández-Rico C, Dullens RPA. 2024. Liquid crystals from curved colloidal
rods: Waves, twists and more. Reports on Progress in Physics. 87(9), 094601.'
mla: 'Fernández-Rico, Carla, and Roel P. A. Dullens. “Liquid Crystals from Curved
Colloidal Rods: Waves, Twists and More.” Reports on Progress in Physics,
vol. 87, no. 9, 094601, IOP Publishing, 2024, doi:10.1088/1361-6633/ad627b.'
short: C. Fernández-Rico, R.P.A. Dullens, Reports on Progress in Physics 87 (2024).
date_created: 2026-06-30T06:31:09Z
date_published: 2024-08-12T00:00:00Z
date_updated: 2026-07-15T06:27:28Z
day: '12'
ddc:
- '540'
doi: 10.1088/1361-6633/ad627b
extern: '1'
external_id:
pmid:
- '38996410'
has_accepted_license: '1'
intvolume: ' 87'
issue: '9'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1088/1361-6633/ad627b
month: '08'
oa: 1
oa_version: Published Version
pmid: 1
publication: Reports on Progress in Physics
publication_identifier:
eissn:
- 1361-6633
issn:
- 0034-4885
publication_status: published
publisher: IOP Publishing
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Liquid crystals from curved colloidal rods: Waves, twists and more'
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: 87
year: '2024'
...
---
OA_place: repository
OA_type: green
_id: '22219'
abstract:
- lang: eng
text: 'Bicontinuous microstructures are essential to the function of diverse natural
and synthetic systems. Their synthesis has been based on two approaches: arrested
phase separation or self-assembly of block copolymers. The former is attractive
for its chemical simplicity and the latter, for its thermodynamic robustness.
Here we introduce elastic microphase separation (EMPS) as an alternative approach
to make bicontinuous microstructures. Conceptually, EMPS balances the molecular-scale
forces that drive demixing with large-scale elasticity to encode a thermodynamic
length scale. This process features a continuous phase transition, reversible
without hysteresis. Practically, EMPS is triggered by simply supersaturating an
elastomeric matrix with a liquid, resulting in uniform bicontinuous materials
with a well-defined microscopic length scale tuned by the matrix stiffness. The
versatility of EMPS is further demonstrated by fabricating bicontinuous materials
with superior mechanical properties and controlled anisotropy and microstructural
gradients. Overall, EMPS presents a robust alternative for the bulk fabrication
of homogeneous bicontinuous materials.'
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Carla
full_name: Fernández-Rico, Carla
id: 492def71-6250-11f0-b278-d41dbd241b62
last_name: Fernández-Rico
- first_name: Sanjay
full_name: Schreiber, Sanjay
last_name: Schreiber
- first_name: Hamza
full_name: Oudich, Hamza
last_name: Oudich
- first_name: Charlotta
full_name: Lorenz, Charlotta
last_name: Lorenz
- first_name: Alba
full_name: Sicher, Alba
last_name: Sicher
- first_name: Tianqi
full_name: Sai, Tianqi
last_name: Sai
- first_name: Viola
full_name: Bauernfeind, Viola
last_name: Bauernfeind
- first_name: Stefanie
full_name: Heyden, Stefanie
last_name: Heyden
- first_name: Pietro
full_name: Carrara, Pietro
last_name: Carrara
- first_name: Laura De
full_name: Lorenzis, Laura De
last_name: Lorenzis
- first_name: Robert W.
full_name: Style, Robert W.
last_name: Style
- first_name: Eric R.
full_name: Dufresne, Eric R.
last_name: Dufresne
citation:
ama: Fernández-Rico C, Schreiber S, Oudich H, et al. Elastic microphase separation
produces robust bicontinuous materials. Nature Materials. 2024;23:124-130.
doi:10.1038/s41563-023-01703-0
apa: Fernández-Rico, C., Schreiber, S., Oudich, H., Lorenz, C., Sicher, A., Sai,
T., … Dufresne, E. R. (2024). Elastic microphase separation produces robust bicontinuous
materials. Nature Materials. Springer Nature. https://doi.org/10.1038/s41563-023-01703-0
chicago: Fernández-Rico, Carla, Sanjay Schreiber, Hamza Oudich, Charlotta Lorenz,
Alba Sicher, Tianqi Sai, Viola Bauernfeind, et al. “Elastic Microphase Separation
Produces Robust Bicontinuous Materials.” Nature Materials. Springer Nature,
2024. https://doi.org/10.1038/s41563-023-01703-0.
ieee: C. Fernández-Rico et al., “Elastic microphase separation produces robust
bicontinuous materials,” Nature Materials, vol. 23. Springer Nature, pp.
124–130, 2024.
ista: Fernández-Rico C, Schreiber S, Oudich H, Lorenz C, Sicher A, Sai T, Bauernfeind
V, Heyden S, Carrara P, Lorenzis LD, Style RW, Dufresne ER. 2024. Elastic microphase
separation produces robust bicontinuous materials. Nature Materials. 23, 124–130.
mla: Fernández-Rico, Carla, et al. “Elastic Microphase Separation Produces Robust
Bicontinuous Materials.” Nature Materials, vol. 23, Springer Nature, 2024,
pp. 124–30, doi:10.1038/s41563-023-01703-0.
short: C. Fernández-Rico, S. Schreiber, H. Oudich, C. Lorenz, A. Sicher, T. Sai,
V. Bauernfeind, S. Heyden, P. Carrara, L.D. Lorenzis, R.W. Style, E.R. Dufresne,
Nature Materials 23 (2024) 124–130.
date_created: 2026-06-30T06:36:39Z
date_published: 2024-01-01T00:00:00Z
date_updated: 2026-07-15T08:23:05Z
day: '01'
doi: 10.1038/s41563-023-01703-0
extern: '1'
external_id:
arxiv:
- '2304.11419'
intvolume: ' 23'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.2304.11419
month: '01'
oa: 1
oa_version: Preprint
page: 124-130
publication: Nature Materials
publication_identifier:
eissn:
- 1476-4660
issn:
- 1476-1122
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Elastic microphase separation produces robust bicontinuous materials
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 23
year: '2024'
...
---
_id: '15182'
abstract:
- lang: eng
text: Thermoelectric materials convert heat into electricity, with a broad range
of applications near room temperature (RT). However, the library of RT high-performance
materials is limited. Traditional high-temperature synthetic methods constrain
the range of materials achievable, hindering the ability to surpass crystal structure
limitations and engineer defects. Here, a solution-based synthetic approach is
introduced, enabling RT synthesis of powders and exploration of densification
at lower temperatures to influence the material's microstructure. The approach
is exemplified by Ag2Se, an n-type alternative to bismuth telluride. It is demonstrated
that the concentration of Ag interstitials, grain boundaries, and dislocations
are directly correlated to the sintering temperature, and achieve a figure of
merit of 1.1 from RT to 100 °C after optimization. Moreover, insights into and
resolve Ag2Se's challenges are provided, including stoichiometry issues leading
to irreproducible performances. This work highlights the potential of RT solution
synthesis in expanding the repertoire of high-performance thermoelectric materials
for practical applications.
acknowledged_ssus:
- _id: EM-Fac
- _id: LifeSc
- _id: NanoFab
acknowledgement: This work was supported by the Scientific Service Units (SSU) of
ISTA through resources provided by the Electron Microscopy Facility (EMF), the Lab
Support Facility (LSF), and the Nanofabrication Facility (NNF). This work was financially
supported by ISTA and the Werner Siemens Foundation. The USTEM Service Unit of the
Technical University of Vienna is acknowledged for EBSD sample preparation and analysis.
R.L.B. acknowledges the National Science Foundation for funding the mass spectrometry
analysis under award DMR 1904719. J.L. is a Serra Húnter Fellow and is grateful
to the ICREA Academia program and projects MICINN/FEDER PID2021-124572OB-C31 and
GC 2021 SGR 01061.
article_number: '2400408'
article_processing_charge: Yes (via OA deal)
article_type: original
author:
- first_name: Tobias
full_name: Kleinhanns, Tobias
id: 8BD9DE16-AB3C-11E9-9C8C-2A03E6697425
last_name: Kleinhanns
orcid: 0000-0003-1537-7436
- first_name: Francesco
full_name: Milillo, Francesco
id: 38b830db-ea88-11ee-bf9b-929beaf79054
last_name: Milillo
- first_name: Mariano
full_name: Calcabrini, Mariano
id: 45D7531A-F248-11E8-B48F-1D18A9856A87
last_name: Calcabrini
orcid: 0000-0003-4566-5877
- first_name: Christine
full_name: Fiedler, Christine
id: bd3fceba-dc74-11ea-a0a7-c17f71817366
last_name: Fiedler
- first_name: Sharona
full_name: Horta, Sharona
id: 03a7e858-01b1-11ec-8b71-99ae6c4a05bc
last_name: Horta
- first_name: Daniel
full_name: Balazs, Daniel
id: 302BADF6-85FC-11EA-9E3B-B9493DDC885E
last_name: Balazs
orcid: 0000-0001-7597-043X
- first_name: Marissa J.
full_name: Strumolo, Marissa J.
last_name: Strumolo
- first_name: Roger
full_name: Hasler, Roger
last_name: Hasler
- first_name: Jordi
full_name: Llorca, Jordi
last_name: Llorca
- first_name: Michael
full_name: Tkadletz, Michael
last_name: Tkadletz
- first_name: Richard L.
full_name: Brutchey, Richard L.
last_name: Brutchey
- first_name: Maria
full_name: Ibáñez, Maria
id: 43C61214-F248-11E8-B48F-1D18A9856A87
last_name: Ibáñez
orcid: 0000-0001-5013-2843
citation:
ama: 'Kleinhanns T, Milillo F, Calcabrini M, et al. A route to high thermoelectric
performance: Solution‐based control of microstructure and composition in Ag2Se.
Advanced Energy Materials. 2024;14(22). doi:10.1002/aenm.202400408'
apa: 'Kleinhanns, T., Milillo, F., Calcabrini, M., Fiedler, C., Horta, S., Balazs,
D., … Ibáñez, M. (2024). A route to high thermoelectric performance: Solution‐based
control of microstructure and composition in Ag2Se. Advanced Energy Materials.
Wiley. https://doi.org/10.1002/aenm.202400408'
chicago: 'Kleinhanns, Tobias, Francesco Milillo, Mariano Calcabrini, Christine Fiedler,
Sharona Horta, Daniel Balazs, Marissa J. Strumolo, et al. “A Route to High Thermoelectric
Performance: Solution‐based Control of Microstructure and Composition in Ag2Se.”
Advanced Energy Materials. Wiley, 2024. https://doi.org/10.1002/aenm.202400408.'
ieee: 'T. Kleinhanns et al., “A route to high thermoelectric performance:
Solution‐based control of microstructure and composition in Ag2Se,” Advanced
Energy Materials, vol. 14, no. 22. Wiley, 2024.'
ista: 'Kleinhanns T, Milillo F, Calcabrini M, Fiedler C, Horta S, Balazs D, Strumolo
MJ, Hasler R, Llorca J, Tkadletz M, Brutchey RL, Ibáñez M. 2024. A route to high
thermoelectric performance: Solution‐based control of microstructure and composition
in Ag2Se. Advanced Energy Materials. 14(22), 2400408.'
mla: 'Kleinhanns, Tobias, et al. “A Route to High Thermoelectric Performance: Solution‐based
Control of Microstructure and Composition in Ag2Se.” Advanced Energy Materials,
vol. 14, no. 22, 2400408, Wiley, 2024, doi:10.1002/aenm.202400408.'
short: T. Kleinhanns, F. Milillo, M. Calcabrini, C. Fiedler, S. Horta, D. Balazs,
M.J. Strumolo, R. Hasler, J. Llorca, M. Tkadletz, R.L. Brutchey, M. Ibáñez, Advanced
Energy Materials 14 (2024).
corr_author: '1'
date_created: 2024-03-25T08:57:40Z
date_published: 2024-06-12T00:00:00Z
date_updated: 2026-07-17T07:09:41Z
day: '12'
ddc:
- '530'
department:
- _id: MaIb
- _id: LifeSc
doi: 10.1002/aenm.202400408
external_id:
isi:
- '001184300200001'
file:
- access_level: open_access
checksum: 86b26430e00d5f43ea19e9b610692ab7
content_type: application/pdf
creator: dernst
date_created: 2024-07-22T12:07:56Z
date_updated: 2024-07-22T12:07:56Z
file_id: '17314'
file_name: 2024_AdvancedEnergyMaterials_Kleinhanns.pdf
file_size: 8824301
relation: main_file
success: 1
file_date_updated: 2024-07-22T12:07:56Z
has_accepted_license: '1'
intvolume: ' 14'
isi: 1
issue: '22'
language:
- iso: eng
license: https://creativecommons.org/licenses/by-nc-nd/4.0/
month: '06'
oa: 1
oa_version: Published Version
project:
- _id: 9B8F7476-BA93-11EA-9121-9846C619BF3A
name: 'HighTE: The Werner Siemens Laboratory for the High Throughput Discovery of
Semiconductors for Waste Heat Recovery'
publication: Advanced Energy Materials
publication_identifier:
eissn:
- 1614-6840
issn:
- 1614-6832
publication_status: published
publisher: Wiley
quality_controlled: '1'
related_material:
record:
- id: '22017'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: 'A route to high thermoelectric performance: Solution‐based control of microstructure
and composition in Ag2Se'
tmp:
image: /images/cc_by_nc_nd.png
legal_code_url: https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode
name: Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International
(CC BY-NC-ND 4.0)
short: CC BY-NC-ND (4.0)
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 14
year: '2024'
...
---
DOAJ_listed: '1'
OA_place: repository
OA_type: gold
_id: '18951'
abstract:
- lang: eng
text: "We consider local dynamics of the dimer model (perfect matchings) on hypercubic
boxes [n] \r\nd . These consist of successively switching the dimers along alternating
cycles of prescribed (small) lengths. We study the connectivity properties of
the dimer configuration space equipped with these transitions. Answering a question
of Freire, Klivans, Milet, and Saldanha, we show that in three dimensions any
configuration admits an alternating cycle of length at most 6. We further establish
that any configuration on [n] d features order n d−2 alternating cycles of length
at most 4d−2. We also prove that the dynamics of dimer configurations on the unit
hypercube of dimension d is ergodic when switching alternating cycles of length
at most 4d−4. Finally, in the planar but non-bipartite case, we show that parallelogram-shaped
boxes in the triangular lattice are ergodic for switching alternating cycles of
lengths 4 and 6 only, thus improving a result of Kenyon and Rémila, which also
uses 8-cycles. None of our proofs make reference to height functions."
article_processing_charge: Yes
article_type: original
arxiv: 1
author:
- first_name: Ivailo
full_name: Hartarsky, Ivailo
last_name: Hartarsky
- first_name: Lyuben
full_name: Lichev, Lyuben
id: 9aa8388e-d003-11ee-8458-c4c1d7447977
last_name: Lichev
- first_name: Fabio Lucio
full_name: Toninelli, Fabio Lucio
last_name: Toninelli
citation:
ama: Hartarsky I, Lichev L, Toninelli FL. Local dimer dynamics in higher dimensions.
Annales de l’Institut Henri Poincaré D, Combinatorics, Physics and their Interactions.
2024. doi:10.4171/aihpd/200
apa: Hartarsky, I., Lichev, L., & Toninelli, F. L. (2024). Local dimer dynamics
in higher dimensions. Annales de l’Institut Henri Poincaré D, Combinatorics,
Physics and Their Interactions. EMS Press. https://doi.org/10.4171/aihpd/200
chicago: Hartarsky, Ivailo, Lyuben Lichev, and Fabio Lucio Toninelli. “Local Dimer
Dynamics in Higher Dimensions.” Annales de l’Institut Henri Poincaré D, Combinatorics,
Physics and Their Interactions. EMS Press, 2024. https://doi.org/10.4171/aihpd/200.
ieee: I. Hartarsky, L. Lichev, and F. L. Toninelli, “Local dimer dynamics in higher
dimensions,” Annales de l’Institut Henri Poincaré D, Combinatorics, Physics
and their Interactions. EMS Press, 2024.
ista: Hartarsky I, Lichev L, Toninelli FL. 2024. Local dimer dynamics in higher
dimensions. Annales de l’Institut Henri Poincaré D, Combinatorics, Physics and
their Interactions.
mla: Hartarsky, Ivailo, et al. “Local Dimer Dynamics in Higher Dimensions.” Annales
de l’Institut Henri Poincaré D, Combinatorics, Physics and Their Interactions,
EMS Press, 2024, doi:10.4171/aihpd/200.
short: I. Hartarsky, L. Lichev, F.L. Toninelli, Annales de l’Institut Henri Poincaré
D, Combinatorics, Physics and Their Interactions (2024).
das_tickbox: '1'
date_created: 2025-01-29T10:57:09Z
date_published: 2024-08-26T00:00:00Z
date_updated: 2026-07-23T05:41:50Z
day: '26'
department:
- _id: MaKw
doi: 10.4171/aihpd/200
external_id:
arxiv:
- '2304.10930'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.2304.10930
mathsc:
- 05B50
- 05C70
- 82C20
month: '08'
oa: 1
oa_version: Preprint
publication: Annales de l’Institut Henri Poincaré D, Combinatorics, Physics and their
Interactions
publication_identifier:
eissn:
- 2308-5835
issn:
- 2308-5827
publication_status: epub_ahead
publisher: EMS Press
quality_controlled: '1'
scopus_import: '1'
status: public
title: Local dimer dynamics in higher dimensions
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2024'
...
---
OA_place: publisher
OA_type: gold
_id: '18917'
abstract:
- lang: eng
text: "An eight-partition of a finite set of points (respectively, of a continuous
mass distribution) in ℝ³ consists of three planes that divide the space into 8
octants, such that each open octant contains at most 1/8 of the points (respectively,
of the mass). In 1966, Hadwiger showed that any mass distribution in ℝ³ admits
an eight-partition; moreover, one can prescribe the normal direction of one of
the three planes. The analogous result for finite point sets follows by a standard
limit argument.\r\nWe prove the following variant of this result: Any mass distribution
(or point set) in ℝ³ admits an eight-partition for which the intersection of two
of the planes is a line with a prescribed direction.\r\nMoreover, we present an
efficient algorithm for calculating an eight-partition of a set of n points in
ℝ³ (with prescribed normal direction of one of the planes) in time O^*(n^{5/2})."
acknowledgement: "Aronov, Boris: Work has been supported by NSF grants CCF 15-40656
and CCF 20-08551, and by grant 2014/170 from the US-Israel Binational Science Foundation.
Part of this research was conducted while BA was visiting ISTA in the summers of
2022 and 2023. The visit of BA to ISTA in the summer of 2022 was supported by an
ISTA Visiting Professorship.\r\nBasit, Abdul: Work has been supported by Australian
Research Council grant DP220102212.\r\nRamesh, Indu: Work supported by a Tandon
School of Engineering Fellowship and by NSF Grant CCF-20-08551.\r\nBA and AB would
like to thank William Steiger for insightful initial discussions of the problems
addressed in this work."
article_processing_charge: Yes
arxiv: 1
author:
- first_name: Boris
full_name: Aronov, Boris
last_name: Aronov
- first_name: Abdul
full_name: Basit, Abdul
last_name: Basit
- first_name: Indu
full_name: Ramesh, Indu
last_name: Ramesh
- first_name: Gianluca
full_name: Tasinato, Gianluca
id: 0433290C-AF8F-11E9-A4C7-F729E6697425
last_name: Tasinato
- first_name: Uli
full_name: Wagner, Uli
id: 36690CA2-F248-11E8-B48F-1D18A9856A87
last_name: Wagner
orcid: 0000-0002-1494-0568
citation:
ama: 'Aronov B, Basit A, Ramesh I, Tasinato G, Wagner U. Eight-partitioning points
in 3D, and efficiently too. In: 40th International Symposium on Computational
Geometry. Vol 293. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2024:8:1-8:15.
doi:10.4230/LIPIcs.SoCG.2024.8'
apa: 'Aronov, B., Basit, A., Ramesh, I., Tasinato, G., & Wagner, U. (2024).
Eight-partitioning points in 3D, and efficiently too. In 40th International
Symposium on Computational Geometry (Vol. 293, p. 8:1-8:15). Athens, Greece:
Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.SoCG.2024.8'
chicago: Aronov, Boris, Abdul Basit, Indu Ramesh, Gianluca Tasinato, and Uli Wagner.
“Eight-Partitioning Points in 3D, and Efficiently Too.” In 40th International
Symposium on Computational Geometry, 293:8:1-8:15. Schloss Dagstuhl - Leibniz-Zentrum
für Informatik, 2024. https://doi.org/10.4230/LIPIcs.SoCG.2024.8.
ieee: B. Aronov, A. Basit, I. Ramesh, G. Tasinato, and U. Wagner, “Eight-partitioning
points in 3D, and efficiently too,” in 40th International Symposium on Computational
Geometry, Athens, Greece, 2024, vol. 293, p. 8:1-8:15.
ista: 'Aronov B, Basit A, Ramesh I, Tasinato G, Wagner U. 2024. Eight-partitioning
points in 3D, and efficiently too. 40th International Symposium on Computational
Geometry. SoCG: Symposium on Computational Geometry vol. 293, 8:1-8:15.'
mla: Aronov, Boris, et al. “Eight-Partitioning Points in 3D, and Efficiently Too.”
40th International Symposium on Computational Geometry, vol. 293, Schloss
Dagstuhl - Leibniz-Zentrum für Informatik, 2024, p. 8:1-8:15, doi:10.4230/LIPIcs.SoCG.2024.8.
short: B. Aronov, A. Basit, I. Ramesh, G. Tasinato, U. Wagner, in:, 40th International
Symposium on Computational Geometry, Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
2024, p. 8:1-8:15.
conference:
end_date: 2024-06-14
location: Athens, Greece
name: 'SoCG: Symposium on Computational Geometry'
start_date: 2024-06-11
corr_author: '1'
date_created: 2025-01-27T14:19:17Z
date_published: 2024-06-06T00:00:00Z
date_updated: 2026-07-23T11:14:45Z
day: '06'
ddc:
- '510'
department:
- _id: UlWa
- _id: GradSch
doi: 10.4230/LIPIcs.SoCG.2024.8
external_id:
arxiv:
- '2403.02627'
file:
- access_level: open_access
checksum: 443aa29ea5d948e917cfccd681dcf176
content_type: application/pdf
creator: dernst
date_created: 2025-01-27T14:17:37Z
date_updated: 2025-01-27T14:17:37Z
file_id: '18918'
file_name: 2024_LIPICs_Aronov.pdf
file_size: 880725
relation: main_file
success: 1
file_date_updated: 2025-01-27T14:17:37Z
has_accepted_license: '1'
intvolume: ' 293'
language:
- iso: eng
month: '06'
oa: 1
oa_version: Published Version
page: 8:1-8:15
publication: 40th International Symposium on Computational Geometry
publication_identifier:
isbn:
- '9783959773164'
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
quality_controlled: '1'
related_material:
record:
- id: '19860'
relation: later_version
status: public
scopus_import: '1'
status: public
title: Eight-partitioning points in 3D, and efficiently too
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 293
year: '2024'
...
---
OA_place: publisher
OA_type: gold
_id: '18557'
abstract:
- lang: eng
text: Broadcast and Consensus are most fundamental tasks in distributed computing.
These tasks are particularly challenging in dynamic networks where communication
across the network links may be unreliable, e.g., due to mobility or failures.
Over the last years, researchers have derived several impossibility results and
high time complexity lower bounds for these tasks. Specifically for the setting
where in each round of communication the adversary is allowed to choose one rooted
tree along which the information is disseminated, there is a lower as well as
an upper bound that is linear in the number n of nodes for Broadcast and for n
≥ 3 the adversary can guarantee that Consensus never happens. This setting is
called the oblivious message adversary for rooted trees. Also note that if the
adversary is allowed to choose a graph that does not contain a rooted tree, then
it can guarantee that Broadcast and Consensus will never happen. However, such
deterministic adversarial models may be overly pessimistic, as many processes
in real-world settings are stochastic in nature rather than worst-case. This paper
studies Broadcast on stochastic dynamic networks and shows that the situation
is very different to the deterministic case. In particular, we show that if information
dissemination occurs along random rooted trees and directed Erdős–Rényi graphs,
Broadcast completes in O(log n) rounds of communication with high probability.
The fundamental insight in our analysis is that key variables are mutually independent.
We then study two adversarial models, (a) one with Byzantine nodes and (b) one
where an adversary controls the edges. (a) Our techniques without Byzantine nodes
are general enough so that they can be extended to Byzantine nodes. (b) In the
spirit of smoothed analysis, we introduce the notion of randomized oblivious message
adversary, where in each round, an adversary picks k ≤ 2n/3 edges to appear in
the communication network, and then a graph (e.g. rooted tree or directed Erdős–Rényi
graph) is chosen uniformly at random among the set of all such graphs that include
these edges. We show that Broadcast completes in a finite number of rounds, which
is, e.g., O(k+log n) rounds in rooted trees. We then extend these results to All-to-All
Broadcast, and Consensus, and give lower bounds that show that most of our upper
bounds are tight.
acknowledgement: "Antoine El-Hayek: This project has received funding from the Austrian
Science Fund\r\n(FWF) grant DOI 10.55776/P33775 with additional funding from the
netidee SCIENCE Stiftung,\r\n2020–2024.\r\nMonika Henzinger: This project has received
funding from the European Research Council (ERC)\r\nunder the European Union’s Horizon
2020 research and innovation programme (MoDynStruct,\r\nNo. 101019564) and the Austrian
Science Fund (FWF) grant DOI 10.55776/Z422, grant DOI\r\n10.55776/I5982, and grant
DOI 10.55776/P33775 with additional funding from the netidee SCIENCE\r\nStiftung,
2020–2024.\r\nStefan Schmid: This project has received funding from the German Research
Foundation (DFG),\r\nSPP 2378 (project ReNO), 2023-2027."
alternative_title:
- LIPIcs
article_number: '21'
article_processing_charge: Yes
arxiv: 1
author:
- first_name: Antoine
full_name: El-Hayek, Antoine
id: 888a098e-fcac-11ee-aff7-d347be57b725
last_name: El-Hayek
orcid: 0000-0003-4268-7368
- first_name: Monika H
full_name: Henzinger, Monika H
id: 540c9bbd-f2de-11ec-812d-d04a5be85630
last_name: Henzinger
orcid: 0000-0002-5008-6530
- first_name: Stefan
full_name: Schmid, Stefan
last_name: Schmid
citation:
ama: 'El-Hayek A, Henzinger M, Schmid S. Broadcast and Consensus in stochastic dynamic
networks with Byzantine nodes and adversarial edges. In: 38th International
Symposium on Distributed Computing. Vol 319. Schloss Dagstuhl - Leibniz-Zentrum
für Informatik; 2024. doi:10.4230/LIPIcs.DISC.2024.21'
apa: 'El-Hayek, A., Henzinger, M., & Schmid, S. (2024). Broadcast and Consensus
in stochastic dynamic networks with Byzantine nodes and adversarial edges. In
38th International Symposium on Distributed Computing (Vol. 319). Madrid,
Spain: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.DISC.2024.21'
chicago: El-Hayek, Antoine, Monika Henzinger, and Stefan Schmid. “Broadcast and
Consensus in Stochastic Dynamic Networks with Byzantine Nodes and Adversarial
Edges.” In 38th International Symposium on Distributed Computing, Vol.
319. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024. https://doi.org/10.4230/LIPIcs.DISC.2024.21.
ieee: A. El-Hayek, M. Henzinger, and S. Schmid, “Broadcast and Consensus in stochastic
dynamic networks with Byzantine nodes and adversarial edges,” in 38th International
Symposium on Distributed Computing, Madrid, Spain, 2024, vol. 319.
ista: 'El-Hayek A, Henzinger M, Schmid S. 2024. Broadcast and Consensus in stochastic
dynamic networks with Byzantine nodes and adversarial edges. 38th International
Symposium on Distributed Computing. DISC: Symposium on Distributed Computing,
LIPIcs, vol. 319, 21.'
mla: El-Hayek, Antoine, et al. “Broadcast and Consensus in Stochastic Dynamic Networks
with Byzantine Nodes and Adversarial Edges.” 38th International Symposium on
Distributed Computing, vol. 319, 21, Schloss Dagstuhl - Leibniz-Zentrum für
Informatik, 2024, doi:10.4230/LIPIcs.DISC.2024.21.
short: A. El-Hayek, M. Henzinger, S. Schmid, in:, 38th International Symposium on
Distributed Computing, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024.
conference:
end_date: 2024-11-01
location: Madrid, Spain
name: 'DISC: Symposium on Distributed Computing'
start_date: 2024-10-28
corr_author: '1'
date_created: 2024-11-17T23:01:47Z
date_published: 2024-10-24T00:00:00Z
date_updated: 2026-07-24T12:48:28Z
day: '24'
ddc:
- '000'
department:
- _id: MoHe
doi: 10.4230/LIPIcs.DISC.2024.21
ec_funded: 1
external_id:
arxiv:
- '2302.11988'
isi:
- '001542467600021'
file:
- access_level: open_access
checksum: d6c8277331cafa188c33ba1717206cf4
content_type: application/pdf
creator: dernst
date_created: 2024-11-18T08:02:45Z
date_updated: 2024-11-18T08:02:45Z
file_id: '18561'
file_name: 2024_LIPIcs_ElHayek.pdf
file_size: 809666
relation: main_file
success: 1
file_date_updated: 2024-11-18T08:02:45Z
has_accepted_license: '1'
intvolume: ' 319'
isi: 1
language:
- iso: eng
month: '10'
oa: 1
oa_version: Published Version
project:
- _id: bd9e3a2e-d553-11ed-ba76-8aa684ce17fe
grant_number: P33775
name: Fast Algorithms for a Reactive Network Layer
- _id: bd9ca328-d553-11ed-ba76-dc4f890cfe62
call_identifier: H2020
grant_number: '101019564'
name: The design and evaluation of modern fully dynamic data structures
- _id: 34def286-11ca-11ed-8bc3-da5948e1613c
grant_number: Z00422
name: Efficient algorithms
- _id: bda196b2-d553-11ed-ba76-8e8ee6c21103
grant_number: I05982
name: Static and Dynamic Hierarchical Graph Decompositions
publication: 38th International Symposium on Distributed Computing
publication_identifier:
isbn:
- '9783959773522'
issn:
- 1868-8969
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
quality_controlled: '1'
related_material:
record:
- id: '22281'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: Broadcast and Consensus in stochastic dynamic networks with Byzantine nodes
and adversarial edges
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 319
year: '2024'
...
---
_id: '17146'
abstract:
- lang: eng
text: The Upper Bound Theorem for convex polytopes implies that the p-th Betti number
of the Čech complex of any set of N points in ℝ^d and any radius satisfies β_p
= O(N^m), with m = min{p+1, ⌈d/2⌉}. We construct sets in even and odd dimensions,
which prove that this upper bound is asymptotically tight. For example, we describe
a set of N = 2(n+1) points in ℝ³ and two radii such that the first Betti number
of the Čech complex at one radius is (n+1)² - 1, and the second Betti number of
the Čech complex at the other radius is n². In particular, there is an arrangement
of n contruent balls in ℝ³ that enclose a quadratic number of voids, which answers
a long-standing open question in computational geometry.
acknowledgement: "The first author is supported by the European Research Council (ERC),
grant no. 788183, and by the DFG Collaborative Research Center TRR 109, Austrian
Science Fund (FWF), grant no. {I 02979-N35.} The second author is supported by the
European Research Council (ERC), grant \"GeoScape\" and by the Hungarian Science
Foundation (NKFIH), grant K-131529. Both authors are supported by the Wittgenstein
Prize, Austrian Science Fund (FWF), grant no. Z 342-N31.\r\nThe authors thank Matt
Kahle for communicating the question about extremal Čech complexes, Ben Schweinhart
for early discussions on the linked circles construction in three dimensions, and
Gábor Tardos for helpful remarks and suggestions."
alternative_title:
- LIPIcs
article_number: '53'
article_processing_charge: No
arxiv: 1
author:
- first_name: Herbert
full_name: Edelsbrunner, Herbert
id: 3FB178DA-F248-11E8-B48F-1D18A9856A87
last_name: Edelsbrunner
orcid: 0000-0002-9823-6833
- first_name: János
full_name: Pach, János
id: E62E3130-B088-11EA-B919-BF823C25FEA4
last_name: Pach
citation:
ama: 'Edelsbrunner H, Pach J. Maximum Betti numbers of Čech complexes. In: 40th
International Symposium on Computational Geometry. Vol 293. Schloss Dagstuhl
- Leibniz-Zentrum für Informatik; 2024. doi:10.4230/LIPIcs.SoCG.2024.53'
apa: 'Edelsbrunner, H., & Pach, J. (2024). Maximum Betti numbers of Čech complexes.
In 40th International Symposium on Computational Geometry (Vol. 293). Athens,
Greece: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.SoCG.2024.53'
chicago: Edelsbrunner, Herbert, and János Pach. “Maximum Betti Numbers of Čech Complexes.”
In 40th International Symposium on Computational Geometry, Vol. 293. Schloss
Dagstuhl - Leibniz-Zentrum für Informatik, 2024. https://doi.org/10.4230/LIPIcs.SoCG.2024.53.
ieee: H. Edelsbrunner and J. Pach, “Maximum Betti numbers of Čech complexes,” in
40th International Symposium on Computational Geometry, Athens, Greece,
2024, vol. 293.
ista: 'Edelsbrunner H, Pach J. 2024. Maximum Betti numbers of Čech complexes. 40th
International Symposium on Computational Geometry. SoCG: Symposium on Computational
Geometry, LIPIcs, vol. 293, 53.'
mla: Edelsbrunner, Herbert, and János Pach. “Maximum Betti Numbers of Čech Complexes.”
40th International Symposium on Computational Geometry, vol. 293, 53, Schloss
Dagstuhl - Leibniz-Zentrum für Informatik, 2024, doi:10.4230/LIPIcs.SoCG.2024.53.
short: H. Edelsbrunner, J. Pach, in:, 40th International Symposium on Computational
Geometry, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024.
conference:
end_date: 2024-06-14
location: Athens, Greece
name: 'SoCG: Symposium on Computational Geometry'
start_date: 2024-06-11
date_created: 2024-06-16T22:01:06Z
date_published: 2024-06-01T00:00:00Z
date_updated: 2026-07-27T08:15:58Z
day: '01'
ddc:
- '510'
department:
- _id: HeEd
doi: 10.4230/LIPIcs.SoCG.2024.53
ec_funded: 1
external_id:
arxiv:
- '2310.14801'
file:
- access_level: open_access
checksum: 5442d44fb89d77477a87668d6e61aac9
content_type: application/pdf
creator: dernst
date_created: 2024-06-17T08:46:33Z
date_updated: 2024-06-17T08:46:33Z
file_id: '17152'
file_name: 2024_LIPICS_Edelsbrunner.pdf
file_size: 766562
relation: main_file
success: 1
file_date_updated: 2024-06-17T08:46:33Z
has_accepted_license: '1'
intvolume: ' 293'
language:
- iso: eng
month: '06'
oa: 1
oa_version: Published Version
project:
- _id: 266A2E9E-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '788183'
name: Alpha Shape Theory Extended
- _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: 40th International Symposium on Computational Geometry
publication_identifier:
isbn:
- '9783959773164'
issn:
- 1868-8969
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
quality_controlled: '1'
related_material:
record:
- id: '20657'
relation: later_version
status: public
scopus_import: '1'
status: public
title: Maximum Betti numbers of Čech complexes
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 293
year: '2024'
...
---
OA_place: repository
OA_type: green
_id: '17426'
abstract:
- lang: eng
text: "The robustness of neural networks against input perturbations with bounded\r\nmagnitude
represents a serious concern in the deployment of deep learning\r\nmodels in safety-critical
systems. Recently, the scientific community has\r\nfocused on enhancing certifiable
robustness guarantees by crafting 1-Lipschitz\r\nneural networks that leverage
Lipschitz bounded dense and convolutional layers.\r\nAlthough different methods
have been proposed in the literature to achieve this\r\ngoal, understanding the
performance of such methods is not straightforward,\r\nsince different metrics
can be relevant (e.g., training time, memory usage,\r\naccuracy, certifiable robustness)
for different applications. For this reason,\r\nthis work provides a thorough
theoretical and empirical comparison between\r\nmethods by evaluating them in
terms of memory usage, speed, and certifiable\r\nrobust accuracy. The paper also
provides some guidelines and recommendations to\r\nsupport the user in selecting
the methods that work best depending on the\r\navailable resources. We provide
code at\r\nhttps://github.com/berndprach/1LipschitzLayersCompared."
acknowledgement: "This work was partially supported by project SERICS (PE00000014)
under the MUR National Recovery and Resilience Plan funded by the European Union
- NextGenerationEU.\r\n"
article_processing_charge: No
arxiv: 1
author:
- first_name: Bernd
full_name: Prach, Bernd
id: 2D561D42-C427-11E9-89B4-9C1AE6697425
last_name: Prach
- first_name: Fabio
full_name: Brau, Fabio
last_name: Brau
- first_name: Giorgio
full_name: Buttazzo, Giorgio
last_name: Buttazzo
- first_name: Christoph
full_name: Lampert, Christoph
id: 40C20FD2-F248-11E8-B48F-1D18A9856A87
last_name: Lampert
orcid: 0000-0001-8622-7887
citation:
ama: 'Prach B, Brau F, Buttazzo G, Lampert C. 1-Lipschitz layers compared: Memory,
speed, and certifiable robustness. In: Proceedings of the IEEE/CVF Conference
on Computer Vision and Pattern Recognition. Computer Vision Foundation; 2024:24574-24583.
doi:10.1109/CVPR52733.2024.02320'
apa: 'Prach, B., Brau, F., Buttazzo, G., & Lampert, C. (2024). 1-Lipschitz layers
compared: Memory, speed, and certifiable robustness. In Proceedings of the
IEEE/CVF Conference on Computer Vision and Pattern Recognition (pp. 24574–24583).
Seattle, WA, United States: Computer Vision Foundation. https://doi.org/10.1109/CVPR52733.2024.02320'
chicago: 'Prach, Bernd, Fabio Brau, Giorgio Buttazzo, and Christoph Lampert. “1-Lipschitz
Layers Compared: Memory, Speed, and Certifiable Robustness.” In Proceedings
of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, 24574–83.
Computer Vision Foundation, 2024. https://doi.org/10.1109/CVPR52733.2024.02320.'
ieee: 'B. Prach, F. Brau, G. Buttazzo, and C. Lampert, “1-Lipschitz layers compared:
Memory, speed, and certifiable robustness,” in Proceedings of the IEEE/CVF
Conference on Computer Vision and Pattern Recognition, Seattle, WA, United
States, 2024, pp. 24574–24583.'
ista: 'Prach B, Brau F, Buttazzo G, Lampert C. 2024. 1-Lipschitz layers compared:
Memory, speed, and certifiable robustness. Proceedings of the IEEE/CVF Conference
on Computer Vision and Pattern Recognition. CVPR: Conference on Computer Vision
and Pattern Recognition, 24574–24583.'
mla: 'Prach, Bernd, et al. “1-Lipschitz Layers Compared: Memory, Speed, and Certifiable
Robustness.” Proceedings of the IEEE/CVF Conference on Computer Vision and
Pattern Recognition, Computer Vision Foundation, 2024, pp. 24574–83, doi:10.1109/CVPR52733.2024.02320.'
short: B. Prach, F. Brau, G. Buttazzo, C. Lampert, in:, Proceedings of the IEEE/CVF
Conference on Computer Vision and Pattern Recognition, Computer Vision Foundation,
2024, pp. 24574–24583.
conference:
end_date: 2024-06-22
location: Seattle, WA, United States
name: 'CVPR: Conference on Computer Vision and Pattern Recognition'
start_date: 2024-06-16
corr_author: '1'
date_created: 2024-08-14T08:42:32Z
date_published: 2024-06-01T00:00:00Z
date_updated: 2026-07-27T12:47:43Z
day: '01'
department:
- _id: GradSch
- _id: ChLa
doi: 10.1109/CVPR52733.2024.02320
external_id:
arxiv:
- '2311.16833'
isi:
- '001344387500055'
has_accepted_license: '1'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.2311.16833
month: '06'
oa: 1
oa_version: Preprint
page: 24574-24583
publication: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern
Recognition
publication_status: published
publisher: Computer Vision Foundation
quality_controlled: '1'
related_material:
link:
- relation: software
url: https://github.com/berndprach/1LipschitzLayersCompared
record:
- id: '19759'
relation: dissertation_contains
status: public
status: public
title: '1-Lipschitz layers compared: Memory, speed, and certifiable robustness'
type: conference
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
year: '2024'
...
---
OA_place: repository
_id: '18874'
abstract:
- lang: eng
text: "Despite extensive research since the community learned about adversarial\r\nexamples
10 years ago, we still do not know how to train high-accuracy\r\nclassifiers that
are guaranteed to be robust to small perturbations of their\r\ninputs. Previous
works often argued that this might be because no classifier\r\nexists that is
robust and accurate at the same time. However, in computer\r\nvision this assumption
does not match reality where humans are usually accurate\r\nand robust on most
tasks of interest. We offer an alternative explanation and\r\nshow that in certain
settings robust generalization is only possible with\r\nunrealistically large
amounts of data. More precisely we find a setting where a\r\nrobust classifier
exists, it is easy to learn an accurate classifier, yet it\r\nrequires an exponential
amount of data to learn a robust classifier. Based on\r\nthis theoretical result,
we explore how well robust classifiers generalize on\r\ndatasets such as CIFAR-10.
We come to the conclusion that on this datasets, the\r\nlimitation of current
robust models also lies in the generalization, and that\r\nthey require a lot
of data to do well on the test set. We also show that the\r\nproblem is not in
the expressiveness or generalization capabilities of current\r\narchitectures,
and that there are low magnitude features in the data which are\r\nuseful for
non-robust generalization but are not available for robust\r\nclassifiers."
article_number: '2412.04245'
article_processing_charge: No
arxiv: 1
author:
- first_name: Bernd
full_name: Prach, Bernd
id: 2D561D42-C427-11E9-89B4-9C1AE6697425
last_name: Prach
- first_name: Christoph
full_name: Lampert, Christoph
id: 40C20FD2-F248-11E8-B48F-1D18A9856A87
last_name: Lampert
orcid: 0000-0001-8622-7887
citation:
ama: Prach B, Lampert C. Intriguing properties of robust classification. arXiv.
doi:10.48550/arXiv.2412.04245
apa: Prach, B., & Lampert, C. (n.d.). Intriguing properties of robust classification.
arXiv. https://doi.org/10.48550/arXiv.2412.04245
chicago: Prach, Bernd, and Christoph Lampert. “Intriguing Properties of Robust Classification.”
ArXiv, n.d. https://doi.org/10.48550/arXiv.2412.04245.
ieee: B. Prach and C. Lampert, “Intriguing properties of robust classification,”
arXiv. .
ista: Prach B, Lampert C. Intriguing properties of robust classification. arXiv,
2412.04245.
mla: Prach, Bernd, and Christoph Lampert. “Intriguing Properties of Robust Classification.”
ArXiv, 2412.04245, doi:10.48550/arXiv.2412.04245.
short: B. Prach, C. Lampert, ArXiv (n.d.).
corr_author: '1'
date_created: 2025-01-24T16:57:29Z
date_published: 2024-12-05T00:00:00Z
date_updated: 2026-07-27T12:47:43Z
day: '05'
department:
- _id: GradSch
- _id: ChLa
doi: 10.48550/arXiv.2412.04245
external_id:
arxiv:
- '2412.04245'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.2412.04245
month: '12'
oa: 1
oa_version: Preprint
publication: arXiv
publication_status: draft
related_material:
record:
- id: '20455'
relation: later_version
status: public
- id: '19759'
relation: dissertation_contains
status: public
status: public
title: Intriguing properties of robust classification
type: preprint
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
year: '2024'
...