---
_id: '18175'
abstract:
- lang: eng
  text: Large-scale software repositories are a source of insights for software engineering.
    They offer an unmatched window into the software development process at scale.
    Their sheer number and size holds the promise of broadly applicable results. At
    the same time, that very size presents practical challenges for scaling tools
    and algorithms to millions of projects. A reasonable approach is to limit studies
    to representative samples of the population of interest. Broadly applicable conclusions
    can then be obtained by generalizing to the entire population. The contribution
    of this paper is a standardized experimental design methodology for choosing the
    inputs of studies working with large-scale repositories. We advocate for a methodology
    that clearly lays out what the population of interest is, how to sample it, and
    that fosters reproducibility. Along the way, we discourage researchers from using
    extrinsic attributes of projects such as stars, that measure some unclear notion
    of popularity.
acknowledgement: "This work was supported by the Czech Ministry of Education, Youth
  and Sports under\r\nprogram ERC-CZ, grant agreement LL2325, BigCode (reg. no. CZ.02.1.01/0.0/0.0/15_003/0000421).
  NSF grants CCF-1910850, CNS-1925644, and CCF-2139612, as well as the GACR EXPRO
  grant 23-07580X. We would like to thank Digital Ocean for their involuntary contribution
  of computational resources during the early data gathering phase of our research.
  We acknoweldge the reviewers of ICSE’22, and thank the reviewers of ECOOP’23 for
  their encouragments and for sticking around until 2024."
alternative_title:
- LIPIcs
article_number: '27'
article_processing_charge: No
author:
- first_name: Petr
  full_name: Maj, Petr
  last_name: Maj
- first_name: Stefanie
  full_name: Muroya Lei, Stefanie
  id: a376de31-8972-11ed-ae7b-d0251c13c8ff
  last_name: Muroya Lei
- first_name: Konrad
  full_name: Siek, Konrad
  last_name: Siek
- first_name: Luca
  full_name: Di Grazia, Luca
  last_name: Di Grazia
- first_name: Jan
  full_name: Vitek, Jan
  last_name: Vitek
citation:
  ama: 'Maj P, Muroya Lei S, Siek K, Di Grazia L, Vitek J. The fault in our stars:
    Designing reproducible large-scale code analysis experiments. In: <i>38th European
    Conference on Object-Oriented Programming</i>. Vol 313. Schloss Dagstuhl - Leibniz-Zentrum
    für Informatik; 2024. doi:<a href="https://doi.org/10.4230/LIPIcs.ECOOP.2024.27">10.4230/LIPIcs.ECOOP.2024.27</a>'
  apa: 'Maj, P., Muroya Lei, S., Siek, K., Di Grazia, L., &#38; Vitek, J. (2024).
    The fault in our stars: Designing reproducible large-scale code analysis experiments.
    In <i>38th European Conference on Object-Oriented Programming</i> (Vol. 313).
    Vienna, Austria: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href="https://doi.org/10.4230/LIPIcs.ECOOP.2024.27">https://doi.org/10.4230/LIPIcs.ECOOP.2024.27</a>'
  chicago: 'Maj, Petr, Stefanie Muroya Lei, Konrad Siek, Luca Di Grazia, and Jan Vitek.
    “The Fault in Our Stars: Designing Reproducible Large-Scale Code Analysis Experiments.”
    In <i>38th European Conference on Object-Oriented Programming</i>, Vol. 313. Schloss
    Dagstuhl - Leibniz-Zentrum für Informatik, 2024. <a href="https://doi.org/10.4230/LIPIcs.ECOOP.2024.27">https://doi.org/10.4230/LIPIcs.ECOOP.2024.27</a>.'
  ieee: 'P. Maj, S. Muroya Lei, K. Siek, L. Di Grazia, and J. Vitek, “The fault in
    our stars: Designing reproducible large-scale code analysis experiments,” in <i>38th
    European Conference on Object-Oriented Programming</i>, Vienna, Austria, 2024,
    vol. 313.'
  ista: 'Maj P, Muroya Lei S, Siek K, Di Grazia L, Vitek J. 2024. The fault in our
    stars: Designing reproducible large-scale code analysis experiments. 38th European
    Conference on Object-Oriented Programming. ECOOP: European Conference on Object-Oriented
    Programming, LIPIcs, vol. 313, 27.'
  mla: 'Maj, Petr, et al. “The Fault in Our Stars: Designing Reproducible Large-Scale
    Code Analysis Experiments.” <i>38th European Conference on Object-Oriented Programming</i>,
    vol. 313, 27, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024, doi:<a
    href="https://doi.org/10.4230/LIPIcs.ECOOP.2024.27">10.4230/LIPIcs.ECOOP.2024.27</a>.'
  short: P. Maj, S. Muroya Lei, K. Siek, L. Di Grazia, J. Vitek, in:, 38th European
    Conference on Object-Oriented Programming, Schloss Dagstuhl - Leibniz-Zentrum
    für Informatik, 2024.
conference:
  end_date: 2024-09-20
  location: Vienna, Austria
  name: 'ECOOP: European Conference on Object-Oriented Programming'
  start_date: 2024-09-16
das_tickbox: '0'
date_created: 2024-10-06T22:01:12Z
date_published: 2024-09-01T00:00:00Z
date_updated: 2026-10-21T13:11:58Z
day: '01'
ddc:
- '000'
department:
- _id: ToHe
doi: 10.4230/LIPIcs.ECOOP.2024.27
external_id:
  isi:
  - '001533999700027'
file:
- access_level: open_access
  checksum: 2e75d305a8c817d76a0c7f136ce34f86
  content_type: application/pdf
  creator: dernst
  date_created: 2024-10-07T11:10:55Z
  date_updated: 2024-10-07T11:10:55Z
  file_id: '18184'
  file_name: 2024_LIPICs_Maj.pdf
  file_size: 1764222
  relation: main_file
  success: 1
file_date_updated: 2024-10-07T11:10:55Z
fulldoi: https://doi.org/10.4230/LIPIcs.ECOOP.2024.27
has_accepted_license: '1'
intvolume: '       313'
isi: 1
language:
- iso: eng
month: '09'
oa: 1
oa_version: Published Version
publication: 38th European Conference on Object-Oriented Programming
publication_identifier:
  isbn:
  - '9783959773416'
  issn:
  - 1868-8969
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
quality_controlled: '1'
researchdata_availability: no
scopus_import: '1'
status: public
supplementarymaterial: no
title: 'The fault in our stars: Designing reproducible large-scale code analysis experiments'
tmp:
  image: /images/cc_by.png
  legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
  name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
  short: CC BY (4.0)
type: conference
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 313
year: '2024'
...
---
DOAJ_listed: '1'
OA_place: publisher
OA_type: gold
_id: '18530'
abstract:
- lang: eng
  text: "We explore the notion of history-determinism in the context of timed automata
    (TA) over infinite timed words. History-deterministic (HD) automata are those
    in which nondeterminism can be resolved on the fly, based on the run constructed
    thus far. History-determinism is a robust property that admits different game-based
    characterisations, and HD specifications allow for game-based verification without
    an expensive determinization step. We show that the class of timed ω\r\n-languages
    recognized by HD timed automata strictly extends that of deterministic ones, and
    is strictly included in those recognised by fully non-deterministic TA. For non-deterministic
    timed automata it is known that universality is already undecidable for safety/reachability
    TA. For history-deterministic TA with arbitrary parity acceptance, we show that
    timed universality, inclusion, and synthesis all remain decidable and are EXPTIME-complete.
    For the subclass of TA with safety or reachability acceptance, one can decide
    (in EXPTIME) whether such an automaton is history-deterministic. If so, it can
    effectively determinized without introducing new automaton states."
acknowledgement: This work has in parts been presented at the 33rd International Conference
  on Concurrency Theory (CONCUR’22) [HLT22] and at the 16th International Workshop
  on Reachability Problems (RP’22) [BHL+22]. This work was supported by the EU (ERC-2020-AdG
  101020093); the EPSRC (EP/V025848/1, EP/X042596/1, EP/X017796/1 and EP/X03688X/1);
  and the ANR (QUASY 23-CE48-0008-01).
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Sougata
  full_name: Bose, Sougata
  last_name: Bose
- first_name: Thomas A
  full_name: Henzinger, Thomas A
  id: 40876CD8-F248-11E8-B48F-1D18A9856A87
  last_name: Henzinger
  orcid: 0000-0002-2985-7724
- first_name: Karoliina
  full_name: Lehtinen, Karoliina
  last_name: Lehtinen
- first_name: Sven
  full_name: Schewe, Sven
  last_name: Schewe
- first_name: Patrick
  full_name: Totzke, Patrick
  last_name: Totzke
citation:
  ama: Bose S, Henzinger TA, Lehtinen K, Schewe S, Totzke P. History-deterministic
    timed automata. <i>Logical Methods in Computer Science</i>. 2024;20(4):1-28. doi:<a
    href="https://doi.org/10.46298/lmcs-20(4:1)2024">10.46298/lmcs-20(4:1)2024</a>
  apa: Bose, S., Henzinger, T. A., Lehtinen, K., Schewe, S., &#38; Totzke, P. (2024).
    History-deterministic timed automata. <i>Logical Methods in Computer Science</i>.
    EPI Sciences. <a href="https://doi.org/10.46298/lmcs-20(4:1)2024">https://doi.org/10.46298/lmcs-20(4:1)2024</a>
  chicago: Bose, Sougata, Thomas A Henzinger, Karoliina Lehtinen, Sven Schewe, and
    Patrick Totzke. “History-Deterministic Timed Automata.” <i>Logical Methods in
    Computer Science</i>. EPI Sciences, 2024. <a href="https://doi.org/10.46298/lmcs-20(4:1)2024">https://doi.org/10.46298/lmcs-20(4:1)2024</a>.
  ieee: S. Bose, T. A. Henzinger, K. Lehtinen, S. Schewe, and P. Totzke, “History-deterministic
    timed automata,” <i>Logical Methods in Computer Science</i>, vol. 20, no. 4. EPI
    Sciences, pp. 1–28, 2024.
  ista: Bose S, Henzinger TA, Lehtinen K, Schewe S, Totzke P. 2024. History-deterministic
    timed automata. Logical Methods in Computer Science. 20(4), 1–28.
  mla: Bose, Sougata, et al. “History-Deterministic Timed Automata.” <i>Logical Methods
    in Computer Science</i>, vol. 20, no. 4, EPI Sciences, 2024, pp. 1–28, doi:<a
    href="https://doi.org/10.46298/lmcs-20(4:1)2024">10.46298/lmcs-20(4:1)2024</a>.
  short: S. Bose, T.A. Henzinger, K. Lehtinen, S. Schewe, P. Totzke, Logical Methods
    in Computer Science 20 (2024) 1–28.
corr_author: '1'
das_tickbox: '0'
date_created: 2024-11-10T23:02:01Z
date_published: 2024-10-02T00:00:00Z
date_updated: 2026-10-21T13:12:37Z
day: '02'
ddc:
- '000'
department:
- _id: ToHe
doi: 10.46298/lmcs-20(4:1)2024
ec_funded: 1
external_id:
  arxiv:
  - '2304.03183'
  isi:
  - '001332466900002'
file:
- access_level: open_access
  checksum: 26826786a960039b9501cfc5cb4f3fe6
  content_type: application/pdf
  creator: dernst
  date_created: 2024-11-11T08:32:02Z
  date_updated: 2024-11-11T08:32:02Z
  file_id: '18532'
  file_name: 2024_LMCS_Bose.pdf
  file_size: 563394
  relation: main_file
  success: 1
file_date_updated: 2024-11-11T08:32:02Z
fulldoi: https://doi.org/10.46298/lmcs-20(4:1)2024
has_accepted_license: '1'
intvolume: '        20'
isi: 1
issue: '4'
language:
- iso: eng
month: '10'
oa: 1
oa_version: Published Version
page: 1-28
project:
- _id: 62781420-2b32-11ec-9570-8d9b63373d4d
  call_identifier: H2020
  grant_number: '101020093'
  name: Vigilant Algorithmic Monitoring of Software
publication: Logical Methods in Computer Science
publication_identifier:
  eissn:
  - 1860-5974
publication_status: published
publisher: EPI Sciences
quality_controlled: '1'
related_material:
  record:
  - id: '12508'
    relation: earlier_version
    status: public
researchdata_availability: no
scopus_import: '1'
status: public
supplementarymaterial: no
title: History-deterministic timed automata
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: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 20
year: '2024'
...
---
OA_place: repository
OA_type: green
_id: '18955'
abstract:
- lang: eng
  text: We give a simple proof that assuming the Exponential Time Hypothesis (ETH),
    determining the winner of a Rabin game cannot be done in time 2o(k log k) · nO(1),
    where k is the number of pairs of vertex subsets involved in the winning condition
    and n is the vertex count of the game graph. While this result follows from the
    lower bounds provided by Calude et al [SIAM J. Comp. 2022], our reduction is considerably
    simpler and arguably provides more insight into the complexity of the problem.
    In fact, the analogous lower bounds discussed by Calude et al, for solving Muller
    games and multidimensional parity games, follow as simple corollaries of our approach.
    Our reduction also highlights the usefulness of a certain pivot problem — Permutation
    SAT — which may be of independent interest.
acknowledgement: This work is a part of projects CUTACOMBS (Ma. Pilipczuk), BOBR (Mi.
  Pilipczuk), and VAMOS (K. S. Thejaswini) that have received funding from the European
  Research Council (ERC) under the European Union's Horizon 2020 research and innovation
  programme, grant agreements No 714704, 948057, and 101020093, respectively. Ma.
  Pilipczuk is also partially supported by Polish National Science Centre SONATA BIS-12
  grant number 2022/46/E/ST6/00143.
