---
_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
license: https://creativecommons.org/licenses/by-nc-nd/4.0/
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
license: https://creativecommons.org/licenses/by/4.0/
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'
...
---
_id: '7210'
abstract:
- lang: eng
text: The rate of biological evolution depends on the fixation probability and on
the fixation time of new mutants. Intensive research has focused on identifying
population structures that augment the fixation probability of advantageous mutants.
But these amplifiers of natural selection typically increase fixation time. Here
we study population structures that achieve a tradeoff between fixation probability
and time. First, we show that no amplifiers can have an asymptotically lower absorption
time than the well-mixed population. Then we design population structures that
substantially augment the fixation probability with just a minor increase in fixation
time. Finally, we show that those structures enable higher effective rate of evolution
than the well-mixed population provided that the rate of generating advantageous
mutants is relatively low. Our work sheds light on how population structure affects
the rate of evolution. Moreover, our structures could be useful for lab-based,
medical, or industrial applications of evolutionary optimization.
article_number: '138'
article_processing_charge: No
article_type: original
author:
- first_name: Josef
full_name: Tkadlec, Josef
id: 3F24CCC8-F248-11E8-B48F-1D18A9856A87
last_name: Tkadlec
orcid: 0000-0002-1097-9684
- first_name: Andreas
full_name: Pavlogiannis, Andreas
id: 49704004-F248-11E8-B48F-1D18A9856A87
last_name: Pavlogiannis
orcid: 0000-0002-8943-0722
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Martin A.
full_name: Nowak, Martin A.
last_name: Nowak
citation:
ama: Tkadlec J, Pavlogiannis A, Chatterjee K, Nowak MA. Population structure determines
the tradeoff between fixation probability and fixation time. Communications
Biology. 2019;2. doi:10.1038/s42003-019-0373-y
apa: Tkadlec, J., Pavlogiannis, A., Chatterjee, K., & Nowak, M. A. (2019). Population
structure determines the tradeoff between fixation probability and fixation time.
Communications Biology. Springer Nature. https://doi.org/10.1038/s42003-019-0373-y
chicago: Tkadlec, Josef, Andreas Pavlogiannis, Krishnendu Chatterjee, and Martin
A. Nowak. “Population Structure Determines the Tradeoff between Fixation Probability
and Fixation Time.” Communications Biology. Springer Nature, 2019. https://doi.org/10.1038/s42003-019-0373-y.
ieee: J. Tkadlec, A. Pavlogiannis, K. Chatterjee, and M. A. Nowak, “Population structure
determines the tradeoff between fixation probability and fixation time,” Communications
Biology, vol. 2. Springer Nature, 2019.
ista: Tkadlec J, Pavlogiannis A, Chatterjee K, Nowak MA. 2019. Population structure
determines the tradeoff between fixation probability and fixation time. Communications
Biology. 2, 138.
mla: Tkadlec, Josef, et al. “Population Structure Determines the Tradeoff between
Fixation Probability and Fixation Time.” Communications Biology, vol. 2,
138, Springer Nature, 2019, doi:10.1038/s42003-019-0373-y.
short: J. Tkadlec, A. Pavlogiannis, K. Chatterjee, M.A. Nowak, Communications Biology
2 (2019).
date_created: 2019-12-23T13:36:50Z
date_published: 2019-04-23T00:00:00Z
date_updated: 2023-09-07T13:19:22Z
day: '23'
ddc:
- '000'
department:
- _id: KrCh
doi: 10.1038/s42003-019-0373-y
ec_funded: 1
external_id:
isi:
- '000465425700006'
pmid:
- '31044163'
file:
- access_level: open_access
checksum: d1a69bfe73767e4246f0a38e4e1554dd
content_type: application/pdf
creator: dernst
date_created: 2019-12-23T13:39:30Z
date_updated: 2020-07-14T12:47:53Z
file_id: '7211'
file_name: 2019_CommBio_Tkadlec.pdf
file_size: 1670274
relation: main_file
file_date_updated: 2020-07-14T12:47:53Z
has_accepted_license: '1'
intvolume: ' 2'
isi: 1
language:
- iso: eng
month: '04'
oa: 1
oa_version: Published Version
pmid: 1
project:
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
- _id: 2584A770-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P 23499-N23
name: Modern Graph Algorithmic Techniques in Formal Verification
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
publication: Communications Biology
publication_identifier:
issn:
- 2399-3642
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
related_material:
record:
- id: '7196'
relation: part_of_dissertation
status: public
scopus_import: '1'
status: public
title: Population structure determines the tradeoff between fixation probability and
fixation time
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: 2
year: '2019'
...
---
_id: '10190'
abstract:
- lang: eng
text: 'The verification of concurrent programs remains an open challenge, as thread
interaction has to be accounted for, which leads to state-space explosion. Stateless
model checking battles this problem by exploring traces rather than states of
the program. As there are exponentially many traces, dynamic partial-order reduction
(DPOR) techniques are used to partition the trace space into equivalence classes,
and explore a few representatives from each class. The standard equivalence that
underlies most DPOR techniques is the happens-before equivalence, however recent
works have spawned a vivid interest towards coarser equivalences. The efficiency
of such approaches is a product of two parameters: (i) the size of the partitioning
induced by the equivalence, and (ii) the time spent by the exploration algorithm
in each class of the partitioning. In this work, we present a new equivalence,
called value-happens-before and show that it has two appealing features. First,
value-happens-before is always at least as coarse as the happens-before equivalence,
and can be even exponentially coarser. Second, the value-happens-before partitioning
is efficiently explorable when the number of threads is bounded. We present an
algorithm called value-centric DPOR (VCDPOR), which explores the underlying partitioning
using polynomial time per class. Finally, we perform an experimental evaluation
of VCDPOR on various benchmarks, and compare it against other state-of-the-art
approaches. Our results show that value-happens-before typically induces a significant
reduction in the size of the underlying partitioning, which leads to a considerable
reduction in the running time for exploring the whole partitioning.'
acknowledgement: "The authors would also like to thank anonymous referees for their
valuable comments and helpful suggestions. This work is supported by the Austrian
Science Fund (FWF) NFN grants S11407-N23 (RiSE/SHiNE) and S11402-N23 (RiSE/SHiNE),
by the Vienna Science and Technology Fund (WWTF) Project ICT15-003, and by the Austrian
Science Fund (FWF) Schrodinger grant J-4220.\r\n"
article_number: '124'
article_processing_charge: No
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Andreas
full_name: Pavlogiannis, Andreas
id: 49704004-F248-11E8-B48F-1D18A9856A87
last_name: Pavlogiannis
orcid: 0000-0002-8943-0722
- first_name: Viktor
full_name: Toman, Viktor
id: 3AF3DA7C-F248-11E8-B48F-1D18A9856A87
last_name: Toman
orcid: 0000-0001-9036-063X
citation:
ama: 'Chatterjee K, Pavlogiannis A, Toman V. Value-centric dynamic partial order
reduction. In: Proceedings of the 34th ACM International Conference on Object-Oriented
Programming, Systems, Languages, and Applications. Vol 3. ACM; 2019. doi:10.1145/3360550'
apa: 'Chatterjee, K., Pavlogiannis, A., & Toman, V. (2019). Value-centric dynamic
partial order reduction. In Proceedings of the 34th ACM International Conference
on Object-Oriented Programming, Systems, Languages, and Applications (Vol.
3). Athens, Greece: ACM. https://doi.org/10.1145/3360550'
chicago: Chatterjee, Krishnendu, Andreas Pavlogiannis, and Viktor Toman. “Value-Centric
Dynamic Partial Order Reduction.” In Proceedings of the 34th ACM International
Conference on Object-Oriented Programming, Systems, Languages, and Applications,
Vol. 3. ACM, 2019. https://doi.org/10.1145/3360550.
ieee: K. Chatterjee, A. Pavlogiannis, and V. Toman, “Value-centric dynamic partial
order reduction,” in Proceedings of the 34th ACM International Conference on
Object-Oriented Programming, Systems, Languages, and Applications, Athens,
Greece, 2019, vol. 3.
ista: 'Chatterjee K, Pavlogiannis A, Toman V. 2019. Value-centric dynamic partial
order reduction. Proceedings of the 34th ACM International Conference on Object-Oriented
Programming, Systems, Languages, and Applications. OOPSLA: Object-oriented Programming,
Systems, Languages and Applications vol. 3, 124.'
mla: Chatterjee, Krishnendu, et al. “Value-Centric Dynamic Partial Order Reduction.”
Proceedings of the 34th ACM International Conference on Object-Oriented Programming,
Systems, Languages, and Applications, vol. 3, 124, ACM, 2019, doi:10.1145/3360550.
short: K. Chatterjee, A. Pavlogiannis, V. Toman, in:, Proceedings of the 34th ACM
International Conference on Object-Oriented Programming, Systems, Languages, and
Applications, ACM, 2019.
conference:
end_date: 2019-10-25
location: Athens, Greece
name: 'OOPSLA: Object-oriented Programming, Systems, Languages and Applications'
start_date: 2019-10-23
date_created: 2021-10-27T14:57:06Z
date_published: 2019-10-10T00:00:00Z
date_updated: 2023-09-07T13:30:27Z
day: '10'
ddc:
- '000'
department:
- _id: GradSch
- _id: KrCh
doi: 10.1145/3360550
external_id:
arxiv:
- '1909.00989'
file:
- access_level: open_access
checksum: 2149979c46964c4d117af06ccb6c0834
content_type: application/pdf
creator: cchlebak
date_created: 2021-11-12T11:41:56Z
date_updated: 2021-11-12T11:41:56Z
file_id: '10278'
file_name: 2019_ACM_Chatterjee.pdf
file_size: 570829
relation: main_file
success: 1
file_date_updated: 2021-11-12T11:41:56Z
has_accepted_license: '1'
intvolume: ' 3'
keyword:
- safety
- risk
- reliability and quality
- software
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://dl.acm.org/doi/10.1145/3360550
month: '10'
oa: 1
oa_version: Published Version
project:
- _id: 25892FC0-B435-11E9-9278-68D0E5697425
grant_number: ICT15-003
name: Efficient Algorithms for Computer Aided Verification
- _id: 25863FF4-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11407
name: Game Theory
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 25F5A88A-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11402-N23
name: Moderne Concurrency Paradigms
publication: Proceedings of the 34th ACM International Conference on Object-Oriented
Programming, Systems, Languages, and Applications
publication_identifier:
eissn:
- 2475-1421
publication_status: published
publisher: ACM
quality_controlled: '1'
related_material:
record:
- id: '10199'
relation: dissertation_contains
status: public
status: public
title: Value-centric dynamic partial order reduction
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: 8b945eb4-e2f2-11eb-945a-df72226e66a9
volume: 3
year: '2019'
...
---
_id: '6673'
abstract:
- lang: eng
text: Several classic problems in graph processing and computational geometry are
solved via incremental algorithms, which split computation into a series of small
tasks acting on shared state, which gets updated progressively. While the sequential
variant of such algorithms usually specifies a fixed (but sometimes random) order
in which the tasks should be performed, a standard approach to parallelizing such
algorithms is to relax this constraint to allow for out-of-order parallel execution.
This is the case for parallel implementations of Dijkstra's single-source shortest-paths
(SSSP) algorithm, and for parallel Delaunay mesh triangulation. While many software
frameworks parallelize incremental computation in this way, it is still not well
understood whether this relaxed ordering approach can still provide any complexity
guarantees. In this paper, we address this problem, and analyze the efficiency
guarantees provided by a range of incremental algorithms when parallelized via
relaxed schedulers. We show that, for algorithms such as Delaunay mesh triangulation
and sorting by insertion, schedulers with a maximum relaxation factor of k in
terms of the maximum priority inversion allowed will introduce a maximum amount
of wasted work of O(łog n poly(k)), where n is the number of tasks to be executed.
For SSSP, we show that the additional work is O(poly(k), dmax / wmin), where dmax
is the maximum distance between two nodes, and wmin is the minimum such distance.
In practical settings where n >> k, this suggests that the overheads of relaxation
will be outweighed by the improved scalability of the relaxed scheduler. On the
negative side, we provide lower bounds showing that certain algorithms will inherently
incur a non-trivial amount of wasted work due to scheduler relaxation, even for
relatively benign relaxed schedulers.
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: Giorgi
full_name: Nadiradze, Giorgi
id: 3279A00C-F248-11E8-B48F-1D18A9856A87
last_name: Nadiradze
orcid: 0000-0001-5634-0731
- first_name: Nikita
full_name: Koval, Nikita
id: 2F4DB10C-F248-11E8-B48F-1D18A9856A87
last_name: Koval
citation:
ama: 'Alistarh D-A, Nadiradze G, Koval N. Efficiency guarantees for parallel incremental
algorithms under relaxed schedulers. In: 31st ACM Symposium on Parallelism
in Algorithms and Architectures. ACM Press; 2019:145-154. doi:10.1145/3323165.3323201'
apa: 'Alistarh, D.-A., Nadiradze, G., & Koval, N. (2019). Efficiency guarantees
for parallel incremental algorithms under relaxed schedulers. In 31st ACM Symposium
on Parallelism in Algorithms and Architectures (pp. 145–154). Phoenix, AZ,
United States: ACM Press. https://doi.org/10.1145/3323165.3323201'
chicago: Alistarh, Dan-Adrian, Giorgi Nadiradze, and Nikita Koval. “Efficiency Guarantees
for Parallel Incremental Algorithms under Relaxed Schedulers.” In 31st ACM
Symposium on Parallelism in Algorithms and Architectures, 145–54. ACM Press,
2019. https://doi.org/10.1145/3323165.3323201.
ieee: D.-A. Alistarh, G. Nadiradze, and N. Koval, “Efficiency guarantees for parallel
incremental algorithms under relaxed schedulers,” in 31st ACM Symposium on
Parallelism in Algorithms and Architectures, Phoenix, AZ, United States, 2019,
pp. 145–154.
ista: 'Alistarh D-A, Nadiradze G, Koval N. 2019. Efficiency guarantees for parallel
incremental algorithms under relaxed schedulers. 31st ACM Symposium on Parallelism
in Algorithms and Architectures. SPAA: Symposium on Parallelism in Algorithms
and Architectures, 145–154.'
mla: Alistarh, Dan-Adrian, et al. “Efficiency Guarantees for Parallel Incremental
Algorithms under Relaxed Schedulers.” 31st ACM Symposium on Parallelism in
Algorithms and Architectures, ACM Press, 2019, pp. 145–54, doi:10.1145/3323165.3323201.
short: D.-A. Alistarh, G. Nadiradze, N. Koval, in:, 31st ACM Symposium on Parallelism
in Algorithms and Architectures, ACM Press, 2019, pp. 145–154.
conference:
end_date: 2019-06-24
location: Phoenix, AZ, United States
name: 'SPAA: Symposium on Parallelism in Algorithms and Architectures'
start_date: 2019-06-22
date_created: 2019-07-24T08:59:36Z
date_published: 2019-06-01T00:00:00Z
date_updated: 2023-09-07T13:31:39Z
day: '01'
department:
- _id: DaAl
doi: 10.1145/3323165.3323201
ec_funded: 1
external_id:
arxiv:
- '2003.09363'
isi:
- '000507618500018'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/2003.09363
month: '06'
oa: 1
oa_version: Preprint
page: 145-154
project:
- _id: 268A44D6-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '805223'
name: Elastic Coordination for Scalable Machine Learning
publication: 31st ACM Symposium on Parallelism in Algorithms and Architectures
publication_identifier:
isbn:
- '9781450361842'
publication_status: published
publisher: ACM Press
quality_controlled: '1'
related_material:
record:
- id: '10429'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: Efficiency guarantees for parallel incremental algorithms under relaxed schedulers
type: conference
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
year: '2019'
...
---
_id: '7398'
abstract:
- lang: eng
text: 'Transporters of the solute carrier 6 (SLC6) family translocate their cognate
substrate together with Na+ and Cl−. Detailed kinetic models exist for the transporters
of GABA (GAT1/SLC6A1) and the monoamines dopamine (DAT/SLC6A3) and serotonin (SERT/SLC6A4).
Here, we posited that the transport cycle of individual SLC6 transporters reflects
the physiological requirements they operate under. We tested this hypothesis by
analyzing the transport cycle of glycine transporter 1 (GlyT1/SLC6A9) and glycine
transporter 2 (GlyT2/SLC6A5). GlyT2 is the only SLC6 family member known to translocate
glycine, Na+, and Cl− in a 1:3:1 stoichiometry. We analyzed partial reactions
in real time by electrophysiological recordings. Contrary to monoamine transporters,
both GlyTs were found to have a high transport capacity driven by rapid return
of the empty transporter after release of Cl− on the intracellular side. Rapid
cycling of both GlyTs was further supported by highly cooperative binding of cosubstrate
ions and substrate such that their forward transport mode was maintained even
under conditions of elevated intracellular Na+ or Cl−. The most important differences
in the transport cycle of GlyT1 and GlyT2 arose from the kinetics of charge movement
and the resulting voltage-dependent rate-limiting reactions: the kinetics of GlyT1
were governed by transition of the substrate-bound transporter from outward- to
inward-facing conformations, whereas the kinetics of GlyT2 were governed by Na+
binding (or a related conformational change). Kinetic modeling showed that the
kinetics of GlyT1 are ideally suited for supplying the extracellular glycine levels
required for NMDA receptor activation.'
article_processing_charge: No
article_type: original
author:
- first_name: Fatma Asli
full_name: Erdem, Fatma Asli
last_name: Erdem
- first_name: Marija
full_name: Ilic, Marija
last_name: Ilic
- first_name: Peter
full_name: Koppensteiner, Peter
id: 3B8B25A8-F248-11E8-B48F-1D18A9856A87
last_name: Koppensteiner
orcid: 0000-0002-3509-1948
- first_name: Jakub
full_name: Gołacki, Jakub
last_name: Gołacki
- first_name: Gert
full_name: Lubec, Gert
last_name: Lubec
- first_name: Michael
full_name: Freissmuth, Michael
last_name: Freissmuth
- first_name: Walter
full_name: Sandtner, Walter
last_name: Sandtner
citation:
ama: Erdem FA, Ilic M, Koppensteiner P, et al. A comparison of the transport kinetics
of glycine transporter 1 and glycine transporter 2. The Journal of General
Physiology. 2019;151(8):1035-1050. doi:10.1085/jgp.201912318
apa: Erdem, F. A., Ilic, M., Koppensteiner, P., Gołacki, J., Lubec, G., Freissmuth,
M., & Sandtner, W. (2019). A comparison of the transport kinetics of glycine
transporter 1 and glycine transporter 2. The Journal of General Physiology.
Rockefeller University Press. https://doi.org/10.1085/jgp.201912318
chicago: Erdem, Fatma Asli, Marija Ilic, Peter Koppensteiner, Jakub Gołacki, Gert
Lubec, Michael Freissmuth, and Walter Sandtner. “A Comparison of the Transport
Kinetics of Glycine Transporter 1 and Glycine Transporter 2.” The Journal of
General Physiology. Rockefeller University Press, 2019. https://doi.org/10.1085/jgp.201912318.
ieee: F. A. Erdem et al., “A comparison of the transport kinetics of glycine
transporter 1 and glycine transporter 2,” The Journal of General Physiology,
vol. 151, no. 8. Rockefeller University Press, pp. 1035–1050, 2019.
ista: Erdem FA, Ilic M, Koppensteiner P, Gołacki J, Lubec G, Freissmuth M, Sandtner
W. 2019. A comparison of the transport kinetics of glycine transporter 1 and glycine
transporter 2. The Journal of General Physiology. 151(8), 1035–1050.
mla: Erdem, Fatma Asli, et al. “A Comparison of the Transport Kinetics of Glycine
Transporter 1 and Glycine Transporter 2.” The Journal of General Physiology,
vol. 151, no. 8, Rockefeller University Press, 2019, pp. 1035–50, doi:10.1085/jgp.201912318.
short: F.A. Erdem, M. Ilic, P. Koppensteiner, J. Gołacki, G. Lubec, M. Freissmuth,
W. Sandtner, The Journal of General Physiology 151 (2019) 1035–1050.
date_created: 2020-01-29T16:06:29Z
date_published: 2019-07-03T00:00:00Z
date_updated: 2023-09-07T14:52:23Z
day: '03'
ddc:
- '570'
department:
- _id: RySh
doi: 10.1085/jgp.201912318
external_id:
isi:
- '000478792500008'
pmid:
- '31270129'
file:
- access_level: open_access
checksum: 5706b4ccd74ee3e50bf7ecb2a203df71
content_type: application/pdf
creator: dernst
date_created: 2020-02-05T07:20:32Z
date_updated: 2020-07-14T12:47:57Z
file_id: '7450'
file_name: 2019_JGP_Erdem.pdf
file_size: 2641297
relation: main_file
file_date_updated: 2020-07-14T12:47:57Z
has_accepted_license: '1'
intvolume: ' 151'
isi: 1
issue: '8'
language:
- iso: eng
license: https://creativecommons.org/licenses/by-nc-sa/4.0/
month: '07'
oa: 1
oa_version: Published Version
page: 1035-1050
pmid: 1
publication: The Journal of General Physiology
publication_identifier:
eissn:
- 1540-7748
issn:
- 0022-1295
publication_status: published
publisher: Rockefeller University Press
quality_controlled: '1'
scopus_import: '1'
status: public
title: A comparison of the transport kinetics of glycine transporter 1 and glycine
transporter 2
tmp:
image: /images/cc_by_nc_sa.png
legal_code_url: https://creativecommons.org/licenses/by-nc-sa/4.0/legalcode
name: Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC
BY-NC-SA 4.0)
short: CC BY-NC-SA (4.0)
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 151
year: '2019'
...
---
_id: '7395'
abstract:
- lang: eng
text: The mitochondrial electron transport chain complexes are organized into supercomplexes
(SCs) of defined stoichiometry, which have been proposed to regulate electron
flux via substrate channeling. We demonstrate that CoQ trapping in the isolated
SC I+III2 limits complex (C)I turnover, arguing against channeling. The SC structure,
resolved at up to 3.8 Å in four distinct states, suggests that CoQ oxidation may
be rate limiting because of unequal access of CoQ to the active sites of CIII2.
CI shows a transition between “closed” and “open” conformations, accompanied by
the striking rotation of a key transmembrane helix. Furthermore, the state of
CI affects the conformational flexibility within CIII2, demonstrating crosstalk
between the enzymes. CoQ was identified at only three of the four binding sites
in CIII2, suggesting that interaction with CI disrupts CIII2 symmetry in a functionally
relevant manner. Together, these observations indicate a more nuanced functional
role for the SCs.
article_processing_charge: No
article_type: original
author:
- first_name: James A
full_name: Letts, James A
id: 322DA418-F248-11E8-B48F-1D18A9856A87
last_name: Letts
orcid: 0000-0002-9864-3586
- first_name: Karol
full_name: Fiedorczuk, Karol
id: 5BFF67CE-02D1-11E9-B11A-A5A4D7DFFFD0
last_name: Fiedorczuk
- first_name: Gianluca
full_name: Degliesposti, Gianluca
last_name: Degliesposti
- first_name: Mark
full_name: Skehel, Mark
last_name: Skehel
- first_name: Leonid A
full_name: Sazanov, Leonid A
id: 338D39FE-F248-11E8-B48F-1D18A9856A87
last_name: Sazanov
orcid: 0000-0002-0977-7989
citation:
ama: Letts JA, Fiedorczuk K, Degliesposti G, Skehel M, Sazanov LA. Structures of
respiratory supercomplex I+III2 reveal functional and conformational crosstalk.
Molecular Cell. 2019;75(6):1131-1146.e6. doi:10.1016/j.molcel.2019.07.022
apa: Letts, J. A., Fiedorczuk, K., Degliesposti, G., Skehel, M., & Sazanov,
L. A. (2019). Structures of respiratory supercomplex I+III2 reveal functional
and conformational crosstalk. Molecular Cell. Cell Press. https://doi.org/10.1016/j.molcel.2019.07.022
chicago: Letts, James A, Karol Fiedorczuk, Gianluca Degliesposti, Mark Skehel, and
Leonid A Sazanov. “Structures of Respiratory Supercomplex I+III2 Reveal Functional
and Conformational Crosstalk.” Molecular Cell. Cell Press, 2019. https://doi.org/10.1016/j.molcel.2019.07.022.
ieee: J. A. Letts, K. Fiedorczuk, G. Degliesposti, M. Skehel, and L. A. Sazanov,
“Structures of respiratory supercomplex I+III2 reveal functional and conformational
crosstalk,” Molecular Cell, vol. 75, no. 6. Cell Press, p. 1131–1146.e6,
2019.
ista: Letts JA, Fiedorczuk K, Degliesposti G, Skehel M, Sazanov LA. 2019. Structures
of respiratory supercomplex I+III2 reveal functional and conformational crosstalk.
Molecular Cell. 75(6), 1131–1146.e6.
mla: Letts, James A., et al. “Structures of Respiratory Supercomplex I+III2 Reveal
Functional and Conformational Crosstalk.” Molecular Cell, vol. 75, no.
6, Cell Press, 2019, p. 1131–1146.e6, doi:10.1016/j.molcel.2019.07.022.
short: J.A. Letts, K. Fiedorczuk, G. Degliesposti, M. Skehel, L.A. Sazanov, Molecular
Cell 75 (2019) 1131–1146.e6.
date_created: 2020-01-29T16:02:33Z
date_published: 2019-09-19T00:00:00Z
date_updated: 2023-09-07T14:53:06Z
day: '19'
ddc:
- '570'
department:
- _id: LeSa
doi: 10.1016/j.molcel.2019.07.022
ec_funded: 1
external_id:
isi:
- '000486614200006'
pmid:
- '31492636'
file:
- access_level: open_access
checksum: 5202f53a237d6650ece038fbf13bdcea
content_type: application/pdf
creator: dernst
date_created: 2020-02-04T10:37:28Z
date_updated: 2020-07-14T12:47:57Z
file_id: '7447'
file_name: 2019_MolecularCell_Letts.pdf
file_size: 9654895
relation: main_file
file_date_updated: 2020-07-14T12:47:57Z
has_accepted_license: '1'
intvolume: ' 75'
isi: 1
issue: '6'
language:
- iso: eng
month: '09'
oa: 1
oa_version: Published Version
page: 1131-1146.e6
pmid: 1
project:
- _id: 2590DB08-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '701309'
name: Atomic-Resolution Structures of Mitochondrial Respiratory Chain Supercomplexes
publication: Molecular Cell
publication_identifier:
issn:
- 1097-2765
publication_status: published
publisher: Cell Press
quality_controlled: '1'
scopus_import: '1'
status: public
title: Structures of respiratory supercomplex I+III2 reveal functional and conformational
crosstalk
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: 75
year: '2019'
...
---
_id: '7405'
abstract:
- lang: eng
text: Biophysical modeling of neuronal networks helps to integrate and interpret
rapidly growing and disparate experimental datasets at multiple scales. The NetPyNE
tool (www.netpyne.org) provides both programmatic and graphical interfaces to
develop data-driven multiscale network models in NEURON. NetPyNE clearly separates
model parameters from implementation code. Users provide specifications at a high
level via a standardized declarative language, for example connectivity rules,
to create millions of cell-to-cell connections. NetPyNE then enables users to
generate the NEURON network, run efficiently parallelized simulations, optimize
and explore network parameters through automated batch runs, and use built-in
functions for visualization and analysis – connectivity matrices, voltage traces,
spike raster plots, local field potentials, and information theoretic measures.
NetPyNE also facilitates model sharing by exporting and importing standardized
formats (NeuroML and SONATA). NetPyNE is already being used to teach computational
neuroscience students and by modelers to investigate brain regions and phenomena.
article_number: e44494
article_processing_charge: No
article_type: original
author:
- first_name: Salvador
full_name: Dura-Bernal, Salvador
last_name: Dura-Bernal
- first_name: Benjamin
full_name: Suter, Benjamin
id: 4952F31E-F248-11E8-B48F-1D18A9856A87
last_name: Suter
orcid: 0000-0002-9885-6936
- first_name: Padraig
full_name: Gleeson, Padraig
last_name: Gleeson
- first_name: Matteo
full_name: Cantarelli, Matteo
last_name: Cantarelli
- first_name: Adrian
full_name: Quintana, Adrian
last_name: Quintana
- first_name: Facundo
full_name: Rodriguez, Facundo
last_name: Rodriguez
- first_name: David J
full_name: Kedziora, David J
last_name: Kedziora
- first_name: George L
full_name: Chadderdon, George L
last_name: Chadderdon
- first_name: Cliff C
full_name: Kerr, Cliff C
last_name: Kerr
- first_name: Samuel A
full_name: Neymotin, Samuel A
last_name: Neymotin
- first_name: Robert A
full_name: McDougal, Robert A
last_name: McDougal
- first_name: Michael
full_name: Hines, Michael
last_name: Hines
- first_name: Gordon MG
full_name: Shepherd, Gordon MG
last_name: Shepherd
- first_name: William W
full_name: Lytton, William W
last_name: Lytton
citation:
ama: Dura-Bernal S, Suter B, Gleeson P, et al. NetPyNE, a tool for data-driven multiscale
modeling of brain circuits. eLife. 2019;8. doi:10.7554/elife.44494
apa: Dura-Bernal, S., Suter, B., Gleeson, P., Cantarelli, M., Quintana, A., Rodriguez,
F., … Lytton, W. W. (2019). NetPyNE, a tool for data-driven multiscale modeling
of brain circuits. ELife. eLife Sciences Publications. https://doi.org/10.7554/elife.44494
chicago: Dura-Bernal, Salvador, Benjamin Suter, Padraig Gleeson, Matteo Cantarelli,
Adrian Quintana, Facundo Rodriguez, David J Kedziora, et al. “NetPyNE, a Tool
for Data-Driven Multiscale Modeling of Brain Circuits.” ELife. eLife Sciences
Publications, 2019. https://doi.org/10.7554/elife.44494.
ieee: S. Dura-Bernal et al., “NetPyNE, a tool for data-driven multiscale
modeling of brain circuits,” eLife, vol. 8. eLife Sciences Publications,
2019.
ista: Dura-Bernal S, Suter B, Gleeson P, Cantarelli M, Quintana A, Rodriguez F,
Kedziora DJ, Chadderdon GL, Kerr CC, Neymotin SA, McDougal RA, Hines M, Shepherd
GM, Lytton WW. 2019. NetPyNE, a tool for data-driven multiscale modeling of brain
circuits. eLife. 8, e44494.
mla: Dura-Bernal, Salvador, et al. “NetPyNE, a Tool for Data-Driven Multiscale Modeling
of Brain Circuits.” ELife, vol. 8, e44494, eLife Sciences Publications,
2019, doi:10.7554/elife.44494.
short: S. Dura-Bernal, B. Suter, P. Gleeson, M. Cantarelli, A. Quintana, F. Rodriguez,
D.J. Kedziora, G.L. Chadderdon, C.C. Kerr, S.A. Neymotin, R.A. McDougal, M. Hines,
G.M. Shepherd, W.W. Lytton, ELife 8 (2019).
date_created: 2020-01-30T09:08:01Z
date_published: 2019-05-31T00:00:00Z
date_updated: 2023-09-07T14:27:52Z
day: '31'
ddc:
- '570'
department:
- _id: PeJo
doi: 10.7554/elife.44494
external_id:
isi:
- '000468968400001'
pmid:
- '31025934'
file:
- access_level: open_access
checksum: 7014189c11c10a12feeeae37f054871d
content_type: application/pdf
creator: dernst
date_created: 2020-02-04T08:41:47Z
date_updated: 2020-07-14T12:47:57Z
file_id: '7444'
file_name: 2019_eLife_DuraBernal.pdf
file_size: 6182359
relation: main_file
file_date_updated: 2020-07-14T12:47:57Z
has_accepted_license: '1'
intvolume: ' 8'
isi: 1
language:
- iso: eng
month: '05'
oa: 1
oa_version: Published Version
pmid: 1
publication: eLife
publication_identifier:
issn:
- 2050-084X
publication_status: published
publisher: eLife Sciences Publications
quality_controlled: '1'
scopus_import: '1'
status: public
title: NetPyNE, a tool for data-driven multiscale modeling of brain circuits
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: 8
year: '2019'
...
---
_id: '7400'
abstract:
- lang: eng
text: 'Suppressed recombination allows divergence between homologous sex chromosomes
and the functionality of their genes. Here, we reveal patterns of the earliest
stages of sex-chromosome evolution in the diploid dioecious herb Mercurialis annua
on the basis of cytological analysis, de novo genome assembly and annotation,
genetic mapping, exome resequencing of natural populations, and transcriptome
analysis. The genome assembly contained 34,105 expressed genes, of which 10,076
were assigned to linkage groups. Genetic mapping and exome resequencing of individuals
across the species range both identified the largest linkage group, LG1, as the
sex chromosome. Although the sex chromosomes of M. annua are karyotypically homomorphic,
we estimate that about one-third of the Y chromosome, containing 568 transcripts
and spanning 22.3 cM in the corresponding female map, has ceased recombining.
Nevertheless, we found limited evidence for Y-chromosome degeneration in terms
of gene loss and pseudogenization, and most X- and Y-linked genes appear to have
diverged in the period subsequent to speciation between M. annua and its sister
species M. huetii, which shares the same sex-determining region. Taken together,
our results suggest that the M. annua Y chromosome has at least two evolutionary
strata: a small old stratum shared with M. huetii, and a more recent larger stratum
that is probably unique to M. annua and that stopped recombining ∼1 MYA. Patterns
of gene expression within the nonrecombining region are consistent with the idea
that sexually antagonistic selection may have played a role in favoring suppressed
recombination.'
article_processing_charge: No
article_type: original
author:
- first_name: Paris
full_name: Veltsos, Paris
last_name: Veltsos
- first_name: Kate E.
full_name: Ridout, Kate E.
last_name: Ridout
- first_name: Melissa A
full_name: Toups, Melissa A
id: 4E099E4E-F248-11E8-B48F-1D18A9856A87
last_name: Toups
orcid: 0000-0002-9752-7380
- first_name: Santiago C.
full_name: González-Martínez, Santiago C.
last_name: González-Martínez
- first_name: Aline
full_name: Muyle, Aline
last_name: Muyle
- first_name: Olivier
full_name: Emery, Olivier
last_name: Emery
- first_name: Pasi
full_name: Rastas, Pasi
last_name: Rastas
- first_name: Vojtech
full_name: Hudzieczek, Vojtech
last_name: Hudzieczek
- first_name: Roman
full_name: Hobza, Roman
last_name: Hobza
- first_name: Boris
full_name: Vyskot, Boris
last_name: Vyskot
- first_name: Gabriel A. B.
full_name: Marais, Gabriel A. B.
last_name: Marais
- first_name: Dmitry A.
full_name: Filatov, Dmitry A.
last_name: Filatov
- first_name: John R.
full_name: Pannell, John R.
last_name: Pannell
citation:
ama: Veltsos P, Ridout KE, Toups MA, et al. Early sex-chromosome evolution in the
diploid dioecious plant Mercurialis annua. Genetics. 2019;212(3):815-835.
doi:10.1534/genetics.119.302045
apa: Veltsos, P., Ridout, K. E., Toups, M. A., González-Martínez, S. C., Muyle,
A., Emery, O., … Pannell, J. R. (2019). Early sex-chromosome evolution in the
diploid dioecious plant Mercurialis annua. Genetics. Genetics Society of
America. https://doi.org/10.1534/genetics.119.302045
chicago: Veltsos, Paris, Kate E. Ridout, Melissa A Toups, Santiago C. González-Martínez,
Aline Muyle, Olivier Emery, Pasi Rastas, et al. “Early Sex-Chromosome Evolution
in the Diploid Dioecious Plant Mercurialis Annua.” Genetics. Genetics Society
of America, 2019. https://doi.org/10.1534/genetics.119.302045.
ieee: P. Veltsos et al., “Early sex-chromosome evolution in the diploid dioecious
plant Mercurialis annua,” Genetics, vol. 212, no. 3. Genetics Society of
America, pp. 815–835, 2019.
ista: Veltsos P, Ridout KE, Toups MA, González-Martínez SC, Muyle A, Emery O, Rastas
P, Hudzieczek V, Hobza R, Vyskot B, Marais GAB, Filatov DA, Pannell JR. 2019.
Early sex-chromosome evolution in the diploid dioecious plant Mercurialis annua.
Genetics. 212(3), 815–835.
mla: Veltsos, Paris, et al. “Early Sex-Chromosome Evolution in the Diploid Dioecious
Plant Mercurialis Annua.” Genetics, vol. 212, no. 3, Genetics Society of
America, 2019, pp. 815–35, doi:10.1534/genetics.119.302045.
short: P. Veltsos, K.E. Ridout, M.A. Toups, S.C. González-Martínez, A. Muyle, O.
Emery, P. Rastas, V. Hudzieczek, R. Hobza, B. Vyskot, G.A.B. Marais, D.A. Filatov,
J.R. Pannell, Genetics 212 (2019) 815–835.
date_created: 2020-01-29T16:15:44Z
date_published: 2019-07-01T00:00:00Z
date_updated: 2023-09-07T14:49:29Z
day: '01'
department:
- _id: BeVi
doi: 10.1534/genetics.119.302045
ec_funded: 1
external_id:
isi:
- '000474809300015'
pmid:
- '31113811'
intvolume: ' 212'
isi: 1
issue: '3'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1534/genetics.119.302045
month: '07'
oa: 1
oa_version: Published Version
page: 815-835
pmid: 1
project:
- _id: 250BDE62-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '715257'
name: Prevalence and Influence of Sexual Antagonism on Genome Evolution
publication: Genetics
publication_identifier:
eissn:
- 1943-2631
issn:
- 0016-6731
publication_status: published
publisher: Genetics Society of America
quality_controlled: '1'
scopus_import: '1'
status: public
title: Early sex-chromosome evolution in the diploid dioecious plant Mercurialis annua
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 212
year: '2019'
...
---
_id: '7404'
abstract:
- lang: eng
text: The formation of neuronal dendrite branches is fundamental for the wiring
and function of the nervous system. Indeed, dendrite branching enhances the coverage
of the neuron's receptive field and modulates the initial processing of incoming
stimuli. Complex dendrite patterns are achieved in vivo through a dynamic process
of de novo branch formation, branch extension and retraction. The first step towards
branch formation is the generation of a dynamic filopodium-like branchlet. The
mechanisms underlying the initiation of dendrite branchlets are therefore crucial
to the shaping of dendrites. Through in vivo time-lapse imaging of the subcellular
localization of actin during the process of branching of Drosophila larva sensory
neurons, combined with genetic analysis and electron tomography, we have identified
the Actin-related protein (Arp) 2/3 complex as the major actin nucleator involved
in the initiation of dendrite branchlet formation, under the control of the activator
WAVE and of the small GTPase Rac1. Transient recruitment of an Arp2/3 component
marks the site of branchlet initiation in vivo. These data position the activation
of Arp2/3 as an early hub for the initiation of branchlet formation.
article_number: dev171397
article_processing_charge: No
article_type: original
author:
- first_name: Tomke
full_name: Stürner, Tomke
last_name: Stürner
- first_name: Anastasia
full_name: Tatarnikova, Anastasia
last_name: Tatarnikova
- first_name: Jan
full_name: Müller, Jan
id: AD07FDB4-0F61-11EA-8158-C4CC64CEAA8D
last_name: Müller
- first_name: Barbara
full_name: Schaffran, Barbara
last_name: Schaffran
- first_name: Hermann
full_name: Cuntz, Hermann
last_name: Cuntz
- first_name: Yun
full_name: Zhang, Yun
last_name: Zhang
- first_name: Maria
full_name: Nemethova, Maria
id: 34E27F1C-F248-11E8-B48F-1D18A9856A87
last_name: Nemethova
- first_name: Sven
full_name: Bogdan, Sven
last_name: Bogdan
- first_name: Vic
full_name: Small, Vic
last_name: Small
- first_name: Gaia
full_name: Tavosanis, Gaia
last_name: Tavosanis
citation:
ama: Stürner T, Tatarnikova A, Müller J, et al. Transient localization of the Arp2/3
complex initiates neuronal dendrite branching in vivo. Development. 2019;146(7).
doi:10.1242/dev.171397
apa: Stürner, T., Tatarnikova, A., Müller, J., Schaffran, B., Cuntz, H., Zhang,
Y., … Tavosanis, G. (2019). Transient localization of the Arp2/3 complex initiates
neuronal dendrite branching in vivo. Development. The Company of Biologists.
https://doi.org/10.1242/dev.171397
chicago: Stürner, Tomke, Anastasia Tatarnikova, Jan Müller, Barbara Schaffran, Hermann
Cuntz, Yun Zhang, Maria Nemethova, Sven Bogdan, Vic Small, and Gaia Tavosanis.
“Transient Localization of the Arp2/3 Complex Initiates Neuronal Dendrite Branching
in Vivo.” Development. The Company of Biologists, 2019. https://doi.org/10.1242/dev.171397.
ieee: T. Stürner et al., “Transient localization of the Arp2/3 complex initiates
neuronal dendrite branching in vivo,” Development, vol. 146, no. 7. The
Company of Biologists, 2019.
ista: Stürner T, Tatarnikova A, Müller J, Schaffran B, Cuntz H, Zhang Y, Nemethova
M, Bogdan S, Small V, Tavosanis G. 2019. Transient localization of the Arp2/3
complex initiates neuronal dendrite branching in vivo. Development. 146(7), dev171397.
mla: Stürner, Tomke, et al. “Transient Localization of the Arp2/3 Complex Initiates
Neuronal Dendrite Branching in Vivo.” Development, vol. 146, no. 7, dev171397,
The Company of Biologists, 2019, doi:10.1242/dev.171397.
short: T. Stürner, A. Tatarnikova, J. Müller, B. Schaffran, H. Cuntz, Y. Zhang,
M. Nemethova, S. Bogdan, V. Small, G. Tavosanis, Development 146 (2019).
date_created: 2020-01-29T16:27:10Z
date_published: 2019-04-04T00:00:00Z
date_updated: 2023-09-07T14:47:00Z
day: '04'
department:
- _id: MiSi
doi: 10.1242/dev.171397
external_id:
isi:
- '000464583200006'
pmid:
- '30910826'
intvolume: ' 146'
isi: 1
issue: '7'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1242/dev.171397
month: '04'
oa: 1
oa_version: Published Version
pmid: 1
publication: Development
publication_identifier:
eissn:
- 1477-9129
issn:
- 0950-1991
publication_status: published
publisher: The Company of Biologists
quality_controlled: '1'
scopus_import: '1'
status: public
title: Transient localization of the Arp2/3 complex initiates neuronal dendrite branching
in vivo
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 146
year: '2019'
...
---
_id: '7402'
abstract:
- lang: eng
text: Graph planning gives rise to fundamental algorithmic questions such as shortest
path, traveling salesman problem, etc. A classical problem in discrete planning
is to consider a weighted graph and construct a path that maximizes the sum of
weights for a given time horizon T. However, in many scenarios, the time horizon
is not fixed, but the stopping time is chosen according to some distribution such
that the expected stopping time is T. If the stopping time distribution is not
known, then to ensure robustness, the distribution is chosen by an adversary,
to represent the worst-case scenario. A stationary plan for every vertex always
chooses the same outgoing edge. For fixed horizon or fixed stopping-time distribution,
stationary plans are not sufficient for optimality. Quite surprisingly we show
that when an adversary chooses the stopping-time distribution with expected stopping
time T, then stationary plans are sufficient. While computing optimal stationary
plans for fixed horizon is NP-complete, we show that computing optimal stationary
plans under adversarial stopping-time distribution can be achieved in polynomial
time. Consequently, our polynomial-time algorithm for adversarial stopping time
also computes an optimal plan among all possible plans.
article_processing_charge: No
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Laurent
full_name: Doyen, Laurent
last_name: Doyen
citation:
ama: 'Chatterjee K, Doyen L. Graph planning with expected finite horizon. In: 34th
Annual ACM/IEEE Symposium on Logic in Computer Science. IEEE; 2019:1-13. doi:10.1109/lics.2019.8785706'
apa: 'Chatterjee, K., & Doyen, L. (2019). Graph planning with expected finite
horizon. In 34th Annual ACM/IEEE Symposium on Logic in Computer Science
(pp. 1–13). Vancouver, BC, Canada: IEEE. https://doi.org/10.1109/lics.2019.8785706'
chicago: Chatterjee, Krishnendu, and Laurent Doyen. “Graph Planning with Expected
Finite Horizon.” In 34th Annual ACM/IEEE Symposium on Logic in Computer Science,
1–13. IEEE, 2019. https://doi.org/10.1109/lics.2019.8785706.
ieee: K. Chatterjee and L. Doyen, “Graph planning with expected finite horizon,”
in 34th Annual ACM/IEEE Symposium on Logic in Computer Science, Vancouver,
BC, Canada, 2019, pp. 1–13.
ista: 'Chatterjee K, Doyen L. 2019. Graph planning with expected finite horizon.
34th Annual ACM/IEEE Symposium on Logic in Computer Science. LICS: Symposium on
Logic in Computer Science, 1–13.'
mla: Chatterjee, Krishnendu, and Laurent Doyen. “Graph Planning with Expected Finite
Horizon.” 34th Annual ACM/IEEE Symposium on Logic in Computer Science,
IEEE, 2019, pp. 1–13, doi:10.1109/lics.2019.8785706.
short: K. Chatterjee, L. Doyen, in:, 34th Annual ACM/IEEE Symposium on Logic in
Computer Science, IEEE, 2019, pp. 1–13.
conference:
end_date: 2019-06-27
location: Vancouver, BC, Canada
name: 'LICS: Symposium on Logic in Computer Science'
start_date: 2019-06-24
date_created: 2020-01-29T16:18:33Z
date_published: 2019-06-01T00:00:00Z
date_updated: 2023-09-07T14:48:11Z
day: '01'
department:
- _id: KrCh
doi: 10.1109/lics.2019.8785706
external_id:
arxiv:
- '1802.03642'
isi:
- '000805002800001'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1802.03642
month: '06'
oa: 1
oa_version: Preprint
page: 1-13
publication: 34th Annual ACM/IEEE Symposium on Logic in Computer Science
publication_identifier:
isbn:
- '9781728136080'
publication_status: published
publisher: IEEE
quality_controlled: '1'
related_material:
record:
- id: '11402'
relation: later_version
status: public
scopus_import: '1'
status: public
title: Graph planning with expected finite horizon
type: conference
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
year: '2019'
...
---
_id: '7451'
abstract:
- lang: eng
text: We prove that the observable telegraph signal accompanying the bistability
in the photon-blockade-breakdown regime of the driven and lossy Jaynes–Cummings
model is the finite-size precursor of what in the thermodynamic limit is a genuine
first-order phase transition. We construct a finite-size scaling of the system
parameters to a well-defined thermodynamic limit, in which the system remains
the same microscopic system, but the telegraph signal becomes macroscopic both
in its timescale and intensity. The existence of such a finite-size scaling completes
and justifies the classification of the photon-blockade-breakdown effect as a
first-order dissipative quantum phase transition.
article_number: '150'
article_processing_charge: No
article_type: original
author:
- first_name: A.
full_name: Vukics, A.
last_name: Vukics
- first_name: A.
full_name: Dombi, A.
last_name: Dombi
- first_name: Johannes M
full_name: Fink, Johannes M
id: 4B591CBA-F248-11E8-B48F-1D18A9856A87
last_name: Fink
orcid: 0000-0001-8112-028X
- first_name: P.
full_name: Domokos, P.
last_name: Domokos
citation:
ama: Vukics A, Dombi A, Fink JM, Domokos P. Finite-size scaling of the photon-blockade
breakdown dissipative quantum phase transition. Quantum. 2019;3. doi:10.22331/q-2019-06-03-150
apa: Vukics, A., Dombi, A., Fink, J. M., & Domokos, P. (2019). Finite-size scaling
of the photon-blockade breakdown dissipative quantum phase transition. Quantum.
Verein zur Förderung des Open Access Publizierens in den Quantenwissenschaften.
https://doi.org/10.22331/q-2019-06-03-150
chicago: Vukics, A., A. Dombi, Johannes M Fink, and P. Domokos. “Finite-Size Scaling
of the Photon-Blockade Breakdown Dissipative Quantum Phase Transition.” Quantum.
Verein zur Förderung des Open Access Publizierens in den Quantenwissenschaften,
2019. https://doi.org/10.22331/q-2019-06-03-150.
ieee: A. Vukics, A. Dombi, J. M. Fink, and P. Domokos, “Finite-size scaling of the
photon-blockade breakdown dissipative quantum phase transition,” Quantum,
vol. 3. Verein zur Förderung des Open Access Publizierens in den Quantenwissenschaften,
2019.
ista: Vukics A, Dombi A, Fink JM, Domokos P. 2019. Finite-size scaling of the photon-blockade
breakdown dissipative quantum phase transition. Quantum. 3, 150.
mla: Vukics, A., et al. “Finite-Size Scaling of the Photon-Blockade Breakdown Dissipative
Quantum Phase Transition.” Quantum, vol. 3, 150, Verein zur Förderung des
Open Access Publizierens in den Quantenwissenschaften, 2019, doi:10.22331/q-2019-06-03-150.
short: A. Vukics, A. Dombi, J.M. Fink, P. Domokos, Quantum 3 (2019).
date_created: 2020-02-05T09:57:57Z
date_published: 2019-06-03T00:00:00Z
date_updated: 2023-09-07T14:57:39Z
day: '03'
ddc:
- '530'
department:
- _id: JoFi
doi: 10.22331/q-2019-06-03-150
external_id:
arxiv:
- '1809.09737'
isi:
- '000469987500004'
file:
- access_level: open_access
checksum: 26b9ba8f0155d183f1ee55295934a17f
content_type: application/pdf
creator: dernst
date_created: 2020-02-11T09:25:23Z
date_updated: 2020-07-14T12:47:58Z
file_id: '7483'
file_name: 2019_Quantum_Vukics.pdf
file_size: 5805248
relation: main_file
file_date_updated: 2020-07-14T12:47:58Z
has_accepted_license: '1'
intvolume: ' 3'
isi: 1
language:
- iso: eng
month: '06'
oa: 1
oa_version: Published Version
publication: Quantum
publication_identifier:
issn:
- 2521-327X
publication_status: published
publisher: Verein zur Förderung des Open Access Publizierens in den Quantenwissenschaften
quality_controlled: '1'
status: public
title: Finite-size scaling of the photon-blockade breakdown dissipative quantum phase
transition
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: 3
year: '2019'
...