---
_id: '5678'
abstract:
- lang: eng
text: "The order-k Voronoi tessellation of a locally finite set \U0001D44B⊆ℝ\U0001D45B
decomposes ℝ\U0001D45B into convex domains whose points have the same k nearest
neighbors in X. Assuming X is a stationary Poisson point process, we give explicit
formulas for the expected number and total area of faces of a given dimension
per unit volume of space. We also develop a relaxed version of discrete Morse
theory and generalize by counting only faces, for which the k nearest points in
X are within a given distance threshold."
article_processing_charge: Yes (via OA deal)
article_type: original
author:
- first_name: Herbert
full_name: Edelsbrunner, Herbert
id: 3FB178DA-F248-11E8-B48F-1D18A9856A87
last_name: Edelsbrunner
orcid: 0000-0002-9823-6833
- first_name: Anton
full_name: Nikitenko, Anton
id: 3E4FF1BA-F248-11E8-B48F-1D18A9856A87
last_name: Nikitenko
orcid: 0000-0002-0659-3201
citation:
ama: Edelsbrunner H, Nikitenko A. Poisson–Delaunay Mosaics of Order k. Discrete
and Computational Geometry. 2019;62(4):865–878. doi:10.1007/s00454-018-0049-2
apa: Edelsbrunner, H., & Nikitenko, A. (2019). Poisson–Delaunay Mosaics of Order
k. Discrete and Computational Geometry. Springer. https://doi.org/10.1007/s00454-018-0049-2
chicago: Edelsbrunner, Herbert, and Anton Nikitenko. “Poisson–Delaunay Mosaics of
Order K.” Discrete and Computational Geometry. Springer, 2019. https://doi.org/10.1007/s00454-018-0049-2.
ieee: H. Edelsbrunner and A. Nikitenko, “Poisson–Delaunay Mosaics of Order k,” Discrete
and Computational Geometry, vol. 62, no. 4. Springer, pp. 865–878, 2019.
ista: Edelsbrunner H, Nikitenko A. 2019. Poisson–Delaunay Mosaics of Order k. Discrete
and Computational Geometry. 62(4), 865–878.
mla: Edelsbrunner, Herbert, and Anton Nikitenko. “Poisson–Delaunay Mosaics of Order
K.” Discrete and Computational Geometry, vol. 62, no. 4, Springer, 2019,
pp. 865–878, doi:10.1007/s00454-018-0049-2.
short: H. Edelsbrunner, A. Nikitenko, Discrete and Computational Geometry 62 (2019)
865–878.
date_created: 2018-12-16T22:59:20Z
date_published: 2019-12-01T00:00:00Z
date_updated: 2023-09-07T12:07:12Z
day: '01'
ddc:
- '516'
department:
- _id: HeEd
doi: 10.1007/s00454-018-0049-2
ec_funded: 1
external_id:
arxiv:
- '1709.09380'
isi:
- '000494042900008'
file:
- access_level: open_access
checksum: f9d00e166efaccb5a76bbcbb4dcea3b4
content_type: application/pdf
creator: dernst
date_created: 2019-02-06T10:10:46Z
date_updated: 2020-07-14T12:47:10Z
file_id: '5932'
file_name: 2018_DiscreteCompGeometry_Edelsbrunner.pdf
file_size: 599339
relation: main_file
file_date_updated: 2020-07-14T12:47:10Z
has_accepted_license: '1'
intvolume: ' 62'
isi: 1
issue: '4'
language:
- iso: eng
month: '12'
oa: 1
oa_version: Published Version
page: 865–878
project:
- _id: 266A2E9E-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '788183'
name: Alpha Shape Theory Extended
- _id: 2561EBF4-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: I02979-N35
name: Persistence and stability of geometric complexes
- _id: B67AFEDC-15C9-11EA-A837-991A96BB2854
name: IST Austria Open Access Fund
publication: Discrete and Computational Geometry
publication_identifier:
eissn:
- '14320444'
issn:
- '01795376'
publication_status: published
publisher: Springer
quality_controlled: '1'
related_material:
record:
- id: '6287'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: Poisson–Delaunay Mosaics of Order k
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 62
year: '2019'
...
---
_id: '5828'
abstract:
- lang: eng
text: Hippocampus is needed for both spatial working and reference memories. Here,
using a radial eight-arm maze, we examined how the combined demand on these memories
influenced CA1 place cell assemblies while reference memories were partially updated.
This was contrasted with control tasks requiring only working memory or the update
of reference memory. Reference memory update led to the reward-directed place
field shifts at newly rewarded arms and to the gradual strengthening of firing
in passes between newly rewarded arms but not between those passes that included
a familiar-rewarded arm. At the maze center, transient network synchronization
periods preferentially replayed trajectories of the next chosen arm in reference
memory tasks but the previously visited arm in the working memory task. Hence,
reference memory demand was uniquely associated with a gradual, goal novelty-related
reorganization of place cell assemblies and with trajectory replay that reflected
the animal's decision of which arm to visit next.
article_processing_charge: No
article_type: original
author:
- first_name: Haibing
full_name: Xu, Haibing
id: 310349D0-F248-11E8-B48F-1D18A9856A87
last_name: Xu
- first_name: Peter
full_name: Baracskay, Peter
id: 361CC00E-F248-11E8-B48F-1D18A9856A87
last_name: Baracskay
- first_name: Joseph
full_name: O'Neill, Joseph
id: 426376DC-F248-11E8-B48F-1D18A9856A87
last_name: O'Neill
- first_name: Jozsef L
full_name: Csicsvari, Jozsef L
id: 3FA14672-F248-11E8-B48F-1D18A9856A87
last_name: Csicsvari
orcid: 0000-0002-5193-4036
citation:
ama: Xu H, Baracskay P, O’Neill J, Csicsvari JL. Assembly responses of hippocampal
CA1 place cells predict learned behavior in goal-directed spatial tasks on the
radial eight-arm maze. Neuron. 2019;101(1):119-132.e4. doi:10.1016/j.neuron.2018.11.015
apa: Xu, H., Baracskay, P., O’Neill, J., & Csicsvari, J. L. (2019). Assembly
responses of hippocampal CA1 place cells predict learned behavior in goal-directed
spatial tasks on the radial eight-arm maze. Neuron. Elsevier. https://doi.org/10.1016/j.neuron.2018.11.015
chicago: Xu, Haibing, Peter Baracskay, Joseph O’Neill, and Jozsef L Csicsvari. “Assembly
Responses of Hippocampal CA1 Place Cells Predict Learned Behavior in Goal-Directed
Spatial Tasks on the Radial Eight-Arm Maze.” Neuron. Elsevier, 2019. https://doi.org/10.1016/j.neuron.2018.11.015.
ieee: H. Xu, P. Baracskay, J. O’Neill, and J. L. Csicsvari, “Assembly responses
of hippocampal CA1 place cells predict learned behavior in goal-directed spatial
tasks on the radial eight-arm maze,” Neuron, vol. 101, no. 1. Elsevier,
p. 119–132.e4, 2019.
ista: Xu H, Baracskay P, O’Neill J, Csicsvari JL. 2019. Assembly responses of hippocampal
CA1 place cells predict learned behavior in goal-directed spatial tasks on the
radial eight-arm maze. Neuron. 101(1), 119–132.e4.
mla: Xu, Haibing, et al. “Assembly Responses of Hippocampal CA1 Place Cells Predict
Learned Behavior in Goal-Directed Spatial Tasks on the Radial Eight-Arm Maze.”
Neuron, vol. 101, no. 1, Elsevier, 2019, p. 119–132.e4, doi:10.1016/j.neuron.2018.11.015.
short: H. Xu, P. Baracskay, J. O’Neill, J.L. Csicsvari, Neuron 101 (2019) 119–132.e4.
date_created: 2019-01-13T22:59:10Z
date_published: 2019-01-02T00:00:00Z
date_updated: 2023-09-07T12:06:37Z
day: '02'
department:
- _id: JoCs
doi: 10.1016/j.neuron.2018.11.015
ec_funded: 1
external_id:
isi:
- '000454791500014'
intvolume: ' 101'
isi: 1
issue: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://www.doi.org/10.1016/j.neuron.2018.11.015
month: '01'
oa: 1
oa_version: Published Version
page: 119-132.e4
project:
- _id: 257A4776-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '281511'
name: Memory-related information processing in neuronal circuits of the hippocampus
and entorhinal cortex
publication: Neuron
publication_identifier:
issn:
- '10974199'
publication_status: published
publisher: Elsevier
quality_controlled: '1'
related_material:
link:
- description: News on IST Homepage
relation: press_release
url: https://ist.ac.at/en/news/reading-rats-minds/
record:
- id: '837'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: Assembly responses of hippocampal CA1 place cells predict learned behavior
in goal-directed spatial tasks on the radial eight-arm maze
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 101
year: '2019'
...
---
_id: '5856'
abstract:
- lang: eng
text: We give a bound on the ground-state energy of a system of N non-interacting
fermions in a three-dimensional cubic box interacting with an impurity particle
via point interactions. We show that the change in energy compared to the system
in the absence of the impurity is bounded in terms of the gas density and the
scattering length of the interaction, independently of N. Our bound holds as long
as the ratio of the mass of the impurity to the one of the gas particles is larger
than a critical value m∗ ∗≈ 0.36 , which is the same regime for which we recently
showed stability of the system.
article_processing_charge: Yes (via OA deal)
article_type: original
author:
- first_name: Thomas
full_name: Moser, Thomas
id: 2B5FC9A4-F248-11E8-B48F-1D18A9856A87
last_name: Moser
- first_name: Robert
full_name: Seiringer, Robert
id: 4AFD0470-F248-11E8-B48F-1D18A9856A87
last_name: Seiringer
orcid: 0000-0002-6781-0521
citation:
ama: Moser T, Seiringer R. Energy contribution of a point-interacting impurity in
a Fermi gas. Annales Henri Poincare. 2019;20(4):1325–1365. doi:10.1007/s00023-018-00757-0
apa: Moser, T., & Seiringer, R. (2019). Energy contribution of a point-interacting
impurity in a Fermi gas. Annales Henri Poincare. Springer. https://doi.org/10.1007/s00023-018-00757-0
chicago: Moser, Thomas, and Robert Seiringer. “Energy Contribution of a Point-Interacting
Impurity in a Fermi Gas.” Annales Henri Poincare. Springer, 2019. https://doi.org/10.1007/s00023-018-00757-0.
ieee: T. Moser and R. Seiringer, “Energy contribution of a point-interacting impurity
in a Fermi gas,” Annales Henri Poincare, vol. 20, no. 4. Springer, pp.
1325–1365, 2019.
ista: Moser T, Seiringer R. 2019. Energy contribution of a point-interacting impurity
in a Fermi gas. Annales Henri Poincare. 20(4), 1325–1365.
mla: Moser, Thomas, and Robert Seiringer. “Energy Contribution of a Point-Interacting
Impurity in a Fermi Gas.” Annales Henri Poincare, vol. 20, no. 4, Springer,
2019, pp. 1325–1365, doi:10.1007/s00023-018-00757-0.
short: T. Moser, R. Seiringer, Annales Henri Poincare 20 (2019) 1325–1365.
date_created: 2019-01-20T22:59:17Z
date_published: 2019-04-01T00:00:00Z
date_updated: 2023-09-07T12:37:42Z
day: '01'
ddc:
- '530'
department:
- _id: RoSe
doi: 10.1007/s00023-018-00757-0
ec_funded: 1
external_id:
arxiv:
- '1807.00739'
isi:
- '000462444300008'
file:
- access_level: open_access
checksum: 255e42f957a8e2b10aad2499c750a8d6
content_type: application/pdf
creator: dernst
date_created: 2019-01-28T15:27:17Z
date_updated: 2020-07-14T12:47:12Z
file_id: '5894'
file_name: 2019_Annales_Moser.pdf
file_size: 859846
relation: main_file
file_date_updated: 2020-07-14T12:47:12Z
has_accepted_license: '1'
intvolume: ' 20'
isi: 1
issue: '4'
language:
- iso: eng
month: '04'
oa: 1
oa_version: Published Version
page: 1325–1365
project:
- _id: 25C6DC12-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '694227'
name: Analysis of quantum many-body systems
- _id: 25C878CE-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P27533_N27
name: Structure of the Excitation Spectrum for Many-Body Quantum Systems
- _id: B67AFEDC-15C9-11EA-A837-991A96BB2854
name: IST Austria Open Access Fund
publication: Annales Henri Poincare
publication_identifier:
issn:
- '14240637'
publication_status: published
publisher: Springer
quality_controlled: '1'
related_material:
record:
- id: '52'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: Energy contribution of a point-interacting impurity in a Fermi 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: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 20
year: '2019'
...
---
_id: '6957'
abstract:
- lang: eng
text: "In many shear flows like pipe flow, plane Couette flow, plane Poiseuille
flow, etc. turbulence emerges subcritically. Here, when subjected to strong enough
perturbations, the flow becomes turbulent in spite of the laminar base flow being
linearly stable. The nature of this instability has puzzled the scientific community
for decades. At onset, turbulence appears in localized patches and flows are spatio-temporally
intermittent. In pipe flow the localized turbulent structures are referred to
as puffs and in planar flows like plane Couette and channel flow, patches arise
in the form of localized oblique bands. In this thesis, we study the onset of
turbulence in channel flow in direct numerical simulations from a dynamical system
theory perspective, as well as by performing experiments in a large aspect ratio
channel.\r\n\r\nThe aim of the experimental work is to determine the critical
Reynolds number where turbulence first becomes sustained. Recently, the onset
of turbulence has been described in analogy to absorbing state phase transition
(i.e. directed percolation). In particular, it has been shown that the critical
point can be estimated from the competition between spreading and decay processes.
Here, by performing experiments, we identify the mechanisms underlying turbulence
proliferation in channel flow and find the critical Reynolds number, above which
turbulence becomes sustained. Above the critical point, the continuous growth
at the tip of the stripes outweighs the stochastic shedding of turbulent patches
at the tail and the stripes expand. For growing stripes, the probability to decay
decreases while the probability of stripe splitting increases. Consequently, and
unlike for the puffs in pipe flow, neither of these two processes is time-independent
i.e. memoryless. Coupling between stripe expansion and creation of new stripes
via splitting leads to a significantly lower critical point ($Re_c=670+/-10$)
than most earlier studies suggest. \r\n\r\nWhile the above approach sheds light
on how turbulence first becomes sustained, it provides no insight into the origin
of the stripes themselves. In the numerical part of the thesis we investigate
how turbulent stripes form from invariant solutions of the Navier-Stokes equations.
The origin of these turbulent stripes can be identified by applying concepts from
the dynamical system theory. In doing so, we identify the exact coherent structures
underlying stripes and their bifurcations and how they give rise to the turbulent
attractor in phase space. We first report a family of localized nonlinear traveling
wave solutions of the Navier-Stokes equations in channel flow. These solutions
show structural similarities with turbulent stripes in experiments like obliqueness,
quasi-streamwise streaks and vortices, etc. A parametric study of these traveling
wave solution is performed, with parameters like Reynolds number, stripe tilt
angle and domain size, including the stability of the solutions. These solutions
emerge through saddle-node bifurcations and form a phase space skeleton for the
turbulent stripes observed in the experiments. The lower branches of these TW
solutions at different tilt angles undergo Hopf bifurcation and new solutions
branches of relative periodic orbits emerge. These RPO solutions do not belong
to the same family and therefore the routes to chaos for different angles are
different. \r\n\r\nIn shear flows, turbulence at onset is transient in nature.
\ Consequently,turbulence can not be tracked to lower Reynolds numbers, where
the dynamics may simplify. Before this happens, turbulence becomes short-lived
and laminarizes. In the last part of the thesis, we show that using numerical
simulations we can continue turbulent stripes in channel flow past the 'relaminarization
barrier' all the way to their origin. Here, turbulent stripe dynamics simplifies
and the fluctuations are no longer stochastic and the stripe settles down to a
relative periodic orbit. This relative periodic orbit originates from the aforementioned
traveling wave solutions. Starting from the relative periodic orbit, a small increase
in speed i.e. Reynolds number gives rise to chaos and the attractor dimension
sharply increases in contrast to the classical transition scenario where the instabilities
affect the flow globally and give rise to much more gradual route to turbulence."
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Chaitanya S
full_name: Paranjape, Chaitanya S
id: 3D85B7C4-F248-11E8-B48F-1D18A9856A87
last_name: Paranjape
citation:
ama: Paranjape CS. Onset of turbulence in plane Poiseuille flow. 2019. doi:10.15479/AT:ISTA:6957
apa: Paranjape, C. S. (2019). Onset of turbulence in plane Poiseuille flow.
Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:6957
chicago: Paranjape, Chaitanya S. “Onset of Turbulence in Plane Poiseuille Flow.”
Institute of Science and Technology Austria, 2019. https://doi.org/10.15479/AT:ISTA:6957.
ieee: C. S. Paranjape, “Onset of turbulence in plane Poiseuille flow,” Institute
of Science and Technology Austria, 2019.
ista: Paranjape CS. 2019. Onset of turbulence in plane Poiseuille flow. Institute
of Science and Technology Austria.
mla: Paranjape, Chaitanya S. Onset of Turbulence in Plane Poiseuille Flow.
Institute of Science and Technology Austria, 2019, doi:10.15479/AT:ISTA:6957.
short: C.S. Paranjape, Onset of Turbulence in Plane Poiseuille Flow, Institute of
Science and Technology Austria, 2019.
date_created: 2019-10-22T12:08:43Z
date_published: 2019-10-24T00:00:00Z
date_updated: 2023-09-07T12:53:25Z
day: '24'
ddc:
- '532'
degree_awarded: PhD
department:
- _id: BjHo
doi: 10.15479/AT:ISTA:6957
file:
- access_level: closed
checksum: 7ba298ba0ce7e1d11691af6b8eaf0a0a
content_type: application/zip
creator: cparanjape
date_created: 2019-10-23T09:54:43Z
date_updated: 2020-07-14T12:47:46Z
file_id: '6962'
file_name: Chaitanya_Paranjape_source_files_tex_figures.zip
file_size: 45828099
relation: source_file
- access_level: open_access
checksum: 642697618314e31ac31392da7909c2d9
content_type: application/pdf
creator: cparanjape
date_created: 2019-10-23T10:37:09Z
date_updated: 2020-07-14T12:47:46Z
file_id: '6963'
file_name: Chaitanya_Paranjape_Thesis.pdf
file_size: 19504197
relation: main_file
file_date_updated: 2020-07-14T12:47:46Z
has_accepted_license: '1'
keyword:
- Instabilities
- Turbulence
- Nonlinear dynamics
language:
- iso: eng
month: '10'
oa: 1
oa_version: Published Version
page: '138'
publication_identifier:
eissn:
- 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
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: Onset of turbulence in plane Poiseuille flow
type: dissertation
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
year: '2019'
...
---
_id: '6182'
abstract:
- lang: eng
text: "We consider large random matrices with a general slowly decaying correlation
among its entries. We prove universality of the local eigenvalue statistics and
optimal local laws for the resolvent away from the spectral edges, generalizing
the recent result of Ajanki et al. [‘Stability of the matrix Dyson equation and
random matrices with correlations’, Probab. Theory Related Fields 173(1–2) (2019),
293–373] to allow slow correlation decay and arbitrary expectation. The main novel
tool is\r\na systematic diagrammatic control of a multivariate cumulant expansion."
article_number: e8
article_processing_charge: No
article_type: original
author:
- first_name: László
full_name: Erdös, László
id: 4DBD5372-F248-11E8-B48F-1D18A9856A87
last_name: Erdös
orcid: 0000-0001-5366-9603
- first_name: Torben H
full_name: Krüger, Torben H
id: 3020C786-F248-11E8-B48F-1D18A9856A87
last_name: Krüger
orcid: 0000-0002-4821-3297
- first_name: Dominik J
full_name: Schröder, Dominik J
id: 408ED176-F248-11E8-B48F-1D18A9856A87
last_name: Schröder
orcid: 0000-0002-2904-1856
citation:
ama: Erdös L, Krüger TH, Schröder DJ. Random matrices with slow correlation decay.
Forum of Mathematics, Sigma. 2019;7. doi:10.1017/fms.2019.2
apa: Erdös, L., Krüger, T. H., & Schröder, D. J. (2019). Random matrices with
slow correlation decay. Forum of Mathematics, Sigma. Cambridge University
Press. https://doi.org/10.1017/fms.2019.2
chicago: Erdös, László, Torben H Krüger, and Dominik J Schröder. “Random Matrices
with Slow Correlation Decay.” Forum of Mathematics, Sigma. Cambridge University
Press, 2019. https://doi.org/10.1017/fms.2019.2.
ieee: L. Erdös, T. H. Krüger, and D. J. Schröder, “Random matrices with slow correlation
decay,” Forum of Mathematics, Sigma, vol. 7. Cambridge University Press,
2019.
ista: Erdös L, Krüger TH, Schröder DJ. 2019. Random matrices with slow correlation
decay. Forum of Mathematics, Sigma. 7, e8.
mla: Erdös, László, et al. “Random Matrices with Slow Correlation Decay.” Forum
of Mathematics, Sigma, vol. 7, e8, Cambridge University Press, 2019, doi:10.1017/fms.2019.2.
short: L. Erdös, T.H. Krüger, D.J. Schröder, Forum of Mathematics, Sigma 7 (2019).
date_created: 2019-03-28T09:05:23Z
date_published: 2019-03-26T00:00:00Z
date_updated: 2023-09-07T12:54:12Z
day: '26'
ddc:
- '510'
department:
- _id: LaEr
doi: 10.1017/fms.2019.2
ec_funded: 1
external_id:
arxiv:
- '1705.10661'
isi:
- '000488847100001'
file:
- access_level: open_access
checksum: 933a472568221c73b2c3ce8c87bf6d15
content_type: application/pdf
creator: dernst
date_created: 2019-09-17T14:24:13Z
date_updated: 2020-07-14T12:47:22Z
file_id: '6883'
file_name: 2019_Forum_Erdoes.pdf
file_size: 1520344
relation: main_file
file_date_updated: 2020-07-14T12:47:22Z
has_accepted_license: '1'
intvolume: ' 7'
isi: 1
language:
- iso: eng
month: '03'
oa: 1
oa_version: Published Version
project:
- _id: 258DCDE6-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '338804'
name: Random matrices, universality and disordered quantum systems
publication: Forum of Mathematics, Sigma
publication_identifier:
eissn:
- '20505094'
publication_status: published
publisher: Cambridge University Press
quality_controlled: '1'
related_material:
record:
- id: '6179'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: Random matrices with slow correlation decay
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 7
year: '2019'
...
---
_id: '6186'
abstract:
- lang: eng
text: "We prove that the local eigenvalue statistics of real symmetric Wigner-type\r\nmatrices
near the cusp points of the eigenvalue density are universal. Together\r\nwith
the companion paper [arXiv:1809.03971], which proves the same result for\r\nthe
complex Hermitian symmetry class, this completes the last remaining case of\r\nthe
Wigner-Dyson-Mehta universality conjecture after bulk and edge\r\nuniversalities
have been established in the last years. We extend the recent\r\nDyson Brownian
motion analysis at the edge [arXiv:1712.03881] to the cusp\r\nregime using the
optimal local law from [arXiv:1809.03971] and the accurate\r\nlocal shape analysis
of the density from [arXiv:1506.05095, arXiv:1804.07752].\r\nWe also present a
PDE-based method to improve the estimate on eigenvalue\r\nrigidity via the maximum
principle of the heat flow related to the Dyson\r\nBrownian motion."
article_processing_charge: No
article_type: original
author:
- first_name: Giorgio
full_name: Cipolloni, Giorgio
id: 42198EFA-F248-11E8-B48F-1D18A9856A87
last_name: Cipolloni
orcid: 0000-0002-4901-7992
- first_name: László
full_name: Erdös, László
id: 4DBD5372-F248-11E8-B48F-1D18A9856A87
last_name: Erdös
orcid: 0000-0001-5366-9603
- first_name: Torben H
full_name: Krüger, Torben H
id: 3020C786-F248-11E8-B48F-1D18A9856A87
last_name: Krüger
orcid: 0000-0002-4821-3297
- first_name: Dominik J
full_name: Schröder, Dominik J
id: 408ED176-F248-11E8-B48F-1D18A9856A87
last_name: Schröder
orcid: 0000-0002-2904-1856
citation:
ama: 'Cipolloni G, Erdös L, Krüger TH, Schröder DJ. Cusp universality for random
matrices, II: The real symmetric case. Pure and Applied Analysis . 2019;1(4):615–707.
doi:10.2140/paa.2019.1.615'
apa: 'Cipolloni, G., Erdös, L., Krüger, T. H., & Schröder, D. J. (2019). Cusp
universality for random matrices, II: The real symmetric case. Pure and Applied
Analysis . MSP. https://doi.org/10.2140/paa.2019.1.615'
chicago: 'Cipolloni, Giorgio, László Erdös, Torben H Krüger, and Dominik J Schröder.
“Cusp Universality for Random Matrices, II: The Real Symmetric Case.” Pure
and Applied Analysis . MSP, 2019. https://doi.org/10.2140/paa.2019.1.615.'
ieee: 'G. Cipolloni, L. Erdös, T. H. Krüger, and D. J. Schröder, “Cusp universality
for random matrices, II: The real symmetric case,” Pure and Applied Analysis
, vol. 1, no. 4. MSP, pp. 615–707, 2019.'
ista: 'Cipolloni G, Erdös L, Krüger TH, Schröder DJ. 2019. Cusp universality for
random matrices, II: The real symmetric case. Pure and Applied Analysis . 1(4),
615–707.'
mla: 'Cipolloni, Giorgio, et al. “Cusp Universality for Random Matrices, II: The
Real Symmetric Case.” Pure and Applied Analysis , vol. 1, no. 4, MSP, 2019,
pp. 615–707, doi:10.2140/paa.2019.1.615.'
short: G. Cipolloni, L. Erdös, T.H. Krüger, D.J. Schröder, Pure and Applied Analysis 1
(2019) 615–707.
date_created: 2019-03-28T10:21:17Z
date_published: 2019-10-12T00:00:00Z
date_updated: 2023-09-07T12:54:12Z
day: '12'
department:
- _id: LaEr
doi: 10.2140/paa.2019.1.615
ec_funded: 1
external_id:
arxiv:
- '1811.04055'
intvolume: ' 1'
issue: '4'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1811.04055
month: '10'
oa: 1
oa_version: Preprint
page: 615–707
project:
- _id: 258DCDE6-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '338804'
name: Random matrices, universality and disordered quantum systems
- _id: 2564DBCA-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '665385'
name: International IST Doctoral Program
publication: 'Pure and Applied Analysis '
publication_identifier:
eissn:
- 2578-5885
issn:
- 2578-5893
publication_status: published
publisher: MSP
quality_controlled: '1'
related_material:
record:
- id: '6179'
relation: dissertation_contains
status: public
status: public
title: 'Cusp universality for random matrices, II: The real symmetric case'
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 1
year: '2019'
...
---
_id: '6900'
abstract:
- lang: eng
text: Across diverse biological systems—ranging from neural networks to intracellular
signaling and genetic regulatory networks—the information about changes in the
environment is frequently encoded in the full temporal dynamics of the network
nodes. A pressing data-analysis challenge has thus been to efficiently estimate
the amount of information that these dynamics convey from experimental data. Here
we develop and evaluate decoding-based estimation methods to lower bound the mutual
information about a finite set of inputs, encoded in single-cell high-dimensional
time series data. For biological reaction networks governed by the chemical Master
equation, we derive model-based information approximations and analytical upper
bounds, against which we benchmark our proposed model-free decoding estimators.
In contrast to the frequently-used k-nearest-neighbor estimator, decoding-based
estimators robustly extract a large fraction of the available information from
high-dimensional trajectories with a realistic number of data samples. We apply
these estimators to previously published data on Erk and Ca2+ signaling in mammalian
cells and to yeast stress-response, and find that substantial amount of information
about environmental state can be encoded by non-trivial response statistics even
in stationary signals. We argue that these single-cell, decoding-based information
estimates, rather than the commonly-used tests for significant differences between
selected population response statistics, provide a proper and unbiased measure
for the performance of biological signaling networks.
article_processing_charge: No
author:
- first_name: Sarah A
full_name: Cepeda Humerez, Sarah A
id: 3DEE19A4-F248-11E8-B48F-1D18A9856A87
last_name: Cepeda Humerez
- first_name: Jakob
full_name: Ruess, Jakob
last_name: Ruess
orcid: 0000-0003-1615-3282
- first_name: Gašper
full_name: Tkačik, Gašper
id: 3D494DCA-F248-11E8-B48F-1D18A9856A87
last_name: Tkačik
orcid: 0000-0002-6699-1455
citation:
ama: Cepeda Humerez SA, Ruess J, Tkačik G. Estimating information in time-varying
signals. PLoS computational biology. 2019;15(9):e1007290. doi:10.1371/journal.pcbi.1007290
apa: Cepeda Humerez, S. A., Ruess, J., & Tkačik, G. (2019). Estimating information
in time-varying signals. PLoS Computational Biology. Public Library of
Science. https://doi.org/10.1371/journal.pcbi.1007290
chicago: Cepeda Humerez, Sarah A, Jakob Ruess, and Gašper Tkačik. “Estimating Information
in Time-Varying Signals.” PLoS Computational Biology. Public Library of
Science, 2019. https://doi.org/10.1371/journal.pcbi.1007290.
ieee: S. A. Cepeda Humerez, J. Ruess, and G. Tkačik, “Estimating information in
time-varying signals,” PLoS computational biology, vol. 15, no. 9. Public
Library of Science, p. e1007290, 2019.
ista: Cepeda Humerez SA, Ruess J, Tkačik G. 2019. Estimating information in time-varying
signals. PLoS computational biology. 15(9), e1007290.
mla: Cepeda Humerez, Sarah A., et al. “Estimating Information in Time-Varying Signals.”
PLoS Computational Biology, vol. 15, no. 9, Public Library of Science,
2019, p. e1007290, doi:10.1371/journal.pcbi.1007290.
short: S.A. Cepeda Humerez, J. Ruess, G. Tkačik, PLoS Computational Biology 15 (2019)
e1007290.
date_created: 2019-09-22T22:00:37Z
date_published: 2019-09-03T00:00:00Z
date_updated: 2023-09-07T12:55:21Z
day: '03'
ddc:
- '570'
department:
- _id: GaTk
doi: 10.1371/journal.pcbi.1007290
external_id:
isi:
- '000489741800021'
pmid:
- '31479447'
file:
- access_level: open_access
checksum: 81bdce1361c9aa8395d6fa635fb6ab47
content_type: application/pdf
creator: kschuh
date_created: 2019-10-01T10:53:45Z
date_updated: 2020-07-14T12:47:44Z
file_id: '6925'
file_name: 2019_PLoS_Cepeda-Humerez.pdf
file_size: 3081855
relation: main_file
file_date_updated: 2020-07-14T12:47:44Z
has_accepted_license: '1'
intvolume: ' 15'
isi: 1
issue: '9'
language:
- iso: eng
month: '09'
oa: 1
oa_version: Published Version
page: e1007290
pmid: 1
project:
- _id: 254E9036-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P28844-B27
name: Biophysics of information processing in gene regulation
publication: PLoS computational biology
publication_identifier:
eissn:
- '15537358'
publication_status: published
publisher: Public Library of Science
quality_controlled: '1'
related_material:
record:
- id: '6473'
relation: part_of_dissertation
status: public
scopus_import: '1'
status: public
title: Estimating information in time-varying signals
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 15
year: '2019'
...
---
_id: '6377'
abstract:
- lang: eng
text: Clathrin-mediated endocytosis (CME) is a highly conserved and essential cellular
process in eukaryotic cells, but its dynamic and vital nature makes it challenging
to study using classical genetics tools. In contrast, although small molecules
can acutely and reversibly perturb CME, the few chemical CME inhibitors that have
been applied to plants are either ineffective or show undesirable side effects.
Here, we identify the previously described endosidin9 (ES9) as an inhibitor of
clathrin heavy chain (CHC) function in both Arabidopsis and human cells through
affinity-based target isolation, in vitro binding studies and X-ray crystallography.
Moreover, we present a chemically improved ES9 analog, ES9-17, which lacks the
undesirable side effects of ES9 while retaining the ability to target CHC. ES9
and ES9-17 have expanded the chemical toolbox used to probe CHC function, and
present chemical scaffolds for further design of more specific and potent CHC
inhibitors across different systems.
article_processing_charge: No
article_type: original
author:
- first_name: Wim
full_name: Dejonghe, Wim
last_name: Dejonghe
- first_name: Isha
full_name: Sharma, Isha
last_name: Sharma
- first_name: Bram
full_name: Denoo, Bram
last_name: Denoo
- first_name: Steven
full_name: De Munck, Steven
last_name: De Munck
- first_name: Qing
full_name: Lu, Qing
last_name: Lu
- first_name: Kiril
full_name: Mishev, Kiril
last_name: Mishev
- first_name: Haydar
full_name: Bulut, Haydar
last_name: Bulut
- first_name: Evelien
full_name: Mylle, Evelien
last_name: Mylle
- first_name: Riet
full_name: De Rycke, Riet
last_name: De Rycke
- first_name: Mina K
full_name: Vasileva, Mina K
id: 3407EB18-F248-11E8-B48F-1D18A9856A87
last_name: Vasileva
- first_name: Daniel V.
full_name: Savatin, Daniel V.
last_name: Savatin
- first_name: Wim
full_name: Nerinckx, Wim
last_name: Nerinckx
- first_name: An
full_name: Staes, An
last_name: Staes
- first_name: Andrzej
full_name: Drozdzecki, Andrzej
last_name: Drozdzecki
- first_name: Dominique
full_name: Audenaert, Dominique
last_name: Audenaert
- first_name: Klaas
full_name: Yperman, Klaas
last_name: Yperman
- first_name: Annemieke
full_name: Madder, Annemieke
last_name: Madder
- first_name: Jiří
full_name: Friml, Jiří
id: 4159519E-F248-11E8-B48F-1D18A9856A87
last_name: Friml
orcid: 0000-0002-8302-7596
- first_name: Daniël
full_name: Van Damme, Daniël
last_name: Van Damme
- first_name: Kris
full_name: Gevaert, Kris
last_name: Gevaert
- first_name: Volker
full_name: Haucke, Volker
last_name: Haucke
- first_name: Savvas N.
full_name: Savvides, Savvas N.
last_name: Savvides
- first_name: Johan
full_name: Winne, Johan
last_name: Winne
- first_name: Eugenia
full_name: Russinova, Eugenia
last_name: Russinova
citation:
ama: Dejonghe W, Sharma I, Denoo B, et al. Disruption of endocytosis through chemical
inhibition of clathrin heavy chain function. Nature Chemical Biology. 2019;15(6):641–649.
doi:10.1038/s41589-019-0262-1
apa: Dejonghe, W., Sharma, I., Denoo, B., De Munck, S., Lu, Q., Mishev, K., … Russinova,
E. (2019). Disruption of endocytosis through chemical inhibition of clathrin heavy
chain function. Nature Chemical Biology. Springer Nature. https://doi.org/10.1038/s41589-019-0262-1
chicago: Dejonghe, Wim, Isha Sharma, Bram Denoo, Steven De Munck, Qing Lu, Kiril
Mishev, Haydar Bulut, et al. “Disruption of Endocytosis through Chemical Inhibition
of Clathrin Heavy Chain Function.” Nature Chemical Biology. Springer Nature,
2019. https://doi.org/10.1038/s41589-019-0262-1.
ieee: W. Dejonghe et al., “Disruption of endocytosis through chemical inhibition
of clathrin heavy chain function,” Nature Chemical Biology, vol. 15, no.
6. Springer Nature, pp. 641–649, 2019.
ista: Dejonghe W, Sharma I, Denoo B, De Munck S, Lu Q, Mishev K, Bulut H, Mylle
E, De Rycke R, Vasileva MK, Savatin DV, Nerinckx W, Staes A, Drozdzecki A, Audenaert
D, Yperman K, Madder A, Friml J, Van Damme D, Gevaert K, Haucke V, Savvides SN,
Winne J, Russinova E. 2019. Disruption of endocytosis through chemical inhibition
of clathrin heavy chain function. Nature Chemical Biology. 15(6), 641–649.
mla: Dejonghe, Wim, et al. “Disruption of Endocytosis through Chemical Inhibition
of Clathrin Heavy Chain Function.” Nature Chemical Biology, vol. 15, no.
6, Springer Nature, 2019, pp. 641–649, doi:10.1038/s41589-019-0262-1.
short: W. Dejonghe, I. Sharma, B. Denoo, S. De Munck, Q. Lu, K. Mishev, H. Bulut,
E. Mylle, R. De Rycke, M.K. Vasileva, D.V. Savatin, W. Nerinckx, A. Staes, A.
Drozdzecki, D. Audenaert, K. Yperman, A. Madder, J. Friml, D. Van Damme, K. Gevaert,
V. Haucke, S.N. Savvides, J. Winne, E. Russinova, Nature Chemical Biology 15 (2019)
641–649.
date_created: 2019-05-05T21:59:11Z
date_published: 2019-06-01T00:00:00Z
date_updated: 2023-09-07T12:54:35Z
day: '01'
department:
- _id: JiFr
doi: 10.1038/s41589-019-0262-1
external_id:
isi:
- '000468195600018'
intvolume: ' 15'
isi: 1
issue: '6'
language:
- iso: eng
month: '06'
oa_version: None
page: 641–649
publication: Nature Chemical Biology
publication_identifier:
eissn:
- '15524469'
issn:
- '15524450'
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
related_material:
record:
- id: '7172'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: Disruption of endocytosis through chemical inhibition of clathrin heavy chain
function
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 15
year: '2019'
...
---
_id: '7186'
abstract:
- lang: eng
text: "Tissue morphogenesis in developmental or physiological processes is regulated
by molecular\r\nand mechanical signals. While the molecular signaling cascades
are increasingly well\r\ndescribed, the mechanical signals affecting tissue shape
changes have only recently been\r\nstudied in greater detail. To gain more insight
into the mechanochemical and biophysical\r\nbasis of an epithelial spreading process
(epiboly) in early zebrafish development, we studied\r\ncell-cell junction formation
and actomyosin network dynamics at the boundary between\r\nsurface layer epithelial
cells (EVL) and the yolk syncytial layer (YSL). During zebrafish epiboly,\r\nthe
cell mass sitting on top of the yolk cell spreads to engulf the yolk cell by the
end of\r\ngastrulation. It has been previously shown that an actomyosin ring residing
within the YSL\r\npulls on the EVL tissue through a cable-constriction and a flow-friction
motor, thereby\r\ndragging the tissue vegetal wards. Pulling forces are likely
transmitted from the YSL\r\nactomyosin ring to EVL cells; however, the nature
and formation of the junctional structure\r\nmediating this process has not been
well described so far. Therefore, our main aim was to\r\ndetermine the nature,
dynamics and potential function of the EVL-YSL junction during this\r\nepithelial
tissue spreading. Specifically, we show that the EVL-YSL junction is a\r\nmechanosensitive
structure, predominantly made of tight junction (TJ) proteins. The process\r\nof
TJ mechanosensation depends on the retrograde flow of non-junctional, phase-separated\r\nZonula
Occludens-1 (ZO-1) protein clusters towards the EVL-YSL boundary. Interestingly,
we\r\ncould demonstrate that ZO-1 is present in a non-junctional pool on the surface
of the yolk\r\ncell, and ZO-1 undergoes a phase separation process that likely
renders the protein\r\nresponsive to flows. These flows are directed towards the
junction and mediate proper\r\ntension-dependent recruitment of ZO-1. Upon reaching
the EVL-YSL junction ZO-1 gets\r\nincorporated into the junctional pool mediated
through its direct actin-binding domain.\r\nWhen the non-junctional pool and/or
ZO-1 direct actin binding is absent, TJs fail in their\r\nproper mechanosensitive
responses resulting in slower tissue spreading. We could further\r\ndemonstrate
that depletion of ZO proteins within the YSL results in diminished actomyosin\r\nring
formation. This suggests that a mechanochemical feedback loop is at work during\r\nzebrafish
epiboly: ZO proteins help in proper actomyosin ring formation and actomyosin\r\ncontractility
and flows positively influence ZO-1 junctional recruitment. Finally, such a\r\nmesoscale
polarization process mediated through the flow of phase-separated protein\r\nclusters
might have implications for other processes such as immunological synapse\r\nformation,
C. elegans zygote polarization and wound healing."
acknowledged_ssus:
- _id: Bio
- _id: LifeSc
- _id: EM-Fac
- _id: SSU
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Cornelia
full_name: Schwayer, Cornelia
id: 3436488C-F248-11E8-B48F-1D18A9856A87
last_name: Schwayer
orcid: 0000-0001-5130-2226
citation:
ama: Schwayer C. Mechanosensation of tight junctions depends on ZO-1 phase separation
and flow. 2019. doi:10.15479/AT:ISTA:7186
apa: Schwayer, C. (2019). Mechanosensation of tight junctions depends on ZO-1
phase separation and flow. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:7186
chicago: Schwayer, Cornelia. “Mechanosensation of Tight Junctions Depends on ZO-1
Phase Separation and Flow.” Institute of Science and Technology Austria, 2019.
https://doi.org/10.15479/AT:ISTA:7186.
ieee: C. Schwayer, “Mechanosensation of tight junctions depends on ZO-1 phase separation
and flow,” Institute of Science and Technology Austria, 2019.
ista: Schwayer C. 2019. Mechanosensation of tight junctions depends on ZO-1 phase
separation and flow. Institute of Science and Technology Austria.
mla: Schwayer, Cornelia. Mechanosensation of Tight Junctions Depends on ZO-1
Phase Separation and Flow. Institute of Science and Technology Austria, 2019,
doi:10.15479/AT:ISTA:7186.
short: C. Schwayer, Mechanosensation of Tight Junctions Depends on ZO-1 Phase Separation
and Flow, Institute of Science and Technology Austria, 2019.
date_created: 2019-12-16T14:26:14Z
date_published: 2019-12-16T00:00:00Z
date_updated: 2023-09-07T12:56:42Z
day: '16'
ddc:
- '570'
degree_awarded: PhD
department:
- _id: CaHe
doi: 10.15479/AT:ISTA:7186
file:
- access_level: closed
checksum: 585583c1c875c5d9525703a539668a7c
content_type: application/zip
creator: cschwayer
date_created: 2019-12-19T15:18:11Z
date_updated: 2020-07-14T12:47:52Z
file_id: '7194'
file_name: DocumentSourceFiles.zip
file_size: 19431292
relation: source_file
- access_level: open_access
checksum: 9b9b24351514948d27cec659e632e2cd
content_type: application/pdf
creator: cschwayer
date_created: 2019-12-19T15:19:21Z
date_updated: 2020-07-14T12:47:52Z
file_id: '7195'
file_name: Thesis_CS_final.pdf
file_size: 19226428
relation: main_file
file_date_updated: 2020-07-14T12:47:52Z
has_accepted_license: '1'
language:
- iso: eng
month: '12'
oa: 1
oa_version: Published Version
page: '107'
publication_identifier:
issn:
- 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
related_material:
record:
- id: '1096'
relation: dissertation_contains
status: public
- id: '7001'
relation: part_of_dissertation
status: public
status: public
supervisor:
- first_name: Carl-Philipp J
full_name: Heisenberg, Carl-Philipp J
id: 39427864-F248-11E8-B48F-1D18A9856A87
last_name: Heisenberg
orcid: 0000-0002-0912-4566
title: Mechanosensation of tight junctions depends on ZO-1 phase separation and flow
type: dissertation
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
year: '2019'
...
---
_id: '6681'
abstract:
- lang: eng
text: "The first part of the thesis considers the computational aspects of the homotopy
groups πd(X) of a topological space X. It is well known that there is no algorithm
to decide whether the fundamental group π1(X) of a given finite simplicial complex
X is trivial. On the other hand, there are several algorithms that, given a finite
simplicial complex X that is simply connected (i.e., with π1(X) trivial), compute
the higher homotopy group πd(X) for any given d ≥ 2.\r\nHowever, these algorithms
come with a caveat: They compute the isomorphism type of πd(X), d ≥ 2 as an abstract
finitely generated abelian group given by generators and relations, but they work
with very implicit representations of the elements of πd(X). We present an algorithm
that, given a simply connected space X, computes πd(X) and represents its elements
as simplicial maps from suitable triangulations of the d-sphere Sd to X. For fixed
d, the algorithm runs in time exponential in size(X), the number of simplices
of X. Moreover, we prove that this is optimal: For every fixed d ≥ 2,\r\nwe construct
a family of simply connected spaces X such that for any simplicial map representing
a generator of πd(X), the size of the triangulation of S d on which the map is
defined, is exponential in size(X).\r\nIn the second part of the thesis, we prove
that the following question is algorithmically undecidable for d < ⌊3(k+1)/2⌋,
k ≥ 5 and (k, d) ̸= (5, 7), which covers essentially everything outside the meta-stable
range: Given a finite simplicial complex K of dimension k, decide whether there
exists a piecewise-linear (i.e., linear on an arbitrarily fine subdivision of
K) embedding f : K ↪→ Rd of K into a d-dimensional Euclidean space."
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Stephan Y
full_name: Zhechev, Stephan Y
id: 3AA52972-F248-11E8-B48F-1D18A9856A87
last_name: Zhechev
citation:
ama: Zhechev SY. Algorithmic aspects of homotopy theory and embeddability. 2019.
doi:10.15479/AT:ISTA:6681
apa: Zhechev, S. Y. (2019). Algorithmic aspects of homotopy theory and embeddability.
Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:6681
chicago: Zhechev, Stephan Y. “Algorithmic Aspects of Homotopy Theory and Embeddability.”
Institute of Science and Technology Austria, 2019. https://doi.org/10.15479/AT:ISTA:6681.
ieee: S. Y. Zhechev, “Algorithmic aspects of homotopy theory and embeddability,”
Institute of Science and Technology Austria, 2019.
ista: Zhechev SY. 2019. Algorithmic aspects of homotopy theory and embeddability.
Institute of Science and Technology Austria.
mla: Zhechev, Stephan Y. Algorithmic Aspects of Homotopy Theory and Embeddability.
Institute of Science and Technology Austria, 2019, doi:10.15479/AT:ISTA:6681.
short: S.Y. Zhechev, Algorithmic Aspects of Homotopy Theory and Embeddability, Institute
of Science and Technology Austria, 2019.
date_created: 2019-07-26T11:14:34Z
date_published: 2019-08-08T00:00:00Z
date_updated: 2023-09-07T13:10:36Z
day: '08'
ddc:
- '514'
degree_awarded: PhD
department:
- _id: UlWa
doi: 10.15479/AT:ISTA:6681
file:
- access_level: open_access
checksum: 3231e7cbfca3b5687366f84f0a57a0c0
content_type: application/pdf
creator: szhechev
date_created: 2019-08-07T13:02:50Z
date_updated: 2020-07-14T12:47:37Z
file_id: '6771'
file_name: Stephan_Zhechev_thesis.pdf
file_size: 1464227
relation: main_file
- access_level: closed
checksum: 85d65eb27b4377a9e332ee37a70f08b6
content_type: application/octet-stream
creator: szhechev
date_created: 2019-08-07T13:03:22Z
date_updated: 2020-07-14T12:47:37Z
file_id: '6772'
file_name: Stephan_Zhechev_thesis.tex
file_size: 303988
relation: source_file
- access_level: closed
checksum: 86b374d264ca2dd53e712728e253ee75
content_type: application/zip
creator: szhechev
date_created: 2019-08-07T13:03:34Z
date_updated: 2020-07-14T12:47:37Z
file_id: '6773'
file_name: supplementary_material.zip
file_size: 1087004
relation: supplementary_material
file_date_updated: 2020-07-14T12:47:37Z
has_accepted_license: '1'
language:
- iso: eng
month: '08'
oa: 1
oa_version: Published Version
page: '104'
publication_identifier:
issn:
- 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
related_material:
record:
- id: '6774'
relation: part_of_dissertation
status: public
status: public
supervisor:
- first_name: Uli
full_name: Wagner, Uli
id: 36690CA2-F248-11E8-B48F-1D18A9856A87
last_name: Wagner
orcid: 0000-0002-1494-0568
title: Algorithmic aspects of homotopy theory and embeddability
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: '2019'
...
---
_id: '8182'
abstract:
- lang: eng
text: "Suppose that $n\\neq p^k$ and $n\\neq 2p^k$ for all $k$ and all primes $p$.
We prove that for any Hausdorff compactum $X$ with a free action of the symmetric
group $\\mathfrak S_n$ there exists an $\\mathfrak S_n$-equivariant map $X \\to\r\n{\\mathbb
R}^n$ whose image avoids the diagonal $\\{(x,x\\dots,x)\\in {\\mathbb R}^n|x\\in
{\\mathbb R}\\}$.\r\n Previously, the special cases of this statement for certain
$X$ were usually proved using the equivartiant obstruction theory. Such calculations
are difficult and may become infeasible past the first (primary) obstruction.
We\r\ntake a different approach which allows us to prove the vanishing of all
obstructions simultaneously. The essential step in the proof is classifying the
possible degrees of $\\mathfrak S_n$-equivariant maps from the boundary\r\n$\\partial\\Delta^{n-1}$
of $(n-1)$-simplex to itself. Existence of equivariant maps between spaces is
important for many questions arising from discrete mathematics and geometry, such
as Kneser's conjecture, the Square Peg conjecture, the Splitting Necklace problem,
and the Topological Tverberg conjecture, etc. We demonstrate the utility of our
result applying it to one such question, a specific instance of envy-free division
problem."
article_number: '1910.12628'
article_processing_charge: No
author:
- first_name: Sergey
full_name: Avvakumov, Sergey
id: 3827DAC8-F248-11E8-B48F-1D18A9856A87
last_name: Avvakumov
- first_name: Sergey
full_name: Kudrya, Sergey
id: ecf01965-d252-11ea-95a5-8ada5f6c6a67
last_name: Kudrya
citation:
ama: Avvakumov S, Kudrya S. Vanishing of all equivariant obstructions and the mapping
degree. arXiv.
apa: Avvakumov, S., & Kudrya, S. (n.d.). Vanishing of all equivariant obstructions
and the mapping degree. arXiv. arXiv.
chicago: Avvakumov, Sergey, and Sergey Kudrya. “Vanishing of All Equivariant Obstructions
and the Mapping Degree.” ArXiv. arXiv, n.d.
ieee: S. Avvakumov and S. Kudrya, “Vanishing of all equivariant obstructions and
the mapping degree,” arXiv. arXiv.
ista: Avvakumov S, Kudrya S. Vanishing of all equivariant obstructions and the mapping
degree. arXiv, 1910.12628.
mla: Avvakumov, Sergey, and Sergey Kudrya. “Vanishing of All Equivariant Obstructions
and the Mapping Degree.” ArXiv, 1910.12628, arXiv.
short: S. Avvakumov, S. Kudrya, ArXiv (n.d.).
date_created: 2020-07-30T10:45:08Z
date_published: 2019-10-28T00:00:00Z
date_updated: 2023-09-07T13:12:17Z
day: '28'
department:
- _id: UlWa
external_id:
arxiv:
- '1910.12628'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1910.12628
month: '10'
oa: 1
oa_version: Preprint
project:
- _id: 26611F5C-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P31312
name: Algorithms for Embeddings and Homotopy Theory
publication: arXiv
publication_status: submitted
publisher: arXiv
related_material:
record:
- id: '11446'
relation: later_version
status: public
- id: '8156'
relation: dissertation_contains
status: public
status: public
title: Vanishing of all equivariant obstructions and the mapping degree
type: preprint
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2019'
...
---
_id: '8185'
abstract:
- lang: eng
text: "In this paper we study envy-free division problems. The classical approach
to some of such problems, used by David Gale, reduces to considering continuous
maps of a simplex to itself and finding sufficient conditions when this map hits
the center of the simplex. The mere continuity is not sufficient for such a conclusion,
the usual assumption (for example, in the Knaster--Kuratowski--Mazurkiewicz and
the Gale theorem) is a certain boundary condition.\r\n We follow Erel Segal-Halevi,
Fr\\'ed\\'eric Meunier, and Shira Zerbib, and replace the boundary condition by
another assumption, which has the economic meaning of possibility for a player
to prefer an empty part in the segment\r\npartition problem. We solve the problem
positively when $n$, the number of players that divide the segment, is a prime
power, and we provide counterexamples for every $n$ which is not a prime power.
We also provide counterexamples relevant to a wider class of fair or envy-free
partition problems when $n$ is odd and not a prime power."
article_number: '1907.11183'
article_processing_charge: No
author:
- first_name: Sergey
full_name: Avvakumov, Sergey
id: 3827DAC8-F248-11E8-B48F-1D18A9856A87
last_name: Avvakumov
- first_name: Roman
full_name: Karasev, Roman
last_name: Karasev
citation:
ama: Avvakumov S, Karasev R. Envy-free division using mapping degree. arXiv.
doi:10.48550/arXiv.1907.11183
apa: Avvakumov, S., & Karasev, R. (n.d.). Envy-free division using mapping degree.
arXiv. https://doi.org/10.48550/arXiv.1907.11183
chicago: Avvakumov, Sergey, and Roman Karasev. “Envy-Free Division Using Mapping
Degree.” ArXiv, n.d. https://doi.org/10.48550/arXiv.1907.11183.
ieee: S. Avvakumov and R. Karasev, “Envy-free division using mapping degree,” arXiv.
.
ista: Avvakumov S, Karasev R. Envy-free division using mapping degree. arXiv, 1907.11183.
mla: Avvakumov, Sergey, and Roman Karasev. “Envy-Free Division Using Mapping Degree.”
ArXiv, 1907.11183, doi:10.48550/arXiv.1907.11183.
short: S. Avvakumov, R. Karasev, ArXiv (n.d.).
date_created: 2020-07-30T10:45:51Z
date_published: 2019-07-25T00:00:00Z
date_updated: 2023-09-07T13:12:17Z
day: '25'
department:
- _id: UlWa
doi: 10.48550/arXiv.1907.11183
external_id:
arxiv:
- '1907.11183'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1907.11183
month: '07'
oa: 1
oa_version: Preprint
project:
- _id: 26611F5C-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P31312
name: Algorithms for Embeddings and Homotopy Theory
publication: arXiv
publication_status: submitted
related_material:
link:
- relation: later_version
url: https://doi.org/10.1112/mtk.12059
record:
- id: '8156'
relation: dissertation_contains
status: public
status: public
title: Envy-free division using mapping degree
type: preprint
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2019'
...
---
_id: '7524'
abstract:
- lang: eng
text: "We prove a lower bound for the free energy (per unit volume) of the two-dimensional
Bose gas in the thermodynamic limit. We show that the free energy at density $\\rho$
and inverse temperature $\\beta$ differs from the one of the non-interacting system
by the correction term $4 \\pi \\rho^2 |\\ln a^2 \\rho|^{-1} (2 - [1 - \\beta_{\\mathrm{c}}/\\beta]_+^2)$.
Here $a$ is the scattering length of the interaction potential, $[\\cdot]_+ =
\\max\\{ 0, \\cdot \\}$ and $\\beta_{\\mathrm{c}}$ is the inverse Berezinskii--Kosterlitz--Thouless
critical temperature for superfluidity. The result is valid in the dilute limit\r\n$a^2\\rho
\\ll 1$ and if $\\beta \\rho \\gtrsim 1$."
article_processing_charge: No
author:
- first_name: Andreas
full_name: Deuchert, Andreas
id: 4DA65CD0-F248-11E8-B48F-1D18A9856A87
last_name: Deuchert
orcid: 0000-0003-3146-6746
- first_name: Simon
full_name: Mayer, Simon
id: 30C4630A-F248-11E8-B48F-1D18A9856A87
last_name: Mayer
- first_name: Robert
full_name: Seiringer, Robert
id: 4AFD0470-F248-11E8-B48F-1D18A9856A87
last_name: Seiringer
orcid: 0000-0002-6781-0521
citation:
ama: Deuchert A, Mayer S, Seiringer R. The free energy of the two-dimensional dilute
Bose gas. I. Lower bound. arXiv:191003372.
apa: Deuchert, A., Mayer, S., & Seiringer, R. (n.d.). The free energy of the
two-dimensional dilute Bose gas. I. Lower bound. arXiv:1910.03372. ArXiv.
chicago: Deuchert, Andreas, Simon Mayer, and Robert Seiringer. “The Free Energy
of the Two-Dimensional Dilute Bose Gas. I. Lower Bound.” ArXiv:1910.03372.
ArXiv, n.d.
ieee: A. Deuchert, S. Mayer, and R. Seiringer, “The free energy of the two-dimensional
dilute Bose gas. I. Lower bound,” arXiv:1910.03372. ArXiv.
ista: Deuchert A, Mayer S, Seiringer R. The free energy of the two-dimensional dilute
Bose gas. I. Lower bound. arXiv:1910.03372, .
mla: Deuchert, Andreas, et al. “The Free Energy of the Two-Dimensional Dilute Bose
Gas. I. Lower Bound.” ArXiv:1910.03372, ArXiv.
short: A. Deuchert, S. Mayer, R. Seiringer, ArXiv:1910.03372 (n.d.).
date_created: 2020-02-26T08:46:40Z
date_published: 2019-10-08T00:00:00Z
date_updated: 2023-09-07T13:12:41Z
day: '08'
department:
- _id: RoSe
ec_funded: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1910.03372
month: '10'
oa: 1
oa_version: Preprint
page: '61'
project:
- _id: 25C6DC12-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '694227'
name: Analysis of quantum many-body systems
publication: arXiv:1910.03372
publication_status: draft
publisher: ArXiv
related_material:
record:
- id: '7790'
relation: later_version
status: public
- id: '7514'
relation: dissertation_contains
status: public
scopus_import: 1
status: public
title: The free energy of the two-dimensional dilute Bose gas. I. Lower bound
type: preprint
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2019'
...
---
_id: '6608'
abstract:
- lang: eng
text: We use the canonical bases produced by the tri-partition algorithm in (Edelsbrunner
and Ölsböck, 2018) to open and close holes in a polyhedral complex, K. In a concrete
application, we consider the Delaunay mosaic of a finite set, we let K be an Alpha
complex, and we use the persistence diagram of the distance function to guide
the hole opening and closing operations. The dependences between the holes define
a partial order on the cells in K that characterizes what can and what cannot
be constructed using the operations. The relations in this partial order reveal
structural information about the underlying filtration of complexes beyond what
is expressed by the persistence diagram.
article_processing_charge: No
author:
- first_name: Herbert
full_name: Edelsbrunner, Herbert
id: 3FB178DA-F248-11E8-B48F-1D18A9856A87
last_name: Edelsbrunner
orcid: 0000-0002-9823-6833
- first_name: Katharina
full_name: Ölsböck, Katharina
id: 4D4AA390-F248-11E8-B48F-1D18A9856A87
last_name: Ölsböck
orcid: 0000-0002-4672-8297
citation:
ama: Edelsbrunner H, Ölsböck K. Holes and dependences in an ordered complex. Computer
Aided Geometric Design. 2019;73:1-15. doi:10.1016/j.cagd.2019.06.003
apa: Edelsbrunner, H., & Ölsböck, K. (2019). Holes and dependences in an ordered
complex. Computer Aided Geometric Design. Elsevier. https://doi.org/10.1016/j.cagd.2019.06.003
chicago: Edelsbrunner, Herbert, and Katharina Ölsböck. “Holes and Dependences in
an Ordered Complex.” Computer Aided Geometric Design. Elsevier, 2019. https://doi.org/10.1016/j.cagd.2019.06.003.
ieee: H. Edelsbrunner and K. Ölsböck, “Holes and dependences in an ordered complex,”
Computer Aided Geometric Design, vol. 73. Elsevier, pp. 1–15, 2019.
ista: Edelsbrunner H, Ölsböck K. 2019. Holes and dependences in an ordered complex.
Computer Aided Geometric Design. 73, 1–15.
mla: Edelsbrunner, Herbert, and Katharina Ölsböck. “Holes and Dependences in an
Ordered Complex.” Computer Aided Geometric Design, vol. 73, Elsevier, 2019,
pp. 1–15, doi:10.1016/j.cagd.2019.06.003.
short: H. Edelsbrunner, K. Ölsböck, Computer Aided Geometric Design 73 (2019) 1–15.
date_created: 2019-07-07T21:59:20Z
date_published: 2019-08-01T00:00:00Z
date_updated: 2023-09-07T13:15:29Z
day: '01'
ddc:
- '000'
department:
- _id: HeEd
doi: 10.1016/j.cagd.2019.06.003
ec_funded: 1
external_id:
isi:
- '000485207800001'
file:
- access_level: open_access
checksum: 7c99be505dc7533257d42eb1830cef04
content_type: application/pdf
creator: kschuh
date_created: 2019-07-08T15:24:26Z
date_updated: 2020-07-14T12:47:34Z
file_id: '6624'
file_name: Elsevier_2019_Edelsbrunner.pdf
file_size: 2665013
relation: main_file
file_date_updated: 2020-07-14T12:47:34Z
has_accepted_license: '1'
intvolume: ' 73'
isi: 1
language:
- iso: eng
month: '08'
oa: 1
oa_version: Published Version
page: 1-15
project:
- _id: 266A2E9E-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '788183'
name: Alpha Shape Theory Extended
- _id: 2561EBF4-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: I02979-N35
name: Persistence and stability of geometric complexes
publication: Computer Aided Geometric Design
publication_status: published
publisher: Elsevier
quality_controlled: '1'
related_material:
record:
- id: '7460'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: Holes and dependences in an ordered complex
tmp:
image: /images/cc_by_nc_nd.png
legal_code_url: https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode
name: Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International
(CC BY-NC-ND 4.0)
short: CC BY-NC-ND (4.0)
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 73
year: '2019'
...
---
_id: '6677'
abstract:
- lang: eng
text: "The Fiat-Shamir heuristic transforms a public-coin interactive proof into
a non-interactive argument, by replacing the verifier with a cryptographic hash
function that is applied to the protocol’s transcript. Constructing hash functions
for which this transformation is sound is a central and long-standing open question
in cryptography.\r\n\r\nWe show that solving the END−OF−METERED−LINE problem is
no easier than breaking the soundness of the Fiat-Shamir transformation when applied
to the sumcheck protocol. In particular, if the transformed protocol is sound,
then any hard problem in #P gives rise to a hard distribution in the class CLS,
which is contained in PPAD. Our result opens up the possibility of sampling moderately-sized
games for which it is hard to find a Nash equilibrium, by reducing the inversion
of appropriately chosen one-way functions to #SAT.\r\n\r\nOur main technical contribution
is a stateful incrementally verifiable procedure that, given a SAT instance over
n variables, counts the number of satisfying assignments. This is accomplished
via an exponential sequence of small steps, each computable in time poly(n). Incremental
verifiability means that each intermediate state includes a sumcheck-based proof
of its correctness, and the proof can be updated and verified in time poly(n)."
article_processing_charge: No
author:
- first_name: Arka Rai
full_name: Choudhuri, Arka Rai
last_name: Choudhuri
- first_name: Pavel
full_name: Hubáček, Pavel
last_name: Hubáček
- first_name: Chethan
full_name: Kamath Hosdurg, Chethan
id: 4BD3F30E-F248-11E8-B48F-1D18A9856A87
last_name: Kamath Hosdurg
- first_name: Krzysztof Z
full_name: Pietrzak, Krzysztof Z
id: 3E04A7AA-F248-11E8-B48F-1D18A9856A87
last_name: Pietrzak
orcid: 0000-0002-9139-1654
- first_name: Alon
full_name: Rosen, Alon
last_name: Rosen
- first_name: Guy N.
full_name: Rothblum, Guy N.
last_name: Rothblum
citation:
ama: 'Choudhuri AR, Hubáček P, Kamath Hosdurg C, Pietrzak KZ, Rosen A, Rothblum
GN. Finding a Nash equilibrium is no easier than breaking Fiat-Shamir. In: Proceedings
of the 51st Annual ACM SIGACT Symposium on Theory of Computing - STOC 2019.
ACM Press; 2019:1103-1114. doi:10.1145/3313276.3316400'
apa: 'Choudhuri, A. R., Hubáček, P., Kamath Hosdurg, C., Pietrzak, K. Z., Rosen,
A., & Rothblum, G. N. (2019). Finding a Nash equilibrium is no easier than
breaking Fiat-Shamir. In Proceedings of the 51st Annual ACM SIGACT Symposium
on Theory of Computing - STOC 2019 (pp. 1103–1114). Phoenix, AZ, United States:
ACM Press. https://doi.org/10.1145/3313276.3316400'
chicago: Choudhuri, Arka Rai, Pavel Hubáček, Chethan Kamath Hosdurg, Krzysztof Z
Pietrzak, Alon Rosen, and Guy N. Rothblum. “Finding a Nash Equilibrium Is No Easier
than Breaking Fiat-Shamir.” In Proceedings of the 51st Annual ACM SIGACT Symposium
on Theory of Computing - STOC 2019, 1103–14. ACM Press, 2019. https://doi.org/10.1145/3313276.3316400.
ieee: A. R. Choudhuri, P. Hubáček, C. Kamath Hosdurg, K. Z. Pietrzak, A. Rosen,
and G. N. Rothblum, “Finding a Nash equilibrium is no easier than breaking Fiat-Shamir,”
in Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing
- STOC 2019, Phoenix, AZ, United States, 2019, pp. 1103–1114.
ista: 'Choudhuri AR, Hubáček P, Kamath Hosdurg C, Pietrzak KZ, Rosen A, Rothblum
GN. 2019. Finding a Nash equilibrium is no easier than breaking Fiat-Shamir. Proceedings
of the 51st Annual ACM SIGACT Symposium on Theory of Computing - STOC 2019. STOC:
Symposium on Theory of Computing, 1103–1114.'
mla: Choudhuri, Arka Rai, et al. “Finding a Nash Equilibrium Is No Easier than Breaking
Fiat-Shamir.” Proceedings of the 51st Annual ACM SIGACT Symposium on Theory
of Computing - STOC 2019, ACM Press, 2019, pp. 1103–14, doi:10.1145/3313276.3316400.
short: A.R. Choudhuri, P. Hubáček, C. Kamath Hosdurg, K.Z. Pietrzak, A. Rosen, G.N.
Rothblum, in:, Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of
Computing - STOC 2019, ACM Press, 2019, pp. 1103–1114.
conference:
end_date: 2019-06-26
location: Phoenix, AZ, United States
name: 'STOC: Symposium on Theory of Computing'
start_date: 2019-06-23
date_created: 2019-07-24T09:20:53Z
date_published: 2019-06-01T00:00:00Z
date_updated: 2023-09-07T13:15:55Z
day: '01'
department:
- _id: KrPi
doi: 10.1145/3313276.3316400
ec_funded: 1
external_id:
isi:
- '000523199100100'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://eprint.iacr.org/2019/549
month: '06'
oa: 1
oa_version: Preprint
page: 1103-1114
project:
- _id: 258AA5B2-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '682815'
name: Teaching Old Crypto New Tricks
publication: Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing -
STOC 2019
publication_identifier:
isbn:
- '9781450367059'
publication_status: published
publisher: ACM Press
quality_controlled: '1'
related_material:
record:
- id: '7896'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: Finding a Nash equilibrium is no easier than breaking Fiat-Shamir
type: conference
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
year: '2019'
...
---
_id: '5986'
abstract:
- lang: eng
text: "Given a triangulation of a point set in the plane, a flip deletes an edge
e whose removal leaves a convex quadrilateral, and replaces e by the opposite
diagonal of the quadrilateral. It is well known that any triangulation of a point
set can be reconfigured to any other triangulation by some sequence of flips.
We explore this question in the setting where each edge of a triangulation has
a label, and a flip transfers the label of the removed edge to the new edge. It
is not true that every labelled triangulation of a point set can be reconfigured
to every other labelled triangulation via a sequence of flips, but we characterize
when this is possible. There is an obvious necessary condition: for each label
l, if edge e has label l in the first triangulation and edge f has label l in
the second triangulation, then there must be some sequence of flips that moves
label l from e to f, ignoring all other labels. Bose, Lubiw, Pathak and Verdonschot
formulated the Orbit Conjecture, which states that this necessary condition is
also sufficient, i.e. that all labels can be simultaneously mapped to their destination
if and only if each label individually can be mapped to its destination. We prove
this conjecture. Furthermore, we give a polynomial-time algorithm (with \U0001D442(\U0001D45B8)
being a crude bound on the run-time) to find a sequence of flips to reconfigure
one labelled triangulation to another, if such a sequence exists, and we prove
an upper bound of \U0001D442(\U0001D45B7) on the length of the flip sequence.
Our proof uses the topological result that the sets of pairwise non-crossing edges
on a planar point set form a simplicial complex that is homeomorphic to a high-dimensional
ball (this follows from a result of Orden and Santos; we give a different proof
based on a shelling argument). The dual cell complex of this simplicial ball,
called the flip complex, has the usual flip graph as its 1-skeleton. We use properties
of the 2-skeleton of the flip complex to prove the Orbit Conjecture."
article_processing_charge: Yes (via OA deal)
article_type: original
author:
- first_name: Anna
full_name: Lubiw, Anna
last_name: Lubiw
- first_name: Zuzana
full_name: Masárová, Zuzana
id: 45CFE238-F248-11E8-B48F-1D18A9856A87
last_name: Masárová
orcid: 0000-0002-6660-1322
- first_name: Uli
full_name: Wagner, Uli
id: 36690CA2-F248-11E8-B48F-1D18A9856A87
last_name: Wagner
orcid: 0000-0002-1494-0568
citation:
ama: Lubiw A, Masárová Z, Wagner U. A proof of the orbit conjecture for flipping
edge-labelled triangulations. Discrete & Computational Geometry. 2019;61(4):880-898.
doi:10.1007/s00454-018-0035-8
apa: Lubiw, A., Masárová, Z., & Wagner, U. (2019). A proof of the orbit conjecture
for flipping edge-labelled triangulations. Discrete & Computational Geometry.
Springer Nature. https://doi.org/10.1007/s00454-018-0035-8
chicago: Lubiw, Anna, Zuzana Masárová, and Uli Wagner. “A Proof of the Orbit Conjecture
for Flipping Edge-Labelled Triangulations.” Discrete & Computational Geometry.
Springer Nature, 2019. https://doi.org/10.1007/s00454-018-0035-8.
ieee: A. Lubiw, Z. Masárová, and U. Wagner, “A proof of the orbit conjecture for
flipping edge-labelled triangulations,” Discrete & Computational Geometry,
vol. 61, no. 4. Springer Nature, pp. 880–898, 2019.
ista: Lubiw A, Masárová Z, Wagner U. 2019. A proof of the orbit conjecture for flipping
edge-labelled triangulations. Discrete & Computational Geometry. 61(4), 880–898.
mla: Lubiw, Anna, et al. “A Proof of the Orbit Conjecture for Flipping Edge-Labelled
Triangulations.” Discrete & Computational Geometry, vol. 61, no. 4,
Springer Nature, 2019, pp. 880–98, doi:10.1007/s00454-018-0035-8.
short: A. Lubiw, Z. Masárová, U. Wagner, Discrete & Computational Geometry 61
(2019) 880–898.
date_created: 2019-02-14T11:54:08Z
date_published: 2019-06-01T00:00:00Z
date_updated: 2023-09-07T13:17:36Z
day: '01'
ddc:
- '000'
department:
- _id: UlWa
doi: 10.1007/s00454-018-0035-8
external_id:
arxiv:
- '1710.02741'
isi:
- '000466130000009'
file:
- access_level: open_access
checksum: e1bff88f1d77001b53b78c485ce048d7
content_type: application/pdf
creator: dernst
date_created: 2019-02-14T11:57:22Z
date_updated: 2020-07-14T12:47:14Z
file_id: '5988'
file_name: 2018_DiscreteGeometry_Lubiw.pdf
file_size: 556276
relation: main_file
file_date_updated: 2020-07-14T12:47:14Z
has_accepted_license: '1'
intvolume: ' 61'
isi: 1
issue: '4'
language:
- iso: eng
month: '06'
oa: 1
oa_version: Published Version
page: 880-898
project:
- _id: B67AFEDC-15C9-11EA-A837-991A96BB2854
name: IST Austria Open Access Fund
publication: Discrete & Computational Geometry
publication_identifier:
eissn:
- 1432-0444
issn:
- 0179-5376
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
related_material:
record:
- id: '683'
relation: earlier_version
status: public
- id: '7944'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: A proof of the orbit conjecture for flipping edge-labelled triangulations
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 61
year: '2019'
...
---
_id: '5886'
abstract:
- lang: eng
text: Problems involving quantum impurities, in which one or a few particles are
interacting with a macroscopic environment, represent a pervasive paradigm, spanning
across atomic, molecular, and condensed-matter physics. In this paper we introduce
new variational approaches to quantum impurities and apply them to the Fröhlich
polaron–a quasiparticle formed out of an electron (or other point-like impurity)
in a polar medium, and to the angulon–a quasiparticle formed out of a rotating
molecule in a bosonic bath. We benchmark these approaches against established
theories, evaluating their accuracy as a function of the impurity-bath coupling.
article_processing_charge: No
author:
- first_name: Xiang
full_name: Li, Xiang
id: 4B7E523C-F248-11E8-B48F-1D18A9856A87
last_name: Li
- first_name: Giacomo
full_name: Bighin, Giacomo
id: 4CA96FD4-F248-11E8-B48F-1D18A9856A87
last_name: Bighin
orcid: 0000-0001-8823-9777
- first_name: Enderalp
full_name: Yakaboylu, Enderalp
id: 38CB71F6-F248-11E8-B48F-1D18A9856A87
last_name: Yakaboylu
orcid: 0000-0001-5973-0874
- first_name: Mikhail
full_name: Lemeshko, Mikhail
id: 37CB05FA-F248-11E8-B48F-1D18A9856A87
last_name: Lemeshko
orcid: 0000-0002-6990-7802
citation:
ama: 'Li X, Bighin G, Yakaboylu E, Lemeshko M. Variational approaches to quantum
impurities: from the Fröhlich polaron to the angulon. Molecular Physics.
2019. doi:10.1080/00268976.2019.1567852'
apa: 'Li, X., Bighin, G., Yakaboylu, E., & Lemeshko, M. (2019). Variational
approaches to quantum impurities: from the Fröhlich polaron to the angulon. Molecular
Physics. Taylor and Francis. https://doi.org/10.1080/00268976.2019.1567852'
chicago: 'Li, Xiang, Giacomo Bighin, Enderalp Yakaboylu, and Mikhail Lemeshko. “Variational
Approaches to Quantum Impurities: From the Fröhlich Polaron to the Angulon.” Molecular
Physics. Taylor and Francis, 2019. https://doi.org/10.1080/00268976.2019.1567852.'
ieee: 'X. Li, G. Bighin, E. Yakaboylu, and M. Lemeshko, “Variational approaches
to quantum impurities: from the Fröhlich polaron to the angulon,” Molecular
Physics. Taylor and Francis, 2019.'
ista: 'Li X, Bighin G, Yakaboylu E, Lemeshko M. 2019. Variational approaches to
quantum impurities: from the Fröhlich polaron to the angulon. Molecular Physics.'
mla: 'Li, Xiang, et al. “Variational Approaches to Quantum Impurities: From the
Fröhlich Polaron to the Angulon.” Molecular Physics, Taylor and Francis,
2019, doi:10.1080/00268976.2019.1567852.'
short: X. Li, G. Bighin, E. Yakaboylu, M. Lemeshko, Molecular Physics (2019).
date_created: 2019-01-27T22:59:10Z
date_published: 2019-01-18T00:00:00Z
date_updated: 2023-09-07T13:16:42Z
day: '18'
ddc:
- '530'
department:
- _id: MiLe
doi: 10.1080/00268976.2019.1567852
ec_funded: 1
external_id:
isi:
- '000474641400008'
file:
- access_level: open_access
checksum: 178964744b636a6f036372f4f090a657
content_type: application/pdf
creator: dernst
date_created: 2019-01-29T08:32:57Z
date_updated: 2020-07-14T12:47:13Z
file_id: '5896'
file_name: 2019_MolecularPhysics_Li.pdf
file_size: 1309966
relation: main_file
file_date_updated: 2020-07-14T12:47:13Z
has_accepted_license: '1'
isi: 1
language:
- iso: eng
month: '01'
oa: 1
oa_version: Published Version
project:
- _id: 26031614-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P29902
name: Quantum rotations in the presence of a many-body environment
- _id: 25681D80-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '291734'
name: International IST Postdoc Fellowship Programme
publication: Molecular Physics
publication_identifier:
issn:
- '00268976'
publication_status: published
publisher: Taylor and Francis
quality_controlled: '1'
related_material:
record:
- id: '8958'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: 'Variational approaches to quantum impurities: from the Fröhlich polaron to
the angulon'
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
year: '2019'
...
---
_id: '6556'
abstract:
- lang: eng
text: 'Motivated by fixed-parameter tractable (FPT) problems in computational topology,
we consider the treewidth tw(M) of a compact, connected 3-manifold M, defined
to be the minimum treewidth of the face pairing graph of any triangulation T of
M. In this setting the relationship between the topology of a 3-manifold and its
treewidth is of particular interest. First, as a corollary of work of Jaco and
Rubinstein, we prove that for any closed, orientable 3-manifold M the treewidth
tw(M) is at most 4g(M)-2, where g(M) denotes Heegaard genus of M. In combination
with our earlier work with Wagner, this yields that for non-Haken manifolds the
Heegaard genus and the treewidth are within a constant factor. Second, we characterize
all 3-manifolds of treewidth one: These are precisely the lens spaces and a single
other Seifert fibered space. Furthermore, we show that all remaining orientable
Seifert fibered spaces over the 2-sphere or a non-orientable surface have treewidth
two. In particular, for every spherical 3-manifold we exhibit a triangulation
of treewidth at most two. Our results further validate the parameter of treewidth
(and other related parameters such as cutwidth or congestion) to be useful for
topological computing, and also shed more light on the scope of existing FPT-algorithms
in the field.'
alternative_title:
- LIPIcs
article_processing_charge: No
author:
- first_name: Kristóf
full_name: Huszár, Kristóf
id: 33C26278-F248-11E8-B48F-1D18A9856A87
last_name: Huszár
orcid: 0000-0002-5445-5057
- first_name: Jonathan
full_name: Spreer, Jonathan
last_name: Spreer
citation:
ama: 'Huszár K, Spreer J. 3-manifold triangulations with small treewidth. In: 35th
International Symposium on Computational Geometry. Vol 129. Schloss Dagstuhl
- Leibniz-Zentrum für Informatik; 2019:44:1-44:20. doi:10.4230/LIPIcs.SoCG.2019.44'
apa: 'Huszár, K., & Spreer, J. (2019). 3-manifold triangulations with small
treewidth. In 35th International Symposium on Computational Geometry (Vol.
129, p. 44:1-44:20). Portland, Oregon, United States: Schloss Dagstuhl - Leibniz-Zentrum
für Informatik. https://doi.org/10.4230/LIPIcs.SoCG.2019.44'
chicago: Huszár, Kristóf, and Jonathan Spreer. “3-Manifold Triangulations with Small
Treewidth.” In 35th International Symposium on Computational Geometry,
129:44:1-44:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. https://doi.org/10.4230/LIPIcs.SoCG.2019.44.
ieee: K. Huszár and J. Spreer, “3-manifold triangulations with small treewidth,”
in 35th International Symposium on Computational Geometry, Portland, Oregon,
United States, 2019, vol. 129, p. 44:1-44:20.
ista: 'Huszár K, Spreer J. 2019. 3-manifold triangulations with small treewidth.
35th International Symposium on Computational Geometry. SoCG: Symposium on Computational
Geometry, LIPIcs, vol. 129, 44:1-44:20.'
mla: Huszár, Kristóf, and Jonathan Spreer. “3-Manifold Triangulations with Small
Treewidth.” 35th International Symposium on Computational Geometry, vol.
129, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, p. 44:1-44:20, doi:10.4230/LIPIcs.SoCG.2019.44.
short: K. Huszár, J. Spreer, in:, 35th International Symposium on Computational
Geometry, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, p. 44:1-44:20.
conference:
end_date: 2019-06-21
location: Portland, Oregon, United States
name: 'SoCG: Symposium on Computational Geometry'
start_date: 2019-06-18
date_created: 2019-06-11T20:09:57Z
date_published: 2019-06-01T00:00:00Z
date_updated: 2023-09-07T13:18:26Z
day: '01'
ddc:
- '516'
department:
- _id: UlWa
doi: 10.4230/LIPIcs.SoCG.2019.44
external_id:
arxiv:
- '1812.05528'
file:
- access_level: open_access
checksum: 29d18c435368468aa85823dabb157e43
content_type: application/pdf
creator: kschuh
date_created: 2019-06-12T06:45:33Z
date_updated: 2020-07-14T12:47:33Z
file_id: '6557'
file_name: 2019_LIPIcs-Huszar.pdf
file_size: 905885
relation: main_file
file_date_updated: 2020-07-14T12:47:33Z
has_accepted_license: '1'
intvolume: ' 129'
keyword:
- computational 3-manifold topology
- fixed-parameter tractability
- layered triangulations
- structural graph theory
- treewidth
- cutwidth
- Heegaard genus
language:
- iso: eng
month: '06'
oa: 1
oa_version: Published Version
page: 44:1-44:20
publication: 35th International Symposium on Computational Geometry
publication_identifier:
isbn:
- 978-3-95977-104-7
issn:
- 1868-8969
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
quality_controlled: '1'
related_material:
record:
- id: '8032'
relation: part_of_dissertation
status: public
scopus_import: '1'
status: public
title: 3-manifold triangulations with small treewidth
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: 129
year: '2019'
...
---
_id: '7093'
abstract:
- lang: eng
text: "In graph theory, as well as in 3-manifold topology, there exist several width-type
parameters to describe how \"simple\" or \"thin\" a given graph or 3-manifold
is. These parameters, such as pathwidth or treewidth for graphs, or the concept
of thin position for 3-manifolds, play an important role when studying algorithmic
problems; in particular, there is a variety of problems in computational 3-manifold
topology - some of them known to be computationally hard in general - that become
solvable in polynomial time as soon as the dual graph of the input triangulation
has bounded treewidth.\r\nIn view of these algorithmic results, it is natural
to ask whether every 3-manifold admits a triangulation of bounded treewidth. We
show that this is not the case, i.e., that there exists an infinite family of
closed 3-manifolds not admitting triangulations of bounded pathwidth or treewidth
(the latter implies the former, but we present two separate proofs).\r\nWe derive
these results from work of Agol, of Scharlemann and Thompson, and of Scharlemann,
Schultens and Saito by exhibiting explicit connections between the topology of
a 3-manifold M on the one hand and width-type parameters of the dual graphs of
triangulations of M on the other hand, answering a question that had been raised
repeatedly by researchers in computational 3-manifold topology. In particular,
we show that if a closed, orientable, irreducible, non-Haken 3-manifold M has
a triangulation of treewidth (resp. pathwidth) k then the Heegaard genus of M
is at most 18(k+1) (resp. 4(3k+1))."
article_processing_charge: No
article_type: original
author:
- first_name: Kristóf
full_name: Huszár, Kristóf
id: 33C26278-F248-11E8-B48F-1D18A9856A87
last_name: Huszár
orcid: 0000-0002-5445-5057
- first_name: Jonathan
full_name: Spreer, Jonathan
last_name: Spreer
- first_name: Uli
full_name: Wagner, Uli
id: 36690CA2-F248-11E8-B48F-1D18A9856A87
last_name: Wagner
orcid: 0000-0002-1494-0568
citation:
ama: Huszár K, Spreer J, Wagner U. On the treewidth of triangulated 3-manifolds.
Journal of Computational Geometry. 2019;10(2):70–98. doi:10.20382/JOGC.V10I2A5
apa: Huszár, K., Spreer, J., & Wagner, U. (2019). On the treewidth of triangulated
3-manifolds. Journal of Computational Geometry. Computational Geometry
Laborartoy. https://doi.org/10.20382/JOGC.V10I2A5
chicago: Huszár, Kristóf, Jonathan Spreer, and Uli Wagner. “On the Treewidth of
Triangulated 3-Manifolds.” Journal of Computational Geometry. Computational
Geometry Laborartoy, 2019. https://doi.org/10.20382/JOGC.V10I2A5.
ieee: K. Huszár, J. Spreer, and U. Wagner, “On the treewidth of triangulated 3-manifolds,”
Journal of Computational Geometry, vol. 10, no. 2. Computational Geometry
Laborartoy, pp. 70–98, 2019.
ista: Huszár K, Spreer J, Wagner U. 2019. On the treewidth of triangulated 3-manifolds.
Journal of Computational Geometry. 10(2), 70–98.
mla: Huszár, Kristóf, et al. “On the Treewidth of Triangulated 3-Manifolds.” Journal
of Computational Geometry, vol. 10, no. 2, Computational Geometry Laborartoy,
2019, pp. 70–98, doi:10.20382/JOGC.V10I2A5.
short: K. Huszár, J. Spreer, U. Wagner, Journal of Computational Geometry 10 (2019)
70–98.
date_created: 2019-11-23T12:14:09Z
date_published: 2019-11-01T00:00:00Z
date_updated: 2023-09-07T13:18:26Z
day: '01'
ddc:
- '514'
department:
- _id: UlWa
doi: 10.20382/JOGC.V10I2A5
external_id:
arxiv:
- '1712.00434'
file:
- access_level: open_access
checksum: c872d590d38d538404782bca20c4c3f5
content_type: application/pdf
creator: khuszar
date_created: 2019-11-23T12:35:16Z
date_updated: 2020-07-14T12:47:49Z
file_id: '7094'
file_name: 479-1917-1-PB.pdf
file_size: 857590
relation: main_file
file_date_updated: 2020-07-14T12:47:49Z
has_accepted_license: '1'
intvolume: ' 10'
issue: '2'
language:
- iso: eng
month: '11'
oa: 1
oa_version: Published Version
page: 70–98
publication: Journal of Computational Geometry
publication_identifier:
issn:
- 1920-180X
publication_status: published
publisher: Computational Geometry Laborartoy
quality_controlled: '1'
related_material:
record:
- id: '285'
relation: earlier_version
status: public
- id: '8032'
relation: part_of_dissertation
status: public
status: public
title: On the treewidth of triangulated 3-manifolds
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 10
year: '2019'
...
---
_id: '7197'
abstract:
- lang: eng
text: During bacterial cell division, the tubulin-homolog FtsZ forms a ring-like
structure at the center of the cell. This Z-ring not only organizes the division
machinery, but treadmilling of FtsZ filaments was also found to play a key role
in distributing proteins at the division site. What regulates the architecture,
dynamics and stability of the Z-ring is currently unknown, but FtsZ-associated
proteins are known to play an important role. Here, using an in vitro reconstitution
approach, we studied how the well-conserved protein ZapA affects FtsZ treadmilling
and filament organization into large-scale patterns. Using high-resolution fluorescence
microscopy and quantitative image analysis, we found that ZapA cooperatively increases
the spatial order of the filament network, but binds only transiently to FtsZ
filaments and has no effect on filament length and treadmilling velocity. Together,
our data provides a model for how FtsZ-associated proteins can increase the precision
and stability of the bacterial cell division machinery in a switch-like manner.
acknowledged_ssus:
- _id: LifeSc
- _id: Bio
article_number: '5744'
article_processing_charge: No
article_type: original
author:
- first_name: Paulo R
full_name: Dos Santos Caldas, Paulo R
id: 38FCDB4C-F248-11E8-B48F-1D18A9856A87
last_name: Dos Santos Caldas
orcid: 0000-0001-6730-4461
- first_name: Maria D
full_name: Lopez Pelegrin, Maria D
id: 319AA9CE-F248-11E8-B48F-1D18A9856A87
last_name: Lopez Pelegrin
- first_name: Daniel J. G.
full_name: Pearce, Daniel J. G.
last_name: Pearce
- first_name: Nazmi B
full_name: Budanur, Nazmi B
id: 3EA1010E-F248-11E8-B48F-1D18A9856A87
last_name: Budanur
orcid: 0000-0003-0423-5010
- first_name: Jan
full_name: Brugués, Jan
last_name: Brugués
- first_name: Martin
full_name: Loose, Martin
id: 462D4284-F248-11E8-B48F-1D18A9856A87
last_name: Loose
orcid: 0000-0001-7309-9724
citation:
ama: Dos Santos Caldas PR, Lopez Pelegrin MD, Pearce DJG, Budanur NB, Brugués J,
Loose M. Cooperative ordering of treadmilling filaments in cytoskeletal networks
of FtsZ and its crosslinker ZapA. Nature Communications. 2019;10. doi:10.1038/s41467-019-13702-4
apa: Dos Santos Caldas, P. R., Lopez Pelegrin, M. D., Pearce, D. J. G., Budanur,
N. B., Brugués, J., & Loose, M. (2019). Cooperative ordering of treadmilling
filaments in cytoskeletal networks of FtsZ and its crosslinker ZapA. Nature
Communications. Springer Nature. https://doi.org/10.1038/s41467-019-13702-4
chicago: Dos Santos Caldas, Paulo R, Maria D Lopez Pelegrin, Daniel J. G. Pearce,
Nazmi B Budanur, Jan Brugués, and Martin Loose. “Cooperative Ordering of Treadmilling
Filaments in Cytoskeletal Networks of FtsZ and Its Crosslinker ZapA.” Nature
Communications. Springer Nature, 2019. https://doi.org/10.1038/s41467-019-13702-4.
ieee: P. R. Dos Santos Caldas, M. D. Lopez Pelegrin, D. J. G. Pearce, N. B. Budanur,
J. Brugués, and M. Loose, “Cooperative ordering of treadmilling filaments in cytoskeletal
networks of FtsZ and its crosslinker ZapA,” Nature Communications, vol.
10. Springer Nature, 2019.
ista: Dos Santos Caldas PR, Lopez Pelegrin MD, Pearce DJG, Budanur NB, Brugués J,
Loose M. 2019. Cooperative ordering of treadmilling filaments in cytoskeletal
networks of FtsZ and its crosslinker ZapA. Nature Communications. 10, 5744.
mla: Dos Santos Caldas, Paulo R., et al. “Cooperative Ordering of Treadmilling Filaments
in Cytoskeletal Networks of FtsZ and Its Crosslinker ZapA.” Nature Communications,
vol. 10, 5744, Springer Nature, 2019, doi:10.1038/s41467-019-13702-4.
short: P.R. Dos Santos Caldas, M.D. Lopez Pelegrin, D.J.G. Pearce, N.B. Budanur,
J. Brugués, M. Loose, Nature Communications 10 (2019).
date_created: 2019-12-20T12:22:57Z
date_published: 2019-12-17T00:00:00Z
date_updated: 2023-09-07T13:18:51Z
day: '17'
ddc:
- '570'
department:
- _id: MaLo
- _id: BjHo
doi: 10.1038/s41467-019-13702-4
ec_funded: 1
external_id:
isi:
- '000503009300001'
file:
- access_level: open_access
checksum: a1b44b427ba341383197790d0e8789fa
content_type: application/pdf
creator: dernst
date_created: 2019-12-23T07:34:56Z
date_updated: 2020-07-14T12:47:53Z
file_id: '7208'
file_name: 2019_NatureComm_Caldas.pdf
file_size: 8488733
relation: main_file
file_date_updated: 2020-07-14T12:47:53Z
has_accepted_license: '1'
intvolume: ' 10'
isi: 1
language:
- iso: eng
month: '12'
oa: 1
oa_version: Published Version
project:
- _id: 2595697A-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '679239'
name: Self-Organization of the Bacterial Cell
- _id: 260D98C8-B435-11E9-9278-68D0E5697425
name: Reconstitution of Bacterial Cell Division Using Purified Components
publication: Nature Communications
publication_identifier:
issn:
- 2041-1723
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
related_material:
record:
- id: '8358'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: Cooperative ordering of treadmilling filaments in cytoskeletal networks of
FtsZ and its crosslinker ZapA
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 10
year: '2019'
...