article_processing_charge: No
arxiv: 1
author:
- first_name: Antonio
  full_name: Casares, Antonio
  last_name: Casares
- first_name: Marcin
  full_name: Pilipczuk, Marcin
  last_name: Pilipczuk
- first_name: Michał
  full_name: Pilipczuk, Michał
  last_name: Pilipczuk
- first_name: Uéverton S.
  full_name: Souza, Uéverton S.
  last_name: Souza
- first_name: K. S.
  full_name: Thejaswini, K. S.
  id: 3807fb92-fdc1-11ee-bb4a-b4d8a431c753
  last_name: Thejaswini
citation:
  ama: 'Casares A, Pilipczuk M, Pilipczuk M, Souza US, Thejaswini KS. Simple and tight
    complexity lower bounds for solving Rabin games. In: <i>2024 Symposium on Simplicity
    in Algorithms</i>. Society for Industrial and Applied Mathematics; 2024:160-167.
    doi:<a href="https://doi.org/10.1137/1.9781611977936.16">10.1137/1.9781611977936.16</a>'
  apa: 'Casares, A., Pilipczuk, M., Pilipczuk, M., Souza, U. S., &#38; Thejaswini,
    K. S. (2024). Simple and tight complexity lower bounds for solving Rabin games.
    In <i>2024 Symposium on Simplicity in Algorithms</i> (pp. 160–167). Alexandria,
    VA, United States: Society for Industrial and Applied Mathematics. <a href="https://doi.org/10.1137/1.9781611977936.16">https://doi.org/10.1137/1.9781611977936.16</a>'
  chicago: Casares, Antonio, Marcin Pilipczuk, Michał Pilipczuk, Uéverton S. Souza,
    and K. S. Thejaswini. “Simple and Tight Complexity Lower Bounds for Solving Rabin
    Games.” In <i>2024 Symposium on Simplicity in Algorithms</i>, 160–67. Society
    for Industrial and Applied Mathematics, 2024. <a href="https://doi.org/10.1137/1.9781611977936.16">https://doi.org/10.1137/1.9781611977936.16</a>.
  ieee: A. Casares, M. Pilipczuk, M. Pilipczuk, U. S. Souza, and K. S. Thejaswini,
    “Simple and tight complexity lower bounds for solving Rabin games,” in <i>2024
    Symposium on Simplicity in Algorithms</i>, Alexandria, VA, United States, 2024,
    pp. 160–167.
  ista: 'Casares A, Pilipczuk M, Pilipczuk M, Souza US, Thejaswini KS. 2024. Simple
    and tight complexity lower bounds for solving Rabin games. 2024 Symposium on Simplicity
    in Algorithms. SOSA: Symposium on Simplicity in Algorithms, 160–167.'
  mla: Casares, Antonio, et al. “Simple and Tight Complexity Lower Bounds for Solving
    Rabin Games.” <i>2024 Symposium on Simplicity in Algorithms</i>, Society for Industrial
    and Applied Mathematics, 2024, pp. 160–67, doi:<a href="https://doi.org/10.1137/1.9781611977936.16">10.1137/1.9781611977936.16</a>.
  short: A. Casares, M. Pilipczuk, M. Pilipczuk, U.S. Souza, K.S. Thejaswini, in:,
    2024 Symposium on Simplicity in Algorithms, Society for Industrial and Applied
    Mathematics, 2024, pp. 160–167.
conference:
  end_date: 2024-01-10
  location: Alexandria, VA, United States
  name: 'SOSA: Symposium on Simplicity in Algorithms'
  start_date: 2024-01-08
das_tickbox: '0'
date_created: 2025-01-29T11:55:50Z
date_published: 2024-01-01T00:00:00Z
date_updated: 2026-10-21T13:13:33Z
day: '01'
department:
- _id: ToHe
doi: 10.1137/1.9781611977936.16
ec_funded: 1
external_id:
  arxiv:
  - '2310.20433'
fulldoi: https://doi.org/10.1137/1.9781611977936.16
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://doi.org/10.48550/arXiv.2310.20433
month: '01'
oa: 1
oa_version: Preprint
page: 160-167
project:
- _id: 62781420-2b32-11ec-9570-8d9b63373d4d
  call_identifier: H2020
  grant_number: '101020093'
  name: Vigilant Algorithmic Monitoring of Software
publication: 2024 Symposium on Simplicity in Algorithms
publication_identifier:
  isbn:
  - '9781611977936'
publication_status: published
publisher: Society for Industrial and Applied Mathematics
quality_controlled: '1'
researchdata_availability: no
scopus_import: '1'
status: public
supplementarymaterial: no
title: Simple and tight complexity lower bounds for solving Rabin games
type: conference
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
year: '2024'
...
---
OA_type: closed access
_id: '18599'
abstract:
- lang: eng
  text: "Hypernode logic can reason about the prefix relation on stutter-reduced finite
    traces through the stutter-reduced prefix predicate. We increase the expressiveness
    of hypernode logic in two ways. First, we split the stutter-reduced prefix predicate
    into an explicit stutter-reduction operator and the classical prefix predicate
    on words. This change gives hypernode logic the ability to combine synchronous
    and asynchronous reasoning by explicitly stating which parts of traces can stutter.
    Second, we allow the use of regular expressions in formulas to reason about the
    structure of traces. This change enables hypernode logic to describe a mixture
    of trace properties and hyperproperties.\r\n\r\nWe show how to translate extended
    hypernode logic formulas into multi-track automata, which are automata that read
    multiple input words. Then we describe a fully online monitoring algorithm for
    monitoring k-safety hyperproperties specified in the logic. We have implemented
    the monitoring algorithm, and evaluated it on monitoring synchronous and asynchronous
    versions of observational determinism, and on checking the privacy preservation
    by compiler optimizations."
acknowledgement: This work was supported in part by the ERC-2020-AdG 101020093, and
  by the Austrian Science Fund (FWF) SFB project SpyCoDe F8502.
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Marek
  full_name: Chalupa, Marek
  id: 87e34708-d6c6-11ec-9f5b-9391e7be2463
  last_name: Chalupa
- first_name: Thomas A
  full_name: Henzinger, Thomas A
  id: 40876CD8-F248-11E8-B48F-1D18A9856A87
  last_name: Henzinger
  orcid: 0000-0002-2985-7724
- first_name: Ana
  full_name: Oliveira da Costa, Ana
  id: f347ec37-6676-11ee-b395-a888cb7b4fb4
  last_name: Oliveira da Costa
  orcid: 0000-0002-8741-5799
citation:
  ama: 'Chalupa M, Henzinger TA, Oliveira da Costa A. Monitoring extended hypernode
    logic. In: <i>Integrated Formal Methods</i>. Vol 15234. Springer Nature; 2024:151-171.
    doi:<a href="https://doi.org/10.1007/978-3-031-76554-4_9">10.1007/978-3-031-76554-4_9</a>'
  apa: Chalupa, M., Henzinger, T. A., &#38; Oliveira da Costa, A. (2024). Monitoring
    extended hypernode logic. In <i>Integrated Formal Methods</i> (Vol. 15234, pp.
    151–171). Springer Nature. <a href="https://doi.org/10.1007/978-3-031-76554-4_9">https://doi.org/10.1007/978-3-031-76554-4_9</a>
  chicago: Chalupa, Marek, Thomas A Henzinger, and Ana Oliveira da Costa. “Monitoring
    Extended Hypernode Logic.” In <i>Integrated Formal Methods</i>, 15234:151–71.
    Springer Nature, 2024. <a href="https://doi.org/10.1007/978-3-031-76554-4_9">https://doi.org/10.1007/978-3-031-76554-4_9</a>.
  ieee: M. Chalupa, T. A. Henzinger, and A. Oliveira da Costa, “Monitoring extended
    hypernode logic,” in <i>Integrated Formal Methods</i>, 2024, vol. 15234, pp. 151–171.
  ista: Chalupa M, Henzinger TA, Oliveira da Costa A. 2024. Monitoring extended hypernode
    logic. Integrated Formal Methods. , LNCS, vol. 15234, 151–171.
  mla: Chalupa, Marek, et al. “Monitoring Extended Hypernode Logic.” <i>Integrated
    Formal Methods</i>, vol. 15234, Springer Nature, 2024, pp. 151–71, doi:<a href="https://doi.org/10.1007/978-3-031-76554-4_9">10.1007/978-3-031-76554-4_9</a>.
  short: M. Chalupa, T.A. Henzinger, A. Oliveira da Costa, in:, Integrated Formal
    Methods, Springer Nature, 2024, pp. 151–171.
corr_author: '1'
das_tickbox: '0'
date_created: 2024-12-01T23:01:52Z
date_published: 2024-11-13T00:00:00Z
date_updated: 2026-10-21T13:13:13Z
day: '13'
department:
- _id: ToHe
doi: 10.1007/978-3-031-76554-4_9
ec_funded: 1
external_id:
  isi:
  - '001416640500009'
fulldoi: https://doi.org/10.1007/978-3-031-76554-4_9
intvolume: '     15234'
isi: 1
language:
- iso: eng
month: '11'
oa_version: None
page: 151-171
project:
- _id: 62781420-2b32-11ec-9570-8d9b63373d4d
  call_identifier: H2020
  grant_number: '101020093'
  name: Vigilant Algorithmic Monitoring of Software
- _id: 34a1b658-11ca-11ed-8bc3-c75229f0241e
  grant_number: F8502
  name: Interface Theory for Security and Privacy
publication: Integrated Formal Methods
publication_identifier:
  eissn:
  - 1611-3349
  isbn:
  - '9783031765537'
  issn:
  - 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
researchdata_availability: no
scopus_import: '1'
status: public
supplementarymaterial: no
title: Monitoring extended hypernode logic
type: conference
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 15234
year: '2024'
...
---
_id: '18177'
abstract:
- lang: eng
  text: Partially Specified Boolean Networks (PSBNs) represent a family of Boolean
    models resulting from possible interpretations of unknown update logics. Hybrid
    extension of CTL (HCTL) has the power to express complex dynamical phenomena,
    such as oscillations or stability. We present BNClassifier to classify Boolean
    Networks corresponding to a given PSBN according to criteria specified in HCTL.
    The implementation of the tool is fully symbolic (based on BDDs). The results
    are visualised using the machine-learning-based technology of decision trees.
acknowledgement: The work has been supported by the Czech Science Foundation grant
  No. GA22-10845S. This project has received funding from the European Union’s Horizon
  2020 research and innovation programme under the Marie Sklodowska-Curie Grant Agreement
  No. 101034413.
alternative_title:
- LNBI
article_processing_charge: No
author:
- first_name: Nikola
  full_name: Beneš, Nikola
  last_name: Beneš
- first_name: Luboš
  full_name: Brim, Luboš
  last_name: Brim
- first_name: Ondřej
  full_name: Huvar, Ondřej
  last_name: Huvar
- first_name: Samuel
  full_name: Pastva, Samuel
  id: 07c5ea74-f61c-11ec-a664-aa7c5d957b2b
  last_name: Pastva
  orcid: 0000-0003-1993-0331
- first_name: David
  full_name: Šafránek, David
  last_name: Šafránek
citation:
  ama: 'Beneš N, Brim L, Huvar O, Pastva S, Šafránek D. BNClassifier: Classifying
    boolean models by dynamic properties. In: <i>Computational Methods in Systems
    Biology</i>. Vol 14971. Springer Nature; 2024:19-26. doi:<a href="https://doi.org/10.1007/978-3-031-71671-3_2">10.1007/978-3-031-71671-3_2</a>'
  apa: 'Beneš, N., Brim, L., Huvar, O., Pastva, S., &#38; Šafránek, D. (2024). BNClassifier:
    Classifying boolean models by dynamic properties. In <i>Computational Methods
    in Systems Biology</i> (Vol. 14971, pp. 19–26). Springer Nature. <a href="https://doi.org/10.1007/978-3-031-71671-3_2">https://doi.org/10.1007/978-3-031-71671-3_2</a>'
  chicago: 'Beneš, Nikola, Luboš Brim, Ondřej Huvar, Samuel Pastva, and David Šafránek.
    “BNClassifier: Classifying Boolean Models by Dynamic Properties.” In <i>Computational
    Methods in Systems Biology</i>, 14971:19–26. Springer Nature, 2024. <a href="https://doi.org/10.1007/978-3-031-71671-3_2">https://doi.org/10.1007/978-3-031-71671-3_2</a>.'
  ieee: 'N. Beneš, L. Brim, O. Huvar, S. Pastva, and D. Šafránek, “BNClassifier: Classifying
    boolean models by dynamic properties,” in <i>Computational Methods in Systems
    Biology</i>, 2024, vol. 14971, pp. 19–26.'
  ista: 'Beneš N, Brim L, Huvar O, Pastva S, Šafránek D. 2024. BNClassifier: Classifying
    boolean models by dynamic properties. Computational Methods in Systems Biology.
    , LNBI, vol. 14971, 19–26.'
  mla: 'Beneš, Nikola, et al. “BNClassifier: Classifying Boolean Models by Dynamic
    Properties.” <i>Computational Methods in Systems Biology</i>, vol. 14971, Springer
    Nature, 2024, pp. 19–26, doi:<a href="https://doi.org/10.1007/978-3-031-71671-3_2">10.1007/978-3-031-71671-3_2</a>.'
  short: N. Beneš, L. Brim, O. Huvar, S. Pastva, D. Šafránek, in:, Computational Methods
    in Systems Biology, Springer Nature, 2024, pp. 19–26.
