---
_id: '17075'
abstract:
- lang: eng
text: Disorders associated with the malfunction of amino acid transporters mainly
affect the function of the intestine, kidney, brain, and liver. Mutations of brain
amino acid transporters, for example, alter neuronal excitability (e.g., episodic
ataxia due to SLC1A3 (EAAT1) defect and hyperekplexia due to SLC6A5 (GLYT2) deficiency)
or brain development (SLC1A1 (EAAT3), SLC3A2/SLC7A5 (CD98hc/LAT1), and SLC1A4
(ASCT1) deficiencies). Mutations of renal and intestinal amino acid transporters
SLC3A1/SLC7A9 (rBAT/b0,+AT) and SLC1A1 (EAAT3) cause renal problems (cystinuria
and dicarboxylic aminoaciduria, respectively) and malabsorption that can affect
whole-body homoeostasis (Hartnup disorder SLC6A19 (B0AT1), lysinuric protein intolerance
SLC3A2/SLC7A7 (CD98hc/y+LAT1), and hyperdibasic aminoaciduria type 1). Mutations
in the neuronal system A amino acid transporter SLC38A8 (SNAT8) cause eye developmental
and visual defects. Inborn errors associated with mitochondrial SLC25 family members
such as SLC25A12 (neuronal- and muscle-specific mitochondrial aspartate/glutamate
transporter 1; AGC1) (global cerebral hypomyelination), SLC25A13 (aspartate/glutamate
transporter 2) (citrin deficiency), SLC25A15 (ornithine-citrulline carrier 2)
(homocitrullinuria, hyperornithinemia, and hyperammonemia syndrome), and SLC25A22
(mitochondrial glutamate/H+ symporter 1, GC1) (neonatal myoclonic epilepsy) will
be dealt within Chap. 43 (defects of mitochondrial carriers).
acknowledgement: The authors thank Dr. Christian Lueck (Canberra Hospital) for clarification
of differential diagnosis in cases of episodic ataxia. The authors thank Dr. Rafael
Artuch (Hospital San Joan de Deu, Barcelona) for reference values of plasma amino
acid concentration. The authors also thank Lisa Kraus (Institute of Science and
Technology-Austria) and Dr. Susanna Bodoy (IRB-Barcelona) that helped in preparing
tables and bibliography.
article_processing_charge: No
author:
- first_name: Manuel
full_name: Palacín, Manuel
last_name: Palacín
- first_name: Stefan
full_name: Bröer, Stefan
last_name: Bröer
- first_name: Gaia
full_name: Novarino, Gaia
id: 3E57A680-F248-11E8-B48F-1D18A9856A87
last_name: Novarino
orcid: 0000-0002-7673-7178
citation:
ama: 'Palacín M, Bröer S, Novarino G. Amino Acid Transport Defects. In: Blau N,
Vici CD, Ferreira CR, Vianey-Saban C, van Karnebeek CDM, eds. Physician’s Guide
to the Diagnosis, Treatment, and Follow-Up of Inherited Metabolic Diseases.
2nd ed. Cham: Springer Nature; 2022:291-312. doi:10.1007/978-3-030-67727-5_18'
apa: 'Palacín, M., Bröer, S., & Novarino, G. (2022). Amino Acid Transport Defects.
In N. Blau, C. D. Vici, C. R. Ferreira, C. Vianey-Saban, & C. D. M. van Karnebeek
(Eds.), Physician’s Guide to the Diagnosis, Treatment, and Follow-Up of Inherited
Metabolic Diseases (2nd ed., pp. 291–312). Cham: Springer Nature. https://doi.org/10.1007/978-3-030-67727-5_18'
chicago: 'Palacín, Manuel, Stefan Bröer, and Gaia Novarino. “Amino Acid Transport
Defects.” In Physician’s Guide to the Diagnosis, Treatment, and Follow-Up of
Inherited Metabolic Diseases, edited by Nenad Blau, Carlo Dionisi Vici, Carlos
R. Ferreira, Christine Vianey-Saban, and Clara D.M. van Karnebeek, 2nd ed., 291–312.
Cham: Springer Nature, 2022. https://doi.org/10.1007/978-3-030-67727-5_18.'
ieee: 'M. Palacín, S. Bröer, and G. Novarino, “Amino Acid Transport Defects,” in
Physician’s Guide to the Diagnosis, Treatment, and Follow-Up of Inherited Metabolic
Diseases, 2nd ed., N. Blau, C. D. Vici, C. R. Ferreira, C. Vianey-Saban, and
C. D. M. van Karnebeek, Eds. Cham: Springer Nature, 2022, pp. 291–312.'
ista: 'Palacín M, Bröer S, Novarino G. 2022.Amino Acid Transport Defects. In: Physician’s
Guide to the Diagnosis, Treatment, and Follow-Up of Inherited Metabolic Diseases.
, 291–312.'
mla: Palacín, Manuel, et al. “Amino Acid Transport Defects.” Physician’s Guide
to the Diagnosis, Treatment, and Follow-Up of Inherited Metabolic Diseases,
edited by Nenad Blau et al., 2nd ed., Springer Nature, 2022, pp. 291–312, doi:10.1007/978-3-030-67727-5_18.
short: M. Palacín, S. Bröer, G. Novarino, in:, N. Blau, C.D. Vici, C.R. Ferreira,
C. Vianey-Saban, C.D.M. van Karnebeek (Eds.), Physician’s Guide to the Diagnosis,
Treatment, and Follow-Up of Inherited Metabolic Diseases, 2nd ed., Springer Nature,
Cham, 2022, pp. 291–312.
date_created: 2024-05-29T06:13:04Z
date_published: 2022-02-22T00:00:00Z
date_updated: 2024-07-31T11:45:50Z
day: '22'
department:
- _id: GaNo
doi: 10.1007/978-3-030-67727-5_18
edition: '2'
editor:
- first_name: Nenad
full_name: Blau, Nenad
last_name: Blau
- first_name: Carlo Dionisi
full_name: Vici, Carlo Dionisi
last_name: Vici
- first_name: 'Carlos R. '
full_name: 'Ferreira, Carlos R. '
last_name: Ferreira
- first_name: Christine
full_name: Vianey-Saban, Christine
last_name: Vianey-Saban
- first_name: Clara D.M.
full_name: van Karnebeek, Clara D.M.
last_name: van Karnebeek
fulldoi: https://doi.org/10.1007/978-3-030-67727-5_18
language:
- iso: eng
month: '02'
oa_version: None
page: 291-312
place: Cham
publication: Physician's Guide to the Diagnosis, Treatment, and Follow-Up of Inherited
Metabolic Diseases
publication_identifier:
eisbn:
- '9783030677275'
isbn:
- '9783030677268'
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Amino Acid Transport Defects
type: book_chapter
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2022'
...
---
_id: '17077'
abstract:
- lang: eng
text: "Resolving a conjecture of Füredi from 1988, we prove that with high probability,
the random graph \U0001D53E(\U0001D45B, 1/2) admits a friendly bisection of its
vertex set, i.e., a\r\npartition of its vertex set into two parts whose sizes
differ by at most one in which\r\n\U0001D45B − \U0001D45C(\U0001D45B) vertices
have more neighbours in their own part as across. Our proof is constructive, and
in the process, we develop a new method to study stochastic processes\r\ndriven
by degree information in random graphs; this involves combining enumeration\r\ntechniques
with an abstract second moment argument."
acknowledgement: "We thank the referees for extensive comments which helped improve
the paper substantially.\r\nThe first author was supported in part by NSF grants
DMS-1954395 and DMS-1953799. The second author was supported by NSF grant DMS-1953990.
The third author was supported by NSF grant DMS180052. The fourth and fifth authors
were both supported by NSF Graduate Research Fellowship Program DGE-1745302."
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Asaf
full_name: Ferber, Asaf
last_name: Ferber
- first_name: Matthew Alan
full_name: Kwan, Matthew Alan
id: 5fca0887-a1db-11eb-95d1-ca9d5e0453b3
last_name: Kwan
orcid: 0000-0002-4003-7567
- first_name: Bhargav
full_name: Narayanan, Bhargav
last_name: Narayanan
- first_name: Ashwin
full_name: Sah, Ashwin
last_name: Sah
- first_name: Mehtaab
full_name: Sawhney, Mehtaab
last_name: Sawhney
citation:
ama: Ferber A, Kwan MA, Narayanan B, Sah A, Sawhney M. Friendly bisections of random
graphs. Communications of the American Mathematical Society. 2022;2(10):380-416.
doi:10.1090/cams/13
apa: Ferber, A., Kwan, M. A., Narayanan, B., Sah, A., & Sawhney, M. (2022).
Friendly bisections of random graphs. Communications of the American Mathematical
Society. American Mathematical Society. https://doi.org/10.1090/cams/13
chicago: Ferber, Asaf, Matthew Alan Kwan, Bhargav Narayanan, Ashwin Sah, and Mehtaab
Sawhney. “Friendly Bisections of Random Graphs.” Communications of the American
Mathematical Society. American Mathematical Society, 2022. https://doi.org/10.1090/cams/13.
ieee: A. Ferber, M. A. Kwan, B. Narayanan, A. Sah, and M. Sawhney, “Friendly bisections
of random graphs,” Communications of the American Mathematical Society,
vol. 2, no. 10. American Mathematical Society, pp. 380–416, 2022.
ista: Ferber A, Kwan MA, Narayanan B, Sah A, Sawhney M. 2022. Friendly bisections
of random graphs. Communications of the American Mathematical Society. 2(10),
380–416.
mla: Ferber, Asaf, et al. “Friendly Bisections of Random Graphs.” Communications
of the American Mathematical Society, vol. 2, no. 10, American Mathematical
Society, 2022, pp. 380–416, doi:10.1090/cams/13.
short: A. Ferber, M.A. Kwan, B. Narayanan, A. Sah, M. Sawhney, Communications of
the American Mathematical Society 2 (2022) 380–416.
corr_author: '1'
date_created: 2024-05-29T06:13:37Z
date_published: 2022-12-20T00:00:00Z
date_updated: 2024-07-15T08:06:05Z
day: '20'
ddc:
- '500'
department:
- _id: MaKw
doi: 10.1090/cams/13
external_id:
arxiv:
- '2105.13337'
file:
- access_level: open_access
checksum: 719861e76f5bce3d0362d8171daa26fc
content_type: application/pdf
creator: cchlebak
date_created: 2024-07-12T12:55:02Z
date_updated: 2024-07-12T12:55:02Z
file_id: '17230'
file_name: 2022_CommAMS_Ferber.pdf
file_size: 335965
relation: main_file
success: 1
file_date_updated: 2024-07-12T12:55:02Z
fulldoi: https://doi.org/10.1090/cams/13
has_accepted_license: '1'
intvolume: ' 2'
issue: '10'
language:
- iso: eng
month: '12'
oa: 1
oa_version: Published Version
page: 380-416
publication: Communications of the American Mathematical Society
publication_identifier:
issn:
- 2692-3688
publication_status: published
publisher: American Mathematical Society
quality_controlled: '1'
status: public
title: Friendly bisections of random graphs
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/3.0/legalcode
name: Creative Commons Attribution 3.0 Unported (CC BY 3.0)
short: CC BY (3.0)
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 2
year: '2022'
...
---
_id: '17084'
abstract:
- lang: eng
text: 'Given a graph where every vertex has exactly one labeled token, how can we
most quickly execute a given permutation on the tokens? In (sequential) token
swapping, the goal is to use the shortest possible sequence of swaps, each of
which exchanges the tokens at the two endpoints of an edge of the graph. In parallel
token swapping, the goal is to use the fewest rounds, each of which consists of
one or more swaps on the edges of a matching. We prove that both of these problems
remain NP-hard when the graph is restricted to be a tree. These token swapping
problems have been studied by disparate groups of researchers in discrete mathematics,
theoretical computer science, robot motion planning, game theory, and engineering.
Previous work establishes NP-completeness on general graphs (for both problems),
constant-factor approximation algorithms, and some poly-time exact algorithms
for simple graph classes such as cliques, stars, paths, and cycles. Sequential
and parallel token swapping on trees were first studied over thirty years ago
(as "sorting with a transposition tree") and over twenty-five years ago (as "routing
permutations via matchings"), yet their complexities were previously unknown.
We also show limitations on approximation of sequential token swapping on trees:
we identify a broad class of algorithms that encompass all three known polynomial-time
algorithms that achieve the best known approximation factor (which is 2) and show
that no such algorithm can achieve an approximation factor less than 2.'
acknowledgement: "g Anna Lubiw: Supported by the Natural Sciences and Engineering
Research Council of\r\nCanada (NSERC). Jayson Lynch: Supported by the Natural Sciences
and Engineering Research Council of Canada (NSERC). Zuzana Masárová: Supported by
Wittgenstein Prize, Austrian Science Fund (FWF), grant no. Z 342-N31. Virginia Vassilevska
Williams: Supported by an NSF CAREER Award, NSF Grants CCF-1528078, CCF-1514339
and CCF-1909429, a BSF Grant BSF:2012338, a Google Research Fellowship and a Sloan
Research Fellowship.\r\nNicole Wein: Supported by a grant to DIMACS from the Simons
Foundation (820931). This work was done while the author was at MIT.\r\nThis research
was initiated at the 34th Bellairs Winter Workshop on Computational Geometry, co-organized
by Erik Demaine and Godfried Toussaint, held on March 22–29,\r\n2019 in Holetown,
Barbados. We thank the other participants of that workshop for providing a\r\nstimulating
research environment."
alternative_title:
- LIPIcs
article_number: '3'
article_processing_charge: Yes
arxiv: 1
author:
- first_name: Oswin
full_name: Aichholzer, Oswin
last_name: Aichholzer
- first_name: Erik D.
full_name: Demaine, Erik D.
last_name: Demaine
- first_name: Matias
full_name: Korman, Matias
last_name: Korman
- first_name: Anna
full_name: Lubiw, Anna
last_name: Lubiw
- first_name: Jayson
full_name: Lynch, Jayson
last_name: Lynch
- 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: Mikhail
full_name: Rudoy, Mikhail
last_name: Rudoy
- first_name: Virginia
full_name: Vassilevska Williams, Virginia
last_name: Vassilevska Williams
- first_name: Nicole
full_name: Wein, Nicole
last_name: Wein
citation:
ama: 'Aichholzer O, Demaine ED, Korman M, et al. Hardness of token swapping on trees.
In: 30th Annual European Symposium on Algorithms. Vol 244. Schloss Dagstuhl
- Leibniz-Zentrum für Informatik; 2022. doi:10.4230/LIPIcs.ESA.2022.3'
apa: 'Aichholzer, O., Demaine, E. D., Korman, M., Lubiw, A., Lynch, J., Masárová,
Z., … Wein, N. (2022). Hardness of token swapping on trees. In 30th Annual
European Symposium on Algorithms (Vol. 244). Berlin/Potsdam, Germany: Schloss
Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.ESA.2022.3'
chicago: Aichholzer, Oswin, Erik D. Demaine, Matias Korman, Anna Lubiw, Jayson Lynch,
Zuzana Masárová, Mikhail Rudoy, Virginia Vassilevska Williams, and Nicole Wein.
“Hardness of Token Swapping on Trees.” In 30th Annual European Symposium on
Algorithms, Vol. 244. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022.
https://doi.org/10.4230/LIPIcs.ESA.2022.3.
ieee: O. Aichholzer et al., “Hardness of token swapping on trees,” in 30th
Annual European Symposium on Algorithms, Berlin/Potsdam, Germany, 2022, vol.
244.
ista: 'Aichholzer O, Demaine ED, Korman M, Lubiw A, Lynch J, Masárová Z, Rudoy M,
Vassilevska Williams V, Wein N. 2022. Hardness of token swapping on trees. 30th
Annual European Symposium on Algorithms. ESA: European Symposium on Algorithms,
LIPIcs, vol. 244, 3.'
mla: Aichholzer, Oswin, et al. “Hardness of Token Swapping on Trees.” 30th Annual
European Symposium on Algorithms, vol. 244, 3, Schloss Dagstuhl - Leibniz-Zentrum
für Informatik, 2022, doi:10.4230/LIPIcs.ESA.2022.3.
short: O. Aichholzer, E.D. Demaine, M. Korman, A. Lubiw, J. Lynch, Z. Masárová,
M. Rudoy, V. Vassilevska Williams, N. Wein, in:, 30th Annual European Symposium
on Algorithms, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022.
conference:
end_date: 2022-09-09
location: Berlin/Potsdam, Germany
name: 'ESA: European Symposium on Algorithms'
start_date: 2022-09-05
corr_author: '1'
date_created: 2024-05-29T06:27:16Z
date_published: 2022-09-01T00:00:00Z
date_updated: 2025-04-15T07:16:56Z
day: '01'
ddc:
- '510'
department:
- _id: HeEd
- _id: UlWa
doi: 10.4230/LIPIcs.ESA.2022.3
external_id:
arxiv:
- '2103.06707'
file:
- access_level: open_access
checksum: a1fbd3e7baad510fbcb998cf4a7d9f7f
content_type: application/pdf
creator: dernst
date_created: 2024-08-12T08:51:44Z
date_updated: 2024-08-12T08:51:44Z
file_id: '17420'
file_name: 2022_LIPIcS_Aichholzer.pdf
file_size: 1406071
relation: main_file
success: 1
file_date_updated: 2024-08-12T08:51:44Z
fulldoi: https://doi.org/10.4230/LIPIcs.ESA.2022.3
has_accepted_license: '1'
intvolume: ' 244'
language:
- iso: eng
month: '09'
oa: 1
oa_version: Published Version
project:
- _id: 268116B8-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z00342
name: Mathematics, Computer Science
publication: 30th Annual European Symposium on Algorithms
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
quality_controlled: '1'
scopus_import: '1'
status: public
title: Hardness of token swapping on trees
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: 244
year: '2022'
...
---
_id: '17085'
abstract:
- lang: eng
text: Mosses are a cosmopolitan group of land plants, sister to vascular plants,
with a high potential for molecular and cell biological research. The species
Physcomitrium patens has helped gaining better understanding of the biological
processes of the plant cell, and it has become a central system to understand
water-to-land plant transition through 2D-to-3D growth transition, regulation
of asymmetric cell division, shoot apical cell establishment and maintenance,
phyllotaxis and regeneration. P. patens was the first fully sequenced moss in
2008, with the latest annotated release in 2018. It has been shown that many gene
functions and networks are conserved in mosses when compared to angiosperms. Importantly,
this model organism has a simplified and accessible body structure that facilitates
close tracking in time and space with the support of live cell imaging set-ups
and multiple reporter lines. This has become possible thanks to its fully established
molecular toolkit, with highly efficient PEG-assisted, CRISPR/Cas9 and RNAi transformation
and silencing protocols, among others. Here we provide examples on how mosses
exhibit advantages over vascular plants to study several processes and their future
potential to answer some other outstanding questions in plant cell biology.
acknowledgement: 'The authors would like to thank Dr. Jeroen de Keijzer and Dr. Tijs
Ketelaar for their thoughtful and detailed review of the manuscript. Also, the funding
agencies Technology, Knowledge and Innovation, division Horticulture and Propagating
Material (TKI T&U) and the Dutch Research Council (NWO) (reference number: TKILWV20.390)
for funding JFC and the ERC grant to Prof. J. Friml (reference number: PR1023ERC02)
for funding HT. The authors would like to sincerely apologise for the literature
not cited that may be relevant for this chapter and is not present due to space
constraints.'
article_processing_charge: No
author:
- first_name: Jordi
full_name: Floriach-Clark, Jordi
last_name: Floriach-Clark
- first_name: Han
full_name: Tang, Han
id: 19BDF720-25A0-11EA-AC6E-928F3DDC885E
last_name: Tang
orcid: 0000-0001-6152-6637
- first_name: Viola
full_name: Willemsen, Viola
last_name: Willemsen
citation:
ama: 'Floriach-Clark J, Tang H, Willemsen V. Mosses: Accessible Systems for Plant
Development Studies. In: Abdurakhmonov IY, ed. Model Organisms in Plant Genetics.
IntechOpen; 2022. doi:10.5772/intechopen.100535'
apa: 'Floriach-Clark, J., Tang, H., & Willemsen, V. (2022). Mosses: Accessible
Systems for Plant Development Studies. In I. Y. Abdurakhmonov (Ed.), Model
Organisms in Plant Genetics. IntechOpen. https://doi.org/10.5772/intechopen.100535'
chicago: 'Floriach-Clark, Jordi, Han Tang, and Viola Willemsen. “Mosses: Accessible
Systems for Plant Development Studies.” In Model Organisms in Plant Genetics,
edited by Ibrokhim Y. Abdurakhmonov. IntechOpen, 2022. https://doi.org/10.5772/intechopen.100535.'
ieee: 'J. Floriach-Clark, H. Tang, and V. Willemsen, “Mosses: Accessible Systems
for Plant Development Studies,” in Model Organisms in Plant Genetics, I.
Y. Abdurakhmonov, Ed. IntechOpen, 2022.'
ista: 'Floriach-Clark J, Tang H, Willemsen V. 2022.Mosses: Accessible Systems for
Plant Development Studies. In: Model Organisms in Plant Genetics. .'
mla: 'Floriach-Clark, Jordi, et al. “Mosses: Accessible Systems for Plant Development
Studies.” Model Organisms in Plant Genetics, edited by Ibrokhim Y. Abdurakhmonov,
IntechOpen, 2022, doi:10.5772/intechopen.100535.'
short: J. Floriach-Clark, H. Tang, V. Willemsen, in:, I.Y. Abdurakhmonov (Ed.),
Model Organisms in Plant Genetics, IntechOpen, 2022.
date_created: 2024-05-29T06:35:13Z
date_published: 2022-06-23T00:00:00Z
date_updated: 2026-06-18T17:52:59Z
day: '23'
ddc:
- '580'
department:
- _id: JiFr
doi: 10.5772/intechopen.100535
ec_funded: 1
editor:
- first_name: Ibrokhim Y.
full_name: Abdurakhmonov, Ibrokhim Y.
last_name: Abdurakhmonov
fulldoi: https://doi.org/10.5772/intechopen.100535
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.5772/intechopen.100535
month: '06'
oa: 1
oa_version: Published Version
project:
- _id: 261099A6-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '742985'
name: Tracing Evolution of Auxin Transport and Polarity in Plants
publication: Model Organisms in Plant Genetics
publication_identifier:
isbn:
- '9781839697500'
publication_status: published
publisher: IntechOpen
quality_controlled: '1'
status: public
title: 'Mosses: Accessible Systems for Plant Development Studies'
type: book_chapter
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2022'
...
---
_id: '17086'
abstract:
- lang: eng
text: 'We consider a high-dimensional mean estimation problem over a binary hidden
Markov model, which illuminates the interplay between memory in data, sample size,
dimension, and signal strength in statistical inference. In this model, an estimator
observes n samples of a d-dimensional parameter vector θ∗∈Rd, multiplied by a
random sign Si (1≤i≤n), and corrupted by isotropic standard Gaussian noise. The
sequence of signs {Si}i∈[n]∈{−1,1}n is drawn from a stationary homogeneous Markov
chain with flip probability δ∈[0,1/2]. As δ varies, this model smoothly interpolates
two well-studied models: the Gaussian Location Model for which δ=0 and the Gaussian
Mixture Model for which δ=1/2. Assuming that the estimator knows δ, we establish
a nearly minimax optimal (up to logarithmic factors) estimation error rate, as
a function of ∥θ∗∥,δ,d,n. We then provide an upper bound to the case of estimating
δ, assuming a (possibly inaccurate) knowledge of θ∗. The bound is proved to be
tight when θ∗ is an accurately known constant. These results are then combined
to an algorithm which estimates θ∗ with δ unknown a priori, and theoretical guarantees
on its error are stated.'
acknowledgement: "Part of this work was done when YZ was a postdoc at Technion where
he received funding from\r\nthe European Union’s Horizon 2020 research and innovation
programme under grant agreement No 682203-ERC-[Inf-Speed-Tradeoff]. The work of
of NW was supported in part by the Israel Science Foundation (ISF) under Grant 1782/22.
NW is grateful to Guy Bresler for introducing him to this problem, for the initial
ideas that led to this research, and for many helpful discussions on the topic."
alternative_title:
- NeurIPS
article_processing_charge: No
arxiv: 1
author:
- first_name: Yihan
full_name: Zhang, Yihan
id: 2ce5da42-b2ea-11eb-bba5-9f264e9d002c
last_name: Zhang
orcid: 0000-0002-6465-6258
- first_name: Nir
full_name: Weinberger, Nir
last_name: Weinberger
citation:
ama: 'Zhang Y, Weinberger N. Mean estimation in high-dimensional binary Markov Gaussian
mixture models. In: 36th Conference on Neural Information Processing Systems.
Vol 35. ML Research Press; 2022.'
apa: 'Zhang, Y., & Weinberger, N. (2022). Mean estimation in high-dimensional
binary Markov Gaussian mixture models. In 36th Conference on Neural Information
Processing Systems (Vol. 35). New Orleans, LA, United States: ML Research
Press.'
chicago: Zhang, Yihan, and Nir Weinberger. “Mean Estimation in High-Dimensional
Binary Markov Gaussian Mixture Models.” In 36th Conference on Neural Information
Processing Systems, Vol. 35. ML Research Press, 2022.
ieee: Y. Zhang and N. Weinberger, “Mean estimation in high-dimensional binary Markov
Gaussian mixture models,” in 36th Conference on Neural Information Processing
Systems, New Orleans, LA, United States, 2022, vol. 35.
ista: 'Zhang Y, Weinberger N. 2022. Mean estimation in high-dimensional binary Markov
Gaussian mixture models. 36th Conference on Neural Information Processing Systems.
NeurIPS: Neural Information Processing Systems, NeurIPS, vol. 35.'
mla: Zhang, Yihan, and Nir Weinberger. “Mean Estimation in High-Dimensional Binary
Markov Gaussian Mixture Models.” 36th Conference on Neural Information Processing
Systems, vol. 35, ML Research Press, 2022.
short: Y. Zhang, N. Weinberger, in:, 36th Conference on Neural Information Processing
Systems, ML Research Press, 2022.
conference:
end_date: 2022-12-09
location: New Orleans, LA, United States
name: 'NeurIPS: Neural Information Processing Systems'
start_date: 2022-11-28
corr_author: '1'
date_created: 2024-05-29T06:37:16Z
date_published: 2022-12-01T00:00:00Z
date_updated: 2024-08-05T09:48:58Z
day: '01'
ddc:
- '000'
department:
- _id: MaMo
external_id:
arxiv:
- '2206.02455'
file:
- access_level: open_access
checksum: 05f6f9f8fc34e224e0cad045b9489030
content_type: application/pdf
creator: dernst
date_created: 2024-08-05T09:44:49Z
date_updated: 2024-08-05T09:44:49Z
file_id: '17392'
file_name: 2022_NeurIPS_Zhang.pdf
file_size: 476307
relation: main_file
success: 1
file_date_updated: 2024-08-05T09:44:49Z
has_accepted_license: '1'
intvolume: ' 35'
language:
- iso: eng
month: '12'
oa: 1
oa_version: Published Version
publication: 36th Conference on Neural Information Processing Systems
publication_identifier:
isbn:
- '9781713871088'
publication_status: published
publisher: ML Research Press
quality_controlled: '1'
scopus_import: '1'
status: public
title: Mean estimation in high-dimensional binary Markov Gaussian mixture models
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 35
year: '2022'
...
---
_id: '17088'
abstract:
- lang: eng
text: 'In this paper, we consider the problem of sparsifying BERT models, which
are a key building block for natural language processing, in order to reduce their
storage and computational cost. We introduce the Optimal BERT Surgeon (oBERT),
an efficient and accurate pruning method based on approximate second-order information,
which we show to yield state-of-the-art results in both stages of language tasks:
pre-training and fine-tuning. Specifically, oBERT extends existing work on second-order
pruning by allowing for pruning weight blocks, and is the first such method that
is applicable at BERT scale. Second, we investigate compounding compression approaches
to obtain highly compressed but accurate models for deployment on edge devices.
These models significantly push boundaries of the current state-of-the-art sparse
BERT models with respect to all metrics: model size, inference speed and task
accuracy. For example, relative to the dense BERT-base, we obtain 10x model size
compression with < 1% accuracy drop, 10x CPU-inference speedup with < 2% accuracy
drop, and 29x CPU-inference speedup with < 7.5% accuracy drop. Our code, fully
integrated with Transformers and SparseML, is available at https://github.com/neuralmagic/sparseml/tree/main/research/optimal_BERT_surgeon_oBERT.'
article_processing_charge: Yes
arxiv: 1
author:
- first_name: Eldar
full_name: Kurtic, Eldar
id: 47beb3a5-07b5-11eb-9b87-b108ec578218
last_name: Kurtic
- first_name: Daniel
full_name: Campos, Daniel
last_name: Campos
- first_name: Tuan
full_name: Nguyen, Tuan
last_name: Nguyen
- first_name: Elias
full_name: Frantar, Elias
id: 09a8f98d-ec99-11ea-ae11-c063a7b7fe5f
last_name: Frantar
- first_name: Mark
full_name: Kurtz, Mark
last_name: Kurtz
- first_name: Benjamin
full_name: Fineran, Benjamin
last_name: Fineran
- first_name: Michael
full_name: Goin, Michael
last_name: Goin
- first_name: Dan-Adrian
full_name: Alistarh, Dan-Adrian
id: 4A899BFC-F248-11E8-B48F-1D18A9856A87
last_name: Alistarh
orcid: 0000-0003-3650-940X
citation:
ama: 'Kurtic E, Campos D, Nguyen T, et al. The optimal BERT surgeon: Scalable and
accurate second-order pruning for large language models. In: Proceedings of
the 2022 Conference on Empirical Methods in Natural Language Processing. Association
for Computational Linguistics; 2022:4163-4181. doi:10.18653/v1/2022.emnlp-main.279'
apa: 'Kurtic, E., Campos, D., Nguyen, T., Frantar, E., Kurtz, M., Fineran, B., …
Alistarh, D.-A. (2022). The optimal BERT surgeon: Scalable and accurate second-order
pruning for large language models. In Proceedings of the 2022 Conference on
Empirical Methods in Natural Language Processing (pp. 4163–4181). Abu Dhabi,
United Arab Emirates: Association for Computational Linguistics. https://doi.org/10.18653/v1/2022.emnlp-main.279'
chicago: 'Kurtic, Eldar, Daniel Campos, Tuan Nguyen, Elias Frantar, Mark Kurtz,
Benjamin Fineran, Michael Goin, and Dan-Adrian Alistarh. “The Optimal BERT Surgeon:
Scalable and Accurate Second-Order Pruning for Large Language Models.” In Proceedings
of the 2022 Conference on Empirical Methods in Natural Language Processing,
4163–81. Association for Computational Linguistics, 2022. https://doi.org/10.18653/v1/2022.emnlp-main.279.'
ieee: 'E. Kurtic et al., “The optimal BERT surgeon: Scalable and accurate
second-order pruning for large language models,” in Proceedings of the 2022
Conference on Empirical Methods in Natural Language Processing, Abu Dhabi,
United Arab Emirates, 2022, pp. 4163–4181.'
ista: 'Kurtic E, Campos D, Nguyen T, Frantar E, Kurtz M, Fineran B, Goin M, Alistarh
D-A. 2022. The optimal BERT surgeon: Scalable and accurate second-order pruning
for large language models. Proceedings of the 2022 Conference on Empirical Methods
in Natural Language Processing. EMNLP: Conference on Empirical Methods in Natural
Language Processing, 4163–4181.'
mla: 'Kurtic, Eldar, et al. “The Optimal BERT Surgeon: Scalable and Accurate Second-Order
Pruning for Large Language Models.” Proceedings of the 2022 Conference on Empirical
Methods in Natural Language Processing, Association for Computational Linguistics,
2022, pp. 4163–81, doi:10.18653/v1/2022.emnlp-main.279.'
short: E. Kurtic, D. Campos, T. Nguyen, E. Frantar, M. Kurtz, B. Fineran, M. Goin,
D.-A. Alistarh, in:, Proceedings of the 2022 Conference on Empirical Methods in
Natural Language Processing, Association for Computational Linguistics, 2022,
pp. 4163–4181.
conference:
end_date: 2022-12-11
location: Abu Dhabi, United Arab Emirates
name: 'EMNLP: Conference on Empirical Methods in Natural Language Processing'
start_date: 2022-12-07
corr_author: '1'
date_created: 2024-05-29T06:40:55Z
date_published: 2022-12-01T00:00:00Z
date_updated: 2024-07-31T11:05:32Z
day: '01'
ddc:
- '000'
department:
- _id: DaAl
doi: 10.18653/v1/2022.emnlp-main.279
external_id:
arxiv:
- '2203.07259'
file:
- access_level: open_access
checksum: c47b9edd8a9f743ac77a593de6d2e84a
content_type: application/pdf
creator: dernst
date_created: 2024-07-31T11:03:34Z
date_updated: 2024-07-31T11:03:34Z
file_id: '17354'
file_name: 2022_EMNLP_Kurtic.pdf
file_size: 522563
relation: main_file
success: 1
file_date_updated: 2024-07-31T11:03:34Z
fulldoi: https://doi.org/10.18653/v1/2022.emnlp-main.279
has_accepted_license: '1'
language:
- iso: eng
month: '12'
oa: 1
oa_version: Published Version
page: 4163-4181
publication: Proceedings of the 2022 Conference on Empirical Methods in Natural Language
Processing
publication_status: published
publisher: Association for Computational Linguistics
quality_controlled: '1'
related_material:
link:
- relation: software
url: https://github.com/neuralmagic/sparseml/tree/main/research/optimal_BERT_surgeon_oBERT
scopus_import: '1'
status: public
title: 'The optimal BERT surgeon: Scalable and accurate second-order pruning for large
language models'
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
year: '2022'
...
---
_id: '17115'
abstract:
- lang: eng
text: Cascades are RNA-guided multi-subunit CRISPR-Cas surveillances complexes that
target foreign nucleic acids for destruction. Here, we present a 2.9-Å resolution
cryo-electron (cryo-EM) structure of the D. vulgaris
type I-C Cascade bound to a double-stranded (ds)DNA target. Our data shows how
the 5’-TTC-3’ protospacer adjacent motif (PAM) sequence is recognized, and provides
a unique mechanism through which the displaced, single-stranded non-target strand
(NTS) is stabilized via stacking interactions with protein subunits in order to
favor R-loop formation and prevent dsDNA re-annealing. Additionally, we provide
structural insights into how diverse anti-CRISPR (Acr) proteins utilize distinct
strategies to achieve a shared mechanism of type I-C Cascade inhibition by blocking
initial DNA binding. These observations provide a structural basis for directional
R-loop formation and reveal how divergent Acr proteins have converged upon common
molecular mechanisms to efficiently shut down CRISPR immunity.
article_processing_charge: No
author:
- first_name: Roisin E.
full_name: O’Brien, Roisin E.
last_name: O’Brien
- first_name: Jack Peter Kelly
full_name: Bravo, Jack Peter Kelly
id: 96aecfa5-8931-11ee-af30-aa6a5d6eee0e
last_name: Bravo
orcid: 0000-0003-0456-0753
- first_name: Delisa
full_name: Ramos, Delisa
last_name: Ramos
- first_name: Grace N.
full_name: Hibshman, Grace N.
last_name: Hibshman
- first_name: Jacquelyn T.
full_name: Wright, Jacquelyn T.
last_name: Wright
- first_name: David W.
full_name: Taylor, David W.
last_name: Taylor
citation:
ama: O’Brien RE, Bravo JPK, Ramos D, Hibshman GN, Wright JT, Taylor DW. Modes of
inhibition used by phage anti-CRISPRs to evade type I-C Cascade. bioRxiv.
2022. doi:10.1101/2022.06.15.496202
apa: O’Brien, R. E., Bravo, J. P. K., Ramos, D., Hibshman, G. N., Wright, J. T.,
& Taylor, D. W. (2022). Modes of inhibition used by phage anti-CRISPRs to
evade type I-C Cascade. bioRxiv. Cold Spring Harbor Laboratory. https://doi.org/10.1101/2022.06.15.496202
chicago: O’Brien, Roisin E., Jack Peter Kelly Bravo, Delisa Ramos, Grace N. Hibshman,
Jacquelyn T. Wright, and David W. Taylor. “Modes of Inhibition Used by Phage Anti-CRISPRs
to Evade Type I-C Cascade.” BioRxiv. Cold Spring Harbor Laboratory, 2022.
https://doi.org/10.1101/2022.06.15.496202.
ieee: R. E. O’Brien, J. P. K. Bravo, D. Ramos, G. N. Hibshman, J. T. Wright, and
D. W. Taylor, “Modes of inhibition used by phage anti-CRISPRs to evade type I-C
Cascade,” bioRxiv. Cold Spring Harbor Laboratory, 2022.
ista: O’Brien RE, Bravo JPK, Ramos D, Hibshman GN, Wright JT, Taylor DW. 2022. Modes
of inhibition used by phage anti-CRISPRs to evade type I-C Cascade. bioRxiv, 10.1101/2022.06.15.496202.
mla: O’Brien, Roisin E., et al. “Modes of Inhibition Used by Phage Anti-CRISPRs
to Evade Type I-C Cascade.” BioRxiv, Cold Spring Harbor Laboratory, 2022,
doi:10.1101/2022.06.15.496202.
short: R.E. O’Brien, J.P.K. Bravo, D. Ramos, G.N. Hibshman, J.T. Wright, D.W. Taylor,
BioRxiv (2022).
date_created: 2024-06-04T06:43:30Z
date_published: 2022-06-15T00:00:00Z
date_updated: 2024-06-04T07:03:02Z
day: '15'
doi: 10.1101/2022.06.15.496202
extern: '1'
fulldoi: https://doi.org/10.1101/2022.06.15.496202
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1101/2022.06.15.496202
month: '06'
oa: 1
oa_version: Preprint
publication: bioRxiv
publication_status: published
publisher: Cold Spring Harbor Laboratory
status: public
title: Modes of inhibition used by phage anti-CRISPRs to evade type I-C Cascade
type: preprint
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2022'
...
---
_id: '17116'
abstract:
- lang: eng
text: CRISPR (Clustered regularly interspaced short palindromic repeats)-Cas (CRISPR-associated)
systems are a type of adaptive immune response in bacteria and archaea that utilize
crRNA (CRISPR RNA)-guided effector complexes to target complementary RNA or DNA
for destruction. The prototypical type III-A and III-B CRISPR-Cas systems utilize
multi-subunit effector complexes composed of individual proteins to cleave ssRNA
targets at 6-nt intervals, as well as non-specifically degrading ssDNA and activating
cyclic oligoadenylate (cOA) synthesis. Recent studies have shown that type III
systems can contain subunit fusions yet maintain canonical type III RNA-targeting
capabilities. To understand how a multi-subunit fusion effector functions, we
determine structures of a variant type III-D effector and biochemically characterize
how it cleaves RNA targets. These findings provide insights into how multi-subunit
fusion proteins are tethered together and assemble into an active and programmable
RNA endonuclease, how the effector utilizes a novel mechanism for target RNA seeding,
and the structural basis for the evolution of type III effector complexes. Furthermore,
our results provide a blueprint for fusing subunits in class 1 effectors for design
of user-defined effector complexes with disparate activities.Important
noteWhile this manuscript was in preparation, a manuscript
describing the structure of the type III-E effector was published1.
We reference these important findings; however, a careful comparison of the structures
will follow once the coordinates have been released by the PDB.
article_processing_charge: No
author:
- first_name: Evan A.
full_name: Schwartz, Evan A.
last_name: Schwartz
- first_name: Jack Peter Kelly
full_name: Bravo, Jack Peter Kelly
id: 96aecfa5-8931-11ee-af30-aa6a5d6eee0e
last_name: Bravo
orcid: 0000-0003-0456-0753
- first_name: Luis A.
full_name: Macias, Luis A.
last_name: Macias
- first_name: Caitlyn L.
full_name: McCafferty, Caitlyn L.
last_name: McCafferty
- first_name: Tyler L.
full_name: Dangerfield, Tyler L.
last_name: Dangerfield
- first_name: Jada N.
full_name: Walker, Jada N.
last_name: Walker
- first_name: Jennifer S.
full_name: Brodbelt, Jennifer S.
last_name: Brodbelt
- first_name: Peter C.
full_name: Fineran, Peter C.
last_name: Fineran
- first_name: Robert D.
full_name: Fagerlund, Robert D.
last_name: Fagerlund
- first_name: David W.
full_name: Taylor, David W.
last_name: Taylor
citation:
ama: Schwartz EA, Bravo JPK, Macias LA, et al. Assembly of multi-subunit fusion
proteins into the RNA-targeting type III-D CRISPR-Cas effector complex. bioRxiv.
doi:10.1101/2022.06.13.496011
apa: Schwartz, E. A., Bravo, J. P. K., Macias, L. A., McCafferty, C. L., Dangerfield,
T. L., Walker, J. N., … Taylor, D. W. (n.d.). Assembly of multi-subunit fusion
proteins into the RNA-targeting type III-D CRISPR-Cas effector complex. bioRxiv.
Cold Spring Harbor Laboratory. https://doi.org/10.1101/2022.06.13.496011
chicago: Schwartz, Evan A., Jack Peter Kelly Bravo, Luis A. Macias, Caitlyn L. McCafferty,
Tyler L. Dangerfield, Jada N. Walker, Jennifer S. Brodbelt, Peter C. Fineran,
Robert D. Fagerlund, and David W. Taylor. “Assembly of Multi-Subunit Fusion Proteins
into the RNA-Targeting Type III-D CRISPR-Cas Effector Complex.” BioRxiv.
Cold Spring Harbor Laboratory, n.d. https://doi.org/10.1101/2022.06.13.496011.
ieee: E. A. Schwartz et al., “Assembly of multi-subunit fusion proteins into
the RNA-targeting type III-D CRISPR-Cas effector complex,” bioRxiv. Cold
Spring Harbor Laboratory.
ista: Schwartz EA, Bravo JPK, Macias LA, McCafferty CL, Dangerfield TL, Walker JN,
Brodbelt JS, Fineran PC, Fagerlund RD, Taylor DW. Assembly of multi-subunit fusion
proteins into the RNA-targeting type III-D CRISPR-Cas effector complex. bioRxiv,
10.1101/2022.06.13.496011.
mla: Schwartz, Evan A., et al. “Assembly of Multi-Subunit Fusion Proteins into the
RNA-Targeting Type III-D CRISPR-Cas Effector Complex.” BioRxiv, Cold Spring
Harbor Laboratory, doi:10.1101/2022.06.13.496011.
short: E.A. Schwartz, J.P.K. Bravo, L.A. Macias, C.L. McCafferty, T.L. Dangerfield,
J.N. Walker, J.S. Brodbelt, P.C. Fineran, R.D. Fagerlund, D.W. Taylor, BioRxiv
(n.d.).
date_created: 2024-06-04T06:44:16Z
date_published: 2022-06-14T00:00:00Z
date_updated: 2024-06-04T06:58:41Z
day: '14'
doi: 10.1101/2022.06.13.496011
extern: '1'
fulldoi: https://doi.org/10.1101/2022.06.13.496011
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1101/2022.06.13.496011
month: '06'
oa: 1
oa_version: Preprint
publication: bioRxiv
publication_status: submitted
publisher: Cold Spring Harbor Laboratory
status: public
title: Assembly of multi-subunit fusion proteins into the RNA-targeting type III-D
CRISPR-Cas effector complex
type: preprint
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2022'
...
---
_id: '17117'
abstract:
- lang: eng
text: Cas12a2 is a CRISPR-associated nuclease that performs RNA-guided degradation
of non-specific single-stranded (ss)RNA, ssDNA and double-stranded (ds)DNA upon
recognition of a complementary RNA target, culminating in abortive infection (Dmytrenko
2022). Here, we report structures of Cas12a2 in binary, ternary, and quaternary
complexes to reveal a complete activation pathway. Our structures reveal that
Cas12a2 is autoinhibited until binding a cognate RNA target, which exposes the
RuvC active site within a large, positively charged cleft. Double-stranded DNA
substrates are captured through duplex distortion and local melting, stabilized
by pairs of ‘aromatic clamp’ residues that are crucial for dsDNA degradation and
in vivo immune system function. Our work provides a
structural basis for this unprecedented mechanism of abortive infection to achieve
population-level immunity, which can be leveraged to create rational mutants that
degrade a spectrum of collateral substrates.
article_processing_charge: No
author:
- first_name: Jack Peter Kelly
full_name: Bravo, Jack Peter Kelly
id: 96aecfa5-8931-11ee-af30-aa6a5d6eee0e
last_name: Bravo
orcid: 0000-0003-0456-0753
- first_name: Thom
full_name: Hallmark, Thom
last_name: Hallmark
- first_name: Bronson
full_name: Naegle, Bronson
last_name: Naegle
- first_name: Chase L.
full_name: Beisel, Chase L.
last_name: Beisel
- first_name: Ryan N.
full_name: Jackson, Ryan N.
last_name: Jackson
- first_name: David W.
full_name: Taylor, David W.
last_name: Taylor
citation:
ama: Bravo JPK, Hallmark T, Naegle B, Beisel CL, Jackson RN, Taylor DW. Large-scale
structural rearrangements unleash indiscriminate nuclease activity of CRISPR-Cas12a2.
bioRxiv. 2022. doi:10.1101/2022.06.13.495754
apa: Bravo, J. P. K., Hallmark, T., Naegle, B., Beisel, C. L., Jackson, R. N., &
Taylor, D. W. (2022). Large-scale structural rearrangements unleash indiscriminate
nuclease activity of CRISPR-Cas12a2. bioRxiv. Cold Spring Harbor Laboratory.
https://doi.org/10.1101/2022.06.13.495754
chicago: Bravo, Jack Peter Kelly, Thom Hallmark, Bronson Naegle, Chase L. Beisel,
Ryan N. Jackson, and David W. Taylor. “Large-Scale Structural Rearrangements Unleash
Indiscriminate Nuclease Activity of CRISPR-Cas12a2.” BioRxiv. Cold Spring
Harbor Laboratory, 2022. https://doi.org/10.1101/2022.06.13.495754.
ieee: J. P. K. Bravo, T. Hallmark, B. Naegle, C. L. Beisel, R. N. Jackson, and D.
W. Taylor, “Large-scale structural rearrangements unleash indiscriminate nuclease
activity of CRISPR-Cas12a2,” bioRxiv. Cold Spring Harbor Laboratory, 2022.
ista: Bravo JPK, Hallmark T, Naegle B, Beisel CL, Jackson RN, Taylor DW. 2022. Large-scale
structural rearrangements unleash indiscriminate nuclease activity of CRISPR-Cas12a2.
bioRxiv, 10.1101/2022.06.13.495754.
mla: Bravo, Jack Peter Kelly, et al. “Large-Scale Structural Rearrangements Unleash
Indiscriminate Nuclease Activity of CRISPR-Cas12a2.” BioRxiv, Cold Spring
Harbor Laboratory, 2022, doi:10.1101/2022.06.13.495754.
short: J.P.K. Bravo, T. Hallmark, B. Naegle, C.L. Beisel, R.N. Jackson, D.W. Taylor,
BioRxiv (2022).
date_created: 2024-06-04T06:44:59Z
date_published: 2022-06-13T00:00:00Z
date_updated: 2024-06-04T06:55:16Z
day: '13'
doi: 10.1101/2022.06.13.495754
extern: '1'
fulldoi: https://doi.org/10.1101/2022.06.13.495754
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1101/2022.06.13.495754
month: '06'
oa: 1
oa_version: Preprint
publication: bioRxiv
publication_status: published
publisher: Cold Spring Harbor Laboratory
status: public
title: Large-scale structural rearrangements unleash indiscriminate nuclease activity
of CRISPR-Cas12a2
type: preprint
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2022'
...
---
OA_place: repository
_id: '17157'
abstract:
- lang: eng
text: An action of a complex reductive group G on a smooth projective variety X
is regular when all regular unipotent elements in G act with finitely many fixed
points. Then the complex G-equivariant cohomology ring of X is isomorphic to the
coordinate ring of a certain regular fixed point scheme. Examples include partial
flag varieties, smooth Schubert varieties and Bott-Samelson varieties. We also
show that a more general version of the fixed point scheme allows a generalisation
to GKM spaces, such as toric varieties.
article_number: '2212.11836'
article_processing_charge: No
arxiv: 1
author:
- first_name: Tamás
full_name: Hausel, Tamás
id: 4A0666D8-F248-11E8-B48F-1D18A9856A87
last_name: Hausel
orcid: 0000-0002-9582-2634
- first_name: Kamil P
full_name: Rychlewicz, Kamil P
id: 85A07246-A8BF-11E9-B4FA-D9E3E5697425
last_name: Rychlewicz
citation:
ama: Hausel T, Rychlewicz KP. Spectrum of equivariant cohomology as a fixed point
scheme. arXiv. doi:10.48550/arXiv.2212.11836
apa: Hausel, T., & Rychlewicz, K. P. (n.d.). Spectrum of equivariant cohomology
as a fixed point scheme. arXiv. https://doi.org/10.48550/arXiv.2212.11836
chicago: Hausel, Tamás, and Kamil P Rychlewicz. “Spectrum of Equivariant Cohomology
as a Fixed Point Scheme.” ArXiv, n.d. https://doi.org/10.48550/arXiv.2212.11836.
ieee: T. Hausel and K. P. Rychlewicz, “Spectrum of equivariant cohomology as a fixed
point scheme,” arXiv. .
ista: Hausel T, Rychlewicz KP. Spectrum of equivariant cohomology as a fixed point
scheme. arXiv, 2212.11836.
mla: Hausel, Tamás, and Kamil P. Rychlewicz. “Spectrum of Equivariant Cohomology
as a Fixed Point Scheme.” ArXiv, 2212.11836, doi:10.48550/arXiv.2212.11836.
short: T. Hausel, K.P. Rychlewicz, ArXiv (n.d.).
date_created: 2024-06-23T15:01:27Z
date_published: 2022-12-22T00:00:00Z
date_updated: 2026-04-07T12:55:46Z
day: '22'
department:
- _id: GradSch
- _id: TaHa
doi: 10.48550/arXiv.2212.11836
external_id:
arxiv:
- '2212.11836'
fulldoi: https://doi.org/10.48550/arXiv.2212.11836
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.2212.11836
month: '12'
oa: 1
oa_version: Preprint
publication: arXiv
publication_status: draft
related_material:
record:
- id: '19071'
relation: later_version
status: public
- id: '17156'
relation: dissertation_contains
status: public
status: public
title: Spectrum of equivariant cohomology as a fixed point scheme
type: preprint
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2022'
...
---
DOAJ_listed: '1'
OA_place: publisher
OA_type: gold
_id: '18606'
abstract:
- lang: eng
text: "Shear thickening is an intriguing rheological behaviour which consists in
a brutal increase in the viscosity above a critical shear rate. It is famously
encountered in suspensions of corn starch in water. Despite having been discovered
in the early 1930's, its underlying mechanisms remained a mystery for a long time.
In 2013–14, numerical and theoretical works [[1], [2], [3]] put forward a frictional
transition scenario to explain this phenomenon.\r\nIn this talk, I will present
experimental work investigating this frictional transition scenario. In order
to test the ideas of this model, one has to go further than standard rheological
techniques, since they do not provide access to the frictional state of the measured
suspension. I will thus focus on the techniques that we developed in order to
evidence the frictional transition and link it to the presence of a shear-thickening
behaviour."
acknowledgement: "This talk presents parts of my PhD work, conducted at IUSTI in Marseille
under the supervision of Yoël Forterre and Bloen Metzger. It aslo benefited from
contributions from Antoine Bérut, and some of the data was acquired by Pauline Dame
as part of a summer internship.\r\nThis work was supported by the European Research
Council (ERC) under the European Union Horizon 2020 Research and Innovation program
(ERC Grant 647384) and by the Labex MEC (ANR-10-LABX-0092) under the 647384) and
by the A*MIDEX project (ANR-11-IDEX-0001-02) funded by the French government program
Investissements d'Avenir, and by ANR ScienceFriction (No. ANR-18-CE30-0024)."
article_number: '100038'
article_processing_charge: No
article_type: original
author:
- first_name: Cécile
full_name: Clavaud, Cécile
id: 5f654c5d-04a1-11eb-ab36-ba9ffec58bd8
last_name: Clavaud
orcid: 0000-0002-1843-3803
citation:
ama: 'Clavaud C. Shear thickening in dense suspensions: an experimental study. Science
Talks. 2022;3. doi:10.1016/j.sctalk.2022.100038'
apa: 'Clavaud, C. (2022). Shear thickening in dense suspensions: an experimental
study. Science Talks. Elsevier. https://doi.org/10.1016/j.sctalk.2022.100038'
chicago: 'Clavaud, Cécile. “Shear Thickening in Dense Suspensions: An Experimental
Study.” Science Talks. Elsevier, 2022. https://doi.org/10.1016/j.sctalk.2022.100038.'
ieee: 'C. Clavaud, “Shear thickening in dense suspensions: an experimental study,”
Science Talks, vol. 3. Elsevier, 2022.'
ista: 'Clavaud C. 2022. Shear thickening in dense suspensions: an experimental study.
Science Talks. 3, 100038.'
mla: 'Clavaud, Cécile. “Shear Thickening in Dense Suspensions: An Experimental Study.”
Science Talks, vol. 3, 100038, Elsevier, 2022, doi:10.1016/j.sctalk.2022.100038.'
short: C. Clavaud, Science Talks 3 (2022).
corr_author: '1'
date_created: 2024-12-01T23:01:55Z
date_published: 2022-08-01T00:00:00Z
date_updated: 2024-12-11T09:24:57Z
day: '01'
ddc:
- '530'
department:
- _id: ScWa
doi: 10.1016/j.sctalk.2022.100038
file:
- access_level: open_access
checksum: 379a5f0b2684cd5393a23be374591484
content_type: application/pdf
creator: dernst
date_created: 2024-12-03T08:41:48Z
date_updated: 2024-12-03T08:41:48Z
file_id: '18607'
file_name: 2022_ScienceTalks_Clavaud.pdf
file_size: 1128564
relation: main_file
success: 1
- access_level: open_access
checksum: 666c0bd9af8432437554d0c75c540809
content_type: video/mp4
creator: dernst
date_created: 2024-12-11T09:22:13Z
date_updated: 2024-12-11T09:22:13Z
file_id: '18646'
file_name: 2024_ScienceTalk_Clavaud_Video.mp4
file_size: 93265727
relation: main_file
success: 1
- access_level: open_access
checksum: 8fd0d6224d7a0125fcf7d9ca0d80d700
content_type: video/mp4
creator: dernst
date_created: 2024-12-11T09:22:19Z
date_updated: 2024-12-11T09:22:19Z
file_id: '18647'
file_name: 2024_ScienceTalk__Clavaud_QA.mp4
file_size: 58282147
relation: supplementary_material
file_date_updated: 2024-12-11T09:22:19Z
fulldoi: https://doi.org/10.1016/j.sctalk.2022.100038
has_accepted_license: '1'
intvolume: ' 3'
language:
- iso: eng
month: '08'
oa: 1
oa_version: Published Version
publication: Science Talks
publication_identifier:
eissn:
- 2772-5693
publication_status: published
publisher: Elsevier
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Shear thickening in dense suspensions: an experimental study'
tmp:
image: /images/cc_by_nc_nd.png
legal_code_url: https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode
name: Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International
(CC BY-NC-ND 4.0)
short: CC BY-NC-ND (4.0)
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 3
year: '2022'
...
---
OA_place: publisher
OA_type: gold
_id: '18876'
abstract:
- lang: eng
text: Convolutional neural networks were the standard for solving many computer
vision tasks until recently, when Transformers of MLP-based architectures have
started to show competitive performance. These architectures typically have a
vast number of weights and need to be trained on massive datasets; hence, they
are not suitable for their use in low-data regimes. In this work, we propose a
simple yet effective framework to improve generalization from small amounts of
data. We augment modern CNNs with fully-connected (FC) layers and show the massive
impact this architectural change has in low-data regimes. We further present an
online joint knowledge-distillation method to utilize the extra FC layers at train
time but avoid them during test time. This allows us to improve the generalization
of a CNN-based model without any increase in the number of weights at test time.
We perform classification experiments for a large range of network backbones and
several standard datasets on supervised learning and active learning. Our experiments
significantly outperform the networks without fully-connected layers, reaching
a relative improvement of up to 16% validation accuracy in the supervised setting
without adding any extra parameters during inference.
acknowledgement: "This work was supported by a Sofja Kovalevskaja Award, a postdoc
fellowship\r\nfrom the Humboldt Foundation, the ERC Starting Grant Scan2CAD (804724),
and the German\r\nResearch Foundation (DFG) Research Unit \"Learning and Simulation
in Visual Computing\"."
alternative_title:
- Advances in Neural Information Processing Systems
article_processing_charge: No
arxiv: 1
author:
- first_name: Peter
full_name: Kocsis, Peter
last_name: Kocsis
- first_name: Peter
full_name: Súkeník, Peter
id: d64d6a8d-eb8e-11eb-b029-96fd216dec3c
last_name: Súkeník
- first_name: Guillem
full_name: Brasó, Guillem
last_name: Brasó
- first_name: Matthias
full_name: Niessner, Matthias
last_name: Niessner
- first_name: Laura
full_name: Leal-Taixé, Laura
last_name: Leal-Taixé
- first_name: Ismail
full_name: Elezi, Ismail
last_name: Elezi
citation:
ama: 'Kocsis P, Súkeník P, Brasó G, Niessner M, Leal-Taixé L, Elezi I. The unreasonable
effectiveness of fully-connected layers for low-data regimes. In: 36th Conference
on Neural Information Processing Systems. Vol 35. Neural Information Processing
Systems Foundation; 2022:1896-1908.'
apa: 'Kocsis, P., Súkeník, P., Brasó, G., Niessner, M., Leal-Taixé, L., & Elezi,
I. (2022). The unreasonable effectiveness of fully-connected layers for low-data
regimes. In 36th Conference on Neural Information Processing Systems (Vol.
35, pp. 1896–1908). New Orleans, LA, United States: Neural Information Processing
Systems Foundation.'
chicago: Kocsis, Peter, Peter Súkeník, Guillem Brasó, Matthias Niessner, Laura Leal-Taixé,
and Ismail Elezi. “The Unreasonable Effectiveness of Fully-Connected Layers for
Low-Data Regimes.” In 36th Conference on Neural Information Processing Systems,
35:1896–1908. Neural Information Processing Systems Foundation, 2022.
ieee: P. Kocsis, P. Súkeník, G. Brasó, M. Niessner, L. Leal-Taixé, and I. Elezi,
“The unreasonable effectiveness of fully-connected layers for low-data regimes,”
in 36th Conference on Neural Information Processing Systems, New Orleans,
LA, United States, 2022, vol. 35, pp. 1896–1908.
ista: 'Kocsis P, Súkeník P, Brasó G, Niessner M, Leal-Taixé L, Elezi I. 2022. The
unreasonable effectiveness of fully-connected layers for low-data regimes. 36th
Conference on Neural Information Processing Systems. NeurIPS: Neural Information
Processing Systems, Advances in Neural Information Processing Systems, vol. 35,
1896–1908.'
mla: Kocsis, Peter, et al. “The Unreasonable Effectiveness of Fully-Connected Layers
for Low-Data Regimes.” 36th Conference on Neural Information Processing Systems,
vol. 35, Neural Information Processing Systems Foundation, 2022, pp. 1896–908.
short: P. Kocsis, P. Súkeník, G. Brasó, M. Niessner, L. Leal-Taixé, I. Elezi, in:,
36th Conference on Neural Information Processing Systems, Neural Information Processing
Systems Foundation, 2022, pp. 1896–1908.
conference:
end_date: 2022-12-09
location: New Orleans, LA, United States
name: 'NeurIPS: Neural Information Processing Systems'
start_date: 2022-11-28
date_created: 2025-01-24T19:16:01Z
date_published: 2022-12-01T00:00:00Z
date_updated: 2025-07-10T11:51:28Z
day: '01'
ddc:
- '000'
extern: '1'
external_id:
arxiv:
- '2210.05657'
file:
- access_level: open_access
checksum: 2a14e59ef8b34d9a1a27a7adbc6f83ff
content_type: application/pdf
creator: psukenik
date_created: 2025-01-24T19:13:32Z
date_updated: 2025-01-24T19:13:32Z
file_id: '18877'
file_name: NeurIPS-2022-the-unreasonable-effectiveness-of-fully-connected-layers-for-low-data-regimes-Paper-Conference.pdf
file_size: 444819
relation: main_file
success: 1
file_date_updated: 2025-01-24T19:13:32Z
has_accepted_license: '1'
intvolume: ' 35'
language:
- iso: eng
month: '12'
oa: 1
oa_version: Published Version
page: 1896-1908
publication: 36th Conference on Neural Information Processing Systems
publication_identifier:
issn:
- 1049-5258
publication_status: published
publisher: Neural Information Processing Systems Foundation
quality_controlled: '1'
scopus_import: '1'
status: public
title: The unreasonable effectiveness of fully-connected layers for low-data regimes
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 35
year: '2022'
...
---
OA_place: repository
OA_type: green
_id: '19490'
abstract:
- lang: eng
text: "Abstract. We study integral points on the quadratic twists ED : y2 = x3 −\r\nD2x
of the congruent number curve. We give upper bounds on the number of\r\nintegral
points in each coset of 2ED(Q) in ED(Q) and show that their total is\r\n (3.8)rank
ED(Q). We further show that the average number of non-torsion\r\nintegral points
in this family is bounded above by 2. As an application we also\r\ndeduce from
our upper bounds that the system of simultaneous Pell equations\r\naX2 − bY 2
= d, bY 2 − cZ2 = d for pairwise coprime positive integers a, b, c, d,\r\nhas
at most (3.6)ω(abcd) integer solutions."
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Yik Tung
full_name: Chan, Yik Tung
id: c4c0afc8-9262-11ed-9231-d8b0bc743af1
last_name: Chan
orcid: 0000-0001-8467-4106
citation:
ama: Chan S. Integral points on the congruent number curve. Transactions of the
American Mathematical Society. 2022;375(9):6675-6700. doi:10.1090/tran/8732
apa: Chan, S. (2022). Integral points on the congruent number curve. Transactions
of the American Mathematical Society. American Mathematical Society. https://doi.org/10.1090/tran/8732
chicago: Chan, Stephanie. “Integral Points on the Congruent Number Curve.” Transactions
of the American Mathematical Society. American Mathematical Society, 2022.
https://doi.org/10.1090/tran/8732.
ieee: S. Chan, “Integral points on the congruent number curve,” Transactions
of the American Mathematical Society, vol. 375, no. 9. American Mathematical
Society, pp. 6675–6700, 2022.
ista: Chan S. 2022. Integral points on the congruent number curve. Transactions
of the American Mathematical Society. 375(9), 6675–6700.
mla: Chan, Stephanie. “Integral Points on the Congruent Number Curve.” Transactions
of the American Mathematical Society, vol. 375, no. 9, American Mathematical
Society, 2022, pp. 6675–700, doi:10.1090/tran/8732.
short: S. Chan, Transactions of the American Mathematical Society 375 (2022) 6675–6700.
date_created: 2025-04-05T10:50:56Z
date_published: 2022-09-01T00:00:00Z
date_updated: 2025-07-10T11:51:47Z
day: '01'
doi: 10.1090/tran/8732
extern: '1'
external_id:
arxiv:
- '2004.03331'
fulldoi: https://doi.org/10.1090/tran/8732
intvolume: ' 375'
issue: '9'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.2004.03331
month: '09'
oa: 1
oa_version: Preprint
page: 6675-6700
publication: Transactions of the American Mathematical Society
publication_identifier:
eissn:
- 1088-6850
issn:
- 0002-9947
publication_status: published
publisher: American Mathematical Society
quality_controlled: '1'
scopus_import: '1'
status: public
title: Integral points on the congruent number curve
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 375
year: '2022'
...
---
DOAJ_listed: '1'
OA_place: publisher
OA_type: gold
_id: '19491'
abstract:
- lang: eng
text: Using a recent breakthrough of Smith [18], we improve the results of Fouvry
and Klüners [4, 5] on the solubility of the negative Pell equation. Let D denote
the set of positive squarefree integers having no prime factors congruent to 3
modulo 4 . Stevenhagen [19] conjectured that the density of d in D such that the
negative Pell equation x2−dy2=−1 is solvable with x,y∈Z is 58.1% , to the nearest
tenth of a percent. By studying the distribution of the 8 -rank of narrow class
groups Cl+(d) of Q(√d) , we prove that the infimum of this density is at least
53.8% .
article_number: e46
article_processing_charge: Yes
article_type: original
arxiv: 1
author:
- first_name: Yik Tung
full_name: Chan, Yik Tung
id: c4c0afc8-9262-11ed-9231-d8b0bc743af1
last_name: Chan
orcid: 0000-0001-8467-4106
- first_name: Peter
full_name: Koymans, Peter
last_name: Koymans
- first_name: Djordjo
full_name: Milovic, Djordjo
last_name: Milovic
- first_name: Carlo
full_name: Pagano, Carlo
last_name: Pagano
citation:
ama: Chan S, Koymans P, Milovic D, Pagano C. The 8-rank of the narrow class group
and the negative Pell equation. Forum of Mathematics, Sigma. 2022;10. doi:10.1017/fms.2022.40
apa: Chan, S., Koymans, P., Milovic, D., & Pagano, C. (2022). The 8-rank of
the narrow class group and the negative Pell equation. Forum of Mathematics,
Sigma. Cambridge University Press. https://doi.org/10.1017/fms.2022.40
chicago: Chan, Stephanie, Peter Koymans, Djordjo Milovic, and Carlo Pagano. “The
8-Rank of the Narrow Class Group and the Negative Pell Equation.” Forum of
Mathematics, Sigma. Cambridge University Press, 2022. https://doi.org/10.1017/fms.2022.40.
ieee: S. Chan, P. Koymans, D. Milovic, and C. Pagano, “The 8-rank of the narrow
class group and the negative Pell equation,” Forum of Mathematics, Sigma,
vol. 10. Cambridge University Press, 2022.
ista: Chan S, Koymans P, Milovic D, Pagano C. 2022. The 8-rank of the narrow class
group and the negative Pell equation. Forum of Mathematics, Sigma. 10, e46.
mla: Chan, Stephanie, et al. “The 8-Rank of the Narrow Class Group and the Negative
Pell Equation.” Forum of Mathematics, Sigma, vol. 10, e46, Cambridge University
Press, 2022, doi:10.1017/fms.2022.40.
short: S. Chan, P. Koymans, D. Milovic, C. Pagano, Forum of Mathematics, Sigma 10
(2022).
date_created: 2025-04-05T10:51:00Z
date_published: 2022-05-17T00:00:00Z
date_updated: 2025-07-10T11:51:47Z
day: '17'
ddc:
- '510'
doi: 10.1017/fms.2022.40
extern: '1'
external_id:
arxiv:
- '1908.01752'
fulldoi: https://doi.org/10.1017/fms.2022.40
has_accepted_license: '1'
intvolume: ' 10'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1017/fms.2022.40
month: '05'
oa: 1
oa_version: Published Version
publication: Forum of Mathematics, Sigma
publication_identifier:
issn:
- 2050-5094
publication_status: published
publisher: Cambridge University Press
quality_controlled: '1'
scopus_import: '1'
status: public
title: The 8-rank of the narrow class group and the negative Pell equation
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: 10
year: '2022'
...
---
DOAJ_listed: '1'
OA_place: publisher
OA_type: gold
_id: '19822'
abstract:
- lang: eng
text: '>Controlling spin wave excitations in magnetic materials underpins the burgeoning
field of magnonics. Yet, little is known about how magnons interact with the conduction
electrons of itinerant magnets, or how this interplay can be controlled. Via a
surface-sensitive spectroscopic approach, we demonstrate a strong electron–magnon
coupling at the Pd-terminated surface of the delafossite oxide PdCoO2, where a
polar surface charge mediates a Stoner transition to itinerant surface ferromagnetism.
We show how the coupling is enhanced sevenfold with increasing surface disorder,
and concomitant charge carrier doping, becoming sufficiently strong to drive the
system into a polaronic regime, accompanied by a significant quasiparticle mass
enhancement. Our study thus sheds light on electron–magnon interactions in solid-state
materials, and the ways in which these can be controlled.'
article_number: '20'
article_processing_charge: Yes
article_type: original
arxiv: 1
author:
- first_name: F.
full_name: Mazzola, F.
last_name: Mazzola
- first_name: C. -M.
full_name: Yim, C. -M.
last_name: Yim
- first_name: Veronika
full_name: Sunko, Veronika
id: 23cb1cf6-2c7a-11ef-91a4-f72fc19f20b3
last_name: Sunko
orcid: 0000-0003-2724-3523
- first_name: S.
full_name: Khim, S.
last_name: Khim
- first_name: P.
full_name: Kushwaha, P.
last_name: Kushwaha
- first_name: O. J.
full_name: Clark, O. J.
last_name: Clark
- first_name: L.
full_name: Bawden, L.
last_name: Bawden
- first_name: I.
full_name: Marković, I.
last_name: Marković
- first_name: D.
full_name: Chakraborti, D.
last_name: Chakraborti
- first_name: T. K.
full_name: Kim, T. K.
last_name: Kim
- first_name: M.
full_name: Hoesch, M.
last_name: Hoesch
- first_name: A. P.
full_name: Mackenzie, A. P.
last_name: Mackenzie
- first_name: P.
full_name: Wahl, P.
last_name: Wahl
- first_name: P. D. C.
full_name: King, P. D. C.
last_name: King
citation:
ama: Mazzola F, Yim C-M, Sunko V, et al. Tuneable electron–magnon coupling of ferromagnetic
surface states in PdCoO2. npj Quantum Materials. 2022;7. doi:10.1038/s41535-022-00428-8
apa: Mazzola, F., Yim, C.-M., Sunko, V., Khim, S., Kushwaha, P., Clark, O. J., …
King, P. D. C. (2022). Tuneable electron–magnon coupling of ferromagnetic surface
states in PdCoO2. Npj Quantum Materials. Springer Nature. https://doi.org/10.1038/s41535-022-00428-8
chicago: Mazzola, F., C. -M. Yim, Veronika Sunko, S. Khim, P. Kushwaha, O. J. Clark,
L. Bawden, et al. “Tuneable Electron–Magnon Coupling of Ferromagnetic Surface
States in PdCoO2.” Npj Quantum Materials. Springer Nature, 2022. https://doi.org/10.1038/s41535-022-00428-8.
ieee: F. Mazzola et al., “Tuneable electron–magnon coupling of ferromagnetic
surface states in PdCoO2,” npj Quantum Materials, vol. 7. Springer Nature,
2022.
ista: Mazzola F, Yim C-M, Sunko V, Khim S, Kushwaha P, Clark OJ, Bawden L, Marković
I, Chakraborti D, Kim TK, Hoesch M, Mackenzie AP, Wahl P, King PDC. 2022. Tuneable
electron–magnon coupling of ferromagnetic surface states in PdCoO2. npj Quantum
Materials. 7, 20.
mla: Mazzola, F., et al. “Tuneable Electron–Magnon Coupling of Ferromagnetic Surface
States in PdCoO2.” Npj Quantum Materials, vol. 7, 20, Springer Nature,
2022, doi:10.1038/s41535-022-00428-8.
short: F. Mazzola, C.-M. Yim, V. Sunko, S. Khim, P. Kushwaha, O.J. Clark, L. Bawden,
I. Marković, D. Chakraborti, T.K. Kim, M. Hoesch, A.P. Mackenzie, P. Wahl, P.D.C.
King, Npj Quantum Materials 7 (2022).
date_created: 2025-06-10T09:20:49Z
date_published: 2022-02-11T00:00:00Z
date_updated: 2025-06-10T13:13:32Z
day: '11'
doi: 10.1038/s41535-022-00428-8
extern: '1'
external_id:
arxiv:
- '2112.04869'
fulldoi: https://doi.org/10.1038/s41535-022-00428-8
intvolume: ' 7'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1038/s41535-022-00428-8
month: '02'
oa: 1
oa_version: Published Version
publication: npj Quantum Materials
publication_identifier:
eissn:
- 2397-4648
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Tuneable electron–magnon coupling of ferromagnetic surface states in PdCoO2
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 7
year: '2022'
...
---
OA_place: publisher
OA_type: gold
_id: '19984'
abstract:
- lang: eng
text: "The first part of this paper is a survey of mathematical results on mirror
symmetry phenomena between Hitchin systems for Langlands dual groups. The second
part introduces\r\nand discusses multiplicity algebras of the Hitchin system on
Lagrangians, and considers\r\ncorresponding conjectural structures on their mirror."
acknowledgement: "The author thanks Nigel Hitchin for introducing him to Higgs bundles
during 1995–1998,\r\nsuggesting the SYZ picture for Langlands dual Hitchin systems
in 1996, and for the\r\nmore recent collaborations [29, 30]. He also thanks David
Ben-Zvi, Pierre-Henri Chaudouard, Pierre Deligne, Ron Donagi, Sergei Gukov, Jochen
Heinloth, Vadim Kaloshin,\r\nJoel Kamnitzer, Gérard Laumon, Anton Mellit, David
Nadler, Andy Neitzke, Ngô Bao\r\nChâu, Michael Thaddeus, Tony Pantev, Du Pei, Richárd
Rimányi, Leonid Rybnikov, Vivek\r\nShende, Balázs Szendrői, András Szenes, Fernando
Rodriguez-Villegas, Edward Witten,\r\nand Zhiwei Yun for discussions about the subjects
in this paper over the years. Thanks are\r\nalso due to Hülya Argüz, Jakub Löwit,
Balázs Szendrői, and Nigel Hitchin for the careful\r\nreading of the paper."
article_processing_charge: No
arxiv: 1
author:
- first_name: Tamás
full_name: Hausel, Tamás
id: 4A0666D8-F248-11E8-B48F-1D18A9856A87
last_name: Hausel
orcid: 0000-0002-9582-2634
citation:
ama: 'Hausel T. Enhanced mirror symmetry for Langlands dual Hitchin systems. In:
International Congress of Mathematicians. EMS Press; 2022:2228-2249. doi:10.4171/icm2022/164'
apa: 'Hausel, T. (2022). Enhanced mirror symmetry for Langlands dual Hitchin systems.
In International Congress of Mathematicians (pp. 2228–2249). virtuel: EMS
Press. https://doi.org/10.4171/icm2022/164'
chicago: Hausel, Tamás. “Enhanced Mirror Symmetry for Langlands Dual Hitchin Systems.”
In International Congress of Mathematicians, 2228–49. EMS Press, 2022.
https://doi.org/10.4171/icm2022/164.
ieee: T. Hausel, “Enhanced mirror symmetry for Langlands dual Hitchin systems,”
in International Congress of Mathematicians, EMS Press, 2022, pp. 2228–2249.
ista: 'Hausel T. 2022.Enhanced mirror symmetry for Langlands dual Hitchin systems.
In: International Congress of Mathematicians. , 2228–2249.'
mla: Hausel, Tamás. “Enhanced Mirror Symmetry for Langlands Dual Hitchin Systems.”
International Congress of Mathematicians, EMS Press, 2022, pp. 2228–49,
doi:10.4171/icm2022/164.
short: T. Hausel, in:, International Congress of Mathematicians, EMS Press, 2022,
pp. 2228–2249.
conference:
end_date: 2022-07-14
location: virtuel
name: 'ICM: International Congress of Mathematicians'
start_date: 2022-07-06
corr_author: '1'
date_created: 2025-07-10T13:13:36Z
date_published: 2022-07-15T00:00:00Z
date_updated: 2025-09-24T09:12:13Z
day: '15'
ddc:
- '510'
department:
- _id: TaHa
doi: 10.4171/icm2022/164
external_id:
arxiv:
- '2112.09455'
file:
- access_level: open_access
checksum: d2b9d4cf51c854f1082d8dc18c5853b1
content_type: application/pdf
creator: dernst
date_created: 2025-09-24T09:05:05Z
date_updated: 2025-09-24T09:05:05Z
file_id: '20387'
file_name: 2022_ICM_Hausel.pdf
file_size: 655370
relation: main_file
success: 1
file_date_updated: 2025-09-24T09:05:05Z
fulldoi: https://doi.org/10.4171/icm2022/164
has_accepted_license: '1'
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
page: 2228-2249
publication: International Congress of Mathematicians
publication_identifier:
eisbn:
- '9783985475582'
isbn:
- '9783985470587'
publication_status: published
publisher: EMS Press
quality_controlled: '1'
status: public
title: Enhanced mirror symmetry for Langlands dual Hitchin systems
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: book_chapter
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2022'
...
---
OA_type: closed access
_id: '20062'
abstract:
- lang: eng
text: "This article presents two fine-grained complexity lower bounds with relevance
to algorithmic problems in computer aided verification. We have chosen these lower
bounds as the proofs are relatively simple, but the techniques can be extended
to give lower bounds for many more algorithmic problems. The goal is to present
the bounds with minimal notation, making the results accessible to a broad community
and stimulating further research in the area.\r\n\r\nSpecifically, we first describe
a lower bound on the symbolic complexity of computing strongly connected components,
which can be extended to show lower bounds for fundamental model-checking questions
in graphs, published in [CDHL16b]. Second we present a conditional lower bound
for disjunctive safety problems on graphs from [CDHL18] in the RAM model of computation.
This bound can be modified to give conditional lower bounds for disjunctive objectives
for reachability, Büchi, coBüchi and Rabin objectives in MDPs. We also present
various open questions."
acknowledgement: This project has received funding from the European Research Council
(ERC) under the European Union’s Horizon 2020 research and innovation programme
(Grant agreement No. 101019564 “The Design of Modern Fully Dynamic Data Structures
(MoDynStruct)” and from the Austrian Science Fund (FWF) project “Fast Algorithms
for a Reactive Network Layer (ReactNet)”, P 33775-N, with additional funding from
the netidee SCIENCE Stiftung, 2020–2024.
article_processing_charge: No
author:
- first_name: Monika H
full_name: Henzinger, Monika H
id: 540c9bbd-f2de-11ec-812d-d04a5be85630
last_name: Henzinger
orcid: 0000-0002-5008-6530
citation:
ama: 'Henzinger M. Fine-Grained Complexity Lower Bounds for Problems in Computer
Aided Verification. In: Raskin J-F, Chatterjee K, Doyen L, Majumdar R, eds. Principles
of Systems Design. Vol 13660. LNCS. Cham: Springer Nature Switzerland; 2022:292-305.
doi:10.1007/978-3-031-22337-2_14'
apa: 'Henzinger, M. (2022). Fine-Grained Complexity Lower Bounds for Problems in
Computer Aided Verification. In J.-F. Raskin, K. Chatterjee, L. Doyen, & R.
Majumdar (Eds.), Principles of Systems Design (Vol. 13660, pp. 292–305).
Cham: Springer Nature Switzerland. https://doi.org/10.1007/978-3-031-22337-2_14'
chicago: 'Henzinger, Monika. “Fine-Grained Complexity Lower Bounds for Problems
in Computer Aided Verification.” In Principles of Systems Design, edited
by Jean-François Raskin, Krishnendu Chatterjee, Laurent Doyen, and Rupak Majumdar,
13660:292–305. LNCS. Cham: Springer Nature Switzerland, 2022. https://doi.org/10.1007/978-3-031-22337-2_14.'
ieee: 'M. Henzinger, “Fine-Grained Complexity Lower Bounds for Problems in Computer
Aided Verification,” in Principles of Systems Design, vol. 13660, J.-F.
Raskin, K. Chatterjee, L. Doyen, and R. Majumdar, Eds. Cham: Springer Nature Switzerland,
2022, pp. 292–305.'
ista: 'Henzinger M. 2022.Fine-Grained Complexity Lower Bounds for Problems in Computer
Aided Verification. In: Principles of Systems Design. vol. 13660, 292–305.'
mla: Henzinger, Monika. “Fine-Grained Complexity Lower Bounds for Problems in Computer
Aided Verification.” Principles of Systems Design, edited by Jean-François
Raskin et al., vol. 13660, Springer Nature Switzerland, 2022, pp. 292–305, doi:10.1007/978-3-031-22337-2_14.
short: M. Henzinger, in:, J.-F. Raskin, K. Chatterjee, L. Doyen, R. Majumdar (Eds.),
Principles of Systems Design, Springer Nature Switzerland, Cham, 2022, pp. 292–305.
date_created: 2025-07-22T06:19:50Z
date_published: 2022-12-29T00:00:00Z
date_updated: 2025-07-22T06:23:55Z
day: '29'
doi: 10.1007/978-3-031-22337-2_14
editor:
- first_name: Jean-François
full_name: Raskin, Jean-François
last_name: Raskin
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Laurent
full_name: Doyen, Laurent
last_name: Doyen
- first_name: Rupak
full_name: Majumdar, Rupak
last_name: Majumdar
extern: '1'
fulldoi: https://doi.org/10.1007/978-3-031-22337-2_14
intvolume: ' 13660'
language:
- iso: eng
month: '12'
oa_version: None
page: 292-305
place: Cham
publication: Principles of Systems Design
publication_identifier:
eisbn:
- '9783031223372'
eissn:
- 1611-3349
isbn:
- '9783031223365'
issn:
- 0302-9743
publication_status: published
publisher: Springer Nature Switzerland
quality_controlled: '1'
scopus_import: '1'
series_title: LNCS
status: public
title: Fine-Grained Complexity Lower Bounds for Problems in Computer Aided Verification
type: book_chapter
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 13660
year: '2022'
...
---
OA_place: repository
OA_type: green
_id: '20616'
abstract:
- lang: eng
text: We establish two WDVV-style relations for the disk invariants of real symplectic
fourfolds by implementing Georgieva’s suggestion to lift homology relations from
the Deligne–Mumford moduli spaces of stable real curves. This is accomplished
by lifting judiciously chosen cobordisms realizing these relations. The resulting
lifted relations lead to the recursions for Welschinger invariants announced by
Solomon in 2007 and have the same structure as his WDVV-style relations, but differ
by signs from the latter. Our topological approach provides a general framework
for lifting relations via morphisms between not necessarily orientable spaces.
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Xujia
full_name: Chen, Xujia
id: 968ad14a-fd86-11ee-a420-ea29715511a3
last_name: Chen
citation:
ama: Chen X. Steenrod pseudocycles, lifted cobordisms, and Solomon’s relations for
Welschinger invariants. Geometric and Functional Analysis. 2022;32(3):490-567.
doi:10.1007/s00039-022-00596-6
apa: Chen, X. (2022). Steenrod pseudocycles, lifted cobordisms, and Solomon’s relations
for Welschinger invariants. Geometric and Functional Analysis. Springer
Nature. https://doi.org/10.1007/s00039-022-00596-6
chicago: Chen, Xujia. “Steenrod Pseudocycles, Lifted Cobordisms, and Solomon’s Relations
for Welschinger Invariants.” Geometric and Functional Analysis. Springer
Nature, 2022. https://doi.org/10.1007/s00039-022-00596-6.
ieee: X. Chen, “Steenrod pseudocycles, lifted cobordisms, and Solomon’s relations
for Welschinger invariants,” Geometric and Functional Analysis, vol. 32,
no. 3. Springer Nature, pp. 490–567, 2022.
ista: Chen X. 2022. Steenrod pseudocycles, lifted cobordisms, and Solomon’s relations
for Welschinger invariants. Geometric and Functional Analysis. 32(3), 490–567.
mla: Chen, Xujia. “Steenrod Pseudocycles, Lifted Cobordisms, and Solomon’s Relations
for Welschinger Invariants.” Geometric and Functional Analysis, vol. 32,
no. 3, Springer Nature, 2022, pp. 490–567, doi:10.1007/s00039-022-00596-6.
short: X. Chen, Geometric and Functional Analysis 32 (2022) 490–567.
date_created: 2025-11-10T08:40:40Z
date_published: 2022-04-15T00:00:00Z
date_updated: 2025-11-10T15:18:07Z
day: '15'
doi: 10.1007/s00039-022-00596-6
extern: '1'
external_id:
arxiv:
- '1809.08919'
fulldoi: https://doi.org/10.1007/s00039-022-00596-6
intvolume: ' 32'
issue: '3'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.1809.08919
month: '04'
oa: 1
oa_version: Preprint
page: 490-567
publication: Geometric and Functional Analysis
publication_identifier:
eissn:
- 1420-8970
issn:
- 1016-443X
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
status: public
title: Steenrod pseudocycles, lifted cobordisms, and Solomon’s relations for Welschinger
invariants
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 32
year: '2022'
...
---
OA_place: repository
OA_type: green
_id: '20617'
abstract:
- lang: eng
text: Our previous paper describes a geometric translation of the construction of
open Gromov–Witten invariants by Solomon and Tukachinsky from a perspective of
$A_{\infty }$-algebras of differential forms. We now use this geometric perspective
to show that these invariants reduce to Welschinger’s open Gromov–Witten invariants
in dimension 6, inline with their and Tian’s expectations. As an immediate corollary,
we obtain a translation of Solomon–Tukachinsky’s open WDVV equations into relations
for Welschinger’s invariants.
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Xujia
full_name: Chen, Xujia
id: 968ad14a-fd86-11ee-a420-ea29715511a3
last_name: Chen
citation:
ama: Chen X. Solomon-Tukachinsky’s versus Welschinger’s open Gromov-Witten invariants
of symplectic six-folds. International Mathematics Research Notices. 2022;2022(9):7021-7055.
doi:10.1093/imrn/rnaa318
apa: Chen, X. (2022). Solomon-Tukachinsky’s versus Welschinger’s open Gromov-Witten
invariants of symplectic six-folds. International Mathematics Research Notices.
Oxford University Press. https://doi.org/10.1093/imrn/rnaa318
chicago: Chen, Xujia. “Solomon-Tukachinsky’s versus Welschinger’s Open Gromov-Witten
Invariants of Symplectic Six-Folds.” International Mathematics Research Notices.
Oxford University Press, 2022. https://doi.org/10.1093/imrn/rnaa318.
ieee: X. Chen, “Solomon-Tukachinsky’s versus Welschinger’s open Gromov-Witten invariants
of symplectic six-folds,” International Mathematics Research Notices, vol.
2022, no. 9. Oxford University Press, pp. 7021–7055, 2022.
ista: Chen X. 2022. Solomon-Tukachinsky’s versus Welschinger’s open Gromov-Witten
invariants of symplectic six-folds. International Mathematics Research Notices.
2022(9), 7021–7055.
mla: Chen, Xujia. “Solomon-Tukachinsky’s versus Welschinger’s Open Gromov-Witten
Invariants of Symplectic Six-Folds.” International Mathematics Research Notices,
vol. 2022, no. 9, Oxford University Press, 2022, pp. 7021–55, doi:10.1093/imrn/rnaa318.
short: X. Chen, International Mathematics Research Notices 2022 (2022) 7021–7055.
date_created: 2025-11-10T08:40:57Z
date_published: 2022-05-01T00:00:00Z
date_updated: 2025-11-10T14:57:33Z
day: '01'
doi: 10.1093/imrn/rnaa318
extern: '1'
external_id:
arxiv:
- '1912.05437'
fulldoi: https://doi.org/10.1093/imrn/rnaa318
intvolume: ' 2022'
issue: '9'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.1912.05437
month: '05'
oa: 1
oa_version: Preprint
page: 7021-7055
publication: International Mathematics Research Notices
publication_identifier:
eissn:
- 1687-0247
issn:
- 1073-7928
publication_status: published
publisher: Oxford University Press
quality_controlled: '1'
scopus_import: '1'
status: public
title: Solomon-Tukachinsky’s versus Welschinger’s open Gromov-Witten invariants of
symplectic six-folds
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 2022
year: '2022'
...
---
OA_place: repository
OA_type: green
_id: '20620'
abstract:
- lang: eng
text: The 2016 papers of J. Solomon and S. Tukachinsky use bounding chains in Fukaya's
$A_{\infty}$-algebras to define numerical disk counts relative to a Lagrangian
under certain regularity assumptions on the moduli spaces of disks. We present
a (self-contained) direct geometric analogue of their construction under weaker
topological assumptions, extend it over arbitrary rings in the process, and sketch
an extension without any assumptions over rings containing the rationals. This
implements the intuitive suggestion represented by their drawing and P. Georgieva's
perspective. We also note a curious relation for the standard Gromov-Witten invariants
readily deducible from their work. In a sequel, we use the geometric perspective
of this paper to relate Solomon-Tukachinsky's invariants to Welschinger's open
invariants of symplectic sixfolds, confirming their belief and G. Tian's related
expectation concerning K. Fukaya's earlier construction.
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Xujia
full_name: Chen, Xujia
id: 968ad14a-fd86-11ee-a420-ea29715511a3
last_name: Chen
citation:
ama: Chen X. A geometric depiction of Solomon-Tukachinsky’s construction of open
GW-invariants. Peking Mathematical Journal . 2022;5:279-348. doi:10.1007/s42543-021-00044-8
apa: Chen, X. (2022). A geometric depiction of Solomon-Tukachinsky’s construction
of open GW-invariants. Peking Mathematical Journal . Springer Nature. https://doi.org/10.1007/s42543-021-00044-8
chicago: Chen, Xujia. “A Geometric Depiction of Solomon-Tukachinsky’s Construction
of Open GW-Invariants.” Peking Mathematical Journal . Springer Nature,
2022. https://doi.org/10.1007/s42543-021-00044-8.
ieee: X. Chen, “A geometric depiction of Solomon-Tukachinsky’s construction of open
GW-invariants,” Peking Mathematical Journal , vol. 5. Springer Nature,
pp. 279–348, 2022.
ista: Chen X. 2022. A geometric depiction of Solomon-Tukachinsky’s construction
of open GW-invariants. Peking Mathematical Journal . 5, 279–348.
mla: Chen, Xujia. “A Geometric Depiction of Solomon-Tukachinsky’s Construction of
Open GW-Invariants.” Peking Mathematical Journal , vol. 5, Springer Nature,
2022, pp. 279–348, doi:10.1007/s42543-021-00044-8.
short: X. Chen, Peking Mathematical Journal 5 (2022) 279–348.
date_created: 2025-11-10T08:43:20Z
date_published: 2022-09-01T00:00:00Z
date_updated: 2025-11-10T13:51:17Z
day: '01'
doi: 10.1007/s42543-021-00044-8
extern: '1'
external_id:
arxiv:
- '1912.04119'
fulldoi: https://doi.org/10.1007/s42543-021-00044-8
intvolume: ' 5'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.1912.04119
month: '09'
oa: 1
oa_version: Submitted Version
page: 279-348
publication: 'Peking Mathematical Journal '
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: A geometric depiction of Solomon-Tukachinsky's construction of open GW-invariants
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 5
year: '2022'
...