Zobrazeno 1 - 10
of 1 139
pro vyhledávání: '"Stephan,Frank"'
In the last years there has been a growing interest in the study of learning problems associated with algebraic structures. The framework we use models the scenario in which a learner is given larger and larger fragments of a structure from a given t
Externí odkaz:
http://arxiv.org/abs/2410.22933
The well-known $abc$-conjecture concerns triples $(a,b,c)$ of non-zero integers that are coprime and satisfy ${a+b+c=0}$. The strong $n$-conjecture is a generalisation to $n$ summands where integer solutions of the equation ${a_1 + \ldots + a_n = 0}$
Externí odkaz:
http://arxiv.org/abs/2409.13439
We continue the project of the study of reverse mathematics principles inspired by cardinal invariants. In this article in particular we focus on principles encapsulating the existence of large families of objects that are in some sense mutually inde
Externí odkaz:
http://arxiv.org/abs/2408.09796
This paper studies the recursion-theoretic aspects of large-scale geometries of infinite strings, a subject initiated by Khoussainov and Takisaka (2017). We investigate several notions of quasi-isometric reductions between recursive infinite strings
Externí odkaz:
http://arxiv.org/abs/2407.14105
Speedable numbers are real numbers which are algorithmically approximable from below and whose approximations can be accelerated nonuniformly. We begin this article by answering a question of Barmpalias by separating a strict subclass that we will re
Externí odkaz:
http://arxiv.org/abs/2404.15811
Autor:
Nies, Andre, Stephan, Frank
We consider word automaticity for groups that are nilpotent of class $2$ and have exponent a prime $p$. We show that the infinitely generated free group in this variety is not word automatic. In contrast, the infinite extra-special $p$-group $E_p$ is
Externí odkaz:
http://arxiv.org/abs/2302.12446
Autor:
Czerwiński, Wojciech, Dębski, Maciej, Gogasz, Tomasz, Hoi, Gordon, Jain, Sanjay, Skrzypczak, Michał, Stephan, Frank, Tan, Christopher
This paper studies the complexity of operations with finite automata and the complexity of their decision problems when the alphabet is unary. (1) This paper improves the upper bound of the equality problem of unary nondeterministic automata from an
Externí odkaz:
http://arxiv.org/abs/2302.06435
Publikováno v:
Theoretical Computer Science, 947 (2023) 113705
We construct a FA-presentation $\psi: L \rightarrow \mathbb{N}$ of the structure $(\mathbb{N};\mathrm{S})$ for which a numerical characteristic $r(n)$ defined as the maximum number $\psi(w)$ for all strings $w \in L$ of length less than or equal to $
Externí odkaz:
http://arxiv.org/abs/2302.01009
Autor:
Jürgen Hench, Claus Hultschig, Jon Brugger, Luigi Mariani, Raphael Guzman, Jehuda Soleman, Severina Leu, Miles Benton, Irenäus Maria Stec, Ivana Bratic Hench, Per Hoffmann, Patrick Harter, Katharina J Weber, Anne Albers, Christian Thomas, Martin Hasselblatt, Ulrich Schüller, Lisa Restelli, David Capper, Ekkehard Hewer, Joachim Diebold, Danijela Kolenc, Ulf C. Schneider, Elisabeth Rushing, Rosa della Monica, Lorenzo Chiariotti, Martin Sill, Daniel Schrimpf, Andreas von Deimling, Felix Sahm, Christian Kölsche, Markus Tolnay, Stephan Frank
Publikováno v:
Acta Neuropathologica Communications, Vol 12, Iss 1, Pp 1-16 (2024)
Abstract DNA methylation analysis based on supervised machine learning algorithms with static reference data, allowing diagnostic tumour typing with unprecedented precision, has quickly become a new standard of care. Whereas genome-wide diagnostic me
Externí odkaz:
https://doaj.org/article/0728b5481b5942bf8a38046de711832e
Autor:
Böhlen, Till Tobias, Psoroulas, Serena, Aylward, Jack D, Beddar, Sam, Douralis, Alexandros, Delpon, Grégory, Garibaldi, Cristina, Gasparini, Alessia, Schüler, Emil, Stephan, Frank, Moeckli, Raphaël, Subiel, Anna
Publikováno v:
In Radiotherapy and Oncology November 2024 200