das_tickbox: '0'
date_created: 2024-10-06T22:01:12Z
date_published: 2024-09-19T00:00:00Z
date_updated: 2026-10-21T13:12:17Z
day: '19'
department:
- _id: ToHe
doi: 10.1007/978-3-031-71671-3_2
ec_funded: 1
external_id:
  isi:
  - '001333144400002'
fulldoi: https://doi.org/10.1007/978-3-031-71671-3_2
intvolume: '     14971'
isi: 1
language:
- iso: eng
month: '09'
oa_version: None
page: 19-26
project:
- _id: fc2ed2f7-9c52-11eb-aca3-c01059dda49c
  call_identifier: H2020
  grant_number: '101034413'
  name: 'IST-BRIDGE: International postdoctoral program'
publication: Computational Methods in Systems Biology
publication_identifier:
  eissn:
  - 1611-3349
  isbn:
  - '9783031716706'
  issn:
  - 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
researchdata_availability: no
scopus_import: '1'
status: public
supplementarymaterial: no
title: 'BNClassifier: Classifying boolean models by dynamic properties'
type: conference
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 14971
year: '2024'
...
---
OA_type: closed access
_id: '18563'
abstract:
- lang: eng
  text: I give a personal account about the wave of new research activities that rose
    in the 1990s on the specification, verification, and control of real-time systems.
acknowledgement: I thank all my collaborators over the years. None of the mentioned
  contributions would have been possible without them. I also apologize for all omissions.
  The selection of contributions in this essay reflects primarily my personal involvement
  rather than any measure of importance.
alternative_title:
- LNCS
article_processing_charge: No
author:
- 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: 'Henzinger TA. Reminiscences of a Real-Time Researcher. In: Graf S, Pettersson
    P, Steffen B, eds. <i>Real Time and Such</i>. Vol 15230. LNCS. Cham: Springer
    Nature; 2024:154-164. doi:<a href="https://doi.org/10.1007/978-3-031-73751-0_12">10.1007/978-3-031-73751-0_12</a>'
  apa: 'Henzinger, T. A. (2024). Reminiscences of a Real-Time Researcher. In S. Graf,
    P. Pettersson, &#38; B. Steffen (Eds.), <i>Real Time and Such</i> (Vol. 15230,
    pp. 154–164). Cham: Springer Nature. <a href="https://doi.org/10.1007/978-3-031-73751-0_12">https://doi.org/10.1007/978-3-031-73751-0_12</a>'
  chicago: 'Henzinger, Thomas A. “Reminiscences of a Real-Time Researcher.” In <i>Real
    Time and Such</i>, edited by Susanne Graf, Paul Pettersson, and Bernhard Steffen,
    15230:154–64. LNCS. Cham: Springer Nature, 2024. <a href="https://doi.org/10.1007/978-3-031-73751-0_12">https://doi.org/10.1007/978-3-031-73751-0_12</a>.'
  ieee: 'T. A. Henzinger, “Reminiscences of a Real-Time Researcher,” in <i>Real Time
    and Such</i>, vol. 15230, S. Graf, P. Pettersson, and B. Steffen, Eds. Cham: Springer
    Nature, 2024, pp. 154–164.'
  ista: 'Henzinger TA. 2024.Reminiscences of a Real-Time Researcher. In: Real Time
    and Such. LNCS, vol. 15230, 154–164.'
  mla: Henzinger, Thomas A. “Reminiscences of a Real-Time Researcher.” <i>Real Time
    and Such</i>, edited by Susanne Graf et al., vol. 15230, Springer Nature, 2024,
    pp. 154–64, doi:<a href="https://doi.org/10.1007/978-3-031-73751-0_12">10.1007/978-3-031-73751-0_12</a>.
  short: T.A. Henzinger, in:, S. Graf, P. Pettersson, B. Steffen (Eds.), Real Time
    and Such, Springer Nature, Cham, 2024, pp. 154–164.
corr_author: '1'
das_tickbox: '0'
date_created: 2024-11-18T09:10:06Z
date_published: 2024-10-23T00:00:00Z
date_updated: 2026-10-21T13:12:56Z
day: '23'
department:
- _id: ToHe
doi: 10.1007/978-3-031-73751-0_12
editor:
- first_name: Susanne
  full_name: Graf, Susanne
  last_name: Graf
- first_name: Paul
  full_name: Pettersson, Paul
  last_name: Pettersson
- first_name: Bernhard
  full_name: Steffen, Bernhard
  last_name: Steffen
fulldoi: https://doi.org/10.1007/978-3-031-73751-0_12
intvolume: '     15230'
language:
- iso: eng
month: '10'
oa_version: None
page: 154-164
place: Cham
publication: Real Time and Such
publication_identifier:
  eisbn:
  - '9783031737510'
  eissn:
  - 1611-3349
  isbn:
  - '9783031737503'
  issn:
  - 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
researchdata_availability: no
scopus_import: '1'
series_title: LNCS
status: public
supplementarymaterial: no
title: Reminiscences of a Real-Time Researcher
type: book_chapter
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 15230
year: '2024'
...
---
_id: '15168'
abstract:
- lang: eng
  text: 'A linearly ordered (LO) k-colouring of a hypergraph is a colouring of its
    vertices with colours 1, … , k such that each edge contains a unique maximal colour.
    Deciding whether an input hypergraph admits LO k-colouring with a fixed number
    of colours is NP-complete (and in the special case of graphs, LO colouring coincides
    with the usual graph colouring). Here, we investigate the complexity of approximating
    the "linearly ordered chromatic number" of a hypergraph. We prove that the following
    promise problem is NP-complete: Given a 3-uniform hypergraph, distinguish between
    the case that it is LO 3-colourable, and the case that it is not even LO 4-colourable.
    We prove this result by a combination of algebraic, topological, and combinatorial
    methods, building on and extending a topological approach for studying approximate
    graph colouring introduced by Krokhin, Opršal, Wrochna, and Živný (2023).'
acknowledgement: "Marek Filakovský: This research was supported by Charles University
  (project PRIMUS/\r\n21/SCI/014), the Austrian Science Fund (FWF project P31312-N35),
  and MSCAfellow5_MUNI\r\n(CZ.02.01.01/00/22_010/0003229). Tamio-Vesa Nakajima: This
  research was funded by UKRI EP/X024431/1 and by a Clarendon Fund Scholarship. All
  data is provided in full in the results section of this paper. Jakub Opršal: This
  project has received funding from the European Union’s Horizon 2020 research and
  innovation programme under the Marie Skłodowska-Curie Grant Agreement No 101034413.
  Uli Wagner: This research was supported by the Austrian Science Fund (FWF project
  P31312-N35)."
alternative_title:
- LIPIcs
article_number: '34'
article_processing_charge: No
arxiv: 1
author:
- first_name: Marek
  full_name: Filakovský, Marek
  id: 3E8AF77E-F248-11E8-B48F-1D18A9856A87
  last_name: Filakovský
- first_name: Tamio Vesa
  full_name: Nakajima, Tamio Vesa
  last_name: Nakajima
- 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: Gianluca
  full_name: Tasinato, Gianluca
  id: 0433290C-AF8F-11E9-A4C7-F729E6697425
  last_name: Tasinato
- first_name: Uli
  full_name: Wagner, Uli
  id: 36690CA2-F248-11E8-B48F-1D18A9856A87
  last_name: Wagner
  orcid: 0000-0002-1494-0568
citation:
  ama: 'Filakovský M, Nakajima TV, Opršal J, Tasinato G, Wagner U. Hardness of linearly
    ordered 4-colouring of 3-colourable 3-uniform hypergraphs. In: <i>41st International
    Symposium on Theoretical Aspects of Computer Science</i>. Vol 289. Schloss Dagstuhl
    - Leibniz-Zentrum für Informatik; 2024. doi:<a href="https://doi.org/10.4230/LIPIcs.STACS.2024.34">10.4230/LIPIcs.STACS.2024.34</a>'
  apa: 'Filakovský, M., Nakajima, T. V., Opršal, J., Tasinato, G., &#38; Wagner, U.
    (2024). Hardness of linearly ordered 4-colouring of 3-colourable 3-uniform hypergraphs.
    In <i>41st International Symposium on Theoretical Aspects of Computer Science</i>
    (Vol. 289). Clermont-Ferrand, France: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
    <a href="https://doi.org/10.4230/LIPIcs.STACS.2024.34">https://doi.org/10.4230/LIPIcs.STACS.2024.34</a>'
  chicago: Filakovský, Marek, Tamio Vesa Nakajima, Jakub Opršal, Gianluca Tasinato,
    and Uli Wagner. “Hardness of Linearly Ordered 4-Colouring of 3-Colourable 3-Uniform
    Hypergraphs.” In <i>41st International Symposium on Theoretical Aspects of Computer
    Science</i>, Vol. 289. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024.
    <a href="https://doi.org/10.4230/LIPIcs.STACS.2024.34">https://doi.org/10.4230/LIPIcs.STACS.2024.34</a>.
  ieee: M. Filakovský, T. V. Nakajima, J. Opršal, G. Tasinato, and U. Wagner, “Hardness
    of linearly ordered 4-colouring of 3-colourable 3-uniform hypergraphs,” in <i>41st
    International Symposium on Theoretical Aspects of Computer Science</i>, Clermont-Ferrand,
    France, 2024, vol. 289.
  ista: 'Filakovský M, Nakajima TV, Opršal J, Tasinato G, Wagner U. 2024. Hardness
    of linearly ordered 4-colouring of 3-colourable 3-uniform hypergraphs. 41st International
    Symposium on Theoretical Aspects of Computer Science. STACS: Symposium on Theoretical
    Aspects of Computer Science, LIPIcs, vol. 289, 34.'
  mla: Filakovský, Marek, et al. “Hardness of Linearly Ordered 4-Colouring of 3-Colourable
    3-Uniform Hypergraphs.” <i>41st International Symposium on Theoretical Aspects
    of Computer Science</i>, vol. 289, 34, Schloss Dagstuhl - Leibniz-Zentrum für
    Informatik, 2024, doi:<a href="https://doi.org/10.4230/LIPIcs.STACS.2024.34">10.4230/LIPIcs.STACS.2024.34</a>.
  short: M. Filakovský, T.V. Nakajima, J. Opršal, G. Tasinato, U. Wagner, in:, 41st
    International Symposium on Theoretical Aspects of Computer Science, Schloss Dagstuhl
    - Leibniz-Zentrum für Informatik, 2024.
conference:
  end_date: 2024-03-14
  location: Clermont-Ferrand, France
  name: 'STACS: Symposium on Theoretical Aspects of Computer Science'
  start_date: 2024-03-12
corr_author: '1'
das_tickbox: '0'
date_created: 2024-03-24T23:00:59Z
date_published: 2024-03-01T00:00:00Z
date_updated: 2026-10-21T13:23:55Z
day: '01'
ddc:
- '510'
department:
- _id: UlWa
doi: 10.4230/LIPIcs.STACS.2024.34
ec_funded: 1
external_id:
  arxiv:
  - '2312.12981'
  isi:
  - '001300393400034'
file:
- access_level: open_access
  checksum: 0524d4189fd1ed08989546511343edf3
  content_type: application/pdf
  creator: dernst
  date_created: 2024-03-25T07:44:30Z
  date_updated: 2024-03-25T07:44:30Z
  file_id: '15175'
  file_name: 2024_LIPICs_Filakovsky.pdf
  file_size: 927290
  relation: main_file
  success: 1
file_date_updated: 2024-03-25T07:44:30Z
fulldoi: https://doi.org/10.4230/LIPIcs.STACS.2024.34
has_accepted_license: '1'
intvolume: '       289'
isi: 1
language:
- iso: eng
month: '03'
oa: 1
oa_version: Published Version
project:
- _id: 26611F5C-B435-11E9-9278-68D0E5697425
  call_identifier: FWF
  grant_number: P31312
  name: Algorithms for Embeddings and Homotopy Theory
- _id: fc2ed2f7-9c52-11eb-aca3-c01059dda49c
  call_identifier: H2020
  grant_number: '101034413'
  name: 'IST-BRIDGE: International postdoctoral program'
publication: 41st International Symposium on Theoretical Aspects of Computer Science
publication_identifier:
  eissn:
  - 1868-8969
  isbn:
  - '9783959773119'
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
quality_controlled: '1'
related_material:
  record:
  - id: '22247'
    relation: later_version
    status: public
  - id: '20339'
    relation: dissertation_contains
    status: public
researchdata_availability: yes
scopus_import: '1'
status: public
supplementarymaterial: yes
title: Hardness of linearly ordered 4-colouring of 3-colourable 3-uniform hypergraphs
tmp:
  image: /images/cc_by.png
  legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
  name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
  short: CC BY (4.0)
type: conference
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 289
year: '2024'
...
---
OA_place: publisher
OA_type: hybrid
_id: '9651'
abstract:
- lang: eng
  text: We introduce a hierachy of equivalence relations on the set of separated nets
    of a given Euclidean space, indexed by concave increasing functions ϕ:(0,∞)→(0,∞).
    Two separated nets are called ϕ-displacement equivalent if, roughly speaking,
    there is a bijection between them which, for large radii R, displaces points of
    norm at most R by something of order at most ϕ(R). We show that the spectrum of
    ϕ-displacement equivalence spans from the established notion of bounded displacement
    equivalence, which corresponds to bounded ϕ, to the indiscrete equivalence relation,
    coresponding to ϕ(R)∈Ω(R), in which all separated nets are equivalent. In between
    the two ends of this spectrum, the notions of ϕ-displacement equivalence are shown
    to be pairwise distinct with respect to the asymptotic classes of ϕ(R) for R→∞.
    We further undertake a comparison of our notion of ϕ-displacement equivalence
    with previously studied relations on separated nets. Particular attention is given
    to the interaction of the notions of ϕ-displacement equivalence with that of bilipschitz
    equivalence.
