---
OA_place: publisher
OA_type: hybrid
_id: '6788'
abstract:
- lang: eng
text: We consider the Nelson model with ultraviolet cutoff, which describes the
interaction between non-relativistic particles and a positive or zero mass quantized
scalar field. We take the non-relativistic particles to obey Fermi statistics
and discuss the time evolution in a mean-field limit of many fermions. In this
case, the limit is known to be also a semiclassical limit. We prove convergence
in terms of reduced density matrices of the many-body state to a tensor product
of a Slater determinant with semiclassical structure and a coherent state, which
evolve according to a fermionic version of the Schrödinger–Klein–Gordon equations.
acknowledgement: 'Open access funding provided by Institute of Science and Technology
(IST Austria). We would like to thank Peter Pickl and Robert Seiringer for fruitful
discussions, and the anonymous referees for their valuable comments and suggestions.
Moreover, we would like to thank Niels Benedikter and László Erdős for helpful remarks
about the semiclassical structure and the Schrödinger–Klein–Gordon equations. N.
L. gratefully acknowledges financial support by the European Research Council (ERC)
under the European Union’s Horizon 2020 research and innovation program (Grant Agreement
No. 694227) and funding for his stay at Princeton University from the project “Effective
One-Particle Equations for Correlated Many-Particle-(Coulomb) Systems: Derivation
and Properties” (Project No. 318342445) of the German Research Foundation (DFG).
S. P. gratefully acknowledges support from the German Academic Exchange Service
(DAAD) and the National Science Foundation under Agreement No. DMS-1128155. Moreover,
we would like to thank Princeton University and the Institute for Advanced Study
for their hospitality. S. P. would additionally like to thank the University of
Washington for hospitality.'
article_processing_charge: Yes (via OA deal)
article_type: original
arxiv: 1
author:
- first_name: Nikolai K
full_name: Leopold, Nikolai K
id: 4BC40BEC-F248-11E8-B48F-1D18A9856A87
last_name: Leopold
orcid: 0000-0002-0495-6822
- first_name: Sören P
full_name: Petrat, Sören P
id: 40AC02DC-F248-11E8-B48F-1D18A9856A87
last_name: Petrat
orcid: 0000-0002-9166-5889
citation:
ama: Leopold NK, Petrat SP. Mean-field dynamics for the Nelson model with fermions.
Annales Henri Poincare. 2019;20(10):3471–3508. doi:10.1007/s00023-019-00828-w
apa: Leopold, N. K., & Petrat, S. P. (2019). Mean-field dynamics for the Nelson
model with fermions. Annales Henri Poincare. Springer Nature. https://doi.org/10.1007/s00023-019-00828-w
chicago: Leopold, Nikolai K, and Sören P Petrat. “Mean-Field Dynamics for the Nelson
Model with Fermions.” Annales Henri Poincare. Springer Nature, 2019. https://doi.org/10.1007/s00023-019-00828-w.
ieee: N. K. Leopold and S. P. Petrat, “Mean-field dynamics for the Nelson model
with fermions,” Annales Henri Poincare, vol. 20, no. 10. Springer Nature,
pp. 3471–3508, 2019.
ista: Leopold NK, Petrat SP. 2019. Mean-field dynamics for the Nelson model with
fermions. Annales Henri Poincare. 20(10), 3471–3508.
mla: Leopold, Nikolai K., and Sören P. Petrat. “Mean-Field Dynamics for the Nelson
Model with Fermions.” Annales Henri Poincare, vol. 20, no. 10, Springer
Nature, 2019, pp. 3471–3508, doi:10.1007/s00023-019-00828-w.
short: N.K. Leopold, S.P. Petrat, Annales Henri Poincare 20 (2019) 3471–3508.
corr_author: '1'
date_created: 2019-08-11T21:59:21Z
date_published: 2019-10-01T00:00:00Z
date_updated: 2026-07-28T13:24:14Z
day: '01'
ddc:
- '510'
department:
- _id: RoSe
doi: 10.1007/s00023-019-00828-w
ec_funded: 1
external_id:
arxiv:
- '1807.06781'
isi:
- '000487036900008'
file:
- access_level: open_access
checksum: b6dbf0d837d809293d449adf77138904
content_type: application/pdf
creator: dernst
date_created: 2019-08-12T12:05:58Z
date_updated: 2020-07-14T12:47:40Z
file_id: '6801'
file_name: 2019_AnnalesHenriPoincare_Leopold.pdf
file_size: 681139
relation: main_file
file_date_updated: 2020-07-14T12:47:40Z
fulldoi: https://doi.org/10.1007/s00023-019-00828-w
has_accepted_license: '1'
intvolume: ' 20'
isi: 1
issue: '10'
language:
- iso: eng
license: https://creativecommons.org/licenses/by/4.0/
month: '10'
oa: 1
oa_version: Published Version
page: 3471–3508
project:
- _id: 25C6DC12-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '694227'
name: Analysis of quantum many-body systems
publication: Annales Henri Poincare
publication_identifier:
eissn:
- 1424-0661
issn:
- 1424-0637
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Mean-field dynamics for the Nelson model with fermions
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: '2019'
...
---
OA_place: publisher
OA_type: hybrid
_id: '7100'
abstract:
- lang: eng
text: We present microscopic derivations of the defocusing two-dimensional cubic
nonlinear Schrödinger equation and the Gross–Pitaevskii equation starting froman
interacting N-particle system of bosons. We consider the interaction potential
to be given either by Wβ(x)=N−1+2βW(Nβx), for any β>0, or to be given by VN(x)=e2NV(eNx),
for some spherical symmetric, nonnegative and compactly supported W,V∈L∞(R2,R).
In both cases we prove the convergence of the reduced density corresponding to
the exact time evolution to the projector onto the solution of the corresponding
nonlinear Schrödinger equation in trace norm. For the latter potential VN we show
that it is crucial to take the microscopic structure of the condensate into account
in order to obtain the correct dynamics.
acknowledgement: OA fund by IST Austria
article_processing_charge: Yes (via OA deal)
article_type: original
author:
- first_name: Maximilian
full_name: Jeblick, Maximilian
last_name: Jeblick
- first_name: Nikolai K
full_name: Leopold, Nikolai K
id: 4BC40BEC-F248-11E8-B48F-1D18A9856A87
last_name: Leopold
orcid: 0000-0002-0495-6822
- first_name: Peter
full_name: Pickl, Peter
last_name: Pickl
citation:
ama: Jeblick M, Leopold NK, Pickl P. Derivation of the time dependent Gross–Pitaevskii
equation in two dimensions. Communications in Mathematical Physics. 2019;372(1):1-69.
doi:10.1007/s00220-019-03599-x
apa: Jeblick, M., Leopold, N. K., & Pickl, P. (2019). Derivation of the time
dependent Gross–Pitaevskii equation in two dimensions. Communications in Mathematical
Physics. Springer Nature. https://doi.org/10.1007/s00220-019-03599-x
chicago: Jeblick, Maximilian, Nikolai K Leopold, and Peter Pickl. “Derivation of
the Time Dependent Gross–Pitaevskii Equation in Two Dimensions.” Communications
in Mathematical Physics. Springer Nature, 2019. https://doi.org/10.1007/s00220-019-03599-x.
ieee: M. Jeblick, N. K. Leopold, and P. Pickl, “Derivation of the time dependent
Gross–Pitaevskii equation in two dimensions,” Communications in Mathematical
Physics, vol. 372, no. 1. Springer Nature, pp. 1–69, 2019.
ista: Jeblick M, Leopold NK, Pickl P. 2019. Derivation of the time dependent Gross–Pitaevskii
equation in two dimensions. Communications in Mathematical Physics. 372(1), 1–69.
mla: Jeblick, Maximilian, et al. “Derivation of the Time Dependent Gross–Pitaevskii
Equation in Two Dimensions.” Communications in Mathematical Physics, vol.
372, no. 1, Springer Nature, 2019, pp. 1–69, doi:10.1007/s00220-019-03599-x.
short: M. Jeblick, N.K. Leopold, P. Pickl, Communications in Mathematical Physics
372 (2019) 1–69.
corr_author: '1'
date_created: 2019-11-25T08:08:02Z
date_published: 2019-11-08T00:00:00Z
date_updated: 2026-07-28T13:04:54Z
day: '08'
ddc:
- '510'
department:
- _id: RoSe
doi: 10.1007/s00220-019-03599-x
ec_funded: 1
external_id:
isi:
- '000495193700002'
file:
- access_level: open_access
checksum: cd283b475dd739e04655315abd46f528
content_type: application/pdf
creator: dernst
date_created: 2019-11-25T08:11:11Z
date_updated: 2020-07-14T12:47:49Z
file_id: '7101'
file_name: 2019_CommMathPhys_Jeblick.pdf
file_size: 884469
relation: main_file
file_date_updated: 2020-07-14T12:47:49Z
fulldoi: https://doi.org/10.1007/s00220-019-03599-x
has_accepted_license: '1'
intvolume: ' 372'
isi: 1
issue: '1'
language:
- iso: eng
month: '11'
oa: 1
oa_version: Published Version
page: 1-69
project:
- _id: 25C6DC12-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '694227'
name: Analysis of quantum many-body systems
publication: Communications in Mathematical Physics
publication_identifier:
eissn:
- 1432-0916
issn:
- 0010-3616
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Derivation of the time dependent Gross–Pitaevskii equation in two dimensions
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: 372
year: '2019'
...
---
OA_type: closed access
_id: '6890'
abstract:
- lang: eng
text: Describing the protein interactions that form pleomorphic and asymmetric viruses
represents a considerable challenge to most structural biology techniques, including
X-ray crystallography and single particle cryo-electron microscopy. Obtaining
a detailed understanding of these interactions is nevertheless important, considering
the number of relevant human pathogens that do not follow strict icosahedral or
helical symmetry. Cryo-electron tomography and subtomogram averaging methods provide
structural insights into complex biological environments and are well suited to
go beyond structures of perfectly symmetric viruses. This chapter discusses recent
developments showing that cryo-ET and subtomogram averaging can provide high-resolution
insights into hitherto unknown structural features of pleomorphic and asymmetric
virus particles. It also describes how these methods have significantly added
to our understanding of retrovirus capsid assemblies in immature and mature viruses.
Additional examples of irregular viruses and their associated proteins, whose
structures have been studied via cryo-ET and subtomogram averaging, further support
the versatility of these methods.
article_processing_charge: No
author:
- first_name: Martin
full_name: Obr, Martin
id: 4741CA5A-F248-11E8-B48F-1D18A9856A87
last_name: Obr
orcid: 0000-0003-1756-6564
- first_name: Florian KM
full_name: Schur, Florian KM
id: 48AD8942-F248-11E8-B48F-1D18A9856A87
last_name: Schur
orcid: 0000-0003-4790-8078
citation:
ama: 'Obr M, Schur FK. Structural analysis of pleomorphic and asymmetric viruses
using cryo-electron tomography and subtomogram averaging. In: Rey FA, ed. Complementary
Strategies to Study Virus Structure and Function. Vol 105. Advances in Virus
Research. Elsevier; 2019:117-159. doi:10.1016/bs.aivir.2019.07.008'
apa: Obr, M., & Schur, F. K. (2019). Structural analysis of pleomorphic and
asymmetric viruses using cryo-electron tomography and subtomogram averaging. In
F. A. Rey (Ed.), Complementary Strategies to Study Virus Structure and Function
(Vol. 105, pp. 117–159). Elsevier. https://doi.org/10.1016/bs.aivir.2019.07.008
chicago: Obr, Martin, and Florian KM Schur. “Structural Analysis of Pleomorphic
and Asymmetric Viruses Using Cryo-Electron Tomography and Subtomogram Averaging.”
In Complementary Strategies to Study Virus Structure and Function, edited
by Félix A. Rey, 105:117–59. Advances in Virus Research. Elsevier, 2019. https://doi.org/10.1016/bs.aivir.2019.07.008.
ieee: M. Obr and F. K. Schur, “Structural analysis of pleomorphic and asymmetric
viruses using cryo-electron tomography and subtomogram averaging,” in Complementary
Strategies to Study Virus Structure and Function, vol. 105, F. A. Rey, Ed.
Elsevier, 2019, pp. 117–159.
ista: 'Obr M, Schur FK. 2019.Structural analysis of pleomorphic and asymmetric viruses
using cryo-electron tomography and subtomogram averaging. In: Complementary Strategies
to Study Virus Structure and Function. vol. 105, 117–159.'
mla: Obr, Martin, and Florian KM Schur. “Structural Analysis of Pleomorphic and
Asymmetric Viruses Using Cryo-Electron Tomography and Subtomogram Averaging.”
Complementary Strategies to Study Virus Structure and Function, edited
by Félix A. Rey, vol. 105, Elsevier, 2019, pp. 117–59, doi:10.1016/bs.aivir.2019.07.008.
short: M. Obr, F.K. Schur, in:, F.A. Rey (Ed.), Complementary Strategies to Study
Virus Structure and Function, Elsevier, 2019, pp. 117–159.
date_created: 2019-09-18T08:15:37Z
date_published: 2019-08-27T00:00:00Z
date_updated: 2026-07-28T13:14:51Z
day: '27'
department:
- _id: FlSc
doi: 10.1016/bs.aivir.2019.07.008
editor:
- first_name: Félix A.
full_name: Rey, Félix A.
last_name: Rey
external_id:
isi:
- '000501594500006'
pmid:
- '31522703'
fulldoi: https://doi.org/10.1016/bs.aivir.2019.07.008
intvolume: ' 105'
isi: 1
language:
- iso: eng
month: '08'
oa_version: None
page: 117-159
pmid: 1
publication: Complementary Strategies to Study Virus Structure and Function
publication_identifier:
isbn:
- '9780128184561'
issn:
- 0065-3527
publication_status: published
publisher: Elsevier
quality_controlled: '1'
scopus_import: '1'
series_title: Advances in Virus Research
status: public
title: Structural analysis of pleomorphic and asymmetric viruses using cryo-electron
tomography and subtomogram averaging
type: book_chapter
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 105
year: '2019'
...
---
OA_place: publisher
_id: '6989'
abstract:
- lang: eng
text: 'When can a polyomino piece of paper be folded into a unit cube? Prior work
studied tree-like polyominoes, but polyominoes with holes remain an intriguing
open problem. We present sufficient conditions for a polyomino with hole(s) to
fold into a cube, and conditions under which cube folding is impossible. In particular,
we show that all but five special simple holes guarantee foldability. '
acknowledgement: This research was performed in part at the 33rd Bellairs Winter Workshop
on Computational Geometry. We thank all other participants for a fruitful atmosphere.
article_processing_charge: No
arxiv: 1
author:
- first_name: Oswin
full_name: Aichholzer, Oswin
last_name: Aichholzer
- first_name: Hugo A
full_name: Akitaya, Hugo A
last_name: Akitaya
- first_name: Kenneth C
full_name: Cheung, Kenneth C
last_name: Cheung
- first_name: Erik D
full_name: Demaine, Erik D
last_name: Demaine
- first_name: Martin L
full_name: Demaine, Martin L
last_name: Demaine
- first_name: Sandor P
full_name: Fekete, Sandor P
last_name: Fekete
- first_name: Linda
full_name: Kleist, Linda
last_name: Kleist
- first_name: Irina
full_name: Kostitsyna, Irina
last_name: Kostitsyna
- first_name: Maarten
full_name: Löffler, Maarten
last_name: Löffler
- first_name: Zuzana
full_name: Masárová, Zuzana
id: 45CFE238-F248-11E8-B48F-1D18A9856A87
last_name: Masárová
orcid: 0000-0002-6660-1322
- first_name: Klara
full_name: Mundilova, Klara
last_name: Mundilova
- first_name: Christiane
full_name: Schmidt, Christiane
last_name: Schmidt
citation:
ama: 'Aichholzer O, Akitaya HA, Cheung KC, et al. Folding polyominoes with holes
into a cube. In: Proceedings of the 31st Canadian Conference on Computational
Geometry. Canadian Conference on Computational Geometry; 2019:164-170.'
apa: 'Aichholzer, O., Akitaya, H. A., Cheung, K. C., Demaine, E. D., Demaine, M.
L., Fekete, S. P., … Schmidt, C. (2019). Folding polyominoes with holes into a
cube. In Proceedings of the 31st Canadian Conference on Computational Geometry
(pp. 164–170). Edmonton, Canada: Canadian Conference on Computational Geometry.'
chicago: Aichholzer, Oswin, Hugo A Akitaya, Kenneth C Cheung, Erik D Demaine, Martin
L Demaine, Sandor P Fekete, Linda Kleist, et al. “Folding Polyominoes with Holes
into a Cube.” In Proceedings of the 31st Canadian Conference on Computational
Geometry, 164–70. Canadian Conference on Computational Geometry, 2019.
ieee: O. Aichholzer et al., “Folding polyominoes with holes into a cube,”
in Proceedings of the 31st Canadian Conference on Computational Geometry,
Edmonton, Canada, 2019, pp. 164–170.
ista: 'Aichholzer O, Akitaya HA, Cheung KC, Demaine ED, Demaine ML, Fekete SP, Kleist
L, Kostitsyna I, Löffler M, Masárová Z, Mundilova K, Schmidt C. 2019. Folding
polyominoes with holes into a cube. Proceedings of the 31st Canadian Conference
on Computational Geometry. CCCG: Canadian Conference in Computational Geometry,
164–170.'
mla: Aichholzer, Oswin, et al. “Folding Polyominoes with Holes into a Cube.” Proceedings
of the 31st Canadian Conference on Computational Geometry, Canadian Conference
on Computational Geometry, 2019, pp. 164–70.
short: O. Aichholzer, H.A. Akitaya, K.C. Cheung, E.D. Demaine, M.L. Demaine, S.P.
Fekete, L. Kleist, I. Kostitsyna, M. Löffler, Z. Masárová, K. Mundilova, C. Schmidt,
in:, Proceedings of the 31st Canadian Conference on Computational Geometry, Canadian
Conference on Computational Geometry, 2019, pp. 164–170.
conference:
end_date: 2019-08-10
location: Edmonton, Canada
name: 'CCCG: Canadian Conference in Computational Geometry'
start_date: 2019-08-08
date_created: 2019-11-04T16:46:11Z
date_published: 2019-08-01T00:00:00Z
date_updated: 2026-07-28T13:08:49Z
day: '01'
ddc:
- '500'
department:
- _id: HeEd
external_id:
arxiv:
- '1910.09917'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://sites.ualberta.ca/~cccg2019/cccg2019_proceedings.pdf
month: '08'
oa: 1
oa_version: Published Version
page: 164-170
publication: Proceedings of the 31st Canadian Conference on Computational Geometry
publication_status: published
publisher: Canadian Conference on Computational Geometry
quality_controlled: '1'
related_material:
record:
- id: '8317'
relation: extended_version
status: public
scopus_import: '1'
status: public
title: Folding polyominoes with holes into a cube
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2019'
...
---
_id: '6419'
abstract:
- lang: eng
text: Characterizing the fitness landscape, a representation of fitness for a large
set of genotypes, is key to understanding how genetic information is interpreted
to create functional organisms. Here we determined the evolutionarily-relevant
segment of the fitness landscape of His3, a gene coding for an enzyme in the histidine
synthesis pathway, focusing on combinations of amino acid states found at orthologous
sites of extant species. Just 15% of amino acids found in yeast His3 orthologues
were always neutral while the impact on fitness of the remaining 85% depended
on the genetic background. Furthermore, at 67% of sites, amino acid replacements
were under sign epistasis, having both strongly positive and negative effect in
different genetic backgrounds. 46% of sites were under reciprocal sign epistasis.
The fitness impact of amino acid replacements was influenced by only a few genetic
backgrounds but involved interaction of multiple sites, shaping a rugged fitness
landscape in which many of the shortest paths between highly fit genotypes are
inaccessible.
article_number: e1008079
article_processing_charge: No
author:
- first_name: Victoria
full_name: Pokusaeva, Victoria
id: 3184041C-F248-11E8-B48F-1D18A9856A87
last_name: Pokusaeva
orcid: 0000-0001-7660-444X
- first_name: Dinara R.
full_name: Usmanova, Dinara R.
last_name: Usmanova
- first_name: Ekaterina
full_name: Putintseva, Ekaterina
id: 2EF67C84-F248-11E8-B48F-1D18A9856A87
last_name: Putintseva
- first_name: Lorena
full_name: Espinar, Lorena
last_name: Espinar
- first_name: Karen
full_name: Sarkisyan, Karen
id: 39A7BF80-F248-11E8-B48F-1D18A9856A87
last_name: Sarkisyan
orcid: 0000-0002-5375-6341
- first_name: Alexander S.
full_name: Mishin, Alexander S.
last_name: Mishin
- first_name: Natalya S.
full_name: Bogatyreva, Natalya S.
last_name: Bogatyreva
- first_name: Dmitry
full_name: Ivankov, Dmitry
id: 49FF1036-F248-11E8-B48F-1D18A9856A87
last_name: Ivankov
orcid: 0000-0002-8224-4118
- first_name: Arseniy
full_name: Akopyan, Arseniy
id: 430D2C90-F248-11E8-B48F-1D18A9856A87
last_name: Akopyan
orcid: 0000-0002-2548-617X
- first_name: Sergey
full_name: Avvakumov, Sergey
id: 3827DAC8-F248-11E8-B48F-1D18A9856A87
last_name: Avvakumov
orcid: 0000-0002-7840-5062
- first_name: Inna S.
full_name: Povolotskaya, Inna S.
last_name: Povolotskaya
- first_name: Guillaume J.
full_name: Filion, Guillaume J.
last_name: Filion
- first_name: Lucas B.
full_name: Carey, Lucas B.
last_name: Carey
- first_name: Fyodor
full_name: Kondrashov, Fyodor
id: 44FDEF62-F248-11E8-B48F-1D18A9856A87
last_name: Kondrashov
orcid: 0000-0001-8243-4694
citation:
ama: Pokusaeva V, Usmanova DR, Putintseva E, et al. An experimental assay of the
interactions of amino acids from orthologous sequences shaping a complex fitness
landscape. PLoS Genetics. 2019;15(4). doi:10.1371/journal.pgen.1008079
apa: Pokusaeva, V., Usmanova, D. R., Putintseva, E., Espinar, L., Sarkisyan, K.,
Mishin, A. S., … Kondrashov, F. (2019). An experimental assay of the interactions
of amino acids from orthologous sequences shaping a complex fitness landscape.
PLoS Genetics. Public Library of Science. https://doi.org/10.1371/journal.pgen.1008079
chicago: Pokusaeva, Victoria, Dinara R. Usmanova, Ekaterina Putintseva, Lorena Espinar,
Karen Sarkisyan, Alexander S. Mishin, Natalya S. Bogatyreva, et al. “An Experimental
Assay of the Interactions of Amino Acids from Orthologous Sequences Shaping a
Complex Fitness Landscape.” PLoS Genetics. Public Library of Science, 2019.
https://doi.org/10.1371/journal.pgen.1008079.
ieee: V. Pokusaeva et al., “An experimental assay of the interactions of
amino acids from orthologous sequences shaping a complex fitness landscape,” PLoS
Genetics, vol. 15, no. 4. Public Library of Science, 2019.
ista: Pokusaeva V, Usmanova DR, Putintseva E, Espinar L, Sarkisyan K, Mishin AS,
Bogatyreva NS, Ivankov D, Akopyan A, Avvakumov S, Povolotskaya IS, Filion GJ,
Carey LB, Kondrashov F. 2019. An experimental assay of the interactions of amino
acids from orthologous sequences shaping a complex fitness landscape. PLoS Genetics.
15(4), e1008079.
mla: Pokusaeva, Victoria, et al. “An Experimental Assay of the Interactions of Amino
Acids from Orthologous Sequences Shaping a Complex Fitness Landscape.” PLoS
Genetics, vol. 15, no. 4, e1008079, Public Library of Science, 2019, doi:10.1371/journal.pgen.1008079.
short: V. Pokusaeva, D.R. Usmanova, E. Putintseva, L. Espinar, K. Sarkisyan, A.S.
Mishin, N.S. Bogatyreva, D. Ivankov, A. Akopyan, S. Avvakumov, I.S. Povolotskaya,
G.J. Filion, L.B. Carey, F. Kondrashov, PLoS Genetics 15 (2019).
date_created: 2019-05-13T07:58:38Z
date_published: 2019-04-10T00:00:00Z
date_updated: 2026-07-28T13:29:02Z
day: '10'
ddc:
- '570'
department:
- _id: FyKo
doi: 10.1371/journal.pgen.1008079
ec_funded: 1
external_id:
isi:
- '000466866000029'
file:
- access_level: open_access
checksum: cf3889c8a8a16053dacf9c3776cbe217
content_type: application/pdf
creator: dernst
date_created: 2019-05-14T08:26:08Z
date_updated: 2020-07-14T12:47:30Z
file_id: '6445'
file_name: 2019_PLOSGenetics_Pokusaeva.pdf
file_size: 3726017
relation: main_file
file_date_updated: 2020-07-14T12:47:30Z
fulldoi: https://doi.org/10.1371/journal.pgen.1008079
has_accepted_license: '1'
intvolume: ' 15'
isi: 1
issue: '4'
language:
- iso: eng
month: '04'
oa: 1
oa_version: Published Version
project:
- _id: 2564DBCA-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '665385'
name: International IST Doctoral Program
publication: PLoS Genetics
publication_identifier:
eissn:
- 1553-7404
publication_status: published
publisher: Public Library of Science
quality_controlled: '1'
related_material:
record:
- id: '9789'
relation: research_data
status: public
- id: '9790'
relation: research_data
status: public
- id: '9797'
relation: research_data
status: public
scopus_import: '1'
status: public
title: An experimental assay of the interactions of amino acids from orthologous sequences
shaping a complex fitness landscape
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: 15
year: '2019'
...
---
OA_place: publisher
OA_type: hybrid
_id: '5678'
abstract:
- lang: eng
text: "The order-k Voronoi tessellation of a locally finite set \U0001D44B⊆ℝ\U0001D45B
decomposes ℝ\U0001D45B into convex domains whose points have the same k nearest
neighbors in X. Assuming X is a stationary Poisson point process, we give explicit
formulas for the expected number and total area of faces of a given dimension
per unit volume of space. We also develop a relaxed version of discrete Morse
theory and generalize by counting only faces, for which the k nearest points in
X are within a given distance threshold."
acknowledgement: "Open access funding provided by Institute of Science and Technology
(IST Austria). This project has received funding from the European Research Council
(ERC) under the European Union’s Horizon 2020 research and innovation programme
(Grant Agreement No. 78818 Alpha). It is also partially supported by the DFG Collaborative
Research Center TRR 109, ‘Discretization in Geometry and Dynamics’, through Grant
No. I02979-N35 of the Austrian Science Fund (FWF).\r\n\r\n"
article_processing_charge: Yes (via OA deal)
article_type: original
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: Anton
full_name: Nikitenko, Anton
id: 3E4FF1BA-F248-11E8-B48F-1D18A9856A87
last_name: Nikitenko
orcid: 0000-0002-0659-3201
citation:
ama: Edelsbrunner H, Nikitenko A. Poisson–Delaunay Mosaics of Order k. Discrete
and Computational Geometry. 2019;62(4):865–878. doi:10.1007/s00454-018-0049-2
apa: Edelsbrunner, H., & Nikitenko, A. (2019). Poisson–Delaunay Mosaics of Order
k. Discrete and Computational Geometry. Springer. https://doi.org/10.1007/s00454-018-0049-2
chicago: Edelsbrunner, Herbert, and Anton Nikitenko. “Poisson–Delaunay Mosaics of
Order K.” Discrete and Computational Geometry. Springer, 2019. https://doi.org/10.1007/s00454-018-0049-2.
ieee: H. Edelsbrunner and A. Nikitenko, “Poisson–Delaunay Mosaics of Order k,” Discrete
and Computational Geometry, vol. 62, no. 4. Springer, pp. 865–878, 2019.
ista: Edelsbrunner H, Nikitenko A. 2019. Poisson–Delaunay Mosaics of Order k. Discrete
and Computational Geometry. 62(4), 865–878.
mla: Edelsbrunner, Herbert, and Anton Nikitenko. “Poisson–Delaunay Mosaics of Order
K.” Discrete and Computational Geometry, vol. 62, no. 4, Springer, 2019,
pp. 865–878, doi:10.1007/s00454-018-0049-2.
short: H. Edelsbrunner, A. Nikitenko, Discrete and Computational Geometry 62 (2019)
865–878.
corr_author: '1'
date_created: 2018-12-16T22:59:20Z
date_published: 2019-12-01T00:00:00Z
date_updated: 2026-07-28T13:38:08Z
day: '01'
ddc:
- '516'
department:
- _id: HeEd
doi: 10.1007/s00454-018-0049-2
ec_funded: 1
external_id:
arxiv:
- '1709.09380'
isi:
- '000494042900008'
file:
- access_level: open_access
checksum: f9d00e166efaccb5a76bbcbb4dcea3b4
content_type: application/pdf
creator: dernst
date_created: 2019-02-06T10:10:46Z
date_updated: 2020-07-14T12:47:10Z
file_id: '5932'
file_name: 2018_DiscreteCompGeometry_Edelsbrunner.pdf
file_size: 599339
relation: main_file
file_date_updated: 2020-07-14T12:47:10Z
fulldoi: https://doi.org/10.1007/s00454-018-0049-2
has_accepted_license: '1'
intvolume: ' 62'
isi: 1
issue: '4'
language:
- iso: eng
month: '12'
oa: 1
oa_version: Published Version
page: 865–878
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
publication: Discrete and Computational Geometry
publication_identifier:
eissn:
- '14320444'
issn:
- '01795376'
publication_status: published
publisher: Springer
quality_controlled: '1'
related_material:
record:
- id: '6287'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: Poisson–Delaunay Mosaics of Order k
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: 62
year: '2019'
...
---
OA_place: publisher
OA_type: free access
_id: '5947'
abstract:
- lang: eng
text: Graph algorithms applied in many applications, including social networks,
communication networks, VLSI design, graphics, and several others, require dynamic
modifications - addition and removal of vertices and/or edges - in the graph.
This paper presents a novel concurrent non-blocking algorithm to implement a dynamic
unbounded directed graph in a shared-memory machine. The addition and removal
operations of vertices and edges are lock-free. For a finite sized graph, the
lookup operations are wait-free. Most significant component of the presented algorithm
is the reachability query in a concurrent graph. The reachability queries in our
algorithm are obstruction-free and thus impose minimal additional synchronization
cost over other operations. We prove that each of the data structure operations
are linearizable. We extensively evaluate a sample C/C++ implementation of the
algorithm through a number of micro-benchmarks. The experimental results show
that the proposed algorithm scales well with the number of threads and on an average
provides 5 to 7x performance improvement over a concurrent graph implementation
using coarse-grained locking.
article_processing_charge: No
arxiv: 1
author:
- first_name: Bapi
full_name: Chatterjee, Bapi
id: 3C41A08A-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-2742-4028
- first_name: Sathya
full_name: Peri, Sathya
last_name: Peri
- first_name: Muktikanta
full_name: Sa, Muktikanta
last_name: Sa
- first_name: Nandini
full_name: Singhal, Nandini
last_name: Singhal
citation:
ama: 'Chatterjee B, Peri S, Sa M, Singhal N. A simple and practical concurrent non-blocking
unbounded graph with linearizable reachability queries. In: ACM International
Conference Proceeding Series. ACM; 2019:168-177. doi:10.1145/3288599.3288617'
apa: 'Chatterjee, B., Peri, S., Sa, M., & Singhal, N. (2019). A simple and practical
concurrent non-blocking unbounded graph with linearizable reachability queries.
In ACM International Conference Proceeding Series (pp. 168–177). Bangalore,
India: ACM. https://doi.org/10.1145/3288599.3288617'
chicago: Chatterjee, Bapi, Sathya Peri, Muktikanta Sa, and Nandini Singhal. “A Simple
and Practical Concurrent Non-Blocking Unbounded Graph with Linearizable Reachability
Queries.” In ACM International Conference Proceeding Series, 168–77. ACM,
2019. https://doi.org/10.1145/3288599.3288617.
ieee: B. Chatterjee, S. Peri, M. Sa, and N. Singhal, “A simple and practical concurrent
non-blocking unbounded graph with linearizable reachability queries,” in ACM
International Conference Proceeding Series, Bangalore, India, 2019, pp. 168–177.
ista: 'Chatterjee B, Peri S, Sa M, Singhal N. 2019. A simple and practical concurrent
non-blocking unbounded graph with linearizable reachability queries. ACM International
Conference Proceeding Series. ICDCN: Conference on Distributed Computing and Networking,
168–177.'
mla: Chatterjee, Bapi, et al. “A Simple and Practical Concurrent Non-Blocking Unbounded
Graph with Linearizable Reachability Queries.” ACM International Conference
Proceeding Series, ACM, 2019, pp. 168–77, doi:10.1145/3288599.3288617.
short: B. Chatterjee, S. Peri, M. Sa, N. Singhal, in:, ACM International Conference
Proceeding Series, ACM, 2019, pp. 168–177.
conference:
end_date: 2019-01-07
location: Bangalore, India
name: 'ICDCN: Conference on Distributed Computing and Networking'
start_date: 2019-01-04
corr_author: '1'
date_created: 2019-02-10T22:59:17Z
date_published: 2019-01-04T00:00:00Z
date_updated: 2026-07-28T13:34:36Z
day: '04'
department:
- _id: DaAl
doi: 10.1145/3288599.3288617
external_id:
arxiv:
- '1809.00896'
isi:
- '000484491600019'
fulldoi: https://doi.org/10.1145/3288599.3288617
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1145/3288599.3288617
month: '01'
oa: 1
oa_version: Published Version
page: 168-177
publication: ACM International Conference Proceeding Series
publication_identifier:
isbn:
- '978-1-4503-6094-4 '
publication_status: published
publisher: ACM
quality_controlled: '1'
scopus_import: '1'
status: public
title: A simple and practical concurrent non-blocking unbounded graph with linearizable
reachability queries
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2019'
...
---
OA_place: repository
OA_type: green
_id: '5906'
abstract:
- lang: eng
text: We introduce a simple, exactly solvable strong-randomness renormalization
group (RG) model for the many-body localization (MBL) transition in one dimension.
Our approach relies on a family of RG flows parametrized by the asymmetry between
thermal and localized phases. We identify the physical MBL transition in the limit
of maximal asymmetry, reflecting the instability of MBL against rare thermal inclusions.
We find a critical point that is localized with power-law distributed thermal
inclusions. The typical size of critical inclusions remains finite at the transition,
while the average size is logarithmically diverging. We propose a two-parameter
scaling theory for the many-body localization transition that falls into the Kosterlitz-Thouless
universality class, with the MBL phase corresponding to a stable line of fixed
points with multifractal behavior.
article_number: '040601'
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Anya
full_name: Goremykina, Anya
last_name: Goremykina
- first_name: Romain
full_name: Vasseur, Romain
last_name: Vasseur
- first_name: Maksym
full_name: Serbyn, Maksym
id: 47809E7E-F248-11E8-B48F-1D18A9856A87
last_name: Serbyn
orcid: 0000-0002-2399-5827
citation:
ama: Goremykina A, Vasseur R, Serbyn M. Analytically solvable renormalization group
for the many-body localization transition. Physical Review Letters. 2019;122(4).
doi:10.1103/physrevlett.122.040601
apa: Goremykina, A., Vasseur, R., & Serbyn, M. (2019). Analytically solvable
renormalization group for the many-body localization transition. Physical Review
Letters. American Physical Society. https://doi.org/10.1103/physrevlett.122.040601
chicago: Goremykina, Anya, Romain Vasseur, and Maksym Serbyn. “Analytically Solvable
Renormalization Group for the Many-Body Localization Transition.” Physical
Review Letters. American Physical Society, 2019. https://doi.org/10.1103/physrevlett.122.040601.
ieee: A. Goremykina, R. Vasseur, and M. Serbyn, “Analytically solvable renormalization
group for the many-body localization transition,” Physical Review Letters,
vol. 122, no. 4. American Physical Society, 2019.
ista: Goremykina A, Vasseur R, Serbyn M. 2019. Analytically solvable renormalization
group for the many-body localization transition. Physical Review Letters. 122(4),
040601.
mla: Goremykina, Anya, et al. “Analytically Solvable Renormalization Group for the
Many-Body Localization Transition.” Physical Review Letters, vol. 122,
no. 4, 040601, American Physical Society, 2019, doi:10.1103/physrevlett.122.040601.
short: A. Goremykina, R. Vasseur, M. Serbyn, Physical Review Letters 122 (2019).
date_created: 2019-02-01T08:22:28Z
date_published: 2019-02-01T00:00:00Z
date_updated: 2026-07-28T13:42:52Z
day: '01'
department:
- _id: MaSe
doi: 10.1103/physrevlett.122.040601
external_id:
arxiv:
- '1807.04285'
isi:
- '000456783700001'
fulldoi: https://doi.org/10.1103/physrevlett.122.040601
intvolume: ' 122'
isi: 1
issue: '4'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1807.04285
month: '02'
oa: 1
oa_version: Preprint
publication: Physical Review Letters
publication_identifier:
eissn:
- 1079-7114
issn:
- 0031-9007
publication_status: published
publisher: American Physical Society
quality_controlled: '1'
scopus_import: '1'
status: public
title: Analytically solvable renormalization group for the many-body localization
transition
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 122
year: '2019'
...
---
_id: '9790'
article_processing_charge: No
author:
- first_name: Victoria
full_name: Pokusaeva, Victoria
id: 3184041C-F248-11E8-B48F-1D18A9856A87
last_name: Pokusaeva
orcid: 0000-0001-7660-444X
- first_name: Dinara R.
full_name: Usmanova, Dinara R.
last_name: Usmanova
- first_name: Ekaterina V.
full_name: Putintseva, Ekaterina V.
last_name: Putintseva
- first_name: Lorena
full_name: Espinar, Lorena
last_name: Espinar
- first_name: Karen
full_name: Sarkisyan, Karen
id: 39A7BF80-F248-11E8-B48F-1D18A9856A87
last_name: Sarkisyan
orcid: 0000-0002-5375-6341
- first_name: Alexander S.
full_name: Mishin, Alexander S.
last_name: Mishin
- first_name: Natalya S.
full_name: Bogatyreva, Natalya S.
last_name: Bogatyreva
- first_name: Dmitry
full_name: Ivankov, Dmitry
id: 49FF1036-F248-11E8-B48F-1D18A9856A87
last_name: Ivankov
orcid: 0000-0002-8224-4118
- first_name: Arseniy
full_name: Akopyan, Arseniy
id: 430D2C90-F248-11E8-B48F-1D18A9856A87
last_name: Akopyan
orcid: 0000-0002-2548-617X
- first_name: Sergey
full_name: Avvakumov, Sergey
id: 3827DAC8-F248-11E8-B48F-1D18A9856A87
last_name: Avvakumov
orcid: 0000-0002-7840-5062
- first_name: Inna S.
full_name: Povolotskaya, Inna S.
last_name: Povolotskaya
- first_name: Guillaume J.
full_name: Filion, Guillaume J.
last_name: Filion
- first_name: Lucas B.
full_name: Carey, Lucas B.
last_name: Carey
- first_name: Fyodor
full_name: Kondrashov, Fyodor
id: 44FDEF62-F248-11E8-B48F-1D18A9856A87
last_name: Kondrashov
orcid: 0000-0001-8243-4694
citation:
ama: Pokusaeva V, Usmanova DR, Putintseva EV, et al. A statistical summary of segment
libraries and sequencing results. 2019. doi:10.1371/journal.pgen.1008079.s011
apa: Pokusaeva, V., Usmanova, D. R., Putintseva, E. V., Espinar, L., Sarkisyan,
K., Mishin, A. S., … Kondrashov, F. (2019). A statistical summary of segment libraries
and sequencing results. Public Library of Science. https://doi.org/10.1371/journal.pgen.1008079.s011
chicago: Pokusaeva, Victoria, Dinara R. Usmanova, Ekaterina V. Putintseva, Lorena
Espinar, Karen Sarkisyan, Alexander S. Mishin, Natalya S. Bogatyreva, et al. “A
Statistical Summary of Segment Libraries and Sequencing Results.” Public Library
of Science, 2019. https://doi.org/10.1371/journal.pgen.1008079.s011.
ieee: V. Pokusaeva et al., “A statistical summary of segment libraries and
sequencing results.” Public Library of Science, 2019.
ista: Pokusaeva V, Usmanova DR, Putintseva EV, Espinar L, Sarkisyan K, Mishin AS,
Bogatyreva NS, Ivankov D, Akopyan A, Avvakumov S, Povolotskaya IS, Filion GJ,
Carey LB, Kondrashov F. 2019. A statistical summary of segment libraries and sequencing
results, Public Library of Science, 10.1371/journal.pgen.1008079.s011.
mla: Pokusaeva, Victoria, et al. A Statistical Summary of Segment Libraries and
Sequencing Results. Public Library of Science, 2019, doi:10.1371/journal.pgen.1008079.s011.
short: V. Pokusaeva, D.R. Usmanova, E.V. Putintseva, L. Espinar, K. Sarkisyan, A.S.
Mishin, N.S. Bogatyreva, D. Ivankov, A. Akopyan, S. Avvakumov, I.S. Povolotskaya,
G.J. Filion, L.B. Carey, F. Kondrashov, (2019).
date_created: 2021-08-06T08:50:15Z
date_published: 2019-04-10T00:00:00Z
date_updated: 2026-07-28T13:29:02Z
day: '10'
department:
- _id: FyKo
doi: 10.1371/journal.pgen.1008079.s011
fulldoi: https://doi.org/10.1371/journal.pgen.1008079.s011
month: '04'
oa_version: Published Version
publisher: Public Library of Science
related_material:
record:
- id: '6419'
relation: used_in_publication
status: public
status: public
title: A statistical summary of segment libraries and sequencing results
type: research_data_reference
user_id: 6785fbc1-c503-11eb-8a32-93094b40e1cf
year: '2019'
...
---
_id: '9797'
article_processing_charge: No
author:
- first_name: Victoria
full_name: Pokusaeva, Victoria
id: 3184041C-F248-11E8-B48F-1D18A9856A87
last_name: Pokusaeva
orcid: 0000-0001-7660-444X
- first_name: Dinara R.
full_name: Usmanova, Dinara R.
last_name: Usmanova
- first_name: Ekaterina V.
full_name: Putintseva, Ekaterina V.
last_name: Putintseva
- first_name: Lorena
full_name: Espinar, Lorena
last_name: Espinar
- first_name: Karen
full_name: Sarkisyan, Karen
id: 39A7BF80-F248-11E8-B48F-1D18A9856A87
last_name: Sarkisyan
orcid: 0000-0002-5375-6341
- first_name: Alexander S.
full_name: Mishin, Alexander S.
last_name: Mishin
- first_name: Natalya S.
full_name: Bogatyreva, Natalya S.
last_name: Bogatyreva
- first_name: Dmitry
full_name: Ivankov, Dmitry
id: 49FF1036-F248-11E8-B48F-1D18A9856A87
last_name: Ivankov
orcid: 0000-0002-8224-4118
- first_name: Arseniy
full_name: Akopyan, Arseniy
id: 430D2C90-F248-11E8-B48F-1D18A9856A87
last_name: Akopyan
orcid: 0000-0002-2548-617X
- first_name: Inna S.
full_name: Povolotskaya, Inna S.
last_name: Povolotskaya
- first_name: Guillaume J.
full_name: Filion, Guillaume J.
last_name: Filion
- first_name: Lucas B.
full_name: Carey, Lucas B.
last_name: Carey
- first_name: Fyodor
full_name: Kondrashov, Fyodor
id: 44FDEF62-F248-11E8-B48F-1D18A9856A87
last_name: Kondrashov
orcid: 0000-0001-8243-4694
citation:
ama: Pokusaeva V, Usmanova DR, Putintseva EV, et al. A statistical summary of segment
libraries and sequencing results. 2019. doi:10.1371/journal.pgen.1008079.s011
apa: Pokusaeva, V., Usmanova, D. R., Putintseva, E. V., Espinar, L., Sarkisyan,
K., Mishin, A. S., … Kondrashov, F. (2019). A statistical summary of segment libraries
and sequencing results. Public Library of Science. https://doi.org/10.1371/journal.pgen.1008079.s011
chicago: Pokusaeva, Victoria, Dinara R. Usmanova, Ekaterina V. Putintseva, Lorena
Espinar, Karen Sarkisyan, Alexander S. Mishin, Natalya S. Bogatyreva, et al. “A
Statistical Summary of Segment Libraries and Sequencing Results.” Public Library
of Science, 2019. https://doi.org/10.1371/journal.pgen.1008079.s011.
ieee: V. Pokusaeva et al., “A statistical summary of segment libraries and
sequencing results.” Public Library of Science, 2019.
ista: Pokusaeva V, Usmanova DR, Putintseva EV, Espinar L, Sarkisyan K, Mishin AS,
Bogatyreva NS, Ivankov D, Akopyan A, Povolotskaya IS, Filion GJ, Carey LB, Kondrashov
F. 2019. A statistical summary of segment libraries and sequencing results, Public
Library of Science, 10.1371/journal.pgen.1008079.s011.
mla: Pokusaeva, Victoria, et al. A Statistical Summary of Segment Libraries and
Sequencing Results. Public Library of Science, 2019, doi:10.1371/journal.pgen.1008079.s011.
short: V. Pokusaeva, D.R. Usmanova, E.V. Putintseva, L. Espinar, K. Sarkisyan, A.S.
Mishin, N.S. Bogatyreva, D. Ivankov, A. Akopyan, I.S. Povolotskaya, G.J. Filion,
L.B. Carey, F. Kondrashov, (2019).
date_created: 2021-08-06T11:08:20Z
date_published: 2019-04-10T00:00:00Z
date_updated: 2026-07-28T13:29:02Z
day: '10'
department:
- _id: FyKo
doi: 10.1371/journal.pgen.1008079.s011
fulldoi: https://doi.org/10.1371/journal.pgen.1008079.s011
month: '04'
oa_version: Published Version
publisher: Public Library of Science
related_material:
record:
- id: '6419'
relation: used_in_publication
status: public
status: public
title: A statistical summary of segment libraries and sequencing results
type: research_data_reference
user_id: 6785fbc1-c503-11eb-8a32-93094b40e1cf
year: '2019'
...
---
_id: '9789'
article_processing_charge: No
author:
- first_name: Victoria
full_name: Pokusaeva, Victoria
id: 3184041C-F248-11E8-B48F-1D18A9856A87
last_name: Pokusaeva
orcid: 0000-0001-7660-444X
- first_name: Dinara R.
full_name: Usmanova, Dinara R.
last_name: Usmanova
- first_name: Ekaterina V.
full_name: Putintseva, Ekaterina V.
last_name: Putintseva
- first_name: Lorena
full_name: Espinar, Lorena
last_name: Espinar
- first_name: Karen
full_name: Sarkisyan, Karen
id: 39A7BF80-F248-11E8-B48F-1D18A9856A87
last_name: Sarkisyan
orcid: 0000-0002-5375-6341
- first_name: Alexander S.
full_name: Mishin, Alexander S.
last_name: Mishin
- first_name: Natalya S.
full_name: Bogatyreva, Natalya S.
last_name: Bogatyreva
- first_name: Dmitry
full_name: Ivankov, Dmitry
id: 49FF1036-F248-11E8-B48F-1D18A9856A87
last_name: Ivankov
orcid: 0000-0002-8224-4118
- first_name: Arseniy
full_name: Akopyan, Arseniy
id: 430D2C90-F248-11E8-B48F-1D18A9856A87
last_name: Akopyan
orcid: 0000-0002-2548-617X
- first_name: Sergey
full_name: Avvakumov, Sergey
id: 3827DAC8-F248-11E8-B48F-1D18A9856A87
last_name: Avvakumov
orcid: 0000-0002-7840-5062
- first_name: Inna S.
full_name: Povolotskaya, Inna S.
last_name: Povolotskaya
- first_name: Guillaume J.
full_name: Filion, Guillaume J.
last_name: Filion
- first_name: Lucas B.
full_name: Carey, Lucas B.
last_name: Carey
- first_name: Fyodor
full_name: Kondrashov, Fyodor
id: 44FDEF62-F248-11E8-B48F-1D18A9856A87
last_name: Kondrashov
orcid: 0000-0001-8243-4694
citation:
ama: Pokusaeva V, Usmanova DR, Putintseva EV, et al. Multiple alignment of His3
orthologues. 2019. doi:10.1371/journal.pgen.1008079.s010
apa: Pokusaeva, V., Usmanova, D. R., Putintseva, E. V., Espinar, L., Sarkisyan,
K., Mishin, A. S., … Kondrashov, F. (2019). Multiple alignment of His3 orthologues.
Public Library of Science. https://doi.org/10.1371/journal.pgen.1008079.s010
chicago: Pokusaeva, Victoria, Dinara R. Usmanova, Ekaterina V. Putintseva, Lorena
Espinar, Karen Sarkisyan, Alexander S. Mishin, Natalya S. Bogatyreva, et al. “Multiple
Alignment of His3 Orthologues.” Public Library of Science, 2019. https://doi.org/10.1371/journal.pgen.1008079.s010.
ieee: V. Pokusaeva et al., “Multiple alignment of His3 orthologues.” Public
Library of Science, 2019.
ista: Pokusaeva V, Usmanova DR, Putintseva EV, Espinar L, Sarkisyan K, Mishin AS,
Bogatyreva NS, Ivankov D, Akopyan A, Avvakumov S, Povolotskaya IS, Filion GJ,
Carey LB, Kondrashov F. 2019. Multiple alignment of His3 orthologues, Public Library
of Science, 10.1371/journal.pgen.1008079.s010.
mla: Pokusaeva, Victoria, et al. Multiple Alignment of His3 Orthologues.
Public Library of Science, 2019, doi:10.1371/journal.pgen.1008079.s010.
short: V. Pokusaeva, D.R. Usmanova, E.V. Putintseva, L. Espinar, K. Sarkisyan, A.S.
Mishin, N.S. Bogatyreva, D. Ivankov, A. Akopyan, S. Avvakumov, I.S. Povolotskaya,
G.J. Filion, L.B. Carey, F. Kondrashov, (2019).
date_created: 2021-08-06T08:38:50Z
date_published: 2019-04-10T00:00:00Z
date_updated: 2026-07-28T13:29:01Z
day: '10'
department:
- _id: FyKo
doi: 10.1371/journal.pgen.1008079.s010
fulldoi: https://doi.org/10.1371/journal.pgen.1008079.s010
month: '04'
oa_version: Published Version
publisher: Public Library of Science
related_material:
record:
- id: '6419'
relation: used_in_publication
status: public
status: public
title: Multiple alignment of His3 orthologues
type: research_data_reference
user_id: 6785fbc1-c503-11eb-8a32-93094b40e1cf
year: '2019'
...
---
OA_place: publisher
_id: '6179'
abstract:
- lang: eng
text: "In the first part of this thesis we consider large random matrices with arbitrary
expectation and a general slowly decaying correlation among its entries. We prove
universality of the local eigenvalue statistics and optimal local laws for the
resolvent in the bulk and edge regime. The main novel tool is a systematic diagrammatic
control of a multivariate cumulant expansion.\r\nIn the second part we consider
Wigner-type matrices and show that at any cusp singularity of the limiting eigenvalue
distribution the local eigenvalue statistics are uni- versal and form a Pearcey
process. Since the density of states typically exhibits only square root or cubic
root cusp singularities, our work complements previous results on the bulk and
edge universality and it thus completes the resolution of the Wigner- Dyson-Mehta
universality conjecture for the last remaining universality type. Our analysis
holds not only for exact cusps, but approximate cusps as well, where an ex- tended
Pearcey process emerges. As a main technical ingredient we prove an optimal local
law at the cusp, and extend the fast relaxation to equilibrium of the Dyson Brow-
nian motion to the cusp regime.\r\nIn the third and final part we explore the
entrywise linear statistics of Wigner ma- trices and identify the fluctuations
for a large class of test functions with little regularity. This enables us to
study the rectangular Young diagram obtained from the interlacing eigenvalues
of the random matrix and its minor, and we find that, despite having the same
limit, the fluctuations differ from those of the algebraic Young tableaux equipped
with the Plancharel measure."
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Dominik J
full_name: Schröder, Dominik J
id: 408ED176-F248-11E8-B48F-1D18A9856A87
last_name: Schröder
orcid: 0000-0002-2904-1856
citation:
ama: 'Schröder DJ. From Dyson to Pearcey: Universal statistics in random matrix
theory. 2019. doi:10.15479/AT:ISTA:th6179'
apa: 'Schröder, D. J. (2019). From Dyson to Pearcey: Universal statistics in
random matrix theory. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:th6179'
chicago: 'Schröder, Dominik J. “From Dyson to Pearcey: Universal Statistics in Random
Matrix Theory.” Institute of Science and Technology Austria, 2019. https://doi.org/10.15479/AT:ISTA:th6179.'
ieee: 'D. J. Schröder, “From Dyson to Pearcey: Universal statistics in random matrix
theory,” Institute of Science and Technology Austria, 2019.'
ista: 'Schröder DJ. 2019. From Dyson to Pearcey: Universal statistics in random
matrix theory. Institute of Science and Technology Austria.'
mla: 'Schröder, Dominik J. From Dyson to Pearcey: Universal Statistics in Random
Matrix Theory. Institute of Science and Technology Austria, 2019, doi:10.15479/AT:ISTA:th6179.'
short: 'D.J. Schröder, From Dyson to Pearcey: Universal Statistics in Random Matrix
Theory, Institute of Science and Technology Austria, 2019.'
corr_author: '1'
date_created: 2019-03-28T08:58:59Z
date_published: 2019-03-18T00:00:00Z
date_updated: 2026-07-29T13:46:20Z
day: '18'
ddc:
- '515'
- '519'
degree_awarded: PhD
department:
- _id: LaEr
- _id: GradSch
doi: 10.15479/AT:ISTA:th6179
doi_confirm: '1'
ec_funded: 1
file:
- access_level: closed
checksum: 6926f66f28079a81c4937e3764be00fc
content_type: application/x-gzip
creator: dernst
date_created: 2019-03-28T08:53:52Z
date_updated: 2020-07-14T12:47:21Z
file_id: '6180'
file_name: 2019_Schroeder_Thesis.tar.gz
file_size: 7104482
relation: source_file
- access_level: open_access
checksum: 7d0ebb8d1207e89768cdd497a5bf80fb
content_type: application/pdf
creator: dernst
date_created: 2019-03-28T08:53:52Z
date_updated: 2020-07-14T12:47:21Z
file_id: '6181'
file_name: 2019_Schroeder_Thesis.pdf
file_size: 4228794
relation: main_file
file_date_updated: 2020-07-14T12:47:21Z
fulldoi: https://doi.org/10.15479/AT:ISTA:th6179
has_accepted_license: '1'
language:
- iso: eng
month: '03'
oa: 1
oa_version: Published Version
page: '375'
project:
- _id: 258DCDE6-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '338804'
name: Random matrices, universality and disordered quantum systems
publication_identifier:
issn:
- 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
related_material:
record:
- id: '6184'
relation: part_of_dissertation
status: public
- id: '6186'
relation: part_of_dissertation
status: public
- id: '6185'
relation: part_of_dissertation
status: public
- id: '1012'
relation: part_of_dissertation
status: public
- id: '1144'
relation: part_of_dissertation
status: public
- id: '6182'
relation: part_of_dissertation
status: public
status: public
supervisor:
- first_name: László
full_name: Erdös, László
id: 4DBD5372-F248-11E8-B48F-1D18A9856A87
last_name: Erdös
orcid: 0000-0001-5366-9603
title: 'From Dyson to Pearcey: Universal statistics in random matrix theory'
type: dissertation
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
year: '2019'
...
---
_id: '6182'
abstract:
- lang: eng
text: "We consider large random matrices with a general slowly decaying correlation
among its entries. We prove universality of the local eigenvalue statistics and
optimal local laws for the resolvent away from the spectral edges, generalizing
the recent result of Ajanki et al. [‘Stability of the matrix Dyson equation and
random matrices with correlations’, Probab. Theory Related Fields 173(1–2) (2019),
293–373] to allow slow correlation decay and arbitrary expectation. The main novel
tool is\r\na systematic diagrammatic control of a multivariate cumulant expansion."
article_number: e8
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: László
full_name: Erdös, László
id: 4DBD5372-F248-11E8-B48F-1D18A9856A87
last_name: Erdös
orcid: 0000-0001-5366-9603
- first_name: Torben H
full_name: Krüger, Torben H
id: 3020C786-F248-11E8-B48F-1D18A9856A87
last_name: Krüger
orcid: 0000-0002-4821-3297
- first_name: Dominik J
full_name: Schröder, Dominik J
id: 408ED176-F248-11E8-B48F-1D18A9856A87
last_name: Schröder
orcid: 0000-0002-2904-1856
citation:
ama: Erdös L, Krüger TH, Schröder DJ. Random matrices with slow correlation decay.
Forum of Mathematics, Sigma. 2019;7. doi:10.1017/fms.2019.2
apa: Erdös, L., Krüger, T. H., & Schröder, D. J. (2019). Random matrices with
slow correlation decay. Forum of Mathematics, Sigma. Cambridge University
Press. https://doi.org/10.1017/fms.2019.2
chicago: Erdös, László, Torben H Krüger, and Dominik J Schröder. “Random Matrices
with Slow Correlation Decay.” Forum of Mathematics, Sigma. Cambridge University
Press, 2019. https://doi.org/10.1017/fms.2019.2.
ieee: L. Erdös, T. H. Krüger, and D. J. Schröder, “Random matrices with slow correlation
decay,” Forum of Mathematics, Sigma, vol. 7. Cambridge University Press,
2019.
ista: Erdös L, Krüger TH, Schröder DJ. 2019. Random matrices with slow correlation
decay. Forum of Mathematics, Sigma. 7, e8.
mla: Erdös, László, et al. “Random Matrices with Slow Correlation Decay.” Forum
of Mathematics, Sigma, vol. 7, e8, Cambridge University Press, 2019, doi:10.1017/fms.2019.2.
short: L. Erdös, T.H. Krüger, D.J. Schröder, Forum of Mathematics, Sigma 7 (2019).
corr_author: '1'
date_created: 2019-03-28T09:05:23Z
date_published: 2019-03-26T00:00:00Z
date_updated: 2026-07-29T13:46:19Z
day: '26'
ddc:
- '510'
department:
- _id: LaEr
doi: 10.1017/fms.2019.2
ec_funded: 1
external_id:
arxiv:
- '1705.10661'
isi:
- '000488847100001'
file:
- access_level: open_access
checksum: 933a472568221c73b2c3ce8c87bf6d15
content_type: application/pdf
creator: dernst
date_created: 2019-09-17T14:24:13Z
date_updated: 2020-07-14T12:47:22Z
file_id: '6883'
file_name: 2019_Forum_Erdoes.pdf
file_size: 1520344
relation: main_file
file_date_updated: 2020-07-14T12:47:22Z
fulldoi: https://doi.org/10.1017/fms.2019.2
has_accepted_license: '1'
intvolume: ' 7'
isi: 1
language:
- iso: eng
month: '03'
oa: 1
oa_version: Published Version
project:
- _id: 258DCDE6-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '338804'
name: Random matrices, universality and disordered quantum systems
publication: Forum of Mathematics, Sigma
publication_identifier:
eissn:
- 2050-5094
publication_status: published
publisher: Cambridge University Press
quality_controlled: '1'
related_material:
record:
- id: '6179'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: Random matrices with slow correlation decay
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: ba8df636-2132-11f1-aed0-ed93e2281fdd
volume: 7
year: '2019'
...
---
_id: '6186'
abstract:
- lang: eng
text: "We prove that the local eigenvalue statistics of real symmetric Wigner-type\r\nmatrices
near the cusp points of the eigenvalue density are universal. Together\r\nwith
the companion paper [arXiv:1809.03971], which proves the same result for\r\nthe
complex Hermitian symmetry class, this completes the last remaining case of\r\nthe
Wigner-Dyson-Mehta universality conjecture after bulk and edge\r\nuniversalities
have been established in the last years. We extend the recent\r\nDyson Brownian
motion analysis at the edge [arXiv:1712.03881] to the cusp\r\nregime using the
optimal local law from [arXiv:1809.03971] and the accurate\r\nlocal shape analysis
of the density from [arXiv:1506.05095, arXiv:1804.07752].\r\nWe also present a
PDE-based method to improve the estimate on eigenvalue\r\nrigidity via the maximum
principle of the heat flow related to the Dyson\r\nBrownian motion."
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Giorgio
full_name: Cipolloni, Giorgio
id: 42198EFA-F248-11E8-B48F-1D18A9856A87
last_name: Cipolloni
orcid: 0000-0002-4901-7992
- first_name: László
full_name: Erdös, László
id: 4DBD5372-F248-11E8-B48F-1D18A9856A87
last_name: Erdös
orcid: 0000-0001-5366-9603
- first_name: Torben H
full_name: Krüger, Torben H
id: 3020C786-F248-11E8-B48F-1D18A9856A87
last_name: Krüger
orcid: 0000-0002-4821-3297
- first_name: Dominik J
full_name: Schröder, Dominik J
id: 408ED176-F248-11E8-B48F-1D18A9856A87
last_name: Schröder
orcid: 0000-0002-2904-1856
citation:
ama: 'Cipolloni G, Erdös L, Krüger TH, Schröder DJ. Cusp universality for random
matrices, II: The real symmetric case. Pure and Applied Analysis . 2019;1(4):615–707.
doi:10.2140/paa.2019.1.615'
apa: 'Cipolloni, G., Erdös, L., Krüger, T. H., & Schröder, D. J. (2019). Cusp
universality for random matrices, II: The real symmetric case. Pure and Applied
Analysis . MSP. https://doi.org/10.2140/paa.2019.1.615'
chicago: 'Cipolloni, Giorgio, László Erdös, Torben H Krüger, and Dominik J Schröder.
“Cusp Universality for Random Matrices, II: The Real Symmetric Case.” Pure
and Applied Analysis . MSP, 2019. https://doi.org/10.2140/paa.2019.1.615.'
ieee: 'G. Cipolloni, L. Erdös, T. H. Krüger, and D. J. Schröder, “Cusp universality
for random matrices, II: The real symmetric case,” Pure and Applied Analysis
, vol. 1, no. 4. MSP, pp. 615–707, 2019.'
ista: 'Cipolloni G, Erdös L, Krüger TH, Schröder DJ. 2019. Cusp universality for
random matrices, II: The real symmetric case. Pure and Applied Analysis . 1(4),
615–707.'
mla: 'Cipolloni, Giorgio, et al. “Cusp Universality for Random Matrices, II: The
Real Symmetric Case.” Pure and Applied Analysis , vol. 1, no. 4, MSP, 2019,
pp. 615–707, doi:10.2140/paa.2019.1.615.'
short: G. Cipolloni, L. Erdös, T.H. Krüger, D.J. Schröder, Pure and Applied Analysis 1
(2019) 615–707.
date_created: 2019-03-28T10:21:17Z
date_published: 2019-10-12T00:00:00Z
date_updated: 2026-07-29T13:46:19Z
day: '12'
department:
- _id: LaEr
doi: 10.2140/paa.2019.1.615
ec_funded: 1
external_id:
arxiv:
- '1811.04055'
fulldoi: https://doi.org/10.2140/paa.2019.1.615
intvolume: ' 1'
issue: '4'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1811.04055
month: '10'
oa: 1
oa_version: Preprint
page: 615–707
project:
- _id: 258DCDE6-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '338804'
name: Random matrices, universality and disordered quantum systems
- _id: 2564DBCA-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '665385'
name: International IST Doctoral Program
publication: 'Pure and Applied Analysis '
publication_identifier:
eissn:
- 2578-5885
issn:
- 2578-5893
publication_status: published
publisher: MSP
quality_controlled: '1'
related_material:
record:
- id: '6179'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: 'Cusp universality for random matrices, II: The real symmetric case'
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 1
year: '2019'
...
---
_id: '7479'
abstract:
- lang: eng
text: "Multi-exit architectures, in which a stack of processing layers is interleaved
with early output layers, allow the processing of a test example to stop early
and thus save computation time and/or energy. In this work, we propose a new
training procedure for multi-exit architectures based on the principle of knowledge
distillation. The method encourage searly exits to mimic later, more accurate
exits, by matching their output probabilities.\r\nExperiments on CIFAR100 and
\ ImageNet show that distillation-based training significantly improves the
accuracy of early exits while maintaining state-of-the-art accuracy for late
\ ones. The method is particularly beneficial when training data is limited
\ and it allows a straightforward extension to semi-supervised learning,i.e.
making use of unlabeled data at training time. Moreover, it takes only afew lines
to implement and incurs almost no computational overhead at training time, and
none at all at test time."
article_processing_charge: No
author:
- first_name: Phuong
full_name: Bui Thi Mai, Phuong
id: 3EC6EE64-F248-11E8-B48F-1D18A9856A87
last_name: Bui Thi Mai
- first_name: Christoph
full_name: Lampert, Christoph
id: 40C20FD2-F248-11E8-B48F-1D18A9856A87
last_name: Lampert
orcid: 0000-0001-8622-7887
citation:
ama: 'Phuong M, Lampert C. Distillation-based training for multi-exit architectures.
In: IEEE International Conference on Computer Vision. Vol 2019-October.
IEEE; 2019:1355-1364. doi:10.1109/ICCV.2019.00144'
apa: 'Phuong, M., & Lampert, C. (2019). Distillation-based training for multi-exit
architectures. In IEEE International Conference on Computer Vision (Vol.
2019–October, pp. 1355–1364). Seoul, Korea: IEEE. https://doi.org/10.1109/ICCV.2019.00144'
chicago: Phuong, Mary, and Christoph Lampert. “Distillation-Based Training for Multi-Exit
Architectures.” In IEEE International Conference on Computer Vision, 2019–October:1355–64.
IEEE, 2019. https://doi.org/10.1109/ICCV.2019.00144.
ieee: M. Phuong and C. Lampert, “Distillation-based training for multi-exit architectures,”
in IEEE International Conference on Computer Vision, Seoul, Korea, 2019,
vol. 2019–October, pp. 1355–1364.
ista: 'Phuong M, Lampert C. 2019. Distillation-based training for multi-exit architectures.
IEEE International Conference on Computer Vision. ICCV: International Conference
on Computer Vision vol. 2019–October, 1355–1364.'
mla: Phuong, Mary, and Christoph Lampert. “Distillation-Based Training for Multi-Exit
Architectures.” IEEE International Conference on Computer Vision, vol.
2019–October, IEEE, 2019, pp. 1355–64, doi:10.1109/ICCV.2019.00144.
short: M. Phuong, C. Lampert, in:, IEEE International Conference on Computer Vision,
IEEE, 2019, pp. 1355–1364.
conference:
end_date: 2019-11-02
location: Seoul, Korea
name: 'ICCV: International Conference on Computer Vision'
start_date: 2019-10-27
date_created: 2020-02-11T09:06:57Z
date_published: 2019-10-01T00:00:00Z
date_updated: 2026-07-30T05:33:51Z
day: '01'
ddc:
- '000'
department:
- _id: ChLa
doi: 10.1109/ICCV.2019.00144
ec_funded: 1
external_id:
isi:
- '000531438101047'
file:
- access_level: open_access
checksum: 7b77fb5c2d27c4c37a7612ba46a66117
content_type: application/pdf
creator: bphuong
date_created: 2020-02-11T09:06:39Z
date_updated: 2020-07-14T12:47:59Z
file_id: '7480'
file_name: main.pdf
file_size: 735768
relation: main_file
file_date_updated: 2020-07-14T12:47:59Z
fulldoi: https://doi.org/10.1109/ICCV.2019.00144
has_accepted_license: '1'
isi: 1
language:
- iso: eng
month: '10'
oa: 1
oa_version: Submitted Version
page: 1355-1364
project:
- _id: 2532554C-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '308036'
name: Lifelong Learning of Visual Scene Understanding
publication: IEEE International Conference on Computer Vision
publication_identifier:
isbn:
- '9781728148038'
issn:
- 1550-5499
publication_status: published
publisher: IEEE
quality_controlled: '1'
related_material:
record:
- id: '9418'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: Distillation-based training for multi-exit architectures
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 2019-October
year: '2019'
...
---
_id: '6677'
abstract:
- lang: eng
text: "The Fiat-Shamir heuristic transforms a public-coin interactive proof into
a non-interactive argument, by replacing the verifier with a cryptographic hash
function that is applied to the protocol’s transcript. Constructing hash functions
for which this transformation is sound is a central and long-standing open question
in cryptography.\r\n\r\nWe show that solving the END−OF−METERED−LINE problem is
no easier than breaking the soundness of the Fiat-Shamir transformation when applied
to the sumcheck protocol. In particular, if the transformed protocol is sound,
then any hard problem in #P gives rise to a hard distribution in the class CLS,
which is contained in PPAD. Our result opens up the possibility of sampling moderately-sized
games for which it is hard to find a Nash equilibrium, by reducing the inversion
of appropriately chosen one-way functions to #SAT.\r\n\r\nOur main technical contribution
is a stateful incrementally verifiable procedure that, given a SAT instance over
n variables, counts the number of satisfying assignments. This is accomplished
via an exponential sequence of small steps, each computable in time poly(n). Incremental
verifiability means that each intermediate state includes a sumcheck-based proof
of its correctness, and the proof can be updated and verified in time poly(n)."
article_processing_charge: No
author:
- first_name: Arka Rai
full_name: Choudhuri, Arka Rai
last_name: Choudhuri
- first_name: Pavel
full_name: Hubáček, Pavel
last_name: Hubáček
- first_name: Chethan
full_name: Kamath Hosdurg, Chethan
id: 4BD3F30E-F248-11E8-B48F-1D18A9856A87
last_name: Kamath Hosdurg
orcid: 0009-0006-6812-7317
- first_name: Krzysztof Z
full_name: Pietrzak, Krzysztof Z
id: 3E04A7AA-F248-11E8-B48F-1D18A9856A87
last_name: Pietrzak
orcid: 0000-0002-9139-1654
- first_name: Alon
full_name: Rosen, Alon
last_name: Rosen
- first_name: Guy N.
full_name: Rothblum, Guy N.
last_name: Rothblum
citation:
ama: 'Choudhuri AR, Hubáček P, Kamath Hosdurg C, Pietrzak KZ, Rosen A, Rothblum
GN. Finding a Nash equilibrium is no easier than breaking Fiat-Shamir. In: Proceedings
of the 51st Annual ACM SIGACT Symposium on Theory of Computing - STOC 2019.
ACM; 2019:1103-1114. doi:10.1145/3313276.3316400'
apa: 'Choudhuri, A. R., Hubáček, P., Kamath Hosdurg, C., Pietrzak, K. Z., Rosen,
A., & Rothblum, G. N. (2019). Finding a Nash equilibrium is no easier than
breaking Fiat-Shamir. In Proceedings of the 51st Annual ACM SIGACT Symposium
on Theory of Computing - STOC 2019 (pp. 1103–1114). Phoenix, AZ, United States:
ACM. https://doi.org/10.1145/3313276.3316400'
chicago: Choudhuri, Arka Rai, Pavel Hubáček, Chethan Kamath Hosdurg, Krzysztof Z
Pietrzak, Alon Rosen, and Guy N. Rothblum. “Finding a Nash Equilibrium Is No Easier
than Breaking Fiat-Shamir.” In Proceedings of the 51st Annual ACM SIGACT Symposium
on Theory of Computing - STOC 2019, 1103–14. ACM, 2019. https://doi.org/10.1145/3313276.3316400.
ieee: A. R. Choudhuri, P. Hubáček, C. Kamath Hosdurg, K. Z. Pietrzak, A. Rosen,
and G. N. Rothblum, “Finding a Nash equilibrium is no easier than breaking Fiat-Shamir,”
in Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing
- STOC 2019, Phoenix, AZ, United States, 2019, pp. 1103–1114.
ista: 'Choudhuri AR, Hubáček P, Kamath Hosdurg C, Pietrzak KZ, Rosen A, Rothblum
GN. 2019. Finding a Nash equilibrium is no easier than breaking Fiat-Shamir. Proceedings
of the 51st Annual ACM SIGACT Symposium on Theory of Computing - STOC 2019. STOC:
Symposium on Theory of Computing, 1103–1114.'
mla: Choudhuri, Arka Rai, et al. “Finding a Nash Equilibrium Is No Easier than Breaking
Fiat-Shamir.” Proceedings of the 51st Annual ACM SIGACT Symposium on Theory
of Computing - STOC 2019, ACM, 2019, pp. 1103–14, doi:10.1145/3313276.3316400.
short: A.R. Choudhuri, P. Hubáček, C. Kamath Hosdurg, K.Z. Pietrzak, A. Rosen, G.N.
Rothblum, in:, Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of
Computing - STOC 2019, ACM, 2019, pp. 1103–1114.
conference:
end_date: 2019-06-26
location: Phoenix, AZ, United States
name: 'STOC: Symposium on Theory of Computing'
start_date: 2019-06-23
date_created: 2019-07-24T09:20:53Z
date_published: 2019-06-01T00:00:00Z
date_updated: 2026-07-30T13:43:53Z
day: '01'
department:
- _id: KrPi
doi: 10.1145/3313276.3316400
ec_funded: 1
external_id:
isi:
- '000523199100100'
fulldoi: https://doi.org/10.1145/3313276.3316400
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://eprint.iacr.org/2019/549
month: '06'
oa: 1
oa_version: Preprint
page: 1103-1114
project:
- _id: 258AA5B2-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '682815'
name: Teaching Old Crypto New Tricks
publication: Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing -
STOC 2019
publication_identifier:
isbn:
- '9781450367059'
publication_status: published
publisher: ACM
quality_controlled: '1'
related_material:
record:
- id: '7896'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: Finding a Nash equilibrium is no easier than breaking Fiat-Shamir
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2019'
...
---
_id: '10874'
abstract:
- lang: eng
text: In this article we prove an analogue of a theorem of Lachaud, Ritzenthaler,
and Zykin, which allows us to connect invariants of binary octics to Siegel modular
forms of genus 3. We use this connection to show that certain modular functions,
when restricted to the hyperelliptic locus, assume values whose denominators are
products of powers of primes of bad reduction for the associated hyperelliptic
curves. We illustrate our theorem with explicit computations. This work is motivated
by the study of the values of these modular functions at CM points of the Siegel
upper half-space, which, if their denominators are known, can be used to effectively
compute models of (hyperelliptic, in our case) curves with CM.
acknowledgement: "The authors would like to thank the Lorentz Center in Leiden for
hosting the Women in Numbers Europe 2 workshop and providing a productive and enjoyable
environment for our initial work on this project. We are grateful to the organizers
of WIN-E2, Irene Bouw, Rachel Newton and Ekin Ozman, for making this conference
and this collaboration possible. We\r\nthank Irene Bouw and Christophe Ritzenhaler
for helpful discussions. Ionica acknowledges support from the Thomas Jefferson Fund
of the Embassy of France in the United States and the FACE Foundation. Most of Kılıçer’s
work was carried out during her stay in Universiteit Leiden and Carl von Ossietzky
Universität Oldenburg. Massierer was supported by the Australian Research Council
(DP150101689). Vincent is supported by the National Science Foundation under Grant
No. DMS-1802323 and by the Thomas Jefferson Fund of the Embassy of France in the
United States and the FACE Foundation. "
article_number: '9'
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Sorina
full_name: Ionica, Sorina
last_name: Ionica
- first_name: Pınar
full_name: Kılıçer, Pınar
last_name: Kılıçer
- first_name: Kristin
full_name: Lauter, Kristin
last_name: Lauter
- first_name: Elisa
full_name: Lorenzo García, Elisa
last_name: Lorenzo García
- first_name: Maria-Adelina
full_name: Manzateanu, Maria-Adelina
id: be8d652e-a908-11ec-82a4-e2867729459c
last_name: Manzateanu
- first_name: Maike
full_name: Massierer, Maike
last_name: Massierer
- first_name: Christelle
full_name: Vincent, Christelle
last_name: Vincent
citation:
ama: Ionica S, Kılıçer P, Lauter K, et al. Modular invariants for genus 3 hyperelliptic
curves. Research in Number Theory. 2019;5. doi:10.1007/s40993-018-0146-6
apa: Ionica, S., Kılıçer, P., Lauter, K., Lorenzo García, E., Manzateanu, M.-A.,
Massierer, M., & Vincent, C. (2019). Modular invariants for genus 3 hyperelliptic
curves. Research in Number Theory. Springer Nature. https://doi.org/10.1007/s40993-018-0146-6
chicago: Ionica, Sorina, Pınar Kılıçer, Kristin Lauter, Elisa Lorenzo García, Maria-Adelina
Manzateanu, Maike Massierer, and Christelle Vincent. “Modular Invariants for Genus
3 Hyperelliptic Curves.” Research in Number Theory. Springer Nature, 2019.
https://doi.org/10.1007/s40993-018-0146-6.
ieee: S. Ionica et al., “Modular invariants for genus 3 hyperelliptic curves,”
Research in Number Theory, vol. 5. Springer Nature, 2019.
ista: Ionica S, Kılıçer P, Lauter K, Lorenzo García E, Manzateanu M-A, Massierer
M, Vincent C. 2019. Modular invariants for genus 3 hyperelliptic curves. Research
in Number Theory. 5, 9.
mla: Ionica, Sorina, et al. “Modular Invariants for Genus 3 Hyperelliptic Curves.”
Research in Number Theory, vol. 5, 9, Springer Nature, 2019, doi:10.1007/s40993-018-0146-6.
short: S. Ionica, P. Kılıçer, K. Lauter, E. Lorenzo García, M.-A. Manzateanu, M.
Massierer, C. Vincent, Research in Number Theory 5 (2019).
das_tickbox: '0'
date_created: 2022-03-18T12:09:48Z
date_published: 2019-01-02T00:00:00Z
date_updated: 2026-08-06T12:10:57Z
day: '02'
department:
- _id: TiBr
doi: 10.1007/s40993-018-0146-6
external_id:
arxiv:
- '1807.08986'
fulldoi: https://doi.org/10.1007/s40993-018-0146-6
intvolume: ' 5'
keyword:
- Algebra and Number Theory
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1807.08986
month: '01'
oa: 1
oa_version: Preprint
publication: Research in Number Theory
publication_identifier:
eissn:
- 2363-9555
issn:
- 2522-0160
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
researchdata_availability: no
scopus_import: '1'
status: public
supplementarymaterial: no
title: Modular invariants for genus 3 hyperelliptic curves
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 5
year: '2019'
...
---
_id: '6310'
abstract:
- lang: eng
text: An asymptotic formula is established for the number of rational points of
bounded anticanonical height which lie on a certain Zariskiopen subset of an arbitrary
smooth biquadratic hypersurface in sufficiently many variables. The proof uses
the Hardy–Littlewood circle method.
article_processing_charge: No
arxiv: 1
author:
- first_name: Timothy D
full_name: Browning, Timothy D
id: 35827D50-F248-11E8-B48F-1D18A9856A87
last_name: Browning
orcid: 0000-0002-8314-0177
- first_name: L.Q.
full_name: Hu, L.Q.
last_name: Hu
citation:
ama: Browning TD, Hu LQ. Counting rational points on biquadratic hypersurfaces.
Advances in Mathematics. 2019;349:920-940. doi:10.1016/j.aim.2019.04.031
apa: Browning, T. D., & Hu, L. Q. (2019). Counting rational points on biquadratic
hypersurfaces. Advances in Mathematics. Elsevier. https://doi.org/10.1016/j.aim.2019.04.031
chicago: Browning, Timothy D, and L.Q. Hu. “Counting Rational Points on Biquadratic
Hypersurfaces.” Advances in Mathematics. Elsevier, 2019. https://doi.org/10.1016/j.aim.2019.04.031.
ieee: T. D. Browning and L. Q. Hu, “Counting rational points on biquadratic hypersurfaces,”
Advances in Mathematics, vol. 349. Elsevier, pp. 920–940, 2019.
ista: Browning TD, Hu LQ. 2019. Counting rational points on biquadratic hypersurfaces.
Advances in Mathematics. 349, 920–940.
mla: Browning, Timothy D., and L. Q. Hu. “Counting Rational Points on Biquadratic
Hypersurfaces.” Advances in Mathematics, vol. 349, Elsevier, 2019, pp.
920–40, doi:10.1016/j.aim.2019.04.031.
short: T.D. Browning, L.Q. Hu, Advances in Mathematics 349 (2019) 920–940.
das_tickbox: '0'
date_created: 2019-04-16T09:13:25Z
date_published: 2019-06-20T00:00:00Z
date_updated: 2026-08-06T12:11:51Z
day: '20'
ddc:
- '512'
department:
- _id: TiBr
doi: 10.1016/j.aim.2019.04.031
external_id:
arxiv:
- '1810.08426'
isi:
- '000468857300025'
file:
- access_level: open_access
checksum: a63594a3a91b4ba6e2a1b78b0720b3d0
content_type: application/pdf
creator: tbrownin
date_created: 2019-04-16T09:12:20Z
date_updated: 2020-07-14T12:47:27Z
file_id: '6311'
file_name: wliqun.pdf
file_size: 379158
relation: main_file
file_date_updated: 2020-07-14T12:47:27Z
fulldoi: https://doi.org/10.1016/j.aim.2019.04.031
has_accepted_license: '1'
intvolume: ' 349'
isi: 1
language:
- iso: eng
month: '06'
oa: 1
oa_version: Submitted Version
page: 920-940
publication: Advances in Mathematics
publication_identifier:
eissn:
- 1090-2082
issn:
- 0001-8708
publication_status: published
publisher: Elsevier
quality_controlled: '1'
researchdata_availability: no
scopus_import: '1'
status: public
supplementarymaterial: no
title: Counting rational points on biquadratic hypersurfaces
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 349
year: '2019'
...
---
_id: '6835'
abstract:
- lang: eng
text: We derive the Hasse principle and weak approximation for fibrations of certain
varieties in the spirit of work by Colliot-Thélène–Sansuc and Harpaz–Skorobogatov–Wittenberg.
Our varieties are defined through polynomials in many variables and part of our
work is devoted to establishing Schinzel's hypothesis for polynomials of this
kind. This last part is achieved by using arguments behind Birch's well-known
result regarding the Hasse principle for complete intersections with the notable
difference that we prove our result in 50% fewer variables than in the classical
Birch setting. We also study the problem of square-free values of an integer polynomial
with 66.6% fewer variables than in the Birch setting.
article_number: '102794'
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Kevin N
full_name: Destagnol, Kevin N
id: 44DDECBC-F248-11E8-B48F-1D18A9856A87
last_name: Destagnol
- first_name: Efthymios
full_name: Sofos, Efthymios
last_name: Sofos
citation:
ama: Destagnol KN, Sofos E. Rational points and prime values of polynomials in moderately
many variables. Bulletin des Sciences Mathematiques. 2019;156(11). doi:10.1016/j.bulsci.2019.102794
apa: Destagnol, K. N., & Sofos, E. (2019). Rational points and prime values
of polynomials in moderately many variables. Bulletin Des Sciences Mathematiques.
Elsevier. https://doi.org/10.1016/j.bulsci.2019.102794
chicago: Destagnol, Kevin N, and Efthymios Sofos. “Rational Points and Prime Values
of Polynomials in Moderately Many Variables.” Bulletin Des Sciences Mathematiques.
Elsevier, 2019. https://doi.org/10.1016/j.bulsci.2019.102794.
ieee: K. N. Destagnol and E. Sofos, “Rational points and prime values of polynomials
in moderately many variables,” Bulletin des Sciences Mathematiques, vol.
156, no. 11. Elsevier, 2019.
ista: Destagnol KN, Sofos E. 2019. Rational points and prime values of polynomials
in moderately many variables. Bulletin des Sciences Mathematiques. 156(11), 102794.
mla: Destagnol, Kevin N., and Efthymios Sofos. “Rational Points and Prime Values
of Polynomials in Moderately Many Variables.” Bulletin Des Sciences Mathematiques,
vol. 156, no. 11, 102794, Elsevier, 2019, doi:10.1016/j.bulsci.2019.102794.
short: K.N. Destagnol, E. Sofos, Bulletin Des Sciences Mathematiques 156 (2019).
das_tickbox: '0'
date_created: 2019-09-01T22:00:55Z
date_published: 2019-11-01T00:00:00Z
date_updated: 2026-08-06T12:19:04Z
day: '01'
department:
- _id: TiBr
doi: 10.1016/j.bulsci.2019.102794
external_id:
arxiv:
- '1801.03082'
isi:
- '000496342100002'
fulldoi: https://doi.org/10.1016/j.bulsci.2019.102794
intvolume: ' 156'
isi: 1
issue: '11'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1801.03082
month: '11'
oa: 1
oa_version: Preprint
publication: Bulletin des Sciences Mathematiques
publication_identifier:
issn:
- 0007-4497
publication_status: published
publisher: Elsevier
quality_controlled: '1'
researchdata_availability: no
scopus_import: '1'
status: public
supplementarymaterial: no
title: Rational points and prime values of polynomials in moderately many variables
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 156
year: '2019'
...
---
_id: '175'
abstract:
- lang: eng
text: An upper bound sieve for rational points on suitable varieties isdeveloped,
together with applications tocounting rational points in thin sets,to local solubility
in families, and to the notion of “friable” rational pointswith respect to divisors.
In the special case of quadrics, sharper estimates areobtained by developing a
version of the Selberg sieve for rational points.
article_processing_charge: No
arxiv: 1
author:
- first_name: Timothy D
full_name: Browning, Timothy D
id: 35827D50-F248-11E8-B48F-1D18A9856A87
last_name: Browning
orcid: 0000-0002-8314-0177
- first_name: Daniel
full_name: Loughran, Daniel
last_name: Loughran
citation:
ama: Browning TD, Loughran D. Sieving rational points on varieties. Transactions
of the American Mathematical Society. 2019;371(8):5757-5785. doi:10.1090/tran/7514
apa: Browning, T. D., & Loughran, D. (2019). Sieving rational points on varieties.
Transactions of the American Mathematical Society. American Mathematical
Society. https://doi.org/10.1090/tran/7514
chicago: Browning, Timothy D, and Daniel Loughran. “Sieving Rational Points on Varieties.”
Transactions of the American Mathematical Society. American Mathematical
Society, 2019. https://doi.org/10.1090/tran/7514.
ieee: T. D. Browning and D. Loughran, “Sieving rational points on varieties,” Transactions
of the American Mathematical Society, vol. 371, no. 8. American Mathematical
Society, pp. 5757–5785, 2019.
ista: Browning TD, Loughran D. 2019. Sieving rational points on varieties. Transactions
of the American Mathematical Society. 371(8), 5757–5785.
mla: Browning, Timothy D., and Daniel Loughran. “Sieving Rational Points on Varieties.”
Transactions of the American Mathematical Society, vol. 371, no. 8, American
Mathematical Society, 2019, pp. 5757–85, doi:10.1090/tran/7514.
short: T.D. Browning, D. Loughran, Transactions of the American Mathematical Society
371 (2019) 5757–5785.
das_tickbox: '0'
date_created: 2018-12-11T11:45:01Z
date_published: 2019-04-15T00:00:00Z
date_updated: 2026-08-06T12:12:46Z
day: '15'
department:
- _id: TiBr
doi: 10.1090/tran/7514
external_id:
arxiv:
- '1705.01999'
isi:
- '000464034200019'
fulldoi: https://doi.org/10.1090/tran/7514
intvolume: ' 371'
isi: 1
issue: '8'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1705.01999
month: '04'
oa: 1
oa_version: Preprint
page: 5757-5785
publication: Transactions of the American Mathematical Society
publication_identifier:
eissn:
- 1088-6850
issn:
- 0002-9947
publication_status: published
publisher: American Mathematical Society
publist_id: '7746'
quality_controlled: '1'
researchdata_availability: no
scopus_import: '1'
status: public
supplementarymaterial: no
title: Sieving rational points on varieties
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 371
year: '2019'
...