---
_id: '9728'
abstract:
- lang: eng
text: "Most real-world flows are multiphase, yet we know little about them compared
to their single-phase counterparts. Multiphase flows are more difficult to investigate
as their dynamics occur in large parameter space and involve complex phenomena
such as preferential concentration, turbulence modulation, non-Newtonian rheology,
etc. Over the last few decades, experiments in particle-laden flows have taken
a back seat in favour of ever-improving computational resources. However, computers
are still not powerful enough to simulate a real-world fluid with millions of
finite-size particles. Experiments are essential not only because they offer a
reliable way to investigate real-world multiphase flows but also because they
serve to validate numerical studies and steer the research in a relevant direction.
In this work, we have experimentally investigated particle-laden flows in pipes,
and in particular, examined the effect of particles on the laminar-turbulent transition
and the drag scaling in turbulent flows.\r\n\r\nFor particle-laden pipe flows,
an earlier study [Matas et al., 2003] reported how the sub-critical (i.e., hysteretic)
transition that occurs via localised turbulent structures called puffs is affected
by the addition of particles. In this study, in addition to this known transition,
we found a super-critical transition to a globally fluctuating state with increasing
particle concentration. At the same time, the Newtonian-type transition via puffs
is delayed to larger Reynolds numbers. At an even higher concentration, only the
globally fluctuating state is found. The dynamics of particle-laden flows are
hence determined by two competing instabilities that give rise to three flow regimes:
Newtonian-type turbulence at low, a particle-induced globally fluctuating state
at high, and a coexistence state at intermediate concentrations.\r\n\r\nThe effect
of particles on turbulent drag is ambiguous, with studies reporting drag reduction,
no net change, and even drag increase. The ambiguity arises because, in addition
to particle concentration, particle shape, size, and density also affect the net
drag. Even similar particles might affect the flow dissimilarly in different Reynolds
number and concentration ranges. In the present study, we explored a wide range
of both Reynolds number and concentration, using spherical as well as cylindrical
particles. We found that the spherical particles do not reduce drag while the
cylindrical particles are drag-reducing within a specific Reynolds number interval.
The interval strongly depends on the particle concentration and the relative size
of the pipe and particles. Within this interval, the magnitude of drag reduction
reaches a maximum. These drag reduction maxima appear to fall onto a distinct
power-law curve irrespective of the pipe diameter and particle concentration,
and this curve can be considered as the maximum drag reduction asymptote for a
given fibre shape. Such an asymptote is well known for polymeric flows but had
not been identified for particle-laden flows prior to this work."
acknowledged_ssus:
- _id: M-Shop
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Nishchal
full_name: Agrawal, Nishchal
id: 469E6004-F248-11E8-B48F-1D18A9856A87
last_name: Agrawal
citation:
ama: Agrawal N. Transition to turbulence and drag reduction in particle-laden pipe
flows. 2021. doi:10.15479/at:ista:9728
apa: Agrawal, N. (2021). Transition to turbulence and drag reduction in particle-laden
pipe flows. Institute of Science and Technology Austria. https://doi.org/10.15479/at:ista:9728
chicago: Agrawal, Nishchal. “Transition to Turbulence and Drag Reduction in Particle-Laden
Pipe Flows.” Institute of Science and Technology Austria, 2021. https://doi.org/10.15479/at:ista:9728.
ieee: N. Agrawal, “Transition to turbulence and drag reduction in particle-laden
pipe flows,” Institute of Science and Technology Austria, 2021.
ista: Agrawal N. 2021. Transition to turbulence and drag reduction in particle-laden
pipe flows. Institute of Science and Technology Austria.
mla: Agrawal, Nishchal. Transition to Turbulence and Drag Reduction in Particle-Laden
Pipe Flows. Institute of Science and Technology Austria, 2021, doi:10.15479/at:ista:9728.
short: N. Agrawal, Transition to Turbulence and Drag Reduction in Particle-Laden
Pipe Flows, Institute of Science and Technology Austria, 2021.
date_created: 2021-07-27T13:40:30Z
date_published: 2021-07-29T00:00:00Z
date_updated: 2024-02-28T13:14:39Z
day: '29'
ddc:
- '532'
degree_awarded: PhD
department:
- _id: GradSch
- _id: BjHo
doi: 10.15479/at:ista:9728
file:
- access_level: closed
checksum: 77436be3563a90435024307b1b5ee7e8
content_type: application/x-zip-compressed
creator: nagrawal
date_created: 2021-07-28T13:32:02Z
date_updated: 2022-07-29T22:30:05Z
embargo_to: open_access
file_id: '9744'
file_name: Transition to Turbulence and Drag Reduction in Particle-Laden Pipe Flows.zip
file_size: 22859658
relation: source_file
- access_level: open_access
checksum: 72a891d7daba85445c29b868c22575ed
content_type: application/pdf
creator: nagrawal
date_created: 2021-07-28T13:32:05Z
date_updated: 2022-07-29T22:30:05Z
embargo: 2022-07-28
file_id: '9745'
file_name: Transition to Turbulence and Drag Reduction in Particle-Laden Pipe Flows.pdf
file_size: 18658048
relation: main_file
file_date_updated: 2022-07-29T22:30:05Z
has_accepted_license: '1'
keyword:
- Drag Reduction
- Transition to Turbulence
- Multiphase Flows
- particle Laden Flows
- Complex Flows
- Experiments
- Fluid Dynamics
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
page: '118'
publication_identifier:
issn:
- 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
related_material:
record:
- id: '6189'
relation: part_of_dissertation
status: public
status: public
supervisor:
- first_name: Björn
full_name: Hof, Björn
id: 3A374330-F248-11E8-B48F-1D18A9856A87
last_name: Hof
orcid: 0000-0003-2057-2754
title: Transition to turbulence and drag reduction in particle-laden pipe flows
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: dissertation
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
year: '2021'
...
---
_id: '10673'
abstract:
- lang: eng
text: We propose a neural information processing system obtained by re-purposing
the function of a biological neural circuit model to govern simulated and real-world
control tasks. Inspired by the structure of the nervous system of the soil-worm,
C. elegans, we introduce ordinary neural circuits (ONCs), defined as the model
of biological neural circuits reparameterized for the control of alternative tasks.
We first demonstrate that ONCs realize networks with higher maximum flow compared
to arbitrary wired networks. We then learn instances of ONCs to control a series
of robotic tasks, including the autonomous parking of a real-world rover robot.
For reconfiguration of the purpose of the neural circuit, we adopt a search-based
optimization algorithm. Ordinary neural circuits perform on par and, in some cases,
significantly surpass the performance of contemporary deep learning models. ONC
networks are compact, 77% sparser than their counterpart neural controllers, and
their neural dynamics are fully interpretable at the cell-level.
acknowledgement: "RH and RG are partially supported by Horizon-2020 ECSEL Project
grant No. 783163 (iDev40), Productive 4.0, and ATBMBFW CPS-IoT Ecosystem. ML was
supported in part by the Austrian Science Fund (FWF) under grant Z211-N23\r\n(Wittgenstein
Award). AA is supported by the National Science Foundation (NSF) Graduate Research
Fellowship\r\nProgram. RH and DR are partially supported by The Boeing Company and
JP Morgan Chase. This research work is\r\npartially drawn from the PhD dissertation
of RH.\r\n"
alternative_title:
- PMLR
article_processing_charge: No
author:
- first_name: Ramin
full_name: Hasani, Ramin
last_name: Hasani
- first_name: Mathias
full_name: Lechner, Mathias
id: 3DC22916-F248-11E8-B48F-1D18A9856A87
last_name: Lechner
- first_name: Alexander
full_name: Amini, Alexander
last_name: Amini
- first_name: Daniela
full_name: Rus, Daniela
last_name: Rus
- first_name: Radu
full_name: Grosu, Radu
last_name: Grosu
citation:
ama: 'Hasani R, Lechner M, Amini A, Rus D, Grosu R. A natural lottery ticket winner:
Reinforcement learning with ordinary neural circuits. In: Proceedings of the
37th International Conference on Machine Learning. PMLR. ; 2020:4082-4093.'
apa: 'Hasani, R., Lechner, M., Amini, A., Rus, D., & Grosu, R. (2020). A natural
lottery ticket winner: Reinforcement learning with ordinary neural circuits. In
Proceedings of the 37th International Conference on Machine Learning (pp.
4082–4093). Virtual.'
chicago: 'Hasani, Ramin, Mathias Lechner, Alexander Amini, Daniela Rus, and Radu
Grosu. “A Natural Lottery Ticket Winner: Reinforcement Learning with Ordinary
Neural Circuits.” In Proceedings of the 37th International Conference on Machine
Learning, 4082–93. PMLR, 2020.'
ieee: 'R. Hasani, M. Lechner, A. Amini, D. Rus, and R. Grosu, “A natural lottery
ticket winner: Reinforcement learning with ordinary neural circuits,” in Proceedings
of the 37th International Conference on Machine Learning, Virtual, 2020, pp.
4082–4093.'
ista: 'Hasani R, Lechner M, Amini A, Rus D, Grosu R. 2020. A natural lottery ticket
winner: Reinforcement learning with ordinary neural circuits. Proceedings of the
37th International Conference on Machine Learning. ML: Machine LearningPMLR, PMLR,
, 4082–4093.'
mla: 'Hasani, Ramin, et al. “A Natural Lottery Ticket Winner: Reinforcement Learning
with Ordinary Neural Circuits.” Proceedings of the 37th International Conference
on Machine Learning, 2020, pp. 4082–93.'
short: R. Hasani, M. Lechner, A. Amini, D. Rus, R. Grosu, in:, Proceedings of the
37th International Conference on Machine Learning, 2020, pp. 4082–4093.
conference:
end_date: 2020-07-18
location: Virtual
name: 'ML: Machine Learning'
start_date: 2020-07-12
date_created: 2022-01-25T15:50:34Z
date_published: 2020-01-01T00:00:00Z
date_updated: 2022-01-26T11:14:27Z
ddc:
- '000'
department:
- _id: GradSch
- _id: ToHe
file:
- access_level: open_access
checksum: c9a4a29161777fc1a89ef451c040e3b1
content_type: application/pdf
creator: cchlebak
date_created: 2022-01-26T11:08:51Z
date_updated: 2022-01-26T11:08:51Z
file_id: '10691'
file_name: 2020_PMLR_Hasani.pdf
file_size: 2329798
relation: main_file
success: 1
file_date_updated: 2022-01-26T11:08:51Z
has_accepted_license: '1'
language:
- iso: eng
license: https://creativecommons.org/licenses/by-nc-nd/3.0/
main_file_link:
- open_access: '1'
url: http://proceedings.mlr.press/v119/hasani20a.html
oa: 1
oa_version: Published Version
page: 4082-4093
project:
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z211
name: The Wittgenstein Prize
publication: Proceedings of the 37th International Conference on Machine Learning
publication_identifier:
issn:
- 2640-3498
publication_status: published
quality_controlled: '1'
scopus_import: '1'
series_title: PMLR
status: public
title: 'A natural lottery ticket winner: Reinforcement learning with ordinary neural
circuits'
tmp:
image: /images/cc_by_nc_nd.png
legal_code_url: https://creativecommons.org/licenses/by-nc-nd/3.0/legalcode
name: Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported (CC BY-NC-ND
3.0)
short: CC BY-NC-ND (3.0)
type: conference
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
year: '2020'
...
---
_id: '7272'
abstract:
- lang: eng
text: "Many systems rely on optimistic concurrent search trees for multi-core scalability.
In principle, optimistic trees have a simple performance story: searches are read-only
and so run in parallel, with writes to shared memory occurring only when modifying
the data structure. However, this paper shows that in practice, obtaining the
full performance benefits of optimistic search trees is not so simple.\r\n\r\nWe
focus on optimistic binary search trees (BSTs) and perform a detailed performance
analysis of 10 state-of-the-art BSTs on large scale x86-64 hardware, using both
microbenchmarks and an in-memory database system. We find and explain significant
unexpected performance differences between BSTs with similar tree structure and
search implementations, which we trace to subtle performance-degrading interactions
of BSTs with systems software and hardware subsystems. We further derive a prescriptive
approach to avoid this performance degradation, as well as algorithmic insights
on optimistic BST design. Our work underlines the gap between the theory and practice
of multi-core performance, and calls for further research to help bridge this
gap."
article_processing_charge: No
author:
- first_name: Maya
full_name: Arbel-Raviv, Maya
last_name: Arbel-Raviv
- first_name: Trevor A
full_name: Brown, Trevor A
id: 3569F0A0-F248-11E8-B48F-1D18A9856A87
last_name: Brown
- first_name: Adam
full_name: Morrison, Adam
last_name: Morrison
citation:
ama: 'Arbel-Raviv M, Brown TA, Morrison A. Getting to the root of concurrent binary
search tree performance. In: Proceedings of the 2018 USENIX Annual Technical
Conference. USENIX Association; 2020:295-306.'
apa: 'Arbel-Raviv, M., Brown, T. A., & Morrison, A. (2020). Getting to the root
of concurrent binary search tree performance. In Proceedings of the 2018 USENIX
Annual Technical Conference (pp. 295–306). Boston, MA, United States: USENIX
Association.'
chicago: Arbel-Raviv, Maya, Trevor A Brown, and Adam Morrison. “Getting to the Root
of Concurrent Binary Search Tree Performance.” In Proceedings of the 2018 USENIX
Annual Technical Conference, 295–306. USENIX Association, 2020.
ieee: M. Arbel-Raviv, T. A. Brown, and A. Morrison, “Getting to the root of concurrent
binary search tree performance,” in Proceedings of the 2018 USENIX Annual Technical
Conference, Boston, MA, United States, 2020, pp. 295–306.
ista: 'Arbel-Raviv M, Brown TA, Morrison A. 2020. Getting to the root of concurrent
binary search tree performance. Proceedings of the 2018 USENIX Annual Technical
Conference. USENIX: Annual Technical Conference, 295–306.'
mla: Arbel-Raviv, Maya, et al. “Getting to the Root of Concurrent Binary Search
Tree Performance.” Proceedings of the 2018 USENIX Annual Technical Conference,
USENIX Association, 2020, pp. 295–306.
short: M. Arbel-Raviv, T.A. Brown, A. Morrison, in:, Proceedings of the 2018 USENIX
Annual Technical Conference, USENIX Association, 2020, pp. 295–306.
conference:
end_date: 2018-07-13
location: Boston, MA, United States
name: 'USENIX: Annual Technical Conference'
start_date: 2018-07-11
date_created: 2020-01-14T07:27:08Z
date_published: 2020-01-01T00:00:00Z
date_updated: 2021-01-11T15:25:48Z
day: '01'
ddc:
- '000'
department:
- _id: DaAl
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://www.usenix.org/system/files/conference/atc18/atc18-arbel-raviv.pdf
month: '01'
oa: 1
oa_version: Published Version
page: 295-306
project:
- _id: 26450934-B435-11E9-9278-68D0E5697425
name: NSERC Postdoctoral fellowship
publication: Proceedings of the 2018 USENIX Annual Technical Conference
publication_identifier:
isbn:
- '9781939133021'
publication_status: published
publisher: USENIX Association
quality_controlled: '1'
scopus_import: '1'
status: public
title: Getting to the root of concurrent binary search tree performance
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2020'
...
---
_id: '7346'
abstract:
- lang: eng
text: 'The Price of Anarchy (PoA) is a well-established game-theoretic concept to
shed light on coordination issues arising in open distributed systems. Leaving
agents to selfishly optimize comes with the risk of ending up in sub-optimal states
(in terms of performance and/or costs), compared to a centralized system design.
However, the PoA relies on strong assumptions about agents'' rationality (e.g.,
resources and information) and interactions, whereas in many distributed systems
agents interact locally with bounded resources. They do so repeatedly over time
(in contrast to "one-shot games"), and their strategies may evolve. Using a more
realistic evolutionary game model, this paper introduces a realized evolutionary
Price of Anarchy (ePoA). The ePoA allows an exploration of equilibrium selection
in dynamic distributed systems with multiple equilibria, based on local interactions
of simple memoryless agents. Considering a fundamental game related to virus propagation
on networks, we present analytical bounds on the ePoA in basic network topologies
and for different strategy update dynamics. In particular, deriving stationary
distributions of the stochastic evolutionary process, we find that the Nash equilibria
are not always the most abundant states, and that different processes can feature
significant off-equilibrium behavior, leading to a significantly higher ePoA compared
to the PoA studied traditionally in the literature. '
alternative_title:
- LIPIcs
article_number: '21'
article_processing_charge: No
author:
- first_name: Laura
full_name: Schmid, Laura
id: 38B437DE-F248-11E8-B48F-1D18A9856A87
last_name: Schmid
orcid: 0000-0002-6978-7329
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Stefan
full_name: Schmid, Stefan
last_name: Schmid
citation:
ama: 'Schmid L, Chatterjee K, Schmid S. The evolutionary price of anarchy: Locally
bounded agents in a dynamic virus game. In: Proceedings of the 23rd International
Conference on Principles of Distributed Systems. Vol 153. Schloss Dagstuhl
- Leibniz-Zentrum für Informatik; 2020. doi:10.4230/LIPIcs.OPODIS.2019.21'
apa: 'Schmid, L., Chatterjee, K., & Schmid, S. (2020). The evolutionary price
of anarchy: Locally bounded agents in a dynamic virus game. In Proceedings
of the 23rd International Conference on Principles of Distributed Systems
(Vol. 153). Neuchâtel, Switzerland: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
https://doi.org/10.4230/LIPIcs.OPODIS.2019.21'
chicago: 'Schmid, Laura, Krishnendu Chatterjee, and Stefan Schmid. “The Evolutionary
Price of Anarchy: Locally Bounded Agents in a Dynamic Virus Game.” In Proceedings
of the 23rd International Conference on Principles of Distributed Systems,
Vol. 153. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. https://doi.org/10.4230/LIPIcs.OPODIS.2019.21.'
ieee: 'L. Schmid, K. Chatterjee, and S. Schmid, “The evolutionary price of anarchy:
Locally bounded agents in a dynamic virus game,” in Proceedings of the 23rd
International Conference on Principles of Distributed Systems, Neuchâtel,
Switzerland, 2020, vol. 153.'
ista: 'Schmid L, Chatterjee K, Schmid S. 2020. The evolutionary price of anarchy:
Locally bounded agents in a dynamic virus game. Proceedings of the 23rd International
Conference on Principles of Distributed Systems. OPODIS: International Conference
on Principles of Distributed Systems, LIPIcs, vol. 153, 21.'
mla: 'Schmid, Laura, et al. “The Evolutionary Price of Anarchy: Locally Bounded
Agents in a Dynamic Virus Game.” Proceedings of the 23rd International Conference
on Principles of Distributed Systems, vol. 153, 21, Schloss Dagstuhl - Leibniz-Zentrum
für Informatik, 2020, doi:10.4230/LIPIcs.OPODIS.2019.21.'
short: L. Schmid, K. Chatterjee, S. Schmid, in:, Proceedings of the 23rd International
Conference on Principles of Distributed Systems, Schloss Dagstuhl - Leibniz-Zentrum
für Informatik, 2020.
conference:
end_date: 2019-12-19
location: Neuchâtel, Switzerland
name: 'OPODIS: International Conference on Principles of Distributed Systems'
start_date: 2019-12-17
date_created: 2020-01-21T16:00:26Z
date_published: 2020-02-10T00:00:00Z
date_updated: 2023-02-23T13:05:49Z
day: '10'
ddc:
- '000'
department:
- _id: KrCh
doi: 10.4230/LIPIcs.OPODIS.2019.21
external_id:
arxiv:
- '1906.00110'
file:
- access_level: open_access
checksum: 9a91916ac2c21ab42458fcda39ef0b8d
content_type: application/pdf
creator: dernst
date_created: 2020-03-23T09:14:06Z
date_updated: 2020-07-14T12:47:56Z
file_id: '7608'
file_name: 2019_LIPIcS_Schmid.pdf
file_size: 630752
relation: main_file
file_date_updated: 2020-07-14T12:47:56Z
has_accepted_license: '1'
intvolume: ' 153'
language:
- iso: eng
month: '02'
oa: 1
oa_version: Preprint
project:
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
publication: Proceedings of the 23rd International Conference on Principles of Distributed
Systems
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'The evolutionary price of anarchy: Locally bounded agents in a dynamic virus
game'
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: 153
year: '2020'
...
---
_id: '7348'
abstract:
- lang: eng
text: 'The monitoring of event frequencies can be used to recognize behavioral anomalies,
to identify trends, and to deduce or discard hypotheses about the underlying system.
For example, the performance of a web server may be monitored based on the ratio
of the total count of requests from the least and most active clients. Exact frequency
monitoring, however, can be prohibitively expensive; in the above example it would
require as many counters as there are clients. In this paper, we propose the efficient
probabilistic monitoring of common frequency properties, including the mode (i.e.,
the most common event) and the median of an event sequence. We define a logic
to express composite frequency properties as a combination of atomic frequency
properties. Our main contribution is an algorithm that, under suitable probabilistic
assumptions, can be used to monitor these important frequency properties with
four counters, independent of the number of different events. Our algorithm samples
longer and longer subwords of an infinite event sequence. We prove the almost-sure
convergence of our algorithm by generalizing ergodic theory from increasing-length
prefixes to increasing-length subwords of an infinite sequence. A similar algorithm
could be used to learn a connected Markov chain of a given structure from observing
its outputs, to arbitrary precision, for a given confidence. '
alternative_title:
- LIPIcs
article_number: '20'
article_processing_charge: No
author:
- first_name: Thomas
full_name: Ferrere, Thomas
id: 40960E6E-F248-11E8-B48F-1D18A9856A87
last_name: Ferrere
orcid: 0000-0001-5199-3143
- 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: Bernhard
full_name: Kragl, Bernhard
id: 320FC952-F248-11E8-B48F-1D18A9856A87
last_name: Kragl
orcid: 0000-0001-7745-9117
citation:
ama: 'Ferrere T, Henzinger TA, Kragl B. Monitoring event frequencies. In: 28th
EACSL Annual Conference on Computer Science Logic. Vol 152. Schloss Dagstuhl
- Leibniz-Zentrum für Informatik; 2020. doi:10.4230/LIPIcs.CSL.2020.20'
apa: 'Ferrere, T., Henzinger, T. A., & Kragl, B. (2020). Monitoring event frequencies.
In 28th EACSL Annual Conference on Computer Science Logic (Vol. 152). Barcelona,
Spain: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.CSL.2020.20'
chicago: Ferrere, Thomas, Thomas A Henzinger, and Bernhard Kragl. “Monitoring Event
Frequencies.” In 28th EACSL Annual Conference on Computer Science Logic,
Vol. 152. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. https://doi.org/10.4230/LIPIcs.CSL.2020.20.
ieee: T. Ferrere, T. A. Henzinger, and B. Kragl, “Monitoring event frequencies,”
in 28th EACSL Annual Conference on Computer Science Logic, Barcelona, Spain,
2020, vol. 152.
ista: 'Ferrere T, Henzinger TA, Kragl B. 2020. Monitoring event frequencies. 28th
EACSL Annual Conference on Computer Science Logic. CSL: Computer Science Logic,
LIPIcs, vol. 152, 20.'
mla: Ferrere, Thomas, et al. “Monitoring Event Frequencies.” 28th EACSL Annual
Conference on Computer Science Logic, vol. 152, 20, Schloss Dagstuhl - Leibniz-Zentrum
für Informatik, 2020, doi:10.4230/LIPIcs.CSL.2020.20.
short: T. Ferrere, T.A. Henzinger, B. Kragl, in:, 28th EACSL Annual Conference on
Computer Science Logic, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020.
conference:
end_date: 2020-01-16
location: Barcelona, Spain
name: 'CSL: Computer Science Logic'
start_date: 2020-01-13
date_created: 2020-01-21T11:22:21Z
date_published: 2020-01-15T00:00:00Z
date_updated: 2021-01-12T08:13:12Z
day: '15'
ddc:
- '000'
department:
- _id: ToHe
doi: 10.4230/LIPIcs.CSL.2020.20
external_id:
arxiv:
- '1910.06097'
file:
- access_level: open_access
checksum: b9a691d658d075c6369d3304d17fb818
content_type: application/pdf
creator: bkragl
date_created: 2020-01-21T11:21:04Z
date_updated: 2020-07-14T12:47:56Z
file_id: '7349'
file_name: main.pdf
file_size: 617206
relation: main_file
file_date_updated: 2020-07-14T12:47:56Z
has_accepted_license: '1'
intvolume: ' 152'
language:
- iso: eng
month: '01'
oa: 1
oa_version: Published Version
project:
- _id: 25F2ACDE-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11402-N23
name: Rigorous Systems Engineering
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z211
name: The Wittgenstein Prize
publication: 28th EACSL Annual Conference on Computer Science Logic
publication_identifier:
isbn:
- '9783959771320'
issn:
- 1868-8969
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
quality_controlled: '1'
scopus_import: 1
status: public
title: Monitoring event frequencies
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: 152
year: '2020'
...
---
_id: '7567'
abstract:
- lang: eng
text: Coxeter triangulations are triangulations of Euclidean space based on a single
simplex. By this we mean that given an individual simplex we can recover the entire
triangulation of Euclidean space by inductively reflecting in the faces of the
simplex. In this paper we establish that the quality of the simplices in all Coxeter
triangulations is O(1/d−−√) of the quality of regular simplex. We further investigate
the Delaunay property for these triangulations. Moreover, we consider an extension
of the Delaunay property, namely protection, which is a measure of non-degeneracy
of a Delaunay triangulation. In particular, one family of Coxeter triangulations
achieves the protection O(1/d2). We conjecture that both bounds are optimal for
triangulations in Euclidean space.
article_processing_charge: Yes (via OA deal)
article_type: original
author:
- first_name: Aruni
full_name: Choudhary, Aruni
last_name: Choudhary
- first_name: Siargey
full_name: Kachanovich, Siargey
last_name: Kachanovich
- first_name: Mathijs
full_name: Wintraecken, Mathijs
id: 307CFBC8-F248-11E8-B48F-1D18A9856A87
last_name: Wintraecken
orcid: 0000-0002-7472-2220
citation:
ama: Choudhary A, Kachanovich S, Wintraecken M. Coxeter triangulations have good
quality. Mathematics in Computer Science. 2020;14:141-176. doi:10.1007/s11786-020-00461-5
apa: Choudhary, A., Kachanovich, S., & Wintraecken, M. (2020). Coxeter triangulations
have good quality. Mathematics in Computer Science. Springer Nature. https://doi.org/10.1007/s11786-020-00461-5
chicago: Choudhary, Aruni, Siargey Kachanovich, and Mathijs Wintraecken. “Coxeter
Triangulations Have Good Quality.” Mathematics in Computer Science. Springer
Nature, 2020. https://doi.org/10.1007/s11786-020-00461-5.
ieee: A. Choudhary, S. Kachanovich, and M. Wintraecken, “Coxeter triangulations
have good quality,” Mathematics in Computer Science, vol. 14. Springer
Nature, pp. 141–176, 2020.
ista: Choudhary A, Kachanovich S, Wintraecken M. 2020. Coxeter triangulations have
good quality. Mathematics in Computer Science. 14, 141–176.
mla: Choudhary, Aruni, et al. “Coxeter Triangulations Have Good Quality.” Mathematics
in Computer Science, vol. 14, Springer Nature, 2020, pp. 141–76, doi:10.1007/s11786-020-00461-5.
short: A. Choudhary, S. Kachanovich, M. Wintraecken, Mathematics in Computer Science
14 (2020) 141–176.
date_created: 2020-03-05T13:30:18Z
date_published: 2020-03-01T00:00:00Z
date_updated: 2021-01-12T08:14:13Z
day: '01'
ddc:
- '510'
department:
- _id: HeEd
doi: 10.1007/s11786-020-00461-5
ec_funded: 1
file:
- access_level: open_access
checksum: 1d145f3ab50ccee735983cb89236e609
content_type: application/pdf
creator: dernst
date_created: 2020-11-20T10:18:02Z
date_updated: 2020-11-20T10:18:02Z
file_id: '8783'
file_name: 2020_MathCompScie_Choudhary.pdf
file_size: 872275
relation: main_file
success: 1
file_date_updated: 2020-11-20T10:18:02Z
has_accepted_license: '1'
intvolume: ' 14'
language:
- iso: eng
month: '03'
oa: 1
oa_version: Published Version
page: 141-176
project:
- _id: B67AFEDC-15C9-11EA-A837-991A96BB2854
name: IST Austria Open Access Fund
- _id: 260C2330-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '754411'
name: ISTplus - Postdoctoral Fellowships
publication: Mathematics in Computer Science
publication_identifier:
eissn:
- 1661-8289
issn:
- 1661-8270
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Coxeter triangulations have good quality
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: 14
year: '2020'
...
---
_id: '7594'
abstract:
- lang: eng
text: The concept of the entanglement between spin and orbital degrees of freedom
plays a crucial role in our understanding of various phases and exotic ground
states in a broad class of materials, including orbitally ordered materials and
spin liquids. We investigate how the spin-orbital entanglement in a Mott insulator
depends on the value of the spin-orbit coupling of the relativistic origin. To
this end, we numerically diagonalize a one-dimensional spin-orbital model with
Kugel-Khomskii exchange interactions between spins and orbitals on different sites
supplemented by the on-site spin-orbit coupling. In the regime of small spin-orbit
coupling with regard to the spin-orbital exchange, the ground state to a large
extent resembles the one obtained in the limit of vanishing spin-orbit coupling.
On the other hand, for large spin-orbit coupling the ground state can, depending
on the model parameters, either still show negligible spin-orbital entanglement
or evolve to a highly spin-orbitally-entangled phase with completely distinct
properties that are described by an effective XXZ model. The presented results
suggest that (i) the spin-orbital entanglement may be induced by large on-site
spin-orbit coupling, as found in the 5d transition metal oxides, such as the iridates;
(ii) for Mott insulators with weak spin-orbit coupling of Ising type, such as,
e.g., the alkali hyperoxides, the effects of the spin-orbit coupling on the ground
state can, in the first order of perturbation theory, be neglected.
article_number: '013353'
article_processing_charge: No
article_type: original
author:
- first_name: Dorota
full_name: Gotfryd, Dorota
last_name: Gotfryd
- first_name: Ekaterina
full_name: Paerschke, Ekaterina
id: 8275014E-6063-11E9-9B7F-6338E6697425
last_name: Paerschke
orcid: 0000-0003-0853-8182
- first_name: Jiri
full_name: Chaloupka, Jiri
last_name: Chaloupka
- first_name: Andrzej M.
full_name: Oles, Andrzej M.
last_name: Oles
- first_name: Krzysztof
full_name: Wohlfeld, Krzysztof
last_name: Wohlfeld
citation:
ama: Gotfryd D, Paerschke E, Chaloupka J, Oles AM, Wohlfeld K. How spin-orbital
entanglement depends on the spin-orbit coupling in a Mott insulator. Physical
Review Research. 2020;2(1). doi:10.1103/PhysRevResearch.2.013353
apa: Gotfryd, D., Paerschke, E., Chaloupka, J., Oles, A. M., & Wohlfeld, K.
(2020). How spin-orbital entanglement depends on the spin-orbit coupling in a
Mott insulator. Physical Review Research. American Physical Society. https://doi.org/10.1103/PhysRevResearch.2.013353
chicago: Gotfryd, Dorota, Ekaterina Paerschke, Jiri Chaloupka, Andrzej M. Oles,
and Krzysztof Wohlfeld. “How Spin-Orbital Entanglement Depends on the Spin-Orbit
Coupling in a Mott Insulator.” Physical Review Research. American Physical
Society, 2020. https://doi.org/10.1103/PhysRevResearch.2.013353.
ieee: D. Gotfryd, E. Paerschke, J. Chaloupka, A. M. Oles, and K. Wohlfeld, “How
spin-orbital entanglement depends on the spin-orbit coupling in a Mott insulator,”
Physical Review Research, vol. 2, no. 1. American Physical Society, 2020.
ista: Gotfryd D, Paerschke E, Chaloupka J, Oles AM, Wohlfeld K. 2020. How spin-orbital
entanglement depends on the spin-orbit coupling in a Mott insulator. Physical
Review Research. 2(1), 013353.
mla: Gotfryd, Dorota, et al. “How Spin-Orbital Entanglement Depends on the Spin-Orbit
Coupling in a Mott Insulator.” Physical Review Research, vol. 2, no. 1,
013353, American Physical Society, 2020, doi:10.1103/PhysRevResearch.2.013353.
short: D. Gotfryd, E. Paerschke, J. Chaloupka, A.M. Oles, K. Wohlfeld, Physical
Review Research 2 (2020).
date_created: 2020-03-20T15:21:10Z
date_published: 2020-03-20T00:00:00Z
date_updated: 2021-01-12T08:14:23Z
day: '20'
ddc:
- '530'
department:
- _id: MiLe
doi: 10.1103/PhysRevResearch.2.013353
ec_funded: 1
file:
- access_level: open_access
checksum: 1be551fd5f5583635076017d7391ffdc
content_type: application/pdf
creator: dernst
date_created: 2020-03-23T10:18:38Z
date_updated: 2020-07-14T12:48:00Z
file_id: '7610'
file_name: 2020_PhysRevResearch_Gotfryd.pdf
file_size: 1436735
relation: main_file
file_date_updated: 2020-07-14T12:48:00Z
has_accepted_license: '1'
intvolume: ' 2'
issue: '1'
language:
- iso: eng
month: '03'
oa: 1
oa_version: Published Version
project:
- _id: 260C2330-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '754411'
name: ISTplus - Postdoctoral Fellowships
publication: Physical Review Research
publication_status: published
publisher: American Physical Society
quality_controlled: '1'
status: public
title: How spin-orbital entanglement depends on the spin-orbit coupling in a Mott
insulator
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: 2
year: '2020'
...
---
_id: '7605'
abstract:
- lang: eng
text: 'Union-Find (or Disjoint-Set Union) is one of the fundamental problems in
computer science; it has been well-studied from both theoretical and practical
perspectives in the sequential case. Recently, there has been mounting interest
in analyzing this problem in the concurrent scenario, and several asymptotically-efficient
algorithms have been proposed. Yet, to date, there is very little known about
the practical performance of concurrent Union-Find. This work addresses this gap.
We evaluate and analyze the performance of several concurrent Union-Find algorithms
and optimization strategies across a wide range of platforms (Intel, AMD, and
ARM) and workloads (social, random, and road networks, as well as integrations
into more complex algorithms). We first observe that, due to the limited computational
cost, the number of induced cache misses is the critical determining factor for
the performance of existing algorithms. We introduce new techniques to reduce
this cost by storing node priorities implicitly and by using plain reads and writes
in a way that does not affect the correctness of the algorithms. Finally, we show
that Union-Find implementations are an interesting application for Transactional
Memory (TM): one of the fastest algorithm variants we discovered is a sequential
one that uses coarse-grained locking with the lock elision optimization to reduce
synchronization cost and increase scalability. '
alternative_title:
- LIPIcs
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: Alexander
full_name: Fedorov, Alexander
last_name: Fedorov
- first_name: Nikita
full_name: Koval, Nikita
id: 2F4DB10C-F248-11E8-B48F-1D18A9856A87
last_name: Koval
citation:
ama: 'Alistarh D-A, Fedorov A, Koval N. In search of the fastest concurrent union-find
algorithm. In: 23rd International Conference on Principles of Distributed Systems.
Vol 153. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2020:15:1-15:16. doi:10.4230/LIPIcs.OPODIS.2019.15'
apa: 'Alistarh, D.-A., Fedorov, A., & Koval, N. (2020). In search of the fastest
concurrent union-find algorithm. In 23rd International Conference on Principles
of Distributed Systems (Vol. 153, p. 15:1-15:16). Neuchatal, Switzerland:
Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.OPODIS.2019.15'
chicago: Alistarh, Dan-Adrian, Alexander Fedorov, and Nikita Koval. “In Search of
the Fastest Concurrent Union-Find Algorithm.” In 23rd International Conference
on Principles of Distributed Systems, 153:15:1-15:16. Schloss Dagstuhl - Leibniz-Zentrum
für Informatik, 2020. https://doi.org/10.4230/LIPIcs.OPODIS.2019.15.
ieee: D.-A. Alistarh, A. Fedorov, and N. Koval, “In search of the fastest concurrent
union-find algorithm,” in 23rd International Conference on Principles of Distributed
Systems, Neuchatal, Switzerland, 2020, vol. 153, p. 15:1-15:16.
ista: 'Alistarh D-A, Fedorov A, Koval N. 2020. In search of the fastest concurrent
union-find algorithm. 23rd International Conference on Principles of Distributed
Systems. OPODIS: International Conference on Principles of Distributed Systems,
LIPIcs, vol. 153, 15:1-15:16.'
mla: Alistarh, Dan-Adrian, et al. “In Search of the Fastest Concurrent Union-Find
Algorithm.” 23rd International Conference on Principles of Distributed Systems,
vol. 153, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, p. 15:1-15:16,
doi:10.4230/LIPIcs.OPODIS.2019.15.
short: D.-A. Alistarh, A. Fedorov, N. Koval, in:, 23rd International Conference
on Principles of Distributed Systems, Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
2020, p. 15:1-15:16.
conference:
end_date: 2019-12-19
location: Neuchatal, Switzerland
name: 'OPODIS: International Conference on Principles of Distributed Systems'
start_date: 2019-12-17
date_created: 2020-03-22T23:00:46Z
date_published: 2020-02-01T00:00:00Z
date_updated: 2023-02-23T13:12:12Z
day: '01'
ddc:
- '000'
department:
- _id: DaAl
doi: 10.4230/LIPIcs.OPODIS.2019.15
external_id:
arxiv:
- '1911.06347'
file:
- access_level: open_access
checksum: d66f07ecb609d9f02433e39f80a447e9
content_type: application/pdf
creator: dernst
date_created: 2020-03-23T09:22:48Z
date_updated: 2020-07-14T12:48:01Z
file_id: '7609'
file_name: 2019_LIPIcs_Alistarh.pdf
file_size: 13074131
relation: main_file
file_date_updated: 2020-07-14T12:48:01Z
has_accepted_license: '1'
intvolume: ' 153'
language:
- iso: eng
license: https://creativecommons.org/licenses/by/3.0/
month: '02'
oa: 1
oa_version: Published Version
page: 15:1-15:16
publication: 23rd International Conference on Principles of Distributed Systems
publication_identifier:
isbn:
- '9783959771337'
issn:
- '18688969'
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
quality_controlled: '1'
scopus_import: '1'
status: public
title: In search of the fastest concurrent union-find algorithm
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/3.0/legalcode
name: Creative Commons Attribution 3.0 Unported (CC BY 3.0)
short: CC BY (3.0)
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 153
year: '2020'
...
---
_id: '7601'
abstract:
- lang: eng
text: Plasmodesmata (PD) are crucial structures for intercellular communication
in multicellular plants with remorins being their crucial plant-specific structural
and functional constituents. The PD biogenesis is an intriguing but poorly understood
process. By expressing an Arabidopsis remorin protein in mammalian cells, we have
reconstituted a PD-like filamentous structure, termed remorin filament (RF), connecting
neighboring cells physically and physiologically. Notably, RFs are capable of
transporting macromolecules intercellularly, in a way similar to plant PD. With
further super-resolution microscopic analysis and biochemical characterization,
we found that RFs are also composed of actin filaments, forming the core skeleton
structure, aligned with the remorin protein. This unique heterologous filamentous
structure might explain the molecular mechanism for remorin function as well as
PD construction. Furthermore, remorin protein exhibits a specific distribution
manner in the plasma membrane in mammalian cells, representing a lipid nanodomain,
depending on its lipid modification status. Our studies not only provide crucial
insights into the mechanism of PD biogenesis, but also uncovers unsuspected fundamental
mechanistic and evolutionary links between intercellular communication systems
of plants and animals.
article_processing_charge: No
author:
- first_name: Zhuang
full_name: Wei, Zhuang
last_name: Wei
- first_name: Shutang
full_name: Tan, Shutang
id: 2DE75584-F248-11E8-B48F-1D18A9856A87
last_name: Tan
orcid: 0000-0002-0471-8285
- first_name: Tao
full_name: Liu, Tao
last_name: Liu
- first_name: Yuan
full_name: Wu, Yuan
last_name: Wu
- first_name: Ji-Gang
full_name: Lei, Ji-Gang
last_name: Lei
- first_name: ZhengJun
full_name: Chen, ZhengJun
last_name: Chen
- first_name: Jiří
full_name: Friml, Jiří
id: 4159519E-F248-11E8-B48F-1D18A9856A87
last_name: Friml
orcid: 0000-0002-8302-7596
- first_name: Hong-Wei
full_name: Xue, Hong-Wei
last_name: Xue
- first_name: Kan
full_name: Liao, Kan
last_name: Liao
citation:
ama: Wei Z, Tan S, Liu T, et al. Plasmodesmata-like intercellular connections by
plant remorin in animal cells. bioRxiv. 2020. doi:10.1101/791137
apa: Wei, Z., Tan, S., Liu, T., Wu, Y., Lei, J.-G., Chen, Z., … Liao, K. (2020).
Plasmodesmata-like intercellular connections by plant remorin in animal cells.
bioRxiv. Cold Spring Harbor Laboratory. https://doi.org/10.1101/791137
chicago: Wei, Zhuang, Shutang Tan, Tao Liu, Yuan Wu, Ji-Gang Lei, ZhengJun Chen,
Jiří Friml, Hong-Wei Xue, and Kan Liao. “Plasmodesmata-like Intercellular Connections
by Plant Remorin in Animal Cells.” BioRxiv. Cold Spring Harbor Laboratory,
2020. https://doi.org/10.1101/791137.
ieee: Z. Wei et al., “Plasmodesmata-like intercellular connections by plant
remorin in animal cells,” bioRxiv. Cold Spring Harbor Laboratory, 2020.
ista: Wei Z, Tan S, Liu T, Wu Y, Lei J-G, Chen Z, Friml J, Xue H-W, Liao K. 2020.
Plasmodesmata-like intercellular connections by plant remorin in animal cells.
bioRxiv, 10.1101/791137.
mla: Wei, Zhuang, et al. “Plasmodesmata-like Intercellular Connections by Plant
Remorin in Animal Cells.” BioRxiv, Cold Spring Harbor Laboratory, 2020,
doi:10.1101/791137.
short: Z. Wei, S. Tan, T. Liu, Y. Wu, J.-G. Lei, Z. Chen, J. Friml, H.-W. Xue, K.
Liao, BioRxiv (2020).
date_created: 2020-03-21T16:34:42Z
date_published: 2020-02-19T00:00:00Z
date_updated: 2021-01-12T08:14:26Z
day: '19'
department:
- _id: JiFr
doi: 10.1101/791137
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1101/791137
month: '02'
oa: 1
oa_version: Preprint
page: '22'
publication: bioRxiv
publication_status: published
publisher: Cold Spring Harbor Laboratory
status: public
title: Plasmodesmata-like intercellular connections by plant remorin in animal cells
type: preprint
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2020'
...
---
_id: '7651'
abstract:
- lang: eng
text: The growth of snail shells can be described by simple mathematical rules.
Variation in a few parameters can explain much of the diversity of shell shapes
seen in nature. However, empirical studies of gastropod shell shape variation
typically use geometric morphometric approaches, which do not capture this growth
pattern. We have developed a way to infer a set of developmentally descriptive
shape parameters based on three-dimensional logarithmic helicospiral growth and
using landmarks from two-dimensional shell images as input. We demonstrate the
utility of this approach, and compare it to the geometric morphometric approach,
using a large set of Littorina saxatilis shells in which locally adapted populations
differ in shape. Our method can be modified easily to make it applicable to a
wide range of shell forms, which would allow for investigations of the similarities
and differences between and within many different species of gastropods.
article_number: '20190721'
article_processing_charge: No
article_type: original
author:
- first_name: J.
full_name: Larsson, J.
last_name: Larsson
- first_name: Anja M
full_name: Westram, Anja M
id: 3C147470-F248-11E8-B48F-1D18A9856A87
last_name: Westram
orcid: 0000-0003-1050-4969
- first_name: S.
full_name: Bengmark, S.
last_name: Bengmark
- first_name: T.
full_name: Lundh, T.
last_name: Lundh
- first_name: R. K.
full_name: Butlin, R. K.
last_name: Butlin
citation:
ama: Larsson J, Westram AM, Bengmark S, Lundh T, Butlin RK. A developmentally descriptive
method for quantifying shape in gastropod shells. Journal of The Royal Society
Interface. 2020;17(163). doi:10.1098/rsif.2019.0721
apa: Larsson, J., Westram, A. M., Bengmark, S., Lundh, T., & Butlin, R. K. (2020).
A developmentally descriptive method for quantifying shape in gastropod shells.
Journal of The Royal Society Interface. The Royal Society. https://doi.org/10.1098/rsif.2019.0721
chicago: Larsson, J., Anja M Westram, S. Bengmark, T. Lundh, and R. K. Butlin. “A
Developmentally Descriptive Method for Quantifying Shape in Gastropod Shells.”
Journal of The Royal Society Interface. The Royal Society, 2020. https://doi.org/10.1098/rsif.2019.0721.
ieee: J. Larsson, A. M. Westram, S. Bengmark, T. Lundh, and R. K. Butlin, “A developmentally
descriptive method for quantifying shape in gastropod shells,” Journal of The
Royal Society Interface, vol. 17, no. 163. The Royal Society, 2020.
ista: Larsson J, Westram AM, Bengmark S, Lundh T, Butlin RK. 2020. A developmentally
descriptive method for quantifying shape in gastropod shells. Journal of The Royal
Society Interface. 17(163), 20190721.
mla: Larsson, J., et al. “A Developmentally Descriptive Method for Quantifying Shape
in Gastropod Shells.” Journal of The Royal Society Interface, vol. 17,
no. 163, 20190721, The Royal Society, 2020, doi:10.1098/rsif.2019.0721.
short: J. Larsson, A.M. Westram, S. Bengmark, T. Lundh, R.K. Butlin, Journal of
The Royal Society Interface 17 (2020).
date_created: 2020-04-08T15:19:17Z
date_published: 2020-02-01T00:00:00Z
date_updated: 2021-01-12T08:14:41Z
day: '01'
ddc:
- '570'
department:
- _id: NiBa
doi: 10.1098/rsif.2019.0721
file:
- access_level: open_access
checksum: 4eb102304402f5c56432516b84df86d6
content_type: application/pdf
creator: dernst
date_created: 2020-04-14T12:31:16Z
date_updated: 2020-07-14T12:48:01Z
file_id: '7660'
file_name: 2020_JournRoyalSociety_Larsson.pdf
file_size: 1556190
relation: main_file
file_date_updated: 2020-07-14T12:48:01Z
has_accepted_license: '1'
intvolume: ' 17'
issue: '163'
language:
- iso: eng
month: '02'
oa: 1
oa_version: Published Version
publication: Journal of The Royal Society Interface
publication_identifier:
eissn:
- 1742-5662
issn:
- 1742-5689
publication_status: published
publisher: The Royal Society
quality_controlled: '1'
scopus_import: 1
status: public
title: A developmentally descriptive method for quantifying shape in gastropod shells
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: 17
year: '2020'
...
---
_id: '7803'
abstract:
- lang: eng
text: "We settle the complexity of the (Δ+1)-coloring and (Δ+1)-list coloring problems
in the CONGESTED CLIQUE model by presenting a simple deterministic algorithm for
both problems running in a constant number of rounds. This matches the complexity
of the recent breakthrough randomized constant-round (Δ+1)-list coloring algorithm
due to Chang et al. (PODC'19), and significantly improves upon the state-of-the-art
O(logΔ)-round deterministic (Δ+1)-coloring bound of Parter (ICALP'18).\r\nA remarkable
property of our algorithm is its simplicity. Whereas the state-of-the-art randomized
algorithms for this problem are based on the quite involved local coloring algorithm
of Chang et al. (STOC'18), our algorithm can be described in just a few lines.
At a high level, it applies a careful derandomization of a recursive procedure
which partitions the nodes and their respective palettes into separate bins. We
show that after O(1) recursion steps, the remaining uncolored subgraph within
each bin has linear size, and thus can be solved locally by collecting it to a
single node. This algorithm can also be implemented in the Massively Parallel
Computation (MPC) model provided that each machine has linear (in n, the number
of nodes in the input graph) space.\r\nWe also show an extension of our algorithm
to the MPC regime in which machines have sublinear space: we present the first
deterministic (Δ+1)-list coloring algorithm designed for sublinear-space MPC,
which runs in O(logΔ+loglogn) rounds."
article_processing_charge: No
author:
- first_name: Artur
full_name: Czumaj, Artur
last_name: Czumaj
orcid: 0000-0002-5646-9524
- first_name: Peter
full_name: Davies, Peter
id: 11396234-BB50-11E9-B24C-90FCE5697425
last_name: Davies
orcid: 0000-0002-5646-9524
- first_name: Merav
full_name: Parter, Merav
last_name: Parter
citation:
ama: 'Czumaj A, Davies P, Parter M. Simple, deterministic, constant-round coloring
in the congested clique. In: Proceedings of the 2020 ACM Symposium on Principles
of Distributed Computing. Association for Computing Machinery; 2020:309-318.
doi:10.1145/3382734.3405751'
apa: 'Czumaj, A., Davies, P., & Parter, M. (2020). Simple, deterministic, constant-round
coloring in the congested clique. In Proceedings of the 2020 ACM Symposium
on Principles of Distributed Computing (pp. 309–318). Salerno, Italy: Association
for Computing Machinery. https://doi.org/10.1145/3382734.3405751'
chicago: Czumaj, Artur, Peter Davies, and Merav Parter. “Simple, Deterministic,
Constant-Round Coloring in the Congested Clique.” In Proceedings of the 2020
ACM Symposium on Principles of Distributed Computing, 309–18. Association
for Computing Machinery, 2020. https://doi.org/10.1145/3382734.3405751.
ieee: A. Czumaj, P. Davies, and M. Parter, “Simple, deterministic, constant-round
coloring in the congested clique,” in Proceedings of the 2020 ACM Symposium
on Principles of Distributed Computing, Salerno, Italy, 2020, pp. 309–318.
ista: 'Czumaj A, Davies P, Parter M. 2020. Simple, deterministic, constant-round
coloring in the congested clique. Proceedings of the 2020 ACM Symposium on Principles
of Distributed Computing. PODC: Symposium on Principles of Distributed Computing,
309–318.'
mla: Czumaj, Artur, et al. “Simple, Deterministic, Constant-Round Coloring in the
Congested Clique.” Proceedings of the 2020 ACM Symposium on Principles of Distributed
Computing, Association for Computing Machinery, 2020, pp. 309–18, doi:10.1145/3382734.3405751.
short: A. Czumaj, P. Davies, M. Parter, in:, Proceedings of the 2020 ACM Symposium
on Principles of Distributed Computing, Association for Computing Machinery, 2020,
pp. 309–318.
conference:
end_date: 2020-08-07
location: Salerno, Italy
name: 'PODC: Symposium on Principles of Distributed Computing'
start_date: 2020-08-03
date_created: 2020-05-06T09:02:14Z
date_published: 2020-07-01T00:00:00Z
date_updated: 2021-01-12T08:15:37Z
day: '01'
ddc:
- '000'
department:
- _id: DaAl
doi: 10.1145/3382734.3405751
ec_funded: 1
external_id:
arxiv:
- '2009.06043'
file:
- access_level: open_access
checksum: 46fe4fc58a64eb04068115573f631d4c
content_type: application/pdf
creator: pdavies
date_created: 2020-10-08T08:17:36Z
date_updated: 2020-10-08T08:17:36Z
file_id: '8624'
file_name: ColoringArxiv.pdf
file_size: 520051
relation: main_file
success: 1
file_date_updated: 2020-10-08T08:17:36Z
has_accepted_license: '1'
language:
- iso: eng
month: '07'
oa: 1
oa_version: Submitted Version
page: 309-318
project:
- _id: 260C2330-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '754411'
name: ISTplus - Postdoctoral Fellowships
publication: Proceedings of the 2020 ACM Symposium on Principles of Distributed Computing
publication_status: published
publisher: Association for Computing Machinery
quality_controlled: '1'
status: public
title: Simple, deterministic, constant-round coloring in the congested clique
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2020'
...
---
_id: '7806'
abstract:
- lang: eng
text: "We consider the following decision problem EMBEDk→d in computational topology
(where k ≤ d are fixed positive integers): Given a finite simplicial complex K
of dimension k, does there exist a (piecewise-linear) embedding of K into ℝd?\r\nThe
special case EMBED1→2 is graph planarity, which is decidable in linear time, as
shown by Hopcroft and Tarjan. In higher dimensions, EMBED2→3 and EMBED3→3 are
known to be decidable (as well as NP-hard), and recent results of Čadek et al.
in computational homotopy theory, in combination with the classical Haefliger–Weber
theorem in geometric topology, imply that EMBEDk→d can be solved in polynomial
time for any fixed pair (k, d) of dimensions in the so-called metastable range
.\r\nHere, by contrast, we prove that EMBEDk→d is algorithmically undecidable
for almost all pairs of dimensions outside the metastable range, namely for .
This almost completely resolves the decidability vs. undecidability of EMBEDk→d
in higher dimensions and establishes a sharp dichotomy between polynomial-time
solvability and undecidability.\r\nOur result complements (and in a wide range
of dimensions strengthens) earlier results of Matoušek, Tancer, and the second
author, who showed that EMBEDk→d is undecidable for 4 ≤ k ϵ {d – 1, d}, and NP-hard
for all remaining pairs (k, d) outside the metastable range and satisfying d ≥
4."
article_processing_charge: No
author:
- first_name: Marek
full_name: Filakovský, Marek
id: 3E8AF77E-F248-11E8-B48F-1D18A9856A87
last_name: Filakovský
- first_name: Uli
full_name: Wagner, Uli
id: 36690CA2-F248-11E8-B48F-1D18A9856A87
last_name: Wagner
orcid: 0000-0002-1494-0568
- first_name: Stephan Y
full_name: Zhechev, Stephan Y
id: 3AA52972-F248-11E8-B48F-1D18A9856A87
last_name: Zhechev
citation:
ama: 'Filakovský M, Wagner U, Zhechev SY. Embeddability of simplicial complexes
is undecidable. In: Proceedings of the Annual ACM-SIAM Symposium on Discrete
Algorithms. Vol 2020-January. SIAM; 2020:767-785. doi:10.1137/1.9781611975994.47'
apa: 'Filakovský, M., Wagner, U., & Zhechev, S. Y. (2020). Embeddability of
simplicial complexes is undecidable. In Proceedings of the Annual ACM-SIAM
Symposium on Discrete Algorithms (Vol. 2020–January, pp. 767–785). Salt Lake
City, UT, United States: SIAM. https://doi.org/10.1137/1.9781611975994.47'
chicago: Filakovský, Marek, Uli Wagner, and Stephan Y Zhechev. “Embeddability of
Simplicial Complexes Is Undecidable.” In Proceedings of the Annual ACM-SIAM
Symposium on Discrete Algorithms, 2020–January:767–85. SIAM, 2020. https://doi.org/10.1137/1.9781611975994.47.
ieee: M. Filakovský, U. Wagner, and S. Y. Zhechev, “Embeddability of simplicial
complexes is undecidable,” in Proceedings of the Annual ACM-SIAM Symposium
on Discrete Algorithms, Salt Lake City, UT, United States, 2020, vol. 2020–January,
pp. 767–785.
ista: 'Filakovský M, Wagner U, Zhechev SY. 2020. Embeddability of simplicial complexes
is undecidable. Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms.
SODA: Symposium on Discrete Algorithms vol. 2020–January, 767–785.'
mla: Filakovský, Marek, et al. “Embeddability of Simplicial Complexes Is Undecidable.”
Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, vol.
2020–January, SIAM, 2020, pp. 767–85, doi:10.1137/1.9781611975994.47.
short: M. Filakovský, U. Wagner, S.Y. Zhechev, in:, Proceedings of the Annual ACM-SIAM
Symposium on Discrete Algorithms, SIAM, 2020, pp. 767–785.
conference:
end_date: 2020-01-08
location: Salt Lake City, UT, United States
name: 'SODA: Symposium on Discrete Algorithms'
start_date: 2020-01-05
date_created: 2020-05-10T22:00:48Z
date_published: 2020-01-01T00:00:00Z
date_updated: 2021-01-12T08:15:38Z
day: '01'
department:
- _id: UlWa
doi: 10.1137/1.9781611975994.47
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1137/1.9781611975994.47
month: '01'
oa: 1
oa_version: Published Version
page: 767-785
project:
- _id: 26611F5C-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P31312
name: Algorithms for Embeddings and Homotopy Theory
publication: Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms
publication_identifier:
isbn:
- '9781611975994'
publication_status: published
publisher: SIAM
quality_controlled: '1'
scopus_import: 1
status: public
title: Embeddability of simplicial complexes is undecidable
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 2020-January
year: '2020'
...
---
_id: '7814'
abstract:
- lang: eng
text: 'Scientific research is to date largely restricted to wealthy laboratories
in developed nations due to the necessity of complex and expensive equipment.
This inequality limits the capacity of science to be used as a diplomatic channel.
Maker movements use open-source technologies including additive manufacturing
(3D printing) and laser cutting, together with low-cost computers for developing
novel products. This movement is setting the groundwork for a revolution, allowing
scientific equipment to be sourced at a fraction of the cost and has the potential
to increase the availability of equipment for scientists around the world. Science
education is increasingly recognized as another channel for science diplomacy.
In this perspective, we introduce the idea that the Maker movement and open-source
technologies have the potential to revolutionize science, technology, engineering
and mathematics (STEM) education worldwide. We present an open-source STEM didactic
tool called SCOPES (Sparking Curiosity through Open-source Platforms in Education
and Science). SCOPES is self-contained, independent of local resources, and cost-effective.
SCOPES can be adapted to communicate complex subjects from genetics to neurobiology,
perform real-world biological experiments and explore digitized scientific samples.
We envision such platforms will enhance science diplomacy by providing a means
for scientists to share their findings with classrooms and for educators to incorporate
didactic concepts into STEM lessons. By providing students the opportunity to
design, perform, and share scientific experiments, students also experience firsthand
the benefits of a multinational scientific community. We provide instructions
on how to build and use SCOPES on our webpage: http://scopeseducation.org.'
acknowledged_ssus:
- _id: Bio
- _id: LifeSc
- _id: PreCl
- _id: EM-Fac
article_number: '48'
article_processing_charge: No
article_type: original
author:
- first_name: Robert J
full_name: Beattie, Robert J
id: 2E26DF60-F248-11E8-B48F-1D18A9856A87
last_name: Beattie
orcid: 0000-0002-8483-8753
- first_name: Simon
full_name: Hippenmeyer, Simon
id: 37B36620-F248-11E8-B48F-1D18A9856A87
last_name: Hippenmeyer
orcid: 0000-0003-2279-1061
- first_name: Florian
full_name: Pauler, Florian
id: 48EA0138-F248-11E8-B48F-1D18A9856A87
last_name: Pauler
citation:
ama: 'Beattie RJ, Hippenmeyer S, Pauler F. SCOPES: Sparking curiosity through Open-Source
platforms in education and science. Frontiers in Education. 2020;5. doi:10.3389/feduc.2020.00048'
apa: 'Beattie, R. J., Hippenmeyer, S., & Pauler, F. (2020). SCOPES: Sparking
curiosity through Open-Source platforms in education and science. Frontiers
in Education. Frontiers Media. https://doi.org/10.3389/feduc.2020.00048'
chicago: 'Beattie, Robert J, Simon Hippenmeyer, and Florian Pauler. “SCOPES: Sparking
Curiosity through Open-Source Platforms in Education and Science.” Frontiers
in Education. Frontiers Media, 2020. https://doi.org/10.3389/feduc.2020.00048.'
ieee: 'R. J. Beattie, S. Hippenmeyer, and F. Pauler, “SCOPES: Sparking curiosity
through Open-Source platforms in education and science,” Frontiers in Education,
vol. 5. Frontiers Media, 2020.'
ista: 'Beattie RJ, Hippenmeyer S, Pauler F. 2020. SCOPES: Sparking curiosity through
Open-Source platforms in education and science. Frontiers in Education. 5, 48.'
mla: 'Beattie, Robert J., et al. “SCOPES: Sparking Curiosity through Open-Source
Platforms in Education and Science.” Frontiers in Education, vol. 5, 48,
Frontiers Media, 2020, doi:10.3389/feduc.2020.00048.'
short: R.J. Beattie, S. Hippenmeyer, F. Pauler, Frontiers in Education 5 (2020).
date_created: 2020-05-11T08:18:48Z
date_published: 2020-05-08T00:00:00Z
date_updated: 2021-01-12T08:15:42Z
day: '08'
ddc:
- '570'
department:
- _id: SiHi
doi: 10.3389/feduc.2020.00048
ec_funded: 1
file:
- access_level: open_access
checksum: a24ec24e38d843341ae620ec76c53688
content_type: application/pdf
creator: dernst
date_created: 2020-05-11T11:34:08Z
date_updated: 2020-07-14T12:48:03Z
file_id: '7818'
file_name: 2020_FrontiersEduc_Beattie.pdf
file_size: 1402146
relation: main_file
file_date_updated: 2020-07-14T12:48:03Z
has_accepted_license: '1'
intvolume: ' 5'
language:
- iso: eng
month: '05'
oa: 1
oa_version: Published Version
project:
- _id: 264E56E2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: M02416
name: Molecular Mechanisms Regulating Gliogenesis in the Cerebral Cortex
- _id: 260018B0-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '725780'
name: Principles of Neural Stem Cell Lineage Progression in Cerebral Cortex Development
publication: Frontiers in Education
publication_identifier:
issn:
- 2504-284X
publication_status: published
publisher: Frontiers Media
quality_controlled: '1'
status: public
title: 'SCOPES: Sparking curiosity through Open-Source platforms in education and
science'
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: 5
year: '2020'
...
---
_id: '7866'
abstract:
- lang: eng
text: In this paper, we establish convergence to equilibrium for a drift–diffusion–recombination
system modelling the charge transport within certain semiconductor devices. More
precisely, we consider a two-level system for electrons and holes which is augmented
by an intermediate energy level for electrons in so-called trapped states. The
recombination dynamics use the mass action principle by taking into account this
additional trap level. The main part of the paper is concerned with the derivation
of an entropy–entropy production inequality, which entails exponential convergence
to the equilibrium via the so-called entropy method. The novelty of our approach
lies in the fact that the entropy method is applied uniformly in a fast-reaction
parameter which governs the lifetime of electrons on the trap level. Thus, the
resulting decay estimate for the densities of electrons and holes extends to the
corresponding quasi-steady-state approximation.
acknowledgement: Open access funding provided by Austrian Science Fund (FWF). The
second author has been supported by the International Research Training Group IGDK
1754 “Optimization and Numerical Analysis for Partial Differential Equations with
Nonsmooth Structures”, funded by the German Research Council (DFG) and the Austrian
Science Fund (FWF) under grant number [W 1244-N18].
article_processing_charge: No
article_type: original
author:
- first_name: Klemens
full_name: Fellner, Klemens
last_name: Fellner
- first_name: Michael
full_name: Kniely, Michael
id: 2CA2C08C-F248-11E8-B48F-1D18A9856A87
last_name: Kniely
orcid: 0000-0001-5645-4333
citation:
ama: Fellner K, Kniely M. Uniform convergence to equilibrium for a family of drift–diffusion
models with trap-assisted recombination and the limiting Shockley–Read–Hall model.
Journal of Elliptic and Parabolic Equations. 2020;6:529-598. doi:10.1007/s41808-020-00068-8
apa: Fellner, K., & Kniely, M. (2020). Uniform convergence to equilibrium for
a family of drift–diffusion models with trap-assisted recombination and the limiting
Shockley–Read–Hall model. Journal of Elliptic and Parabolic Equations.
Springer Nature. https://doi.org/10.1007/s41808-020-00068-8
chicago: Fellner, Klemens, and Michael Kniely. “Uniform Convergence to Equilibrium
for a Family of Drift–Diffusion Models with Trap-Assisted Recombination and the
Limiting Shockley–Read–Hall Model.” Journal of Elliptic and Parabolic Equations.
Springer Nature, 2020. https://doi.org/10.1007/s41808-020-00068-8.
ieee: K. Fellner and M. Kniely, “Uniform convergence to equilibrium for a family
of drift–diffusion models with trap-assisted recombination and the limiting Shockley–Read–Hall
model,” Journal of Elliptic and Parabolic Equations, vol. 6. Springer Nature,
pp. 529–598, 2020.
ista: Fellner K, Kniely M. 2020. Uniform convergence to equilibrium for a family
of drift–diffusion models with trap-assisted recombination and the limiting Shockley–Read–Hall
model. Journal of Elliptic and Parabolic Equations. 6, 529–598.
mla: Fellner, Klemens, and Michael Kniely. “Uniform Convergence to Equilibrium for
a Family of Drift–Diffusion Models with Trap-Assisted Recombination and the Limiting
Shockley–Read–Hall Model.” Journal of Elliptic and Parabolic Equations,
vol. 6, Springer Nature, 2020, pp. 529–98, doi:10.1007/s41808-020-00068-8.
short: K. Fellner, M. Kniely, Journal of Elliptic and Parabolic Equations 6 (2020)
529–598.
date_created: 2020-05-17T22:00:45Z
date_published: 2020-12-01T00:00:00Z
date_updated: 2021-01-12T08:15:47Z
day: '01'
ddc:
- '510'
department:
- _id: JuFi
doi: 10.1007/s41808-020-00068-8
file:
- access_level: open_access
checksum: 6bc6832caacddceee1471291e93dcf1d
content_type: application/pdf
creator: dernst
date_created: 2020-11-25T08:59:59Z
date_updated: 2020-11-25T08:59:59Z
file_id: '8802'
file_name: 2020_JourEllipticParabEquat_Fellner.pdf
file_size: 8408694
relation: main_file
success: 1
file_date_updated: 2020-11-25T08:59:59Z
has_accepted_license: '1'
intvolume: ' 6'
language:
- iso: eng
month: '12'
oa: 1
oa_version: Published Version
page: 529-598
project:
- _id: 3AC91DDA-15DF-11EA-824D-93A3E7B544D1
call_identifier: FWF
name: FWF Open Access Fund
publication: Journal of Elliptic and Parabolic Equations
publication_identifier:
eissn:
- '22969039'
issn:
- '22969020'
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Uniform convergence to equilibrium for a family of drift–diffusion models with
trap-assisted recombination and the limiting Shockley–Read–Hall model
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: 6
year: '2020'
...
---
_id: '7919'
abstract:
- lang: eng
text: We explore the time evolution of two impurities in a trapped one-dimensional
Bose gas that follows a change of the boson-impurity interaction. We study the
induced impurity-impurity interactions and their effect on the quench dynamics.
In particular, we report on the size of the impurity cloud, the impurity-impurity
entanglement, and the impurity-impurity correlation function. The presented numerical
simulations are based upon the variational multilayer multiconfiguration time-dependent
Hartree method for bosons. To analyze and quantify induced impurity-impurity correlations,
we employ an effective two-body Hamiltonian with a contact interaction. We show
that the effective model consistent with the mean-field attraction of two heavy
impurities explains qualitatively our results for weak interactions. Our findings
suggest that the quench dynamics in cold-atom systems can be a tool for studying
impurity-impurity correlations.
article_number: '023154 '
article_processing_charge: No
article_type: original
author:
- first_name: S. I.
full_name: Mistakidis, S. I.
last_name: Mistakidis
- first_name: Artem
full_name: Volosniev, Artem
id: 37D278BC-F248-11E8-B48F-1D18A9856A87
last_name: Volosniev
orcid: 0000-0003-0393-5525
- first_name: P.
full_name: Schmelcher, P.
last_name: Schmelcher
citation:
ama: Mistakidis SI, Volosniev A, Schmelcher P. Induced correlations between impurities
in a one-dimensional quenched Bose gas. Physical Review Research. 2020;2.
doi:10.1103/physrevresearch.2.023154
apa: Mistakidis, S. I., Volosniev, A., & Schmelcher, P. (2020). Induced correlations
between impurities in a one-dimensional quenched Bose gas. Physical Review
Research. American Physical Society. https://doi.org/10.1103/physrevresearch.2.023154
chicago: Mistakidis, S. I., Artem Volosniev, and P. Schmelcher. “Induced Correlations
between Impurities in a One-Dimensional Quenched Bose Gas.” Physical Review
Research. American Physical Society, 2020. https://doi.org/10.1103/physrevresearch.2.023154.
ieee: S. I. Mistakidis, A. Volosniev, and P. Schmelcher, “Induced correlations between
impurities in a one-dimensional quenched Bose gas,” Physical Review Research,
vol. 2. American Physical Society, 2020.
ista: Mistakidis SI, Volosniev A, Schmelcher P. 2020. Induced correlations between
impurities in a one-dimensional quenched Bose gas. Physical Review Research. 2,
023154.
mla: Mistakidis, S. I., et al. “Induced Correlations between Impurities in a One-Dimensional
Quenched Bose Gas.” Physical Review Research, vol. 2, 023154, American
Physical Society, 2020, doi:10.1103/physrevresearch.2.023154.
short: S.I. Mistakidis, A. Volosniev, P. Schmelcher, Physical Review Research 2
(2020).
date_created: 2020-06-03T11:30:10Z
date_published: 2020-05-11T00:00:00Z
date_updated: 2023-02-23T13:20:16Z
day: '11'
ddc:
- '530'
department:
- _id: MiLe
doi: 10.1103/physrevresearch.2.023154
ec_funded: 1
file:
- access_level: open_access
checksum: e1c362fe094d6b246b3cd4a49722e78b
content_type: application/pdf
creator: dernst
date_created: 2020-06-04T13:51:59Z
date_updated: 2020-07-14T12:48:05Z
file_id: '7926'
file_name: 2020_PhysRevResearch_Mistakidis.pdf
file_size: 1741098
relation: main_file
file_date_updated: 2020-07-14T12:48:05Z
has_accepted_license: '1'
intvolume: ' 2'
language:
- iso: eng
month: '05'
oa: 1
oa_version: Published Version
project:
- _id: 260C2330-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '754411'
name: ISTplus - Postdoctoral Fellowships
publication: Physical Review Research
publication_identifier:
issn:
- 2643-1564
publication_status: published
publisher: American Physical Society
quality_controlled: '1'
status: public
title: Induced correlations between impurities in a one-dimensional quenched Bose
gas
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: 2
year: '2020'
...
---
_id: '7991'
abstract:
- lang: eng
text: 'We define and study a discrete process that generalizes the convex-layer
decomposition of a planar point set. Our process, which we call homotopic curve
shortening (HCS), starts with a closed curve (which might self-intersect) in the
presence of a set P⊂ ℝ² of point obstacles, and evolves in discrete steps, where
each step consists of (1) taking shortcuts around the obstacles, and (2) reducing
the curve to its shortest homotopic equivalent. We find experimentally that, if
the initial curve is held fixed and P is chosen to be either a very fine regular
grid or a uniformly random point set, then HCS behaves at the limit like the affine
curve-shortening flow (ACSF). This connection between HCS and ACSF generalizes
the link between "grid peeling" and the ACSF observed by Eppstein et al. (2017),
which applied only to convex curves, and which was studied only for regular grids.
We prove that HCS satisfies some properties analogous to those of ACSF: HCS is
invariant under affine transformations, preserves convexity, and does not increase
the total absolute curvature. Furthermore, the number of self-intersections of
a curve, or intersections between two curves (appropriately defined), does not
increase. Finally, if the initial curve is simple, then the number of inflection
points (appropriately defined) does not increase.'
alternative_title:
- LIPIcs
article_number: 12:1 - 12:15
article_processing_charge: No
author:
- first_name: Sergey
full_name: Avvakumov, Sergey
id: 3827DAC8-F248-11E8-B48F-1D18A9856A87
last_name: Avvakumov
- first_name: Gabriel
full_name: Nivasch, Gabriel
last_name: Nivasch
citation:
ama: 'Avvakumov S, Nivasch G. Homotopic curve shortening and the affine curve-shortening
flow. In: 36th International Symposium on Computational Geometry. Vol 164.
Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2020. doi:10.4230/LIPIcs.SoCG.2020.12'
apa: 'Avvakumov, S., & Nivasch, G. (2020). Homotopic curve shortening and the
affine curve-shortening flow. In 36th International Symposium on Computational
Geometry (Vol. 164). Zürich, Switzerland: Schloss Dagstuhl - Leibniz-Zentrum
für Informatik. https://doi.org/10.4230/LIPIcs.SoCG.2020.12'
chicago: Avvakumov, Sergey, and Gabriel Nivasch. “Homotopic Curve Shortening and
the Affine Curve-Shortening Flow.” In 36th International Symposium on Computational
Geometry, Vol. 164. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020.
https://doi.org/10.4230/LIPIcs.SoCG.2020.12.
ieee: S. Avvakumov and G. Nivasch, “Homotopic curve shortening and the affine curve-shortening
flow,” in 36th International Symposium on Computational Geometry, Zürich,
Switzerland, 2020, vol. 164.
ista: 'Avvakumov S, Nivasch G. 2020. Homotopic curve shortening and the affine curve-shortening
flow. 36th International Symposium on Computational Geometry. SoCG: Symposium
on Computational Geometry, LIPIcs, vol. 164, 12:1-12:15.'
mla: Avvakumov, Sergey, and Gabriel Nivasch. “Homotopic Curve Shortening and the
Affine Curve-Shortening Flow.” 36th International Symposium on Computational
Geometry, vol. 164, 12:1-12:15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
2020, doi:10.4230/LIPIcs.SoCG.2020.12.
short: S. Avvakumov, G. Nivasch, in:, 36th International Symposium on Computational
Geometry, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020.
conference:
end_date: 2020-06-26
location: Zürich, Switzerland
name: 'SoCG: Symposium on Computational Geometry'
start_date: 2020-06-22
date_created: 2020-06-22T09:14:19Z
date_published: 2020-06-01T00:00:00Z
date_updated: 2021-01-12T08:16:23Z
day: '01'
ddc:
- '510'
department:
- _id: UlWa
doi: 10.4230/LIPIcs.SoCG.2020.12
external_id:
arxiv:
- '1909.00263'
file:
- access_level: open_access
checksum: 6872df6549142f709fb6354a1b2f2c06
content_type: application/pdf
creator: dernst
date_created: 2020-06-23T11:13:49Z
date_updated: 2020-07-14T12:48:06Z
file_id: '8007'
file_name: 2020_LIPIcsSoCG_Avvakumov.pdf
file_size: 575896
relation: main_file
file_date_updated: 2020-07-14T12:48:06Z
has_accepted_license: '1'
intvolume: ' 164'
language:
- iso: eng
month: '06'
oa: 1
oa_version: Published Version
project:
- _id: 26611F5C-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P31312
name: Algorithms for Embeddings and Homotopy Theory
publication: 36th International Symposium on Computational Geometry
publication_identifier:
isbn:
- '9783959771436'
issn:
- '18688969'
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
quality_controlled: '1'
scopus_import: '1'
status: public
title: Homotopic curve shortening and the affine curve-shortening flow
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/3.0/legalcode
name: Creative Commons Attribution 3.0 Unported (CC BY 3.0)
short: CC BY (3.0)
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 164
year: '2020'
...
---
_id: '7989'
abstract:
- lang: eng
text: 'We prove general topological Radon-type theorems for sets in ℝ^d, smooth
real manifolds or finite dimensional simplicial complexes. Combined with a recent
result of Holmsen and Lee, it gives fractional Helly theorem, and consequently
the existence of weak ε-nets as well as a (p,q)-theorem. More precisely: Let X
be either ℝ^d, smooth real d-manifold, or a finite d-dimensional simplicial complex.
Then if F is a finite, intersection-closed family of sets in X such that the ith
reduced Betti number (with ℤ₂ coefficients) of any set in F is at most b for every
non-negative integer i less or equal to k, then the Radon number of F is bounded
in terms of b and X. Here k is the smallest integer larger or equal to d/2 - 1
if X = ℝ^d; k=d-1 if X is a smooth real d-manifold and not a surface, k=0 if X
is a surface and k=d if X is a d-dimensional simplicial complex. Using the recent
result of the author and Kalai, we manage to prove the following optimal bound
on fractional Helly number for families of open sets in a surface: Let F be a
finite family of open sets in a surface S such that the intersection of any subfamily
of F is either empty, or path-connected. Then the fractional Helly number of F
is at most three. This also settles a conjecture of Holmsen, Kim, and Lee about
an existence of a (p,q)-theorem for open subsets of a surface.'
alternative_title:
- LIPIcs
article_number: 61:1-61:13
article_processing_charge: No
author:
- first_name: Zuzana
full_name: Patakova, Zuzana
id: 48B57058-F248-11E8-B48F-1D18A9856A87
last_name: Patakova
orcid: 0000-0002-3975-1683
citation:
ama: 'Patakova Z. Bounding radon number via Betti numbers. In: 36th International
Symposium on Computational Geometry. Vol 164. Schloss Dagstuhl - Leibniz-Zentrum
für Informatik; 2020. doi:10.4230/LIPIcs.SoCG.2020.61'
apa: 'Patakova, Z. (2020). Bounding radon number via Betti numbers. In 36th International
Symposium on Computational Geometry (Vol. 164). Zürich, Switzerland: Schloss
Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.SoCG.2020.61'
chicago: Patakova, Zuzana. “Bounding Radon Number via Betti Numbers.” In 36th
International Symposium on Computational Geometry, Vol. 164. Schloss Dagstuhl
- Leibniz-Zentrum für Informatik, 2020. https://doi.org/10.4230/LIPIcs.SoCG.2020.61.
ieee: Z. Patakova, “Bounding radon number via Betti numbers,” in 36th International
Symposium on Computational Geometry, Zürich, Switzerland, 2020, vol. 164.
ista: 'Patakova Z. 2020. Bounding radon number via Betti numbers. 36th International
Symposium on Computational Geometry. SoCG: Symposium on Computational Geometry,
LIPIcs, vol. 164, 61:1-61:13.'
mla: Patakova, Zuzana. “Bounding Radon Number via Betti Numbers.” 36th International
Symposium on Computational Geometry, vol. 164, 61:1-61:13, Schloss Dagstuhl
- Leibniz-Zentrum für Informatik, 2020, doi:10.4230/LIPIcs.SoCG.2020.61.
short: Z. Patakova, in:, 36th International Symposium on Computational Geometry,
Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020.
conference:
end_date: 2020-06-26
location: Zürich, Switzerland
name: 'SoCG: Symposium on Computational Geometry'
start_date: 2020-06-22
date_created: 2020-06-22T09:14:18Z
date_published: 2020-06-01T00:00:00Z
date_updated: 2021-01-12T08:16:22Z
day: '01'
ddc:
- '510'
department:
- _id: UlWa
doi: 10.4230/LIPIcs.SoCG.2020.61
external_id:
arxiv:
- '1908.01677'
file:
- access_level: open_access
checksum: d0996ca5f6eb32ce955ce782b4f2afbe
content_type: application/pdf
creator: dernst
date_created: 2020-06-23T06:56:23Z
date_updated: 2020-07-14T12:48:06Z
file_id: '8005'
file_name: 2020_LIPIcsSoCG_Patakova_61.pdf
file_size: 645421
relation: main_file
file_date_updated: 2020-07-14T12:48:06Z
has_accepted_license: '1'
intvolume: ' 164'
language:
- iso: eng
month: '06'
oa: 1
oa_version: Published Version
publication: 36th International Symposium on Computational Geometry
publication_identifier:
isbn:
- '9783959771436'
issn:
- '18688969'
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
quality_controlled: '1'
scopus_import: '1'
status: public
title: Bounding radon number via Betti numbers
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 164
year: '2020'
...
---
_id: '7992'
abstract:
- lang: eng
text: 'Let K be a convex body in ℝⁿ (i.e., a compact convex set with nonempty interior).
Given a point p in the interior of K, a hyperplane h passing through p is called
barycentric if p is the barycenter of K ∩ h. In 1961, Grünbaum raised the question
whether, for every K, there exists an interior point p through which there are
at least n+1 distinct barycentric hyperplanes. Two years later, this was seemingly
resolved affirmatively by showing that this is the case if p=p₀ is the point of
maximal depth in K. However, while working on a related question, we noticed that
one of the auxiliary claims in the proof is incorrect. Here, we provide a counterexample;
this re-opens Grünbaum’s question. It follows from known results that for n ≥
2, there are always at least three distinct barycentric cuts through the point
p₀ ∈ K of maximal depth. Using tools related to Morse theory we are able to improve
this bound: four distinct barycentric cuts through p₀ are guaranteed if n ≥ 3.'
alternative_title:
- LIPIcs
article_number: 62:1 - 62:16
article_processing_charge: No
author:
- first_name: Zuzana
full_name: Patakova, Zuzana
id: 48B57058-F248-11E8-B48F-1D18A9856A87
last_name: Patakova
orcid: 0000-0002-3975-1683
- first_name: Martin
full_name: Tancer, Martin
id: 38AC689C-F248-11E8-B48F-1D18A9856A87
last_name: Tancer
orcid: 0000-0002-1191-6714
- first_name: Uli
full_name: Wagner, Uli
id: 36690CA2-F248-11E8-B48F-1D18A9856A87
last_name: Wagner
orcid: 0000-0002-1494-0568
citation:
ama: 'Patakova Z, Tancer M, Wagner U. Barycentric cuts through a convex body. In:
36th International Symposium on Computational Geometry. Vol 164. Schloss
Dagstuhl - Leibniz-Zentrum für Informatik; 2020. doi:10.4230/LIPIcs.SoCG.2020.62'
apa: 'Patakova, Z., Tancer, M., & Wagner, U. (2020). Barycentric cuts through
a convex body. In 36th International Symposium on Computational Geometry
(Vol. 164). Zürich, Switzerland: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
https://doi.org/10.4230/LIPIcs.SoCG.2020.62'
chicago: Patakova, Zuzana, Martin Tancer, and Uli Wagner. “Barycentric Cuts through
a Convex Body.” In 36th International Symposium on Computational Geometry,
Vol. 164. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. https://doi.org/10.4230/LIPIcs.SoCG.2020.62.
ieee: Z. Patakova, M. Tancer, and U. Wagner, “Barycentric cuts through a convex
body,” in 36th International Symposium on Computational Geometry, Zürich,
Switzerland, 2020, vol. 164.
ista: 'Patakova Z, Tancer M, Wagner U. 2020. Barycentric cuts through a convex body.
36th International Symposium on Computational Geometry. SoCG: Symposium on Computational
Geometry, LIPIcs, vol. 164, 62:1-62:16.'
mla: Patakova, Zuzana, et al. “Barycentric Cuts through a Convex Body.” 36th
International Symposium on Computational Geometry, vol. 164, 62:1-62:16, Schloss
Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:10.4230/LIPIcs.SoCG.2020.62.
short: Z. Patakova, M. Tancer, U. Wagner, in:, 36th International Symposium on Computational
Geometry, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020.
conference:
end_date: 2020-06-26
location: Zürich, Switzerland
name: 'SoCG: Symposium on Computational Geometry'
start_date: 2020-06-22
date_created: 2020-06-22T09:14:20Z
date_published: 2020-06-01T00:00:00Z
date_updated: 2021-01-12T08:16:23Z
day: '01'
ddc:
- '510'
department:
- _id: UlWa
doi: 10.4230/LIPIcs.SoCG.2020.62
external_id:
arxiv:
- '2003.13536'
file:
- access_level: open_access
checksum: ce1c9194139a664fb59d1efdfc88eaae
content_type: application/pdf
creator: dernst
date_created: 2020-06-23T06:45:52Z
date_updated: 2020-07-14T12:48:06Z
file_id: '8004'
file_name: 2020_LIPIcsSoCG_Patakova.pdf
file_size: 750318
relation: main_file
file_date_updated: 2020-07-14T12:48:06Z
has_accepted_license: '1'
intvolume: ' 164'
language:
- iso: eng
month: '06'
oa: 1
oa_version: Published Version
publication: 36th International Symposium on Computational Geometry
publication_identifier:
isbn:
- '9783959771436'
issn:
- '18688969'
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
quality_controlled: '1'
scopus_import: 1
status: public
title: Barycentric cuts through a convex body
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 164
year: '2020'
...
---
_id: '7994'
abstract:
- lang: eng
text: In the recent study of crossing numbers, drawings of graphs that can be extended
to an arrangement of pseudolines (pseudolinear drawings) have played an important
role as they are a natural combinatorial extension of rectilinear (or straight-line)
drawings. A characterization of the pseudolinear drawings of K_n was found recently.
We extend this characterization to all graphs, by describing the set of minimal
forbidden subdrawings for pseudolinear drawings. Our characterization also leads
to a polynomial-time algorithm to recognize pseudolinear drawings and construct
the pseudolines when it is possible.
alternative_title:
- LIPIcs
article_number: 9:1 - 9:14
article_processing_charge: No
author:
- first_name: Alan M
full_name: Arroyo Guevara, Alan M
id: 3207FDC6-F248-11E8-B48F-1D18A9856A87
last_name: Arroyo Guevara
orcid: 0000-0003-2401-8670
- first_name: Julien
full_name: Bensmail, Julien
last_name: Bensmail
- first_name: R.
full_name: Bruce Richter, R.
last_name: Bruce Richter
citation:
ama: 'Arroyo Guevara AM, Bensmail J, Bruce Richter R. Extending drawings of graphs
to arrangements of pseudolines. In: 36th International Symposium on Computational
Geometry. Vol 164. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2020.
doi:10.4230/LIPIcs.SoCG.2020.9'
apa: 'Arroyo Guevara, A. M., Bensmail, J., & Bruce Richter, R. (2020). Extending
drawings of graphs to arrangements of pseudolines. In 36th International Symposium
on Computational Geometry (Vol. 164). Zürich, Switzerland: Schloss Dagstuhl
- Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.SoCG.2020.9'
chicago: Arroyo Guevara, Alan M, Julien Bensmail, and R. Bruce Richter. “Extending
Drawings of Graphs to Arrangements of Pseudolines.” In 36th International Symposium
on Computational Geometry, Vol. 164. Schloss Dagstuhl - Leibniz-Zentrum für
Informatik, 2020. https://doi.org/10.4230/LIPIcs.SoCG.2020.9.
ieee: A. M. Arroyo Guevara, J. Bensmail, and R. Bruce Richter, “Extending drawings
of graphs to arrangements of pseudolines,” in 36th International Symposium
on Computational Geometry, Zürich, Switzerland, 2020, vol. 164.
ista: 'Arroyo Guevara AM, Bensmail J, Bruce Richter R. 2020. Extending drawings
of graphs to arrangements of pseudolines. 36th International Symposium on Computational
Geometry. SoCG: Symposium on Computational Geometry, LIPIcs, vol. 164, 9:1-9:14.'
mla: Arroyo Guevara, Alan M., et al. “Extending Drawings of Graphs to Arrangements
of Pseudolines.” 36th International Symposium on Computational Geometry,
vol. 164, 9:1-9:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:10.4230/LIPIcs.SoCG.2020.9.
short: A.M. Arroyo Guevara, J. Bensmail, R. Bruce Richter, in:, 36th International
Symposium on Computational Geometry, Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
2020.
conference:
end_date: 2020-06-26
location: Zürich, Switzerland
name: 'SoCG: Symposium on Computational Geometry'
start_date: 2020-06-22
date_created: 2020-06-22T09:14:21Z
date_published: 2020-06-01T00:00:00Z
date_updated: 2023-02-23T13:22:12Z
day: '01'
ddc:
- '510'
department:
- _id: UlWa
doi: 10.4230/LIPIcs.SoCG.2020.9
ec_funded: 1
external_id:
arxiv:
- '1804.09317'
file:
- access_level: open_access
checksum: 93571b76cf97d5b7c8aabaeaa694dd7e
content_type: application/pdf
creator: dernst
date_created: 2020-06-23T11:06:23Z
date_updated: 2020-07-14T12:48:06Z
file_id: '8006'
file_name: 2020_LIPIcsSoCG_Arroyo.pdf
file_size: 592661
relation: main_file
file_date_updated: 2020-07-14T12:48:06Z
has_accepted_license: '1'
intvolume: ' 164'
language:
- iso: eng
month: '06'
oa: 1
oa_version: Published Version
project:
- _id: 260C2330-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '754411'
name: ISTplus - Postdoctoral Fellowships
publication: 36th International Symposium on Computational Geometry
publication_identifier:
isbn:
- '9783959771436'
issn:
- '18688969'
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
quality_controlled: '1'
scopus_import: '1'
status: public
title: Extending drawings of graphs to arrangements of pseudolines
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 164
year: '2020'
...
---
_id: '8011'
abstract:
- lang: eng
text: 'Relaxation to a thermal state is the inevitable fate of nonequilibrium interacting
quantum systems without special conservation laws. While thermalization in one-dimensional
systems can often be suppressed by integrability mechanisms, in two spatial dimensions
thermalization is expected to be far more effective due to the increased phase
space. In this work we propose a general framework for escaping or delaying the
emergence of the thermal state in two-dimensional arrays of Rydberg atoms via
the mechanism of quantum scars, i.e., initial states that fail to thermalize.
The suppression of thermalization is achieved in two complementary ways: by adding
local perturbations or by adjusting the driving Rabi frequency according to the
local connectivity of the lattice. We demonstrate that these mechanisms allow
us to realize robust quantum scars in various two-dimensional lattices, including
decorated lattices with nonconstant connectivity. In particular, we show that
a small decrease of the Rabi frequency at the corners of the lattice is crucial
for mitigating the strong boundary effects in two-dimensional systems. Our results
identify synchronization as an important tool for future experiments on two-dimensional
quantum scars.'
article_number: '022065'
article_processing_charge: No
article_type: original
author:
- first_name: Alexios
full_name: Michailidis, Alexios
id: 36EBAD38-F248-11E8-B48F-1D18A9856A87
last_name: Michailidis
- first_name: C. J.
full_name: Turner, C. J.
last_name: Turner
- first_name: Z.
full_name: Papić, Z.
last_name: Papić
- first_name: D. A.
full_name: Abanin, D. A.
last_name: Abanin
- first_name: Maksym
full_name: Serbyn, Maksym
id: 47809E7E-F248-11E8-B48F-1D18A9856A87
last_name: Serbyn
orcid: 0000-0002-2399-5827
citation:
ama: Michailidis A, Turner CJ, Papić Z, Abanin DA, Serbyn M. Stabilizing two-dimensional
quantum scars by deformation and synchronization. Physical Review Research.
2020;2(2). doi:10.1103/physrevresearch.2.022065
apa: Michailidis, A., Turner, C. J., Papić, Z., Abanin, D. A., & Serbyn, M.
(2020). Stabilizing two-dimensional quantum scars by deformation and synchronization.
Physical Review Research. American Physical Society. https://doi.org/10.1103/physrevresearch.2.022065
chicago: Michailidis, Alexios, C. J. Turner, Z. Papić, D. A. Abanin, and Maksym
Serbyn. “Stabilizing Two-Dimensional Quantum Scars by Deformation and Synchronization.”
Physical Review Research. American Physical Society, 2020. https://doi.org/10.1103/physrevresearch.2.022065.
ieee: A. Michailidis, C. J. Turner, Z. Papić, D. A. Abanin, and M. Serbyn, “Stabilizing
two-dimensional quantum scars by deformation and synchronization,” Physical
Review Research, vol. 2, no. 2. American Physical Society, 2020.
ista: Michailidis A, Turner CJ, Papić Z, Abanin DA, Serbyn M. 2020. Stabilizing
two-dimensional quantum scars by deformation and synchronization. Physical Review
Research. 2(2), 022065.
mla: Michailidis, Alexios, et al. “Stabilizing Two-Dimensional Quantum Scars by
Deformation and Synchronization.” Physical Review Research, vol. 2, no.
2, 022065, American Physical Society, 2020, doi:10.1103/physrevresearch.2.022065.
short: A. Michailidis, C.J. Turner, Z. Papić, D.A. Abanin, M. Serbyn, Physical Review
Research 2 (2020).
date_created: 2020-06-23T12:00:19Z
date_published: 2020-06-22T00:00:00Z
date_updated: 2021-01-12T08:16:30Z
day: '22'
ddc:
- '530'
department:
- _id: MaSe
doi: 10.1103/physrevresearch.2.022065
ec_funded: 1
file:
- access_level: open_access
checksum: e6959dc8220f14a008d1933858795e6d
content_type: application/pdf
creator: dernst
date_created: 2020-06-29T14:41:27Z
date_updated: 2020-07-14T12:48:08Z
file_id: '8050'
file_name: 2020_PhysicalReviewResearch_Michailidis.pdf
file_size: 2066011
relation: main_file
file_date_updated: 2020-07-14T12:48:08Z
has_accepted_license: '1'
intvolume: ' 2'
issue: '2'
language:
- iso: eng
month: '06'
oa: 1
oa_version: Published Version
project:
- _id: 23841C26-32DE-11EA-91FC-C7463DDC885E
call_identifier: H2020
grant_number: '850899'
name: 'Non-Ergodic Quantum Matter: Universality, Dynamics and Control'
publication: Physical Review Research
publication_identifier:
issn:
- 2643-1564
publication_status: published
publisher: American Physical Society
quality_controlled: '1'
status: public
title: Stabilizing two-dimensional quantum scars by deformation and synchronization
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: 2
year: '2020'
...