acknowledgement: 'Open access funding provided by Institute of Science and Technology
  (IST Austria). This work was started while both authors were employed at the University
  of Innsbruck and enjoyed the full support of Austrian Science Fund (FWF): P 30902-N35.
  It was continued when the first named author was employed at University of Leipzig
  and the second named author was employed at Institute of Science and Technology
  of Austria, where he was supported by an IST Fellowship.'
article_number: '15'
article_processing_charge: Yes (via OA deal)
article_type: original
arxiv: 1
author:
- first_name: Michael
  full_name: Dymond, Michael
  last_name: Dymond
- first_name: Vojtech
  full_name: Kaluza, Vojtech
  id: 21AE5134-9EAC-11EA-BEA2-D7BD3DDC885E
  last_name: Kaluza
  orcid: 0000-0002-2512-8698
citation:
  ama: Dymond M, Kaluza V. Divergence of separated nets with respect to displacement
    equivalence. <i>Geometriae Dedicata</i>. 2024;218. doi:<a href="https://doi.org/10.1007/s10711-023-00862-3">10.1007/s10711-023-00862-3</a>
  apa: Dymond, M., &#38; Kaluza, V. (2024). Divergence of separated nets with respect
    to displacement equivalence. <i>Geometriae Dedicata</i>. Springer Nature. <a href="https://doi.org/10.1007/s10711-023-00862-3">https://doi.org/10.1007/s10711-023-00862-3</a>
  chicago: Dymond, Michael, and Vojtech Kaluza. “Divergence of Separated Nets with
    Respect to Displacement Equivalence.” <i>Geometriae Dedicata</i>. Springer Nature,
    2024. <a href="https://doi.org/10.1007/s10711-023-00862-3">https://doi.org/10.1007/s10711-023-00862-3</a>.
  ieee: M. Dymond and V. Kaluza, “Divergence of separated nets with respect to displacement
    equivalence,” <i>Geometriae Dedicata</i>, vol. 218. Springer Nature, 2024.
  ista: Dymond M, Kaluza V. 2024. Divergence of separated nets with respect to displacement
    equivalence. Geometriae Dedicata. 218, 15.
  mla: Dymond, Michael, and Vojtech Kaluza. “Divergence of Separated Nets with Respect
    to Displacement Equivalence.” <i>Geometriae Dedicata</i>, vol. 218, 15, Springer
    Nature, 2024, doi:<a href="https://doi.org/10.1007/s10711-023-00862-3">10.1007/s10711-023-00862-3</a>.
  short: M. Dymond, V. Kaluza, Geometriae Dedicata 218 (2024).
corr_author: '1'
das_tickbox: '1'
dataavailabilitystatement: Data sharing not applicable to this article as no datasets
  were generated or analysed during the current study.
date_created: 2021-07-14T07:01:27Z
date_published: 2024-02-01T00:00:00Z
date_updated: 2026-10-21T13:22:57Z
day: '01'
ddc:
- '510'
department:
- _id: UlWa
doi: 10.1007/s10711-023-00862-3
external_id:
  arxiv:
  - '2102.13046'
  isi:
  - '001105681500001'
  pmid:
  - '38021107'
file:
- access_level: open_access
  checksum: 9418534ac2f3d6f1f091a8b8ccaed01e
  content_type: application/pdf
  creator: dernst
  date_created: 2024-07-16T10:14:13Z
  date_updated: 2024-07-16T10:14:13Z
  file_id: '17257'
  file_name: 2024_GeometriaeDedicata_Dymond.pdf
  file_size: 540981
  relation: main_file
  success: 1
file_date_updated: 2024-07-16T10:14:13Z
fulldoi: https://doi.org/10.1007/s10711-023-00862-3
has_accepted_license: '1'
intvolume: '       218'
isi: 1
language:
- iso: eng
month: '02'
oa: 1
oa_version: Published Version
pmid: 1
publication: Geometriae Dedicata
publication_identifier:
  eissn:
  - 1572-9168
  issn:
  - 0046-5755
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
researchdata_availability: not applicable
scopus_import: '1'
status: public
supplementarymaterial: no
title: Divergence of separated nets with respect to displacement equivalence
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: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 218
year: '2024'
...
---
_id: '14660'
abstract:
- lang: eng
  text: "The classical Steinitz theorem states that if the origin belongs to the interior
    of the convex hull of a set \U0001D446⊂ℝ\U0001D451, then there are at most 2\U0001D451
    points of \U0001D446 whose convex hull contains the origin in the interior. Bárány,
    Katchalski,and Pach proved the following quantitative version of Steinitz’s theorem.
    Let \U0001D444 be a convex polytope in ℝ\U0001D451 containing the standard Euclidean
    unit ball \U0001D401\U0001D451. Then there exist at most 2\U0001D451 vertices
    of \U0001D444 whose convex hull \U0001D444′ satisfies \U0001D45F\U0001D401\U0001D451⊂\U0001D444′
    with \U0001D45F⩾\U0001D451−2\U0001D451. They conjectured that \U0001D45F⩾\U0001D450\U0001D451−1∕2
    holds with a universal constant \U0001D450>0. We prove \U0001D45F⩾15\U0001D4512,
    the first polynomial lower bound on \U0001D45F. Furthermore, we show that \U0001D45F
    is not greater than 2/√\U0001D451."
acknowledgement: M.N. was supported by the János Bolyai Scholarship of the Hungarian
  Academy of Sciences aswell as the National Research, Development and Innovation
  Fund (NRDI) grants K119670 andK131529, and the ÚNKP-22-5 New National Excellence
  Program of the Ministry for Innovationand Technology from the source of the NRDI
  as well as the ELTE TKP 2021-NKTA-62 fundingscheme
article_processing_charge: Yes (via OA deal)
article_type: original
arxiv: 1
author:
- first_name: Grigory
  full_name: Ivanov, Grigory
  id: 87744F66-5C6F-11EA-AFE0-D16B3DDC885E
  last_name: Ivanov
  orcid: 0000-0002-5021-3982
- first_name: Márton
  full_name: Naszódi, Márton
  last_name: Naszódi
citation:
  ama: 'Ivanov G, Naszódi M. Quantitative Steinitz theorem: A polynomial bound. <i>Bulletin
    of the London Mathematical Society</i>. 2024;56(2):796-802. doi:<a href="https://doi.org/10.1112/blms.12965">10.1112/blms.12965</a>'
  apa: 'Ivanov, G., &#38; Naszódi, M. (2024). Quantitative Steinitz theorem: A polynomial
    bound. <i>Bulletin of the London Mathematical Society</i>. London Mathematical
    Society. <a href="https://doi.org/10.1112/blms.12965">https://doi.org/10.1112/blms.12965</a>'
  chicago: 'Ivanov, Grigory, and Márton Naszódi. “Quantitative Steinitz Theorem: A
    Polynomial Bound.” <i>Bulletin of the London Mathematical Society</i>. London
    Mathematical Society, 2024. <a href="https://doi.org/10.1112/blms.12965">https://doi.org/10.1112/blms.12965</a>.'
  ieee: 'G. Ivanov and M. Naszódi, “Quantitative Steinitz theorem: A polynomial bound,”
    <i>Bulletin of the London Mathematical Society</i>, vol. 56, no. 2. London Mathematical
    Society, pp. 796–802, 2024.'
  ista: 'Ivanov G, Naszódi M. 2024. Quantitative Steinitz theorem: A polynomial bound.
    Bulletin of the London Mathematical Society. 56(2), 796–802.'
  mla: 'Ivanov, Grigory, and Márton Naszódi. “Quantitative Steinitz Theorem: A Polynomial
    Bound.” <i>Bulletin of the London Mathematical Society</i>, vol. 56, no. 2, London
    Mathematical Society, 2024, pp. 796–802, doi:<a href="https://doi.org/10.1112/blms.12965">10.1112/blms.12965</a>.'
  short: G. Ivanov, M. Naszódi, Bulletin of the London Mathematical Society 56 (2024)
    796–802.
corr_author: '1'
das_tickbox: '0'
date_created: 2023-12-10T23:00:58Z
date_published: 2024-02-01T00:00:00Z
date_updated: 2026-10-21T13:23:20Z
day: '01'
ddc:
- '510'
department:
- _id: UlWa
doi: 10.1112/blms.12965
external_id:
  arxiv:
  - '2212.04308'
  isi:
  - '001113277100001'
file:
- access_level: open_access
  checksum: 30ea0694757bc668cf7cd15ae357b35e
  content_type: application/pdf
  creator: dernst
  date_created: 2024-07-16T10:35:10Z
  date_updated: 2024-07-16T10:35:10Z
  file_id: '17259'
  file_name: 2024_BulletinLondonMathSoc_Ivanov.pdf
  file_size: 111756
  relation: main_file
  success: 1
file_date_updated: 2024-07-16T10:35:10Z
fulldoi: https://doi.org/10.1112/blms.12965
has_accepted_license: '1'
intvolume: '        56'
isi: 1
issue: '2'
language:
- iso: eng
month: '02'
oa: 1
oa_version: Published Version
page: 796-802
publication: Bulletin of the London Mathematical Society
publication_identifier:
  eissn:
  - 1469-2120
  issn:
  - 0024-6093
publication_status: published
publisher: London Mathematical Society
quality_controlled: '1'
researchdata_availability: no
scopus_import: '1'
status: public
supplementarymaterial: no
title: 'Quantitative Steinitz theorem: A polynomial bound'
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: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 56
year: '2024'
...
---
OA_place: publisher
OA_type: hybrid
_id: '18617'
abstract:
- lang: eng
  text: "Any complex-valued polynomial on (Rn)k decomposes into an algebraic combination
    of O(n)-invariant polynomials and harmonic polynomials. This decomposition, separation
    of variables, is granted to be unique if n≥2k−1. We prove that the condition n≥2k−1
    is not only sufficient, but also necessary for uniqueness of the separation. Moreover,
    we describe the structure of non-uniqueness of the separation in the boundary
    cases when n=2k−2 and n=2k−3.\r\nFormally, we study the kernel of a multiplication
    map ϕ carrying out separation of variables. We devise a general algorithmic procedure
    for describing Ker ϕ in the restricted non-stable range k≤n<2k−1. In the full
    non-stable range n<2k−1, we give formulas for highest weights of generators of
    the kernel as well as formulas for its Hilbert series. Using the developed methods,
    we obtain a list of highest weight vectors generating Ker ϕ."
acknowledgement: The author is sincerely grateful for guidance, advice and valuable
  feedback from Roman Lávička.
article_processing_charge: Yes (via OA deal)
article_type: original
arxiv: 1
author:
- first_name: Daniel
  full_name: Beďatš, Daniel
  id: 78ea3cc9-31e7-11ee-aa02-a6169bbfe1f1
  last_name: Beďatš
  orcid: 0009-0004-1828-0044
citation:
  ama: Beďatš D. Separation of variables for scalar-valued polynomials in the non-stable
    range. <i>Journal of Algebra</i>. 2024;651:281-304. doi:<a href="https://doi.org/10.1016/j.jalgebra.2024.04.013">10.1016/j.jalgebra.2024.04.013</a>
  apa: Beďatš, D. (2024). Separation of variables for scalar-valued polynomials in
    the non-stable range. <i>Journal of Algebra</i>. Elsevier. <a href="https://doi.org/10.1016/j.jalgebra.2024.04.013">https://doi.org/10.1016/j.jalgebra.2024.04.013</a>
  chicago: Beďatš, Daniel. “Separation of Variables for Scalar-Valued Polynomials
    in the Non-Stable Range.” <i>Journal of Algebra</i>. Elsevier, 2024. <a href="https://doi.org/10.1016/j.jalgebra.2024.04.013">https://doi.org/10.1016/j.jalgebra.2024.04.013</a>.
  ieee: D. Beďatš, “Separation of variables for scalar-valued polynomials in the non-stable
    range,” <i>Journal of Algebra</i>, vol. 651. Elsevier, pp. 281–304, 2024.
  ista: Beďatš D. 2024. Separation of variables for scalar-valued polynomials in the
    non-stable range. Journal of Algebra. 651, 281–304.
  mla: Beďatš, Daniel. “Separation of Variables for Scalar-Valued Polynomials in the
    Non-Stable Range.” <i>Journal of Algebra</i>, vol. 651, Elsevier, 2024, pp. 281–304,
    doi:<a href="https://doi.org/10.1016/j.jalgebra.2024.04.013">10.1016/j.jalgebra.2024.04.013</a>.
  short: D. Beďatš, Journal of Algebra 651 (2024) 281–304.
corr_author: '1'
das_tickbox: '1'
dataavailabilitystatement: "No data was used for the research described in the article.\r\n"
date_created: 2024-12-04T07:58:45Z
date_published: 2024-08-01T00:00:00Z
date_updated: 2026-10-21T13:24:58Z
day: '01'
ddc:
- '510'
department:
- _id: UlWa
doi: 10.1016/j.jalgebra.2024.04.013
external_id:
  arxiv:
  - '2309.11154'
  isi:
  - '001232775600001'
file:
- access_level: open_access
  checksum: 7b01c89128ba16d5334dfab389a03878
  content_type: application/pdf
  creator: dernst
  date_created: 2024-12-09T13:56:26Z
  date_updated: 2024-12-09T13:56:26Z
  file_id: '18638'
  file_name: 2024_JourAlgebra_Bedats.pdf
  file_size: 486969
  relation: main_file
  success: 1
