---
_id: '9569'
abstract:
- lang: eng
text: We report the synthesis and characterization of graphene functionalized with
iron (Fe3+) oxide (G-Fe3O4) nanohybrids for radio-frequency magnetic hyperthermia
application. We adopted the wet chemical procedure, using various contents of
Fe3O4 (magnetite) from 0–100% for making two-dimensional graphene–Fe3O4 nanohybrids.
The homogeneous dispersal of Fe3O4 nanoparticles decorated on the graphene surface
combined with their biocompatibility and high thermal conductivity make them an
excellent material for magnetic hyperthermia. The morphological and magnetic properties
of the nanohybrids were studied using scanning electron microscopy (SEM) and a
vibrating sample magnetometer (VSM), respectively. The smart magnetic platforms
were exposed to an alternating current (AC) magnetic field of 633 kHz and of strength
9.1 mT for studying their hyperthermic performance. The localized antitumor effects
were investigated with artificial neural network modeling. A neural net time-series
model was developed for the assessment of the best nanohybrid composition to serve
the purpose with an accuracy close to 100%. Six Nonlinear Autoregressive with
External Input (NARX) models were obtained, one for each of the components. The
assessment of the accuracy of the predicted results has been done on the basis
of Mean Squared Error (MSE). The highest Mean Squared Error value was obtained
for the nanohybrid containing 45% magnetite and 55% graphene (F45G55) in the training
phase i.e., 0.44703, which is where the model achieved optimal results after 71
epochs. The F45G55 nanohybrid was found to be the best for hyperthermia applications
in low dosage with the highest specific absorption rate (SAR) and mean squared
error values.
acknowledgement: The research is funded by Higher Education Commission (HEC) Pakistan
under start-up research grant program (SRGP) Project no. 2454.
article_processing_charge: No
article_type: original
author:
- first_name: M. S.
full_name: Dar, M. S.
last_name: Dar
- first_name: Khush Bakhat
full_name: Akram, Khush Bakhat
last_name: Akram
- first_name: Ayesha
full_name: Sohail, Ayesha
last_name: Sohail
- first_name: Fatima
full_name: Arif, Fatima
last_name: Arif
- first_name: Fatemeh
full_name: Zabihi, Fatemeh
last_name: Zabihi
- first_name: Shengyuan
full_name: Yang, Shengyuan
last_name: Yang
- first_name: Shamsa
full_name: Munir, Shamsa
last_name: Munir
- first_name: Meifang
full_name: Zhu, Meifang
last_name: Zhu
- first_name: M.
full_name: Abid, M.
last_name: Abid
- first_name: Muhammad
full_name: Nauman, Muhammad
id: 32c21954-2022-11eb-9d5f-af9f93c24e71
last_name: Nauman
orcid: 0000-0002-2111-4846
citation:
ama: Dar MS, Akram KB, Sohail A, et al. Heat induction in two-dimensional graphene–Fe3O4
nanohybrids for magnetic hyperthermia applications with artificial neural network
modeling. RSC Advances. 2021;11(35):21702-21715. doi:10.1039/d1ra03428f
apa: Dar, M. S., Akram, K. B., Sohail, A., Arif, F., Zabihi, F., Yang, S., … Nauman,
M. (2021). Heat induction in two-dimensional graphene–Fe3O4 nanohybrids for magnetic
hyperthermia applications with artificial neural network modeling. RSC Advances.
Royal Society of Chemistry. https://doi.org/10.1039/d1ra03428f
chicago: Dar, M. S., Khush Bakhat Akram, Ayesha Sohail, Fatima Arif, Fatemeh Zabihi,
Shengyuan Yang, Shamsa Munir, Meifang Zhu, M. Abid, and Muhammad Nauman. “Heat
Induction in Two-Dimensional Graphene–Fe3O4 Nanohybrids for Magnetic Hyperthermia
Applications with Artificial Neural Network Modeling.” RSC Advances. Royal
Society of Chemistry, 2021. https://doi.org/10.1039/d1ra03428f.
ieee: M. S. Dar et al., “Heat induction in two-dimensional graphene–Fe3O4
nanohybrids for magnetic hyperthermia applications with artificial neural network
modeling,” RSC Advances, vol. 11, no. 35. Royal Society of Chemistry, pp.
21702–21715, 2021.
ista: Dar MS, Akram KB, Sohail A, Arif F, Zabihi F, Yang S, Munir S, Zhu M, Abid
M, Nauman M. 2021. Heat induction in two-dimensional graphene–Fe3O4 nanohybrids
for magnetic hyperthermia applications with artificial neural network modeling.
RSC Advances. 11(35), 21702–21715.
mla: Dar, M. S., et al. “Heat Induction in Two-Dimensional Graphene–Fe3O4 Nanohybrids
for Magnetic Hyperthermia Applications with Artificial Neural Network Modeling.”
RSC Advances, vol. 11, no. 35, Royal Society of Chemistry, 2021, pp. 21702–15,
doi:10.1039/d1ra03428f.
short: M.S. Dar, K.B. Akram, A. Sohail, F. Arif, F. Zabihi, S. Yang, S. Munir, M.
Zhu, M. Abid, M. Nauman, RSC Advances 11 (2021) 21702–21715.
date_created: 2021-06-19T07:27:45Z
date_published: 2021-06-18T00:00:00Z
date_updated: 2024-10-21T06:02:02Z
day: '18'
ddc:
- '540'
department:
- _id: KiMo
doi: 10.1039/d1ra03428f
external_id:
isi:
- '000665644000048'
file:
- access_level: open_access
checksum: cd582d67ace7151078e46b3a896871a9
content_type: application/pdf
creator: asandaue
date_created: 2021-06-23T13:09:34Z
date_updated: 2021-06-23T13:09:34Z
file_id: '9596'
file_name: 2021_RSCAdvances_Dar.pdf
file_size: 2114557
relation: main_file
success: 1
file_date_updated: 2021-06-23T13:09:34Z
has_accepted_license: '1'
intvolume: ' 11'
isi: 1
issue: '35'
language:
- iso: eng
license: https://creativecommons.org/licenses/by/3.0/
month: '06'
oa: 1
oa_version: Published Version
page: 21702-21715
publication: RSC Advances
publication_identifier:
eissn:
- 2046-2069
publication_status: published
publisher: Royal Society of Chemistry
quality_controlled: '1'
scopus_import: '1'
status: public
title: Heat induction in two-dimensional graphene–Fe3O4 nanohybrids for magnetic hyperthermia
applications with artificial neural network modeling
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/3.0/legalcode
name: Creative Commons Attribution 3.0 Unported (CC BY 3.0)
short: CC BY (3.0)
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 11
year: '2021'
...
---
_id: '9570'
abstract:
- lang: eng
text: We present conductance-matrix measurements in long, three-terminal hybrid
superconductor-semiconductor nanowires, and compare with theoretical predictions
of a magnetic-field-driven, topological quantum phase transition. By examining
the nonlocal conductance, we identify the closure of the excitation gap in the
bulk of the semiconductor before the emergence of zero-bias peaks, ruling out
spurious gap-closure signatures from localized states. We observe that after the
gap closes, nonlocal signals and zero-bias peaks fluctuate strongly at both ends,
inconsistent with a simple picture of clean topological superconductivity.
acknowledgement: We acknowledge insightful discussions with K. Flensberg, E. B. Hansen,
T. Karzig, R. Lutchyn, D. Pikulin, E. Prada, and R. Aguado. This work was supported
by Microsoft Project Q and the Danmarks Grundforskningsfond. C.M.M. acknowledges
support from the Villum Fonden. A.P.H. and L.C. contributed equally to this work.
article_number: '235201'
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Denise
full_name: Puglia, Denise
id: 4D495994-AE37-11E9-AC72-31CAE5697425
last_name: Puglia
orcid: 0000-0003-1144-2763
- first_name: E. A.
full_name: Martinez, E. A.
last_name: Martinez
- first_name: G. C.
full_name: Ménard, G. C.
last_name: Ménard
- first_name: A.
full_name: Pöschl, A.
last_name: Pöschl
- first_name: S.
full_name: Gronin, S.
last_name: Gronin
- first_name: G. C.
full_name: Gardner, G. C.
last_name: Gardner
- first_name: R.
full_name: Kallaher, R.
last_name: Kallaher
- first_name: M. J.
full_name: Manfra, M. J.
last_name: Manfra
- first_name: C. M.
full_name: Marcus, C. M.
last_name: Marcus
- first_name: Andrew P
full_name: Higginbotham, Andrew P
id: 4AD6785A-F248-11E8-B48F-1D18A9856A87
last_name: Higginbotham
orcid: 0000-0003-2607-2363
- first_name: L.
full_name: Casparis, L.
last_name: Casparis
citation:
ama: Puglia D, Martinez EA, Ménard GC, et al. Closing of the induced gap in a hybrid
superconductor-semiconductor nanowire. Physical Review B. 2021;103(23).
doi:10.1103/PhysRevB.103.235201
apa: Puglia, D., Martinez, E. A., Ménard, G. C., Pöschl, A., Gronin, S., Gardner,
G. C., … Casparis, L. (2021). Closing of the induced gap in a hybrid superconductor-semiconductor
nanowire. Physical Review B. American Physical Society. https://doi.org/10.1103/PhysRevB.103.235201
chicago: Puglia, Denise, E. A. Martinez, G. C. Ménard, A. Pöschl, S. Gronin, G.
C. Gardner, R. Kallaher, et al. “Closing of the Induced Gap in a Hybrid Superconductor-Semiconductor
Nanowire.” Physical Review B. American Physical Society, 2021. https://doi.org/10.1103/PhysRevB.103.235201.
ieee: D. Puglia et al., “Closing of the induced gap in a hybrid superconductor-semiconductor
nanowire,” Physical Review B, vol. 103, no. 23. American Physical Society,
2021.
ista: Puglia D, Martinez EA, Ménard GC, Pöschl A, Gronin S, Gardner GC, Kallaher
R, Manfra MJ, Marcus CM, Higginbotham AP, Casparis L. 2021. Closing of the induced
gap in a hybrid superconductor-semiconductor nanowire. Physical Review B. 103(23),
235201.
mla: Puglia, Denise, et al. “Closing of the Induced Gap in a Hybrid Superconductor-Semiconductor
Nanowire.” Physical Review B, vol. 103, no. 23, 235201, American Physical
Society, 2021, doi:10.1103/PhysRevB.103.235201.
short: D. Puglia, E.A. Martinez, G.C. Ménard, A. Pöschl, S. Gronin, G.C. Gardner,
R. Kallaher, M.J. Manfra, C.M. Marcus, A.P. Higginbotham, L. Casparis, Physical
Review B 103 (2021).
date_created: 2021-06-20T22:01:33Z
date_published: 2021-06-15T00:00:00Z
date_updated: 2025-07-10T12:01:53Z
day: '15'
department:
- _id: AnHi
doi: 10.1103/PhysRevB.103.235201
external_id:
arxiv:
- '2006.01275'
isi:
- '000661512500002'
intvolume: ' 103'
isi: 1
issue: '23'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/2006.01275
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'
related_material:
record:
- id: '13080'
relation: research_data
status: public
scopus_import: '1'
status: public
title: Closing of the induced gap in a hybrid superconductor-semiconductor nanowire
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 103
year: '2021'
...
---
_id: '9571'
abstract:
- lang: eng
text: As the size and complexity of models and datasets grow, so does the need for
communication-efficient variants of stochastic gradient descent that can be deployed
to perform parallel model training. One popular communication-compression method
for data-parallel SGD is QSGD (Alistarh et al., 2017), which quantizes and encodes
gradients to reduce communication costs. The baseline variant of QSGD provides
strong theoretical guarantees, however, for practical purposes, the authors proposed
a heuristic variant which we call QSGDinf, which demonstrated impressive empirical
gains for distributed training of large neural networks. In this paper, we build
on this work to propose a new gradient quantization scheme, and show that it has
both stronger theoretical guarantees than QSGD, and matches and exceeds the empirical
performance of the QSGDinf heuristic and of other compression methods.
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Ali
full_name: Ramezani-Kebrya, Ali
last_name: Ramezani-Kebrya
- first_name: Fartash
full_name: Faghri, Fartash
last_name: Faghri
- first_name: Ilya
full_name: Markov, Ilya
last_name: Markov
- first_name: Vitalii
full_name: Aksenov, Vitalii
id: 2980135A-F248-11E8-B48F-1D18A9856A87
last_name: Aksenov
- first_name: Dan-Adrian
full_name: Alistarh, Dan-Adrian
id: 4A899BFC-F248-11E8-B48F-1D18A9856A87
last_name: Alistarh
orcid: 0000-0003-3650-940X
- first_name: Daniel M.
full_name: Roy, Daniel M.
last_name: Roy
citation:
ama: 'Ramezani-Kebrya A, Faghri F, Markov I, Aksenov V, Alistarh D-A, Roy DM. NUQSGD:
Provably communication-efficient data-parallel SGD via nonuniform quantization.
Journal of Machine Learning Research. 2021;22(114):1−43.'
apa: 'Ramezani-Kebrya, A., Faghri, F., Markov, I., Aksenov, V., Alistarh, D.-A.,
& Roy, D. M. (2021). NUQSGD: Provably communication-efficient data-parallel
SGD via nonuniform quantization. Journal of Machine Learning Research.
Journal of Machine Learning Research.'
chicago: 'Ramezani-Kebrya, Ali, Fartash Faghri, Ilya Markov, Vitalii Aksenov, Dan-Adrian
Alistarh, and Daniel M. Roy. “NUQSGD: Provably Communication-Efficient Data-Parallel
SGD via Nonuniform Quantization.” Journal of Machine Learning Research.
Journal of Machine Learning Research, 2021.'
ieee: 'A. Ramezani-Kebrya, F. Faghri, I. Markov, V. Aksenov, D.-A. Alistarh, and
D. M. Roy, “NUQSGD: Provably communication-efficient data-parallel SGD via nonuniform
quantization,” Journal of Machine Learning Research, vol. 22, no. 114.
Journal of Machine Learning Research, p. 1−43, 2021.'
ista: 'Ramezani-Kebrya A, Faghri F, Markov I, Aksenov V, Alistarh D-A, Roy DM. 2021.
NUQSGD: Provably communication-efficient data-parallel SGD via nonuniform quantization.
Journal of Machine Learning Research. 22(114), 1−43.'
mla: 'Ramezani-Kebrya, Ali, et al. “NUQSGD: Provably Communication-Efficient Data-Parallel
SGD via Nonuniform Quantization.” Journal of Machine Learning Research,
vol. 22, no. 114, Journal of Machine Learning Research, 2021, p. 1−43.'
short: A. Ramezani-Kebrya, F. Faghri, I. Markov, V. Aksenov, D.-A. Alistarh, D.M.
Roy, Journal of Machine Learning Research 22 (2021) 1−43.
corr_author: '1'
date_created: 2021-06-20T22:01:33Z
date_published: 2021-04-01T00:00:00Z
date_updated: 2025-07-10T12:01:54Z
day: '01'
ddc:
- '000'
department:
- _id: DaAl
external_id:
arxiv:
- '1908.06077'
file:
- access_level: open_access
checksum: 6428aa8bcb67768b6949c99b55d5281d
content_type: application/pdf
creator: asandaue
date_created: 2021-06-23T07:09:41Z
date_updated: 2021-06-23T07:09:41Z
file_id: '9595'
file_name: 2021_JournalOfMachineLearningResearch_Ramezani-Kebrya.pdf
file_size: 11237154
relation: main_file
success: 1
file_date_updated: 2021-06-23T07:09:41Z
has_accepted_license: '1'
intvolume: ' 22'
issue: '114'
language:
- iso: eng
license: https://creativecommons.org/licenses/by/4.0/
main_file_link:
- open_access: '1'
url: https://www.jmlr.org/papers/v22/20-255.html
month: '04'
oa: 1
oa_version: Published Version
page: 1−43
publication: Journal of Machine Learning Research
publication_identifier:
eissn:
- 1533-7928
issn:
- 1532-4435
publication_status: published
publisher: Journal of Machine Learning Research
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'NUQSGD: Provably communication-efficient data-parallel SGD via nonuniform
quantization'
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 22
year: '2021'
...
---
_id: '9592'
abstract:
- lang: eng
text: The convex grabbing game is a game where two players, Alice and Bob, alternate
taking extremal points from the convex hull of a point set on the plane. Rational
weights are given to the points. The goal of each player is to maximize the total
weight over all points that they obtain. We restrict the setting to the case of
binary weights. We show a construction of an arbitrarily large odd-sized point
set that allows Bob to obtain almost 3/4 of the total weight. This construction
answers a question asked by Matsumoto, Nakamigawa, and Sakuma in [Graphs and Combinatorics,
36/1 (2020)]. We also present an arbitrarily large even-sized point set where
Bob can obtain the entirety of the total weight. Finally, we discuss conjectures
about optimum moves in the convex grabbing game for both players in general.
article_processing_charge: No
arxiv: 1
author:
- first_name: Martin
full_name: Dvorak, Martin
id: 40ED02A8-C8B4-11E9-A9C0-453BE6697425
last_name: Dvorak
orcid: 0000-0001-5293-214X
- first_name: Sara
full_name: Nicholson, Sara
last_name: Nicholson
citation:
ama: 'Dvorak M, Nicholson S. Massively winning configurations in the convex grabbing
game on the plane. In: Proceedings of the 33rd Canadian Conference on Computational
Geometry. Canadian Conference on Computational Geometry; 2021.'
apa: 'Dvorak, M., & Nicholson, S. (2021). Massively winning configurations in
the convex grabbing game on the plane. In Proceedings of the 33rd Canadian
Conference on Computational Geometry. Halifax, NS, Canada; Virtual: Canadian
Conference on Computational Geometry.'
chicago: Dvorak, Martin, and Sara Nicholson. “Massively Winning Configurations in
the Convex Grabbing Game on the Plane.” In Proceedings of the 33rd Canadian
Conference on Computational Geometry. Canadian Conference on Computational
Geometry, 2021.
ieee: M. Dvorak and S. Nicholson, “Massively winning configurations in the convex
grabbing game on the plane,” in Proceedings of the 33rd Canadian Conference
on Computational Geometry, Halifax, NS, Canada; Virtual, 2021.
ista: 'Dvorak M, Nicholson S. 2021. Massively winning configurations in the convex
grabbing game on the plane. Proceedings of the 33rd Canadian Conference on Computational
Geometry. CCCG: Canadian Conference on Computational Geometry.'
mla: Dvorak, Martin, and Sara Nicholson. “Massively Winning Configurations in the
Convex Grabbing Game on the Plane.” Proceedings of the 33rd Canadian Conference
on Computational Geometry, Canadian Conference on Computational Geometry,
2021.
short: M. Dvorak, S. Nicholson, in:, Proceedings of the 33rd Canadian Conference
on Computational Geometry, Canadian Conference on Computational Geometry, 2021.
conference:
end_date: 2021-08-12
location: Halifax, NS, Canada; Virtual
name: 'CCCG: Canadian Conference on Computational Geometry'
start_date: 2021-08-10
date_created: 2021-06-22T15:57:11Z
date_published: 2021-06-29T00:00:00Z
date_updated: 2025-05-14T11:23:45Z
day: '29'
ddc:
- '516'
department:
- _id: GradSch
- _id: VlKo
external_id:
arxiv:
- '2106.11247'
file:
- access_level: open_access
checksum: 45accb1de9b7e0e4bb2fbfe5fd3e6239
content_type: application/pdf
creator: mdvorak
date_created: 2021-06-28T20:23:13Z
date_updated: 2021-06-28T20:23:13Z
file_id: '9616'
file_name: Convex-Grabbing-Game_CCCG_proc_version.pdf
file_size: 381306
relation: main_file
success: 1
- access_level: open_access
checksum: 9199cf18c65658553487458cc24d0ab2
content_type: application/pdf
creator: kschuh
date_created: 2021-08-12T10:57:21Z
date_updated: 2021-08-12T10:57:21Z
file_id: '9902'
file_name: Convex-Grabbing-Game_FULL-VERSION.pdf
file_size: 403645
relation: main_file
success: 1
file_date_updated: 2021-08-12T10:57:21Z
has_accepted_license: '1'
keyword:
- convex grabbing game
- graph grabbing game
- combinatorial game
- convex geometry
language:
- iso: eng
license: https://creativecommons.org/licenses/by-nd/4.0/
month: '06'
oa: 1
oa_version: Published Version
publication: Proceedings of the 33rd Canadian Conference on Computational Geometry
publication_status: published
publisher: Canadian Conference on Computational Geometry
quality_controlled: '1'
status: public
title: Massively winning configurations in the convex grabbing game on the plane
tmp:
image: /image/cc_by_nd.png
legal_code_url: https://creativecommons.org/licenses/by-nd/4.0/legalcode
name: Creative Commons Attribution-NoDerivatives 4.0 International (CC BY-ND 4.0)
short: CC BY-ND (4.0)
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2021'
...
---
_id: '9602'
abstract:
- lang: eng
text: "An ordered graph is a graph with a linear ordering on its vertex set. We
prove that for every positive integer k, there exists a constant ck > 0 such that
any ordered graph G on n vertices with the property that neither G nor its complement
contains an induced monotone path of size k, has either a clique or an independent
set of size at least n^ck . This strengthens a result of Bousquet, Lagoutte, and
Thomassé, who proved the analogous result for unordered graphs.\r\nA key idea
of the above paper was to show that any unordered graph on n vertices that does
not contain an induced path of size k, and whose maximum degree is at most c(k)n
for some small c(k) > 0, contains two disjoint linear size subsets with no edge
between them. This approach fails for ordered graphs, because the analogous statement
is false for k ≥ 3, by a construction of Fox. We provide some further examples
showing that this statement also fails for ordered graphs avoiding other ordered
trees."
acknowledgement: We would like to thank the anonymous referees for their useful comments
and suggestions. János Pach is partially supported by Austrian Science Fund (FWF)
grant Z 342-N31 and by ERC Advanced grant “GeoScape.” István Tomon is partially
supported by Swiss National Science Foundation grant no. 200021_196965, and thanks
the support of MIPT Moscow. Both authors are partially supported by The Russian
Government in the framework of MegaGrant no. 075-15-2019-1926.
article_processing_charge: No
article_type: original
author:
- first_name: János
full_name: Pach, János
id: E62E3130-B088-11EA-B919-BF823C25FEA4
last_name: Pach
- first_name: István
full_name: Tomon, István
last_name: Tomon
citation:
ama: Pach J, Tomon I. Erdős-Hajnal-type results for monotone paths. Journal of
Combinatorial Theory Series B. 2021;151:21-37. doi:10.1016/j.jctb.2021.05.004
apa: Pach, J., & Tomon, I. (2021). Erdős-Hajnal-type results for monotone paths.
Journal of Combinatorial Theory. Series B. Elsevier. https://doi.org/10.1016/j.jctb.2021.05.004
chicago: Pach, János, and István Tomon. “Erdős-Hajnal-Type Results for Monotone
Paths.” Journal of Combinatorial Theory. Series B. Elsevier, 2021. https://doi.org/10.1016/j.jctb.2021.05.004.
ieee: J. Pach and I. Tomon, “Erdős-Hajnal-type results for monotone paths,” Journal
of Combinatorial Theory. Series B, vol. 151. Elsevier, pp. 21–37, 2021.
ista: Pach J, Tomon I. 2021. Erdős-Hajnal-type results for monotone paths. Journal
of Combinatorial Theory. Series B. 151, 21–37.
mla: Pach, János, and István Tomon. “Erdős-Hajnal-Type Results for Monotone Paths.”
Journal of Combinatorial Theory. Series B, vol. 151, Elsevier, 2021, pp.
21–37, doi:10.1016/j.jctb.2021.05.004.
short: J. Pach, I. Tomon, Journal of Combinatorial Theory. Series B 151 (2021) 21–37.
corr_author: '1'
date_created: 2021-06-27T22:01:47Z
date_published: 2021-06-09T00:00:00Z
date_updated: 2025-04-15T07:16:52Z
day: '09'
ddc:
- '510'
department:
- _id: HeEd
doi: 10.1016/j.jctb.2021.05.004
external_id:
isi:
- '000702280800002'
file:
- access_level: open_access
checksum: 15fbc9064cd9d1c777ac0043b78c8f12
content_type: application/pdf
creator: asandaue
date_created: 2021-06-28T13:33:23Z
date_updated: 2021-06-28T13:33:23Z
file_id: '9612'
file_name: 2021_JournalOfCombinatorialTheory_Pach.pdf
file_size: 418168
relation: main_file
success: 1
file_date_updated: 2021-06-28T13:33:23Z
has_accepted_license: '1'
intvolume: ' 151'
isi: 1
language:
- iso: eng
month: '06'
oa: 1
oa_version: Published Version
page: 21-37
project:
- _id: 268116B8-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z00342
name: Mathematics, Computer Science
publication: Journal of Combinatorial Theory. Series B
publication_identifier:
issn:
- 0095-8956
publication_status: published
publisher: Elsevier
quality_controlled: '1'
scopus_import: '1'
status: public
title: Erdős-Hajnal-type results for monotone paths
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: 151
year: '2021'
...
---
_id: '9604'
abstract:
- lang: eng
text: Generalizing Lee’s inductive argument for counting the cells of higher order
Voronoi tessellations in ℝ² to ℝ³, we get precise relations in terms of Morse
theoretic quantities for piecewise constant functions on planar arrangements.
Specifically, we prove that for a generic set of n ≥ 5 points in ℝ³, the number
of regions in the order-k Voronoi tessellation is N_{k-1} - binom(k,2)n + n, for
1 ≤ k ≤ n-1, in which N_{k-1} is the sum of Euler characteristics of these function’s
first k-1 sublevel sets. We get similar expressions for the vertices, edges, and
polygons of the order-k Voronoi tessellation.
alternative_title:
- LIPIcs
article_number: '16'
article_processing_charge: No
author:
- first_name: Ranita
full_name: Biswas, Ranita
id: 3C2B033E-F248-11E8-B48F-1D18A9856A87
last_name: Biswas
orcid: 0000-0002-5372-7890
- first_name: Sebastiano
full_name: Cultrera di Montesano, Sebastiano
id: 34D2A09C-F248-11E8-B48F-1D18A9856A87
last_name: Cultrera di Montesano
orcid: 0000-0001-6249-0832
- first_name: Herbert
full_name: Edelsbrunner, Herbert
id: 3FB178DA-F248-11E8-B48F-1D18A9856A87
last_name: Edelsbrunner
orcid: 0000-0002-9823-6833
- first_name: Morteza
full_name: Saghafian, Morteza
last_name: Saghafian
citation:
ama: 'Biswas R, Cultrera di Montesano S, Edelsbrunner H, Saghafian M. Counting cells
of order-k voronoi tessellations in ℝ3 with morse theory. In: Leibniz
International Proceedings in Informatics. Vol 189. Schloss Dagstuhl - Leibniz-Zentrum
für Informatik; 2021. doi:10.4230/LIPIcs.SoCG.2021.16'
apa: 'Biswas, R., Cultrera di Montesano, S., Edelsbrunner, H., & Saghafian,
M. (2021). Counting cells of order-k voronoi tessellations in ℝ3 with
morse theory. In Leibniz International Proceedings in Informatics (Vol.
189). Online: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.SoCG.2021.16'
chicago: Biswas, Ranita, Sebastiano Cultrera di Montesano, Herbert Edelsbrunner,
and Morteza Saghafian. “Counting Cells of Order-k Voronoi Tessellations in ℝ3
with Morse Theory.” In Leibniz International Proceedings in Informatics,
Vol. 189. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021. https://doi.org/10.4230/LIPIcs.SoCG.2021.16.
ieee: R. Biswas, S. Cultrera di Montesano, H. Edelsbrunner, and M. Saghafian, “Counting
cells of order-k voronoi tessellations in ℝ3 with morse theory,” in
Leibniz International Proceedings in Informatics, Online, 2021, vol. 189.
ista: 'Biswas R, Cultrera di Montesano S, Edelsbrunner H, Saghafian M. 2021. Counting
cells of order-k voronoi tessellations in ℝ3 with morse theory. Leibniz
International Proceedings in Informatics. SoCG: International Symposium on Computational
Geometry, LIPIcs, vol. 189, 16.'
mla: Biswas, Ranita, et al. “Counting Cells of Order-k Voronoi Tessellations in
ℝ3 with Morse Theory.” Leibniz International Proceedings in Informatics,
vol. 189, 16, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021, doi:10.4230/LIPIcs.SoCG.2021.16.
short: R. Biswas, S. Cultrera di Montesano, H. Edelsbrunner, M. Saghafian, in:,
Leibniz International Proceedings in Informatics, Schloss Dagstuhl - Leibniz-Zentrum
für Informatik, 2021.
conference:
end_date: 2021-06-11
location: Online
name: 'SoCG: International Symposium on Computational Geometry'
start_date: 2021-06-07
date_created: 2021-06-27T22:01:48Z
date_published: 2021-06-02T00:00:00Z
date_updated: 2025-07-10T12:01:56Z
day: '02'
ddc:
- '516'
department:
- _id: HeEd
doi: 10.4230/LIPIcs.SoCG.2021.16
ec_funded: 1
file:
- access_level: open_access
checksum: 22b11a719018b22ecba2471b51f2eb40
content_type: application/pdf
creator: asandaue
date_created: 2021-06-28T13:11:39Z
date_updated: 2021-06-28T13:11:39Z
file_id: '9611'
file_name: 2021_LIPIcs_Biswas.pdf
file_size: 727817
relation: main_file
success: 1
file_date_updated: 2021-06-28T13:11:39Z
has_accepted_license: '1'
intvolume: ' 189'
language:
- iso: eng
month: '06'
oa: 1
oa_version: Published Version
project:
- _id: 266A2E9E-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '788183'
name: Alpha Shape Theory Extended
- _id: 268116B8-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z00342
name: Mathematics, Computer Science
- _id: 0aa4bc98-070f-11eb-9043-e6fff9c6a316
grant_number: I4887
name: Persistent Homology, Algorithms and Stochastic Geometry
publication: Leibniz International Proceedings in Informatics
publication_identifier:
isbn:
- '9783959771849'
issn:
- 1868-8969
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
quality_controlled: '1'
scopus_import: '1'
status: public
title: Counting cells of order-k voronoi tessellations in ℝ3 with morse
theory
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: 189
year: '2021'
...
---
_id: '9605'
abstract:
- lang: eng
text: 'Given a finite set A ⊂ ℝ^d, let Cov_{r,k} denote the set of all points within
distance r to at least k points of A. Allowing r and k to vary, we obtain a 2-parameter
family of spaces that grow larger when r increases or k decreases, called the
multicover bifiltration. Motivated by the problem of computing the homology of
this bifiltration, we introduce two closely related combinatorial bifiltrations,
one polyhedral and the other simplicial, which are both topologically equivalent
to the multicover bifiltration and far smaller than a Čech-based model considered
in prior work of Sheehy. Our polyhedral construction is a bifiltration of the
rhomboid tiling of Edelsbrunner and Osang, and can be efficiently computed using
a variant of an algorithm given by these authors as well. Using an implementation
for dimension 2 and 3, we provide experimental results. Our simplicial construction
is useful for understanding the polyhedral construction and proving its correctness. '
acknowledgement: The authors want to thank the reviewers for many helpful comments
and suggestions.
alternative_title:
- LIPIcs
article_number: '27'
article_processing_charge: No
arxiv: 1
author:
- first_name: René
full_name: Corbet, René
last_name: Corbet
- first_name: Michael
full_name: Kerber, Michael
last_name: Kerber
- first_name: Michael
full_name: Lesnick, Michael
last_name: Lesnick
- first_name: Georg F
full_name: Osang, Georg F
id: 464B40D6-F248-11E8-B48F-1D18A9856A87
last_name: Osang
orcid: 0000-0002-8882-5116
citation:
ama: 'Corbet R, Kerber M, Lesnick M, Osang GF. Computing the multicover bifiltration.
In: Leibniz International Proceedings in Informatics. Vol 189. Schloss
Dagstuhl - Leibniz-Zentrum für Informatik; 2021. doi:10.4230/LIPIcs.SoCG.2021.27'
apa: 'Corbet, R., Kerber, M., Lesnick, M., & Osang, G. F. (2021). Computing
the multicover bifiltration. In Leibniz International Proceedings in Informatics
(Vol. 189). Online: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.SoCG.2021.27'
chicago: Corbet, René, Michael Kerber, Michael Lesnick, and Georg F Osang. “Computing
the Multicover Bifiltration.” In Leibniz International Proceedings in Informatics,
Vol. 189. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021. https://doi.org/10.4230/LIPIcs.SoCG.2021.27.
ieee: R. Corbet, M. Kerber, M. Lesnick, and G. F. Osang, “Computing the multicover
bifiltration,” in Leibniz International Proceedings in Informatics, Online,
2021, vol. 189.
ista: 'Corbet R, Kerber M, Lesnick M, Osang GF. 2021. Computing the multicover bifiltration.
Leibniz International Proceedings in Informatics. SoCG: International Symposium
on Computational Geometry, LIPIcs, vol. 189, 27.'
mla: Corbet, René, et al. “Computing the Multicover Bifiltration.” Leibniz International
Proceedings in Informatics, vol. 189, 27, Schloss Dagstuhl - Leibniz-Zentrum
für Informatik, 2021, doi:10.4230/LIPIcs.SoCG.2021.27.
short: R. Corbet, M. Kerber, M. Lesnick, G.F. Osang, in:, Leibniz International
Proceedings in Informatics, Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
2021.
conference:
end_date: 2021-06-11
location: Online
name: 'SoCG: International Symposium on Computational Geometry'
start_date: 2021-06-07
date_created: 2021-06-27T22:01:49Z
date_published: 2021-06-02T00:00:00Z
date_updated: 2025-07-10T12:01:57Z
day: '02'
ddc:
- '516'
department:
- _id: HeEd
doi: 10.4230/LIPIcs.SoCG.2021.27
external_id:
arxiv:
- '2103.07823'
file:
- access_level: open_access
checksum: 0de217501e7ba8b267d58deed0d51761
content_type: application/pdf
creator: cziletti
date_created: 2021-06-28T12:40:47Z
date_updated: 2021-06-28T12:40:47Z
file_id: '9610'
file_name: 2021_LIPIcs_Corbet.pdf
file_size: '1367983'
relation: main_file
success: 1
file_date_updated: 2021-06-28T12:40:47Z
has_accepted_license: '1'
intvolume: ' 189'
language:
- iso: eng
month: '06'
oa: 1
oa_version: Published Version
publication: Leibniz International Proceedings in Informatics
publication_identifier:
isbn:
- '9783959771849'
issn:
- 1868-8969
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
quality_controlled: '1'
related_material:
link:
- relation: extended_version
url: https://arxiv.org/abs/2103.07823
record:
- id: '12709'
relation: later_version
status: public
scopus_import: '1'
status: public
title: Computing the multicover bifiltration
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: 189
year: '2021'
...
---
_id: '9606'
abstract:
- lang: eng
text: Sound propagation is a macroscopic manifestation of the interplay between
the equilibrium thermodynamics and the dynamical transport properties of fluids.
Here, for a two-dimensional system of ultracold fermions, we calculate the first
and second sound velocities across the whole BCS-BEC crossover, and we analyze
the system response to an external perturbation. In the low-temperature regime
we reproduce the recent measurements [Phys. Rev. Lett. 124, 240403 (2020)] of
the first sound velocity, which, due to the decoupling of density and entropy
fluctuations, is the sole mode excited by a density probe. Conversely, a heat
perturbation excites only the second sound, which, being sensitive to the superfluid
depletion, vanishes in the deep BCS regime and jumps discontinuously to zero at
the Berezinskii-Kosterlitz-Thouless superfluid transition. A mixing between the
modes occurs only in the finite-temperature BEC regime, where our theory converges
to the purely bosonic results.
acknowledgement: "G.B. acknowledges support from the Austrian Science Fund (FWF),
under Project No. M2641-N27. This work was\r\npartially supported by the University
of Padua, BIRD project “Superfluid properties of Fermi gases in optical potentials.”\r\nThe
authors thank Miki Ota, Tomoki Ozawa, Sandro Stringari, Tilman Enss, Hauke Biss,
Henning Moritz, and Nicolò Defenu for fruitful discussions. The authors thank Henning
Moritz and Markus Bohlen for providing their experimental\r\ndata."
article_number: L061303
article_processing_charge: No
article_type: letter_note
arxiv: 1
author:
- first_name: A.
full_name: Tononi, A.
last_name: Tononi
- first_name: Alberto
full_name: Cappellaro, Alberto
id: 9d13b3cb-30a2-11eb-80dc-f772505e8660
last_name: Cappellaro
orcid: 0000-0001-6110-2359
- first_name: Giacomo
full_name: Bighin, Giacomo
id: 4CA96FD4-F248-11E8-B48F-1D18A9856A87
last_name: Bighin
orcid: 0000-0001-8823-9777
- first_name: L.
full_name: Salasnich, L.
last_name: Salasnich
citation:
ama: Tononi A, Cappellaro A, Bighin G, Salasnich L. Propagation of first and second
sound in a two-dimensional Fermi superfluid. Physical Review A. 2021;103(6).
doi:10.1103/PhysRevA.103.L061303
apa: Tononi, A., Cappellaro, A., Bighin, G., & Salasnich, L. (2021). Propagation
of first and second sound in a two-dimensional Fermi superfluid. Physical Review
A. American Physical Society. https://doi.org/10.1103/PhysRevA.103.L061303
chicago: Tononi, A., Alberto Cappellaro, Giacomo Bighin, and L. Salasnich. “Propagation
of First and Second Sound in a Two-Dimensional Fermi Superfluid.” Physical
Review A. American Physical Society, 2021. https://doi.org/10.1103/PhysRevA.103.L061303.
ieee: A. Tononi, A. Cappellaro, G. Bighin, and L. Salasnich, “Propagation of first
and second sound in a two-dimensional Fermi superfluid,” Physical Review A,
vol. 103, no. 6. American Physical Society, 2021.
ista: Tononi A, Cappellaro A, Bighin G, Salasnich L. 2021. Propagation of first
and second sound in a two-dimensional Fermi superfluid. Physical Review A. 103(6),
L061303.
mla: Tononi, A., et al. “Propagation of First and Second Sound in a Two-Dimensional
Fermi Superfluid.” Physical Review A, vol. 103, no. 6, L061303, American
Physical Society, 2021, doi:10.1103/PhysRevA.103.L061303.
short: A. Tononi, A. Cappellaro, G. Bighin, L. Salasnich, Physical Review A 103
(2021).
date_created: 2021-06-27T22:01:49Z
date_published: 2021-06-01T00:00:00Z
date_updated: 2025-07-10T12:01:58Z
day: '01'
department:
- _id: MiLe
doi: 10.1103/PhysRevA.103.L061303
external_id:
arxiv:
- '2009.06491'
isi:
- '000662296700014'
intvolume: ' 103'
isi: 1
issue: '6'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/2009.06491
month: '06'
oa: 1
oa_version: Preprint
publication: Physical Review A
publication_identifier:
eissn:
- 2469-9934
issn:
- 2469-9926
publication_status: published
publisher: American Physical Society
quality_controlled: '1'
scopus_import: '1'
status: public
title: Propagation of first and second sound in a two-dimensional Fermi superfluid
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 103
year: '2021'
...
---
_id: '9618'
abstract:
- lang: eng
text: The control of nonequilibrium quantum dynamics in many-body systems is challenging
because interactions typically lead to thermalization and a chaotic spreading
throughout Hilbert space. We investigate nonequilibrium dynamics after rapid quenches
in a many-body system composed of 3 to 200 strongly interacting qubits in one
and two spatial dimensions. Using a programmable quantum simulator based on Rydberg
atom arrays, we show that coherent revivals associated with so-called quantum
many-body scars can be stabilized by periodic driving, which generates a robust
subharmonic response akin to discrete time-crystalline order. We map Hilbert space
dynamics, geometry dependence, phase diagrams, and system-size dependence of this
emergent phenomenon, demonstrating new ways to steer complex dynamics in many-body
systems and enabling potential applications in quantum information science.
acknowledgement: 'We thank many members of the Harvard AMO community, particularly
E. Urbach, S. Dakoulas, and J. Doyle for their efforts enabling safe and productive
operation of our laboratories during 2020. We thank D. Abanin, I. Cong, F. Machado,
H. Pichler, N. Yao, B. Ye, and H. Zhou for stimulating discussions. Funding: We
acknowledge financial support from the Center for Ultracold Atoms, the National
Science Foundation, the Vannevar Bush Faculty Fellowship, the U.S. Department of
Energy (LBNL QSA Center and grant no. DE-SC0021013), the Office of Naval Research,
the Army Research Office MURI, the DARPA DRINQS program (grant no. D18AC00033),
and the DARPA ONISQ program (grant no. W911NF2010021). The authors acknowledge support
from the NSF Graduate Research Fellowship Program (grant DGE1745303) and The Fannie
and John Hertz Foundation (D.B.); a National Defense Science and Engineering Graduate
(NDSEG) fellowship (H.L.); a fellowship from the Max Planck/Harvard Research Center
for Quantum Optics (G.S.); Gordon College (T.T.W.); the European Research Council
(ERC) under the European Union’s Horizon 2020 research and innovation program (grant
agreement no. 850899) (A.A.M. and M.S.); a Department of Energy Computational Science
Graduate Fellowship under award number DE-SC0021110 (N.M.); the Moore Foundation’s
EPiQS Initiative grant no. GBMF4306, the NUS Development grant AY2019/2020, and
the Stanford Institute of Theoretical Physics (W.W.H.); and the Miller Institute
for Basic Research in Science (S.C.). Author contributions: D.B., A.O., H.L., A.K.,
G.S., S.E., and T.T.W. contributed to the building of the experimental setup, performed
the measurements, and analyzed the data. A.A.M., N.M., W.W.H., S.C., and M.S. performed
theoretical analysis. All work was supervised by M.G., V.V., and M.D.L. All authors
discussed the results and contributed to the manuscript. Competing interests: M.G.,
V.V., and M.D.L. are co-founders and shareholders of QuEra Computing. A.O. is a
shareholder of QuEra Computing. Data and materials availability: All data needed
to evaluate the conclusions in the paper are present in the paper and the supplementary
materials.'
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: D.
full_name: Bluvstein, D.
last_name: Bluvstein
- first_name: A.
full_name: Omran, A.
last_name: Omran
- first_name: H.
full_name: Levine, H.
last_name: Levine
- first_name: A.
full_name: Keesling, A.
last_name: Keesling
- first_name: G.
full_name: Semeghini, G.
last_name: Semeghini
- first_name: S.
full_name: Ebadi, S.
last_name: Ebadi
- first_name: T. T.
full_name: Wang, T. T.
last_name: Wang
- first_name: Alexios
full_name: Michailidis, Alexios
id: 36EBAD38-F248-11E8-B48F-1D18A9856A87
last_name: Michailidis
orcid: 0000-0002-8443-1064
- first_name: N.
full_name: Maskara, N.
last_name: Maskara
- first_name: W. W.
full_name: Ho, W. W.
last_name: Ho
- first_name: S.
full_name: Choi, S.
last_name: Choi
- first_name: Maksym
full_name: Serbyn, Maksym
id: 47809E7E-F248-11E8-B48F-1D18A9856A87
last_name: Serbyn
orcid: 0000-0002-2399-5827
- first_name: M.
full_name: Greiner, M.
last_name: Greiner
- first_name: V.
full_name: Vuletić, V.
last_name: Vuletić
- first_name: M. D.
full_name: Lukin, M. D.
last_name: Lukin
citation:
ama: Bluvstein D, Omran A, Levine H, et al. Controlling quantum many-body dynamics
in driven Rydberg atom arrays. Science. 2021;371(6536):1355-1359. doi:10.1126/science.abg2530
apa: Bluvstein, D., Omran, A., Levine, H., Keesling, A., Semeghini, G., Ebadi, S.,
… Lukin, M. D. (2021). Controlling quantum many-body dynamics in driven Rydberg
atom arrays. Science. AAAS. https://doi.org/10.1126/science.abg2530
chicago: Bluvstein, D., A. Omran, H. Levine, A. Keesling, G. Semeghini, S. Ebadi,
T. T. Wang, et al. “Controlling Quantum Many-Body Dynamics in Driven Rydberg Atom
Arrays.” Science. AAAS, 2021. https://doi.org/10.1126/science.abg2530.
ieee: D. Bluvstein et al., “Controlling quantum many-body dynamics in driven
Rydberg atom arrays,” Science, vol. 371, no. 6536. AAAS, pp. 1355–1359,
2021.
ista: Bluvstein D, Omran A, Levine H, Keesling A, Semeghini G, Ebadi S, Wang TT,
Michailidis A, Maskara N, Ho WW, Choi S, Serbyn M, Greiner M, Vuletić V, Lukin
MD. 2021. Controlling quantum many-body dynamics in driven Rydberg atom arrays.
Science. 371(6536), 1355–1359.
mla: Bluvstein, D., et al. “Controlling Quantum Many-Body Dynamics in Driven Rydberg
Atom Arrays.” Science, vol. 371, no. 6536, AAAS, 2021, pp. 1355–59, doi:10.1126/science.abg2530.
short: D. Bluvstein, A. Omran, H. Levine, A. Keesling, G. Semeghini, S. Ebadi, T.T.
Wang, A. Michailidis, N. Maskara, W.W. Ho, S. Choi, M. Serbyn, M. Greiner, V.
Vuletić, M.D. Lukin, Science 371 (2021) 1355–1359.
date_created: 2021-06-29T12:04:05Z
date_published: 2021-03-26T00:00:00Z
date_updated: 2025-04-14T07:52:05Z
day: '26'
ddc:
- '539'
department:
- _id: MaSe
doi: 10.1126/science.abg2530
ec_funded: 1
external_id:
arxiv:
- '2012.12276'
isi:
- '000636043400048'
pmid:
- '33632894'
file:
- access_level: open_access
checksum: 0b356fd10ab9bb95177d4c047d4e9c1a
content_type: application/pdf
creator: patrickd
date_created: 2021-09-23T14:00:05Z
date_updated: 2021-09-23T14:00:05Z
file_id: '10040'
file_name: scars_subharmonic_combined_manuscript_2_11_2021 (2)-1.pdf
file_size: 3671159
relation: main_file
success: 1
file_date_updated: 2021-09-23T14:00:05Z
has_accepted_license: '1'
intvolume: ' 371'
isi: 1
issue: '6536'
keyword:
- Multidisciplinary
language:
- iso: eng
month: '03'
oa: 1
oa_version: Preprint
page: 1355-1359
pmid: 1
project:
- _id: 23841C26-32DE-11EA-91FC-C7463DDC885E
call_identifier: H2020
grant_number: '850899'
name: 'Non-Ergodic Quantum Matter: Universality, Dynamics and Control'
publication: Science
publication_identifier:
eissn:
- 1095-9203
issn:
- 0036-8075
publication_status: published
publisher: AAAS
quality_controlled: '1'
scopus_import: '1'
status: public
title: Controlling quantum many-body dynamics in driven Rydberg atom arrays
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 371
year: '2021'
...
---
_id: '9620'
abstract:
- lang: eng
text: "In this note, we introduce a distributed twist on the classic coupon collector
problem: a set of m collectors wish to each obtain a set of n coupons; for this,
they can each sample coupons uniformly at random, but can also meet in pairwise
interactions, during which they can exchange coupons. By doing so, they hope to
reduce the number of coupons that must be sampled by each collector in order to
obtain a full set. This extension is natural when considering real-world manifestations
of the coupon collector phenomenon, and has been remarked upon and studied empirically
(Hayes and Hannigan 2006, Ahmad et al. 2014, Delmarcelle 2019).\r\n\r\nWe provide
the first theoretical analysis for such a scenario. We find that “coupon collecting
with friends” can indeed significantly reduce the number of coupons each collector
must sample, and raises interesting connections to the more traditional variants
of the problem. While our analysis is in most cases asymptotically tight, there
are several open questions raised, regarding finer-grained analysis of both “coupon
collecting with friends,” and of a long-studied variant of the original problem
in which a collector requires multiple full sets of coupons."
acknowledgement: Peter Davies is supported by the European Union’s Horizon2020 research
and innovation programme under the Marie Skłodowska-Curie grant agreement No. 754411.
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Dan-Adrian
full_name: Alistarh, Dan-Adrian
id: 4A899BFC-F248-11E8-B48F-1D18A9856A87
last_name: Alistarh
orcid: 0000-0003-3650-940X
- first_name: Peter
full_name: Davies, Peter
id: 11396234-BB50-11E9-B24C-90FCE5697425
last_name: Davies
orcid: 0000-0002-5646-9524
citation:
ama: 'Alistarh D-A, Davies P. Collecting coupons is faster with friends. In: Structural
Information and Communication Complexity. Vol 12810. Springer Nature; 2021:3-12.
doi:10.1007/978-3-030-79527-6_1'
apa: 'Alistarh, D.-A., & Davies, P. (2021). Collecting coupons is faster with
friends. In Structural Information and Communication Complexity (Vol. 12810,
pp. 3–12). Wrocław, Poland: Springer Nature. https://doi.org/10.1007/978-3-030-79527-6_1'
chicago: Alistarh, Dan-Adrian, and Peter Davies. “Collecting Coupons Is Faster with
Friends.” In Structural Information and Communication Complexity, 12810:3–12.
Springer Nature, 2021. https://doi.org/10.1007/978-3-030-79527-6_1.
ieee: D.-A. Alistarh and P. Davies, “Collecting coupons is faster with friends,”
in Structural Information and Communication Complexity, Wrocław, Poland,
2021, vol. 12810, pp. 3–12.
ista: 'Alistarh D-A, Davies P. 2021. Collecting coupons is faster with friends.
Structural Information and Communication Complexity. SIROCCO: International Colloquium
on Structural Information and Communication Complexity, LNCS, vol. 12810, 3–12.'
mla: Alistarh, Dan-Adrian, and Peter Davies. “Collecting Coupons Is Faster with
Friends.” Structural Information and Communication Complexity, vol. 12810,
Springer Nature, 2021, pp. 3–12, doi:10.1007/978-3-030-79527-6_1.
short: D.-A. Alistarh, P. Davies, in:, Structural Information and Communication
Complexity, Springer Nature, 2021, pp. 3–12.
conference:
end_date: 2021-07-01
location: Wrocław, Poland
name: 'SIROCCO: International Colloquium on Structural Information and Communication
Complexity'
start_date: 2021-06-28
date_created: 2021-07-01T11:04:43Z
date_published: 2021-06-20T00:00:00Z
date_updated: 2025-09-10T10:04:46Z
day: '20'
ddc:
- '000'
department:
- _id: DaAl
doi: 10.1007/978-3-030-79527-6_1
ec_funded: 1
external_id:
isi:
- '001292788400001'
file:
- access_level: open_access
checksum: fe37fb9af3f5016c1084af9d6e7109bd
content_type: application/pdf
creator: pdavies
date_created: 2021-07-01T11:21:40Z
date_updated: 2021-07-01T11:21:40Z
file_id: '9621'
file_name: Population_Coupon_Collector.pdf
file_size: 319728
relation: main_file
file_date_updated: 2021-07-01T11:21:40Z
has_accepted_license: '1'
intvolume: ' 12810'
isi: 1
language:
- iso: eng
month: '06'
oa: 1
oa_version: Preprint
page: 3-12
project:
- _id: 260C2330-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '754411'
name: ISTplus - Postdoctoral Fellowships
publication: Structural Information and Communication Complexity
publication_identifier:
eisbn:
- '9783030795276'
eissn:
- 1611-3349
isbn:
- '9783030795269'
issn:
- 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Collecting coupons is faster with friends
type: conference
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 12810
year: '2021'
...
---
_id: '9626'
abstract:
- lang: eng
text: SnSe, a wide-bandgap semiconductor, has attracted significant attention from
the thermoelectric (TE) community due to its outstanding TE performance deriving
from the ultralow thermal conductivity and advantageous electronic structures.
Here, we promoted the TE performance of n-type SnSe polycrystals through bandgap
engineering and vacancy compensation. We found that PbTe can significantly reduce
the wide bandgap of SnSe to reduce the impurity transition energy, largely enhancing
the carrier concentration. Also, PbTe-induced crystal symmetry promotion increases
the carrier mobility, preserving large Seebeck coefficient. Consequently, a maximum
ZT of ∼1.4 at 793 K is obtained in Br doped SnSe–13%PbTe. Furthermore, we found
that extra Sn in n-type SnSe can compensate for the intrinsic Sn vacancies and
form electron donor-like metallic Sn nanophases. The Sn nanophases near the grain
boundary could also reduce the intergrain energy barrier which largely enhances
the carrier mobility. As a result, a maximum ZT value of ∼1.7 at 793 K and an
average ZT (ZTave) of ∼0.58 in 300–793 K are achieved in Br doped Sn1.08Se–13%PbTe.
Our findings provide a novel strategy to promote the TE performance in wide-bandgap
semiconductors.
acknowledgement: This work was supported by National Natural Science Foundation of
China (51772012), National Key Research and Development Program of China (2018YFA0702100
and 2018YFB0703600), the Beijing Natural Science Foundation (JQ18004). This work
was also supported by Lise Meitner Project (M2889-N) and the National Postdoctoral
Program for Innovative Talents (BX20200028). L.D.Z. appreciates the support of the
High Performance Computing (HPC) resources at Beihang University, the National Science
Fund for Distinguished Young Scholars (51925101), and center for High Pressure Science
and Technology Advanced Research (HPSTAR) for SEM measurements.
article_number: '100452'
article_processing_charge: No
article_type: original
author:
- first_name: Lizhong
full_name: Su, Lizhong
last_name: Su
- first_name: Tao
full_name: Hong, Tao
last_name: Hong
- first_name: Dongyang
full_name: Wang, Dongyang
last_name: Wang
- first_name: Sining
full_name: Wang, Sining
last_name: Wang
- first_name: Bingchao
full_name: Qin, Bingchao
last_name: Qin
- first_name: Mengmeng
full_name: Zhang, Mengmeng
last_name: Zhang
- first_name: Xiang
full_name: Gao, Xiang
last_name: Gao
- first_name: Cheng
full_name: Chang, Cheng
id: 9E331C2E-9F27-11E9-AE48-5033E6697425
last_name: Chang
orcid: 0000-0002-9515-4277
- first_name: Li Dong
full_name: Zhao, Li Dong
last_name: Zhao
citation:
ama: Su L, Hong T, Wang D, et al. Realizing high doping efficiency and thermoelectric
performance in n-type SnSe polycrystals via bandgap engineering and vacancy compensation.
Materials Today Physics. 2021;20. doi:10.1016/j.mtphys.2021.100452
apa: Su, L., Hong, T., Wang, D., Wang, S., Qin, B., Zhang, M., … Zhao, L. D. (2021).
Realizing high doping efficiency and thermoelectric performance in n-type SnSe
polycrystals via bandgap engineering and vacancy compensation. Materials Today
Physics. Elsevier. https://doi.org/10.1016/j.mtphys.2021.100452
chicago: Su, Lizhong, Tao Hong, Dongyang Wang, Sining Wang, Bingchao Qin, Mengmeng
Zhang, Xiang Gao, Cheng Chang, and Li Dong Zhao. “Realizing High Doping Efficiency
and Thermoelectric Performance in N-Type SnSe Polycrystals via Bandgap Engineering
and Vacancy Compensation.” Materials Today Physics. Elsevier, 2021. https://doi.org/10.1016/j.mtphys.2021.100452.
ieee: L. Su et al., “Realizing high doping efficiency and thermoelectric
performance in n-type SnSe polycrystals via bandgap engineering and vacancy compensation,”
Materials Today Physics, vol. 20. Elsevier, 2021.
ista: Su L, Hong T, Wang D, Wang S, Qin B, Zhang M, Gao X, Chang C, Zhao LD. 2021.
Realizing high doping efficiency and thermoelectric performance in n-type SnSe
polycrystals via bandgap engineering and vacancy compensation. Materials Today
Physics. 20, 100452.
mla: Su, Lizhong, et al. “Realizing High Doping Efficiency and Thermoelectric Performance
in N-Type SnSe Polycrystals via Bandgap Engineering and Vacancy Compensation.”
Materials Today Physics, vol. 20, 100452, Elsevier, 2021, doi:10.1016/j.mtphys.2021.100452.
short: L. Su, T. Hong, D. Wang, S. Wang, B. Qin, M. Zhang, X. Gao, C. Chang, L.D.
Zhao, Materials Today Physics 20 (2021).
corr_author: '1'
date_created: 2021-07-04T22:01:24Z
date_published: 2021-06-03T00:00:00Z
date_updated: 2024-10-09T21:00:40Z
day: '03'
department:
- _id: MaIb
doi: 10.1016/j.mtphys.2021.100452
external_id:
isi:
- '000703159600010'
intvolume: ' 20'
isi: 1
language:
- iso: eng
month: '06'
oa_version: None
publication: Materials Today Physics
publication_identifier:
eissn:
- 2542-5293
publication_status: published
publisher: Elsevier
quality_controlled: '1'
scopus_import: '1'
status: public
title: Realizing high doping efficiency and thermoelectric performance in n-type SnSe
polycrystals via bandgap engineering and vacancy compensation
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 20
year: '2021'
...
---
_id: '9627'
abstract:
- lang: eng
text: "We compute the deficiency spaces of operators of the form \U0001D43B\U0001D434⊗̂
\U0001D43C+\U0001D43C⊗̂ \U0001D43B\U0001D435, for symmetric \U0001D43B\U0001D434
and self-adjoint \U0001D43B\U0001D435. This enables us to construct self-adjoint
extensions (if they exist) by means of von Neumann's theory. The structure of
the deficiency spaces for this case was asserted already in Ibort et al. [Boundary
dynamics driven entanglement, J. Phys. A: Math. Theor. 47(38) (2014) 385301],
but only proven under the restriction of \U0001D43B\U0001D435 having discrete,
non-degenerate spectrum."
acknowledgement: M. W. gratefully acknowledges financial support by the German Academic
Scholarship Foundation (Studienstiftung des deutschen Volkes). T.W. thanks PAO Gazprom
Neft, the Euler International Mathematical Institute in Saint Petersburg and ORISA
GmbH for their financial support in the form of scholarships during his Master's
and Bachelor's studies respectively. The authors want to thank Mark Malamud for
pointing out the reference [1] to them. This work was supported by the Ministry
of Science and Higher Education of the Russian Federation, agreement No 075-15-2019-1619.
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Daniel
full_name: Lenz, Daniel
last_name: Lenz
- first_name: Timon
full_name: Weinmann, Timon
last_name: Weinmann
- first_name: Melchior
full_name: Wirth, Melchior
id: 88644358-0A0E-11EA-8FA5-49A33DDC885E
last_name: Wirth
orcid: 0000-0002-0519-4241
citation:
ama: Lenz D, Weinmann T, Wirth M. Self-adjoint extensions of bipartite Hamiltonians.
Proceedings of the Edinburgh Mathematical Society. 2021;64(3):443-447.
doi:10.1017/S0013091521000080
apa: Lenz, D., Weinmann, T., & Wirth, M. (2021). Self-adjoint extensions of
bipartite Hamiltonians. Proceedings of the Edinburgh Mathematical Society.
Cambridge University Press. https://doi.org/10.1017/S0013091521000080
chicago: Lenz, Daniel, Timon Weinmann, and Melchior Wirth. “Self-Adjoint Extensions
of Bipartite Hamiltonians.” Proceedings of the Edinburgh Mathematical Society.
Cambridge University Press, 2021. https://doi.org/10.1017/S0013091521000080.
ieee: D. Lenz, T. Weinmann, and M. Wirth, “Self-adjoint extensions of bipartite
Hamiltonians,” Proceedings of the Edinburgh Mathematical Society, vol.
64, no. 3. Cambridge University Press, pp. 443–447, 2021.
ista: Lenz D, Weinmann T, Wirth M. 2021. Self-adjoint extensions of bipartite Hamiltonians.
Proceedings of the Edinburgh Mathematical Society. 64(3), 443–447.
mla: Lenz, Daniel, et al. “Self-Adjoint Extensions of Bipartite Hamiltonians.” Proceedings
of the Edinburgh Mathematical Society, vol. 64, no. 3, Cambridge University
Press, 2021, pp. 443–47, doi:10.1017/S0013091521000080.
short: D. Lenz, T. Weinmann, M. Wirth, Proceedings of the Edinburgh Mathematical
Society 64 (2021) 443–447.
corr_author: '1'
date_created: 2021-07-04T22:01:24Z
date_published: 2021-08-01T00:00:00Z
date_updated: 2024-10-09T21:05:06Z
day: '01'
department:
- _id: JaMa
doi: 10.1017/S0013091521000080
external_id:
arxiv:
- '1912.03670'
isi:
- '000721363700003'
intvolume: ' 64'
isi: 1
issue: '3'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1017/S0013091521000080
month: '08'
oa: 1
oa_version: Published Version
page: 443-447
publication: Proceedings of the Edinburgh Mathematical Society
publication_identifier:
eissn:
- 1464-3839
issn:
- 0013-0915
publication_status: published
publisher: Cambridge University Press
quality_controlled: '1'
scopus_import: '1'
status: public
title: Self-adjoint extensions of bipartite Hamiltonians
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 64
year: '2021'
...
---
_id: '9629'
abstract:
- lang: eng
text: Intestinal organoids derived from single cells undergo complex crypt–villus
patterning and morphogenesis. However, the nature and coordination of the underlying
forces remains poorly characterized. Here, using light-sheet microscopy and large-scale
imaging quantification, we demonstrate that crypt formation coincides with a stark
reduction in lumen volume. We develop a 3D biophysical model to computationally
screen different mechanical scenarios of crypt morphogenesis. Combining this with
live-imaging data and multiple mechanical perturbations, we show that actomyosin-driven
crypt apical contraction and villus basal tension work synergistically with lumen
volume reduction to drive crypt morphogenesis, and demonstrate the existence of
a critical point in differential tensions above which crypt morphology becomes
robust to volume changes. Finally, we identified a sodium/glucose cotransporter
that is specific to differentiated enterocytes that modulates lumen volume reduction
through cell swelling in the villus region. Together, our study uncovers the cellular
basis of how cell fate modulates osmotic and actomyosin forces to coordinate robust
morphogenesis.
acknowledgement: 'We acknowledge the members of the Lennon-Duménil laboratory for
sharing the mouse line of Myh9-GFP. We are grateful to the members of the Liberali
laboratory and the FMI facilities for their support. We thank E. Tagliavini for
IT support; L. Gelman for assistance and training; S. Bichet and A. Bogucki for
helping with histology of mouse tissues; H. Kohler for fluorescence-activated cell
sorting; G. Q. G. de Medeiros for maintenance of light-sheet microscopy; M. G. Stadler
for scRNA-seq analysis; G. Gay for discussions on the 3D vertex model; the members
of the Liberali laboratory, C. P. Heisenberg and C. Tsiairis for reading and providing
feedback on the manuscript. Funding: Q.Y. is supported by a Postdoc fellowship from
Peter und Taul Engelhorn Stiftung (PTES). This work received funding from the European
Research Council (ERC) under the EU Horizon 2020 research and Innovation Programme
Grant Agreement no. 758617 (to P.L.), the Swiss National Foundation (SNF) (POOP3_157531,
to P.L.) and from the ERC under the EU Horizon 2020 Research and Innovation Program
Grant Agreements 851288 (to E.H.) and the Austrian Science Fund (FWF) (P31639, to
E.H.).'
article_processing_charge: No
article_type: original
author:
- first_name: Qiutan
full_name: Yang, Qiutan
last_name: Yang
- first_name: Shi-lei
full_name: Xue, Shi-lei
id: 31D2C804-F248-11E8-B48F-1D18A9856A87
last_name: Xue
- first_name: Chii Jou
full_name: Chan, Chii Jou
last_name: Chan
- first_name: Markus
full_name: Rempfler, Markus
last_name: Rempfler
- first_name: Dario
full_name: Vischi, Dario
last_name: Vischi
- first_name: Francisca
full_name: Maurer-Gutierrez, Francisca
last_name: Maurer-Gutierrez
- first_name: Takashi
full_name: Hiiragi, Takashi
last_name: Hiiragi
- first_name: Edouard B
full_name: Hannezo, Edouard B
id: 3A9DB764-F248-11E8-B48F-1D18A9856A87
last_name: Hannezo
orcid: 0000-0001-6005-1561
- first_name: Prisca
full_name: Liberali, Prisca
last_name: Liberali
citation:
ama: Yang Q, Xue S, Chan CJ, et al. Cell fate coordinates mechano-osmotic forces
in intestinal crypt formation. Nature Cell Biology. 2021;23:733–744. doi:10.1038/s41556-021-00700-2
apa: Yang, Q., Xue, S., Chan, C. J., Rempfler, M., Vischi, D., Maurer-Gutierrez,
F., … Liberali, P. (2021). Cell fate coordinates mechano-osmotic forces in intestinal
crypt formation. Nature Cell Biology. Springer Nature. https://doi.org/10.1038/s41556-021-00700-2
chicago: Yang, Qiutan, Shi-lei Xue, Chii Jou Chan, Markus Rempfler, Dario Vischi,
Francisca Maurer-Gutierrez, Takashi Hiiragi, Edouard B Hannezo, and Prisca Liberali.
“Cell Fate Coordinates Mechano-Osmotic Forces in Intestinal Crypt Formation.”
Nature Cell Biology. Springer Nature, 2021. https://doi.org/10.1038/s41556-021-00700-2.
ieee: Q. Yang et al., “Cell fate coordinates mechano-osmotic forces in intestinal
crypt formation,” Nature Cell Biology, vol. 23. Springer Nature, pp. 733–744,
2021.
ista: Yang Q, Xue S, Chan CJ, Rempfler M, Vischi D, Maurer-Gutierrez F, Hiiragi
T, Hannezo EB, Liberali P. 2021. Cell fate coordinates mechano-osmotic forces
in intestinal crypt formation. Nature Cell Biology. 23, 733–744.
mla: Yang, Qiutan, et al. “Cell Fate Coordinates Mechano-Osmotic Forces in Intestinal
Crypt Formation.” Nature Cell Biology, vol. 23, Springer Nature, 2021,
pp. 733–744, doi:10.1038/s41556-021-00700-2.
short: Q. Yang, S. Xue, C.J. Chan, M. Rempfler, D. Vischi, F. Maurer-Gutierrez,
T. Hiiragi, E.B. Hannezo, P. Liberali, Nature Cell Biology 23 (2021) 733–744.
corr_author: '1'
date_created: 2021-07-04T22:01:25Z
date_published: 2021-06-21T00:00:00Z
date_updated: 2025-04-14T07:52:26Z
day: '21'
department:
- _id: EdHa
doi: 10.1038/s41556-021-00700-2
ec_funded: 1
external_id:
isi:
- '000664016300003'
pmid:
- '34155381'
intvolume: ' 23'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://www.biorxiv.org/content/10.1101/2020.05.13.094359
month: '06'
oa: 1
oa_version: Preprint
page: 733–744
pmid: 1
project:
- _id: 05943252-7A3F-11EA-A408-12923DDC885E
call_identifier: H2020
grant_number: '851288'
name: Design Principles of Branching Morphogenesis
- _id: 268294B6-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P31639
name: Active mechano-chemical description of the cell cytoskeleton
publication: Nature Cell Biology
publication_identifier:
eissn:
- 1476-4679
issn:
- 1465-7392
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Cell fate coordinates mechano-osmotic forces in intestinal crypt formation
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 23
year: '2021'
...
---
_id: '9636'
article_processing_charge: No
author:
- first_name: Andrew P
full_name: Higginbotham, Andrew P
id: 4AD6785A-F248-11E8-B48F-1D18A9856A87
last_name: Higginbotham
orcid: 0000-0003-2607-2363
citation:
ama: Higginbotham AP. Data for “Breakdown of induced p ± ip pairing in a superconductor-semiconductor
hybrid.” 2021.
apa: Higginbotham, A. P. (2021). Data for “Breakdown of induced p ± ip pairing in
a superconductor-semiconductor hybrid.” Institute of Science and Technology Austria.
chicago: Higginbotham, Andrew P. “Data for ‘Breakdown of Induced p ± Ip Pairing
in a Superconductor-Semiconductor Hybrid.’” Institute of Science and Technology
Austria, 2021.
ieee: A. P. Higginbotham, “Data for ‘Breakdown of induced p ± ip pairing in a superconductor-semiconductor
hybrid.’” Institute of Science and Technology Austria, 2021.
ista: Higginbotham AP. 2021. Data for ‘Breakdown of induced p ± ip pairing in a
superconductor-semiconductor hybrid’, Institute of Science and Technology Austria.
mla: Higginbotham, Andrew P. Data for “Breakdown of Induced p ± Ip Pairing in
a Superconductor-Semiconductor Hybrid.” Institute of Science and Technology
Austria, 2021.
short: A.P. Higginbotham, (2021).
date_created: 2021-07-07T20:43:10Z
date_published: 2021-01-01T00:00:00Z
date_updated: 2025-04-15T06:54:43Z
department:
- _id: AnHi
file:
- access_level: open_access
checksum: 18e90687ec7bbd75f8bfea4d8293fb30
content_type: application/zip
creator: ahigginb
date_created: 2021-07-07T20:37:28Z
date_updated: 2021-07-07T20:37:28Z
file_id: '9637'
file_name: figures_data.zip
file_size: 3345244
relation: main_file
success: 1
file_date_updated: 2021-07-07T20:37:28Z
has_accepted_license: '1'
license: https://creativecommons.org/licenses/by-nc/4.0/
oa: 1
oa_version: Submitted Version
publisher: Institute of Science and Technology Austria
related_material:
record:
- id: '10029'
relation: used_in_publication
status: public
status: public
title: Data for "Breakdown of induced p ± ip pairing in a superconductor-semiconductor
hybrid"
tmp:
image: /images/cc_by_nc.png
legal_code_url: https://creativecommons.org/licenses/by-nc/4.0/legalcode
name: Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)
short: CC BY-NC (4.0)
type: research_data
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2021'
...
---
_id: '9641'
abstract:
- lang: eng
text: At the encounter with a novel environment, contextual memory formation is
greatly enhanced, accompanied with increased arousal and active exploration. Although
this phenomenon has been widely observed in animal and human daily life, how the
novelty in the environment is detected and contributes to contextual memory formation
has lately started to be unveiled. The hippocampus has been studied for many decades
for its largely known roles in encoding spatial memory, and a growing body of
evidence indicates a differential involvement of dorsal and ventral hippocampal
divisions in novelty detection. In this brief review article, we discuss the recent
findings of the role of mossy cells in the ventral hippocampal moiety in novelty
detection and put them in perspective with other novelty-related pathways in the
hippocampus. We propose a mechanism for novelty-driven memory acquisition in the
dentate gyrus by the direct projection of ventral mossy cells to dorsal dentate
granule cells. By this projection, the ventral hippocampus sends novelty signals
to the dorsal hippocampus, opening a gate for memory encoding in dentate granule
cells based on information coming from the entorhinal cortex. We conclude that,
contrary to the presently accepted functional independence, the dorsal and ventral
hippocampi cooperate to link the novelty and contextual information, and this
dorso-ventral interaction is crucial for the novelty-dependent memory formation.
acknowledgement: This work was supported by a European Research Council Advanced Grant
694539 to Ryuichi Shigemoto.
article_number: '107486'
article_processing_charge: No
article_type: original
author:
- first_name: Felipe
full_name: Fredes, Felipe
last_name: Fredes
- first_name: Ryuichi
full_name: Shigemoto, Ryuichi
id: 499F3ABC-F248-11E8-B48F-1D18A9856A87
last_name: Shigemoto
orcid: 0000-0001-8761-9444
citation:
ama: Fredes F, Shigemoto R. The role of hippocampal mossy cells in novelty detection.
Neurobiology of Learning and Memory. 2021;183. doi:10.1016/j.nlm.2021.107486
apa: Fredes, F., & Shigemoto, R. (2021). The role of hippocampal mossy cells
in novelty detection. Neurobiology of Learning and Memory. Elsevier. https://doi.org/10.1016/j.nlm.2021.107486
chicago: Fredes, Felipe, and Ryuichi Shigemoto. “The Role of Hippocampal Mossy Cells
in Novelty Detection.” Neurobiology of Learning and Memory. Elsevier, 2021.
https://doi.org/10.1016/j.nlm.2021.107486.
ieee: F. Fredes and R. Shigemoto, “The role of hippocampal mossy cells in novelty
detection,” Neurobiology of Learning and Memory, vol. 183. Elsevier, 2021.
ista: Fredes F, Shigemoto R. 2021. The role of hippocampal mossy cells in novelty
detection. Neurobiology of Learning and Memory. 183, 107486.
mla: Fredes, Felipe, and Ryuichi Shigemoto. “The Role of Hippocampal Mossy Cells
in Novelty Detection.” Neurobiology of Learning and Memory, vol. 183, 107486,
Elsevier, 2021, doi:10.1016/j.nlm.2021.107486.
short: F. Fredes, R. Shigemoto, Neurobiology of Learning and Memory 183 (2021).
date_created: 2021-07-11T22:01:16Z
date_published: 2021-06-30T00:00:00Z
date_updated: 2025-07-10T12:02:00Z
day: '30'
ddc:
- '610'
department:
- _id: RySh
doi: 10.1016/j.nlm.2021.107486
ec_funded: 1
external_id:
isi:
- '000677694900004'
pmid:
- '34214666'
file:
- access_level: open_access
checksum: 8e8298a9e8c7df146ad23f32c2a63929
content_type: application/pdf
creator: cziletti
date_created: 2021-07-19T13:46:06Z
date_updated: 2021-07-19T13:46:06Z
file_id: '9694'
file_name: 2021_NeurobLearnMemory_Fredes.pdf
file_size: 1994793
relation: main_file
success: 1
file_date_updated: 2021-07-19T13:46:06Z
has_accepted_license: '1'
intvolume: ' 183'
isi: 1
language:
- iso: eng
license: https://creativecommons.org/licenses/by-nc-nd/4.0/
month: '06'
oa: 1
oa_version: Published Version
pmid: 1
project:
- _id: 25CA28EA-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '694539'
name: 'In situ analysis of single channel subunit composition in neurons: physiological
implication in synaptic plasticity and behaviour'
publication: Neurobiology of Learning and Memory
publication_identifier:
eissn:
- 1095-9564
issn:
- 1074-7427
publication_status: published
publisher: Elsevier
quality_controlled: '1'
scopus_import: '1'
status: public
title: The role of hippocampal mossy cells in novelty detection
tmp:
image: /images/cc_by_nc_nd.png
legal_code_url: https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode
name: Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International
(CC BY-NC-ND 4.0)
short: CC BY-NC-ND (4.0)
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 183
year: '2021'
...
---
_id: '9645'
abstract:
- lang: eng
text: "We consider the fundamental problem of reachability analysis over imperative
programs with real variables. Previous works that tackle reachability are either
unable to handle programs consisting of general loops (e.g. symbolic execution),
or lack completeness guarantees (e.g. abstract interpretation), or are not automated
(e.g. incorrectness logic). In contrast, we propose a novel approach for reachability
analysis that can handle general and complex loops, is complete, and can be entirely
automated for a wide family of programs. Through the notion of Inductive Reachability
Witnesses (IRWs), our approach extends ideas from both invariant generation and
termination to reachability analysis.\r\n\r\nWe first show that our IRW-based
approach is sound and complete for reachability analysis of imperative programs.
Then, we focus on linear and polynomial programs and develop automated methods
for synthesizing linear and polynomial IRWs. In the linear case, we follow the
well-known approaches using Farkas' Lemma. Our main contribution is in the polynomial
case, where we present a push-button semi-complete algorithm. We achieve this
using a novel combination of classical theorems in real algebraic geometry, such
as Putinar's Positivstellensatz and Hilbert's Strong Nullstellensatz. Finally,
our experimental results show we can prove complex reachability objectives over
various benchmarks that were beyond the reach of previous methods."
acknowledgement: This research was partially supported by the ERC CoG 863818 (ForM-SMArt),
the National Natural Science Foundation of China (NSFC) Grant No. 61802254, the
Huawei Innovation Research Program, the Facebook PhD Fellowship Program, and DOC
Fellowship No. 24956 of the Austrian Academy of Sciences (ÖAW).
article_processing_charge: No
author:
- first_name: Ali
full_name: Asadi, Ali
last_name: Asadi
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Hongfei
full_name: Fu, Hongfei
id: 3AAD03D6-F248-11E8-B48F-1D18A9856A87
last_name: Fu
- first_name: Amir Kafshdar
full_name: Goharshady, Amir Kafshdar
id: 391365CE-F248-11E8-B48F-1D18A9856A87
last_name: Goharshady
orcid: 0000-0003-1702-6584
- first_name: Mohammad
full_name: Mahdavi, Mohammad
last_name: Mahdavi
citation:
ama: 'Asadi A, Chatterjee K, Fu H, Goharshady AK, Mahdavi M. Polynomial reachability
witnesses via Stellensätze. In: Proceedings of the 42nd ACM SIGPLAN International
Conference on Programming Language Design and Implementation. Association
for Computing Machinery; 2021:772-787. doi:10.1145/3453483.3454076'
apa: 'Asadi, A., Chatterjee, K., Fu, H., Goharshady, A. K., & Mahdavi, M. (2021).
Polynomial reachability witnesses via Stellensätze. In Proceedings of the 42nd
ACM SIGPLAN International Conference on Programming Language Design and Implementation
(pp. 772–787). Online: Association for Computing Machinery. https://doi.org/10.1145/3453483.3454076'
chicago: Asadi, Ali, Krishnendu Chatterjee, Hongfei Fu, Amir Kafshdar Goharshady,
and Mohammad Mahdavi. “Polynomial Reachability Witnesses via Stellensätze.” In
Proceedings of the 42nd ACM SIGPLAN International Conference on Programming
Language Design and Implementation, 772–87. Association for Computing Machinery,
2021. https://doi.org/10.1145/3453483.3454076.
ieee: A. Asadi, K. Chatterjee, H. Fu, A. K. Goharshady, and M. Mahdavi, “Polynomial
reachability witnesses via Stellensätze,” in Proceedings of the 42nd ACM SIGPLAN
International Conference on Programming Language Design and Implementation,
Online, 2021, pp. 772–787.
ista: 'Asadi A, Chatterjee K, Fu H, Goharshady AK, Mahdavi M. 2021. Polynomial reachability
witnesses via Stellensätze. Proceedings of the 42nd ACM SIGPLAN International
Conference on Programming Language Design and Implementation. PLDI: Programming
Language Design and Implementation, 772–787.'
mla: Asadi, Ali, et al. “Polynomial Reachability Witnesses via Stellensätze.” Proceedings
of the 42nd ACM SIGPLAN International Conference on Programming Language Design
and Implementation, Association for Computing Machinery, 2021, pp. 772–87,
doi:10.1145/3453483.3454076.
short: A. Asadi, K. Chatterjee, H. Fu, A.K. Goharshady, M. Mahdavi, in:, Proceedings
of the 42nd ACM SIGPLAN International Conference on Programming Language Design
and Implementation, Association for Computing Machinery, 2021, pp. 772–787.
conference:
end_date: 2021-06-26
location: Online
name: 'PLDI: Programming Language Design and Implementation'
start_date: 2021-06-20
date_created: 2021-07-11T22:01:17Z
date_published: 2021-06-01T00:00:00Z
date_updated: 2025-07-10T12:02:00Z
day: '01'
department:
- _id: KrCh
doi: 10.1145/3453483.3454076
ec_funded: 1
external_id:
isi:
- '000723661700050'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://hal.archives-ouvertes.fr/hal-03183862/
month: '06'
oa: 1
oa_version: Submitted Version
page: 772-787
project:
- _id: 0599E47C-7A3F-11EA-A408-12923DDC885E
call_identifier: H2020
grant_number: '863818'
name: 'Formal Methods for Stochastic Models: Algorithms and Applications'
- _id: 267066CE-B435-11E9-9278-68D0E5697425
name: Quantitative Analysis of Probabilistic Systems with a focus on Crypto-Currencies
publication: Proceedings of the 42nd ACM SIGPLAN International Conference on Programming
Language Design and Implementation
publication_identifier:
isbn:
- '9781450383912'
publication_status: published
publisher: Association for Computing Machinery
quality_controlled: '1'
scopus_import: '1'
status: public
title: Polynomial reachability witnesses via Stellensätze
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2021'
...
---
_id: '9646'
abstract:
- lang: eng
text: We consider the fundamental problem of deriving quantitative bounds on the
probability that a given assertion is violated in a probabilistic program. We
provide automated algorithms that obtain both lower and upper bounds on the assertion
violation probability. The main novelty of our approach is that we prove new and
dedicated fixed-point theorems which serve as the theoretical basis of our algorithms
and enable us to reason about assertion violation bounds in terms of pre and post
fixed-point functions. To synthesize such fixed-points, we devise algorithms that
utilize a wide range of mathematical tools, including repulsing ranking supermartingales,
Hoeffding's lemma, Minkowski decompositions, Jensen's inequality, and convex optimization.
On the theoretical side, we provide (i) the first automated algorithm for lower-bounds
on assertion violation probabilities, (ii) the first complete algorithm for upper-bounds
of exponential form in affine programs, and (iii) provably and significantly tighter
upper-bounds than the previous approaches. On the practical side, we show our
algorithms can handle a wide variety of programs from the literature and synthesize
bounds that are remarkably tighter than previous results, in some cases by thousands
of orders of magnitude.
acknowledgement: 'We are very thankful to the anonymous reviewers for the helpful
and valuable comments. The work was partially supported by the National Natural
Science Foundation of China (NSFC) Grant No. 61802254, the Huawei Innovation Research
Program, the ERC CoG 863818 (ForM-SMArt), the Facebook PhD Fellowship Program and
DOC Fellowship #24956 of the Austrian Academy of Sciences (ÖAW).'
article_processing_charge: No
arxiv: 1
author:
- first_name: Jinyi
full_name: Wang, Jinyi
last_name: Wang
- first_name: Yican
full_name: Sun, Yican
last_name: Sun
- first_name: Hongfei
full_name: Fu, Hongfei
id: 3AAD03D6-F248-11E8-B48F-1D18A9856A87
last_name: Fu
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Amir Kafshdar
full_name: Goharshady, Amir Kafshdar
id: 391365CE-F248-11E8-B48F-1D18A9856A87
last_name: Goharshady
orcid: 0000-0003-1702-6584
citation:
ama: 'Wang J, Sun Y, Fu H, Chatterjee K, Goharshady AK. Quantitative analysis of
assertion violations in probabilistic programs. In: Proceedings of the 42nd
ACM SIGPLAN International Conference on Programming Language Design and Implementation.
Association for Computing Machinery; 2021:1171-1186. doi:10.1145/3453483.3454102'
apa: 'Wang, J., Sun, Y., Fu, H., Chatterjee, K., & Goharshady, A. K. (2021).
Quantitative analysis of assertion violations in probabilistic programs. In Proceedings
of the 42nd ACM SIGPLAN International Conference on Programming Language Design
and Implementation (pp. 1171–1186). Online: Association for Computing Machinery.
https://doi.org/10.1145/3453483.3454102'
chicago: Wang, Jinyi, Yican Sun, Hongfei Fu, Krishnendu Chatterjee, and Amir Kafshdar
Goharshady. “Quantitative Analysis of Assertion Violations in Probabilistic Programs.”
In Proceedings of the 42nd ACM SIGPLAN International Conference on Programming
Language Design and Implementation, 1171–86. Association for Computing Machinery,
2021. https://doi.org/10.1145/3453483.3454102.
ieee: J. Wang, Y. Sun, H. Fu, K. Chatterjee, and A. K. Goharshady, “Quantitative
analysis of assertion violations in probabilistic programs,” in Proceedings
of the 42nd ACM SIGPLAN International Conference on Programming Language Design
and Implementation, Online, 2021, pp. 1171–1186.
ista: 'Wang J, Sun Y, Fu H, Chatterjee K, Goharshady AK. 2021. Quantitative analysis
of assertion violations in probabilistic programs. Proceedings of the 42nd ACM
SIGPLAN International Conference on Programming Language Design and Implementation.
PLDI: Programming Language Design and Implementation, 1171–1186.'
mla: Wang, Jinyi, et al. “Quantitative Analysis of Assertion Violations in Probabilistic
Programs.” Proceedings of the 42nd ACM SIGPLAN International Conference on
Programming Language Design and Implementation, Association for Computing
Machinery, 2021, pp. 1171–86, doi:10.1145/3453483.3454102.
short: J. Wang, Y. Sun, H. Fu, K. Chatterjee, A.K. Goharshady, in:, Proceedings
of the 42nd ACM SIGPLAN International Conference on Programming Language Design
and Implementation, Association for Computing Machinery, 2021, pp. 1171–1186.
conference:
end_date: 2021-06-26
location: Online
name: 'PLDI: Programming Language Design and Implementation'
start_date: 2021-06-20
date_created: 2021-07-11T22:01:18Z
date_published: 2021-06-01T00:00:00Z
date_updated: 2025-04-15T07:55:05Z
day: '01'
department:
- _id: KrCh
doi: 10.1145/3453483.3454102
ec_funded: 1
external_id:
arxiv:
- '2011.14617'
isi:
- '000723661700076'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/2011.14617
month: '06'
oa: 1
oa_version: Preprint
page: 1171-1186
project:
- _id: 0599E47C-7A3F-11EA-A408-12923DDC885E
call_identifier: H2020
grant_number: '863818'
name: 'Formal Methods for Stochastic Models: Algorithms and Applications'
- _id: 267066CE-B435-11E9-9278-68D0E5697425
name: Quantitative Analysis of Probabilistic Systems with a focus on Crypto-Currencies
publication: Proceedings of the 42nd ACM SIGPLAN International Conference on Programming
Language Design and Implementation
publication_identifier:
isbn:
- '9781450383912'
publication_status: published
publisher: Association for Computing Machinery
quality_controlled: '1'
scopus_import: '1'
status: public
title: Quantitative analysis of assertion violations in probabilistic programs
type: conference
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
year: '2021'
...
---
_id: '9647'
abstract:
- lang: eng
text: 'Gene expression is regulated by the set of transcription factors (TFs) that
bind to the promoter. The ensuing regulating function is often represented as
a combinational logic circuit, where output (gene expression) is determined by
current input values (promoter bound TFs) only. However, the simultaneous arrival
of TFs is a strong assumption, since transcription and translation of genes introduce
intrinsic time delays and there is no global synchronisation among the arrival
times of different molecular species at their targets. We present an experimentally
implementable genetic circuit with two inputs and one output, which in the presence
of small delays in input arrival, exhibits qualitatively distinct population-level
phenotypes, over timescales that are longer than typical cell doubling times.
From a dynamical systems point of view, these phenotypes represent long-lived
transients: although they converge to the same value eventually, they do so after
a very long time span. The key feature of this toy model genetic circuit is that,
despite having only two inputs and one output, it is regulated by twenty-three
distinct DNA-TF configurations, two of which are more stable than others (DNA
looped states), one promoting and another blocking the expression of the output
gene. Small delays in input arrival time result in a majority of cells in the
population quickly reaching the stable state associated with the first input,
while exiting of this stable state occurs at a slow timescale. In order to mechanistically
model the behaviour of this genetic circuit, we used a rule-based modelling language,
and implemented a grid-search to find parameter combinations giving rise to long-lived
transients. Our analysis shows that in the absence of feedback, there exist path-dependent
gene regulatory mechanisms based on the long timescale of transients. The behaviour
of this toy model circuit suggests that gene regulatory networks can exploit event
timing to create phenotypes, and it opens the possibility that they could use
event timing to memorise events, without regulatory feedback. The model reveals
the importance of (i) mechanistically modelling the transitions between the different
DNA-TF states, and (ii) employing transient analysis thereof.'
acknowledgement: 'Tatjana Petrov’s research was supported in part by SNSF Advanced
Postdoctoral Mobility Fellowship grant number P300P2 161067, the Ministry of Science,
Research and the Arts of the state of Baden-Wurttemberg, and the DFG Centre of Excellence
2117 ‘Centre for the Advanced Study of Collective Behaviour’ (ID: 422037984). Claudia
Igler is the recipient of a DOC Fellowship of the Austrian Academy of Sciences.
Thomas A. Henzinger’s research was supported in part by the Austrian Science Fund
(FWF) under grant Z211-N23 (Wittgenstein Award).'
article_processing_charge: No
article_type: original
author:
- first_name: Tatjana
full_name: Petrov, Tatjana
last_name: Petrov
- first_name: Claudia
full_name: Igler, Claudia
id: 46613666-F248-11E8-B48F-1D18A9856A87
last_name: Igler
- first_name: Ali
full_name: Sezgin, Ali
id: 4C7638DA-F248-11E8-B48F-1D18A9856A87
last_name: Sezgin
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000-0002-2985-7724
- first_name: Calin C
full_name: Guet, Calin C
id: 47F8433E-F248-11E8-B48F-1D18A9856A87
last_name: Guet
orcid: 0000-0001-6220-2052
citation:
ama: Petrov T, Igler C, Sezgin A, Henzinger TA, Guet CC. Long lived transients in
gene regulation. Theoretical Computer Science. 2021;893:1-16. doi:10.1016/j.tcs.2021.05.023
apa: Petrov, T., Igler, C., Sezgin, A., Henzinger, T. A., & Guet, C. C. (2021).
Long lived transients in gene regulation. Theoretical Computer Science.
Elsevier. https://doi.org/10.1016/j.tcs.2021.05.023
chicago: Petrov, Tatjana, Claudia Igler, Ali Sezgin, Thomas A Henzinger, and Calin
C Guet. “Long Lived Transients in Gene Regulation.” Theoretical Computer Science.
Elsevier, 2021. https://doi.org/10.1016/j.tcs.2021.05.023.
ieee: T. Petrov, C. Igler, A. Sezgin, T. A. Henzinger, and C. C. Guet, “Long lived
transients in gene regulation,” Theoretical Computer Science, vol. 893.
Elsevier, pp. 1–16, 2021.
ista: Petrov T, Igler C, Sezgin A, Henzinger TA, Guet CC. 2021. Long lived transients
in gene regulation. Theoretical Computer Science. 893, 1–16.
mla: Petrov, Tatjana, et al. “Long Lived Transients in Gene Regulation.” Theoretical
Computer Science, vol. 893, Elsevier, 2021, pp. 1–16, doi:10.1016/j.tcs.2021.05.023.
short: T. Petrov, C. Igler, A. Sezgin, T.A. Henzinger, C.C. Guet, Theoretical Computer
Science 893 (2021) 1–16.
corr_author: '1'
date_created: 2021-07-11T22:01:18Z
date_published: 2021-06-04T00:00:00Z
date_updated: 2025-04-15T06:25:56Z
day: '04'
ddc:
- '004'
department:
- _id: ToHe
- _id: CaGu
doi: 10.1016/j.tcs.2021.05.023
external_id:
isi:
- '000710180500002'
file:
- access_level: open_access
checksum: d3aef34cfb13e53bba4cf44d01680793
content_type: application/pdf
creator: dernst
date_created: 2022-05-12T12:13:27Z
date_updated: 2022-05-12T12:13:27Z
file_id: '11364'
file_name: 2021_TheoreticalComputerScience_Petrov.pdf
file_size: 2566504
relation: main_file
success: 1
file_date_updated: 2022-05-12T12:13:27Z
has_accepted_license: '1'
intvolume: ' 893'
isi: 1
language:
- iso: eng
month: '06'
oa: 1
oa_version: Published Version
page: 1-16
project:
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z211
name: Formal methods for the design and analysis of complex systems
publication: Theoretical Computer Science
publication_identifier:
issn:
- 0304-3975
publication_status: published
publisher: Elsevier
quality_controlled: '1'
scopus_import: '1'
status: public
title: Long lived transients in gene regulation
tmp:
image: /images/cc_by_nc_nd.png
legal_code_url: https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode
name: Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International
(CC BY-NC-ND 4.0)
short: CC BY-NC-ND (4.0)
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 893
year: '2021'
...
---
_id: '9656'
abstract:
- lang: eng
text: Tropisms, growth responses to environmental stimuli such as light or gravity,
are spectacular examples of adaptive plant development. The plant hormone auxin
serves as a major coordinative signal. The PIN auxin exporters, through their
dynamic polar subcellular localizations, redirect auxin fluxes in response to
environmental stimuli and the resulting auxin gradients across organs underly
differential cell elongation and bending. In this review, we discuss recent advances
concerning regulations of PIN polarity during tropisms, focusing on PIN phosphorylation
and trafficking. We also cover how environmental cues regulate PIN actions during
tropisms, and a crucial role of auxin feedback on PIN polarity during bending
termination. Finally, the interactions between different tropisms are reviewed
to understand plant adaptive growth in the natural environment.
acknowledgement: We are grateful to Lukas Fiedler, Alexandra Mally (IST Austria) and
Dr. Bartel Vanholme (VIB, Ghent) for their critical comments on the manuscript.
We apologize to those researchers whose great work was not cited. This work is supported
by the European Research Council under the European Union’s Horizon 2020 research
and innovation Programme (ERC grant agreement number 742985), and the Austrian Science
Fund (FWF, grant number I 3630-B25) to JF. HH is supported by the China Scholarship
Council (CSC scholarship, 201506870018) and a starting grant from Jiangxi Agriculture
University (9232308314).
article_processing_charge: Yes (via OA deal)
article_type: original
author:
- first_name: Huibin
full_name: Han, Huibin
id: 31435098-F248-11E8-B48F-1D18A9856A87
last_name: Han
- first_name: Maciek
full_name: Adamowski, Maciek
id: 45F536D2-F248-11E8-B48F-1D18A9856A87
last_name: Adamowski
orcid: 0000-0001-6463-5257
- first_name: Linlin
full_name: Qi, Linlin
id: 44B04502-A9ED-11E9-B6FC-583AE6697425
last_name: Qi
orcid: 0000-0001-5187-8401
- first_name: SS
full_name: Alotaibi, SS
last_name: Alotaibi
- first_name: Jiří
full_name: Friml, Jiří
id: 4159519E-F248-11E8-B48F-1D18A9856A87
last_name: Friml
orcid: 0000-0002-8302-7596
citation:
ama: Han H, Adamowski M, Qi L, Alotaibi S, Friml J. PIN-mediated polar auxin transport
regulations in plant tropic responses. New Phytologist. 2021;232(2):510-522.
doi:10.1111/nph.17617
apa: Han, H., Adamowski, M., Qi, L., Alotaibi, S., & Friml, J. (2021). PIN-mediated
polar auxin transport regulations in plant tropic responses. New Phytologist.
Wiley. https://doi.org/10.1111/nph.17617
chicago: Han, Huibin, Maciek Adamowski, Linlin Qi, SS Alotaibi, and Jiří Friml.
“PIN-Mediated Polar Auxin Transport Regulations in Plant Tropic Responses.” New
Phytologist. Wiley, 2021. https://doi.org/10.1111/nph.17617.
ieee: H. Han, M. Adamowski, L. Qi, S. Alotaibi, and J. Friml, “PIN-mediated polar
auxin transport regulations in plant tropic responses,” New Phytologist,
vol. 232, no. 2. Wiley, pp. 510–522, 2021.
ista: Han H, Adamowski M, Qi L, Alotaibi S, Friml J. 2021. PIN-mediated polar auxin
transport regulations in plant tropic responses. New Phytologist. 232(2), 510–522.
mla: Han, Huibin, et al. “PIN-Mediated Polar Auxin Transport Regulations in Plant
Tropic Responses.” New Phytologist, vol. 232, no. 2, Wiley, 2021, pp. 510–22,
doi:10.1111/nph.17617.
short: H. Han, M. Adamowski, L. Qi, S. Alotaibi, J. Friml, New Phytologist 232 (2021)
510–522.
corr_author: '1'
date_created: 2021-07-14T15:29:14Z
date_published: 2021-10-01T00:00:00Z
date_updated: 2025-04-14T07:45:00Z
day: '01'
ddc:
- '580'
department:
- _id: JiFr
doi: 10.1111/nph.17617
ec_funded: 1
external_id:
isi:
- '000680587100001'
pmid:
- '34254313'
file:
- access_level: open_access
checksum: 6422a6eb329b52d96279daaee0fcf189
content_type: application/pdf
creator: kschuh
date_created: 2021-10-07T13:42:47Z
date_updated: 2021-10-07T13:42:47Z
file_id: '10105'
file_name: 2021_NewPhytologist_Han.pdf
file_size: 1939800
relation: main_file
success: 1
file_date_updated: 2021-10-07T13:42:47Z
has_accepted_license: '1'
intvolume: ' 232'
isi: 1
issue: '2'
language:
- iso: eng
month: '10'
oa: 1
oa_version: Published Version
page: 510-522
pmid: 1
project:
- _id: 261099A6-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '742985'
name: Tracing Evolution of Auxin Transport and Polarity in Plants
- _id: 26538374-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: I03630
name: Molecular mechanisms of endocytic cargo recognition in plants
publication: New Phytologist
publication_identifier:
eissn:
- 1469-8137
issn:
- 0028-646x
publication_status: published
publisher: Wiley
quality_controlled: '1'
scopus_import: '1'
status: public
title: PIN-mediated polar auxin transport regulations in plant tropic responses
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: 232
year: '2021'
...
---
_id: '9657'
abstract:
- lang: eng
text: To overcome nitrogen deficiency, legume roots establish symbiotic interactions
with nitrogen-fixing rhizobia that is fostered in specialized organs (nodules).
Similar to other organs, nodule formation is determined by a local maximum of
the phytohormone auxin at the primordium site. However, how auxin regulates nodule
development remains poorly understood. Here, we found that in soybean, (Glycine
max), dynamic auxin transport driven by PIN-FORMED (PIN) transporter GmPIN1 is
involved in nodule primordium formation. GmPIN1 was specifically expressed in
nodule primordium cells and GmPIN1 was polarly localized in these cells. Two nodulation
regulators, (iso)flavonoids trigger expanded distribution of GmPIN1b to root cortical
cells, and cytokinin rearranges GmPIN1b polarity. Gmpin1abc triple mutants generated
with CRISPR-Cas9 showed impaired establishment of auxin maxima in nodule meristems
and aberrant divisions in the nodule primordium cells. Moreover, overexpression
of GmPIN1 suppressed nodule primordium initiation. GmPIN9d, an ortholog of Arabidopsis
thaliana PIN2, acts together with GmPIN1 later in nodule development to acropetally
transport auxin in vascular bundles, fine-tuning the auxin supply for nodule enlargement.
Our findings reveal how PIN-dependent auxin transport modulates different aspects
of soybean nodule development and suggest that establishment of auxin gradient
is a prerequisite for the proper interaction between legumes and rhizobia.
article_processing_charge: No
article_type: original
author:
- first_name: Z
full_name: Gao, Z
last_name: Gao
- first_name: Z
full_name: Chen, Z
last_name: Chen
- first_name: Y
full_name: Cui, Y
last_name: Cui
- first_name: M
full_name: Ke, M
last_name: Ke
- first_name: H
full_name: Xu, H
last_name: Xu
- first_name: Q
full_name: Xu, Q
last_name: Xu
- first_name: J
full_name: Chen, J
last_name: Chen
- first_name: Y
full_name: Li, Y
last_name: Li
- first_name: L
full_name: Huang, L
last_name: Huang
- first_name: H
full_name: Zhao, H
last_name: Zhao
- first_name: D
full_name: Huang, D
last_name: Huang
- first_name: S
full_name: Mai, S
last_name: Mai
- first_name: T
full_name: Xu, T
last_name: Xu
- first_name: X
full_name: Liu, X
last_name: Liu
- first_name: S
full_name: Li, S
last_name: Li
- first_name: Y
full_name: Guan, Y
last_name: Guan
- first_name: W
full_name: Yang, W
last_name: Yang
- first_name: Jiří
full_name: Friml, Jiří
id: 4159519E-F248-11E8-B48F-1D18A9856A87
last_name: Friml
orcid: 0000-0002-8302-7596
- first_name: J
full_name: Petrášek, J
last_name: Petrášek
- first_name: J
full_name: Zhang, J
last_name: Zhang
- first_name: X
full_name: Chen, X
last_name: Chen
citation:
ama: Gao Z, Chen Z, Cui Y, et al. GmPIN-dependent polar auxin transport is involved
in soybean nodule development. Plant Cell. 2021;33(9):2981–3003. doi:10.1093/plcell/koab183
apa: Gao, Z., Chen, Z., Cui, Y., Ke, M., Xu, H., Xu, Q., … Chen, X. (2021). GmPIN-dependent
polar auxin transport is involved in soybean nodule development. Plant Cell.
American Society of Plant Biologists. https://doi.org/10.1093/plcell/koab183
chicago: Gao, Z, Z Chen, Y Cui, M Ke, H Xu, Q Xu, J Chen, et al. “GmPIN-Dependent
Polar Auxin Transport Is Involved in Soybean Nodule Development.” Plant Cell.
American Society of Plant Biologists, 2021. https://doi.org/10.1093/plcell/koab183.
ieee: Z. Gao et al., “GmPIN-dependent polar auxin transport is involved in
soybean nodule development,” Plant Cell, vol. 33, no. 9. American Society
of Plant Biologists, pp. 2981–3003, 2021.
ista: Gao Z, Chen Z, Cui Y, Ke M, Xu H, Xu Q, Chen J, Li Y, Huang L, Zhao H, Huang
D, Mai S, Xu T, Liu X, Li S, Guan Y, Yang W, Friml J, Petrášek J, Zhang J, Chen
X. 2021. GmPIN-dependent polar auxin transport is involved in soybean nodule development.
Plant Cell. 33(9), 2981–3003.
mla: Gao, Z., et al. “GmPIN-Dependent Polar Auxin Transport Is Involved in Soybean
Nodule Development.” Plant Cell, vol. 33, no. 9, American Society of Plant
Biologists, 2021, pp. 2981–3003, doi:10.1093/plcell/koab183.
short: Z. Gao, Z. Chen, Y. Cui, M. Ke, H. Xu, Q. Xu, J. Chen, Y. Li, L. Huang, H.
Zhao, D. Huang, S. Mai, T. Xu, X. Liu, S. Li, Y. Guan, W. Yang, J. Friml, J. Petrášek,
J. Zhang, X. Chen, Plant Cell 33 (2021) 2981–3003.
date_created: 2021-07-14T15:32:43Z
date_published: 2021-07-07T00:00:00Z
date_updated: 2024-10-21T06:02:03Z
day: '07'
ddc:
- '580'
department:
- _id: JiFr
doi: 10.1093/plcell/koab183
external_id:
isi:
- '000702165300012'
pmid:
- '34240197'
file:
- access_level: open_access
checksum: 6715712ec306c321f0204c817b7f8ae7
content_type: application/pdf
creator: cziletti
date_created: 2021-07-19T12:13:34Z
date_updated: 2021-07-19T12:13:34Z
file_id: '9691'
file_name: 2021_PlantCell_Gao.pdf
file_size: 10566921
relation: main_file
success: 1
file_date_updated: 2021-07-19T12:13:34Z
has_accepted_license: '1'
intvolume: ' 33'
isi: 1
issue: '9'
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
page: 2981–3003
pmid: 1
publication: Plant Cell
publication_identifier:
eissn:
- 1532-298x
issn:
- 1040-4651
publication_status: published
publisher: American Society of Plant Biologists
quality_controlled: '1'
scopus_import: '1'
status: public
title: GmPIN-dependent polar auxin transport is involved in soybean nodule development
tmp:
image: /images/cc_by_nc_nd.png
legal_code_url: https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode
name: Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International
(CC BY-NC-ND 4.0)
short: CC BY-NC-ND (4.0)
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 33
year: '2021'
...