---
_id: '14751'
abstract:
- lang: eng
text: 'We consider zero-error communication over a two-transmitter deterministic
adversarial multiple access channel (MAC) governed by an adversary who has access
to the transmissions of both senders (hence called omniscient ) and aims to maliciously
corrupt the communication. None of the encoders, jammer and decoder is allowed
to randomize using private or public randomness. This enforces a combinatorial
nature of the problem. Our model covers a large family of channels studied in
the literature, including all deterministic discrete memoryless noisy or noiseless
MACs. In this work, given an arbitrary two-transmitter deterministic omniscient
adversarial MAC, we characterize when the capacity region: 1) has nonempty interior
(in particular, is two-dimensional); 2) consists of two line segments (in particular,
has empty interior); 3) consists of one line segment (in particular, is one-dimensional);
4) or only contains (0,0) (in particular, is zero-dimensional). This extends a
recent result by Wang et al. (201 9) from the point-to-point setting to the multiple
access setting. Indeed, our converse arguments build upon their generalized Plotkin
bound and involve delicate case analysis. One of the technical challenges is to
take care of both “joint confusability” and “marginal confusability”. In particular,
the treatment of marginal confusability does not follow from the point-to-point
results by Wang et al. Our achievability results follow from random coding with
expurgation.'
acknowledgement: "The author would like to thank Amitalok J. Budkuley and Sidharth
Jaggi for many helpful discussions at the early stage of this work. He would also
like to thank Nir Ailon, Qi Cao, and Chandra Nair for discussions on a related problem
regarding zero-error binary adder MACs.\r\nThe work of Yihan Zhang was supported
by the European Union’s Horizon 2020 Research and Innovation Programme under Grant
682203-ERC-[Inf-Speed-Tradeoff]"
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Yihan
full_name: Zhang, Yihan
id: 2ce5da42-b2ea-11eb-bba5-9f264e9d002c
last_name: Zhang
orcid: 0000-0002-6465-6258
citation:
ama: Zhang Y. Zero-error communication over adversarial MACs. IEEE Transactions
on Information Theory. 2023;69(7):4093-4127. doi:10.1109/tit.2023.3257239
apa: Zhang, Y. (2023). Zero-error communication over adversarial MACs. IEEE Transactions
on Information Theory. Institute of Electrical and Electronics Engineers.
https://doi.org/10.1109/tit.2023.3257239
chicago: Zhang, Yihan. “Zero-Error Communication over Adversarial MACs.” IEEE
Transactions on Information Theory. Institute of Electrical and Electronics
Engineers, 2023. https://doi.org/10.1109/tit.2023.3257239.
ieee: Y. Zhang, “Zero-error communication over adversarial MACs,” IEEE Transactions
on Information Theory, vol. 69, no. 7. Institute of Electrical and Electronics
Engineers, pp. 4093–4127, 2023.
ista: Zhang Y. 2023. Zero-error communication over adversarial MACs. IEEE Transactions
on Information Theory. 69(7), 4093–4127.
mla: Zhang, Yihan. “Zero-Error Communication over Adversarial MACs.” IEEE Transactions
on Information Theory, vol. 69, no. 7, Institute of Electrical and Electronics
Engineers, 2023, pp. 4093–127, doi:10.1109/tit.2023.3257239.
short: Y. Zhang, IEEE Transactions on Information Theory 69 (2023) 4093–4127.
date_created: 2024-01-08T13:04:54Z
date_published: 2023-07-01T00:00:00Z
date_updated: 2024-01-09T08:45:24Z
day: '01'
department:
- _id: MaMo
doi: 10.1109/tit.2023.3257239
external_id:
arxiv:
- '2101.12426'
intvolume: ' 69'
issue: '7'
keyword:
- Computer Science Applications
- Information Systems
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.2101.12426
month: '07'
oa: 1
oa_version: Preprint
page: 4093-4127
publication: IEEE Transactions on Information Theory
publication_identifier:
eissn:
- 1557-9654
issn:
- 0018-9448
publication_status: published
publisher: Institute of Electrical and Electronics Engineers
quality_controlled: '1'
scopus_import: '1'
status: public
title: Zero-error communication over adversarial MACs
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 69
year: '2023'
...
---
_id: '14776'
abstract:
- lang: eng
text: Soluble chaperones residing in the endoplasmic reticulum (ER) play vitally
important roles in folding and quality control of newly synthesized proteins that
transiently pass through the ER en route to their final destinations. These soluble
residents of the ER are themselves endowed with an ER retrieval signal that enables
the cell to bring the escaped residents back from the Golgi. Here, by using purified
proteins, we showed that Nicotiana tabacum phytaspase, a plant aspartate-specific
protease, introduces two breaks at the C-terminus of the N. tabacum ER resident
calreticulin-3. These cleavages resulted in removal of either a dipeptide or a
hexapeptide from the C-terminus of calreticulin-3 encompassing part or all of
the ER retrieval signal. Consistently, expression of the calreticulin-3 derivative
mimicking the phytaspase cleavage product in Nicotiana benthamiana cells demonstrated
loss of the ER accumulation of the protein. Notably, upon its escape from the
ER, calreticulin-3 was further processed by an unknown protease(s) to generate
the free N-terminal (N) domain of calreticulin-3, which was ultimately secreted
into the apoplast. Our study thus identified a specific proteolytic enzyme capable
of precise detachment of the ER retrieval signal from a plant ER resident protein,
with implications for the further fate of the escaped resident.
acknowledgement: "We thank C.U.T. Hellen for critically reading the manuscript. The
MALDI MS facility and CLSM became available to us in the framework of Moscow State
University Development Programs PNG 5.13 and PNR 5.13.\r\nThis work was funded by
the Russian Science Foundation, grant numbers 19-14-00010 and 22-14-00071."
article_number: '16527'
article_processing_charge: Yes
article_type: original
author:
- first_name: Anastasiia
full_name: Teplova, Anastasiia
id: e3736151-106c-11ec-b916-c2558e2762c6
last_name: Teplova
- first_name: Artemii A.
full_name: Pigidanov, Artemii A.
last_name: Pigidanov
- first_name: Marina V.
full_name: Serebryakova, Marina V.
last_name: Serebryakova
- first_name: Sergei A.
full_name: Golyshev, Sergei A.
last_name: Golyshev
- first_name: Raisa A.
full_name: Galiullina, Raisa A.
last_name: Galiullina
- first_name: Nina V.
full_name: Chichkova, Nina V.
last_name: Chichkova
- first_name: Andrey B.
full_name: Vartapetian, Andrey B.
last_name: Vartapetian
citation:
ama: Teplova A, Pigidanov AA, Serebryakova MV, et al. Phytaspase Is capable of detaching
the endoplasmic reticulum retrieval signal from tobacco calreticulin-3. International
Journal of Molecular Sciences. 2023;24(22). doi:10.3390/ijms242216527
apa: Teplova, A., Pigidanov, A. A., Serebryakova, M. V., Golyshev, S. A., Galiullina,
R. A., Chichkova, N. V., & Vartapetian, A. B. (2023). Phytaspase Is capable
of detaching the endoplasmic reticulum retrieval signal from tobacco calreticulin-3.
International Journal of Molecular Sciences. MDPI. https://doi.org/10.3390/ijms242216527
chicago: Teplova, Anastasiia, Artemii A. Pigidanov, Marina V. Serebryakova, Sergei
A. Golyshev, Raisa A. Galiullina, Nina V. Chichkova, and Andrey B. Vartapetian.
“Phytaspase Is Capable of Detaching the Endoplasmic Reticulum Retrieval Signal
from Tobacco Calreticulin-3.” International Journal of Molecular Sciences.
MDPI, 2023. https://doi.org/10.3390/ijms242216527.
ieee: A. Teplova et al., “Phytaspase Is capable of detaching the endoplasmic
reticulum retrieval signal from tobacco calreticulin-3,” International Journal
of Molecular Sciences, vol. 24, no. 22. MDPI, 2023.
ista: Teplova A, Pigidanov AA, Serebryakova MV, Golyshev SA, Galiullina RA, Chichkova
NV, Vartapetian AB. 2023. Phytaspase Is capable of detaching the endoplasmic reticulum
retrieval signal from tobacco calreticulin-3. International Journal of Molecular
Sciences. 24(22), 16527.
mla: Teplova, Anastasiia, et al. “Phytaspase Is Capable of Detaching the Endoplasmic
Reticulum Retrieval Signal from Tobacco Calreticulin-3.” International Journal
of Molecular Sciences, vol. 24, no. 22, 16527, MDPI, 2023, doi:10.3390/ijms242216527.
short: A. Teplova, A.A. Pigidanov, M.V. Serebryakova, S.A. Golyshev, R.A. Galiullina,
N.V. Chichkova, A.B. Vartapetian, International Journal of Molecular Sciences
24 (2023).
date_created: 2024-01-10T09:24:35Z
date_published: 2023-11-01T00:00:00Z
date_updated: 2024-01-10T13:41:10Z
day: '01'
ddc:
- '580'
department:
- _id: JiFr
doi: 10.3390/ijms242216527
external_id:
isi:
- '001113792600001'
pmid:
- '38003717'
file:
- access_level: open_access
checksum: 4df7d206ba022b7f54eff1f0aec1659a
content_type: application/pdf
creator: dernst
date_created: 2024-01-10T13:39:42Z
date_updated: 2024-01-10T13:39:42Z
file_id: '14791'
file_name: 2023_IJMS_Teplova.pdf
file_size: 2637784
relation: main_file
success: 1
file_date_updated: 2024-01-10T13:39:42Z
has_accepted_license: '1'
intvolume: ' 24'
isi: 1
issue: '22'
keyword:
- Inorganic Chemistry
- Organic Chemistry
- Physical and Theoretical Chemistry
- Computer Science Applications
- Spectroscopy
- Molecular Biology
- General Medicine
- Catalysis
language:
- iso: eng
license: https://creativecommons.org/licenses/by/4.0/
month: '11'
oa: 1
oa_version: Published Version
pmid: 1
publication: International Journal of Molecular Sciences
publication_identifier:
issn:
- 1422-0067
publication_status: published
publisher: MDPI
quality_controlled: '1'
status: public
title: Phytaspase Is capable of detaching the endoplasmic reticulum retrieval signal
from tobacco calreticulin-3
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: 24
year: '2023'
...
---
_id: '14778'
abstract:
- lang: eng
text: 'We consider the almost-sure (a.s.) termination problem for probabilistic
programs, which are a stochastic extension of classical imperative programs. Lexicographic
ranking functions provide a sound and practical approach for termination of non-probabilistic
programs, and their extension to probabilistic programs is achieved via lexicographic
ranking supermartingales (LexRSMs). However, LexRSMs introduced in the previous
work have a limitation that impedes their automation: all of their components
have to be non-negative in all reachable states. This might result in a LexRSM
not existing even for simple terminating programs. Our contributions are twofold.
First, we introduce a generalization of LexRSMs that allows for some components
to be negative. This standard feature of non-probabilistic termination proofs
was hitherto not known to be sound in the probabilistic setting, as the soundness
proof requires a careful analysis of the underlying stochastic process. Second,
we present polynomial-time algorithms using our generalized LexRSMs for proving
a.s. termination in broad classes of linear-arithmetic programs.'
acknowledgement: This research was partially supported by the ERC CoG (grant no. 863818;
ForM-SMArt), the Czech Science Foundation (grant no. GA21-24711S), and the European
Union’s Horizon 2020 research and innovation program under the Marie Skłodowska-Curie
Grant Agreement No. 665385.
article_number: '11'
article_processing_charge: Yes (via OA deal)
article_type: original
arxiv: 1
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Ehsan
full_name: Kafshdar Goharshady, Ehsan
last_name: Kafshdar Goharshady
- first_name: Petr
full_name: Novotný, Petr
id: 3CC3B868-F248-11E8-B48F-1D18A9856A87
last_name: Novotný
- first_name: Jiří
full_name: Zárevúcky, Jiří
last_name: Zárevúcky
- first_name: Dorde
full_name: Zikelic, Dorde
id: 294AA7A6-F248-11E8-B48F-1D18A9856A87
last_name: Zikelic
orcid: 0000-0002-4681-1699
citation:
ama: Chatterjee K, Kafshdar Goharshady E, Novotný P, Zárevúcky J, Zikelic D. On
lexicographic proof rules for probabilistic termination. Formal Aspects of
Computing. 2023;35(2). doi:10.1145/3585391
apa: Chatterjee, K., Kafshdar Goharshady, E., Novotný, P., Zárevúcky, J., &
Zikelic, D. (2023). On lexicographic proof rules for probabilistic termination.
Formal Aspects of Computing. Association for Computing Machinery. https://doi.org/10.1145/3585391
chicago: Chatterjee, Krishnendu, Ehsan Kafshdar Goharshady, Petr Novotný, Jiří Zárevúcky,
and Dorde Zikelic. “On Lexicographic Proof Rules for Probabilistic Termination.”
Formal Aspects of Computing. Association for Computing Machinery, 2023.
https://doi.org/10.1145/3585391.
ieee: K. Chatterjee, E. Kafshdar Goharshady, P. Novotný, J. Zárevúcky, and D. Zikelic,
“On lexicographic proof rules for probabilistic termination,” Formal Aspects
of Computing, vol. 35, no. 2. Association for Computing Machinery, 2023.
ista: Chatterjee K, Kafshdar Goharshady E, Novotný P, Zárevúcky J, Zikelic D. 2023.
On lexicographic proof rules for probabilistic termination. Formal Aspects of
Computing. 35(2), 11.
mla: Chatterjee, Krishnendu, et al. “On Lexicographic Proof Rules for Probabilistic
Termination.” Formal Aspects of Computing, vol. 35, no. 2, 11, Association
for Computing Machinery, 2023, doi:10.1145/3585391.
short: K. Chatterjee, E. Kafshdar Goharshady, P. Novotný, J. Zárevúcky, D. Zikelic,
Formal Aspects of Computing 35 (2023).
date_created: 2024-01-10T09:27:43Z
date_published: 2023-06-23T00:00:00Z
date_updated: 2025-07-14T09:10:10Z
day: '23'
ddc:
- '000'
department:
- _id: KrCh
doi: 10.1145/3585391
ec_funded: 1
external_id:
arxiv:
- '2108.02188'
file:
- access_level: open_access
checksum: 3bb133eeb27ec01649a9a36445d952d9
content_type: application/pdf
creator: dernst
date_created: 2024-01-16T08:11:24Z
date_updated: 2024-01-16T08:11:24Z
file_id: '14804'
file_name: 2023_FormalAspectsComputing_Chatterjee.pdf
file_size: 502522
relation: main_file
success: 1
file_date_updated: 2024-01-16T08:11:24Z
has_accepted_license: '1'
intvolume: ' 35'
issue: '2'
keyword:
- Theoretical Computer Science
- Software
language:
- iso: eng
month: '06'
oa: 1
oa_version: Published Version
project:
- _id: 0599E47C-7A3F-11EA-A408-12923DDC885E
call_identifier: H2020
grant_number: '863818'
name: 'Formal Methods for Stochastic Models: Algorithms and Applications'
- _id: 2564DBCA-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '665385'
name: International IST Doctoral Program
publication: Formal Aspects of Computing
publication_identifier:
eissn:
- 1433-299X
issn:
- 0934-5043
publication_status: published
publisher: Association for Computing Machinery
quality_controlled: '1'
related_material:
record:
- id: '10414'
relation: earlier_version
status: public
status: public
title: On lexicographic proof rules for probabilistic termination
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: 35
year: '2023'
...
---
_id: '13988'
abstract:
- lang: eng
text: Most permissionless blockchains inherently suffer from throughput limitations.
Layer-2 systems, such as side-chains or Rollups, have been proposed as a possible
strategy to overcome this limitation. Layer-2 systems interact with the main-chain
in two ways. First, users can move funds from/to the main-chain to/from the layer-2.
Second, layer-2 systems periodically synchronize with the main-chain to keep some
form of log of their activity on the main-chain - this log is key for security.
Due to this interaction with the main-chain, which is necessary and recurrent,
layer-2 systems impose some load on the main-chain. The impact of such load on
the main-chain has been, so far, poorly understood. In addition to that, layer-2
approaches typically sacrifice decentralization and security in favor of higher
throughput. This paper presents an experimental study that analyzes the current
state of Ethereum layer-2 projects. Our goal is to assess the load they impose
on Ethereum and to understand their scalability potential in the long-run. Our
analysis shows that the impact of any given layer-2 on the main-chain is the result
of both technical aspects (how state is logged on the main-chain) and user behavior
(how often users decide to transfer funds between the layer-2 and the main-chain).
Based on our observations, we infer that without efficient mechanisms that allow
users to transfer funds in a secure and fast manner directly from one layer-2
project to another, current layer-2 systems will not be able to scale Ethereum
effectively, regardless of their technical solutions. Furthermore, from our results,
we conclude that the layer-2 systems that offer similar security guarantees as
Ethereum have limited scalability potential, while approaches that offer better
performance, sacrifice security and lead to an increase in centralization which
runs against the end-goals of permissionless blockchains.
acknowledgement: This work was supported in part by the Coordenação de Aperfeiçoamento
de Pessoal de Nivel Superior (CAPES)—Brazil (CAPES), in part by the Fundação para
a Ciência e Tecnologia (FCT) under Project UIDB/50021/2020 and Grant 2020.05270.BD,
in part by the Project COSMOS (via the Orçamento de Estado (OE) with ref. PTDC/EEI-COM/29271/2017
and via the ‘‘Programa Operacional Regional de Lisboa na sua componente Fundo Europeu
de Desenvolvimento Regional (FEDER)’’ with ref. Lisboa-01-0145-FEDER-029271), and
in part by the project Angainor with reference LISBOA-01-0145-FEDER-031456 as well
as supported by Meta Platforms for the project key Transparency at Scale.
article_processing_charge: Yes
article_type: original
author:
- first_name: Ray
full_name: Neiheiser, Ray
id: f09651b9-fec0-11ec-b5d8-934aff0e52a4
last_name: Neiheiser
orcid: 0000-0001-7227-8309
- first_name: Gustavo
full_name: Inacio, Gustavo
last_name: Inacio
- first_name: Luciana
full_name: Rech, Luciana
last_name: Rech
- first_name: Carlos
full_name: Montez, Carlos
last_name: Montez
- first_name: Miguel
full_name: Matos, Miguel
last_name: Matos
- first_name: Luis
full_name: Rodrigues, Luis
last_name: Rodrigues
citation:
ama: Neiheiser R, Inacio G, Rech L, Montez C, Matos M, Rodrigues L. Practical limitations
of Ethereum’s layer-2. IEEE Access. 2023;11:8651-8662. doi:10.1109/access.2023.3237897
apa: Neiheiser, R., Inacio, G., Rech, L., Montez, C., Matos, M., & Rodrigues,
L. (2023). Practical limitations of Ethereum’s layer-2. IEEE Access. Institute
of Electrical and Electronics Engineers. https://doi.org/10.1109/access.2023.3237897
chicago: Neiheiser, Ray, Gustavo Inacio, Luciana Rech, Carlos Montez, Miguel Matos,
and Luis Rodrigues. “Practical Limitations of Ethereum’s Layer-2.” IEEE Access.
Institute of Electrical and Electronics Engineers, 2023. https://doi.org/10.1109/access.2023.3237897.
ieee: R. Neiheiser, G. Inacio, L. Rech, C. Montez, M. Matos, and L. Rodrigues, “Practical
limitations of Ethereum’s layer-2,” IEEE Access, vol. 11. Institute of
Electrical and Electronics Engineers, pp. 8651–8662, 2023.
ista: Neiheiser R, Inacio G, Rech L, Montez C, Matos M, Rodrigues L. 2023. Practical
limitations of Ethereum’s layer-2. IEEE Access. 11, 8651–8662.
mla: Neiheiser, Ray, et al. “Practical Limitations of Ethereum’s Layer-2.” IEEE
Access, vol. 11, Institute of Electrical and Electronics Engineers, 2023,
pp. 8651–62, doi:10.1109/access.2023.3237897.
short: R. Neiheiser, G. Inacio, L. Rech, C. Montez, M. Matos, L. Rodrigues, IEEE
Access 11 (2023) 8651–8662.
date_created: 2023-08-09T12:09:57Z
date_published: 2023-08-01T00:00:00Z
date_updated: 2023-12-13T12:14:52Z
day: '01'
ddc:
- '000'
department:
- _id: ElKo
doi: 10.1109/access.2023.3237897
external_id:
isi:
- '000927831000001'
file:
- access_level: open_access
checksum: 4b80b0ff212edf7e5842fbdd53784432
content_type: application/pdf
creator: dernst
date_created: 2023-08-22T06:37:48Z
date_updated: 2023-08-22T06:37:48Z
file_id: '14166'
file_name: 2023_IEEEAccess_Neiheiser.pdf
file_size: 1289285
relation: main_file
success: 1
file_date_updated: 2023-08-22T06:37:48Z
has_accepted_license: '1'
intvolume: ' 11'
isi: 1
keyword:
- General Engineering
- General Materials Science
- General Computer Science
- Electrical and Electronic Engineering
language:
- iso: eng
month: '08'
oa: 1
oa_version: Published Version
page: 8651-8662
publication: IEEE Access
publication_identifier:
issn:
- 2169-3536
publication_status: published
publisher: Institute of Electrical and Electronics Engineers
quality_controlled: '1'
scopus_import: '1'
status: public
title: Practical limitations of Ethereum’s layer-2
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: 11
year: '2023'
...
---
_id: '12164'
abstract:
- lang: eng
text: 'A shared-memory counter is a widely-used and well-studied concurrent object.
It supports two operations: An Inc operation that increases its value by 1 and
a Read operation that returns its current value. In Jayanti et al (SIAM J Comput,
30(2), 2000), Jayanti, Tan and Toueg proved a linear lower bound on the worst-case
step complexity of obstruction-free implementations, from read-write registers,
of a large class of shared objects that includes counters. The lower bound leaves
open the question of finding counter implementations with sub-linear amortized
step complexity. In this work, we address this gap. We show that n-process, wait-free
and linearizable counters can be implemented from read-write registers with O(log2n)
amortized step complexity. This is the first counter algorithm from read-write
registers that provides sub-linear amortized step complexity in executions of
arbitrary length. Since a logarithmic lower bound on the amortized step complexity
of obstruction-free counter implementations exists, our upper bound is within
a logarithmic factor of the optimal. The worst-case step complexity of the construction
remains linear, which is optimal. This is obtained thanks to a new max register
construction with O(logn) amortized step complexity in executions of arbitrary
length in which the value stored in the register does not grow too quickly. We
then leverage an existing counter algorithm by Aspnes, Attiya and Censor-Hillel
[1] in which we “plug” our max register implementation to show that it remains
linearizable while achieving O(log2n) amortized step complexity.'
acknowledgement: A preliminary version of this work appeared in DISC’19. Mirza Ahad
Baig, Alessia Milani and Corentin Travers are supported by ANR projects Descartes
and FREDDA. Mirza Ahad Baig is supported by UMI Relax. Danny Hendler is supported
by the Israel Science Foundation (Grants 380/18 and 1425/22).
article_processing_charge: No
article_type: original
author:
- first_name: Mirza Ahad
full_name: Baig, Mirza Ahad
id: 3EDE6DE4-AA5A-11E9-986D-341CE6697425
last_name: Baig
- first_name: Danny
full_name: Hendler, Danny
last_name: Hendler
- first_name: Alessia
full_name: Milani, Alessia
last_name: Milani
- first_name: Corentin
full_name: Travers, Corentin
last_name: Travers
citation:
ama: Baig MA, Hendler D, Milani A, Travers C. Long-lived counters with polylogarithmic
amortized step complexity. Distributed Computing. 2023;36:29-43. doi:10.1007/s00446-022-00439-5
apa: Baig, M. A., Hendler, D., Milani, A., & Travers, C. (2023). Long-lived
counters with polylogarithmic amortized step complexity. Distributed Computing.
Springer Nature. https://doi.org/10.1007/s00446-022-00439-5
chicago: Baig, Mirza Ahad, Danny Hendler, Alessia Milani, and Corentin Travers.
“Long-Lived Counters with Polylogarithmic Amortized Step Complexity.” Distributed
Computing. Springer Nature, 2023. https://doi.org/10.1007/s00446-022-00439-5.
ieee: M. A. Baig, D. Hendler, A. Milani, and C. Travers, “Long-lived counters with
polylogarithmic amortized step complexity,” Distributed Computing, vol.
36. Springer Nature, pp. 29–43, 2023.
ista: Baig MA, Hendler D, Milani A, Travers C. 2023. Long-lived counters with polylogarithmic
amortized step complexity. Distributed Computing. 36, 29–43.
mla: Baig, Mirza Ahad, et al. “Long-Lived Counters with Polylogarithmic Amortized
Step Complexity.” Distributed Computing, vol. 36, Springer Nature, 2023,
pp. 29–43, doi:10.1007/s00446-022-00439-5.
short: M.A. Baig, D. Hendler, A. Milani, C. Travers, Distributed Computing 36 (2023)
29–43.
date_created: 2023-01-12T12:10:08Z
date_published: 2023-03-01T00:00:00Z
date_updated: 2023-08-16T08:39:36Z
day: '01'
department:
- _id: KrPi
doi: 10.1007/s00446-022-00439-5
external_id:
isi:
- '000890138700001'
intvolume: ' 36'
isi: 1
keyword:
- Computational Theory and Mathematics
- Computer Networks and Communications
- Hardware and Architecture
- Theoretical Computer Science
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://drops.dagstuhl.de/opus/volltexte/2019/11310/
month: '03'
oa: 1
oa_version: Preprint
page: 29-43
publication: Distributed Computing
publication_identifier:
eissn:
- 1432-0452
issn:
- 0178-2770
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Long-lived counters with polylogarithmic amortized step complexity
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 36
year: '2023'
...
---
_id: '12287'
abstract:
- lang: eng
text: We present criteria for establishing a triangulation of a manifold. Given
a manifold M, a simplicial complex A, and a map H from the underlying space of
A to M, our criteria are presented in local coordinate charts for M, and ensure
that H is a homeomorphism. These criteria do not require a differentiable structure,
or even an explicit metric on M. No Delaunay property of A is assumed. The result
provides a triangulation guarantee for algorithms that construct a simplicial
complex by working in local coordinate patches. Because the criteria are easily
verified in such a setting, they are expected to be of general use.
acknowledgement: "This work has been funded by the European Research Council under
the European Union’s ERC Grant Agreement number 339025 GUDHI (Algorithmic Foundations
of Geometric Understanding in Higher Dimensions). Arijit Ghosh is supported by Ramanujan
Fellowship (No. SB/S2/RJN-064/2015). Part of this work was done when Arijit Ghosh
was a Researcher at Max-Planck-Institute for Informatics, Germany, supported by
the IndoGerman Max Planck Center for Computer Science (IMPECS). Mathijs Wintraecken
also received funding from the European Union’s Horizon 2020 research and innovation
programme under the Marie Skłodowska-Curie grant agreement No. 754411 and the Austrian
Science Fund (FWF): M-3073. A part of the results described in this paper were presented
at SoCG 2018 and in [3]. \r\nOpen access funding provided by the Austrian Science
Fund (FWF)."
article_processing_charge: No
article_type: original
author:
- first_name: Jean-Daniel
full_name: Boissonnat, Jean-Daniel
last_name: Boissonnat
- first_name: Ramsay
full_name: Dyer, Ramsay
last_name: Dyer
- first_name: Arijit
full_name: Ghosh, Arijit
last_name: Ghosh
- first_name: Mathijs
full_name: Wintraecken, Mathijs
id: 307CFBC8-F248-11E8-B48F-1D18A9856A87
last_name: Wintraecken
orcid: 0000-0002-7472-2220
citation:
ama: Boissonnat J-D, Dyer R, Ghosh A, Wintraecken M. Local criteria for triangulating
general manifolds. Discrete & Computational Geometry. 2023;69:156-191.
doi:10.1007/s00454-022-00431-7
apa: Boissonnat, J.-D., Dyer, R., Ghosh, A., & Wintraecken, M. (2023). Local
criteria for triangulating general manifolds. Discrete & Computational
Geometry. Springer Nature. https://doi.org/10.1007/s00454-022-00431-7
chicago: Boissonnat, Jean-Daniel, Ramsay Dyer, Arijit Ghosh, and Mathijs Wintraecken.
“Local Criteria for Triangulating General Manifolds.” Discrete & Computational
Geometry. Springer Nature, 2023. https://doi.org/10.1007/s00454-022-00431-7.
ieee: J.-D. Boissonnat, R. Dyer, A. Ghosh, and M. Wintraecken, “Local criteria for
triangulating general manifolds,” Discrete & Computational Geometry,
vol. 69. Springer Nature, pp. 156–191, 2023.
ista: Boissonnat J-D, Dyer R, Ghosh A, Wintraecken M. 2023. Local criteria for triangulating
general manifolds. Discrete & Computational Geometry. 69, 156–191.
mla: Boissonnat, Jean-Daniel, et al. “Local Criteria for Triangulating General Manifolds.”
Discrete & Computational Geometry, vol. 69, Springer Nature, 2023,
pp. 156–91, doi:10.1007/s00454-022-00431-7.
short: J.-D. Boissonnat, R. Dyer, A. Ghosh, M. Wintraecken, Discrete & Computational
Geometry 69 (2023) 156–191.
date_created: 2023-01-16T10:04:06Z
date_published: 2023-01-01T00:00:00Z
date_updated: 2023-08-01T12:47:32Z
day: '01'
ddc:
- '510'
department:
- _id: HeEd
doi: 10.1007/s00454-022-00431-7
ec_funded: 1
external_id:
isi:
- '000862193600001'
file:
- access_level: open_access
checksum: 46352e0ee71e460848f88685ca852681
content_type: application/pdf
creator: dernst
date_created: 2023-02-02T11:01:10Z
date_updated: 2023-02-02T11:01:10Z
file_id: '12488'
file_name: 2023_DiscreteCompGeometry_Boissonnat.pdf
file_size: 582850
relation: main_file
success: 1
file_date_updated: 2023-02-02T11:01:10Z
has_accepted_license: '1'
intvolume: ' 69'
isi: 1
keyword:
- Computational Theory and Mathematics
- Discrete Mathematics and Combinatorics
- Geometry and Topology
- Theoretical Computer Science
language:
- iso: eng
month: '01'
oa: 1
oa_version: Published Version
page: 156-191
project:
- _id: 260C2330-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '754411'
name: ISTplus - Postdoctoral Fellowships
- _id: fc390959-9c52-11eb-aca3-afa58bd282b2
grant_number: M03073
name: Learning and triangulating manifolds via collapses
publication: Discrete & Computational Geometry
publication_identifier:
eissn:
- 1432-0444
issn:
- 0179-5376
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Local criteria for triangulating general 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: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 69
year: '2023'
...
---
_id: '12563'
abstract:
- lang: eng
text: 'he approximate graph coloring problem, whose complexity is unresolved in
most cases, concerns finding a c-coloring of a graph that is promised to be k-colorable,
where c≥k. This problem naturally generalizes to promise graph homomorphism problems
and further to promise constraint satisfaction problems. The complexity of these
problems has recently been studied through an algebraic approach. In this paper,
we introduce two new techniques to analyze the complexity of promise CSPs: one
is based on topology and the other on adjunction. We apply these techniques, together
with the previously introduced algebraic approach, to obtain new unconditional
NP-hardness results for a significant class of approximate graph coloring and
promise graph homomorphism problems.'
acknowledgement: "Andrei Krokhin and Jakub Opršal were supported by the UK EPSRC grant
EP/R034516/1. Jakub Opršal has received funding from the European Union’s Horizon
2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement
No 101034413. Stanislav Živný was supported by a Royal Society University Research
Fellowship. This project has received funding from the European Research Council
(ERC) under the European Union’s Horizon 2020 research and innovation programme
(grant agreement No 714532). The paper re\x1Eects only the authors’ views and not
the views of the ERC or the European Commission. "
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Andrei
full_name: Krokhin, Andrei
last_name: Krokhin
- first_name: Jakub
full_name: Opršal, Jakub
id: ec596741-c539-11ec-b829-c79322a91242
last_name: Opršal
orcid: 0000-0003-1245-3456
- first_name: Marcin
full_name: Wrochna, Marcin
last_name: Wrochna
- first_name: Stanislav
full_name: Živný, Stanislav
last_name: Živný
citation:
ama: Krokhin A, Opršal J, Wrochna M, Živný S. Topology and adjunction in promise
constraint satisfaction. SIAM Journal on Computing. 2023;52(1):38-79. doi:10.1137/20m1378223
apa: Krokhin, A., Opršal, J., Wrochna, M., & Živný, S. (2023). Topology and
adjunction in promise constraint satisfaction. SIAM Journal on Computing.
Society for Industrial & Applied Mathematics. https://doi.org/10.1137/20m1378223
chicago: Krokhin, Andrei, Jakub Opršal, Marcin Wrochna, and Stanislav Živný. “Topology
and Adjunction in Promise Constraint Satisfaction.” SIAM Journal on Computing.
Society for Industrial & Applied Mathematics, 2023. https://doi.org/10.1137/20m1378223.
ieee: A. Krokhin, J. Opršal, M. Wrochna, and S. Živný, “Topology and adjunction
in promise constraint satisfaction,” SIAM Journal on Computing, vol. 52,
no. 1. Society for Industrial & Applied Mathematics, pp. 38–79, 2023.
ista: Krokhin A, Opršal J, Wrochna M, Živný S. 2023. Topology and adjunction in
promise constraint satisfaction. SIAM Journal on Computing. 52(1), 38–79.
mla: Krokhin, Andrei, et al. “Topology and Adjunction in Promise Constraint Satisfaction.”
SIAM Journal on Computing, vol. 52, no. 1, Society for Industrial &
Applied Mathematics, 2023, pp. 38–79, doi:10.1137/20m1378223.
short: A. Krokhin, J. Opršal, M. Wrochna, S. Živný, SIAM Journal on Computing 52
(2023) 38–79.
date_created: 2023-02-16T07:03:52Z
date_published: 2023-01-01T00:00:00Z
date_updated: 2023-08-01T13:11:30Z
day: '01'
department:
- _id: UlWa
doi: 10.1137/20m1378223
ec_funded: 1
external_id:
arxiv:
- '2003.11351'
isi:
- '000955000000001'
intvolume: ' 52'
isi: 1
issue: '1'
keyword:
- General Mathematics
- General Computer Science
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.2003.11351
month: '01'
oa: 1
oa_version: Preprint
page: 38-79
project:
- _id: fc2ed2f7-9c52-11eb-aca3-c01059dda49c
call_identifier: H2020
grant_number: '101034413'
name: 'IST-BRIDGE: International postdoctoral program'
publication: SIAM Journal on Computing
publication_identifier:
eissn:
- 1095-7111
issn:
- 0097-5397
publication_status: published
publisher: Society for Industrial & Applied Mathematics
quality_controlled: '1'
scopus_import: '1'
status: public
title: Topology and adjunction in promise constraint satisfaction
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 52
year: '2023'
...
---
_id: '11556'
abstract:
- lang: eng
text: "We revisit two basic Direct Simulation Monte Carlo Methods to model aggregation
kinetics and extend them for aggregation processes with collisional fragmentation
(shattering). We test the performance and accuracy of the extended methods and
compare their performance with efficient deterministic finite-difference method
applied to the same model. We validate the stochastic methods on the test problems
and apply them to verify the existence of oscillating regimes in the aggregation-fragmentation
kinetics recently detected in deterministic simulations. We confirm the emergence
of steady oscillations of densities in such systems and prove the stability of
the\r\noscillations with respect to fluctuations and noise."
acknowledgement: Zhores supercomputer of Skolkovo Institute of Science and Technology
[68] has been used in the present research. S.A.M. was supported by Moscow Center
for Fundamental and Applied Mathematics (the agreement with the Ministry of Education
and Science of the Russian Federation No. 075-15-2019-1624). A.I.O. acknowledges
RFBR project No. 20-31-90022. N.V.B. acknowledges the support of the Analytical
Center (subsidy agreement 000000D730321P5Q0002, Grant No. 70-2021-00145 02.11.2021).
article_number: '111439'
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Aleksei
full_name: Kalinov, Aleksei
id: 44b7120e-eb97-11eb-a6c2-e1557aa81d02
last_name: Kalinov
orcid: 0000-0003-2189-3904
- first_name: A.I.
full_name: Osinskiy, A.I.
last_name: Osinskiy
- first_name: S.A.
full_name: Matveev, S.A.
last_name: Matveev
- first_name: W.
full_name: Otieno, W.
last_name: Otieno
- first_name: N.V.
full_name: Brilliantov, N.V.
last_name: Brilliantov
citation:
ama: Kalinov A, Osinskiy AI, Matveev SA, Otieno W, Brilliantov NV. Direct simulation
Monte Carlo for new regimes in aggregation-fragmentation kinetics. Journal
of Computational Physics. 2022;467. doi:10.1016/j.jcp.2022.111439
apa: Kalinov, A., Osinskiy, A. I., Matveev, S. A., Otieno, W., & Brilliantov,
N. V. (2022). Direct simulation Monte Carlo for new regimes in aggregation-fragmentation
kinetics. Journal of Computational Physics. Elsevier. https://doi.org/10.1016/j.jcp.2022.111439
chicago: Kalinov, Aleksei, A.I. Osinskiy, S.A. Matveev, W. Otieno, and N.V. Brilliantov.
“Direct Simulation Monte Carlo for New Regimes in Aggregation-Fragmentation Kinetics.”
Journal of Computational Physics. Elsevier, 2022. https://doi.org/10.1016/j.jcp.2022.111439.
ieee: A. Kalinov, A. I. Osinskiy, S. A. Matveev, W. Otieno, and N. V. Brilliantov,
“Direct simulation Monte Carlo for new regimes in aggregation-fragmentation kinetics,”
Journal of Computational Physics, vol. 467. Elsevier, 2022.
ista: Kalinov A, Osinskiy AI, Matveev SA, Otieno W, Brilliantov NV. 2022. Direct
simulation Monte Carlo for new regimes in aggregation-fragmentation kinetics.
Journal of Computational Physics. 467, 111439.
mla: Kalinov, Aleksei, et al. “Direct Simulation Monte Carlo for New Regimes in
Aggregation-Fragmentation Kinetics.” Journal of Computational Physics,
vol. 467, 111439, Elsevier, 2022, doi:10.1016/j.jcp.2022.111439.
short: A. Kalinov, A.I. Osinskiy, S.A. Matveev, W. Otieno, N.V. Brilliantov, Journal
of Computational Physics 467 (2022).
date_created: 2022-07-11T12:19:59Z
date_published: 2022-10-15T00:00:00Z
date_updated: 2023-08-03T11:55:06Z
day: '15'
ddc:
- '518'
department:
- _id: GradSch
- _id: ChWo
doi: 10.1016/j.jcp.2022.111439
external_id:
arxiv:
- '2103.09481'
isi:
- '000917225500013'
intvolume: ' 467'
isi: 1
keyword:
- Computer Science Applications
- Physics and Astronomy (miscellaneous)
- Applied Mathematics
- Computational Mathematics
- Modeling and Simulation
- Numerical Analysis
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.2103.09481
month: '10'
oa: 1
oa_version: Preprint
publication: Journal of Computational Physics
publication_identifier:
issn:
- 0021-9991
publication_status: published
publisher: Elsevier
quality_controlled: '1'
status: public
title: Direct simulation Monte Carlo for new regimes in aggregation-fragmentation
kinetics
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 467
year: '2022'
...
---
_id: '9311'
abstract:
- lang: eng
text: 'Partially observable Markov decision processes (POMDPs) are standard models
for dynamic systems with probabilistic and nondeterministic behaviour in uncertain
environments. We prove that in POMDPs with long-run average objective, the decision
maker has approximately optimal strategies with finite memory. This implies notably
that approximating the long-run value is recursively enumerable, as well as a
weak continuity property of the value with respect to the transition function. '
acknowledgement: "Partially supported by Austrian Science Fund (FWF) NFN Grant No
RiSE/SHiNE S11407, by CONICYT Chile through grant PII 20150140, and by ECOS-CONICYT
through grant C15E03.\r\n"
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Raimundo J
full_name: Saona Urmeneta, Raimundo J
id: BD1DF4C4-D767-11E9-B658-BC13E6697425
last_name: Saona Urmeneta
orcid: 0000-0001-5103-038X
- first_name: Bruno
full_name: Ziliotto, Bruno
last_name: Ziliotto
citation:
ama: Chatterjee K, Saona Urmeneta RJ, Ziliotto B. Finite-memory strategies in POMDPs
with long-run average objectives. Mathematics of Operations Research. 2022;47(1):100-119.
doi:10.1287/moor.2020.1116
apa: Chatterjee, K., Saona Urmeneta, R. J., & Ziliotto, B. (2022). Finite-memory
strategies in POMDPs with long-run average objectives. Mathematics of Operations
Research. Institute for Operations Research and the Management Sciences. https://doi.org/10.1287/moor.2020.1116
chicago: Chatterjee, Krishnendu, Raimundo J Saona Urmeneta, and Bruno Ziliotto.
“Finite-Memory Strategies in POMDPs with Long-Run Average Objectives.” Mathematics
of Operations Research. Institute for Operations Research and the Management
Sciences, 2022. https://doi.org/10.1287/moor.2020.1116.
ieee: K. Chatterjee, R. J. Saona Urmeneta, and B. Ziliotto, “Finite-memory strategies
in POMDPs with long-run average objectives,” Mathematics of Operations Research,
vol. 47, no. 1. Institute for Operations Research and the Management Sciences,
pp. 100–119, 2022.
ista: Chatterjee K, Saona Urmeneta RJ, Ziliotto B. 2022. Finite-memory strategies
in POMDPs with long-run average objectives. Mathematics of Operations Research.
47(1), 100–119.
mla: Chatterjee, Krishnendu, et al. “Finite-Memory Strategies in POMDPs with Long-Run
Average Objectives.” Mathematics of Operations Research, vol. 47, no. 1,
Institute for Operations Research and the Management Sciences, 2022, pp. 100–19,
doi:10.1287/moor.2020.1116.
short: K. Chatterjee, R.J. Saona Urmeneta, B. Ziliotto, Mathematics of Operations
Research 47 (2022) 100–119.
date_created: 2021-04-08T09:33:31Z
date_published: 2022-02-01T00:00:00Z
date_updated: 2023-09-05T13:16:11Z
day: '01'
department:
- _id: GradSch
- _id: KrCh
doi: 10.1287/moor.2020.1116
external_id:
arxiv:
- '1904.13360'
isi:
- '000731918100001'
intvolume: ' 47'
isi: 1
issue: '1'
keyword:
- Management Science and Operations Research
- General Mathematics
- Computer Science Applications
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1904.13360
month: '02'
oa: 1
oa_version: Preprint
page: 100-119
project:
- _id: 25863FF4-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11407
name: Game Theory
publication: Mathematics of Operations Research
publication_identifier:
eissn:
- 1526-5471
issn:
- 0364-765X
publication_status: published
publisher: Institute for Operations Research and the Management Sciences
quality_controlled: '1'
scopus_import: '1'
status: public
title: Finite-memory strategies in POMDPs with long-run average objectives
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 47
year: '2022'
...
---
_id: '10208'
abstract:
- lang: eng
text: It is practical to collect a huge amount of movement data and environmental
context information along with the health signals of individuals because there
is the emergence of new generations of positioning and tracking technologies and
rapid advancements of health sensors. The study of the relations between these
datasets and their sequence similarity analysis is of interest to many applications
such as health monitoring and recommender systems. However, entering all movement
parameters and health signals can lead to the complexity of the problem and an
increase in its computational load. In this situation, dimension reduction techniques
can be used to avoid consideration of simultaneous dependent parameters in the
process of similarity measurement of the trajectories. The present study provides
a framework, named CaDRAW, to use spatial–temporal data and movement parameters
along with independent context information in the process of measuring the similarity
of trajectories. In this regard, the omission of dependent movement characteristic
signals is conducted by using an unsupervised feature selection dimension reduction
technique. To evaluate the effectiveness of the proposed framework, it was applied
to a real contextualized movement and related health signal datasets of individuals.
The results indicated the capability of the proposed framework in measuring the
similarity and in decreasing the characteristic signals in such a way that the
similarity results -before and after reduction of dependent characteristic signals-
have small differences. The mean differences between the obtained results before
and after reducing the dimension were 0.029 and 0.023 for the round path, respectively.
acknowledgement: The third author acknowledges the funding received from the Wittgenstein
Prize, Austrian Science Fund (FWF), grant no. Z 342-N31.
article_processing_charge: No
article_type: original
author:
- first_name: Samira
full_name: Goudarzi, Samira
last_name: Goudarzi
- first_name: Mohammad
full_name: Sharif, Mohammad
last_name: Sharif
- first_name: Farid
full_name: Karimipour, Farid
id: 2A2BCDC4-CF62-11E9-BE5E-3B1EE6697425
last_name: Karimipour
orcid: 0000-0001-6746-4174
citation:
ama: Goudarzi S, Sharif M, Karimipour F. A context-aware dimension reduction framework
for trajectory and health signal analyses. Journal of Ambient Intelligence
and Humanized Computing. 2022;13:2621–2635. doi:10.1007/s12652-021-03569-z
apa: Goudarzi, S., Sharif, M., & Karimipour, F. (2022). A context-aware dimension
reduction framework for trajectory and health signal analyses. Journal of Ambient
Intelligence and Humanized Computing. Springer Nature. https://doi.org/10.1007/s12652-021-03569-z
chicago: Goudarzi, Samira, Mohammad Sharif, and Farid Karimipour. “A Context-Aware
Dimension Reduction Framework for Trajectory and Health Signal Analyses.” Journal
of Ambient Intelligence and Humanized Computing. Springer Nature, 2022. https://doi.org/10.1007/s12652-021-03569-z.
ieee: S. Goudarzi, M. Sharif, and F. Karimipour, “A context-aware dimension reduction
framework for trajectory and health signal analyses,” Journal of Ambient Intelligence
and Humanized Computing, vol. 13. Springer Nature, pp. 2621–2635, 2022.
ista: Goudarzi S, Sharif M, Karimipour F. 2022. A context-aware dimension reduction
framework for trajectory and health signal analyses. Journal of Ambient Intelligence
and Humanized Computing. 13, 2621–2635.
mla: Goudarzi, Samira, et al. “A Context-Aware Dimension Reduction Framework for
Trajectory and Health Signal Analyses.” Journal of Ambient Intelligence and
Humanized Computing, vol. 13, Springer Nature, 2022, pp. 2621–2635, doi:10.1007/s12652-021-03569-z.
short: S. Goudarzi, M. Sharif, F. Karimipour, Journal of Ambient Intelligence and
Humanized Computing 13 (2022) 2621–2635.
date_created: 2021-11-02T09:28:55Z
date_published: 2022-05-01T00:00:00Z
date_updated: 2023-08-02T13:31:48Z
day: '01'
ddc:
- '000'
department:
- _id: HeEd
doi: 10.1007/s12652-021-03569-z
external_id:
isi:
- '000712198000001'
file:
- access_level: open_access
checksum: 0a8961416a9bb2be5a1cebda65468bcf
content_type: application/pdf
creator: fkarimip
date_created: 2021-11-12T19:38:05Z
date_updated: 2022-12-20T23:30:08Z
embargo: 2022-11-12
file_id: '10279'
file_name: A Context‑aware Dimension Reduction Framework - Journal of Ambient Intelligence
2021 (Preprint version).pdf
file_size: 1634958
relation: main_file
file_date_updated: 2022-12-20T23:30:08Z
has_accepted_license: '1'
intvolume: ' 13'
isi: 1
keyword:
- general computer science
language:
- iso: eng
month: '05'
oa: 1
oa_version: Submitted Version
page: 2621–2635
project:
- _id: 268116B8-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z00342
name: The Wittgenstein Prize
publication: Journal of Ambient Intelligence and Humanized Computing
publication_identifier:
eissn:
- 1868-5145
issn:
- 1868-5137
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: A context-aware dimension reduction framework for trajectory and health signal
analyses
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 13
year: '2022'
...
---
_id: '10643'
abstract:
- lang: eng
text: "We prove a generalised super-adiabatic theorem for extended fermionic systems
assuming a spectral gap only in the bulk. More precisely, we assume that the infinite
system has a unique ground state and that the corresponding Gelfand–Naimark–Segal
Hamiltonian has a spectral gap above its eigenvalue zero. Moreover, we show that
a similar adiabatic theorem also holds in the bulk of finite systems up to errors
that vanish faster than any inverse power of the system size, although the corresponding
finite-volume Hamiltonians need not have a spectral gap.\r\n\r\n"
acknowledgement: J.H. acknowledges partial financial support by the ERC Advanced Grant
‘RMTBeyond’ No. 101020331. Support for publication costs from the Deutsche Forschungsgemeinschaft
and the Open Access Publishing Fund of the University of Tübingen is gratefully
acknowledged.
article_number: e4
article_processing_charge: Yes
article_type: original
arxiv: 1
author:
- first_name: Sven Joscha
full_name: Henheik, Sven Joscha
id: 31d731d7-d235-11ea-ad11-b50331c8d7fb
last_name: Henheik
orcid: 0000-0003-1106-327X
- first_name: Stefan
full_name: Teufel, Stefan
last_name: Teufel
citation:
ama: 'Henheik SJ, Teufel S. Adiabatic theorem in the thermodynamic limit: Systems
with a gap in the bulk. Forum of Mathematics, Sigma. 2022;10. doi:10.1017/fms.2021.80'
apa: 'Henheik, S. J., & Teufel, S. (2022). Adiabatic theorem in the thermodynamic
limit: Systems with a gap in the bulk. Forum of Mathematics, Sigma. Cambridge
University Press. https://doi.org/10.1017/fms.2021.80'
chicago: 'Henheik, Sven Joscha, and Stefan Teufel. “Adiabatic Theorem in the Thermodynamic
Limit: Systems with a Gap in the Bulk.” Forum of Mathematics, Sigma. Cambridge
University Press, 2022. https://doi.org/10.1017/fms.2021.80.'
ieee: 'S. J. Henheik and S. Teufel, “Adiabatic theorem in the thermodynamic limit:
Systems with a gap in the bulk,” Forum of Mathematics, Sigma, vol. 10.
Cambridge University Press, 2022.'
ista: 'Henheik SJ, Teufel S. 2022. Adiabatic theorem in the thermodynamic limit:
Systems with a gap in the bulk. Forum of Mathematics, Sigma. 10, e4.'
mla: 'Henheik, Sven Joscha, and Stefan Teufel. “Adiabatic Theorem in the Thermodynamic
Limit: Systems with a Gap in the Bulk.” Forum of Mathematics, Sigma, vol.
10, e4, Cambridge University Press, 2022, doi:10.1017/fms.2021.80.'
short: S.J. Henheik, S. Teufel, Forum of Mathematics, Sigma 10 (2022).
date_created: 2022-01-18T16:18:51Z
date_published: 2022-01-18T00:00:00Z
date_updated: 2023-08-02T13:53:11Z
day: '18'
ddc:
- '510'
department:
- _id: GradSch
- _id: LaEr
doi: 10.1017/fms.2021.80
ec_funded: 1
external_id:
arxiv:
- '2012.15239'
isi:
- '000743615000001'
file:
- access_level: open_access
checksum: 87592a755adcef22ea590a99dc728dd3
content_type: application/pdf
creator: cchlebak
date_created: 2022-01-19T09:27:43Z
date_updated: 2022-01-19T09:27:43Z
file_id: '10646'
file_name: 2022_ForumMathSigma_Henheik.pdf
file_size: 705323
relation: main_file
success: 1
file_date_updated: 2022-01-19T09:27:43Z
has_accepted_license: '1'
intvolume: ' 10'
isi: 1
keyword:
- computational mathematics
- discrete mathematics and combinatorics
- geometry and topology
- mathematical physics
- statistics and probability
- algebra and number theory
- theoretical computer science
- analysis
language:
- iso: eng
month: '01'
oa: 1
oa_version: Published Version
project:
- _id: 62796744-2b32-11ec-9570-940b20777f1d
call_identifier: H2020
grant_number: '101020331'
name: Random matrices beyond Wigner-Dyson-Mehta
publication: Forum of Mathematics, Sigma
publication_identifier:
eissn:
- 2050-5094
publication_status: published
publisher: Cambridge University Press
quality_controlled: '1'
status: public
title: 'Adiabatic theorem in the thermodynamic limit: Systems with a gap in the bulk'
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: 10
year: '2022'
...
---
_id: '12129'
abstract:
- lang: eng
text: 'Given a finite point set P in general position in the plane, a full triangulation
of P is a maximal straight-line embedded plane graph on P. A partial triangulation
of P is a full triangulation of some subset P′ of P containing all extreme points
in P. A bistellar flip on a partial triangulation either flips an edge (called
edge flip), removes a non-extreme point of degree 3, or adds a point in P∖P′ as
vertex of degree 3. The bistellar flip graph has all partial triangulations as
vertices, and a pair of partial triangulations is adjacent if they can be obtained
from one another by a bistellar flip. The edge flip graph is defined with full
triangulations as vertices, and edge flips determining the adjacencies. Lawson
showed in the early seventies that these graphs are connected. The goal of this
paper is to investigate the structure of these graphs, with emphasis on their
vertex connectivity. For sets P of n points in the plane in general position,
we show that the edge flip graph is ⌈n/2−2⌉-vertex connected, and the bistellar
flip graph is (n−3)-vertex connected; both results are tight. The latter bound
matches the situation for the subfamily of regular triangulations (i.e., partial
triangulations obtained by lifting the points to 3-space and projecting back the
lower convex hull), where (n−3)-vertex connectivity has been known since the late
eighties through the secondary polytope due to Gelfand, Kapranov, & Zelevinsky
and Balinski’s Theorem. For the edge flip-graph, we additionally show that the
vertex connectivity is at least as large as (and hence equal to) the minimum degree
(i.e., the minimum number of flippable edges in any full triangulation), provided
that n is large enough. Our methods also yield several other results: (i) The
edge flip graph can be covered by graphs of polytopes of dimension ⌈n/2−2⌉ (products
of associahedra) and the bistellar flip graph can be covered by graphs of polytopes
of dimension n−3 (products of secondary polytopes). (ii) A partial triangulation
is regular, if it has distance n−3 in the Hasse diagram of the partial order of
partial subdivisions from the trivial subdivision. (iii) All partial triangulations
of a point set are regular iff the partial order of partial subdivisions has height
n−3. (iv) There are arbitrarily large sets P with non-regular partial triangulations
and such that every proper subset has only regular triangulations, i.e., there
are no small certificates for the existence of non-regular triangulations.'
acknowledgement: "This is a full and revised version of [38] (on partial triangulations)
in Proceedings of the 36th Annual International Symposium on Computational Geometry
(SoCG‘20) and of some of the results in [37] (on full triangulations) in Proceedings
of the 31st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA‘20).\r\nThis
research started at the 11th Gremo’s Workshop on Open Problems (GWOP), Alp Sellamatt,
Switzerland, June 24–28, 2013, motivated by a question posed by Filip Mori´c on
full triangulations. Research was supported by the Swiss National Science Foundation
within the collaborative DACH project Arrangements and Drawings as SNSF Project
200021E-171681, and by IST Austria and Berlin Free University during a sabbatical
stay of the second author. We thank Michael Joswig, Jesús De Loera, and Francisco
Santos for helpful discussions on the topics of this paper, and Daniel Bertschinger
and Valentin Stoppiello for carefully reading earlier versions and for many helpful
comments.\r\nOpen access funding provided by the Swiss Federal Institute of Technology
Zürich"
article_processing_charge: No
article_type: original
author:
- first_name: Uli
full_name: Wagner, Uli
id: 36690CA2-F248-11E8-B48F-1D18A9856A87
last_name: Wagner
orcid: 0000-0002-1494-0568
- first_name: Emo
full_name: Welzl, Emo
last_name: Welzl
citation:
ama: Wagner U, Welzl E. Connectivity of triangulation flip graphs in the plane.
Discrete & Computational Geometry. 2022;68(4):1227-1284. doi:10.1007/s00454-022-00436-2
apa: Wagner, U., & Welzl, E. (2022). Connectivity of triangulation flip graphs
in the plane. Discrete & Computational Geometry. Springer Nature. https://doi.org/10.1007/s00454-022-00436-2
chicago: Wagner, Uli, and Emo Welzl. “Connectivity of Triangulation Flip Graphs
in the Plane.” Discrete & Computational Geometry. Springer Nature,
2022. https://doi.org/10.1007/s00454-022-00436-2.
ieee: U. Wagner and E. Welzl, “Connectivity of triangulation flip graphs in the
plane,” Discrete & Computational Geometry, vol. 68, no. 4. Springer
Nature, pp. 1227–1284, 2022.
ista: Wagner U, Welzl E. 2022. Connectivity of triangulation flip graphs in the
plane. Discrete & Computational Geometry. 68(4), 1227–1284.
mla: Wagner, Uli, and Emo Welzl. “Connectivity of Triangulation Flip Graphs in the
Plane.” Discrete & Computational Geometry, vol. 68, no. 4, Springer
Nature, 2022, pp. 1227–84, doi:10.1007/s00454-022-00436-2.
short: U. Wagner, E. Welzl, Discrete & Computational Geometry 68 (2022) 1227–1284.
date_created: 2023-01-12T12:02:28Z
date_published: 2022-11-14T00:00:00Z
date_updated: 2023-08-04T08:51:08Z
day: '14'
ddc:
- '510'
department:
- _id: UlWa
doi: 10.1007/s00454-022-00436-2
external_id:
isi:
- '000883222200003'
file:
- access_level: open_access
checksum: 307e879d09e52eddf5b225d0aaa9213a
content_type: application/pdf
creator: dernst
date_created: 2023-01-23T11:10:03Z
date_updated: 2023-01-23T11:10:03Z
file_id: '12345'
file_name: 2022_DiscreteCompGeometry_Wagner.pdf
file_size: 1747581
relation: main_file
success: 1
file_date_updated: 2023-01-23T11:10:03Z
has_accepted_license: '1'
intvolume: ' 68'
isi: 1
issue: '4'
keyword:
- Computational Theory and Mathematics
- Discrete Mathematics and Combinatorics
- Geometry and Topology
- Theoretical Computer Science
language:
- iso: eng
month: '11'
oa: 1
oa_version: Published Version
page: 1227-1284
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: '7807'
relation: earlier_version
status: public
- id: '7990'
relation: earlier_version
status: public
scopus_import: '1'
status: public
title: Connectivity of triangulation flip graphs in the plane
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: 68
year: '2022'
...
---
_id: '12134'
abstract:
- lang: eng
text: Standard epidemic models exhibit one continuous, second order phase transition
to macroscopic outbreaks. However, interventions to control outbreaks may fundamentally
alter epidemic dynamics. Here we reveal how such interventions modify the type
of phase transition. In particular, we uncover three distinct types of explosive
phase transitions for epidemic dynamics with capacity-limited interventions. Depending
on the capacity limit, interventions may (i) leave the standard second order phase
transition unchanged but exponentially suppress the probability of large outbreaks,
(ii) induce a first-order discontinuous transition to macroscopic outbreaks, or
(iii) cause a secondary explosive yet continuous third-order transition. These
insights highlight inherent limitations in predicting and containing epidemic
outbreaks. More generally our study offers a cornerstone example of a third-order
explosive phase transition in complex systems.
acknowledgement: We acknowledge support from the Volkswagen Foundation under Grant
No. 99720 and the German Federal Ministry for Education and Research (BMBF) under
Grant No. 16ICR01. This research was supported by the Deutsche Forschungsgemeinschaft
(DFG, German Research Foundation) under Germany’s Excellence Strategy—EXC-2068—390729961—Cluster
of Excellence Physics of Life of TU Dresden.
article_number: 04LT02
article_processing_charge: No
article_type: original
author:
- first_name: Georg
full_name: Börner, Georg
last_name: Börner
- first_name: Malte
full_name: Schröder, Malte
last_name: Schröder
- first_name: Davide
full_name: Scarselli, Davide
id: 40315C30-F248-11E8-B48F-1D18A9856A87
last_name: Scarselli
orcid: 0000-0001-5227-4271
- 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: Björn
full_name: Hof, Björn
id: 3A374330-F248-11E8-B48F-1D18A9856A87
last_name: Hof
orcid: 0000-0003-2057-2754
- first_name: Marc
full_name: Timme, Marc
last_name: Timme
citation:
ama: 'Börner G, Schröder M, Scarselli D, Budanur NB, Hof B, Timme M. Explosive transitions
in epidemic dynamics. Journal of Physics: Complexity. 2022;3(4). doi:10.1088/2632-072x/ac99cd'
apa: 'Börner, G., Schröder, M., Scarselli, D., Budanur, N. B., Hof, B., & Timme,
M. (2022). Explosive transitions in epidemic dynamics. Journal of Physics:
Complexity. IOP Publishing. https://doi.org/10.1088/2632-072x/ac99cd'
chicago: 'Börner, Georg, Malte Schröder, Davide Scarselli, Nazmi B Budanur, Björn
Hof, and Marc Timme. “Explosive Transitions in Epidemic Dynamics.” Journal
of Physics: Complexity. IOP Publishing, 2022. https://doi.org/10.1088/2632-072x/ac99cd.'
ieee: 'G. Börner, M. Schröder, D. Scarselli, N. B. Budanur, B. Hof, and M. Timme,
“Explosive transitions in epidemic dynamics,” Journal of Physics: Complexity,
vol. 3, no. 4. IOP Publishing, 2022.'
ista: 'Börner G, Schröder M, Scarselli D, Budanur NB, Hof B, Timme M. 2022. Explosive
transitions in epidemic dynamics. Journal of Physics: Complexity. 3(4), 04LT02.'
mla: 'Börner, Georg, et al. “Explosive Transitions in Epidemic Dynamics.” Journal
of Physics: Complexity, vol. 3, no. 4, 04LT02, IOP Publishing, 2022, doi:10.1088/2632-072x/ac99cd.'
short: 'G. Börner, M. Schröder, D. Scarselli, N.B. Budanur, B. Hof, M. Timme, Journal
of Physics: Complexity 3 (2022).'
date_created: 2023-01-12T12:03:43Z
date_published: 2022-10-25T00:00:00Z
date_updated: 2023-02-13T09:15:13Z
day: '25'
ddc:
- '530'
department:
- _id: BjHo
doi: 10.1088/2632-072x/ac99cd
file:
- access_level: open_access
checksum: 35c5c5cb0eb17ea1b5184755daab9fc9
content_type: application/pdf
creator: dernst
date_created: 2023-01-24T07:24:37Z
date_updated: 2023-01-24T07:24:37Z
file_id: '12350'
file_name: 2022_JourPhysics_Boerner.pdf
file_size: 1006106
relation: main_file
success: 1
file_date_updated: 2023-01-24T07:24:37Z
has_accepted_license: '1'
intvolume: ' 3'
issue: '4'
keyword:
- Artificial Intelligence
- Computer Networks and Communications
- Computer Science Applications
- Information Systems
language:
- iso: eng
month: '10'
oa: 1
oa_version: Published Version
publication: 'Journal of Physics: Complexity'
publication_identifier:
issn:
- 2632-072X
publication_status: published
publisher: IOP Publishing
quality_controlled: '1'
scopus_import: '1'
status: public
title: Explosive transitions in epidemic dynamics
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: 3
year: '2022'
...
---
_id: '12148'
abstract:
- lang: eng
text: 'We prove a general local law for Wigner matrices that optimally handles observables
of arbitrary rank and thus unifies the well-known averaged and isotropic local
laws. As an application, we prove a central limit theorem in quantum unique ergodicity
(QUE): that is, we show that the quadratic forms of a general deterministic matrix
A on the bulk eigenvectors of a Wigner matrix have approximately Gaussian fluctuation.
For the bulk spectrum, we thus generalise our previous result [17] as valid for
test matrices A of large rank as well as the result of Benigni and Lopatto [7]
as valid for specific small-rank observables.'
acknowledgement: L.E. acknowledges support by ERC Advanced Grant ‘RMTBeyond’ No. 101020331.
D.S. acknowledges the support of Dr. Max Rössler, the Walter Haefner Foundation
and the ETH Zürich Foundation.
article_number: e96
article_processing_charge: No
article_type: original
author:
- first_name: Giorgio
full_name: Cipolloni, Giorgio
id: 42198EFA-F248-11E8-B48F-1D18A9856A87
last_name: Cipolloni
orcid: 0000-0002-4901-7992
- first_name: László
full_name: Erdös, László
id: 4DBD5372-F248-11E8-B48F-1D18A9856A87
last_name: Erdös
orcid: 0000-0001-5366-9603
- first_name: Dominik J
full_name: Schröder, Dominik J
id: 408ED176-F248-11E8-B48F-1D18A9856A87
last_name: Schröder
orcid: 0000-0002-2904-1856
citation:
ama: Cipolloni G, Erdös L, Schröder DJ. Rank-uniform local law for Wigner matrices.
Forum of Mathematics, Sigma. 2022;10. doi:10.1017/fms.2022.86
apa: Cipolloni, G., Erdös, L., & Schröder, D. J. (2022). Rank-uniform local
law for Wigner matrices. Forum of Mathematics, Sigma. Cambridge University
Press. https://doi.org/10.1017/fms.2022.86
chicago: Cipolloni, Giorgio, László Erdös, and Dominik J Schröder. “Rank-Uniform
Local Law for Wigner Matrices.” Forum of Mathematics, Sigma. Cambridge
University Press, 2022. https://doi.org/10.1017/fms.2022.86.
ieee: G. Cipolloni, L. Erdös, and D. J. Schröder, “Rank-uniform local law for Wigner
matrices,” Forum of Mathematics, Sigma, vol. 10. Cambridge University Press,
2022.
ista: Cipolloni G, Erdös L, Schröder DJ. 2022. Rank-uniform local law for Wigner
matrices. Forum of Mathematics, Sigma. 10, e96.
mla: Cipolloni, Giorgio, et al. “Rank-Uniform Local Law for Wigner Matrices.” Forum
of Mathematics, Sigma, vol. 10, e96, Cambridge University Press, 2022, doi:10.1017/fms.2022.86.
short: G. Cipolloni, L. Erdös, D.J. Schröder, Forum of Mathematics, Sigma 10 (2022).
date_created: 2023-01-12T12:07:30Z
date_published: 2022-10-27T00:00:00Z
date_updated: 2023-08-04T09:00:35Z
day: '27'
ddc:
- '510'
department:
- _id: LaEr
doi: 10.1017/fms.2022.86
ec_funded: 1
external_id:
isi:
- '000873719200001'
file:
- access_level: open_access
checksum: 94a049aeb1eea5497aa097712a73c400
content_type: application/pdf
creator: dernst
date_created: 2023-01-24T10:02:40Z
date_updated: 2023-01-24T10:02:40Z
file_id: '12356'
file_name: 2022_ForumMath_Cipolloni.pdf
file_size: 817089
relation: main_file
success: 1
file_date_updated: 2023-01-24T10:02:40Z
has_accepted_license: '1'
intvolume: ' 10'
isi: 1
keyword:
- Computational Mathematics
- Discrete Mathematics and Combinatorics
- Geometry and Topology
- Mathematical Physics
- Statistics and Probability
- Algebra and Number Theory
- Theoretical Computer Science
- Analysis
language:
- iso: eng
month: '10'
oa: 1
oa_version: Published Version
project:
- _id: 62796744-2b32-11ec-9570-940b20777f1d
call_identifier: H2020
grant_number: '101020331'
name: Random matrices beyond Wigner-Dyson-Mehta
publication: Forum of Mathematics, Sigma
publication_identifier:
issn:
- 2050-5094
publication_status: published
publisher: Cambridge University Press
quality_controlled: '1'
scopus_import: '1'
status: public
title: Rank-uniform local law for Wigner matrices
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: 10
year: '2022'
...
---
_id: '12154'
abstract:
- lang: eng
text: We review our theoretical results of the sound propagation in two-dimensional
(2D) systems of ultracold fermionic and bosonic atoms. In the superfluid phase,
characterized by the spontaneous symmetry breaking of the U(1) symmetry, there
is the coexistence of first and second sound. In the case of weakly-interacting
repulsive bosons, we model the recent measurements of the sound velocities of
39K atoms in 2D obtained in the weakly-interacting regime and around the Berezinskii–Kosterlitz–Thouless
(BKT) superfluid-to-normal transition temperature. In particular, we perform a
quite accurate computation of the superfluid density and show that it is reasonably
consistent with the experimental results. For superfluid attractive fermions,
we calculate the first and second sound velocities across the whole BCS-BEC crossover.
In the low-temperature regime, we reproduce the recent measurements of first-sound
speed with 6Li atoms. We also predict that there is mixing between sound modes
only in the finite-temperature BEC regime.
acknowledgement: "This research is partially supported by University of Padova, BIRD
grant “Ultracold atoms\r\nin curved geometries”. KF is supported by Fondazione CARIPARO
with a PhD fellowship. AT is\r\npartially supported by French National Research
Agency ANR Grant Droplets N. ANR-19-CE30-0003-02. LS thanks Herwig Ott and Sandro
Wimberger for their kind invitation to the\r\nInternational Workshop “Quantum Transport
with ultracold atoms” (2022)."
article_number: '2182'
article_processing_charge: Yes
article_type: original
author:
- first_name: Luca
full_name: Salasnich, Luca
last_name: Salasnich
- first_name: Alberto
full_name: Cappellaro, Alberto
id: 9d13b3cb-30a2-11eb-80dc-f772505e8660
last_name: Cappellaro
orcid: 0000-0001-6110-2359
- first_name: Koichiro
full_name: Furutani, Koichiro
last_name: Furutani
- first_name: Andrea
full_name: Tononi, Andrea
last_name: Tononi
- first_name: Giacomo
full_name: Bighin, Giacomo
id: 4CA96FD4-F248-11E8-B48F-1D18A9856A87
last_name: Bighin
orcid: 0000-0001-8823-9777
citation:
ama: Salasnich L, Cappellaro A, Furutani K, Tononi A, Bighin G. First and second
sound in two-dimensional bosonic and fermionic superfluids. Symmetry. 2022;14(10).
doi:10.3390/sym14102182
apa: Salasnich, L., Cappellaro, A., Furutani, K., Tononi, A., & Bighin, G. (2022).
First and second sound in two-dimensional bosonic and fermionic superfluids. Symmetry.
MDPI. https://doi.org/10.3390/sym14102182
chicago: Salasnich, Luca, Alberto Cappellaro, Koichiro Furutani, Andrea Tononi,
and Giacomo Bighin. “First and Second Sound in Two-Dimensional Bosonic and Fermionic
Superfluids.” Symmetry. MDPI, 2022. https://doi.org/10.3390/sym14102182.
ieee: L. Salasnich, A. Cappellaro, K. Furutani, A. Tononi, and G. Bighin, “First
and second sound in two-dimensional bosonic and fermionic superfluids,” Symmetry,
vol. 14, no. 10. MDPI, 2022.
ista: Salasnich L, Cappellaro A, Furutani K, Tononi A, Bighin G. 2022. First and
second sound in two-dimensional bosonic and fermionic superfluids. Symmetry. 14(10),
2182.
mla: Salasnich, Luca, et al. “First and Second Sound in Two-Dimensional Bosonic
and Fermionic Superfluids.” Symmetry, vol. 14, no. 10, 2182, MDPI, 2022,
doi:10.3390/sym14102182.
short: L. Salasnich, A. Cappellaro, K. Furutani, A. Tononi, G. Bighin, Symmetry
14 (2022).
date_created: 2023-01-12T12:08:31Z
date_published: 2022-10-17T00:00:00Z
date_updated: 2023-08-09T10:13:17Z
day: '17'
ddc:
- '530'
department:
- _id: MiLe
doi: 10.3390/sym14102182
external_id:
isi:
- '000875039200001'
file:
- access_level: open_access
checksum: 9b6bd0e484834dd76d7b26e3c5fba8bd
content_type: application/pdf
creator: dernst
date_created: 2023-01-24T10:56:12Z
date_updated: 2023-01-24T10:56:12Z
file_id: '12361'
file_name: 2022_Symmetry_Salsnich.pdf
file_size: 843723
relation: main_file
success: 1
file_date_updated: 2023-01-24T10:56:12Z
has_accepted_license: '1'
intvolume: ' 14'
isi: 1
issue: '10'
keyword:
- Physics and Astronomy (miscellaneous)
- General Mathematics
- Chemistry (miscellaneous)
- Computer Science (miscellaneous)
language:
- iso: eng
month: '10'
oa: 1
oa_version: Published Version
publication: Symmetry
publication_identifier:
issn:
- 2073-8994
publication_status: published
publisher: MDPI
quality_controlled: '1'
scopus_import: '1'
status: public
title: First and second sound in two-dimensional bosonic and fermionic superfluids
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: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 14
year: '2022'
...
---
_id: '12156'
abstract:
- lang: eng
text: Models of transcriptional regulation that assume equilibrium binding of transcription
factors have been less successful at predicting gene expression from sequence
in eukaryotes than in bacteria. This could be due to the non-equilibrium nature
of eukaryotic regulation. Unfortunately, the space of possible non-equilibrium
mechanisms is vast and predominantly uninteresting. The key question is therefore
how this space can be navigated efficiently, to focus on mechanisms and models
that are biologically relevant. In this review, we advocate for the normative
role of theory—theory that prescribes rather than just describes—in providing
such a focus. Theory should expand its remit beyond inferring mechanistic models
from data, towards identifying non-equilibrium gene regulatory schemes that may
have been evolutionarily selected, despite their energy consumption, because they
are precise, reliable, fast, or otherwise outperform regulation at equilibrium.
We illustrate our reasoning by toy examples for which we provide simulation code.
acknowledgement: 'This work was supported through the Center for the Physics of Biological
Function (PHYe1734030) and by National Institutes of Health Grants R01GM097275 and
U01DK127429 (TG). GT acknowledges the support of the Austrian Science Fund grant
FWF P28844 and the Human Frontiers Science Program. '
article_number: '100435'
article_processing_charge: Yes (via OA deal)
article_type: original
author:
- first_name: Benjamin
full_name: Zoller, Benjamin
last_name: Zoller
- 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: '1'
citation:
ama: Zoller B, Gregor T, Tkačik G. Eukaryotic gene regulation at equilibrium, or
non? Current Opinion in Systems Biology. 2022;31(9). doi:10.1016/j.coisb.2022.100435
apa: Zoller, B., Gregor, T., & Tkačik, G. (2022). Eukaryotic gene regulation
at equilibrium, or non? Current Opinion in Systems Biology. Elsevier. https://doi.org/10.1016/j.coisb.2022.100435
chicago: Zoller, Benjamin, Thomas Gregor, and Gašper Tkačik. “Eukaryotic Gene Regulation
at Equilibrium, or Non?” Current Opinion in Systems Biology. Elsevier,
2022. https://doi.org/10.1016/j.coisb.2022.100435.
ieee: B. Zoller, T. Gregor, and G. Tkačik, “Eukaryotic gene regulation at equilibrium,
or non?,” Current Opinion in Systems Biology, vol. 31, no. 9. Elsevier,
2022.
ista: Zoller B, Gregor T, Tkačik G. 2022. Eukaryotic gene regulation at equilibrium,
or non? Current Opinion in Systems Biology. 31(9), 100435.
mla: Zoller, Benjamin, et al. “Eukaryotic Gene Regulation at Equilibrium, or Non?”
Current Opinion in Systems Biology, vol. 31, no. 9, 100435, Elsevier, 2022,
doi:10.1016/j.coisb.2022.100435.
short: B. Zoller, T. Gregor, G. Tkačik, Current Opinion in Systems Biology 31 (2022).
date_created: 2023-01-12T12:08:51Z
date_published: 2022-09-01T00:00:00Z
date_updated: 2023-02-13T09:20:34Z
day: '01'
ddc:
- '570'
department:
- _id: GaTk
doi: 10.1016/j.coisb.2022.100435
file:
- access_level: open_access
checksum: 97ef01e0cc60cdc84f45640a0f248fb0
content_type: application/pdf
creator: dernst
date_created: 2023-01-24T12:14:10Z
date_updated: 2023-01-24T12:14:10Z
file_id: '12362'
file_name: 2022_CurrentBiology_Zoller.pdf
file_size: 2214944
relation: main_file
success: 1
file_date_updated: 2023-01-24T12:14:10Z
has_accepted_license: '1'
intvolume: ' 31'
issue: '9'
keyword:
- Applied Mathematics
- Computer Science Applications
- Drug Discovery
- General Biochemistry
- Genetics and Molecular Biology
- Modeling and Simulation
language:
- iso: eng
month: '09'
oa: 1
oa_version: Published Version
project:
- _id: 254E9036-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P28844-B27
name: Biophysics of information processing in gene regulation
publication: Current Opinion in Systems Biology
publication_identifier:
issn:
- 2452-3100
publication_status: published
publisher: Elsevier
quality_controlled: '1'
scopus_import: '1'
status: public
title: Eukaryotic gene regulation at equilibrium, or non?
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: 31
year: '2022'
...
---
_id: '12286'
abstract:
- lang: eng
text: "Inspired by the study of loose cycles in hypergraphs, we define the loose
core in hypergraphs as a structurewhich mirrors the close relationship between
cycles and $2$-cores in graphs. We prove that in the $r$-uniform binomial random
hypergraph $H^r(n,p)$, the order of the loose core undergoes a phase transition
at a certain critical threshold and determine this order, as well as the number
of edges, asymptotically in the subcritical and supercritical regimes.
\r\nOur
main tool is an algorithm called CoreConstruct, which enables us to analyse a
peeling process for the loose core. By analysing this algorithm we determine the
asymptotic degree distribution of vertices in the loose core and in particular
how many vertices and edges the loose core contains. As a corollary we obtain
an improved upper bound on the length of the longest loose cycle in $H^r(n,p)$."
acknowledgement: 'Supported by Austrian Science Fund (FWF): I3747, W1230.'
article_number: P4.13
article_processing_charge: No
article_type: original
author:
- first_name: Oliver
full_name: Cooley, Oliver
id: 43f4ddd0-a46b-11ec-8df6-ef3703bd721d
last_name: Cooley
- first_name: Mihyun
full_name: Kang, Mihyun
last_name: Kang
- first_name: Julian
full_name: Zalla, Julian
last_name: Zalla
citation:
ama: Cooley O, Kang M, Zalla J. Loose cores and cycles in random hypergraphs. The
Electronic Journal of Combinatorics. 2022;29(4). doi:10.37236/10794
apa: Cooley, O., Kang, M., & Zalla, J. (2022). Loose cores and cycles in random
hypergraphs. The Electronic Journal of Combinatorics. The Electronic Journal
of Combinatorics. https://doi.org/10.37236/10794
chicago: Cooley, Oliver, Mihyun Kang, and Julian Zalla. “Loose Cores and Cycles
in Random Hypergraphs.” The Electronic Journal of Combinatorics. The Electronic
Journal of Combinatorics, 2022. https://doi.org/10.37236/10794.
ieee: O. Cooley, M. Kang, and J. Zalla, “Loose cores and cycles in random hypergraphs,”
The Electronic Journal of Combinatorics, vol. 29, no. 4. The Electronic
Journal of Combinatorics, 2022.
ista: Cooley O, Kang M, Zalla J. 2022. Loose cores and cycles in random hypergraphs.
The Electronic Journal of Combinatorics. 29(4), P4.13.
mla: Cooley, Oliver, et al. “Loose Cores and Cycles in Random Hypergraphs.” The
Electronic Journal of Combinatorics, vol. 29, no. 4, P4.13, The Electronic
Journal of Combinatorics, 2022, doi:10.37236/10794.
short: O. Cooley, M. Kang, J. Zalla, The Electronic Journal of Combinatorics 29
(2022).
date_created: 2023-01-16T10:03:57Z
date_published: 2022-10-21T00:00:00Z
date_updated: 2023-08-04T10:29:18Z
day: '21'
ddc:
- '510'
department:
- _id: MaKw
doi: 10.37236/10794
external_id:
isi:
- '000876763300001'
file:
- access_level: open_access
checksum: 00122b2459f09b5ae43073bfba565e94
content_type: application/pdf
creator: dernst
date_created: 2023-01-30T11:45:13Z
date_updated: 2023-01-30T11:45:13Z
file_id: '12462'
file_name: 2022_ElecJournCombinatorics_Cooley_Kang_Zalla.pdf
file_size: 626953
relation: main_file
success: 1
file_date_updated: 2023-01-30T11:45:13Z
has_accepted_license: '1'
intvolume: ' 29'
isi: 1
issue: '4'
keyword:
- Computational Theory and Mathematics
- Geometry and Topology
- Theoretical Computer Science
- Applied Mathematics
- Discrete Mathematics and Combinatorics
language:
- iso: eng
license: https://creativecommons.org/licenses/by-nd/4.0/
month: '10'
oa: 1
oa_version: Published Version
publication: The Electronic Journal of Combinatorics
publication_identifier:
eissn:
- 1077-8926
publication_status: published
publisher: The Electronic Journal of Combinatorics
quality_controlled: '1'
scopus_import: '1'
status: public
title: Loose cores and cycles in random hypergraphs
tmp:
image: /image/cc_by_nd.png
legal_code_url: https://creativecommons.org/licenses/by-nd/4.0/legalcode
name: Creative Commons Attribution-NoDerivatives 4.0 International (CC BY-ND 4.0)
short: CC BY-ND (4.0)
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 29
year: '2022'
...
---
_id: '10674'
abstract:
- lang: eng
text: 'In two-player games on graphs, the players move a token through a graph to
produce an infinite path, which determines the winner of the game. Such games
are central in formal methods since they model the interaction between a non-terminating
system and its environment. In bidding games the players bid for the right to
move the token: in each round, the players simultaneously submit bids, and the
higher bidder moves the token and pays the other player. Bidding games are known
to have a clean and elegant mathematical structure that relies on the ability
of the players to submit arbitrarily small bids. Many applications, however, require
a fixed granularity for the bids, which can represent, for example, the monetary
value expressed in cents. We study, for the first time, the combination of discrete-bidding
and infinite-duration games. Our most important result proves that these games
form a large determined subclass of concurrent games, where determinacy is the
strong property that there always exists exactly one player who can guarantee
winning the game. In particular, we show that, in contrast to non-discrete bidding
games, the mechanism with which tied bids are resolved plays an important role
in discrete-bidding games. We study several natural tie-breaking mechanisms and
show that, while some do not admit determinacy, most natural mechanisms imply
determinacy for every pair of initial budgets.'
acknowledgement: "This research was supported in part by the Austrian Science Fund
(FWF) under grants S11402-N23 (RiSE/SHiNE), Z211-N23 (Wittgenstein Award), and M
2369-N33 (Meitner fellowship).\r\n"
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Milad
full_name: Aghajohari, Milad
last_name: Aghajohari
- first_name: Guy
full_name: Avni, Guy
id: 463C8BC2-F248-11E8-B48F-1D18A9856A87
last_name: Avni
orcid: 0000-0001-5588-8287
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000-0002-2985-7724
citation:
ama: Aghajohari M, Avni G, Henzinger TA. Determinacy in discrete-bidding infinite-duration
games. Logical Methods in Computer Science. 2021;17(1):10:1-10:23. doi:10.23638/LMCS-17(1:10)2021
apa: Aghajohari, M., Avni, G., & Henzinger, T. A. (2021). Determinacy in discrete-bidding
infinite-duration games. Logical Methods in Computer Science. International
Federation for Computational Logic. https://doi.org/10.23638/LMCS-17(1:10)2021
chicago: Aghajohari, Milad, Guy Avni, and Thomas A Henzinger. “Determinacy in Discrete-Bidding
Infinite-Duration Games.” Logical Methods in Computer Science. International
Federation for Computational Logic, 2021. https://doi.org/10.23638/LMCS-17(1:10)2021.
ieee: M. Aghajohari, G. Avni, and T. A. Henzinger, “Determinacy in discrete-bidding
infinite-duration games,” Logical Methods in Computer Science, vol. 17,
no. 1. International Federation for Computational Logic, p. 10:1-10:23, 2021.
ista: Aghajohari M, Avni G, Henzinger TA. 2021. Determinacy in discrete-bidding
infinite-duration games. Logical Methods in Computer Science. 17(1), 10:1-10:23.
mla: Aghajohari, Milad, et al. “Determinacy in Discrete-Bidding Infinite-Duration
Games.” Logical Methods in Computer Science, vol. 17, no. 1, International
Federation for Computational Logic, 2021, p. 10:1-10:23, doi:10.23638/LMCS-17(1:10)2021.
short: M. Aghajohari, G. Avni, T.A. Henzinger, Logical Methods in Computer Science
17 (2021) 10:1-10:23.
date_created: 2022-01-25T16:32:13Z
date_published: 2021-02-03T00:00:00Z
date_updated: 2023-08-17T06:56:42Z
day: '03'
ddc:
- '510'
department:
- _id: ToHe
doi: 10.23638/LMCS-17(1:10)2021
external_id:
arxiv:
- '1905.03588'
isi:
- '000658724600010'
file:
- access_level: open_access
checksum: b35586a50ed1ca8f44767de116d18d81
content_type: application/pdf
creator: alisjak
date_created: 2022-01-26T08:04:50Z
date_updated: 2022-01-26T08:04:50Z
file_id: '10690'
file_name: 2021_LMCS_AGHAJOHAR.pdf
file_size: 819878
relation: main_file
success: 1
file_date_updated: 2022-01-26T08:04:50Z
has_accepted_license: '1'
intvolume: ' 17'
isi: 1
issue: '1'
keyword:
- computer science
- computer science and game theory
- logic in computer science
language:
- iso: eng
month: '02'
oa: 1
oa_version: Published Version
page: 10:1-10:23
project:
- _id: 264B3912-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: M02369
name: Formal Methods meets Algorithmic Game Theory
- _id: 25F2ACDE-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11402-N23
name: Rigorous Systems Engineering
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z211
name: The Wittgenstein Prize
publication: Logical Methods in Computer Science
publication_identifier:
eissn:
- 1860-5974
publication_status: published
publisher: International Federation for Computational Logic
quality_controlled: '1'
scopus_import: '1'
status: public
title: Determinacy in discrete-bidding infinite-duration games
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: 17
year: '2021'
...
---
_id: '10855'
abstract:
- lang: eng
text: 'Consider a distributed task where the communication network is fixed but
the local inputs given to the nodes of the distributed system may change over
time. In this work, we explore the following question: if some of the local inputs
change, can an existing solution be updated efficiently, in a dynamic and distributed
manner? To address this question, we define the batch dynamic \congest model in
which we are given a bandwidth-limited communication network and a dynamic edge
labelling defines the problem input. The task is to maintain a solution to a graph
problem on the labeled graph under batch changes. We investigate, when a batch
of α edge label changes arrive, \beginitemize \item how much time as a function
of α we need to update an existing solution, and \item how much information the
nodes have to keep in local memory between batches in order to update the solution
quickly. \enditemize Our work lays the foundations for the theory of input-dynamic
distributed network algorithms. We give a general picture of the complexity landscape
in this model, design both universal algorithms and algorithms for concrete problems,
and present a general framework for lower bounds. In particular, we derive non-trivial
upper bounds for two selected, contrasting problems: maintaining a minimum spanning
tree and detecting cliques.'
acknowledgement: "We thank Jukka Suomela for discussions. We also thank our shepherd
Mohammad Hajiesmaili\r\nand the reviewers for their time and suggestions on how
to improve the paper. This project\r\nhas received funding from the European Research
Council (ERC) under the European Union’s\r\nHorizon 2020 research and innovation
programme (grant agreement No 805223 ScaleML), from the European Union’s Horizon
2020 research and innovation programme under the Marie\r\nSk lodowska–Curie grant
agreement No. 840605, from the Vienna Science and Technology Fund (WWTF) project
WHATIF, ICT19-045, 2020-2024, and from the Austrian Science Fund (FWF) and netIDEE
SCIENCE project P 33775-N."
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Klaus-Tycho
full_name: Foerster, Klaus-Tycho
last_name: Foerster
- first_name: Janne
full_name: Korhonen, Janne
id: C5402D42-15BC-11E9-A202-CA2BE6697425
last_name: Korhonen
- first_name: Ami
full_name: Paz, Ami
last_name: Paz
- first_name: Joel
full_name: Rybicki, Joel
id: 334EFD2E-F248-11E8-B48F-1D18A9856A87
last_name: Rybicki
orcid: 0000-0002-6432-6646
- first_name: Stefan
full_name: Schmid, Stefan
last_name: Schmid
citation:
ama: Foerster K-T, Korhonen J, Paz A, Rybicki J, Schmid S. Input-dynamic distributed
algorithms for communication networks. Proceedings of the ACM on Measurement
and Analysis of Computing Systems. 2021;5(1):1-33. doi:10.1145/3447384
apa: Foerster, K.-T., Korhonen, J., Paz, A., Rybicki, J., & Schmid, S. (2021).
Input-dynamic distributed algorithms for communication networks. Proceedings
of the ACM on Measurement and Analysis of Computing Systems. Association for
Computing Machinery. https://doi.org/10.1145/3447384
chicago: Foerster, Klaus-Tycho, Janne Korhonen, Ami Paz, Joel Rybicki, and Stefan
Schmid. “Input-Dynamic Distributed Algorithms for Communication Networks.” Proceedings
of the ACM on Measurement and Analysis of Computing Systems. Association for
Computing Machinery, 2021. https://doi.org/10.1145/3447384.
ieee: K.-T. Foerster, J. Korhonen, A. Paz, J. Rybicki, and S. Schmid, “Input-dynamic
distributed algorithms for communication networks,” Proceedings of the ACM
on Measurement and Analysis of Computing Systems, vol. 5, no. 1. Association
for Computing Machinery, pp. 1–33, 2021.
ista: Foerster K-T, Korhonen J, Paz A, Rybicki J, Schmid S. 2021. Input-dynamic
distributed algorithms for communication networks. Proceedings of the ACM on Measurement
and Analysis of Computing Systems. 5(1), 1–33.
mla: Foerster, Klaus-Tycho, et al. “Input-Dynamic Distributed Algorithms for Communication
Networks.” Proceedings of the ACM on Measurement and Analysis of Computing
Systems, vol. 5, no. 1, Association for Computing Machinery, 2021, pp. 1–33,
doi:10.1145/3447384.
short: K.-T. Foerster, J. Korhonen, A. Paz, J. Rybicki, S. Schmid, Proceedings of
the ACM on Measurement and Analysis of Computing Systems 5 (2021) 1–33.
date_created: 2022-03-18T09:10:27Z
date_published: 2021-03-01T00:00:00Z
date_updated: 2023-09-26T10:40:55Z
day: '01'
department:
- _id: DaAl
doi: 10.1145/3447384
ec_funded: 1
external_id:
arxiv:
- '2005.07637'
intvolume: ' 5'
issue: '1'
keyword:
- Computer Networks and Communications
- Hardware and Architecture
- Safety
- Risk
- Reliability and Quality
- Computer Science (miscellaneous)
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/2005.07637
month: '03'
oa: 1
oa_version: Preprint
page: 1-33
project:
- _id: 26A5D39A-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '840605'
name: Coordination in constrained and natural distributed systems
- _id: 268A44D6-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '805223'
name: Elastic Coordination for Scalable Machine Learning
publication: Proceedings of the ACM on Measurement and Analysis of Computing Systems
publication_identifier:
issn:
- 2476-1249
publication_status: published
publisher: Association for Computing Machinery
quality_controlled: '1'
related_material:
record:
- id: '10854'
relation: shorter_version
status: public
scopus_import: '1'
status: public
title: Input-dynamic distributed algorithms for communication networks
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 5
year: '2021'
...
---
_id: '11446'
abstract:
- lang: eng
text: Suppose that n is not a prime power and not twice a prime power. We prove
that for any Hausdorff compactum X with a free action of the symmetric group Sn,
there exists an Sn-equivariant map X→Rn whose image avoids the diagonal {(x,x,…,x)∈Rn∣x∈R}.
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 take 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 Sn-equivariant
maps from the boundary ∂Δ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.
acknowledgement: S. Avvakumov has received funding from the European Research Council
under the European Union’s Seventh Framework Programme ERC Grant agreement ERC StG
716424–CASe. S. Kudrya was supported by the Austrian Academic Exchange Service (OeAD),
ICM-2019-13577.
article_processing_charge: No
article_type: original
arxiv: 1
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. Discrete & Computational Geometry. 2021;66(3):1202-1216. doi:10.1007/s00454-021-00299-z
apa: Avvakumov, S., & Kudrya, S. (2021). Vanishing of all equivariant obstructions
and the mapping degree. Discrete & Computational Geometry. Springer
Nature. https://doi.org/10.1007/s00454-021-00299-z
chicago: Avvakumov, Sergey, and Sergey Kudrya. “Vanishing of All Equivariant Obstructions
and the Mapping Degree.” Discrete & Computational Geometry. Springer
Nature, 2021. https://doi.org/10.1007/s00454-021-00299-z.
ieee: S. Avvakumov and S. Kudrya, “Vanishing of all equivariant obstructions and
the mapping degree,” Discrete & Computational Geometry, vol. 66, no.
3. Springer Nature, pp. 1202–1216, 2021.
ista: Avvakumov S, Kudrya S. 2021. Vanishing of all equivariant obstructions and
the mapping degree. Discrete & Computational Geometry. 66(3), 1202–1216.
mla: Avvakumov, Sergey, and Sergey Kudrya. “Vanishing of All Equivariant Obstructions
and the Mapping Degree.” Discrete & Computational Geometry, vol. 66,
no. 3, Springer Nature, 2021, pp. 1202–16, doi:10.1007/s00454-021-00299-z.
short: S. Avvakumov, S. Kudrya, Discrete & Computational Geometry 66 (2021)
1202–1216.
date_created: 2022-06-17T08:45:15Z
date_published: 2021-10-01T00:00:00Z
date_updated: 2023-02-23T13:26:41Z
day: '01'
doi: 10.1007/s00454-021-00299-z
extern: '1'
external_id:
arxiv:
- '1910.12628'
intvolume: ' 66'
issue: '3'
keyword:
- Computational Theory and Mathematics
- Discrete Mathematics and Combinatorics
- Geometry and Topology
- Theoretical Computer Science
language:
- iso: eng
month: '10'
oa_version: Preprint
page: 1202-1216
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: '8182'
relation: earlier_version
status: public
scopus_import: '1'
status: public
title: Vanishing of all equivariant obstructions and the mapping degree
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 66
year: '2021'
...