file_date_updated: 2024-12-09T13:56:26Z
fulldoi: https://doi.org/10.1016/j.jalgebra.2024.04.013
has_accepted_license: '1'
intvolume: '       651'
isi: 1
language:
- iso: eng
month: '08'
oa: 1
oa_version: Published Version
page: 281-304
publication: Journal of Algebra
publication_identifier:
  issn:
  - 0021-8693
publication_status: published
publisher: Elsevier
quality_controlled: '1'
researchdata_availability: not applicable
scopus_import: '1'
status: public
supplementarymaterial: no
title: Separation of variables for scalar-valued polynomials in the non-stable range
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: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 651
year: '2024'
...
---
OA_place: repository
OA_type: green
_id: '13974'
abstract:
- lang: eng
  text: The Tverberg theorem is one of the cornerstones of discrete geometry. It states
    that, given a set X of at least (d+1)(r−1)+1 points in Rd, one can find a partition
    X=X1∪⋯∪Xr of X, such that the convex hulls of the Xi, i=1,…,r, all share a common
    point. In this paper, we prove a trengthening of this theorem that guarantees
    a partition which, in addition to the above, has the property that the boundaries
    of full-dimensional convex hulls have pairwise nonempty intersections. Possible
    generalizations and algorithmic aspects are also discussed. As a concrete application,
    we show that any n points in the plane in general position span ⌊n/3⌋ vertex-disjoint
    triangles that are pairwise crossing, meaning that their boundaries have pairwise
    nonempty intersections; this number is clearly best possible. A previous result
    of Álvarez-Rebollar et al. guarantees ⌊n/6⌋pairwise crossing triangles. Our result
    generalizes to a result about simplices in Rd, d≥2.
acknowledgement: "Part of the research leading to this paper was done during the 16th
  Gremo Workshop on Open Problems (GWOP), Waltensburg, Switzerland, June 12–16, 2018.
  We thank Patrick Schnider for suggesting the problem, and Stefan Felsner, Malte
  Milatz, and Emo Welzl for fruitful discussions during the workshop. We also thank
  Stefan Felsner and Manfred Scheucher for finding, communicating the example from
  Sect. 3.3, and the kind permission to include their visualization of the point set.
  We thank Dömötör Pálvölgyi, the SoCG reviewers, and DCG reviewers for various helpful
  comments.\r\nR. Fulek gratefully acknowledges support from Austrian Science Fund
  (FWF), Project  M2281-N35. A. Kupavskii was supported by the Advanced Postdoc.Mobility
  Grant no. P300P2_177839 of the Swiss National Science Foundation. Research by P.
  Valtr was supported by the Grant no. 18-19158 S of the Czech Science Foundation
  (GAČR)."
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Radoslav
  full_name: Fulek, Radoslav
  id: 39F3FFE4-F248-11E8-B48F-1D18A9856A87
  last_name: Fulek
  orcid: 0000-0001-8485-1774
- first_name: Bernd
  full_name: Gärtner, Bernd
  last_name: Gärtner
- first_name: Andrey
  full_name: Kupavskii, Andrey
  last_name: Kupavskii
- first_name: Pavel
  full_name: Valtr, Pavel
  last_name: Valtr
- first_name: Uli
  full_name: Wagner, Uli
  id: 36690CA2-F248-11E8-B48F-1D18A9856A87
  last_name: Wagner
  orcid: 0000-0002-1494-0568
citation:
  ama: Fulek R, Gärtner B, Kupavskii A, Valtr P, Wagner U. The crossing Tverberg theorem.
    <i>Discrete and Computational Geometry</i>. 2024;72:831-848. doi:<a href="https://doi.org/10.1007/s00454-023-00532-x">10.1007/s00454-023-00532-x</a>
  apa: Fulek, R., Gärtner, B., Kupavskii, A., Valtr, P., &#38; Wagner, U. (2024).
    The crossing Tverberg theorem. <i>Discrete and Computational Geometry</i>. Springer
    Nature. <a href="https://doi.org/10.1007/s00454-023-00532-x">https://doi.org/10.1007/s00454-023-00532-x</a>
  chicago: Fulek, Radoslav, Bernd Gärtner, Andrey Kupavskii, Pavel Valtr, and Uli
    Wagner. “The Crossing Tverberg Theorem.” <i>Discrete and Computational Geometry</i>.
    Springer Nature, 2024. <a href="https://doi.org/10.1007/s00454-023-00532-x">https://doi.org/10.1007/s00454-023-00532-x</a>.
  ieee: R. Fulek, B. Gärtner, A. Kupavskii, P. Valtr, and U. Wagner, “The crossing
    Tverberg theorem,” <i>Discrete and Computational Geometry</i>, vol. 72. Springer
    Nature, pp. 831–848, 2024.
  ista: Fulek R, Gärtner B, Kupavskii A, Valtr P, Wagner U. 2024. The crossing Tverberg
    theorem. Discrete and Computational Geometry. 72, 831–848.
  mla: Fulek, Radoslav, et al. “The Crossing Tverberg Theorem.” <i>Discrete and Computational
    Geometry</i>, vol. 72, Springer Nature, 2024, pp. 831–48, doi:<a href="https://doi.org/10.1007/s00454-023-00532-x">10.1007/s00454-023-00532-x</a>.
  short: R. Fulek, B. Gärtner, A. Kupavskii, P. Valtr, U. Wagner, Discrete and Computational
    Geometry 72 (2024) 831–848.
das_tickbox: '0'
date_created: 2023-08-06T22:01:12Z
date_published: 2024-09-01T00:00:00Z
date_updated: 2026-10-21T13:25:18Z
day: '01'
department:
- _id: UlWa
doi: 10.1007/s00454-023-00532-x
external_id:
  arxiv:
  - '1812.04911'
  isi:
  - '001038546500001'
fulldoi: https://doi.org/10.1007/s00454-023-00532-x
intvolume: '        72'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://doi.org/10.48550/arXiv.1812.04911
month: '09'
oa: 1
oa_version: Preprint
page: 831-848
project:
- _id: 261FA626-B435-11E9-9278-68D0E5697425
  call_identifier: FWF
  grant_number: M02281
  name: Eliminating intersections in drawings of graphs
publication: Discrete and Computational Geometry
publication_identifier:
  eissn:
  - 1432-0444
  issn:
  - 0179-5376
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
related_material:
  record:
  - id: '6647'
    relation: earlier_version
    status: public
researchdata_availability: no
scopus_import: '1'
status: public
supplementarymaterial: no
title: The crossing Tverberg theorem
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 72
year: '2024'
...
---
_id: '15296'
abstract:
- lang: eng
  text: In this paper we build a constructive algorithm that returns a rectifiable
    curve that connects two points in a weakly convex set in a Hilbert space. We have
    proven that this algorithm converges and obtained an estimate on the curve’s length
    and compare the length of the curve obtained to known results.
article_number: '080002'
article_processing_charge: No
author:
- first_name: Mariana
  full_name: Lopushanski, Mariana
  last_name: Lopushanski
- first_name: Grigory
  full_name: Ivanov, Grigory
  id: 87744F66-5C6F-11EA-AFE0-D16B3DDC885E
  last_name: Ivanov
  orcid: 0000-0002-5021-3982
citation:
  ama: 'Lopushanski M, Ivanov G. A constructive algorithm for building rectifiable
    curves in weakly convex sets. In: <i>AIP Conference Proceedings</i>. Vol 3030.
    AIP Publishing; 2024. doi:<a href="https://doi.org/10.1063/5.0195908">10.1063/5.0195908</a>'
  apa: 'Lopushanski, M., &#38; Ivanov, G. (2024). A constructive algorithm for building
    rectifiable curves in weakly convex sets. In <i>AIP Conference Proceedings</i>
    (Vol. 3030). Virtual: AIP Publishing. <a href="https://doi.org/10.1063/5.0195908">https://doi.org/10.1063/5.0195908</a>'
  chicago: Lopushanski, Mariana, and Grigory Ivanov. “A Constructive Algorithm for
    Building Rectifiable Curves in Weakly Convex Sets.” In <i>AIP Conference Proceedings</i>,
    Vol. 3030. AIP Publishing, 2024. <a href="https://doi.org/10.1063/5.0195908">https://doi.org/10.1063/5.0195908</a>.
  ieee: M. Lopushanski and G. Ivanov, “A constructive algorithm for building rectifiable
    curves in weakly convex sets,” in <i>AIP Conference Proceedings</i>, Virtual,
    2024, vol. 3030, no. 1.
  ista: 'Lopushanski M, Ivanov G. 2024. A constructive algorithm for building rectifiable
    curves in weakly convex sets. AIP Conference Proceedings. ICCMSE: International
    Conference of Computational Methods in Sciences and Engiineering vol. 3030, 080002.'
  mla: Lopushanski, Mariana, and Grigory Ivanov. “A Constructive Algorithm for Building
    Rectifiable Curves in Weakly Convex Sets.” <i>AIP Conference Proceedings</i>,
    vol. 3030, no. 1, 080002, AIP Publishing, 2024, doi:<a href="https://doi.org/10.1063/5.0195908">10.1063/5.0195908</a>.
  short: M. Lopushanski, G. Ivanov, in:, AIP Conference Proceedings, AIP Publishing,
    2024.
conference:
  end_date: 2022-10-29
  location: Virtual
  name: 'ICCMSE: International Conference of Computational Methods in Sciences and
    Engiineering'
  start_date: 2022-10-26
date_created: 2024-04-07T22:00:55Z
date_published: 2024-03-14T00:00:00Z
date_updated: 2026-10-21T13:24:14Z
day: '14'
department:
- _id: UlWa
doi: 10.1063/5.0195908
fulldoi: https://doi.org/10.1063/5.0195908
intvolume: '      3030'
issue: '1'
language:
- iso: eng
month: '03'
oa_version: None
publication: AIP Conference Proceedings
publication_identifier:
  eissn:
  - 1551-7616
  issn:
  - 0094-243X
publication_status: published
publisher: AIP Publishing
quality_controlled: '1'
researchdata_availability: unclear
scopus_import: '1'
status: public
supplementarymaterial: unclear
title: A constructive algorithm for building rectifiable curves in weakly convex sets
type: conference
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 3030
year: '2024'
...
---
OA_place: publisher
OA_type: gold
_id: '18917'
abstract:
- lang: eng
  text: "An eight-partition of a finite set of points (respectively, of a continuous
    mass distribution) in ℝ³ consists of three planes that divide the space into 8
    octants, such that each open octant contains at most 1/8 of the points (respectively,
    of the mass). In 1966, Hadwiger showed that any mass distribution in ℝ³ admits
    an eight-partition; moreover, one can prescribe the normal direction of one of
    the three planes. The analogous result for finite point sets follows by a standard
    limit argument.\r\nWe prove the following variant of this result: Any mass distribution
    (or point set) in ℝ³ admits an eight-partition for which the intersection of two
    of the planes is a line with a prescribed direction.\r\nMoreover, we present an
    efficient algorithm for calculating an eight-partition of a set of n points in
    ℝ³ (with prescribed normal direction of one of the planes) in time O^*(n^{5/2})."
acknowledgement: "Aronov, Boris: Work has been supported by NSF grants CCF 15-40656
  and CCF 20-08551, and by grant 2014/170 from the US-Israel Binational Science Foundation.
  Part of this research was conducted while BA was visiting ISTA in the summers of
  2022 and 2023. The visit of BA to ISTA in the summer of 2022 was supported by an
  ISTA Visiting Professorship.\r\nBasit, Abdul: Work has been supported by Australian
  Research Council grant DP220102212.\r\nRamesh, Indu: Work supported by a Tandon
  School of Engineering Fellowship and by NSF Grant CCF-20-08551.\r\nBA and AB would
  like to thank William Steiger for insightful initial discussions of the problems
  addressed in this work."
article_processing_charge: Yes
arxiv: 1
author:
- first_name: Boris
  full_name: Aronov, Boris
  last_name: Aronov
- first_name: Abdul
  full_name: Basit, Abdul
  last_name: Basit
- first_name: Indu
  full_name: Ramesh, Indu
  last_name: Ramesh
- first_name: Gianluca
  full_name: Tasinato, Gianluca
  id: 0433290C-AF8F-11E9-A4C7-F729E6697425
  last_name: Tasinato
- first_name: Uli
  full_name: Wagner, Uli
  id: 36690CA2-F248-11E8-B48F-1D18A9856A87
  last_name: Wagner
  orcid: 0000-0002-1494-0568
citation:
  ama: 'Aronov B, Basit A, Ramesh I, Tasinato G, Wagner U. Eight-partitioning points
    in 3D, and efficiently too. In: <i>40th International Symposium on Computational
    Geometry</i>. Vol 293. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2024:8:1-8:15.
    doi:<a href="https://doi.org/10.4230/LIPIcs.SoCG.2024.8">10.4230/LIPIcs.SoCG.2024.8</a>'
  apa: 'Aronov, B., Basit, A., Ramesh, I., Tasinato, G., &#38; Wagner, U. (2024).
    Eight-partitioning points in 3D, and efficiently too. In <i>40th International
    Symposium on Computational Geometry</i> (Vol. 293, p. 8:1-8:15). Athens, Greece:
    Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href="https://doi.org/10.4230/LIPIcs.SoCG.2024.8">https://doi.org/10.4230/LIPIcs.SoCG.2024.8</a>'
  chicago: Aronov, Boris, Abdul Basit, Indu Ramesh, Gianluca Tasinato, and Uli Wagner.
    “Eight-Partitioning Points in 3D, and Efficiently Too.” In <i>40th International
    Symposium on Computational Geometry</i>, 293:8:1-8:15. Schloss Dagstuhl - Leibniz-Zentrum
    für Informatik, 2024. <a href="https://doi.org/10.4230/LIPIcs.SoCG.2024.8">https://doi.org/10.4230/LIPIcs.SoCG.2024.8</a>.
  ieee: B. Aronov, A. Basit, I. Ramesh, G. Tasinato, and U. Wagner, “Eight-partitioning
    points in 3D, and efficiently too,” in <i>40th International Symposium on Computational
    Geometry</i>, Athens, Greece, 2024, vol. 293, p. 8:1-8:15.
  ista: 'Aronov B, Basit A, Ramesh I, Tasinato G, Wagner U. 2024. Eight-partitioning
    points in 3D, and efficiently too. 40th International Symposium on Computational
    Geometry. SoCG: Symposium on Computational Geometry vol. 293, 8:1-8:15.'
  mla: Aronov, Boris, et al. “Eight-Partitioning Points in 3D, and Efficiently Too.”
    <i>40th International Symposium on Computational Geometry</i>, vol. 293, Schloss
    Dagstuhl - Leibniz-Zentrum für Informatik, 2024, p. 8:1-8:15, doi:<a href="https://doi.org/10.4230/LIPIcs.SoCG.2024.8">10.4230/LIPIcs.SoCG.2024.8</a>.
  short: B. Aronov, A. Basit, I. Ramesh, G. Tasinato, U. Wagner, in:, 40th International
    Symposium on Computational Geometry, Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
    2024, p. 8:1-8:15.
