---
OA_place: repository
OA_type: green
_id: '7550'
abstract:
- lang: eng
text: 'We consider an optimal control problem for an abstract nonlinear dissipative
evolution equation. The differential constraint is penalized by augmenting the
target functional by a nonnegative global-in-time functional which is null-minimized
in the evolution equation is satisfied. Different variational settings are presented,
leading to the convergence of the penalization method for gradient flows, noncyclic
and semimonotone flows, doubly nonlinear evolutions, and GENERIC systems. '
acknowledgement: This work is supported by Vienna Science and Technology Fund (WWTF)
through Project MA14-009 and by the Austrian Science Fund (FWF) projects F 65 and
I 2375.
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Lorenzo
full_name: Portinale, Lorenzo
id: 30AD2CBC-F248-11E8-B48F-1D18A9856A87
last_name: Portinale
- first_name: Ulisse
full_name: Stefanelli, Ulisse
last_name: Stefanelli
citation:
ama: Portinale L, Stefanelli U. Penalization via global functionals of optimal-control
problems for dissipative evolution. Advances in Mathematical Sciences and Applications.
2019;28(2):425-447.
apa: Portinale, L., & Stefanelli, U. (2019). Penalization via global functionals
of optimal-control problems for dissipative evolution. Advances in Mathematical
Sciences and Applications. Gakko Tosho.
chicago: Portinale, Lorenzo, and Ulisse Stefanelli. “Penalization via Global Functionals
of Optimal-Control Problems for Dissipative Evolution.” Advances in Mathematical
Sciences and Applications. Gakko Tosho, 2019.
ieee: L. Portinale and U. Stefanelli, “Penalization via global functionals of optimal-control
problems for dissipative evolution,” Advances in Mathematical Sciences and
Applications, vol. 28, no. 2. Gakko Tosho, pp. 425–447, 2019.
ista: Portinale L, Stefanelli U. 2019. Penalization via global functionals of optimal-control
problems for dissipative evolution. Advances in Mathematical Sciences and Applications.
28(2), 425–447.
mla: Portinale, Lorenzo, and Ulisse Stefanelli. “Penalization via Global Functionals
of Optimal-Control Problems for Dissipative Evolution.” Advances in Mathematical
Sciences and Applications, vol. 28, no. 2, Gakko Tosho, 2019, pp. 425–47.
short: L. Portinale, U. Stefanelli, Advances in Mathematical Sciences and Applications
28 (2019) 425–447.
corr_author: '1'
date_created: 2020-02-28T10:54:41Z
date_published: 2019-10-22T00:00:00Z
date_updated: 2025-06-26T10:23:55Z
day: '22'
department:
- _id: JaMa
external_id:
arxiv:
- '1910.10050'
intvolume: ' 28'
issue: '2'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: ' https://doi.org/10.48550/arXiv.1910.10050'
month: '10'
oa: 1
oa_version: Preprint
page: 425-447
project:
- _id: fc31cba2-9c52-11eb-aca3-ff467d239cd2
grant_number: F6504
name: Taming Complexity in Partial Differential Systems
publication: Advances in Mathematical Sciences and Applications
publication_identifier:
issn:
- 1343-4373
publication_status: published
publisher: Gakko Tosho
quality_controlled: '1'
status: public
title: Penalization via global functionals of optimal-control problems for dissipative
evolution
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 28
year: '2019'
...
---
_id: '7552'
abstract:
- lang: eng
text: 'There is increasing evidence that protein binding to specific sites along
DNA can activate the reading out of genetic information without coming into direct
physical contact with the gene. There also is evidence that these distant but
interacting sites are embedded in a liquid droplet of proteins which condenses
out of the surrounding solution. We argue that droplet-mediated interactions can
account for crucial features of gene regulation only if the droplet is poised
at a non-generic point in its phase diagram. We explore a minimal model that embodies
this idea, show that this model has a natural mechanism for self-tuning, and suggest
direct experimental tests. '
article_number: '1912.08579'
article_processing_charge: No
arxiv: 1
author:
- first_name: William
full_name: Bialek, William
last_name: Bialek
- first_name: Thomas
full_name: Gregor, Thomas
last_name: Gregor
- first_name: Gašper
full_name: Tkačik, Gašper
id: 3D494DCA-F248-11E8-B48F-1D18A9856A87
last_name: Tkačik
orcid: 0000-0002-6699-1455
citation:
ama: Bialek W, Gregor T, Tkačik G. Action at a distance in transcriptional regulation.
arXiv. doi:10.48550/arXiv.1912.08579
apa: Bialek, W., Gregor, T., & Tkačik, G. (n.d.). Action at a distance in transcriptional
regulation. arXiv. ArXiv. https://doi.org/10.48550/arXiv.1912.08579
chicago: Bialek, William, Thomas Gregor, and Gašper Tkačik. “Action at a Distance
in Transcriptional Regulation.” ArXiv. ArXiv, n.d. https://doi.org/10.48550/arXiv.1912.08579.
ieee: W. Bialek, T. Gregor, and G. Tkačik, “Action at a distance in transcriptional
regulation,” arXiv. ArXiv.
ista: Bialek W, Gregor T, Tkačik G. Action at a distance in transcriptional regulation.
arXiv, 1912.08579.
mla: Bialek, William, et al. “Action at a Distance in Transcriptional Regulation.”
ArXiv, 1912.08579, ArXiv, doi:10.48550/arXiv.1912.08579.
short: W. Bialek, T. Gregor, G. Tkačik, ArXiv (n.d.).
date_created: 2020-02-28T10:57:08Z
date_published: 2019-12-18T00:00:00Z
date_updated: 2025-05-19T10:54:36Z
day: '18'
department:
- _id: GaTk
doi: 10.48550/arXiv.1912.08579
external_id:
arxiv:
- '1912.08579'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1912.08579
month: '12'
oa: 1
oa_version: Preprint
project:
- _id: 254E9036-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P28844-B27
name: Biophysics of information processing in gene regulation
publication: arXiv
publication_status: submitted
publisher: ArXiv
status: public
title: Action at a distance in transcriptional regulation
type: preprint
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2019'
...
---
_id: '7576'
abstract:
- lang: eng
text: We present the results of a friendly competition for formal verification of
continuous and hybrid systems with nonlinear continuous dynamics. The friendly
competition took place as part of the workshop Applied Verification for Continuous
and Hybrid Systems (ARCH) in 2019. In this year, 6 tools Ariadne, CORA, DynIbex,
Flow*, Isabelle/HOL, and JuliaReach (in alphabetic order) participated. They are
applied to solve reachability analysis problems on four benchmark problems, one
of them with hybrid dynamics. We do not rank the tools based on the results, but
show the current status and discover the potential advantages of different tools.
article_processing_charge: No
author:
- first_name: Fabian
full_name: Immler, Fabian
last_name: Immler
- first_name: Matthias
full_name: Althoff, Matthias
last_name: Althoff
- first_name: Luis
full_name: Benet, Luis
last_name: Benet
- first_name: Alexandre
full_name: Chapoutot, Alexandre
last_name: Chapoutot
- first_name: Xin
full_name: Chen, Xin
last_name: Chen
- first_name: Marcelo
full_name: Forets, Marcelo
last_name: Forets
- first_name: Luca
full_name: Geretti, Luca
last_name: Geretti
- first_name: Niklas
full_name: Kochdumper, Niklas
last_name: Kochdumper
- first_name: David P.
full_name: Sanders, David P.
last_name: Sanders
- first_name: Christian
full_name: Schilling, Christian
id: 3A2F4DCE-F248-11E8-B48F-1D18A9856A87
last_name: Schilling
orcid: 0000-0003-3658-1065
citation:
ama: 'Immler F, Althoff M, Benet L, et al. ARCH-COMP19 Category Report: Continuous
and hybrid systems with nonlinear dynamics. In: EPiC Series in Computing.
Vol 61. EasyChair; 2019:41-61. doi:10.29007/m75b'
apa: 'Immler, F., Althoff, M., Benet, L., Chapoutot, A., Chen, X., Forets, M., …
Schilling, C. (2019). ARCH-COMP19 Category Report: Continuous and hybrid systems
with nonlinear dynamics. In EPiC Series in Computing (Vol. 61, pp. 41–61).
Montreal, Canada: EasyChair. https://doi.org/10.29007/m75b'
chicago: 'Immler, Fabian, Matthias Althoff, Luis Benet, Alexandre Chapoutot, Xin
Chen, Marcelo Forets, Luca Geretti, Niklas Kochdumper, David P. Sanders, and Christian
Schilling. “ARCH-COMP19 Category Report: Continuous and Hybrid Systems with Nonlinear
Dynamics.” In EPiC Series in Computing, 61:41–61. EasyChair, 2019. https://doi.org/10.29007/m75b.'
ieee: 'F. Immler et al., “ARCH-COMP19 Category Report: Continuous and hybrid
systems with nonlinear dynamics,” in EPiC Series in Computing, Montreal,
Canada, 2019, vol. 61, pp. 41–61.'
ista: 'Immler F, Althoff M, Benet L, Chapoutot A, Chen X, Forets M, Geretti L, Kochdumper
N, Sanders DP, Schilling C. 2019. ARCH-COMP19 Category Report: Continuous and
hybrid systems with nonlinear dynamics. EPiC Series in Computing. ARCH: International
Workshop on Applied Verification on Continuous and Hybrid Systems vol. 61, 41–61.'
mla: 'Immler, Fabian, et al. “ARCH-COMP19 Category Report: Continuous and Hybrid
Systems with Nonlinear Dynamics.” EPiC Series in Computing, vol. 61, EasyChair,
2019, pp. 41–61, doi:10.29007/m75b.'
short: F. Immler, M. Althoff, L. Benet, A. Chapoutot, X. Chen, M. Forets, L. Geretti,
N. Kochdumper, D.P. Sanders, C. Schilling, in:, EPiC Series in Computing, EasyChair,
2019, pp. 41–61.
conference:
end_date: 2019-04-15
location: Montreal, Canada
name: 'ARCH: International Workshop on Applied Verification on Continuous and Hybrid
Systems'
start_date: 2019-04-15
corr_author: '1'
date_created: 2020-03-08T23:00:49Z
date_published: 2019-05-25T00:00:00Z
date_updated: 2026-04-03T09:51:13Z
day: '25'
ddc:
- '000'
department:
- _id: ToHe
doi: 10.29007/m75b
file:
- access_level: open_access
checksum: 9138977a06fcd6a95976eb4bca875f0c
content_type: application/pdf
creator: dernst
date_created: 2020-03-24T07:36:36Z
date_updated: 2020-07-14T12:48:00Z
file_id: '7617'
file_name: 2019_ARCH19_Immler.pdf
file_size: 1934830
relation: main_file
file_date_updated: 2020-07-14T12:48:00Z
has_accepted_license: '1'
intvolume: ' 61'
language:
- iso: eng
month: '05'
oa: 1
oa_version: Published Version
page: 41-61
publication: EPiC Series in Computing
publication_identifier:
eissn:
- 2398-7340
publication_status: published
publisher: EasyChair
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'ARCH-COMP19 Category Report: Continuous and hybrid systems with nonlinear
dynamics'
type: conference
user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd
volume: 61
year: '2019'
...
---
_id: '7606'
abstract:
- lang: eng
text: We derive a tight lower bound on equivocation (conditional entropy), or equivalently
a tight upper bound on mutual information between a signal variable and channel
outputs. The bound is in terms of the joint distribution of the signals and maximum
a posteriori decodes (most probable signals given channel output). As part of
our derivation, we describe the key properties of the distribution of signals,
channel outputs and decodes, that minimizes equivocation and maximizes mutual
information. This work addresses a problem in data analysis, where mutual information
between signals and decodes is sometimes used to lower bound the mutual information
between signals and channel outputs. Our result provides a corresponding upper
bound.
article_number: '8989292'
article_processing_charge: No
arxiv: 1
author:
- first_name: Michal
full_name: Hledik, Michal
id: 4171253A-F248-11E8-B48F-1D18A9856A87
last_name: Hledik
- first_name: Thomas R
full_name: Sokolowski, Thomas R
id: 3E999752-F248-11E8-B48F-1D18A9856A87
last_name: Sokolowski
orcid: 0000-0002-1287-3779
- first_name: Gašper
full_name: Tkačik, Gašper
id: 3D494DCA-F248-11E8-B48F-1D18A9856A87
last_name: Tkačik
orcid: 0000-0002-6699-1455
citation:
ama: 'Hledik M, Sokolowski TR, Tkačik G. A tight upper bound on mutual information.
In: IEEE Information Theory Workshop, ITW 2019. IEEE; 2019. doi:10.1109/ITW44776.2019.8989292'
apa: 'Hledik, M., Sokolowski, T. R., & Tkačik, G. (2019). A tight upper bound
on mutual information. In IEEE Information Theory Workshop, ITW 2019. Visby,
Sweden: IEEE. https://doi.org/10.1109/ITW44776.2019.8989292'
chicago: Hledik, Michal, Thomas R Sokolowski, and Gašper Tkačik. “A Tight Upper
Bound on Mutual Information.” In IEEE Information Theory Workshop, ITW 2019.
IEEE, 2019. https://doi.org/10.1109/ITW44776.2019.8989292.
ieee: M. Hledik, T. R. Sokolowski, and G. Tkačik, “A tight upper bound on mutual
information,” in IEEE Information Theory Workshop, ITW 2019, Visby, Sweden,
2019.
ista: Hledik M, Sokolowski TR, Tkačik G. 2019. A tight upper bound on mutual information.
IEEE Information Theory Workshop, ITW 2019. Information Theory Workshop, 8989292.
mla: Hledik, Michal, et al. “A Tight Upper Bound on Mutual Information.” IEEE
Information Theory Workshop, ITW 2019, 8989292, IEEE, 2019, doi:10.1109/ITW44776.2019.8989292.
short: M. Hledik, T.R. Sokolowski, G. Tkačik, in:, IEEE Information Theory Workshop,
ITW 2019, IEEE, 2019.
conference:
end_date: 2019-08-28
location: Visby, Sweden
name: Information Theory Workshop
start_date: 2019-08-25
date_created: 2020-03-22T23:00:47Z
date_published: 2019-08-01T00:00:00Z
date_updated: 2026-04-07T12:59:24Z
day: '01'
department:
- _id: GaTk
doi: 10.1109/ITW44776.2019.8989292
ec_funded: 1
external_id:
arxiv:
- '1812.01475'
isi:
- '000540384500015'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1812.01475
month: '08'
oa: 1
oa_version: Preprint
project:
- _id: 2564DBCA-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '665385'
name: International IST Doctoral Program
publication: IEEE Information Theory Workshop, ITW 2019
publication_identifier:
isbn:
- '9781538669006'
publication_status: published
publisher: IEEE
quality_controlled: '1'
related_material:
record:
- id: '15020'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: A tight upper bound on mutual information
type: conference
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
year: '2019'
...
---
_id: '7639'
abstract:
- lang: eng
text: Deep neural networks (DNNs) have become increasingly important due to their
excellent empirical performance on a wide range of problems. However, regularization
is generally achieved by indirect means, largely due to the complex set of functions
defined by a network and the difficulty in measuring function complexity. There
exists no method in the literature for additive regularization based on a norm
of the function, as is classically considered in statistical learning theory.
In this work, we study the tractability of function norms for deep neural networks
with ReLU activations. We provide, to the best of our knowledge, the first proof
in the literature of the NP-hardness of computing function norms of DNNs of 3
or more layers. We also highlight a fundamental difference between shallow and
deep networks. In the light on these results, we propose a new regularization
strategy based on approximate function norms, and show its efficiency on a segmentation
task with a DNN.
article_number: 748-752
article_processing_charge: No
author:
- first_name: Amal
full_name: Rannen-Triki, Amal
last_name: Rannen-Triki
- first_name: Maxim
full_name: Berman, Maxim
last_name: Berman
- first_name: Vladimir
full_name: Kolmogorov, Vladimir
id: 3D50B0BA-F248-11E8-B48F-1D18A9856A87
last_name: Kolmogorov
- first_name: Matthew B.
full_name: Blaschko, Matthew B.
last_name: Blaschko
citation:
ama: 'Rannen-Triki A, Berman M, Kolmogorov V, Blaschko MB. Function norms for neural
networks. In: Proceedings of the 2019 International Conference on Computer
Vision Workshop. IEEE; 2019. doi:10.1109/ICCVW.2019.00097'
apa: 'Rannen-Triki, A., Berman, M., Kolmogorov, V., & Blaschko, M. B. (2019).
Function norms for neural networks. In Proceedings of the 2019 International
Conference on Computer Vision Workshop. Seoul, South Korea: IEEE. https://doi.org/10.1109/ICCVW.2019.00097'
chicago: Rannen-Triki, Amal, Maxim Berman, Vladimir Kolmogorov, and Matthew B. Blaschko.
“Function Norms for Neural Networks.” In Proceedings of the 2019 International
Conference on Computer Vision Workshop. IEEE, 2019. https://doi.org/10.1109/ICCVW.2019.00097.
ieee: A. Rannen-Triki, M. Berman, V. Kolmogorov, and M. B. Blaschko, “Function norms
for neural networks,” in Proceedings of the 2019 International Conference on
Computer Vision Workshop, Seoul, South Korea, 2019.
ista: 'Rannen-Triki A, Berman M, Kolmogorov V, Blaschko MB. 2019. Function norms
for neural networks. Proceedings of the 2019 International Conference on Computer
Vision Workshop. ICCVW: International Conference on Computer Vision Workshop,
748–752.'
mla: Rannen-Triki, Amal, et al. “Function Norms for Neural Networks.” Proceedings
of the 2019 International Conference on Computer Vision Workshop, 748–752,
IEEE, 2019, doi:10.1109/ICCVW.2019.00097.
short: A. Rannen-Triki, M. Berman, V. Kolmogorov, M.B. Blaschko, in:, Proceedings
of the 2019 International Conference on Computer Vision Workshop, IEEE, 2019.
conference:
end_date: 2019-10-28
location: Seoul, South Korea
name: 'ICCVW: International Conference on Computer Vision Workshop'
start_date: 2019-10-27
date_created: 2020-04-05T22:00:50Z
date_published: 2019-10-01T00:00:00Z
date_updated: 2023-09-08T11:19:12Z
day: '01'
department:
- _id: VlKo
doi: 10.1109/ICCVW.2019.00097
external_id:
isi:
- '000554591600090'
isi: 1
language:
- iso: eng
month: '10'
oa_version: None
publication: Proceedings of the 2019 International Conference on Computer Vision Workshop
publication_identifier:
isbn:
- '9781728150239'
publication_status: published
publisher: IEEE
quality_controlled: '1'
scopus_import: '1'
status: public
title: Function norms for neural networks
type: conference
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
year: '2019'
...
---
_id: '7640'
abstract:
- lang: eng
text: We propose a new model for detecting visual relationships, such as "person
riding motorcycle" or "bottle on table". This task is an important step towards
comprehensive structured mage understanding, going beyond detecting individual
objects. Our main novelty is a Box Attention mechanism that allows to model pairwise
interactions between objects using standard object detection pipelines. The resulting
model is conceptually clean, expressive and relies on well-justified training
and prediction procedures. Moreover, unlike previously proposed approaches, our
model does not introduce any additional complex components or hyperparameters
on top of those already required by the underlying detection model. We conduct
an experimental evaluation on two datasets, V-COCO and Open Images, demonstrating
strong quantitative and qualitative results.
article_number: 1749-1753
article_processing_charge: No
arxiv: 1
author:
- first_name: Alexander
full_name: Kolesnikov, Alexander
id: 2D157DB6-F248-11E8-B48F-1D18A9856A87
last_name: Kolesnikov
- first_name: Alina
full_name: Kuznetsova, Alina
last_name: Kuznetsova
- first_name: Christoph
full_name: Lampert, Christoph
id: 40C20FD2-F248-11E8-B48F-1D18A9856A87
last_name: Lampert
orcid: 0000-0001-8622-7887
- first_name: Vittorio
full_name: Ferrari, Vittorio
last_name: Ferrari
citation:
ama: 'Kolesnikov A, Kuznetsova A, Lampert C, Ferrari V. Detecting visual relationships
using box attention. In: Proceedings of the 2019 International Conference on
Computer Vision Workshop. IEEE; 2019. doi:10.1109/ICCVW.2019.00217'
apa: 'Kolesnikov, A., Kuznetsova, A., Lampert, C., & Ferrari, V. (2019). Detecting
visual relationships using box attention. In Proceedings of the 2019 International
Conference on Computer Vision Workshop. Seoul, South Korea: IEEE. https://doi.org/10.1109/ICCVW.2019.00217'
chicago: Kolesnikov, Alexander, Alina Kuznetsova, Christoph Lampert, and Vittorio
Ferrari. “Detecting Visual Relationships Using Box Attention.” In Proceedings
of the 2019 International Conference on Computer Vision Workshop. IEEE, 2019.
https://doi.org/10.1109/ICCVW.2019.00217.
ieee: A. Kolesnikov, A. Kuznetsova, C. Lampert, and V. Ferrari, “Detecting visual
relationships using box attention,” in Proceedings of the 2019 International
Conference on Computer Vision Workshop, Seoul, South Korea, 2019.
ista: 'Kolesnikov A, Kuznetsova A, Lampert C, Ferrari V. 2019. Detecting visual
relationships using box attention. Proceedings of the 2019 International Conference
on Computer Vision Workshop. ICCVW: International Conference on Computer Vision
Workshop, 1749–1753.'
mla: Kolesnikov, Alexander, et al. “Detecting Visual Relationships Using Box Attention.”
Proceedings of the 2019 International Conference on Computer Vision Workshop,
1749–1753, IEEE, 2019, doi:10.1109/ICCVW.2019.00217.
short: A. Kolesnikov, A. Kuznetsova, C. Lampert, V. Ferrari, in:, Proceedings of
the 2019 International Conference on Computer Vision Workshop, IEEE, 2019.
conference:
end_date: 2019-10-28
location: Seoul, South Korea
name: 'ICCVW: International Conference on Computer Vision Workshop'
start_date: 2019-10-27
date_created: 2020-04-05T22:00:51Z
date_published: 2019-10-01T00:00:00Z
date_updated: 2025-04-15T07:10:23Z
day: '01'
department:
- _id: ChLa
doi: 10.1109/ICCVW.2019.00217
ec_funded: 1
external_id:
arxiv:
- '1807.02136'
isi:
- '000554591601098'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1807.02136
month: '10'
oa: 1
oa_version: Preprint
project:
- _id: 2532554C-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '308036'
name: Lifelong Learning of Visual Scene Understanding
publication: Proceedings of the 2019 International Conference on Computer Vision Workshop
publication_identifier:
isbn:
- '9781728150239'
publication_status: published
publisher: IEEE
quality_controlled: '1'
scopus_import: '1'
status: public
title: Detecting visual relationships using box attention
type: conference
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
year: '2019'
...
---
_id: '7950'
abstract:
- lang: eng
text: "The input to the token swapping problem is a graph with vertices v1, v2,
. . . , vn, and n tokens with labels 1,2, . . . , n, one on each vertex. The
goal is to get token i to vertex vi for all i= 1, . . . , n using a minimum number
of swaps, where a swap exchanges the tokens on the endpoints of an edge.Token
swapping on a tree, also known as “sorting with a transposition tree,” is not
known to be in P nor NP-complete. We present some partial results:\r\n1. An
optimum swap sequence may need to perform a swap on a leaf vertex that has the
correct token (a “happy leaf”), disproving a conjecture of Vaughan.\r\n2. Any
algorithm that fixes happy leaves—as all known approximation algorithms for the
problem do—has approximation factor at least 4/3. Furthermore, the two best-known
2-approximation algorithms have approximation factor exactly 2.\r\n3. A generalized
problem—weighted coloured token swapping—is NP-complete on trees, but solvable
in polynomial time on paths and stars. In this version, tokens and vertices
\ have colours, and colours have weights. The goal is to get every
token to a vertex of the same colour, and the cost of a swap is the sum of the
weights of the two tokens involved."
article_number: '1903.06981'
article_processing_charge: No
arxiv: 1
author:
- first_name: Ahmad
full_name: Biniaz, Ahmad
last_name: Biniaz
- first_name: Kshitij
full_name: Jain, Kshitij
last_name: Jain
- 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: Tillmann
full_name: Miltzow, Tillmann
last_name: Miltzow
- first_name: Debajyoti
full_name: Mondal, Debajyoti
last_name: Mondal
- first_name: Anurag Murty
full_name: Naredla, Anurag Murty
last_name: Naredla
- first_name: Josef
full_name: Tkadlec, Josef
id: 3F24CCC8-F248-11E8-B48F-1D18A9856A87
last_name: Tkadlec
orcid: 0000-0002-1097-9684
- first_name: Alexi
full_name: Turcotte, Alexi
last_name: Turcotte
citation:
ama: Biniaz A, Jain K, Lubiw A, et al. Token swapping on trees. arXiv. doi:10.48550/arXiv.1903.06981
apa: Biniaz, A., Jain, K., Lubiw, A., Masárová, Z., Miltzow, T., Mondal, D., … Turcotte,
A. (n.d.). Token swapping on trees. arXiv. https://doi.org/10.48550/arXiv.1903.06981
chicago: Biniaz, Ahmad, Kshitij Jain, Anna Lubiw, Zuzana Masárová, Tillmann Miltzow,
Debajyoti Mondal, Anurag Murty Naredla, Josef Tkadlec, and Alexi Turcotte. “Token
Swapping on Trees.” ArXiv, n.d. https://doi.org/10.48550/arXiv.1903.06981.
ieee: A. Biniaz et al., “Token swapping on trees,” arXiv. .
ista: Biniaz A, Jain K, Lubiw A, Masárová Z, Miltzow T, Mondal D, Naredla AM, Tkadlec
J, Turcotte A. Token swapping on trees. arXiv, 1903.06981.
mla: Biniaz, Ahmad, et al. “Token Swapping on Trees.” ArXiv, 1903.06981,
doi:10.48550/arXiv.1903.06981.
short: A. Biniaz, K. Jain, A. Lubiw, Z. Masárová, T. Miltzow, D. Mondal, A.M. Naredla,
J. Tkadlec, A. Turcotte, ArXiv (n.d.).
date_created: 2020-06-08T12:25:25Z
date_published: 2019-03-16T00:00:00Z
date_updated: 2026-04-08T07:23:00Z
day: '16'
department:
- _id: HeEd
- _id: UlWa
- _id: KrCh
doi: 10.48550/arXiv.1903.06981
external_id:
arxiv:
- '1903.06981'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1903.06981
month: '03'
oa: 1
oa_version: Preprint
publication: arXiv
publication_status: draft
related_material:
record:
- id: '12833'
relation: later_version
status: public
- id: '7944'
relation: dissertation_contains
status: public
status: public
title: Token swapping on trees
type: preprint
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2019'
...
---
_id: '8'
abstract:
- lang: eng
text: Despite their different origins, Drosophila glia and hemocytes are related
cell populations that provide an immune function. Drosophila hemocytes patrol
the body cavity and act as macrophages outside the nervous system whereas glia
originate from the neuroepithelium and provide the scavenger population of the
nervous system. Drosophila glia are hence the functional orthologs of vertebrate
microglia, even though the latter are cells of immune origin that subsequently
move into the brain during development. Interestingly, the Drosophila immune cells
within (glia) and outside the nervous system (hemocytes) require the same transcription
factor Glide/Gcm for their development. This raises the issue of how do glia specifically
differentiate in the nervous system and hemocytes in the procephalic mesoderm.
The Repo homeodomain transcription factor and pan-glial direct target of Glide/Gcm
is known to ensure glial terminal differentiation. Here we show that Repo also
takes center stage in the process that discriminates between glia and hemocytes.
First, Repo expression is repressed in the hemocyte anlagen by mesoderm-specific
factors. Second, Repo ectopic activation in the procephalic mesoderm is sufficient
to repress the expression of hemocyte-specific genes. Third, the lack of Repo
triggers the expression of hemocyte markers in glia. Thus, a complex network of
tissue-specific cues biases the potential of Glide/Gcm. These data allow us to
revise the concept of fate determinants and help us understand the bases of cell
specification. Both sexes were analyzed.SIGNIFICANCE STATEMENTDistinct cell types
often require the same pioneer transcription factor, raising the issue of how
does one factor trigger different fates. In Drosophila, glia and hemocytes provide
a scavenger activity within and outside the nervous system, respectively. While
they both require the Glide/Gcm transcription factor, glia originate from the
ectoderm, hemocytes from the mesoderm. Here we show that tissue-specific factors
inhibit the gliogenic potential of Glide/Gcm in the mesoderm by repressing the
expression of the homeodomain protein Repo, a major glial-specific target of Glide/Gcm.
Repo expression in turn inhibits the expression of hemocyte-specific genes in
the nervous system. These cell-specific networks secure the establishment of the
glial fate only in the nervous system and allow cell diversification.
acknowledgement: This work was supported by INSERM, CNRS, UDS, Ligue Régionale contre
le Cancer, Hôpital de Strasbourg, Association pour la Recherche sur le Cancer (ARC)
and Agence Nationale de la Recherche (ANR) grants. P.B.C. was funded by the ANR
and by the ARSEP (Fondation pour l'Aide à la Recherche sur la Sclérose en Plaques),
and G.T. by governmental and ARC fellowships. This work was also supported by grants
from the Ataxia UK (2491) and the NC3R (NC/L000199/1) awarded to M.F. The Institut
de Génétique et de Biologie Moléculaire et Cellulaire was also supported by a French
state fund through the ANR labex. D.E.S. was funded by Marie Curie Grant CIG 334077/IRTIM.
We thank B. Altenhein, K. Brückner, M. Crozatier, L. Waltzer, M. Logan, E. Kurant,
R. Reuter, E. Kurucz, J.L Dimarcq, J. Hoffmann, C. Goodman, the DHSB, and the BDSC
for reagents and flies. We also thank all of the laboratory members for comments
on the manuscript; C. Diebold, C. Delaporte, M. Pezze, the fly, and imaging and
antibody facilities for technical assistance; and D. Dembele for help with statistics.
In addition, we thank Alison Brewer for help with Luciferase assays.
article_processing_charge: No
article_type: original
author:
- first_name: Guillaume
full_name: Trébuchet, Guillaume
last_name: Trébuchet
- first_name: Pierre B
full_name: Cattenoz, Pierre B
last_name: Cattenoz
- first_name: János
full_name: Zsámboki, János
last_name: Zsámboki
- first_name: David
full_name: Mazaud, David
last_name: Mazaud
- first_name: Daria E
full_name: Siekhaus, Daria E
id: 3D224B9E-F248-11E8-B48F-1D18A9856A87
last_name: Siekhaus
orcid: 0000-0001-8323-8353
- first_name: Manolis
full_name: Fanto, Manolis
last_name: Fanto
- first_name: Angela
full_name: Giangrande, Angela
last_name: Giangrande
citation:
ama: Trébuchet G, Cattenoz PB, Zsámboki J, et al. The Repo homeodomain transcription
factor suppresses hematopoiesis in Drosophila and preserves the glial fate. Journal
of Neuroscience. 2019;39(2):238-255. doi:10.1523/JNEUROSCI.1059-18.2018
apa: Trébuchet, G., Cattenoz, P. B., Zsámboki, J., Mazaud, D., Siekhaus, D. E.,
Fanto, M., & Giangrande, A. (2019). The Repo homeodomain transcription factor
suppresses hematopoiesis in Drosophila and preserves the glial fate. Journal
of Neuroscience. Society for Neuroscience. https://doi.org/10.1523/JNEUROSCI.1059-18.2018
chicago: Trébuchet, Guillaume, Pierre B Cattenoz, János Zsámboki, David Mazaud,
Daria E Siekhaus, Manolis Fanto, and Angela Giangrande. “The Repo Homeodomain
Transcription Factor Suppresses Hematopoiesis in Drosophila and Preserves the
Glial Fate.” Journal of Neuroscience. Society for Neuroscience, 2019. https://doi.org/10.1523/JNEUROSCI.1059-18.2018.
ieee: G. Trébuchet et al., “The Repo homeodomain transcription factor suppresses
hematopoiesis in Drosophila and preserves the glial fate,” Journal of Neuroscience,
vol. 39, no. 2. Society for Neuroscience, pp. 238–255, 2019.
ista: Trébuchet G, Cattenoz PB, Zsámboki J, Mazaud D, Siekhaus DE, Fanto M, Giangrande
A. 2019. The Repo homeodomain transcription factor suppresses hematopoiesis in
Drosophila and preserves the glial fate. Journal of Neuroscience. 39(2), 238–255.
mla: Trébuchet, Guillaume, et al. “The Repo Homeodomain Transcription Factor Suppresses
Hematopoiesis in Drosophila and Preserves the Glial Fate.” Journal of Neuroscience,
vol. 39, no. 2, Society for Neuroscience, 2019, pp. 238–55, doi:10.1523/JNEUROSCI.1059-18.2018.
short: G. Trébuchet, P.B. Cattenoz, J. Zsámboki, D. Mazaud, D.E. Siekhaus, M. Fanto,
A. Giangrande, Journal of Neuroscience 39 (2019) 238–255.
date_created: 2018-12-11T11:44:07Z
date_published: 2019-01-09T00:00:00Z
date_updated: 2025-04-15T06:52:10Z
day: '09'
ddc:
- '570'
department:
- _id: DaSi
doi: 10.1523/JNEUROSCI.1059-18.2018
ec_funded: 1
external_id:
isi:
- '000455189900006'
pmid:
- '30504274'
file:
- access_level: open_access
checksum: 8f6925eb4cd1e8747d8ea25929c68de6
content_type: application/pdf
creator: dernst
date_created: 2020-10-02T09:33:28Z
date_updated: 2020-10-02T09:33:28Z
file_id: '8596'
file_name: 2019_JournNeuroscience_Trebuchet.pdf
file_size: 9455414
relation: main_file
success: 1
file_date_updated: 2020-10-02T09:33:28Z
has_accepted_license: '1'
intvolume: ' 39'
isi: 1
issue: '2'
language:
- iso: eng
month: '01'
oa: 1
oa_version: Published Version
page: 238-255
pmid: 1
project:
- _id: 2536F660-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '334077'
name: Investigating the role of transporters in invasive migration through junctions
publication: Journal of Neuroscience
publication_status: published
publisher: Society for Neuroscience
publist_id: '8048'
quality_controlled: '1'
scopus_import: '1'
status: public
title: The Repo homeodomain transcription factor suppresses hematopoiesis in Drosophila
and preserves the glial fate
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 39
year: '2019'
...
---
_id: '80'
abstract:
- lang: eng
text: 'We consider an interacting, dilute Bose gas trapped in a harmonic potential
at a positive temperature. The system is analyzed in a combination of a thermodynamic
and a Gross–Pitaevskii (GP) limit where the trap frequency ω, the temperature
T, and the particle number N are related by N∼ (T/ ω) 3→ ∞ while the scattering
length is so small that the interaction energy per particle around the center
of the trap is of the same order of magnitude as the spectral gap in the trap.
We prove that the difference between the canonical free energy of the interacting
gas and the one of the noninteracting system can be obtained by minimizing the
GP energy functional. We also prove Bose–Einstein condensation in the following
sense: The one-particle density matrix of any approximate minimizer of the canonical
free energy functional is to leading order given by that of the noninteracting
gas but with the free condensate wavefunction replaced by the GP minimizer.'
article_processing_charge: Yes (via OA deal)
article_type: original
author:
- first_name: Andreas
full_name: Deuchert, Andreas
id: 4DA65CD0-F248-11E8-B48F-1D18A9856A87
last_name: Deuchert
orcid: 0000-0003-3146-6746
- first_name: Robert
full_name: Seiringer, Robert
id: 4AFD0470-F248-11E8-B48F-1D18A9856A87
last_name: Seiringer
orcid: 0000-0002-6781-0521
- first_name: Jakob
full_name: Yngvason, Jakob
last_name: Yngvason
citation:
ama: Deuchert A, Seiringer R, Yngvason J. Bose–Einstein condensation in a dilute,
trapped gas at positive temperature. Communications in Mathematical Physics.
2019;368(2):723-776. doi:10.1007/s00220-018-3239-0
apa: Deuchert, A., Seiringer, R., & Yngvason, J. (2019). Bose–Einstein condensation
in a dilute, trapped gas at positive temperature. Communications in Mathematical
Physics. Springer. https://doi.org/10.1007/s00220-018-3239-0
chicago: Deuchert, Andreas, Robert Seiringer, and Jakob Yngvason. “Bose–Einstein
Condensation in a Dilute, Trapped Gas at Positive Temperature.” Communications
in Mathematical Physics. Springer, 2019. https://doi.org/10.1007/s00220-018-3239-0.
ieee: A. Deuchert, R. Seiringer, and J. Yngvason, “Bose–Einstein condensation in
a dilute, trapped gas at positive temperature,” Communications in Mathematical
Physics, vol. 368, no. 2. Springer, pp. 723–776, 2019.
ista: Deuchert A, Seiringer R, Yngvason J. 2019. Bose–Einstein condensation in a
dilute, trapped gas at positive temperature. Communications in Mathematical Physics.
368(2), 723–776.
mla: Deuchert, Andreas, et al. “Bose–Einstein Condensation in a Dilute, Trapped
Gas at Positive Temperature.” Communications in Mathematical Physics, vol.
368, no. 2, Springer, 2019, pp. 723–76, doi:10.1007/s00220-018-3239-0.
short: A. Deuchert, R. Seiringer, J. Yngvason, Communications in Mathematical Physics
368 (2019) 723–776.
date_created: 2018-12-11T11:44:31Z
date_published: 2019-06-01T00:00:00Z
date_updated: 2025-04-14T07:27:00Z
day: '01'
ddc:
- '530'
department:
- _id: RoSe
doi: 10.1007/s00220-018-3239-0
ec_funded: 1
external_id:
isi:
- '000467796800007'
file:
- access_level: open_access
checksum: c7e9880b43ac726712c1365e9f2f73a6
content_type: application/pdf
creator: dernst
date_created: 2018-12-17T10:34:06Z
date_updated: 2020-07-14T12:48:07Z
file_id: '5688'
file_name: 2018_CommunMathPhys_Deuchert.pdf
file_size: 893902
relation: main_file
file_date_updated: 2020-07-14T12:48:07Z
has_accepted_license: '1'
intvolume: ' 368'
isi: 1
issue: '2'
language:
- iso: eng
license: https://creativecommons.org/licenses/by/4.0/
month: '06'
oa: 1
oa_version: Published Version
page: 723-776
project:
- _id: 25C6DC12-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '694227'
name: Analysis of quantum many-body systems
- _id: 25C878CE-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P27533_N27
name: Structure of the Excitation Spectrum for Many-Body Quantum Systems
publication: Communications in Mathematical Physics
publication_status: published
publisher: Springer
publist_id: '7974'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Bose–Einstein condensation in a dilute, trapped gas at positive temperature
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 368
year: '2019'
...
---
_id: '8175'
abstract:
- lang: eng
text: We study edge asymptotics of poissonized Plancherel-type measures on skew
Young diagrams (integer partitions). These measures can be seen as generalizations
of those studied by Baik--Deift--Johansson and Baik--Rains in resolving Ulam's
problem on longest increasing subsequences of random permutations and the last
passage percolation (corner growth) discrete versions thereof. Moreover they interpolate
between said measures and the uniform measure on partitions. In the new KPZ-like
1/3 exponent edge scaling limit with logarithmic corrections, we find new probability
distributions generalizing the classical Tracy--Widom GUE, GOE and GSE distributions
from the theory of random matrices.
acknowledgement: "D.B. is especially grateful to Patrik Ferrari for suggesting simplifications
in Section 3 and\r\nto Alessandra Occelli for suggesting the name for the models
of Section 2.\r\n"
article_number: '34'
article_processing_charge: No
arxiv: 1
author:
- first_name: Dan
full_name: Betea, Dan
last_name: Betea
- first_name: Jérémie
full_name: Bouttier, Jérémie
last_name: Bouttier
- first_name: Peter
full_name: Nejjar, Peter
id: 4BF426E2-F248-11E8-B48F-1D18A9856A87
last_name: Nejjar
- first_name: Mirjana
full_name: Vuletíc, Mirjana
last_name: Vuletíc
citation:
ama: 'Betea D, Bouttier J, Nejjar P, Vuletíc M. New edge asymptotics of skew Young
diagrams via free boundaries. In: Proceedings on the 31st International Conference
on Formal Power Series and Algebraic Combinatorics. Formal Power Series and
Algebraic Combinatorics; 2019.'
apa: 'Betea, D., Bouttier, J., Nejjar, P., & Vuletíc, M. (2019). New edge asymptotics
of skew Young diagrams via free boundaries. In Proceedings on the 31st International
Conference on Formal Power Series and Algebraic Combinatorics. Ljubljana,
Slovenia: Formal Power Series and Algebraic Combinatorics.'
chicago: Betea, Dan, Jérémie Bouttier, Peter Nejjar, and Mirjana Vuletíc. “New Edge
Asymptotics of Skew Young Diagrams via Free Boundaries.” In Proceedings on
the 31st International Conference on Formal Power Series and Algebraic Combinatorics.
Formal Power Series and Algebraic Combinatorics, 2019.
ieee: D. Betea, J. Bouttier, P. Nejjar, and M. Vuletíc, “New edge asymptotics of
skew Young diagrams via free boundaries,” in Proceedings on the 31st International
Conference on Formal Power Series and Algebraic Combinatorics, Ljubljana,
Slovenia, 2019.
ista: 'Betea D, Bouttier J, Nejjar P, Vuletíc M. 2019. New edge asymptotics of skew
Young diagrams via free boundaries. Proceedings on the 31st International Conference
on Formal Power Series and Algebraic Combinatorics. FPSAC: International Conference
on Formal Power Series and Algebraic Combinatorics, 34.'
mla: Betea, Dan, et al. “New Edge Asymptotics of Skew Young Diagrams via Free Boundaries.”
Proceedings on the 31st International Conference on Formal Power Series and
Algebraic Combinatorics, 34, Formal Power Series and Algebraic Combinatorics,
2019.
short: D. Betea, J. Bouttier, P. Nejjar, M. Vuletíc, in:, Proceedings on the 31st
International Conference on Formal Power Series and Algebraic Combinatorics, Formal
Power Series and Algebraic Combinatorics, 2019.
conference:
end_date: 2019-07-05
location: Ljubljana, Slovenia
name: 'FPSAC: International Conference on Formal Power Series and Algebraic Combinatorics'
start_date: 2019-07-01
date_created: 2020-07-26T22:01:04Z
date_published: 2019-07-01T00:00:00Z
date_updated: 2021-01-12T08:17:18Z
day: '01'
department:
- _id: LaEr
ec_funded: 1
external_id:
arxiv:
- '1902.08750'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1902.08750
month: '07'
oa: 1
oa_version: Preprint
project:
- _id: 258DCDE6-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '338804'
name: Random matrices, universality and disordered quantum systems
- _id: 256E75B8-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '716117'
name: Optimal Transport and Stochastic Dynamics
publication: Proceedings on the 31st International Conference on Formal Power Series
and Algebraic Combinatorics
publication_status: published
publisher: Formal Power Series and Algebraic Combinatorics
quality_controlled: '1'
scopus_import: '1'
status: public
title: New edge asymptotics of skew Young diagrams via free boundaries
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2019'
...
---
_id: '8182'
abstract:
- lang: eng
text: "Suppose that $n\\neq p^k$ and $n\\neq 2p^k$ for all $k$ and all primes $p$.
We prove that for any Hausdorff compactum $X$ with a free action of the symmetric
group $\\mathfrak S_n$ there exists an $\\mathfrak S_n$-equivariant map $X \\to\r\n{\\mathbb
R}^n$ whose image avoids the diagonal $\\{(x,x\\dots,x)\\in {\\mathbb R}^n|x\\in
{\\mathbb R}\\}$.\r\n Previously, the special cases of this statement for certain
$X$ were usually proved using the equivartiant obstruction theory. Such calculations
are difficult and may become infeasible past the first (primary) obstruction.
We\r\ntake a different approach which allows us to prove the vanishing of all
obstructions simultaneously. The essential step in the proof is classifying the
possible degrees of $\\mathfrak S_n$-equivariant maps from the boundary\r\n$\\partial\\Delta^{n-1}$
of $(n-1)$-simplex to itself. Existence of equivariant maps between spaces is
important for many questions arising from discrete mathematics and geometry, such
as Kneser's conjecture, the Square Peg conjecture, the Splitting Necklace problem,
and the Topological Tverberg conjecture, etc. We demonstrate the utility of our
result applying it to one such question, a specific instance of envy-free division
problem."
article_number: '1910.12628'
article_processing_charge: No
arxiv: 1
author:
- first_name: Sergey
full_name: Avvakumov, Sergey
id: 3827DAC8-F248-11E8-B48F-1D18A9856A87
last_name: Avvakumov
orcid: 0000-0002-7840-5062
- 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. doi:10.48550/arXiv.1910.12628
apa: Avvakumov, S., & Kudrya, S. (n.d.). Vanishing of all equivariant obstructions
and the mapping degree. arXiv. https://doi.org/10.48550/arXiv.1910.12628
chicago: Avvakumov, Sergey, and Sergey Kudrya. “Vanishing of All Equivariant Obstructions
and the Mapping Degree.” ArXiv, n.d. https://doi.org/10.48550/arXiv.1910.12628.
ieee: S. Avvakumov and S. Kudrya, “Vanishing of all equivariant obstructions and
the mapping degree,” 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, doi:10.48550/arXiv.1910.12628.
short: S. Avvakumov, S. Kudrya, ArXiv (n.d.).
corr_author: '1'
date_created: 2020-07-30T10:45:08Z
date_published: 2019-10-28T00:00:00Z
date_updated: 2026-04-08T07:25:54Z
day: '28'
department:
- _id: UlWa
doi: 10.48550/arXiv.1910.12628
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: draft
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: '8184'
abstract:
- lang: eng
text: "Denote by ∆N the N-dimensional simplex. A map f : ∆N → Rd is an almost r-embedding
if fσ1∩. . .∩fσr = ∅ whenever σ1, . . . , σr are pairwise disjoint faces. A counterexample
to the topological Tverberg conjecture asserts that if r is not a prime power
and d ≥ 2r + 1, then there is an almost r-embedding ∆(d+1)(r−1) → Rd. This was
improved by Blagojevi´c–Frick–Ziegler using a simple construction of higher-dimensional
counterexamples by taking k-fold join power of lower-dimensional ones. We improve
this further (for d large compared to r): If r is not a prime power and N := (d+
1)r−r l\r\nd + 2 r + 1 m−2, then there is an almost r-embedding ∆N → Rd. For the
r-fold van Kampen–Flores conjecture we also produce counterexamples which are
stronger than previously known. Our proof is based on generalizations of the Mabillard–Wagner
theorem on construction of almost r-embeddings from equivariant maps, and of the
Ozaydin theorem on existence of equivariant maps. "
acknowledgement: We would like to thank F. Frick for helpful discussions
article_number: '1908.08731'
article_processing_charge: No
arxiv: 1
author:
- first_name: Sergey
full_name: Avvakumov, Sergey
id: 3827DAC8-F248-11E8-B48F-1D18A9856A87
last_name: Avvakumov
orcid: 0000-0002-7840-5062
- first_name: R.
full_name: Karasev, R.
last_name: Karasev
- first_name: A.
full_name: Skopenkov, A.
last_name: Skopenkov
citation:
ama: Avvakumov S, Karasev R, Skopenkov A. Stronger counterexamples to the topological
Tverberg conjecture. arXiv. doi:10.48550/arXiv.1908.08731
apa: Avvakumov, S., Karasev, R., & Skopenkov, A. (n.d.). Stronger counterexamples
to the topological Tverberg conjecture. arXiv. https://doi.org/10.48550/arXiv.1908.08731
chicago: Avvakumov, Sergey, R. Karasev, and A. Skopenkov. “Stronger Counterexamples
to the Topological Tverberg Conjecture.” ArXiv, n.d. https://doi.org/10.48550/arXiv.1908.08731.
ieee: S. Avvakumov, R. Karasev, and A. Skopenkov, “Stronger counterexamples to the
topological Tverberg conjecture,” arXiv. .
ista: Avvakumov S, Karasev R, Skopenkov A. Stronger counterexamples to the topological
Tverberg conjecture. arXiv, 1908.08731.
mla: Avvakumov, Sergey, et al. “Stronger Counterexamples to the Topological Tverberg
Conjecture.” ArXiv, 1908.08731, doi:10.48550/arXiv.1908.08731.
short: S. Avvakumov, R. Karasev, A. Skopenkov, ArXiv (n.d.).
date_created: 2020-07-30T10:45:34Z
date_published: 2019-08-23T00:00:00Z
date_updated: 2026-04-08T07:25:54Z
day: '23'
department:
- _id: UlWa
doi: 10.48550/arXiv.1908.08731
external_id:
arxiv:
- '1908.08731'
isi:
- '000986519600004'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1908.08731
month: '08'
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: draft
related_material:
record:
- id: '8156'
relation: dissertation_contains
status: public
status: public
title: Stronger counterexamples to the topological Tverberg conjecture
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
arxiv: 1
author:
- first_name: Sergey
full_name: Avvakumov, Sergey
id: 3827DAC8-F248-11E8-B48F-1D18A9856A87
last_name: Avvakumov
orcid: 0000-0002-7840-5062
- 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.).
corr_author: '1'
date_created: 2020-07-30T10:45:51Z
date_published: 2019-07-25T00:00:00Z
date_updated: 2026-04-08T07:25:54Z
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: draft
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: '5790'
abstract:
- lang: eng
text: The partial representation extension problem is a recently introduced generalization
of the recognition problem. A circle graph is an intersection graph of chords
of a circle. We study the partial representation extension problem for circle
graphs, where the input consists of a graph G and a partial representation R′
giving some predrawn chords that represent an induced subgraph of G. The question
is whether one can extend R′ to a representation R of the entire graph G, that
is, whether one can draw the remaining chords into a partially predrawn representation
to obtain a representation of G. Our main result is an O(n3) time algorithm for
partial representation extension of circle graphs, where n is the number of vertices.
To show this, we describe the structure of all representations of a circle graph
using split decomposition. This can be of independent interest.
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Steven
full_name: Chaplick, Steven
last_name: Chaplick
- first_name: Radoslav
full_name: Fulek, Radoslav
id: 39F3FFE4-F248-11E8-B48F-1D18A9856A87
last_name: Fulek
orcid: 0000-0001-8485-1774
- first_name: Pavel
full_name: Klavík, Pavel
last_name: Klavík
citation:
ama: Chaplick S, Fulek R, Klavík P. Extending partial representations of circle
graphs. Journal of Graph Theory. 2019;91(4):365-394. doi:10.1002/jgt.22436
apa: Chaplick, S., Fulek, R., & Klavík, P. (2019). Extending partial representations
of circle graphs. Journal of Graph Theory. Wiley. https://doi.org/10.1002/jgt.22436
chicago: Chaplick, Steven, Radoslav Fulek, and Pavel Klavík. “Extending Partial
Representations of Circle Graphs.” Journal of Graph Theory. Wiley, 2019.
https://doi.org/10.1002/jgt.22436.
ieee: S. Chaplick, R. Fulek, and P. Klavík, “Extending partial representations of
circle graphs,” Journal of Graph Theory, vol. 91, no. 4. Wiley, pp. 365–394,
2019.
ista: Chaplick S, Fulek R, Klavík P. 2019. Extending partial representations of
circle graphs. Journal of Graph Theory. 91(4), 365–394.
mla: Chaplick, Steven, et al. “Extending Partial Representations of Circle Graphs.”
Journal of Graph Theory, vol. 91, no. 4, Wiley, 2019, pp. 365–94, doi:10.1002/jgt.22436.
short: S. Chaplick, R. Fulek, P. Klavík, Journal of Graph Theory 91 (2019) 365–394.
date_created: 2018-12-30T22:59:15Z
date_published: 2019-08-01T00:00:00Z
date_updated: 2026-04-16T09:47:19Z
day: '01'
department:
- _id: UlWa
doi: 10.1002/jgt.22436
ec_funded: 1
external_id:
arxiv:
- '1309.2399'
isi:
- '000485392800004'
intvolume: ' 91'
isi: 1
issue: '4'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1309.2399
month: '08'
oa: 1
oa_version: Preprint
page: 365-394
project:
- _id: 25681D80-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '291734'
name: International IST Postdoc Fellowship Programme
publication: Journal of Graph Theory
publication_identifier:
issn:
- 0364-9024
publication_status: published
publisher: Wiley
quality_controlled: '1'
scopus_import: '1'
status: public
title: Extending partial representations of circle graphs
type: journal_article
user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd
volume: 91
year: '2019'
...
---
_id: '5793'
abstract:
- lang: eng
text: The transcription coactivator, Yes-associated protein (YAP), which is a nuclear
effector of the Hippo signaling pathway, has been shown to be a mechano-transducer.
By using mutant fish and human 3D spheroids, we have recently demonstrated that
YAP is also a mechano-effector. YAP functions in three-dimensional (3D) morphogenesis
of organ and global body shape by controlling actomyosin-mediated tissue tension.
In this chapter, we present a platform that links the findings in fish embryos
with human cells. The protocols for analyzing tissue tension-mediated global body
shape/organ morphogenesis in vivo and ex vivo using medaka fish embryos and in
vitro using human cell spheroids represent useful tools for unraveling the molecular
mechanisms by which YAP functions in regulating global body/organ morphogenesis.
alternative_title:
- MIMB
author:
- first_name: Yoichi
full_name: Asaoka, Yoichi
last_name: Asaoka
- first_name: Hitoshi
full_name: Morita, Hitoshi
last_name: Morita
- first_name: Hiroko
full_name: Furumoto, Hiroko
last_name: Furumoto
- first_name: Carl-Philipp J
full_name: Heisenberg, Carl-Philipp J
id: 39427864-F248-11E8-B48F-1D18A9856A87
last_name: Heisenberg
orcid: 0000-0002-0912-4566
- first_name: Makoto
full_name: Furutani-Seiki, Makoto
last_name: Furutani-Seiki
citation:
ama: 'Asaoka Y, Morita H, Furumoto H, Heisenberg C-PJ, Furutani-Seiki M. Studying
YAP-mediated 3D morphogenesis using fish embryos and human spheroids. In: Hergovich
A, ed. The Hippo Pathway. Vol 1893. Methods in Molecular Biology. Springer;
2019:167-181. doi:10.1007/978-1-4939-8910-2_14'
apa: Asaoka, Y., Morita, H., Furumoto, H., Heisenberg, C.-P. J., & Furutani-Seiki,
M. (2019). Studying YAP-mediated 3D morphogenesis using fish embryos and human
spheroids. In A. Hergovich (Ed.), The hippo pathway (Vol. 1893, pp. 167–181).
Springer. https://doi.org/10.1007/978-1-4939-8910-2_14
chicago: Asaoka, Yoichi, Hitoshi Morita, Hiroko Furumoto, Carl-Philipp J Heisenberg,
and Makoto Furutani-Seiki. “Studying YAP-Mediated 3D Morphogenesis Using Fish
Embryos and Human Spheroids.” In The Hippo Pathway, edited by Alexander
Hergovich, 1893:167–81. Methods in Molecular Biology. Springer, 2019. https://doi.org/10.1007/978-1-4939-8910-2_14.
ieee: Y. Asaoka, H. Morita, H. Furumoto, C.-P. J. Heisenberg, and M. Furutani-Seiki,
“Studying YAP-mediated 3D morphogenesis using fish embryos and human spheroids,”
in The hippo pathway, vol. 1893, A. Hergovich, Ed. Springer, 2019, pp.
167–181.
ista: 'Asaoka Y, Morita H, Furumoto H, Heisenberg C-PJ, Furutani-Seiki M. 2019.Studying
YAP-mediated 3D morphogenesis using fish embryos and human spheroids. In: The
hippo pathway. MIMB, vol. 1893, 167–181.'
mla: Asaoka, Yoichi, et al. “Studying YAP-Mediated 3D Morphogenesis Using Fish Embryos
and Human Spheroids.” The Hippo Pathway, edited by Alexander Hergovich,
vol. 1893, Springer, 2019, pp. 167–81, doi:10.1007/978-1-4939-8910-2_14.
short: Y. Asaoka, H. Morita, H. Furumoto, C.-P.J. Heisenberg, M. Furutani-Seiki,
in:, A. Hergovich (Ed.), The Hippo Pathway, Springer, 2019, pp. 167–181.
date_created: 2019-01-06T22:59:11Z
date_published: 2019-01-01T00:00:00Z
date_updated: 2021-01-12T08:03:30Z
day: '01'
department:
- _id: CaHe
doi: 10.1007/978-1-4939-8910-2_14
editor:
- first_name: Alexander
full_name: Hergovich, Alexander
last_name: Hergovich
intvolume: ' 1893'
language:
- iso: eng
month: '01'
oa_version: None
page: 167-181
publication: The hippo pathway
publication_identifier:
isbn:
- 978-1-4939-8909-6
publication_status: published
publisher: Springer
quality_controlled: '1'
scopus_import: 1
series_title: Methods in Molecular Biology
status: public
title: Studying YAP-mediated 3D morphogenesis using fish embryos and human spheroids
type: book_chapter
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 1893
year: '2019'
...
---
_id: '5817'
abstract:
- lang: eng
text: We theoretically study the shapes of lipid vesicles confined to a spherical
cavity, elaborating a framework based on the so-called limiting shapes constructed
from geometrically simple structural elements such as double-membrane walls and
edges. Partly inspired by numerical results, the proposed non-compartmentalized
and compartmentalized limiting shapes are arranged in the bilayer-couple phase
diagram which is then compared to its free-vesicle counterpart. We also compute
the area-difference-elasticity phase diagram of the limiting shapes and we use
it to interpret shape transitions experimentally observed in vesicles confined
within another vesicle. The limiting-shape framework may be generalized to theoretically
investigate the structure of certain cell organelles such as the mitochondrion.
article_processing_charge: No
article_type: original
author:
- first_name: Bor
full_name: Kavcic, Bor
id: 350F91D2-F248-11E8-B48F-1D18A9856A87
last_name: Kavcic
orcid: 0000-0001-6041-254X
- first_name: A.
full_name: Sakashita, A.
last_name: Sakashita
- first_name: H.
full_name: Noguchi, H.
last_name: Noguchi
- first_name: P.
full_name: Ziherl, P.
last_name: Ziherl
citation:
ama: Kavcic B, Sakashita A, Noguchi H, Ziherl P. Limiting shapes of confined lipid
vesicles. Soft Matter. 2019;15(4):602-614. doi:10.1039/c8sm01956h
apa: Kavcic, B., Sakashita, A., Noguchi, H., & Ziherl, P. (2019). Limiting shapes
of confined lipid vesicles. Soft Matter. Royal Society of Chemistry. https://doi.org/10.1039/c8sm01956h
chicago: Kavcic, Bor, A. Sakashita, H. Noguchi, and P. Ziherl. “Limiting Shapes
of Confined Lipid Vesicles.” Soft Matter. Royal Society of Chemistry, 2019.
https://doi.org/10.1039/c8sm01956h.
ieee: B. Kavcic, A. Sakashita, H. Noguchi, and P. Ziherl, “Limiting shapes of confined
lipid vesicles,” Soft Matter, vol. 15, no. 4. Royal Society of Chemistry,
pp. 602–614, 2019.
ista: Kavcic B, Sakashita A, Noguchi H, Ziherl P. 2019. Limiting shapes of confined
lipid vesicles. Soft Matter. 15(4), 602–614.
mla: Kavcic, Bor, et al. “Limiting Shapes of Confined Lipid Vesicles.” Soft Matter,
vol. 15, no. 4, Royal Society of Chemistry, 2019, pp. 602–14, doi:10.1039/c8sm01956h.
short: B. Kavcic, A. Sakashita, H. Noguchi, P. Ziherl, Soft Matter 15 (2019) 602–614.
corr_author: '1'
date_created: 2019-01-11T07:37:47Z
date_published: 2019-01-10T00:00:00Z
date_updated: 2024-10-09T20:58:29Z
day: '10'
ddc:
- '530'
department:
- _id: GaTk
doi: 10.1039/c8sm01956h
external_id:
isi:
- '000457329700003'
pmid:
- '30629082'
file:
- access_level: open_access
checksum: 614c337d6424ccd3d48d1b1f9513510d
content_type: application/pdf
creator: bkavcic
date_created: 2020-10-09T11:00:05Z
date_updated: 2020-10-09T11:00:05Z
file_id: '8641'
file_name: lmt_sftmtr_V8.pdf
file_size: 5370762
relation: main_file
success: 1
file_date_updated: 2020-10-09T11:00:05Z
has_accepted_license: '1'
intvolume: ' 15'
isi: 1
issue: '4'
language:
- iso: eng
license: https://creativecommons.org/licenses/by-nc-nd/3.0/
month: '01'
oa: 1
oa_version: Submitted Version
page: 602-614
pmid: 1
publication: Soft Matter
publication_identifier:
eissn:
- 1744-6848
issn:
- 1744-683X
publication_status: published
publisher: Royal Society of Chemistry
quality_controlled: '1'
scopus_import: '1'
status: public
title: Limiting shapes of confined lipid vesicles
tmp:
image: /images/cc_by_nc_nd.png
legal_code_url: https://creativecommons.org/licenses/by-nc-nd/3.0/legalcode
name: Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported (CC BY-NC-ND
3.0)
short: CC BY-NC-ND (3.0)
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 15
year: '2019'
...
---
_id: '5828'
abstract:
- lang: eng
text: Hippocampus is needed for both spatial working and reference memories. Here,
using a radial eight-arm maze, we examined how the combined demand on these memories
influenced CA1 place cell assemblies while reference memories were partially updated.
This was contrasted with control tasks requiring only working memory or the update
of reference memory. Reference memory update led to the reward-directed place
field shifts at newly rewarded arms and to the gradual strengthening of firing
in passes between newly rewarded arms but not between those passes that included
a familiar-rewarded arm. At the maze center, transient network synchronization
periods preferentially replayed trajectories of the next chosen arm in reference
memory tasks but the previously visited arm in the working memory task. Hence,
reference memory demand was uniquely associated with a gradual, goal novelty-related
reorganization of place cell assemblies and with trajectory replay that reflected
the animal's decision of which arm to visit next.
article_processing_charge: No
article_type: original
author:
- first_name: Haibing
full_name: Xu, Haibing
id: 310349D0-F248-11E8-B48F-1D18A9856A87
last_name: Xu
- first_name: Peter
full_name: Baracskay, Peter
id: 361CC00E-F248-11E8-B48F-1D18A9856A87
last_name: Baracskay
- first_name: Joseph
full_name: O'Neill, Joseph
id: 426376DC-F248-11E8-B48F-1D18A9856A87
last_name: O'Neill
- first_name: Jozsef L
full_name: Csicsvari, Jozsef L
id: 3FA14672-F248-11E8-B48F-1D18A9856A87
last_name: Csicsvari
orcid: 0000-0002-5193-4036
citation:
ama: Xu H, Baracskay P, O’Neill J, Csicsvari JL. Assembly responses of hippocampal
CA1 place cells predict learned behavior in goal-directed spatial tasks on the
radial eight-arm maze. Neuron. 2019;101(1):119-132.e4. doi:10.1016/j.neuron.2018.11.015
apa: Xu, H., Baracskay, P., O’Neill, J., & Csicsvari, J. L. (2019). Assembly
responses of hippocampal CA1 place cells predict learned behavior in goal-directed
spatial tasks on the radial eight-arm maze. Neuron. Elsevier. https://doi.org/10.1016/j.neuron.2018.11.015
chicago: Xu, Haibing, Peter Baracskay, Joseph O’Neill, and Jozsef L Csicsvari. “Assembly
Responses of Hippocampal CA1 Place Cells Predict Learned Behavior in Goal-Directed
Spatial Tasks on the Radial Eight-Arm Maze.” Neuron. Elsevier, 2019. https://doi.org/10.1016/j.neuron.2018.11.015.
ieee: H. Xu, P. Baracskay, J. O’Neill, and J. L. Csicsvari, “Assembly responses
of hippocampal CA1 place cells predict learned behavior in goal-directed spatial
tasks on the radial eight-arm maze,” Neuron, vol. 101, no. 1. Elsevier,
p. 119–132.e4, 2019.
ista: Xu H, Baracskay P, O’Neill J, Csicsvari JL. 2019. Assembly responses of hippocampal
CA1 place cells predict learned behavior in goal-directed spatial tasks on the
radial eight-arm maze. Neuron. 101(1), 119–132.e4.
mla: Xu, Haibing, et al. “Assembly Responses of Hippocampal CA1 Place Cells Predict
Learned Behavior in Goal-Directed Spatial Tasks on the Radial Eight-Arm Maze.”
Neuron, vol. 101, no. 1, Elsevier, 2019, p. 119–132.e4, doi:10.1016/j.neuron.2018.11.015.
short: H. Xu, P. Baracskay, J. O’Neill, J.L. Csicsvari, Neuron 101 (2019) 119–132.e4.
date_created: 2019-01-13T22:59:10Z
date_published: 2019-01-02T00:00:00Z
date_updated: 2026-06-18T18:56:25Z
day: '02'
ddc:
- '570'
department:
- _id: JoCs
doi: 10.1016/j.neuron.2018.11.015
ec_funded: 1
external_id:
isi:
- '000454791500014'
intvolume: ' 101'
isi: 1
issue: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://www.doi.org/10.1016/j.neuron.2018.11.015
month: '01'
oa: 1
oa_version: Published Version
page: 119-132.e4
project:
- _id: 257A4776-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '281511'
name: Memory-related information processing in neuronal circuits of the hippocampus
and entorhinal cortex
publication: Neuron
publication_identifier:
issn:
- 1097-4199
publication_status: published
publisher: Elsevier
quality_controlled: '1'
related_material:
link:
- description: News on IST Homepage
relation: press_release
url: https://ist.ac.at/en/news/reading-rats-minds/
record:
- id: '837'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: Assembly responses of hippocampal CA1 place cells predict learned behavior
in goal-directed spatial tasks on the radial eight-arm maze
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 101
year: '2019'
...
---
OA_place: publisher
OA_type: free access
_id: '5830'
abstract:
- lang: eng
text: CLE peptides have been implicated in various developmental processes of plants
and mediate their responses to environmental stimuli. However, the biological
relevance of most CLE genes remains to be functionally characterized. Here, we
report that CLE9, which is expressed in stomata, acts as an essential regulator
in the induction of stomatal closure. Exogenous application of CLE9 peptides or
overexpression of CLE9 effectively led to stomatal closure and enhanced drought
tolerance, whereas CLE9 loss-of-function mutants were sensitivity to drought stress.
CLE9-induced stomatal closure was impaired in abscisic acid (ABA)-deficient mutants,
indicating that ABA is required for CLE9-medaited guard cell signalling. We further
deciphered that two guard cell ABA-signalling components, OST1 and SLAC1, were
responsible for CLE9-induced stomatal closure. MPK3 and MPK6 were activated by
the CLE9 peptide, and CLE9 peptides failed to close stomata in mpk3 and mpk6 mutants.
In addition, CLE9 peptides stimulated the induction of hydrogen peroxide (H2O2)
and nitric oxide (NO) synthesis associated with stomatal closure, which was abolished
in the NADPH oxidase-deficient mutants or nitric reductase mutants, respectively.
Collectively, our results reveal a novel ABA-dependent function of CLE9 in the
regulation of stomatal apertures, thereby suggesting a potential role of CLE9
in the stress acclimatization of plants.
acknowledgement: We thank Drs. Juan Xu, Yongfeng Guo, and Annie Marion-Poll for sharing
materials. We are grateful to Profs. Xiaoping She for helpful discussion and Zhezhi
Wang for his generosity in providing laboratory facilities. The study is supported
by the National Natural Science Foundation of China (31771556, 31271575, and 31200902
to G. W.), by the 100-Talent Program of Shaanxi Province (to G. W.), by the Fundamental
Research Funds for the Central Universities (GK201702016 to G. W.; GK201603110 to
L. C.), partly by the open funds of the State Key Laboratory of Plant Physiology
and Biochemistry (SKLPPBKF1805), and by the Initial Project for Post-Graduates of
Hubei University of Medicine (2016QDJZR14 to Y. Z.).
article_processing_charge: No
article_type: original
author:
- first_name: Luosha
full_name: Zhang, Luosha
last_name: Zhang
- first_name: Xiong
full_name: Shi, Xiong
last_name: Shi
- first_name: Yutao
full_name: Zhang, Yutao
last_name: Zhang
- first_name: Jiajing
full_name: Wang, Jiajing
last_name: Wang
- first_name: Jingwei
full_name: Yang, Jingwei
last_name: Yang
- first_name: Takashi
full_name: Ishida, Takashi
last_name: Ishida
- first_name: Wenqian
full_name: Jiang, Wenqian
last_name: Jiang
- first_name: Xiangyu
full_name: Han, Xiangyu
last_name: Han
- first_name: Jingke
full_name: Kang, Jingke
last_name: Kang
- first_name: Xuening
full_name: Wang, Xuening
last_name: Wang
- first_name: Lixia
full_name: Pan, Lixia
last_name: Pan
- first_name: Shuo
full_name: Lv, Shuo
last_name: Lv
- first_name: Bing
full_name: Cao, Bing
last_name: Cao
- first_name: Yonghong
full_name: Zhang, Yonghong
last_name: Zhang
- first_name: Jinbin
full_name: Wu, Jinbin
last_name: Wu
- first_name: Huibin
full_name: Han, Huibin
id: 31435098-F248-11E8-B48F-1D18A9856A87
last_name: Han
- first_name: Zhubing
full_name: Hu, Zhubing
last_name: Hu
- first_name: Langjun
full_name: Cui, Langjun
last_name: Cui
- first_name: Shinichiro
full_name: Sawa, Shinichiro
last_name: Sawa
- first_name: Junmin
full_name: He, Junmin
last_name: He
- first_name: Guodong
full_name: Wang, Guodong
last_name: Wang
citation:
ama: Zhang L, Shi X, Zhang Y, et al. CLE9 peptide-induced stomatal closure is mediated
by abscisic acid, hydrogen peroxide, and nitric oxide in arabidopsis thaliana.
Plant Cell and Environment. 2019;42(3):1033-1044. doi:10.1111/pce.13475
apa: Zhang, L., Shi, X., Zhang, Y., Wang, J., Yang, J., Ishida, T., … Wang, G. (2019).
CLE9 peptide-induced stomatal closure is mediated by abscisic acid, hydrogen peroxide,
and nitric oxide in arabidopsis thaliana. Plant Cell and Environment. Wiley.
https://doi.org/10.1111/pce.13475
chicago: Zhang, Luosha, Xiong Shi, Yutao Zhang, Jiajing Wang, Jingwei Yang, Takashi
Ishida, Wenqian Jiang, et al. “CLE9 Peptide-Induced Stomatal Closure Is Mediated
by Abscisic Acid, Hydrogen Peroxide, and Nitric Oxide in Arabidopsis Thaliana.”
Plant Cell and Environment. Wiley, 2019. https://doi.org/10.1111/pce.13475.
ieee: L. Zhang et al., “CLE9 peptide-induced stomatal closure is mediated
by abscisic acid, hydrogen peroxide, and nitric oxide in arabidopsis thaliana,”
Plant Cell and Environment, vol. 42, no. 3. Wiley, pp. 1033–1044, 2019.
ista: Zhang L, Shi X, Zhang Y, Wang J, Yang J, Ishida T, Jiang W, Han X, Kang J,
Wang X, Pan L, Lv S, Cao B, Zhang Y, Wu J, Han H, Hu Z, Cui L, Sawa S, He J, Wang
G. 2019. CLE9 peptide-induced stomatal closure is mediated by abscisic acid, hydrogen
peroxide, and nitric oxide in arabidopsis thaliana. Plant Cell and Environment.
42(3), 1033–1044.
mla: Zhang, Luosha, et al. “CLE9 Peptide-Induced Stomatal Closure Is Mediated by
Abscisic Acid, Hydrogen Peroxide, and Nitric Oxide in Arabidopsis Thaliana.” Plant
Cell and Environment, vol. 42, no. 3, Wiley, 2019, pp. 1033–44, doi:10.1111/pce.13475.
short: L. Zhang, X. Shi, Y. Zhang, J. Wang, J. Yang, T. Ishida, W. Jiang, X. Han,
J. Kang, X. Wang, L. Pan, S. Lv, B. Cao, Y. Zhang, J. Wu, H. Han, Z. Hu, L. Cui,
S. Sawa, J. He, G. Wang, Plant Cell and Environment 42 (2019) 1033–1044.
date_created: 2019-01-13T22:59:11Z
date_published: 2019-03-01T00:00:00Z
date_updated: 2026-06-18T18:56:52Z
day: '01'
ddc:
- '580'
department:
- _id: JiFr
doi: 10.1111/pce.13475
external_id:
isi:
- '000459014800021'
pmid:
- '30378140'
intvolume: ' 42'
isi: 1
issue: '3'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://www.ncbi.nlm.nih.gov/pubmed/30378140
month: '03'
oa: 1
oa_version: Published Version
page: 1033-1044
pmid: 1
publication: Plant Cell and Environment
publication_identifier:
issn:
- 0140-7791
publication_status: published
publisher: Wiley
quality_controlled: '1'
scopus_import: '1'
status: public
title: CLE9 peptide-induced stomatal closure is mediated by abscisic acid, hydrogen
peroxide, and nitric oxide in arabidopsis thaliana
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 42
year: '2019'
...
---
_id: '5856'
abstract:
- lang: eng
text: We give a bound on the ground-state energy of a system of N non-interacting
fermions in a three-dimensional cubic box interacting with an impurity particle
via point interactions. We show that the change in energy compared to the system
in the absence of the impurity is bounded in terms of the gas density and the
scattering length of the interaction, independently of N. Our bound holds as long
as the ratio of the mass of the impurity to the one of the gas particles is larger
than a critical value m∗ ∗≈ 0.36 , which is the same regime for which we recently
showed stability of the system.
article_processing_charge: Yes (via OA deal)
article_type: original
arxiv: 1
author:
- first_name: Thomas
full_name: Moser, Thomas
id: 2B5FC9A4-F248-11E8-B48F-1D18A9856A87
last_name: Moser
- first_name: Robert
full_name: Seiringer, Robert
id: 4AFD0470-F248-11E8-B48F-1D18A9856A87
last_name: Seiringer
orcid: 0000-0002-6781-0521
citation:
ama: Moser T, Seiringer R. Energy contribution of a point-interacting impurity in
a Fermi gas. Annales Henri Poincare. 2019;20(4):1325–1365. doi:10.1007/s00023-018-00757-0
apa: Moser, T., & Seiringer, R. (2019). Energy contribution of a point-interacting
impurity in a Fermi gas. Annales Henri Poincare. Springer. https://doi.org/10.1007/s00023-018-00757-0
chicago: Moser, Thomas, and Robert Seiringer. “Energy Contribution of a Point-Interacting
Impurity in a Fermi Gas.” Annales Henri Poincare. Springer, 2019. https://doi.org/10.1007/s00023-018-00757-0.
ieee: T. Moser and R. Seiringer, “Energy contribution of a point-interacting impurity
in a Fermi gas,” Annales Henri Poincare, vol. 20, no. 4. Springer, pp.
1325–1365, 2019.
ista: Moser T, Seiringer R. 2019. Energy contribution of a point-interacting impurity
in a Fermi gas. Annales Henri Poincare. 20(4), 1325–1365.
mla: Moser, Thomas, and Robert Seiringer. “Energy Contribution of a Point-Interacting
Impurity in a Fermi Gas.” Annales Henri Poincare, vol. 20, no. 4, Springer,
2019, pp. 1325–1365, doi:10.1007/s00023-018-00757-0.
short: T. Moser, R. Seiringer, Annales Henri Poincare 20 (2019) 1325–1365.
date_created: 2019-01-20T22:59:17Z
date_published: 2019-04-01T00:00:00Z
date_updated: 2026-04-08T14:12:30Z
day: '01'
ddc:
- '530'
department:
- _id: RoSe
doi: 10.1007/s00023-018-00757-0
ec_funded: 1
external_id:
arxiv:
- '1807.00739'
isi:
- '000462444300008'
file:
- access_level: open_access
checksum: 255e42f957a8e2b10aad2499c750a8d6
content_type: application/pdf
creator: dernst
date_created: 2019-01-28T15:27:17Z
date_updated: 2020-07-14T12:47:12Z
file_id: '5894'
file_name: 2019_Annales_Moser.pdf
file_size: 859846
relation: main_file
file_date_updated: 2020-07-14T12:47:12Z
has_accepted_license: '1'
intvolume: ' 20'
isi: 1
issue: '4'
language:
- iso: eng
month: '04'
oa: 1
oa_version: Published Version
page: 1325–1365
project:
- _id: 25C6DC12-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '694227'
name: Analysis of quantum many-body systems
- _id: 25C878CE-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P27533_N27
name: Structure of the Excitation Spectrum for Many-Body Quantum Systems
- _id: B67AFEDC-15C9-11EA-A837-991A96BB2854
name: IST Austria Open Access Fund
publication: Annales Henri Poincare
publication_identifier:
issn:
- 1424-0637
publication_status: published
publisher: Springer
quality_controlled: '1'
related_material:
record:
- id: '52'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: Energy contribution of a point-interacting impurity in a Fermi gas
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 20
year: '2019'
...
---
_id: '5857'
abstract:
- lang: eng
text: 'A thrackle is a graph drawn in the plane so that every pair of its edges
meet exactly once: either at a common end vertex or in a proper crossing. We prove
that any thrackle of n vertices has at most 1.3984n edges. Quasi-thrackles are
defined similarly, except that every pair of edges that do not share a vertex
are allowed to cross an odd number of times. It is also shown that the maximum
number of edges of a quasi-thrackle on n vertices is [Formula presented](n−1),
and that this bound is best possible for infinitely many values of n.'
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Radoslav
full_name: Fulek, Radoslav
id: 39F3FFE4-F248-11E8-B48F-1D18A9856A87
last_name: Fulek
orcid: 0000-0001-8485-1774
- first_name: János
full_name: Pach, János
last_name: Pach
citation:
ama: 'Fulek R, Pach J. Thrackles: An improved upper bound. Discrete Applied Mathematics.
2019;259(4):266-231. doi:10.1016/j.dam.2018.12.025'
apa: 'Fulek, R., & Pach, J. (2019). Thrackles: An improved upper bound. Discrete
Applied Mathematics. Elsevier. https://doi.org/10.1016/j.dam.2018.12.025'
chicago: 'Fulek, Radoslav, and János Pach. “Thrackles: An Improved Upper Bound.”
Discrete Applied Mathematics. Elsevier, 2019. https://doi.org/10.1016/j.dam.2018.12.025.'
ieee: 'R. Fulek and J. Pach, “Thrackles: An improved upper bound,” Discrete Applied
Mathematics, vol. 259, no. 4. Elsevier, pp. 266–231, 2019.'
ista: 'Fulek R, Pach J. 2019. Thrackles: An improved upper bound. Discrete Applied
Mathematics. 259(4), 266–231.'
mla: 'Fulek, Radoslav, and János Pach. “Thrackles: An Improved Upper Bound.” Discrete
Applied Mathematics, vol. 259, no. 4, Elsevier, 2019, pp. 266–231, doi:10.1016/j.dam.2018.12.025.'
short: R. Fulek, J. Pach, Discrete Applied Mathematics 259 (2019) 266–231.
date_created: 2019-01-20T22:59:17Z
date_published: 2019-04-30T00:00:00Z
date_updated: 2026-04-16T09:48:11Z
day: '30'
department:
- _id: UlWa
doi: 10.1016/j.dam.2018.12.025
external_id:
arxiv:
- '1708.08037'
isi:
- '000466061100020'
intvolume: ' 259'
isi: 1
issue: '4'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1708.08037
month: '04'
oa: 1
oa_version: Preprint
page: 266-231
project:
- _id: 261FA626-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: M02281
name: Eliminating intersections in drawings of graphs
publication: Discrete Applied Mathematics
publication_identifier:
issn:
- 0166-218X
publication_status: published
publisher: Elsevier
quality_controlled: '1'
related_material:
record:
- id: '433'
relation: earlier_version
status: public
scopus_import: '1'
status: public
title: 'Thrackles: An improved upper bound'
type: journal_article
user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd
volume: 259
year: '2019'
...