---
_id: '7948'
abstract:
- lang: eng
text: In agricultural systems, nitrate is the main source of nitrogen available
for plants. Besides its role as a nutrient, nitrate has been shown to act as a
signal molecule for plant growth, development and stress responses. In Arabidopsis,
the NRT1.1 nitrate transceptor represses lateral root (LR) development at low
nitrate availability by promoting auxin basipetal transport out of the LR primordia
(LRPs). In addition, our present study shows that NRT1.1 acts as a negative regulator
of the TAR2 auxin biosynthetic gene expression in the root stele. This is expected
to repress local auxin biosynthesis and thus to reduce acropetal auxin supply
to the LRPs. Moreover, NRT1.1 also negatively affects expression of the LAX3 auxin
influx carrier, thus preventing cell wall remodeling required for overlying tissues
separation during LRP emergence. Both NRT1.1-mediated repression of TAR2 and LAX3
are suppressed at high nitrate availability, resulting in the nitrate induction
of TAR2 and LAX3 expression that is required for optimal stimulation of LR development
by nitrate. Altogether, our results indicate that the NRT1.1 transceptor coordinately
controls several crucial auxin-associated processes required for LRP development,
and as a consequence that NRT1.1 plays a much more integrated role than previously
anticipated in regulating the nitrate response of root system architecture.
article_processing_charge: No
article_type: original
author:
- first_name: A
full_name: Maghiaoui, A
last_name: Maghiaoui
- first_name: E
full_name: Bouguyon, E
last_name: Bouguyon
- first_name: Candela
full_name: Cuesta, Candela
id: 33A3C818-F248-11E8-B48F-1D18A9856A87
last_name: Cuesta
orcid: 0000-0003-1923-2410
- first_name: F
full_name: Perrine-Walker, F
last_name: Perrine-Walker
- first_name: C
full_name: Alcon, C
last_name: Alcon
- first_name: G
full_name: Krouk, G
last_name: Krouk
- first_name: Eva
full_name: Benková, Eva
id: 38F4F166-F248-11E8-B48F-1D18A9856A87
last_name: Benková
orcid: 0000-0002-8510-9739
- first_name: P
full_name: Nacry, P
last_name: Nacry
- first_name: A
full_name: Gojon, A
last_name: Gojon
- first_name: L
full_name: Bach, L
last_name: Bach
citation:
ama: Maghiaoui A, Bouguyon E, Cuesta C, et al. The Arabidopsis NRT1.1 transceptor
coordinately controls auxin biosynthesis and transport to regulate root branching
in response to nitrate. Journal of Experimental Botany. 2020;71(15):4480-4494.
doi:10.1093/jxb/eraa242
apa: Maghiaoui, A., Bouguyon, E., Cuesta, C., Perrine-Walker, F., Alcon, C., Krouk,
G., … Bach, L. (2020). The Arabidopsis NRT1.1 transceptor coordinately controls
auxin biosynthesis and transport to regulate root branching in response to nitrate.
Journal of Experimental Botany. Oxford University Press. https://doi.org/10.1093/jxb/eraa242
chicago: Maghiaoui, A, E Bouguyon, Candela Cuesta, F Perrine-Walker, C Alcon, G
Krouk, Eva Benková, P Nacry, A Gojon, and L Bach. “The Arabidopsis NRT1.1 Transceptor
Coordinately Controls Auxin Biosynthesis and Transport to Regulate Root Branching
in Response to Nitrate.” Journal of Experimental Botany. Oxford University
Press, 2020. https://doi.org/10.1093/jxb/eraa242.
ieee: A. Maghiaoui et al., “The Arabidopsis NRT1.1 transceptor coordinately
controls auxin biosynthesis and transport to regulate root branching in response
to nitrate,” Journal of Experimental Botany, vol. 71, no. 15. Oxford University
Press, pp. 4480–4494, 2020.
ista: Maghiaoui A, Bouguyon E, Cuesta C, Perrine-Walker F, Alcon C, Krouk G, Benková
E, Nacry P, Gojon A, Bach L. 2020. The Arabidopsis NRT1.1 transceptor coordinately
controls auxin biosynthesis and transport to regulate root branching in response
to nitrate. Journal of Experimental Botany. 71(15), 4480–4494.
mla: Maghiaoui, A., et al. “The Arabidopsis NRT1.1 Transceptor Coordinately Controls
Auxin Biosynthesis and Transport to Regulate Root Branching in Response to Nitrate.”
Journal of Experimental Botany, vol. 71, no. 15, Oxford University Press,
2020, pp. 4480–94, doi:10.1093/jxb/eraa242.
short: A. Maghiaoui, E. Bouguyon, C. Cuesta, F. Perrine-Walker, C. Alcon, G. Krouk,
E. Benková, P. Nacry, A. Gojon, L. Bach, Journal of Experimental Botany 71 (2020)
4480–4494.
date_created: 2020-06-08T10:10:28Z
date_published: 2020-07-25T00:00:00Z
date_updated: 2023-08-21T07:07:30Z
day: '25'
department:
- _id: EvBe
doi: 10.1093/jxb/eraa242
external_id:
isi:
- '000553127600013'
pmid:
- '32428238'
intvolume: ' 71'
isi: 1
issue: '15'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://hal.inrae.fr/hal-02619371
month: '07'
oa: 1
oa_version: Submitted Version
page: 4480-4494
pmid: 1
publication: Journal of Experimental Botany
publication_identifier:
eissn:
- 1460-2431
issn:
- 0022-0957
publication_status: published
publisher: Oxford University Press
quality_controlled: '1'
status: public
title: The Arabidopsis NRT1.1 transceptor coordinately controls auxin biosynthesis
and transport to regulate root branching in response to nitrate
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 71
year: '2020'
...
---
_id: '7949'
abstract:
- lang: eng
text: Peptides derived from non-functional precursors play important roles in various
developmental processes, but also in (a)biotic stress signaling. Our (phospho)proteome-wide
analyses of C-terminally encoded peptide 5 (CEP5)-mediated changes revealed an
impact on abiotic stress-related processes. Drought has a dramatic impact on plant
growth, development and reproduction, and the plant hormone auxin plays a role
in drought responses. Our genetic, physiological, biochemical and pharmacological
results demonstrated that CEP5-mediated signaling is relevant for osmotic and
drought stress tolerance in Arabidopsis, and that CEP5 specifically counteracts
auxin effects. Specifically, we found that CEP5 signaling stabilizes AUX/IAA transcriptional
repressors, suggesting the existence of a novel peptide-dependent control mechanism
that tunes auxin signaling. These observations align with the recently described
role of AUX/IAAs in stress tolerance and provide a novel role for CEP5 in osmotic
and drought stress tolerance.
acknowledgement: We thank Maria Njo, Sarah De Cokere, Marieke Mispelaere and Darren
Wells, for practical assistance, Daniël Van Damme for assistance with image analysis,
Marnik Vuylsteke for advice on statistics, Catherine Perrot-Rechenmann for useful
discussions, Steffen Lau for critical reading oft he manuscript, and Philip Benfey,
Gerd Jürgens, Philippe Nacry, Frederik Börnke, and Frans Tax for sharing materials.
article_processing_charge: No
article_type: original
author:
- first_name: S
full_name: Smith, S
last_name: Smith
- first_name: S
full_name: Zhu, S
last_name: Zhu
- first_name: L
full_name: Joos, L
last_name: Joos
- first_name: I
full_name: Roberts, I
last_name: Roberts
- first_name: N
full_name: Nikonorova, N
last_name: Nikonorova
- first_name: LD
full_name: Vu, LD
last_name: Vu
- first_name: E
full_name: Stes, E
last_name: Stes
- first_name: H
full_name: Cho, H
last_name: Cho
- first_name: A
full_name: Larrieu, A
last_name: Larrieu
- first_name: W
full_name: Xuan, W
last_name: Xuan
- first_name: B
full_name: Goodall, B
last_name: Goodall
- first_name: B
full_name: van de Cotte, B
last_name: van de Cotte
- first_name: JM
full_name: Waite, JM
last_name: Waite
- first_name: A
full_name: Rigal, A
last_name: Rigal
- first_name: SR
full_name: R Harborough, SR
last_name: R Harborough
- first_name: G
full_name: Persiau, G
last_name: Persiau
- first_name: S
full_name: Vanneste, S
last_name: Vanneste
- first_name: GK
full_name: Kirschner, GK
last_name: Kirschner
- first_name: E
full_name: Vandermarliere, E
last_name: Vandermarliere
- first_name: L
full_name: Martens, L
last_name: Martens
- first_name: Y
full_name: Stahl, Y
last_name: Stahl
- first_name: D
full_name: Audenaert, D
last_name: Audenaert
- first_name: Jiří
full_name: Friml, Jiří
id: 4159519E-F248-11E8-B48F-1D18A9856A87
last_name: Friml
orcid: 0000-0002-8302-7596
- first_name: G
full_name: Felix, G
last_name: Felix
- first_name: R
full_name: Simon, R
last_name: Simon
- first_name: M
full_name: Bennett, M
last_name: Bennett
- first_name: A
full_name: Bishopp, A
last_name: Bishopp
- first_name: G
full_name: De Jaeger, G
last_name: De Jaeger
- first_name: K
full_name: Ljung, K
last_name: Ljung
- first_name: S
full_name: Kepinski, S
last_name: Kepinski
- first_name: S
full_name: Robert, S
last_name: Robert
- first_name: J
full_name: Nemhauser, J
last_name: Nemhauser
- first_name: I
full_name: Hwang, I
last_name: Hwang
- first_name: K
full_name: Gevaert, K
last_name: Gevaert
- first_name: T
full_name: Beeckman, T
last_name: Beeckman
- first_name: I
full_name: De Smet, I
last_name: De Smet
citation:
ama: Smith S, Zhu S, Joos L, et al. The CEP5 peptide promotes abiotic stress tolerance,
as revealed by quantitative proteomics, and attenuates the AUX/IAA equilibrium
in Arabidopsis. Molecular & Cellular Proteomics. 2020;19(8):1248-1262.
doi:10.1074/mcp.ra119.001826
apa: Smith, S., Zhu, S., Joos, L., Roberts, I., Nikonorova, N., Vu, L., … De Smet,
I. (2020). The CEP5 peptide promotes abiotic stress tolerance, as revealed by
quantitative proteomics, and attenuates the AUX/IAA equilibrium in Arabidopsis.
Molecular & Cellular Proteomics. American Society for Biochemistry
and Molecular Biology. https://doi.org/10.1074/mcp.ra119.001826
chicago: Smith, S, S Zhu, L Joos, I Roberts, N Nikonorova, LD Vu, E Stes, et al.
“The CEP5 Peptide Promotes Abiotic Stress Tolerance, as Revealed by Quantitative
Proteomics, and Attenuates the AUX/IAA Equilibrium in Arabidopsis.” Molecular
& Cellular Proteomics. American Society for Biochemistry and Molecular
Biology, 2020. https://doi.org/10.1074/mcp.ra119.001826.
ieee: S. Smith et al., “The CEP5 peptide promotes abiotic stress tolerance,
as revealed by quantitative proteomics, and attenuates the AUX/IAA equilibrium
in Arabidopsis,” Molecular & Cellular Proteomics, vol. 19, no. 8. American
Society for Biochemistry and Molecular Biology, pp. 1248–1262, 2020.
ista: Smith S, Zhu S, Joos L, Roberts I, Nikonorova N, Vu L, Stes E, Cho H, Larrieu
A, Xuan W, Goodall B, van de Cotte B, Waite J, Rigal A, R Harborough S, Persiau
G, Vanneste S, Kirschner G, Vandermarliere E, Martens L, Stahl Y, Audenaert D,
Friml J, Felix G, Simon R, Bennett M, Bishopp A, De Jaeger G, Ljung K, Kepinski
S, Robert S, Nemhauser J, Hwang I, Gevaert K, Beeckman T, De Smet I. 2020. The
CEP5 peptide promotes abiotic stress tolerance, as revealed by quantitative proteomics,
and attenuates the AUX/IAA equilibrium in Arabidopsis. Molecular & Cellular
Proteomics. 19(8), 1248–1262.
mla: Smith, S., et al. “The CEP5 Peptide Promotes Abiotic Stress Tolerance, as Revealed
by Quantitative Proteomics, and Attenuates the AUX/IAA Equilibrium in Arabidopsis.”
Molecular & Cellular Proteomics, vol. 19, no. 8, American Society for
Biochemistry and Molecular Biology, 2020, pp. 1248–62, doi:10.1074/mcp.ra119.001826.
short: S. Smith, S. Zhu, L. Joos, I. Roberts, N. Nikonorova, L. Vu, E. Stes, H.
Cho, A. Larrieu, W. Xuan, B. Goodall, B. van de Cotte, J. Waite, A. Rigal, S.
R Harborough, G. Persiau, S. Vanneste, G. Kirschner, E. Vandermarliere, L. Martens,
Y. Stahl, D. Audenaert, J. Friml, G. Felix, R. Simon, M. Bennett, A. Bishopp,
G. De Jaeger, K. Ljung, S. Kepinski, S. Robert, J. Nemhauser, I. Hwang, K. Gevaert,
T. Beeckman, I. De Smet, Molecular & Cellular Proteomics 19 (2020) 1248–1262.
date_created: 2020-06-08T10:10:53Z
date_published: 2020-08-01T00:00:00Z
date_updated: 2023-09-05T12:17:46Z
day: '01'
ddc:
- '580'
department:
- _id: JiFr
doi: 10.1074/mcp.ra119.001826
external_id:
isi:
- '000561114000001'
pmid:
- '32404488'
file:
- access_level: open_access
checksum: 3f3f37b4a1ba2cfd270fc7733dd89680
content_type: application/pdf
creator: kschuh
date_created: 2021-05-05T10:10:14Z
date_updated: 2021-05-05T10:10:14Z
file_id: '9373'
file_name: 2020_MCP_Smith.pdf
file_size: 1632311
relation: main_file
success: 1
file_date_updated: 2021-05-05T10:10:14Z
has_accepted_license: '1'
intvolume: ' 19'
isi: 1
issue: '8'
language:
- iso: eng
month: '08'
oa: 1
oa_version: Published Version
page: 1248-1262
pmid: 1
publication: Molecular & Cellular Proteomics
publication_identifier:
eissn:
- 1535-9484
publication_status: published
publisher: American Society for Biochemistry and Molecular Biology
quality_controlled: '1'
scopus_import: '1'
status: public
title: The CEP5 peptide promotes abiotic stress tolerance, as revealed by quantitative
proteomics, and attenuates the AUX/IAA equilibrium in Arabidopsis
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: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 19
year: '2020'
...
---
_id: '7952'
abstract:
- lang: eng
text: "Isomanifolds are the generalization of isosurfaces to arbitrary dimension
and codimension, i.e. manifolds defined as the zero set of some multivariate vector-valued
smooth function f: ℝ^d → ℝ^(d-n). A natural (and efficient) way to approximate
an isomanifold is to consider its Piecewise-Linear (PL) approximation based on
a triangulation \U0001D4AF of the ambient space ℝ^d. In this paper, we give conditions
under which the PL-approximation of an isomanifold is topologically equivalent
to the isomanifold. The conditions are easy to satisfy in the sense that they
can always be met by taking a sufficiently fine triangulation \U0001D4AF. This
contrasts with previous results on the triangulation of manifolds where, in arbitrary
dimensions, delicate perturbations are needed to guarantee topological correctness,
which leads to strong limitations in practice. We further give a bound on the
Fréchet distance between the original isomanifold and its PL-approximation. Finally
we show analogous results for the PL-approximation of an isomanifold with boundary. "
alternative_title:
- LIPIcs
article_number: 20:1-20:18
article_processing_charge: No
author:
- first_name: Jean-Daniel
full_name: Boissonnat, Jean-Daniel
last_name: Boissonnat
- first_name: Mathijs
full_name: Wintraecken, Mathijs
id: 307CFBC8-F248-11E8-B48F-1D18A9856A87
last_name: Wintraecken
orcid: 0000-0002-7472-2220
citation:
ama: 'Boissonnat J-D, Wintraecken M. The topological correctness of PL-approximations
of isomanifolds. In: 36th International Symposium on Computational Geometry.
Vol 164. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2020. doi:10.4230/LIPIcs.SoCG.2020.20'
apa: 'Boissonnat, J.-D., & Wintraecken, M. (2020). The topological correctness
of PL-approximations of isomanifolds. In 36th International Symposium on Computational
Geometry (Vol. 164). Zürich, Switzerland: Schloss Dagstuhl - Leibniz-Zentrum
für Informatik. https://doi.org/10.4230/LIPIcs.SoCG.2020.20'
chicago: Boissonnat, Jean-Daniel, and Mathijs Wintraecken. “The Topological Correctness
of PL-Approximations of Isomanifolds.” In 36th International Symposium on Computational
Geometry, Vol. 164. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020.
https://doi.org/10.4230/LIPIcs.SoCG.2020.20.
ieee: J.-D. Boissonnat and M. Wintraecken, “The topological correctness of PL-approximations
of isomanifolds,” in 36th International Symposium on Computational Geometry,
Zürich, Switzerland, 2020, vol. 164.
ista: 'Boissonnat J-D, Wintraecken M. 2020. The topological correctness of PL-approximations
of isomanifolds. 36th International Symposium on Computational Geometry. SoCG:
Symposium on Computational Geometry, LIPIcs, vol. 164, 20:1-20:18.'
mla: Boissonnat, Jean-Daniel, and Mathijs Wintraecken. “The Topological Correctness
of PL-Approximations of Isomanifolds.” 36th International Symposium on Computational
Geometry, vol. 164, 20:1-20:18, Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
2020, doi:10.4230/LIPIcs.SoCG.2020.20.
short: J.-D. Boissonnat, M. Wintraecken, in:, 36th International Symposium on Computational
Geometry, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020.
conference:
end_date: 2020-06-26
location: Zürich, Switzerland
name: 'SoCG: Symposium on Computational Geometry'
start_date: 2020-06-22
date_created: 2020-06-09T07:24:11Z
date_published: 2020-06-01T00:00:00Z
date_updated: 2023-08-02T06:49:16Z
day: '01'
ddc:
- '510'
department:
- _id: HeEd
doi: 10.4230/LIPIcs.SoCG.2020.20
ec_funded: 1
file:
- access_level: open_access
checksum: 38cbfa4f5d484d267a35d44d210df044
content_type: application/pdf
creator: dernst
date_created: 2020-06-17T10:13:34Z
date_updated: 2020-07-14T12:48:06Z
file_id: '7969'
file_name: 2020_LIPIcsSoCG_Boissonnat.pdf
file_size: 1009739
relation: main_file
file_date_updated: 2020-07-14T12:48:06Z
has_accepted_license: '1'
intvolume: ' 164'
language:
- iso: eng
month: '06'
oa: 1
oa_version: Published Version
project:
- _id: 260C2330-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '754411'
name: ISTplus - Postdoctoral Fellowships
publication: 36th International Symposium on Computational Geometry
publication_identifier:
isbn:
- 978-3-95977-143-6
issn:
- 1868-8969
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
quality_controlled: '1'
related_material:
record:
- id: '9649'
relation: later_version
status: public
scopus_import: '1'
status: public
title: The topological correctness of PL-approximations of isomanifolds
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: 164
year: '2020'
...
---
_id: '7955'
abstract:
- lang: eng
text: Simple stochastic games are turn-based 2½-player games with a reachability
objective. The basic question asks whether one player can ensure reaching a given
target with at least a given probability. A natural extension is games with a
conjunction of such conditions as objective. Despite a plethora of recent results
on the analysis of systems with multiple objectives, the decidability of this
basic problem remains open. In this paper, we present an algorithm approximating
the Pareto frontier of the achievable values to a given precision. Moreover, it
is an anytime algorithm, meaning it can be stopped at any time returning the current
approximation and its error bound.
acknowledgement: "Pranav Ashok, Jan Křetínský and Maximilian Weininger were funded
in part by TUM IGSSE Grant 10.06 (PARSEC) and the German Research Foundation (DFG)
project KR 4890/2-1\r\n“Statistical Unbounded Verification”. Krishnendu Chatterjee
was supported by the ERC CoG 863818 (ForM-SMArt) and Vienna Science and Technology
Fund (WWTF) Project ICT15-\r\n003. Tobias Winkler was supported by the RTG 2236
UnRAVe."
article_processing_charge: No
arxiv: 1
author:
- first_name: Pranav
full_name: Ashok, Pranav
last_name: Ashok
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Jan
full_name: Kretinsky, Jan
last_name: Kretinsky
- first_name: Maximilian
full_name: Weininger, Maximilian
last_name: Weininger
- first_name: Tobias
full_name: Winkler, Tobias
last_name: Winkler
citation:
ama: 'Ashok P, Chatterjee K, Kretinsky J, Weininger M, Winkler T. Approximating
values of generalized-reachability stochastic games. In: Proceedings of the
35th Annual ACM/IEEE Symposium on Logic in Computer Science . Association
for Computing Machinery; 2020:102-115. doi:10.1145/3373718.3394761'
apa: 'Ashok, P., Chatterjee, K., Kretinsky, J., Weininger, M., & Winkler, T.
(2020). Approximating values of generalized-reachability stochastic games. In
Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science
(pp. 102–115). Saarbrücken, Germany: Association for Computing Machinery.
https://doi.org/10.1145/3373718.3394761'
chicago: Ashok, Pranav, Krishnendu Chatterjee, Jan Kretinsky, Maximilian Weininger,
and Tobias Winkler. “Approximating Values of Generalized-Reachability Stochastic
Games.” In Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer
Science , 102–15. Association for Computing Machinery, 2020. https://doi.org/10.1145/3373718.3394761.
ieee: P. Ashok, K. Chatterjee, J. Kretinsky, M. Weininger, and T. Winkler, “Approximating
values of generalized-reachability stochastic games,” in Proceedings of the
35th Annual ACM/IEEE Symposium on Logic in Computer Science , Saarbrücken,
Germany, 2020, pp. 102–115.
ista: 'Ashok P, Chatterjee K, Kretinsky J, Weininger M, Winkler T. 2020. Approximating
values of generalized-reachability stochastic games. Proceedings of the 35th Annual
ACM/IEEE Symposium on Logic in Computer Science . LICS: Symposium on Logic in
Computer Science, 102–115.'
mla: Ashok, Pranav, et al. “Approximating Values of Generalized-Reachability Stochastic
Games.” Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer
Science , Association for Computing Machinery, 2020, pp. 102–15, doi:10.1145/3373718.3394761.
short: P. Ashok, K. Chatterjee, J. Kretinsky, M. Weininger, T. Winkler, in:, Proceedings
of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science , Association
for Computing Machinery, 2020, pp. 102–115.
conference:
end_date: 2020-07-11
location: Saarbrücken, Germany
name: 'LICS: Symposium on Logic in Computer Science'
start_date: 2020-07-08
date_created: 2020-06-14T22:00:48Z
date_published: 2020-07-08T00:00:00Z
date_updated: 2025-06-02T08:53:42Z
day: '08'
ddc:
- '000'
department:
- _id: KrCh
doi: 10.1145/3373718.3394761
ec_funded: 1
external_id:
arxiv:
- '1908.05106'
isi:
- '000665014900010'
file:
- access_level: open_access
checksum: d0d0288fe991dd16cf5f02598b794240
content_type: application/pdf
creator: dernst
date_created: 2020-11-25T09:38:14Z
date_updated: 2020-11-25T09:38:14Z
file_id: '8804'
file_name: 2020_LICS_Ashok.pdf
file_size: 1001395
relation: main_file
success: 1
file_date_updated: 2020-11-25T09:38:14Z
has_accepted_license: '1'
isi: 1
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
page: 102-115
project:
- _id: 0599E47C-7A3F-11EA-A408-12923DDC885E
call_identifier: H2020
grant_number: '863818'
name: 'Formal Methods for Stochastic Models: Algorithms and Applications'
- _id: 25892FC0-B435-11E9-9278-68D0E5697425
grant_number: ICT15-003
name: Efficient Algorithms for Computer Aided Verification
publication: 'Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer
Science '
publication_identifier:
isbn:
- '9781450371049'
publication_status: published
publisher: Association for Computing Machinery
quality_controlled: '1'
scopus_import: '1'
status: public
title: Approximating values of generalized-reachability stochastic games
type: conference
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
year: '2020'
...
---
_id: '7956'
abstract:
- lang: eng
text: When short-range attractions are combined with long-range repulsions in colloidal
particle systems, complex microphases can emerge. Here, we study a system of isotropic
particles, which can form lamellar structures or a disordered fluid phase when
temperature is varied. We show that, at equilibrium, the lamellar structure crystallizes,
while out of equilibrium, the system forms a variety of structures at different
shear rates and temperatures above melting. The shear-induced ordering is analyzed
by means of principal component analysis and artificial neural networks, which
are applied to data of reduced dimensionality. Our results reveal the possibility
of inducing ordering by shear, potentially providing a feasible route to the fabrication
of ordered lamellar structures from isotropic particles.
article_number: '204905'
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: J.
full_name: Pȩkalski, J.
last_name: Pȩkalski
- first_name: Wojciech
full_name: Rzadkowski, Wojciech
id: 48C55298-F248-11E8-B48F-1D18A9856A87
last_name: Rzadkowski
orcid: 0000-0002-1106-4419
- first_name: A. Z.
full_name: Panagiotopoulos, A. Z.
last_name: Panagiotopoulos
citation:
ama: 'Pȩkalski J, Rzadkowski W, Panagiotopoulos AZ. Shear-induced ordering in systems
with competing interactions: A machine learning study. The Journal of chemical
physics. 2020;152(20). doi:10.1063/5.0005194'
apa: 'Pȩkalski, J., Rzadkowski, W., & Panagiotopoulos, A. Z. (2020). Shear-induced
ordering in systems with competing interactions: A machine learning study. The
Journal of Chemical Physics. AIP Publishing. https://doi.org/10.1063/5.0005194'
chicago: 'Pȩkalski, J., Wojciech Rzadkowski, and A. Z. Panagiotopoulos. “Shear-Induced
Ordering in Systems with Competing Interactions: A Machine Learning Study.” The
Journal of Chemical Physics. AIP Publishing, 2020. https://doi.org/10.1063/5.0005194.'
ieee: 'J. Pȩkalski, W. Rzadkowski, and A. Z. Panagiotopoulos, “Shear-induced ordering
in systems with competing interactions: A machine learning study,” The Journal
of chemical physics, vol. 152, no. 20. AIP Publishing, 2020.'
ista: 'Pȩkalski J, Rzadkowski W, Panagiotopoulos AZ. 2020. Shear-induced ordering
in systems with competing interactions: A machine learning study. The Journal
of chemical physics. 152(20), 204905.'
mla: 'Pȩkalski, J., et al. “Shear-Induced Ordering in Systems with Competing Interactions:
A Machine Learning Study.” The Journal of Chemical Physics, vol. 152, no.
20, 204905, AIP Publishing, 2020, doi:10.1063/5.0005194.'
short: J. Pȩkalski, W. Rzadkowski, A.Z. Panagiotopoulos, The Journal of Chemical
Physics 152 (2020).
date_created: 2020-06-14T22:00:49Z
date_published: 2020-05-29T00:00:00Z
date_updated: 2024-02-28T13:00:28Z
day: '29'
department:
- _id: MiLe
doi: 10.1063/5.0005194
ec_funded: 1
external_id:
arxiv:
- '2002.07294'
isi:
- '000537900300001'
intvolume: ' 152'
isi: 1
issue: '20'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1063/5.0005194
month: '05'
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: The Journal of chemical physics
publication_identifier:
eissn:
- '10897690'
publication_status: published
publisher: AIP Publishing
quality_controlled: '1'
related_material:
record:
- id: '10759'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: 'Shear-induced ordering in systems with competing interactions: A machine learning
study'
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 152
year: '2020'
...
---
_id: '7957'
abstract:
- lang: eng
text: "Neurodevelopmental disorders (NDDs) are a class of disorders affecting brain
development and function and are characterized by wide genetic and clinical variability.
In this review, we discuss the multiple factors that influence the clinical presentation
of NDDs, with particular attention to gene vulnerability, mutational load, and
the two-hit model. Despite the complex architecture of\r\nmutational events associated
with NDDs, the various proteins involved appear to converge on common pathways,
such as synaptic plasticity/function, chromatin remodelers and the mammalian target
of rapamycin (mTOR) pathway. A thorough understanding of the mechanisms behind
these pathways will hopefully lead to the identification of candidates that could
be targeted for treatment approaches."
acknowledgement: We wish to thank Jasmin Morandell for generously sharing Figure 2.
This work was supported by the European Research Council Starting Grant (grant 715508
) to G.N.
article_processing_charge: No
article_type: original
author:
- first_name: Ilaria
full_name: Parenti, Ilaria
id: D93538B0-5B71-11E9-AC62-02EBE5697425
last_name: Parenti
- first_name: Luis E
full_name: Garcia Rabaneda, Luis E
id: 33D1B084-F248-11E8-B48F-1D18A9856A87
last_name: Garcia Rabaneda
- first_name: Hanna
full_name: Schön, Hanna
id: C8E17EDC-D7AA-11E9-B7B7-45ECE5697425
last_name: Schön
- first_name: Gaia
full_name: Novarino, Gaia
id: 3E57A680-F248-11E8-B48F-1D18A9856A87
last_name: Novarino
orcid: 0000-0002-7673-7178
citation:
ama: 'Parenti I, Garcia Rabaneda LE, Schön H, Novarino G. Neurodevelopmental disorders:
From genetics to functional pathways. Trends in Neurosciences. 2020;43(8):608-621.
doi:10.1016/j.tins.2020.05.004'
apa: 'Parenti, I., Garcia Rabaneda, L. E., Schön, H., & Novarino, G. (2020).
Neurodevelopmental disorders: From genetics to functional pathways. Trends
in Neurosciences. Elsevier. https://doi.org/10.1016/j.tins.2020.05.004'
chicago: 'Parenti, Ilaria, Luis E Garcia Rabaneda, Hanna Schön, and Gaia Novarino.
“Neurodevelopmental Disorders: From Genetics to Functional Pathways.” Trends
in Neurosciences. Elsevier, 2020. https://doi.org/10.1016/j.tins.2020.05.004.'
ieee: 'I. Parenti, L. E. Garcia Rabaneda, H. Schön, and G. Novarino, “Neurodevelopmental
disorders: From genetics to functional pathways,” Trends in Neurosciences,
vol. 43, no. 8. Elsevier, pp. 608–621, 2020.'
ista: 'Parenti I, Garcia Rabaneda LE, Schön H, Novarino G. 2020. Neurodevelopmental
disorders: From genetics to functional pathways. Trends in Neurosciences. 43(8),
608–621.'
mla: 'Parenti, Ilaria, et al. “Neurodevelopmental Disorders: From Genetics to Functional
Pathways.” Trends in Neurosciences, vol. 43, no. 8, Elsevier, 2020, pp.
608–21, doi:10.1016/j.tins.2020.05.004.'
short: I. Parenti, L.E. Garcia Rabaneda, H. Schön, G. Novarino, Trends in Neurosciences
43 (2020) 608–621.
date_created: 2020-06-14T22:00:49Z
date_published: 2020-08-01T00:00:00Z
date_updated: 2023-08-21T08:25:31Z
day: '01'
ddc:
- '570'
department:
- _id: GaNo
doi: 10.1016/j.tins.2020.05.004
ec_funded: 1
external_id:
isi:
- '000553090600008'
pmid:
- '32507511'
file:
- access_level: open_access
checksum: 67db0251b1d415ae59005f876fcf9e34
content_type: application/pdf
creator: dernst
date_created: 2020-11-25T09:43:40Z
date_updated: 2020-11-25T09:43:40Z
file_id: '8805'
file_name: 2020_TrendsNeuroscience_Parenti.pdf
file_size: 1439550
relation: main_file
success: 1
file_date_updated: 2020-11-25T09:43:40Z
has_accepted_license: '1'
intvolume: ' 43'
isi: 1
issue: '8'
language:
- iso: eng
month: '08'
oa: 1
oa_version: Published Version
page: 608-621
pmid: 1
project:
- _id: 25444568-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '715508'
name: Probing the Reversibility of Autism Spectrum Disorders by Employing in vivo
and in vitro Models
publication: Trends in Neurosciences
publication_identifier:
eissn:
- 1878108X
issn:
- '01662236'
publication_status: published
publisher: Elsevier
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Neurodevelopmental disorders: From genetics to functional pathways'
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 43
year: '2020'
...
---
_id: '7960'
abstract:
- lang: eng
text: Let A={A1,…,An} be a family of sets in the plane. For 0≤i2b be integers. We prove that if each k-wise or (k+1)-wise intersection
of sets from A has at most b path-connected components, which all are open, then
fk+1=0 implies fk≤cfk−1 for some positive constant c depending only on b and k.
These results also extend to two-dimensional compact surfaces.
acknowledgement: "We are very grateful to Pavel Paták for many helpful discussions
and remarks. We also thank the referees for helpful comments, which greatly improved
the presentation.\r\nThe project was supported by ERC Advanced Grant 320924. GK
was also partially supported by NSF grant DMS1300120. The research stay of ZP at
IST Austria is funded by the project CZ.02.2.69/0.0/0.0/17_050/0008466 Improvement
of internationalization in the field of research and development at Charles University,
through the support of quality projects MSCA-IF."
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Gil
full_name: Kalai, Gil
last_name: Kalai
- first_name: Zuzana
full_name: Patakova, Zuzana
id: 48B57058-F248-11E8-B48F-1D18A9856A87
last_name: Patakova
orcid: 0000-0002-3975-1683
citation:
ama: Kalai G, Patakova Z. Intersection patterns of planar sets. Discrete and
Computational Geometry. 2020;64:304-323. doi:10.1007/s00454-020-00205-z
apa: Kalai, G., & Patakova, Z. (2020). Intersection patterns of planar sets.
Discrete and Computational Geometry. Springer Nature. https://doi.org/10.1007/s00454-020-00205-z
chicago: Kalai, Gil, and Zuzana Patakova. “Intersection Patterns of Planar Sets.”
Discrete and Computational Geometry. Springer Nature, 2020. https://doi.org/10.1007/s00454-020-00205-z.
ieee: G. Kalai and Z. Patakova, “Intersection patterns of planar sets,” Discrete
and Computational Geometry, vol. 64. Springer Nature, pp. 304–323, 2020.
ista: Kalai G, Patakova Z. 2020. Intersection patterns of planar sets. Discrete
and Computational Geometry. 64, 304–323.
mla: Kalai, Gil, and Zuzana Patakova. “Intersection Patterns of Planar Sets.” Discrete
and Computational Geometry, vol. 64, Springer Nature, 2020, pp. 304–23, doi:10.1007/s00454-020-00205-z.
short: G. Kalai, Z. Patakova, Discrete and Computational Geometry 64 (2020) 304–323.
date_created: 2020-06-14T22:00:50Z
date_published: 2020-09-01T00:00:00Z
date_updated: 2023-08-21T08:26:34Z
day: '01'
department:
- _id: UlWa
doi: 10.1007/s00454-020-00205-z
external_id:
arxiv:
- '1907.00885'
isi:
- '000537329400001'
intvolume: ' 64'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1907.00885
month: '09'
oa: 1
oa_version: Preprint
page: 304-323
publication: Discrete and Computational Geometry
publication_identifier:
eissn:
- '14320444'
issn:
- '01795376'
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Intersection patterns of planar sets
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 64
year: '2020'
...
---
_id: '7962'
abstract:
- lang: eng
text: 'A string graph is the intersection graph of a family of continuous arcs in
the plane. The intersection graph of a family of plane convex sets is a string
graph, but not all string graphs can be obtained in this way. We prove the following
structure theorem conjectured by Janson and Uzzell: The vertex set of almost all
string graphs on n vertices can be partitioned into five cliques such that some
pair of them is not connected by any edge (n→∞). We also show that every graph
with the above property is an intersection graph of plane convex sets. As a corollary,
we obtain that almost all string graphs on n vertices are intersection graphs
of plane convex sets.'
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: János
full_name: Pach, János
id: E62E3130-B088-11EA-B919-BF823C25FEA4
last_name: Pach
- first_name: Bruce
full_name: Reed, Bruce
last_name: Reed
- first_name: Yelena
full_name: Yuditsky, Yelena
last_name: Yuditsky
citation:
ama: Pach J, Reed B, Yuditsky Y. Almost all string graphs are intersection graphs
of plane convex sets. Discrete and Computational Geometry. 2020;63(4):888-917.
doi:10.1007/s00454-020-00213-z
apa: Pach, J., Reed, B., & Yuditsky, Y. (2020). Almost all string graphs are
intersection graphs of plane convex sets. Discrete and Computational Geometry.
Springer Nature. https://doi.org/10.1007/s00454-020-00213-z
chicago: Pach, János, Bruce Reed, and Yelena Yuditsky. “Almost All String Graphs
Are Intersection Graphs of Plane Convex Sets.” Discrete and Computational Geometry.
Springer Nature, 2020. https://doi.org/10.1007/s00454-020-00213-z.
ieee: J. Pach, B. Reed, and Y. Yuditsky, “Almost all string graphs are intersection
graphs of plane convex sets,” Discrete and Computational Geometry, vol.
63, no. 4. Springer Nature, pp. 888–917, 2020.
ista: Pach J, Reed B, Yuditsky Y. 2020. Almost all string graphs are intersection
graphs of plane convex sets. Discrete and Computational Geometry. 63(4), 888–917.
mla: Pach, János, et al. “Almost All String Graphs Are Intersection Graphs of Plane
Convex Sets.” Discrete and Computational Geometry, vol. 63, no. 4, Springer
Nature, 2020, pp. 888–917, doi:10.1007/s00454-020-00213-z.
short: J. Pach, B. Reed, Y. Yuditsky, Discrete and Computational Geometry 63 (2020)
888–917.
date_created: 2020-06-14T22:00:51Z
date_published: 2020-06-05T00:00:00Z
date_updated: 2023-08-21T08:49:18Z
day: '05'
department:
- _id: HeEd
doi: 10.1007/s00454-020-00213-z
external_id:
arxiv:
- '1803.06710'
isi:
- '000538229000001'
intvolume: ' 63'
isi: 1
issue: '4'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1803.06710
month: '06'
oa: 1
oa_version: Preprint
page: 888-917
project:
- _id: 268116B8-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z00342
name: The Wittgenstein Prize
publication: Discrete and Computational Geometry
publication_identifier:
eissn:
- '14320444'
issn:
- '01795376'
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Almost all string graphs are intersection graphs of plane convex sets
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 63
year: '2020'
...
---
_id: '7966'
abstract:
- lang: eng
text: "For 1≤m≤n, we consider a natural m-out-of-n multi-instance scenario for a
public-key encryption (PKE) scheme. An adversary, given n independent instances
of PKE, wins if he breaks at least m out of the n instances. In this work, we
are interested in the scaling factor of PKE schemes, SF, which measures how well
the difficulty of breaking m out of the n instances scales in m. That is, a scaling
factor SF=ℓ indicates that breaking m out of n instances is at least ℓ times more
difficult than breaking one single instance. A PKE scheme with small scaling factor
hence provides an ideal target for mass surveillance. In fact, the Logjam attack
(CCS 2015) implicitly exploited, among other things, an almost constant scaling
factor of ElGamal over finite fields (with shared group parameters).\r\n\r\nFor
Hashed ElGamal over elliptic curves, we use the generic group model to argue that
the scaling factor depends on the scheme's granularity. In low granularity, meaning
each public key contains its independent group parameter, the scheme has optimal
scaling factor SF=m; In medium and high granularity, meaning all public keys share
the same group parameter, the scheme still has a reasonable scaling factor SF=√m.
Our findings underline that instantiating ElGamal over elliptic curves should
be preferred to finite fields in a multi-instance scenario.\r\n\r\nAs our main
technical contribution, we derive new generic-group lower bounds of Ω(√(mp)) on
the difficulty of solving both the m-out-of-n Gap Discrete Logarithm and the m-out-of-n
Gap Computational Diffie-Hellman problem over groups of prime order p, extending
a recent result by Yun (EUROCRYPT 2015). We establish the lower bound by studying
the hardness of a related computational problem which we call the search-by-hypersurface
problem."
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Benedikt
full_name: Auerbach, Benedikt
id: D33D2B18-E445-11E9-ABB7-15F4E5697425
last_name: Auerbach
orcid: 0000-0002-7553-6606
- first_name: Federico
full_name: Giacon, Federico
last_name: Giacon
- first_name: Eike
full_name: Kiltz, Eike
last_name: Kiltz
citation:
ama: 'Auerbach B, Giacon F, Kiltz E. Everybody’s a target: Scalability in public-key
encryption. In: Advances in Cryptology – EUROCRYPT 2020. Vol 12107. Springer
Nature; 2020:475-506. doi:10.1007/978-3-030-45727-3_16'
apa: 'Auerbach, B., Giacon, F., & Kiltz, E. (2020). Everybody’s a target: Scalability
in public-key encryption. In Advances in Cryptology – EUROCRYPT 2020 (Vol.
12107, pp. 475–506). Springer Nature. https://doi.org/10.1007/978-3-030-45727-3_16'
chicago: 'Auerbach, Benedikt, Federico Giacon, and Eike Kiltz. “Everybody’s a Target:
Scalability in Public-Key Encryption.” In Advances in Cryptology – EUROCRYPT
2020, 12107:475–506. Springer Nature, 2020. https://doi.org/10.1007/978-3-030-45727-3_16.'
ieee: 'B. Auerbach, F. Giacon, and E. Kiltz, “Everybody’s a target: Scalability
in public-key encryption,” in Advances in Cryptology – EUROCRYPT 2020,
2020, vol. 12107, pp. 475–506.'
ista: 'Auerbach B, Giacon F, Kiltz E. 2020. Everybody’s a target: Scalability in
public-key encryption. Advances in Cryptology – EUROCRYPT 2020. EUROCRYPT: Theory
and Applications of Cryptographic Techniques, LNCS, vol. 12107, 475–506.'
mla: 'Auerbach, Benedikt, et al. “Everybody’s a Target: Scalability in Public-Key
Encryption.” Advances in Cryptology – EUROCRYPT 2020, vol. 12107, Springer
Nature, 2020, pp. 475–506, doi:10.1007/978-3-030-45727-3_16.'
short: B. Auerbach, F. Giacon, E. Kiltz, in:, Advances in Cryptology – EUROCRYPT
2020, Springer Nature, 2020, pp. 475–506.
conference:
end_date: 2020-05-15
name: 'EUROCRYPT: Theory and Applications of Cryptographic Techniques'
start_date: 2020-05-11
date_created: 2020-06-15T07:13:37Z
date_published: 2020-05-01T00:00:00Z
date_updated: 2023-09-05T15:06:40Z
day: '01'
department:
- _id: KrPi
doi: 10.1007/978-3-030-45727-3_16
ec_funded: 1
external_id:
isi:
- '000828688000016'
intvolume: ' 12107'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://eprint.iacr.org/2019/364
month: '05'
oa: 1
oa_version: Submitted Version
page: 475-506
project:
- _id: 258AA5B2-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '682815'
name: Teaching Old Crypto New Tricks
publication: Advances in Cryptology – EUROCRYPT 2020
publication_identifier:
eissn:
- 1611-3349
isbn:
- '9783030457266'
- '9783030457273'
issn:
- 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
status: public
title: 'Everybody’s a target: Scalability in public-key encryption'
type: conference
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 12107
year: '2020'
...
---
_id: '7968'
abstract:
- lang: eng
text: Organic materials are known to feature long spin-diffusion times, originating
in a generally small spin–orbit coupling observed in these systems. From that
perspective, chiral molecules acting as efficient spin selectors pose a puzzle
that attracted a lot of attention in recent years. Here, we revisit the physical
origins of chiral-induced spin selectivity (CISS) and propose a simple analytic
minimal model to describe it. The model treats a chiral molecule as an anisotropic
wire with molecular dipole moments aligned arbitrarily with respect to the wire’s
axes and is therefore quite general. Importantly, it shows that the helical structure
of the molecule is not necessary to observe CISS and other chiral nonhelical molecules
can also be considered as potential candidates for the CISS effect. We also show
that the suggested simple model captures the main characteristics of CISS observed
in the experiment, without the need for additional constraints employed in the
previous studies. The results pave the way for understanding other related physical
phenomena where the CISS effect plays an essential role.
article_processing_charge: Yes (via OA deal)
article_type: original
author:
- first_name: Areg
full_name: Ghazaryan, Areg
id: 4AF46FD6-F248-11E8-B48F-1D18A9856A87
last_name: Ghazaryan
orcid: 0000-0001-9666-3543
- first_name: Yossi
full_name: Paltiel, Yossi
last_name: Paltiel
- first_name: Mikhail
full_name: Lemeshko, Mikhail
id: 37CB05FA-F248-11E8-B48F-1D18A9856A87
last_name: Lemeshko
orcid: 0000-0002-6990-7802
citation:
ama: Ghazaryan A, Paltiel Y, Lemeshko M. Analytic model of chiral-induced spin selectivity.
The Journal of Physical Chemistry C. 2020;124(21):11716-11721. doi:10.1021/acs.jpcc.0c02584
apa: Ghazaryan, A., Paltiel, Y., & Lemeshko, M. (2020). Analytic model of chiral-induced
spin selectivity. The Journal of Physical Chemistry C. American Chemical
Society. https://doi.org/10.1021/acs.jpcc.0c02584
chicago: Ghazaryan, Areg, Yossi Paltiel, and Mikhail Lemeshko. “Analytic Model of
Chiral-Induced Spin Selectivity.” The Journal of Physical Chemistry C.
American Chemical Society, 2020. https://doi.org/10.1021/acs.jpcc.0c02584.
ieee: A. Ghazaryan, Y. Paltiel, and M. Lemeshko, “Analytic model of chiral-induced
spin selectivity,” The Journal of Physical Chemistry C, vol. 124, no. 21.
American Chemical Society, pp. 11716–11721, 2020.
ista: Ghazaryan A, Paltiel Y, Lemeshko M. 2020. Analytic model of chiral-induced
spin selectivity. The Journal of Physical Chemistry C. 124(21), 11716–11721.
mla: Ghazaryan, Areg, et al. “Analytic Model of Chiral-Induced Spin Selectivity.”
The Journal of Physical Chemistry C, vol. 124, no. 21, American Chemical
Society, 2020, pp. 11716–21, doi:10.1021/acs.jpcc.0c02584.
short: A. Ghazaryan, Y. Paltiel, M. Lemeshko, The Journal of Physical Chemistry
C 124 (2020) 11716–11721.
date_created: 2020-06-16T14:29:59Z
date_published: 2020-05-04T00:00:00Z
date_updated: 2023-09-05T12:07:15Z
day: '04'
ddc:
- '530'
department:
- _id: MiLe
doi: 10.1021/acs.jpcc.0c02584
ec_funded: 1
external_id:
isi:
- '000614616200006'
file:
- access_level: open_access
checksum: 25932bb1d0b0a955be0bea4d17facd49
content_type: application/pdf
creator: kschuh
date_created: 2020-10-20T14:39:47Z
date_updated: 2020-10-20T14:39:47Z
file_id: '8683'
file_name: 2020_PhysChemC_Ghazaryan.pdf
file_size: 1543429
relation: main_file
success: 1
file_date_updated: 2020-10-20T14:39:47Z
has_accepted_license: '1'
intvolume: ' 124'
isi: 1
issue: '21'
language:
- iso: eng
month: '05'
oa: 1
oa_version: Published Version
page: 11716-11721
project:
- _id: 260C2330-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '754411'
name: ISTplus - Postdoctoral Fellowships
- _id: 26031614-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P29902
name: Quantum rotations in the presence of a many-body environment
- _id: 2688CF98-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '801770'
name: 'Angulon: physics and applications of a new quasiparticle'
publication: The Journal of Physical Chemistry C
publication_identifier:
eissn:
- 1932-7455
issn:
- 1932-7447
publication_status: published
publisher: American Chemical Society
quality_controlled: '1'
scopus_import: '1'
status: public
title: Analytic model of chiral-induced spin selectivity
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: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 124
year: '2020'
...
---
_id: '7971'
abstract:
- lang: eng
text: Multilayer graphene lattices allow for an additional tunability of the band
structure by the strong perpendicular electric field. In particular, the emergence
of the new multiple Dirac points in ABA stacked trilayer graphene subject to strong
transverse electric fields was proposed theoretically and confirmed experimentally.
These new Dirac points dubbed “gullies” emerge from the interplay between strong
electric field and trigonal warping. In this work, we first characterize the properties
of new emergent Dirac points and show that the electric field can be used to tune
the distance between gullies in the momentum space. We demonstrate that the band
structure has multiple Lifshitz transitions and higher-order singularity of “monkey
saddle” type. Following the characterization of the band structure, we consider
the spectrum of Landau levels and structure of their wave functions. In the limit
of strong electric fields when gullies are well separated in momentum space, they
give rise to triply degenerate Landau levels. In the second part of this work,
we investigate how degeneracy between three gully Landau levels is lifted in the
presence of interactions. Within the Hartree-Fock approximation we show that the
symmetry breaking state interpolates between the fully gully polarized state that
breaks C3 symmetry at high displacement field and the gully symmetric state when
the electric field is decreased. The discontinuous transition between these two
states is driven by enhanced intergully tunneling and exchange. We conclude by
outlining specific experimental predictions for the existence of such a symmetry-breaking
state.
article_number: '245411'
article_processing_charge: No
article_type: original
author:
- first_name: Peng
full_name: Rao, Peng
id: 47C23AC6-02D0-11E9-BD0E-99399A5D3DEB
last_name: Rao
orcid: 0000-0003-1250-0021
- first_name: Maksym
full_name: Serbyn, Maksym
id: 47809E7E-F248-11E8-B48F-1D18A9856A87
last_name: Serbyn
orcid: 0000-0002-2399-5827
citation:
ama: Rao P, Serbyn M. Gully quantum Hall ferromagnetism in biased trilayer graphene.
Physical Review B. 2020;101(24). doi:10.1103/physrevb.101.245411
apa: Rao, P., & Serbyn, M. (2020). Gully quantum Hall ferromagnetism in biased
trilayer graphene. Physical Review B. American Physical Society. https://doi.org/10.1103/physrevb.101.245411
chicago: Rao, Peng, and Maksym Serbyn. “Gully Quantum Hall Ferromagnetism in Biased
Trilayer Graphene.” Physical Review B. American Physical Society, 2020.
https://doi.org/10.1103/physrevb.101.245411.
ieee: P. Rao and M. Serbyn, “Gully quantum Hall ferromagnetism in biased trilayer
graphene,” Physical Review B, vol. 101, no. 24. American Physical Society,
2020.
ista: Rao P, Serbyn M. 2020. Gully quantum Hall ferromagnetism in biased trilayer
graphene. Physical Review B. 101(24), 245411.
mla: Rao, Peng, and Maksym Serbyn. “Gully Quantum Hall Ferromagnetism in Biased
Trilayer Graphene.” Physical Review B, vol. 101, no. 24, 245411, American
Physical Society, 2020, doi:10.1103/physrevb.101.245411.
short: P. Rao, M. Serbyn, Physical Review B 101 (2020).
date_created: 2020-06-17T14:52:06Z
date_published: 2020-06-15T00:00:00Z
date_updated: 2023-09-05T12:11:37Z
day: '15'
department:
- _id: MaSe
doi: 10.1103/physrevb.101.245411
external_id:
isi:
- '000538715500010'
intvolume: ' 101'
isi: 1
issue: '24'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/2002.05739
month: '06'
oa: 1
oa_version: Preprint
publication: Physical Review B
publication_identifier:
eissn:
- 2469-9969
issn:
- 2469-9950
publication_status: published
publisher: American Physical Society
quality_controlled: '1'
scopus_import: '1'
status: public
title: Gully quantum Hall ferromagnetism in biased trilayer graphene
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 101
year: '2020'
...
---
_id: '7985'
abstract:
- lang: eng
text: The goal of limiting global warming to 1.5 °C requires a drastic reduction
in CO2 emissions across many sectors of the world economy. Batteries are vital
to this endeavor, whether used in electric vehicles, to store renewable electricity,
or in aviation. Present lithium-ion technologies are preparing the public for
this inevitable change, but their maximum theoretical specific capacity presents
a limitation. Their high cost is another concern for commercial viability. Metal–air
batteries have the highest theoretical energy density of all possible secondary
battery technologies and could yield step changes in energy storage, if their
practical difficulties could be overcome. The scope of this review is to provide
an objective, comprehensive, and authoritative assessment of the intensive work
invested in nonaqueous rechargeable metal–air batteries over the past few years,
which identified the key problems and guides directions to solve them. We focus
primarily on the challenges and outlook for Li–O2 cells but include Na–O2, K–O2,
and Mg–O2 cells for comparison. Our review highlights the interdisciplinary nature
of this field that involves a combination of materials chemistry, electrochemistry,
computation, microscopy, spectroscopy, and surface science. The mechanisms of
O2 reduction and evolution are considered in the light of recent findings, along
with developments in positive and negative electrodes, electrolytes, electrocatalysis
on surfaces and in solution, and the degradative effect of singlet oxygen, which
is typically formed in Li–O2 cells.
acknowledgement: "S.A.F. is indebted to the European Research Council (ERC) under
the European Union’s\r\nHorizon 2020 research and innovation programme (grant agreement
No 636069)."
article_processing_charge: No
article_type: review
author:
- first_name: WJ
full_name: Kwak, WJ
last_name: Kwak
- first_name: D
full_name: Sharon, D
last_name: Sharon
- first_name: C
full_name: Xia, C
last_name: Xia
- first_name: H
full_name: Kim, H
last_name: Kim
- first_name: LR
full_name: Johnson, LR
last_name: Johnson
- first_name: PG
full_name: Bruce, PG
last_name: Bruce
- first_name: LF
full_name: Nazar, LF
last_name: Nazar
- first_name: YK
full_name: Sun, YK
last_name: Sun
- first_name: AA
full_name: Frimer, AA
last_name: Frimer
- first_name: M
full_name: Noked, M
last_name: Noked
- first_name: Stefan Alexander
full_name: Freunberger, Stefan Alexander
id: A8CA28E6-CE23-11E9-AD2D-EC27E6697425
last_name: Freunberger
orcid: 0000-0003-2902-5319
- first_name: D
full_name: Aurbach, D
last_name: Aurbach
citation:
ama: 'Kwak W, Sharon D, Xia C, et al. Lithium-oxygen batteries and related systems:
Potential, status, and future. Chemical Reviews. 2020;120(14):6626-6683.
doi:10.1021/acs.chemrev.9b00609'
apa: 'Kwak, W., Sharon, D., Xia, C., Kim, H., Johnson, L., Bruce, P., … Aurbach,
D. (2020). Lithium-oxygen batteries and related systems: Potential, status, and
future. Chemical Reviews. American Chemical Society. https://doi.org/10.1021/acs.chemrev.9b00609'
chicago: 'Kwak, WJ, D Sharon, C Xia, H Kim, LR Johnson, PG Bruce, LF Nazar, et al.
“Lithium-Oxygen Batteries and Related Systems: Potential, Status, and Future.”
Chemical Reviews. American Chemical Society, 2020. https://doi.org/10.1021/acs.chemrev.9b00609.'
ieee: 'W. Kwak et al., “Lithium-oxygen batteries and related systems: Potential,
status, and future,” Chemical Reviews, vol. 120, no. 14. American Chemical
Society, pp. 6626–6683, 2020.'
ista: 'Kwak W, Sharon D, Xia C, Kim H, Johnson L, Bruce P, Nazar L, Sun Y, Frimer
A, Noked M, Freunberger SA, Aurbach D. 2020. Lithium-oxygen batteries and related
systems: Potential, status, and future. Chemical Reviews. 120(14), 6626–6683.'
mla: 'Kwak, WJ, et al. “Lithium-Oxygen Batteries and Related Systems: Potential,
Status, and Future.” Chemical Reviews, vol. 120, no. 14, American Chemical
Society, 2020, pp. 6626–83, doi:10.1021/acs.chemrev.9b00609.'
short: W. Kwak, D. Sharon, C. Xia, H. Kim, L. Johnson, P. Bruce, L. Nazar, Y. Sun,
A. Frimer, M. Noked, S.A. Freunberger, D. Aurbach, Chemical Reviews 120 (2020)
6626–6683.
date_created: 2020-06-19T08:42:47Z
date_published: 2020-03-05T00:00:00Z
date_updated: 2023-09-05T12:04:28Z
day: '05'
ddc:
- '540'
department:
- _id: StFr
doi: 10.1021/acs.chemrev.9b00609
external_id:
isi:
- '000555413600008'
pmid:
- '32134255'
file:
- access_level: open_access
checksum: 1a683353d46c5841c8bb2ee0a56ac7be
content_type: application/pdf
creator: sfreunbe
date_created: 2020-06-29T16:36:01Z
date_updated: 2020-07-14T12:48:06Z
file_id: '8060'
file_name: ChemRev_final.pdf
file_size: 8525678
relation: main_file
file_date_updated: 2020-07-14T12:48:06Z
has_accepted_license: '1'
intvolume: ' 120'
isi: 1
issue: '14'
language:
- iso: eng
month: '03'
oa: 1
oa_version: Submitted Version
page: 6626-6683
pmid: 1
publication: Chemical Reviews
publication_identifier:
eissn:
- 1520-6890
issn:
- 0009-2665
publication_status: published
publisher: American Chemical Society
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Lithium-oxygen batteries and related systems: Potential, status, and future'
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 120
year: '2020'
...
---
_id: '7989'
abstract:
- lang: eng
text: 'We prove general topological Radon-type theorems for sets in ℝ^d, smooth
real manifolds or finite dimensional simplicial complexes. Combined with a recent
result of Holmsen and Lee, it gives fractional Helly theorem, and consequently
the existence of weak ε-nets as well as a (p,q)-theorem. More precisely: Let X
be either ℝ^d, smooth real d-manifold, or a finite d-dimensional simplicial complex.
Then if F is a finite, intersection-closed family of sets in X such that the ith
reduced Betti number (with ℤ₂ coefficients) of any set in F is at most b for every
non-negative integer i less or equal to k, then the Radon number of F is bounded
in terms of b and X. Here k is the smallest integer larger or equal to d/2 - 1
if X = ℝ^d; k=d-1 if X is a smooth real d-manifold and not a surface, k=0 if X
is a surface and k=d if X is a d-dimensional simplicial complex. Using the recent
result of the author and Kalai, we manage to prove the following optimal bound
on fractional Helly number for families of open sets in a surface: Let F be a
finite family of open sets in a surface S such that the intersection of any subfamily
of F is either empty, or path-connected. Then the fractional Helly number of F
is at most three. This also settles a conjecture of Holmsen, Kim, and Lee about
an existence of a (p,q)-theorem for open subsets of a surface.'
alternative_title:
- LIPIcs
article_number: 61:1-61:13
article_processing_charge: No
arxiv: 1
author:
- first_name: Zuzana
full_name: Patakova, Zuzana
id: 48B57058-F248-11E8-B48F-1D18A9856A87
last_name: Patakova
orcid: 0000-0002-3975-1683
citation:
ama: 'Patakova Z. Bounding radon number via Betti numbers. In: 36th International
Symposium on Computational Geometry. Vol 164. Schloss Dagstuhl - Leibniz-Zentrum
für Informatik; 2020. doi:10.4230/LIPIcs.SoCG.2020.61'
apa: 'Patakova, Z. (2020). Bounding radon number via Betti numbers. In 36th International
Symposium on Computational Geometry (Vol. 164). Zürich, Switzerland: Schloss
Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.SoCG.2020.61'
chicago: Patakova, Zuzana. “Bounding Radon Number via Betti Numbers.” In 36th
International Symposium on Computational Geometry, Vol. 164. Schloss Dagstuhl
- Leibniz-Zentrum für Informatik, 2020. https://doi.org/10.4230/LIPIcs.SoCG.2020.61.
ieee: Z. Patakova, “Bounding radon number via Betti numbers,” in 36th International
Symposium on Computational Geometry, Zürich, Switzerland, 2020, vol. 164.
ista: 'Patakova Z. 2020. Bounding radon number via Betti numbers. 36th International
Symposium on Computational Geometry. SoCG: Symposium on Computational Geometry,
LIPIcs, vol. 164, 61:1-61:13.'
mla: Patakova, Zuzana. “Bounding Radon Number via Betti Numbers.” 36th International
Symposium on Computational Geometry, vol. 164, 61:1-61:13, Schloss Dagstuhl
- Leibniz-Zentrum für Informatik, 2020, doi:10.4230/LIPIcs.SoCG.2020.61.
short: Z. Patakova, in:, 36th International Symposium on Computational Geometry,
Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020.
conference:
end_date: 2020-06-26
location: Zürich, Switzerland
name: 'SoCG: Symposium on Computational Geometry'
start_date: 2020-06-22
date_created: 2020-06-22T09:14:18Z
date_published: 2020-06-01T00:00:00Z
date_updated: 2021-01-12T08:16:22Z
day: '01'
ddc:
- '510'
department:
- _id: UlWa
doi: 10.4230/LIPIcs.SoCG.2020.61
external_id:
arxiv:
- '1908.01677'
file:
- access_level: open_access
checksum: d0996ca5f6eb32ce955ce782b4f2afbe
content_type: application/pdf
creator: dernst
date_created: 2020-06-23T06:56:23Z
date_updated: 2020-07-14T12:48:06Z
file_id: '8005'
file_name: 2020_LIPIcsSoCG_Patakova_61.pdf
file_size: 645421
relation: main_file
file_date_updated: 2020-07-14T12:48:06Z
has_accepted_license: '1'
intvolume: ' 164'
language:
- iso: eng
month: '06'
oa: 1
oa_version: Published Version
publication: 36th International Symposium on Computational Geometry
publication_identifier:
isbn:
- '9783959771436'
issn:
- '18688969'
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
quality_controlled: '1'
scopus_import: '1'
status: public
title: Bounding radon number via Betti numbers
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 164
year: '2020'
...
---
_id: '7990'
abstract:
- lang: eng
text: 'Given a finite point set P in general position in the plane, a full triangulation
is a maximal straight-line embedded plane graph on P. A partial triangulation
on P is a full triangulation of some subset P'' of P containing all extreme points
in P. A bistellar flip on a partial triangulation either flips an edge, removes
a non-extreme point of degree 3, or adds a point in P ⧵ P'' as vertex of degree
3. The bistellar flip graph has all partial triangulations as vertices, and a
pair of partial triangulations is adjacent if they can be obtained from one another
by a bistellar flip. The goal of this paper is to investigate the structure of
this graph, with emphasis on its connectivity. For sets P of n points in general
position, we show that the bistellar flip graph is (n-3)-connected, thereby answering,
for sets in general position, an open questions raised in a book (by De Loera,
Rambau, and Santos) and a survey (by Lee and Santos) on triangulations. This matches
the situation for the subfamily of regular triangulations (i.e., partial triangulations
obtained by lifting the points and projecting the lower convex hull), where (n-3)-connectivity
has been known since the late 1980s through the secondary polytope (Gelfand, Kapranov,
Zelevinsky) and Balinski’s Theorem. Our methods also yield the following results
(see the full version [Wagner and Welzl, 2020]): (i) The bistellar flip graph
can be covered by graphs of polytopes of dimension n-3 (products of secondary
polytopes). (ii) A partial triangulation is regular, if it has distance n-3 in
the Hasse diagram of the partial order of partial subdivisions from the trivial
subdivision. (iii) All partial triangulations are regular iff the trivial subdivision
has height n-3 in the partial order of partial subdivisions. (iv) There are arbitrarily
large sets P with non-regular partial triangulations, while every proper subset
has only regular triangulations, i.e., there are no small certificates for the
existence of non-regular partial triangulations (answering a question by F. Santos
in the unexpected direction).'
alternative_title:
- LIPIcs
article_number: 67:1 - 67:16
article_processing_charge: No
arxiv: 1
author:
- first_name: Uli
full_name: Wagner, Uli
id: 36690CA2-F248-11E8-B48F-1D18A9856A87
last_name: Wagner
orcid: 0000-0002-1494-0568
- first_name: Emo
full_name: Welzl, Emo
last_name: Welzl
citation:
ama: 'Wagner U, Welzl E. Connectivity of triangulation flip graphs in the plane
(Part II: Bistellar flips). In: 36th International Symposium on Computational
Geometry. Vol 164. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2020.
doi:10.4230/LIPIcs.SoCG.2020.67'
apa: 'Wagner, U., & Welzl, E. (2020). Connectivity of triangulation flip graphs
in the plane (Part II: Bistellar flips). In 36th International Symposium on
Computational Geometry (Vol. 164). Zürich, Switzerland: Schloss Dagstuhl -
Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.SoCG.2020.67'
chicago: 'Wagner, Uli, and Emo Welzl. “Connectivity of Triangulation Flip Graphs
in the Plane (Part II: Bistellar Flips).” In 36th International Symposium on
Computational Geometry, Vol. 164. Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
2020. https://doi.org/10.4230/LIPIcs.SoCG.2020.67.'
ieee: 'U. Wagner and E. Welzl, “Connectivity of triangulation flip graphs in the
plane (Part II: Bistellar flips),” in 36th International Symposium on Computational
Geometry, Zürich, Switzerland, 2020, vol. 164.'
ista: 'Wagner U, Welzl E. 2020. Connectivity of triangulation flip graphs in the
plane (Part II: Bistellar flips). 36th International Symposium on Computational
Geometry. SoCG: Symposium on Computational Geometry, LIPIcs, vol. 164, 67:1-67:16.'
mla: 'Wagner, Uli, and Emo Welzl. “Connectivity of Triangulation Flip Graphs in
the Plane (Part II: Bistellar Flips).” 36th International Symposium on Computational
Geometry, vol. 164, 67:1-67:16, Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
2020, doi:10.4230/LIPIcs.SoCG.2020.67.'
short: U. Wagner, E. Welzl, in:, 36th International Symposium on Computational Geometry,
Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020.
conference:
end_date: 2020-06-26
location: Zürich, Switzerland
name: 'SoCG: Symposium on Computational Geometry'
start_date: 2020-06-22
date_created: 2020-06-22T09:14:19Z
date_published: 2020-06-01T00:00:00Z
date_updated: 2023-08-04T08:51:07Z
day: '01'
ddc:
- '510'
department:
- _id: UlWa
doi: 10.4230/LIPIcs.SoCG.2020.67
external_id:
arxiv:
- '2003.13557'
file:
- access_level: open_access
checksum: 3f6925be5f3dcdb3b14cab92f410edf7
content_type: application/pdf
creator: dernst
date_created: 2020-06-23T06:37:27Z
date_updated: 2020-07-14T12:48:06Z
file_id: '8003'
file_name: 2020_LIPIcsSoCG_Wagner.pdf
file_size: 793187
relation: main_file
file_date_updated: 2020-07-14T12:48:06Z
has_accepted_license: '1'
intvolume: ' 164'
language:
- iso: eng
month: '06'
oa: 1
oa_version: Published Version
publication: 36th International Symposium on Computational Geometry
publication_identifier:
isbn:
- '9783959771436'
issn:
- '18688969'
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
quality_controlled: '1'
related_material:
record:
- id: '12129'
relation: later_version
status: public
scopus_import: 1
status: public
title: 'Connectivity of triangulation flip graphs in the plane (Part II: Bistellar
flips)'
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: 164
year: '2020'
...
---
_id: '7991'
abstract:
- lang: eng
text: 'We define and study a discrete process that generalizes the convex-layer
decomposition of a planar point set. Our process, which we call homotopic curve
shortening (HCS), starts with a closed curve (which might self-intersect) in the
presence of a set P⊂ ℝ² of point obstacles, and evolves in discrete steps, where
each step consists of (1) taking shortcuts around the obstacles, and (2) reducing
the curve to its shortest homotopic equivalent. We find experimentally that, if
the initial curve is held fixed and P is chosen to be either a very fine regular
grid or a uniformly random point set, then HCS behaves at the limit like the affine
curve-shortening flow (ACSF). This connection between HCS and ACSF generalizes
the link between "grid peeling" and the ACSF observed by Eppstein et al. (2017),
which applied only to convex curves, and which was studied only for regular grids.
We prove that HCS satisfies some properties analogous to those of ACSF: HCS is
invariant under affine transformations, preserves convexity, and does not increase
the total absolute curvature. Furthermore, the number of self-intersections of
a curve, or intersections between two curves (appropriately defined), does not
increase. Finally, if the initial curve is simple, then the number of inflection
points (appropriately defined) does not increase.'
alternative_title:
- LIPIcs
article_number: 12:1 - 12:15
article_processing_charge: No
arxiv: 1
author:
- first_name: Sergey
full_name: Avvakumov, Sergey
id: 3827DAC8-F248-11E8-B48F-1D18A9856A87
last_name: Avvakumov
- first_name: Gabriel
full_name: Nivasch, Gabriel
last_name: Nivasch
citation:
ama: 'Avvakumov S, Nivasch G. Homotopic curve shortening and the affine curve-shortening
flow. In: 36th International Symposium on Computational Geometry. Vol 164.
Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2020. doi:10.4230/LIPIcs.SoCG.2020.12'
apa: 'Avvakumov, S., & Nivasch, G. (2020). Homotopic curve shortening and the
affine curve-shortening flow. In 36th International Symposium on Computational
Geometry (Vol. 164). Zürich, Switzerland: Schloss Dagstuhl - Leibniz-Zentrum
für Informatik. https://doi.org/10.4230/LIPIcs.SoCG.2020.12'
chicago: Avvakumov, Sergey, and Gabriel Nivasch. “Homotopic Curve Shortening and
the Affine Curve-Shortening Flow.” In 36th International Symposium on Computational
Geometry, Vol. 164. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020.
https://doi.org/10.4230/LIPIcs.SoCG.2020.12.
ieee: S. Avvakumov and G. Nivasch, “Homotopic curve shortening and the affine curve-shortening
flow,” in 36th International Symposium on Computational Geometry, Zürich,
Switzerland, 2020, vol. 164.
ista: 'Avvakumov S, Nivasch G. 2020. Homotopic curve shortening and the affine curve-shortening
flow. 36th International Symposium on Computational Geometry. SoCG: Symposium
on Computational Geometry, LIPIcs, vol. 164, 12:1-12:15.'
mla: Avvakumov, Sergey, and Gabriel Nivasch. “Homotopic Curve Shortening and the
Affine Curve-Shortening Flow.” 36th International Symposium on Computational
Geometry, vol. 164, 12:1-12:15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
2020, doi:10.4230/LIPIcs.SoCG.2020.12.
short: S. Avvakumov, G. Nivasch, in:, 36th International Symposium on Computational
Geometry, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020.
conference:
end_date: 2020-06-26
location: Zürich, Switzerland
name: 'SoCG: Symposium on Computational Geometry'
start_date: 2020-06-22
date_created: 2020-06-22T09:14:19Z
date_published: 2020-06-01T00:00:00Z
date_updated: 2021-01-12T08:16:23Z
day: '01'
ddc:
- '510'
department:
- _id: UlWa
doi: 10.4230/LIPIcs.SoCG.2020.12
external_id:
arxiv:
- '1909.00263'
file:
- access_level: open_access
checksum: 6872df6549142f709fb6354a1b2f2c06
content_type: application/pdf
creator: dernst
date_created: 2020-06-23T11:13:49Z
date_updated: 2020-07-14T12:48:06Z
file_id: '8007'
file_name: 2020_LIPIcsSoCG_Avvakumov.pdf
file_size: 575896
relation: main_file
file_date_updated: 2020-07-14T12:48:06Z
has_accepted_license: '1'
intvolume: ' 164'
language:
- iso: eng
license: https://creativecommons.org/licenses/by/3.0/
month: '06'
oa: 1
oa_version: Published Version
project:
- _id: 26611F5C-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P31312
name: Algorithms for Embeddings and Homotopy Theory
publication: 36th International Symposium on Computational Geometry
publication_identifier:
isbn:
- '9783959771436'
issn:
- '18688969'
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
quality_controlled: '1'
scopus_import: '1'
status: public
title: Homotopic curve shortening and the affine curve-shortening flow
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: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 164
year: '2020'
...
---
_id: '7992'
abstract:
- lang: eng
text: 'Let K be a convex body in ℝⁿ (i.e., a compact convex set with nonempty interior).
Given a point p in the interior of K, a hyperplane h passing through p is called
barycentric if p is the barycenter of K ∩ h. In 1961, Grünbaum raised the question
whether, for every K, there exists an interior point p through which there are
at least n+1 distinct barycentric hyperplanes. Two years later, this was seemingly
resolved affirmatively by showing that this is the case if p=p₀ is the point of
maximal depth in K. However, while working on a related question, we noticed that
one of the auxiliary claims in the proof is incorrect. Here, we provide a counterexample;
this re-opens Grünbaum’s question. It follows from known results that for n ≥
2, there are always at least three distinct barycentric cuts through the point
p₀ ∈ K of maximal depth. Using tools related to Morse theory we are able to improve
this bound: four distinct barycentric cuts through p₀ are guaranteed if n ≥ 3.'
alternative_title:
- LIPIcs
article_number: 62:1 - 62:16
article_processing_charge: No
arxiv: 1
author:
- first_name: Zuzana
full_name: Patakova, Zuzana
id: 48B57058-F248-11E8-B48F-1D18A9856A87
last_name: Patakova
orcid: 0000-0002-3975-1683
- first_name: Martin
full_name: Tancer, Martin
id: 38AC689C-F248-11E8-B48F-1D18A9856A87
last_name: Tancer
orcid: 0000-0002-1191-6714
- first_name: Uli
full_name: Wagner, Uli
id: 36690CA2-F248-11E8-B48F-1D18A9856A87
last_name: Wagner
orcid: 0000-0002-1494-0568
citation:
ama: 'Patakova Z, Tancer M, Wagner U. Barycentric cuts through a convex body. In:
36th International Symposium on Computational Geometry. Vol 164. Schloss
Dagstuhl - Leibniz-Zentrum für Informatik; 2020. doi:10.4230/LIPIcs.SoCG.2020.62'
apa: 'Patakova, Z., Tancer, M., & Wagner, U. (2020). Barycentric cuts through
a convex body. In 36th International Symposium on Computational Geometry
(Vol. 164). Zürich, Switzerland: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
https://doi.org/10.4230/LIPIcs.SoCG.2020.62'
chicago: Patakova, Zuzana, Martin Tancer, and Uli Wagner. “Barycentric Cuts through
a Convex Body.” In 36th International Symposium on Computational Geometry,
Vol. 164. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. https://doi.org/10.4230/LIPIcs.SoCG.2020.62.
ieee: Z. Patakova, M. Tancer, and U. Wagner, “Barycentric cuts through a convex
body,” in 36th International Symposium on Computational Geometry, Zürich,
Switzerland, 2020, vol. 164.
ista: 'Patakova Z, Tancer M, Wagner U. 2020. Barycentric cuts through a convex body.
36th International Symposium on Computational Geometry. SoCG: Symposium on Computational
Geometry, LIPIcs, vol. 164, 62:1-62:16.'
mla: Patakova, Zuzana, et al. “Barycentric Cuts through a Convex Body.” 36th
International Symposium on Computational Geometry, vol. 164, 62:1-62:16, Schloss
Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:10.4230/LIPIcs.SoCG.2020.62.
short: Z. Patakova, M. Tancer, U. Wagner, in:, 36th International Symposium on Computational
Geometry, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020.
conference:
end_date: 2020-06-26
location: Zürich, Switzerland
name: 'SoCG: Symposium on Computational Geometry'
start_date: 2020-06-22
date_created: 2020-06-22T09:14:20Z
date_published: 2020-06-01T00:00:00Z
date_updated: 2021-01-12T08:16:23Z
day: '01'
ddc:
- '510'
department:
- _id: UlWa
doi: 10.4230/LIPIcs.SoCG.2020.62
external_id:
arxiv:
- '2003.13536'
file:
- access_level: open_access
checksum: ce1c9194139a664fb59d1efdfc88eaae
content_type: application/pdf
creator: dernst
date_created: 2020-06-23T06:45:52Z
date_updated: 2020-07-14T12:48:06Z
file_id: '8004'
file_name: 2020_LIPIcsSoCG_Patakova.pdf
file_size: 750318
relation: main_file
file_date_updated: 2020-07-14T12:48:06Z
has_accepted_license: '1'
intvolume: ' 164'
language:
- iso: eng
month: '06'
oa: 1
oa_version: Published Version
publication: 36th International Symposium on Computational Geometry
publication_identifier:
isbn:
- '9783959771436'
issn:
- '18688969'
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
quality_controlled: '1'
scopus_import: 1
status: public
title: Barycentric cuts through a convex body
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: 164
year: '2020'
...
---
_id: '7994'
abstract:
- lang: eng
text: In the recent study of crossing numbers, drawings of graphs that can be extended
to an arrangement of pseudolines (pseudolinear drawings) have played an important
role as they are a natural combinatorial extension of rectilinear (or straight-line)
drawings. A characterization of the pseudolinear drawings of K_n was found recently.
We extend this characterization to all graphs, by describing the set of minimal
forbidden subdrawings for pseudolinear drawings. Our characterization also leads
to a polynomial-time algorithm to recognize pseudolinear drawings and construct
the pseudolines when it is possible.
alternative_title:
- LIPIcs
article_number: 9:1 - 9:14
article_processing_charge: No
arxiv: 1
author:
- first_name: Alan M
full_name: Arroyo Guevara, Alan M
id: 3207FDC6-F248-11E8-B48F-1D18A9856A87
last_name: Arroyo Guevara
orcid: 0000-0003-2401-8670
- first_name: Julien
full_name: Bensmail, Julien
last_name: Bensmail
- first_name: R.
full_name: Bruce Richter, R.
last_name: Bruce Richter
citation:
ama: 'Arroyo Guevara AM, Bensmail J, Bruce Richter R. Extending drawings of graphs
to arrangements of pseudolines. In: 36th International Symposium on Computational
Geometry. Vol 164. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2020.
doi:10.4230/LIPIcs.SoCG.2020.9'
apa: 'Arroyo Guevara, A. M., Bensmail, J., & Bruce Richter, R. (2020). Extending
drawings of graphs to arrangements of pseudolines. In 36th International Symposium
on Computational Geometry (Vol. 164). Zürich, Switzerland: Schloss Dagstuhl
- Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.SoCG.2020.9'
chicago: Arroyo Guevara, Alan M, Julien Bensmail, and R. Bruce Richter. “Extending
Drawings of Graphs to Arrangements of Pseudolines.” In 36th International Symposium
on Computational Geometry, Vol. 164. Schloss Dagstuhl - Leibniz-Zentrum für
Informatik, 2020. https://doi.org/10.4230/LIPIcs.SoCG.2020.9.
ieee: A. M. Arroyo Guevara, J. Bensmail, and R. Bruce Richter, “Extending drawings
of graphs to arrangements of pseudolines,” in 36th International Symposium
on Computational Geometry, Zürich, Switzerland, 2020, vol. 164.
ista: 'Arroyo Guevara AM, Bensmail J, Bruce Richter R. 2020. Extending drawings
of graphs to arrangements of pseudolines. 36th International Symposium on Computational
Geometry. SoCG: Symposium on Computational Geometry, LIPIcs, vol. 164, 9:1-9:14.'
mla: Arroyo Guevara, Alan M., et al. “Extending Drawings of Graphs to Arrangements
of Pseudolines.” 36th International Symposium on Computational Geometry,
vol. 164, 9:1-9:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:10.4230/LIPIcs.SoCG.2020.9.
short: A.M. Arroyo Guevara, J. Bensmail, R. Bruce Richter, in:, 36th International
Symposium on Computational Geometry, Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
2020.
conference:
end_date: 2020-06-26
location: Zürich, Switzerland
name: 'SoCG: Symposium on Computational Geometry'
start_date: 2020-06-22
date_created: 2020-06-22T09:14:21Z
date_published: 2020-06-01T00:00:00Z
date_updated: 2023-02-23T13:22:12Z
day: '01'
ddc:
- '510'
department:
- _id: UlWa
doi: 10.4230/LIPIcs.SoCG.2020.9
ec_funded: 1
external_id:
arxiv:
- '1804.09317'
file:
- access_level: open_access
checksum: 93571b76cf97d5b7c8aabaeaa694dd7e
content_type: application/pdf
creator: dernst
date_created: 2020-06-23T11:06:23Z
date_updated: 2020-07-14T12:48:06Z
file_id: '8006'
file_name: 2020_LIPIcsSoCG_Arroyo.pdf
file_size: 592661
relation: main_file
file_date_updated: 2020-07-14T12:48:06Z
has_accepted_license: '1'
intvolume: ' 164'
language:
- iso: eng
month: '06'
oa: 1
oa_version: Published Version
project:
- _id: 260C2330-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '754411'
name: ISTplus - Postdoctoral Fellowships
publication: 36th International Symposium on Computational Geometry
publication_identifier:
isbn:
- '9783959771436'
issn:
- '18688969'
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
quality_controlled: '1'
scopus_import: '1'
status: public
title: Extending drawings of graphs to arrangements of pseudolines
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: 164
year: '2020'
...
---
_id: '7995'
abstract:
- lang: eng
text: When divergent populations are connected by gene flow, the establishment of
complete reproductive isolation usually requires the joint action of multiple
barrier effects. One example where multiple barrier effects are coupled consists
of a single trait that is under divergent natural selection and also mediates
assortative mating. Such multiple‐effect traits can strongly reduce gene flow.
However, there are few cases where patterns of assortative mating have been described
quantitatively and their impact on gene flow has been determined. Two ecotypes
of the coastal marine snail, Littorina saxatilis , occur in North Atlantic rocky‐shore
habitats dominated by either crab predation or wave action. There is evidence
for divergent natural selection acting on size, and size‐assortative mating has
previously been documented. Here, we analyze the mating pattern in L. saxatilis
with respect to size in intensively sampled transects across boundaries between
the habitats. We show that the mating pattern is mostly conserved between ecotypes
and that it generates both assortment and directional sexual selection for small
male size. Using simulations, we show that the mating pattern can contribute to
reproductive isolation between ecotypes but the barrier to gene flow is likely
strengthened more by sexual selection than by assortment.
acknowledgement: We are very grateful to I. Sencic, L. Brettell, A.‐L. Liabot, J.
Galindo, M. Ravinet, and A. Butlin for their help with field sampling and mating
experiments. This work was funded by the Natural Environment Research Council, European
Research Council and Swedish Research Council VR and we are also very grateful for
the support of the Linnaeus Centre for Marine Evolutionary Biology at the University
of Gothenburg. The simulations were performed on resources at Chalmers Centre for
Computational Science and Engineering (C3SE) provided by the Swedish National Infrastructure
for Computing (SNIC). AMW was funded by the European Union's Horizon 2020 research
and innovation program under Marie Skłodowska‐Curie grant agreement no. 797747.
article_processing_charge: No
article_type: original
author:
- first_name: Samuel
full_name: Perini, Samuel
last_name: Perini
- first_name: Marina
full_name: Rafajlović, Marina
last_name: Rafajlović
- first_name: Anja M
full_name: Westram, Anja M
id: 3C147470-F248-11E8-B48F-1D18A9856A87
last_name: Westram
orcid: 0000-0003-1050-4969
- first_name: Kerstin
full_name: Johannesson, Kerstin
last_name: Johannesson
- first_name: Roger K.
full_name: Butlin, Roger K.
last_name: Butlin
citation:
ama: Perini S, Rafajlović M, Westram AM, Johannesson K, Butlin RK. Assortative mating,
sexual selection, and their consequences for gene flow in Littorina. Evolution.
2020;74(7):1482-1497. doi:10.1111/evo.14027
apa: Perini, S., Rafajlović, M., Westram, A. M., Johannesson, K., & Butlin,
R. K. (2020). Assortative mating, sexual selection, and their consequences for
gene flow in Littorina. Evolution. Wiley. https://doi.org/10.1111/evo.14027
chicago: Perini, Samuel, Marina Rafajlović, Anja M Westram, Kerstin Johannesson,
and Roger K. Butlin. “Assortative Mating, Sexual Selection, and Their Consequences
for Gene Flow in Littorina.” Evolution. Wiley, 2020. https://doi.org/10.1111/evo.14027.
ieee: S. Perini, M. Rafajlović, A. M. Westram, K. Johannesson, and R. K. Butlin,
“Assortative mating, sexual selection, and their consequences for gene flow in
Littorina,” Evolution, vol. 74, no. 7. Wiley, pp. 1482–1497, 2020.
ista: Perini S, Rafajlović M, Westram AM, Johannesson K, Butlin RK. 2020. Assortative
mating, sexual selection, and their consequences for gene flow in Littorina. Evolution.
74(7), 1482–1497.
mla: Perini, Samuel, et al. “Assortative Mating, Sexual Selection, and Their Consequences
for Gene Flow in Littorina.” Evolution, vol. 74, no. 7, Wiley, 2020, pp.
1482–97, doi:10.1111/evo.14027.
short: S. Perini, M. Rafajlović, A.M. Westram, K. Johannesson, R.K. Butlin, Evolution
74 (2020) 1482–1497.
date_created: 2020-06-22T09:14:21Z
date_published: 2020-07-01T00:00:00Z
date_updated: 2023-08-22T07:13:38Z
day: '01'
ddc:
- '570'
department:
- _id: NiBa
doi: 10.1111/evo.14027
ec_funded: 1
external_id:
isi:
- '000539780800001'
file:
- access_level: open_access
checksum: 56235bf1e2a9e25f96196bb13b6b754d
content_type: application/pdf
creator: dernst
date_created: 2020-11-25T10:49:48Z
date_updated: 2020-11-25T10:49:48Z
file_id: '8808'
file_name: 2020_Evolution_Perini.pdf
file_size: 1080810
relation: main_file
success: 1
file_date_updated: 2020-11-25T10:49:48Z
has_accepted_license: '1'
intvolume: ' 74'
isi: 1
issue: '7'
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
page: 1482-1497
project:
- _id: 265B41B8-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '797747'
name: Theoretical and empirical approaches to understanding Parallel Adaptation
publication: Evolution
publication_identifier:
eissn:
- '15585646'
issn:
- '00143820'
publication_status: published
publisher: Wiley
quality_controlled: '1'
related_material:
record:
- id: '8809'
relation: research_data
status: public
scopus_import: '1'
status: public
title: Assortative mating, sexual selection, and their consequences for gene flow
in Littorina
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 74
year: '2020'
...
---
_id: '7996'
abstract:
- lang: eng
text: "Quantum computation enables the execution of algorithms that have exponential
complexity. This might open the path towards the synthesis of new materials or
medical drugs, optimization of transport or financial strategies etc., intractable
on even the fastest classical computers. A quantum computer consists of interconnected
two level quantum systems, called qubits, that satisfy DiVincezo’s criteria. Worldwide,
there are ongoing efforts to find the qubit architecture which will unite quantum
error correction compatible single and two qubit fidelities, long distance qubit
to qubit coupling and \r\n calability. Superconducting qubits have gone the furthest
in this race, demonstrating an algorithm running on 53 coupled qubits, but still
the fidelities are not even close to those required for realizing a single logical
qubit. emiconductor qubits offer extremely good characteristics, but they are
currently investigated across different platforms. Uniting those good characteristics
into a single platform might be a big step towards the quantum computer realization.\r\nHere
we describe the implementation of a hole spin qubit hosted in a Ge hut wire double
quantum dot. The high and tunable spin-orbit coupling together with a heavy hole
state character is expected to allow fast spin manipulation and long coherence
times. Furthermore large lever arms, for hut wire devices, should allow good coupling
to superconducting resonators enabling efficient long distance spin to spin coupling
and a sensitive gate reflectometry spin readout. The developed cryogenic setup
(printed circuit board sample holders, filtering, high-frequency wiring) enabled
us to perform low temperature spin dynamics experiments. Indeed, we measured the
fastest single spin qubit Rabi frequencies reported so far, reaching 140 MHz,
while the dephasing times of 130 ns oppose the long decoherence predictions. In
order to further investigate this, a double quantum dot gate was connected directly
to a lumped element\r\nresonator which enabled gate reflectometry readout. The
vanishing inter-dot transition signal, for increasing external magnetic field,
revealed the spin nature of the measured quantity."
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Josip
full_name: Kukucka, Josip
id: 3F5D8856-F248-11E8-B48F-1D18A9856A87
last_name: Kukucka
citation:
ama: Kukucka J. Implementation of a hole spin qubit in Ge hut wires and dispersive
spin sensing. 2020. doi:10.15479/AT:ISTA:7996
apa: Kukucka, J. (2020). Implementation of a hole spin qubit in Ge hut wires
and dispersive spin sensing. Institute of Science and Technology Austria.
https://doi.org/10.15479/AT:ISTA:7996
chicago: Kukucka, Josip. “Implementation of a Hole Spin Qubit in Ge Hut Wires and
Dispersive Spin Sensing.” Institute of Science and Technology Austria, 2020. https://doi.org/10.15479/AT:ISTA:7996.
ieee: J. Kukucka, “Implementation of a hole spin qubit in Ge hut wires and dispersive
spin sensing,” Institute of Science and Technology Austria, 2020.
ista: Kukucka J. 2020. Implementation of a hole spin qubit in Ge hut wires and dispersive
spin sensing. Institute of Science and Technology Austria.
mla: Kukucka, Josip. Implementation of a Hole Spin Qubit in Ge Hut Wires and
Dispersive Spin Sensing. Institute of Science and Technology Austria, 2020,
doi:10.15479/AT:ISTA:7996.
short: J. Kukucka, Implementation of a Hole Spin Qubit in Ge Hut Wires and Dispersive
Spin Sensing, Institute of Science and Technology Austria, 2020.
date_created: 2020-06-22T09:22:23Z
date_published: 2020-06-22T00:00:00Z
date_updated: 2023-09-26T15:50:22Z
day: '22'
ddc:
- '530'
degree_awarded: PhD
department:
- _id: GeKa
doi: 10.15479/AT:ISTA:7996
file:
- access_level: closed
checksum: 467e52feb3e361ce8cf5fe8d5c254ece
content_type: application/x-zip-compressed
creator: dernst
date_created: 2020-06-22T09:22:04Z
date_updated: 2020-07-14T12:48:07Z
file_id: '7997'
file_name: JK_thesis_latex_source_files.zip
file_size: 392794743
relation: main_file
- access_level: open_access
checksum: 1de716bf110dbd77d383e479232bf496
content_type: application/pdf
creator: dernst
date_created: 2020-06-22T09:21:29Z
date_updated: 2020-07-14T12:48:07Z
file_id: '7998'
file_name: PhD_thesis_JK_pdfa.pdf
file_size: 28453247
relation: main_file
file_date_updated: 2020-07-14T12:48:07Z
has_accepted_license: '1'
language:
- iso: eng
month: '06'
oa: 1
oa_version: Published Version
page: '178'
publication_identifier:
issn:
- 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
related_material:
record:
- id: '1328'
relation: part_of_dissertation
status: public
- id: '7541'
relation: part_of_dissertation
status: public
- id: '77'
relation: part_of_dissertation
status: public
- id: '23'
relation: part_of_dissertation
status: public
- id: '840'
relation: part_of_dissertation
status: public
status: public
supervisor:
- first_name: Georgios
full_name: Katsaros, Georgios
id: 38DB5788-F248-11E8-B48F-1D18A9856A87
last_name: Katsaros
orcid: 0000-0001-8342-202X
title: Implementation of a hole spin qubit in Ge hut wires and dispersive spin sensing
type: dissertation
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
year: '2020'
...
---
_id: '7999'
abstract:
- lang: eng
text: 'Linking epigenetic marks to clinical outcomes improves insight into molecular
processes, disease prediction, and therapeutic target identification. Here, a
statistical approach is presented to infer the epigenetic architecture of complex
disease, determine the variation captured by epigenetic effects, and estimate
phenotype-epigenetic probe associations jointly. Implicitly adjusting for probe
correlations, data structure (cell-count or relatedness), and single-nucleotide
polymorphism (SNP) marker effects, improves association estimates and in 9,448
individuals, 75.7% (95% CI 71.70–79.3) of body mass index (BMI) variation and
45.6% (95% CI 37.3–51.9) of cigarette consumption variation was captured by whole
blood methylation array data. Pathway-linked probes of blood cholesterol, lipid
transport and sterol metabolism for BMI, and xenobiotic stimuli response for smoking,
showed >1.5 times larger associations with >95% posterior inclusion probability.
Prediction accuracy improved by 28.7% for BMI and 10.2% for smoking over a LASSO
model, with age-, and tissue-specificity, implying associations are a phenotypic
consequence rather than causal. '
article_number: '2865'
article_processing_charge: No
article_type: original
author:
- first_name: D
full_name: Trejo Banos, D
last_name: Trejo Banos
- first_name: DL
full_name: McCartney, DL
last_name: McCartney
- first_name: M
full_name: Patxot, M
last_name: Patxot
- first_name: L
full_name: Anchieri, L
last_name: Anchieri
- first_name: T
full_name: Battram, T
last_name: Battram
- first_name: C
full_name: Christiansen, C
last_name: Christiansen
- first_name: R
full_name: Costeira, R
last_name: Costeira
- first_name: RM
full_name: Walker, RM
last_name: Walker
- first_name: SW
full_name: Morris, SW
last_name: Morris
- first_name: A
full_name: Campbell, A
last_name: Campbell
- first_name: Q
full_name: Zhang, Q
last_name: Zhang
- first_name: DJ
full_name: Porteous, DJ
last_name: Porteous
- first_name: AF
full_name: McRae, AF
last_name: McRae
- first_name: NR
full_name: Wray, NR
last_name: Wray
- first_name: PM
full_name: Visscher, PM
last_name: Visscher
- first_name: CS
full_name: Haley, CS
last_name: Haley
- first_name: KL
full_name: Evans, KL
last_name: Evans
- first_name: IJ
full_name: Deary, IJ
last_name: Deary
- first_name: AM
full_name: McIntosh, AM
last_name: McIntosh
- first_name: G
full_name: Hemani, G
last_name: Hemani
- first_name: JT
full_name: Bell, JT
last_name: Bell
- first_name: RE
full_name: Marioni, RE
last_name: Marioni
- first_name: Matthew Richard
full_name: Robinson, Matthew Richard
id: E5D42276-F5DA-11E9-8E24-6303E6697425
last_name: Robinson
orcid: 0000-0001-8982-8813
citation:
ama: Trejo Banos D, McCartney D, Patxot M, et al. Bayesian reassessment of the epigenetic
architecture of complex traits. Nature Communications. 2020;11. doi:10.1038/s41467-020-16520-1
apa: Trejo Banos, D., McCartney, D., Patxot, M., Anchieri, L., Battram, T., Christiansen,
C., … Robinson, M. R. (2020). Bayesian reassessment of the epigenetic architecture
of complex traits. Nature Communications. Springer Nature. https://doi.org/10.1038/s41467-020-16520-1
chicago: Trejo Banos, D, DL McCartney, M Patxot, L Anchieri, T Battram, C Christiansen,
R Costeira, et al. “Bayesian Reassessment of the Epigenetic Architecture of Complex
Traits.” Nature Communications. Springer Nature, 2020. https://doi.org/10.1038/s41467-020-16520-1.
ieee: D. Trejo Banos et al., “Bayesian reassessment of the epigenetic architecture
of complex traits,” Nature Communications, vol. 11. Springer Nature, 2020.
ista: Trejo Banos D, McCartney D, Patxot M, Anchieri L, Battram T, Christiansen
C, Costeira R, Walker R, Morris S, Campbell A, Zhang Q, Porteous D, McRae A, Wray
N, Visscher P, Haley C, Evans K, Deary I, McIntosh A, Hemani G, Bell J, Marioni
R, Robinson MR. 2020. Bayesian reassessment of the epigenetic architecture of
complex traits. Nature Communications. 11, 2865.
mla: Trejo Banos, D., et al. “Bayesian Reassessment of the Epigenetic Architecture
of Complex Traits.” Nature Communications, vol. 11, 2865, Springer Nature,
2020, doi:10.1038/s41467-020-16520-1.
short: D. Trejo Banos, D. McCartney, M. Patxot, L. Anchieri, T. Battram, C. Christiansen,
R. Costeira, R. Walker, S. Morris, A. Campbell, Q. Zhang, D. Porteous, A. McRae,
N. Wray, P. Visscher, C. Haley, K. Evans, I. Deary, A. McIntosh, G. Hemani, J.
Bell, R. Marioni, M.R. Robinson, Nature Communications 11 (2020).
date_created: 2020-06-22T11:18:25Z
date_published: 2020-06-08T00:00:00Z
date_updated: 2023-08-22T07:13:09Z
day: '08'
ddc:
- '570'
department:
- _id: MaRo
doi: 10.1038/s41467-020-16520-1
external_id:
isi:
- '000541702400004'
pmid:
- '32513961'
file:
- access_level: open_access
checksum: 4c96babd4cfb0d153334f6c598c0bacb
content_type: application/pdf
creator: dernst
date_created: 2020-06-22T11:24:32Z
date_updated: 2020-07-14T12:48:07Z
file_id: '8000'
file_name: 2020_NatureComm_Bayesian.pdf
file_size: 1475657
relation: main_file
file_date_updated: 2020-07-14T12:48:07Z
has_accepted_license: '1'
intvolume: ' 11'
isi: 1
language:
- iso: eng
month: '06'
oa: 1
oa_version: Published Version
pmid: 1
publication: Nature Communications
publication_identifier:
issn:
- 2041-1723
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
related_material:
link:
- relation: erratum
url: https://doi.org/10.1038/s41467-020-19099-9
scopus_import: '1'
status: public
title: Bayesian reassessment of the epigenetic architecture of complex traits
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 11
year: '2020'
...