conference:
  end_date: 2024-06-14
  location: Athens, Greece
  name: 'SoCG: Symposium on Computational Geometry'
  start_date: 2024-06-11
corr_author: '1'
das_tickbox: '0'
date_created: 2025-01-27T14:19:17Z
date_published: 2024-06-06T00:00:00Z
date_updated: 2026-10-21T13:38:17Z
day: '06'
ddc:
- '510'
department:
- _id: UlWa
- _id: GradSch
doi: 10.4230/LIPIcs.SoCG.2024.8
external_id:
  arxiv:
  - '2403.02627'
file:
- access_level: open_access
  checksum: 443aa29ea5d948e917cfccd681dcf176
  content_type: application/pdf
  creator: dernst
  date_created: 2025-01-27T14:17:37Z
  date_updated: 2025-01-27T14:17:37Z
  file_id: '18918'
  file_name: 2024_LIPICs_Aronov.pdf
  file_size: 880725
  relation: main_file
  success: 1
file_date_updated: 2025-01-27T14:17:37Z
fulldoi: https://doi.org/10.4230/LIPIcs.SoCG.2024.8
has_accepted_license: '1'
intvolume: '       293'
language:
- iso: eng
month: '06'
oa: 1
oa_version: Published Version
page: 8:1-8:15
publication: 40th International Symposium on Computational Geometry
publication_identifier:
  isbn:
  - '9783959773164'
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
quality_controlled: '1'
related_material:
  record:
  - id: '19860'
    relation: later_version
    status: public
researchdata_availability: no
scopus_import: '1'
status: public
supplementarymaterial: no
title: Eight-partitioning points in 3D, and efficiently too
tmp:
  image: /images/cc_by.png
  legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
  name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
  short: CC BY (4.0)
type: conference
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 293
year: '2024'
...
---
OA_place: publisher
OA_type: hybrid
_id: '18483'
abstract:
- lang: eng
  text: In this paper we prove a perturbative version of a remarkable Bialy–Mironov
    (Ann. Math. 196(1):389–413, 2022) result. They prove non perturbative Birkhoff
    conjecture for centrally-symmetric convex domains, namely, a centrally-symmetric
    convex domain with integrable billiard is ellipse. We combine techniques from
    Bialy–Mironov (Ann. Math. 196(1):389–413, 2022) with a local result by Kaloshin–Sorrentino
    (Ann. Math. 188(1):315–380, 2018) and show that a domain close enough to a centrally
    symmetric one with integrable billiard is ellipse. To combine these results we
    derive a slight extension of Bialy–Mironov (Ann. Math. 196(1):389–413, 2022) by
    proving that a notion of rational integrability is equivalent to the C0-integrability
    condition used in their paper.
acknowledgement: We are grateful to the anonymous referee for their careful reading
  and valuable remarks and comments which helped to improve significantly the paper.
  Open access funding provided by Institute of Science and Technology (IST Austria).
  V.K. and C.E.K. gratefully acknowledge support from the European Research Council
  (ERC) through the Advanced Grant “SPERIG” (#885 707).
article_processing_charge: Yes (via OA deal)
article_type: original
arxiv: 1
author:
- first_name: Vadim
  full_name: Kaloshin, Vadim
  id: FE553552-CDE8-11E9-B324-C0EBE5697425
  last_name: Kaloshin
  orcid: 0000-0002-6051-2628
- first_name: Edmond
  full_name: Koudjinan, Edmond
  id: 52DF3E68-AEFA-11EA-95A4-124A3DDC885E
  last_name: Koudjinan
  orcid: 0000-0003-2640-4049
- first_name: Ke
  full_name: Zhang, Ke
  last_name: Zhang
citation:
  ama: Kaloshin V, Koudjinan E, Zhang K. Birkhoff conjecture for nearly centrally
    symmetric domains. <i>Geometric and Functional Analysis</i>. 2024;34:1973-2007.
    doi:<a href="https://doi.org/10.1007/s00039-024-00695-6">10.1007/s00039-024-00695-6</a>
  apa: Kaloshin, V., Koudjinan, E., &#38; Zhang, K. (2024). Birkhoff conjecture for
    nearly centrally symmetric domains. <i>Geometric and Functional Analysis</i>.
    Springer Nature. <a href="https://doi.org/10.1007/s00039-024-00695-6">https://doi.org/10.1007/s00039-024-00695-6</a>
  chicago: Kaloshin, Vadim, Edmond Koudjinan, and Ke Zhang. “Birkhoff Conjecture for
    Nearly Centrally Symmetric Domains.” <i>Geometric and Functional Analysis</i>.
    Springer Nature, 2024. <a href="https://doi.org/10.1007/s00039-024-00695-6">https://doi.org/10.1007/s00039-024-00695-6</a>.
  ieee: V. Kaloshin, E. Koudjinan, and K. Zhang, “Birkhoff conjecture for nearly centrally
    symmetric domains,” <i>Geometric and Functional Analysis</i>, vol. 34. Springer
    Nature, pp. 1973–2007, 2024.
  ista: Kaloshin V, Koudjinan E, Zhang K. 2024. Birkhoff conjecture for nearly centrally
    symmetric domains. Geometric and Functional Analysis. 34, 1973–2007.
  mla: Kaloshin, Vadim, et al. “Birkhoff Conjecture for Nearly Centrally Symmetric
    Domains.” <i>Geometric and Functional Analysis</i>, vol. 34, Springer Nature,
    2024, pp. 1973–2007, doi:<a href="https://doi.org/10.1007/s00039-024-00695-6">10.1007/s00039-024-00695-6</a>.
  short: V. Kaloshin, E. Koudjinan, K. Zhang, Geometric and Functional Analysis 34
    (2024) 1973–2007.
corr_author: '1'
das_tickbox: '0'
date_created: 2024-10-27T23:01:45Z
date_published: 2024-12-01T00:00:00Z
date_updated: 2026-10-21T13:44:48Z
day: '01'
ddc:
- '510'
department:
- _id: VaKa
doi: 10.1007/s00039-024-00695-6
ec_funded: 1
external_id:
  arxiv:
  - '2306.12301'
  isi:
  - '001329804200001'
file:
- access_level: open_access
  checksum: e7fcd9f78beb40408c7d858ac0625e27
  content_type: application/pdf
  creator: dernst
  date_created: 2025-01-13T09:14:24Z
  date_updated: 2025-01-13T09:14:24Z
  file_id: '18833'
  file_name: 2024_GeometricFunctionalAnalysis_Kaloshin.pdf
  file_size: 2260980
  relation: main_file
  success: 1
file_date_updated: 2025-01-13T09:14:24Z
fulldoi: https://doi.org/10.1007/s00039-024-00695-6
has_accepted_license: '1'
intvolume: '        34'
isi: 1
language:
- iso: eng
month: '12'
oa: 1
oa_version: Published Version
page: 1973-2007
project:
- _id: 9B8B92DE-BA93-11EA-9121-9846C619BF3A
  call_identifier: H2020
  grant_number: '885707'
  name: Spectral rigidity and integrability for billiards and geodesic flows
publication: Geometric and Functional Analysis
publication_identifier:
  eissn:
  - 1420-8970
  issn:
  - 1016-443X
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
researchdata_availability: no
scopus_import: '1'
status: public
supplementarymaterial: no
title: Birkhoff conjecture for nearly centrally symmetric domains
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: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 34
year: '2024'
...
---
OA_place: publisher
OA_type: hybrid
_id: '18065'
abstract:
- lang: eng
  text: We establish a close connection between acceleration and dynamical degree
    for one-frequency quasi-periodic compact cocycles, by showing that two vectors
    derived separately from each coincide. Based on this, we provide a dynamical classification
    of one-frequency quasi-periodic  SO(3, R)-cocycles.
acknowledgement: "X. Hou is partially supported by National Natural Science Foundation
  of China (Grant \r\n12071083) and Funds for Distinguished Youths of Hubei Province
  of China (\r\n2019CFA680). Y. Pan is supported by ERC Advanced Grant (#885707).
  Q. Zhou is partially supported by National Key R&D Program of China (2020YFA0713300),
  NSFC grant (\r\n12071232) and Nankai Zhide Foundation."
article_number: '109943'
article_processing_charge: Yes (via OA deal)
article_type: original
arxiv: 1
author:
- first_name: Xuanji
  full_name: Hou, Xuanji
  last_name: Hou
- first_name: Yi
  full_name: Pan, Yi
  id: 1e21c7f7-9070-11eb-847d-8b04c7169523
  last_name: Pan
- first_name: Qi
  full_name: Zhou, Qi
  last_name: Zhou
citation:
  ama: Hou X, Pan Y, Zhou Q. Dynamical classification of analytic one-frequency quasi-periodic
    SO(3,R)-cocycles. <i>Advances in Mathematics</i>. 2024;457. doi:<a href="https://doi.org/10.1016/j.aim.2024.109943">10.1016/j.aim.2024.109943</a>
  apa: Hou, X., Pan, Y., &#38; Zhou, Q. (2024). Dynamical classification of analytic
    one-frequency quasi-periodic SO(3,R)-cocycles. <i>Advances in Mathematics</i>.
    Elsevier. <a href="https://doi.org/10.1016/j.aim.2024.109943">https://doi.org/10.1016/j.aim.2024.109943</a>
  chicago: Hou, Xuanji, Yi Pan, and Qi Zhou. “Dynamical Classification of Analytic
    One-Frequency Quasi-Periodic SO(3,R)-Cocycles.” <i>Advances in Mathematics</i>.
    Elsevier, 2024. <a href="https://doi.org/10.1016/j.aim.2024.109943">https://doi.org/10.1016/j.aim.2024.109943</a>.
  ieee: X. Hou, Y. Pan, and Q. Zhou, “Dynamical classification of analytic one-frequency
    quasi-periodic SO(3,R)-cocycles,” <i>Advances in Mathematics</i>, vol. 457. Elsevier,
    2024.
  ista: Hou X, Pan Y, Zhou Q. 2024. Dynamical classification of analytic one-frequency
    quasi-periodic SO(3,R)-cocycles. Advances in Mathematics. 457, 109943.
  mla: Hou, Xuanji, et al. “Dynamical Classification of Analytic One-Frequency Quasi-Periodic
    SO(3,R)-Cocycles.” <i>Advances in Mathematics</i>, vol. 457, 109943, Elsevier,
    2024, doi:<a href="https://doi.org/10.1016/j.aim.2024.109943">10.1016/j.aim.2024.109943</a>.
  short: X. Hou, Y. Pan, Q. Zhou, Advances in Mathematics 457 (2024).
corr_author: '1'
das_tickbox: '0'
date_created: 2024-09-15T22:01:39Z
date_published: 2024-11-01T00:00:00Z
date_updated: 2026-10-21T13:44:19Z
day: '01'
ddc:
- '510'
department:
- _id: VaKa
doi: 10.1016/j.aim.2024.109943
ec_funded: 1
external_id:
  arxiv:
  - '2311.17537'
  isi:
  - '001315306500001'
file:
- access_level: open_access
  checksum: 1c80b844a91d93cf4799f4a65873b18d
  content_type: application/pdf
  creator: dernst
  date_created: 2025-01-13T08:29:27Z
  date_updated: 2025-01-13T08:29:27Z
  file_id: '18826'
  file_name: 2024_AdvancesMath_Hou.pdf
  file_size: 713659
  relation: main_file
  success: 1
file_date_updated: 2025-01-13T08:29:27Z
fulldoi: https://doi.org/10.1016/j.aim.2024.109943
has_accepted_license: '1'
intvolume: '       457'
isi: 1
language:
- iso: eng
month: '11'
oa: 1
oa_version: Published Version
project:
- _id: 9B8B92DE-BA93-11EA-9121-9846C619BF3A
  call_identifier: H2020
  grant_number: '885707'
  name: Spectral rigidity and integrability for billiards and geodesic flows
publication: Advances in Mathematics
publication_identifier:
  eissn:
  - 1090-2082
  issn:
  - 0001-8708
publication_status: published
publisher: Elsevier
quality_controlled: '1'
researchdata_availability: no
scopus_import: '1'
status: public
supplementarymaterial: no
title: Dynamical classification of analytic one-frequency quasi-periodic SO(3,R)-cocycles
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: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 457
year: '2024'
...
---
DOAJ_listed: '1'
OA_place: publisher
OA_type: gold
_id: '18604'
abstract:
- lang: eng
  text: 'A face in a curve arrangement is called popular if it is bounded by the same
    curve multiple times. Motivated by the automatic generation of curved nonogram
    puzzles, we investigate possibilities to eliminate the popular faces in an arrangement
    by inserting a single additional curve. This turns out to be NP-hard; however,
    it becomes tractable when the number of popular faces is small: We present a randomized
    FPT-time algorithm where the parameter is the number of popular faces.'
acknowledgement: "This work was initiated at the 16th European Research Week on Geometric
  Graphs in Strobl in 2019. A.W. has been supported by the Austrian Science Fund (FWF):
  W1230. S.T. has been funded by the Vienna Science and Technology Fund (WWTF) [10.47379/ICT19035]
  and by the NWO Gravitation project NETWORKS under grant no. 024.002.003. Part of
  the work was done while A.W. was emplyed at Graz University of Technology. Preliminary
  versions of this work have been presented at the 38th European Workshop on Computational
  Geometry (EuroCG\r\n2022) in Perugia [10] and at the 31st International Symposium
  on Graph Drawing and Network Visualization (GD 2023) in Isola delle Femmine [11]."
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Phoebe
  full_name: De Nooijer, Phoebe
  last_name: De Nooijer
- first_name: Soeren
  full_name: Terziadis, Soeren
  last_name: Terziadis
- first_name: Alexandra
  full_name: Weinberger, Alexandra
  last_name: Weinberger
- first_name: Zuzana
  full_name: Masárová, Zuzana
  id: 45CFE238-F248-11E8-B48F-1D18A9856A87
  last_name: Masárová
  orcid: 0000-0002-6660-1322
- first_name: Tamara
  full_name: Mchedlidze, Tamara
  last_name: Mchedlidze
- first_name: Maarten
  full_name: Löffler, Maarten
  last_name: Löffler
- first_name: Günter
  full_name: Rote, Günter
  last_name: Rote
citation:
  ama: De Nooijer P, Terziadis S, Weinberger A, et al. Removing popular faces in curve
    arrangements. <i>Journal of Graph Algorithms and Applications</i>. 2024;28(2):47-82.
    doi:<a href="https://doi.org/10.7155/jgaa.v28i2.2988">10.7155/jgaa.v28i2.2988</a>
  apa: De Nooijer, P., Terziadis, S., Weinberger, A., Masárová, Z., Mchedlidze, T.,
    Löffler, M., &#38; Rote, G. (2024). Removing popular faces in curve arrangements.
    <i>Journal of Graph Algorithms and Applications</i>. Brown University. <a href="https://doi.org/10.7155/jgaa.v28i2.2988">https://doi.org/10.7155/jgaa.v28i2.2988</a>
  chicago: De Nooijer, Phoebe, Soeren Terziadis, Alexandra Weinberger, Zuzana Masárová,
    Tamara Mchedlidze, Maarten Löffler, and Günter Rote. “Removing Popular Faces in
    Curve Arrangements.” <i>Journal of Graph Algorithms and Applications</i>. Brown
    University, 2024. <a href="https://doi.org/10.7155/jgaa.v28i2.2988">https://doi.org/10.7155/jgaa.v28i2.2988</a>.
  ieee: P. De Nooijer <i>et al.</i>, “Removing popular faces in curve arrangements,”
    <i>Journal of Graph Algorithms and Applications</i>, vol. 28, no. 2. Brown University,
    pp. 47–82, 2024.
  ista: De Nooijer P, Terziadis S, Weinberger A, Masárová Z, Mchedlidze T, Löffler
    M, Rote G. 2024. Removing popular faces in curve arrangements. Journal of Graph
    Algorithms and Applications. 28(2), 47–82.
  mla: De Nooijer, Phoebe, et al. “Removing Popular Faces in Curve Arrangements.”
    <i>Journal of Graph Algorithms and Applications</i>, vol. 28, no. 2, Brown University,
    2024, pp. 47–82, doi:<a href="https://doi.org/10.7155/jgaa.v28i2.2988">10.7155/jgaa.v28i2.2988</a>.
  short: P. De Nooijer, S. Terziadis, A. Weinberger, Z. Masárová, T. Mchedlidze, M.
    Löffler, G. Rote, Journal of Graph Algorithms and Applications 28 (2024) 47–82.
corr_author: '1'
das_tickbox: '0'
date_created: 2024-12-01T23:01:54Z
date_published: 2024-11-03T00:00:00Z
date_updated: 2026-10-21T13:41:35Z
day: '03'
ddc:
- '510'
department:
- _id: UlWa
- _id: HeEd
doi: 10.7155/jgaa.v28i2.2988
external_id:
  arxiv:
  - '2202.12175'
file:
- access_level: open_access
  checksum: be611da6f9d790dc980d6fb7283fe889
  content_type: application/pdf
  creator: dernst
  date_created: 2024-12-03T09:45:00Z
  date_updated: 2024-12-03T09:45:00Z
  file_id: '18609'
  file_name: 2024_JourGraphAlgorithms_deNooijer.pdf
  file_size: 1582493
  relation: main_file
  success: 1
file_date_updated: 2024-12-03T09:45:00Z
fulldoi: https://doi.org/10.7155/jgaa.v28i2.2988
has_accepted_license: '1'
intvolume: '        28'
issue: '2'
language:
- iso: eng
month: '11'
oa: 1
oa_version: Published Version
page: 47-82
publication: Journal of Graph Algorithms and Applications
publication_identifier:
  issn:
  - 1526-1719
publication_status: published
publisher: Brown University
quality_controlled: '1'
researchdata_availability: no
scopus_import: '1'
status: public
supplementarymaterial: no
title: Removing popular faces in curve arrangements
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: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 28
year: '2024'
...
---
_id: '14888'
abstract:
- lang: eng
  text: 'A face in a curve arrangement is called popular if it is bounded by the same
    curve multiple times. Motivated by the automatic generation of curved nonogram
    puzzles, we investigate possibilities to eliminate the popular faces in an arrangement
    by inserting a single additional curve. This turns out to be NP-hard; however,
    it becomes tractable when the number of popular faces is small: We present a probabilistic
    FPT-approach in the number of popular faces.'
acknowledgement: 'This work was initiated at the 16th European Research Week on Geometric
  Graphs in Strobl in 2019. A.W. is supported by the Austrian Science Fund (FWF):
  W1230. S.T. has been funded by the Vienna Science and Technology Fund (WWTF) [10.47379/ICT19035].
  A preliminary version of this work has been presented at the 38th European Workshop
  on Computational Geometry (EuroCG 2022) in Perugia [9]. A full version of this paper,
  which includes appendices but is otherwise identical, is available as a technical
  report [10].'
alternative_title:
- LNCS
article_processing_charge: No
arxiv: 1
author:
- first_name: Phoebe
  full_name: De Nooijer, Phoebe
  last_name: De Nooijer
- first_name: Soeren
  full_name: Terziadis, Soeren
  last_name: Terziadis
- first_name: Alexandra
  full_name: Weinberger, Alexandra
  last_name: Weinberger
- first_name: Zuzana
  full_name: Masárová, Zuzana
  id: 45CFE238-F248-11E8-B48F-1D18A9856A87
  last_name: Masárová
  orcid: 0000-0002-6660-1322
- first_name: Tamara
  full_name: Mchedlidze, Tamara
  last_name: Mchedlidze
- first_name: Maarten
  full_name: Löffler, Maarten
  last_name: Löffler
- first_name: Günter
  full_name: Rote, Günter
  last_name: Rote
citation:
  ama: 'De Nooijer P, Terziadis S, Weinberger A, et al. Removing popular faces in curve
    arrangements. In: <i>31st International Symposium on Graph Drawing and Network
    Visualization</i>. Vol 14466. Springer Nature; 2024:18-33. doi:<a href="https://doi.org/10.1007/978-3-031-49275-4_2">10.1007/978-3-031-49275-4_2</a>'
  apa: 'De Nooijer, P., Terziadis, S., Weinberger, A., Masárová, Z., Mchedlidze, T.,
    Löffler, M., &#38; Rote, G. (2024). Removing popular faces in curve arrangements.
    In <i>31st International Symposium on Graph Drawing and Network Visualization</i>
    (Vol. 14466, pp. 18–33). Isola delle Femmine, Palermo, Italy: Springer Nature.
    <a href="https://doi.org/10.1007/978-3-031-49275-4_2">https://doi.org/10.1007/978-3-031-49275-4_2</a>'
  chicago: De Nooijer, Phoebe, Soeren Terziadis, Alexandra Weinberger, Zuzana Masárová,
    Tamara Mchedlidze, Maarten Löffler, and Günter Rote. “Removing Popular Faces in Curve
    Arrangements.” In <i>31st International Symposium on Graph Drawing and Network
    Visualization</i>, 14466:18–33. Springer Nature, 2024. <a href="https://doi.org/10.1007/978-3-031-49275-4_2">https://doi.org/10.1007/978-3-031-49275-4_2</a>.
  ieee: P. De Nooijer <i>et al.</i>, “Removing popular faces in curve arrangements,”
    in <i>31st International Symposium on Graph Drawing and Network Visualization</i>,
    Isola delle Femmine, Palermo, Italy, 2024, vol. 14466, pp. 18–33.
  ista: 'De Nooijer P, Terziadis S, Weinberger A, Masárová Z, Mchedlidze T, Löffler
    M, Rote G. 2024. Removing popular faces in curve arrangements. 31st International
    Symposium on Graph Drawing and Network Visualization. GD: Graph Drawing and Network
    Visualization, LNCS, vol. 14466, 18–33.'
  mla: De Nooijer, Phoebe, et al. “Removing Popular Faces in Curve Arrangements.”
    <i>31st International Symposium on Graph Drawing and Network Visualization</i>,
    vol. 14466, Springer Nature, 2024, pp. 18–33, doi:<a href="https://doi.org/10.1007/978-3-031-49275-4_2">10.1007/978-3-031-49275-4_2</a>.
  short: P. De Nooijer, S. Terziadis, A. Weinberger, Z. Masárová, T. Mchedlidze, M.
    Löffler, G. Rote, in:, 31st International Symposium on Graph Drawing and Network
    Visualization, Springer Nature, 2024, pp. 18–33.
conference:
  end_date: 2023-09-22
  location: Isola delle Femmine, Palermo, Italy
  name: 'GD: Graph Drawing and Network Visualization'
  start_date: 2023-09-20
das_tickbox: '0'
date_created: 2024-01-28T23:01:43Z
date_published: 2024-01-06T00:00:00Z
date_updated: 2026-10-21T13:41:13Z
day: '06'
department:
- _id: UlWa
- _id: HeEd
doi: 10.1007/978-3-031-49275-4_2
external_id:
  arxiv:
  - '2202.12175'
  isi:
  - '001207942000002'
fulldoi: https://doi.org/10.1007/978-3-031-49275-4_2
intvolume: '     14466'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://doi.org/10.48550/arXiv.2202.12175
month: '01'
oa: 1
oa_version: Preprint
page: 18-33
publication: 31st International Symposium on Graph Drawing and Network Visualization
publication_identifier:
  eissn:
  - 1611-3349
  isbn:
  - '9783031492747'
  issn:
  - 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
researchdata_availability: no
scopus_import: '1'
status: public
supplementarymaterial: no
title: Removing popular faces in curve arrangements
type: conference
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 14466
year: '2024'
...
---
OA_place: repository
OA_type: green
_id: '18586'
abstract:
- lang: eng
  text: "We prove the Central Limit Theorem and superpolynomial mixing for environment\r\nviewed
    from the particle process in quasi periodic Diophantine random environment. The
    main\r\ningredients are smoothness estimates for the solution of the Poisson equation
    and local limit asymptotics for certain accelerated walks."
acknowledgement: "ents. The authors are grateful to Agnieszka Zelerowicz and the anonymous
  referee\r\nfor useful comments. The first author is grateful to Minsung Kim for
  providing some references.\r\nThe first author has been supported by the European
  Union Horizon 2020 research and innovation programme under the Marie Sklodowska-Curie
  Grant Agreement No. 101034413. The second author has been supported by the NSF grant
  DMS 2246983."
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Klaudiusz S
  full_name: Czudek, Klaudiusz S
  id: 5c0e116e-803f-11ed-ab7e-90d572405f20
  last_name: Czudek
- first_name: Dmitry
  full_name: Dolgopyat, Dmitry
  last_name: Dolgopyat
citation:
  ama: CZUDEK KS, Dolgopyat D. The central limit theorem and rate of mixing for simple
    random walks on the circle. <i>Alea</i>. 2024;21(2):1853-1865. doi:<a href="https://doi.org/10.30757/ALEA.V21-70">10.30757/ALEA.V21-70</a>
  apa: CZUDEK, K. S., &#38; Dolgopyat, D. (2024). The central limit theorem and rate
    of mixing for simple random walks on the circle. <i>Alea</i>. Instituto Nacional
    de Matematica Pura e Aplicada. <a href="https://doi.org/10.30757/ALEA.V21-70">https://doi.org/10.30757/ALEA.V21-70</a>
  chicago: CZUDEK, Klaudiusz S, and Dmitry Dolgopyat. “The Central Limit Theorem and
    Rate of Mixing for Simple Random Walks on the Circle.” <i>Alea</i>. Instituto
    Nacional de Matematica Pura e Aplicada, 2024. <a href="https://doi.org/10.30757/ALEA.V21-70">https://doi.org/10.30757/ALEA.V21-70</a>.
  ieee: K. S. CZUDEK and D. Dolgopyat, “The central limit theorem and rate of mixing
    for simple random walks on the circle,” <i>Alea</i>, vol. 21, no. 2. Instituto
    Nacional de Matematica Pura e Aplicada, pp. 1853–1865, 2024.
  ista: CZUDEK KS, Dolgopyat D. 2024. The central limit theorem and rate of mixing
    for simple random walks on the circle. Alea. 21(2), 1853–1865.
  mla: CZUDEK, Klaudiusz S., and Dmitry Dolgopyat. “The Central Limit Theorem and
    Rate of Mixing for Simple Random Walks on the Circle.” <i>Alea</i>, vol. 21, no.
    2, Instituto Nacional de Matematica Pura e Aplicada, 2024, pp. 1853–65, doi:<a
    href="https://doi.org/10.30757/ALEA.V21-70">10.30757/ALEA.V21-70</a>.
  short: K.S. CZUDEK, D. Dolgopyat, Alea 21 (2024) 1853–1865.
das_tickbox: '0'
date_created: 2024-11-24T23:01:49Z
date_published: 2024-11-01T00:00:00Z
date_updated: 2026-10-21T13:43:04Z
day: '01'
department:
- _id: VaKa
doi: 10.30757/ALEA.V21-70
ec_funded: 1
external_id:
  arxiv:
  - '2404.11700'
  isi:
  - '001440992000003'
fulldoi: https://doi.org/10.30757/ALEA.V21-70
intvolume: '        21'
isi: 1
issue: '2'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: ' https://doi.org/10.48550/arXiv.2404.11700'
month: '11'
oa: 1
oa_version: Preprint
page: 1853-1865
project:
- _id: fc2ed2f7-9c52-11eb-aca3-c01059dda49c
  call_identifier: H2020
  grant_number: '101034413'
  name: 'IST-BRIDGE: International postdoctoral program'
publication: Alea
publication_identifier:
  issn:
  - 1980-0436
publication_status: published
publisher: Instituto Nacional de Matematica Pura e Aplicada
quality_controlled: '1'
researchdata_availability: no
scopus_import: '1'
status: public
supplementarymaterial: no
title: The central limit theorem and rate of mixing for simple random walks on the
  circle
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 21
year: '2024'
...
---
OA_type: free access
_id: '17231'
abstract:
- lang: eng
  text: In the class of projective billiards, which contains the usual billiards,
    we exhibit counter-examples to Ivrii's conjecture, which states that in any planar
    billiard with smooth boundary the set of periodic orbits has zero measure. The
    counter-examples are polygons admitting a 2-parameters family of n-periodic orbits,
    with n being either 3 or any even integer greater than 4.
article_processing_charge: No
article_type: original
author:
- first_name: Corentin
  full_name: Fiorebe, Corentin
  id: 06619f18-9070-11eb-847d-d1ee780bd88b
  last_name: Fiorebe
citation:
  ama: Fiorebe C. Examples of projective billiards with open sets of periodic orbits.
    <i>Discrete and Continuous Dynamical Systems- Series A</i>. 2024;44(11):3287-3301.
    doi:<a href="https://doi.org/10.3934/dcds.2024059">10.3934/dcds.2024059</a>
  apa: Fiorebe, C. (2024). Examples of projective billiards with open sets of periodic
    orbits. <i>Discrete and Continuous Dynamical Systems- Series A</i>. AIMS. <a href="https://doi.org/10.3934/dcds.2024059">https://doi.org/10.3934/dcds.2024059</a>
  chicago: Fiorebe, Corentin. “Examples of Projective Billiards with Open Sets of
    Periodic Orbits.” <i>Discrete and Continuous Dynamical Systems- Series A</i>.
    AIMS, 2024. <a href="https://doi.org/10.3934/dcds.2024059">https://doi.org/10.3934/dcds.2024059</a>.
  ieee: C. Fiorebe, “Examples of projective billiards with open sets of periodic orbits,”
    <i>Discrete and Continuous Dynamical Systems- Series A</i>, vol. 44, no. 11. AIMS,
    pp. 3287–3301, 2024.
  ista: Fiorebe C. 2024. Examples of projective billiards with open sets of periodic
    orbits. Discrete and Continuous Dynamical Systems- Series A. 44(11), 3287–3301.
  mla: Fiorebe, Corentin. “Examples of Projective Billiards with Open Sets of Periodic
    Orbits.” <i>Discrete and Continuous Dynamical Systems- Series A</i>, vol. 44,
    no. 11, AIMS, 2024, pp. 3287–301, doi:<a href="https://doi.org/10.3934/dcds.2024059">10.3934/dcds.2024059</a>.
  short: C. Fiorebe, Discrete and Continuous Dynamical Systems- Series A 44 (2024)
    3287–3301.
corr_author: '1'
das_tickbox: '0'
date_created: 2024-07-14T22:01:10Z
date_published: 2024-11-01T00:00:00Z
date_updated: 2026-10-21T13:43:42Z
day: '01'
ddc:
- '500'
department:
- _id: VaKa
doi: 10.3934/dcds.2024059
external_id:
  isi:
  - '001230091000001'
fulldoi: https://doi.org/10.3934/dcds.2024059
intvolume: '        44'
isi: 1
issue: '11'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://doi.org/10.3934/dcds.2024059
month: '11'
oa: 1
oa_version: Published Version
page: 3287-3301
publication: Discrete and Continuous Dynamical Systems- Series A
publication_identifier:
  eissn:
  - 1553-5231
  issn:
  - 1078-0947
publication_status: published
publisher: AIMS
quality_controlled: '1'
researchdata_availability: no
scopus_import: '1'
status: public
supplementarymaterial: no
title: Examples of projective billiards with open sets of periodic orbits
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 44
year: '2024'
...
---
DOAJ_listed: '1'
OA_place: publisher
OA_type: gold
_id: '18524'
abstract:
- lang: eng
  text: Recent works have constrained the binary fraction of evolved populations of
    massive stars in local galaxies such as red supergiants and Wolf–Rayet stars,
    but the binary fraction of yellow supergiants (YSGs) in the Hertzsprung gap remains
    unconstrained. Binary evolution theory predicts that the Hertzsprung gap is home
    to multiple populations of binary systems with varied evolutionary histories.
    In this paper, we develop a method to distinguish single YSGs from YSG plus O-
    or B-type main-sequence binaries using optical and ultraviolet photometry, and
    then apply this method to identify candidate YSG binaries in the Magellanic Clouds.
    After constructing a set of combined stellar atmosphere models, we find that optical
    photometry is, given typical measurement and reddening uncertainties, sufficient
    to discern single YSGs from YSG+OB binaries if the OB-star is at least ∼5M⊙ for
    Teff,YSG ∼ 4000 K, but requires a ∼20M⊙ OB star for YSGs up to Teff,YSG ∼ 9000
    K. For these hotter YSG temperatures, ultraviolet photometry allows binaries with
    OB companions as small as ∼7M⊙ to be identified. We use color–color spaces developed
    from these models to search for evidence of excess blue or ultraviolet light in
    a set of ∼1000 YSG candidates in the Magellanic Clouds. We identify hundreds of
    candidate YSG binary systems and report a preliminary fraction of YSGs that show
    a blue/UV color excess of 20%–60%. Spectroscopic follow-up is now required to
    confirm the true nature of this population.
acknowledgement: "The authors thank Aaron Tohuvavohu, Katie Breivik, Marten van Kerkwijk,
  Jakub Klencki, Eva Laplace, and Dae-Sik Moon for helpful discussions, and Adiv Paradise
  for helpful edits. The authors also thank the anonymous reviewer for a helpful and
  constructive referee report.\r\nThe authors at the University of Toronto acknowledge
  that the land on which the University of Toronto operates is the traditional territory
  of the Huron–Wendat, the Seneca, and the Mississaugas of the Credit River. They
  are grateful to have the opportunity to work on this land.\r\nThe Dunlap Institute
  is funded through an endowment established by the David Dunlap family and the University
  of Toronto.\r\nA.J.G.O. is supported by a McWilliams Fellowship at Carnegie Mellon
  University. M.R.D. acknowledges support from the NSERC through grant RGPIN-2019-06186,
  the Canada Research Chairs Program, and the Dunlap Institute at the University of
  Toronto. B.M.G. acknowledges the support of the Natural Sciences and Engineering
  Research Council of Canada (NSERC) through grant RGPIN-2022-03163, and of the Canada
  Research Chairs program. Support for this work was provided by NASA through the
  NASA Hubble Fellowship Program grant Nos. HST-HF2-51457.001-A and HST-HF2-51516
  awarded by the Space Telescope Science Institute, which is operated by the Association
  of Universities for Research in Astronomy, Inc., for NASA, under contract NAS5-26555.\r\nThis
  research has made use of the SIMBAD database (M. Wenger et al. 2000), operated at
  CDS, Strasbourg, France, and the SVO Filter Profile Service 13 supported by the
  Spanish MINECO through grant AYA2017-84089 (C. Rodrigo et al. 2012, 2020).\r\nThis
  research has made use of the following software: astropy (Astropy Collaboration
  et al. 2013, 2018, 2022), IRAF (D. Tody 1986, 1993), and TOPCAT (M. B. Taylor 2005)."
article_number: '29'
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Anna J.G.
  full_name: O’Grady, Anna J.G.
  last_name: O’Grady
- first_name: Maria R.
  full_name: Drout, Maria R.
  last_name: Drout
- first_name: Kathryn F.
  full_name: Neugent, Kathryn F.
  last_name: Neugent
- first_name: Bethany
  full_name: Ludwig, Bethany
  last_name: Ludwig
- first_name: Ylva Louise Linsdotter
  full_name: Götberg, Ylva Louise Linsdotter
  id: d0648d0c-0f64-11ee-a2e0-dd0faa2e4f7d
  last_name: Götberg
  orcid: 0000-0002-6960-6911
- first_name: B. M.
  full_name: Gaensler, B. M.
  last_name: Gaensler
citation:
  ama: O’Grady AJG, Drout MR, Neugent KF, Ludwig B, Götberg YLL, Gaensler BM. Binary
    yellow supergiants in the Magellanic Clouds. I. Photometric candidate identification.
    <i>Astrophysical Journal</i>. 2024;975. doi:<a href="https://doi.org/10.3847/1538-4357/ad778a">10.3847/1538-4357/ad778a</a>
  apa: O’Grady, A. J. G., Drout, M. R., Neugent, K. F., Ludwig, B., Götberg, Y. L.
    L., &#38; Gaensler, B. M. (2024). Binary yellow supergiants in the Magellanic
    Clouds. I. Photometric candidate identification. <i>Astrophysical Journal</i>.
    IOP Publishing. <a href="https://doi.org/10.3847/1538-4357/ad778a">https://doi.org/10.3847/1538-4357/ad778a</a>
  chicago: O’Grady, Anna J.G., Maria R. Drout, Kathryn F. Neugent, Bethany Ludwig,
    Ylva Louise Linsdotter Götberg, and B. M. Gaensler. “Binary Yellow Supergiants
    in the Magellanic Clouds. I. Photometric Candidate Identification.” <i>Astrophysical
    Journal</i>. IOP Publishing, 2024. <a href="https://doi.org/10.3847/1538-4357/ad778a">https://doi.org/10.3847/1538-4357/ad778a</a>.
  ieee: A. J. G. O’Grady, M. R. Drout, K. F. Neugent, B. Ludwig, Y. L. L. Götberg,
    and B. M. Gaensler, “Binary yellow supergiants in the Magellanic Clouds. I. Photometric
    candidate identification,” <i>Astrophysical Journal</i>, vol. 975. IOP Publishing,
    2024.
  ista: O’Grady AJG, Drout MR, Neugent KF, Ludwig B, Götberg YLL, Gaensler BM. 2024.
    Binary yellow supergiants in the Magellanic Clouds. I. Photometric candidate identification.
    Astrophysical Journal. 975, 29.
  mla: O’Grady, Anna J. G., et al. “Binary Yellow Supergiants in the Magellanic Clouds.
    I. Photometric Candidate Identification.” <i>Astrophysical Journal</i>, vol. 975,
    29, IOP Publishing, 2024, doi:<a href="https://doi.org/10.3847/1538-4357/ad778a">10.3847/1538-4357/ad778a</a>.
  short: A.J.G. O’Grady, M.R. Drout, K.F. Neugent, B. Ludwig, Y.L.L. Götberg, B.M.
    Gaensler, Astrophysical Journal 975 (2024).
das_tickbox: '0'
date_created: 2024-11-10T23:01:59Z
date_published: 2024-11-01T00:00:00Z
date_updated: 2026-10-21T13:51:22Z
day: '01'
ddc:
- '520'
department:
- _id: YlGo
doi: 10.3847/1538-4357/ad778a
external_id:
  arxiv:
  - '2406.17177'
  isi:
  - '001339486900001'
file:
- access_level: open_access
  checksum: 0e9bb88b5048ecc782ac27953c84b8ce
  content_type: application/pdf
  creator: dernst
  date_created: 2024-11-11T09:20:45Z
  date_updated: 2024-11-11T09:20:45Z
  file_id: '18535'
  file_name: 2024_AstrophysicalJour_Grady.pdf
  file_size: 34634395
  relation: main_file
  success: 1
file_date_updated: 2024-11-11T09:20:45Z
fulldoi: https://doi.org/10.3847/1538-4357/ad778a
has_accepted_license: '1'
intvolume: '       975'
isi: 1
language:
- iso: eng
month: '11'
oa: 1
oa_version: Published Version
publication: Astrophysical Journal
publication_identifier:
  eissn:
  - 1538-4357
  issn:
  - 0004-637X
publication_status: published
publisher: IOP Publishing
quality_controlled: '1'
researchdata_availability: no
scopus_import: '1'
status: public
supplementarymaterial: no
title: Binary yellow supergiants in the Magellanic Clouds. I. Photometric candidate
  identification
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: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 975
year: '2024'
...
