---
_id: '58852'
abstract:
- lang: eng
text: "We study the asymptotic distribution of wildly ramified extensions of\r\nfunction
fields in characteristic $p > 2$, focusing on (certain) $p$-groups of\r\nnilpotency
class at most $2$. Rather than the discriminant, we count extensions\r\naccording
to an invariant describing the last jump in the ramification\r\nfiltration at
each place. We prove a local-global principle relating the\r\ndistribution of
extensions over global function fields to their distribution\r\nover local fields,
leading to an asymptotic formula for the number of\r\nextensions with a given
global last-jump invariant. A key ingredient is\r\nAbrashkin's nilpotent Artin-Schreier
theory, which lets us parametrize\r\nextensions and obtain bounds on the ramification
of local extensions by\r\nestimating the number of solutions to certain polynomial
equations over finite\r\nfields."
author:
- first_name: Fabian
full_name: Gundlach, Fabian
id: '100450'
last_name: Gundlach
- first_name: Beranger Fabrice
full_name: Seguin, Beranger Fabrice
id: '102487'
last_name: Seguin
citation:
ama: Gundlach F, Seguin BF. Counting two-step nilpotent wildly ramified extensions
of function fields. arXiv:250218207. Published online 2025.
apa: Gundlach, F., & Seguin, B. F. (2025). Counting two-step nilpotent wildly
ramified extensions of function fields. In arXiv:2502.18207.
bibtex: '@article{Gundlach_Seguin_2025, title={Counting two-step nilpotent wildly
ramified extensions of function fields}, journal={arXiv:2502.18207}, author={Gundlach,
Fabian and Seguin, Beranger Fabrice}, year={2025} }'
chicago: Gundlach, Fabian, and Beranger Fabrice Seguin. “Counting Two-Step Nilpotent
Wildly Ramified Extensions of Function Fields.” ArXiv:2502.18207, 2025.
ieee: F. Gundlach and B. F. Seguin, “Counting two-step nilpotent wildly ramified
extensions of function fields,” arXiv:2502.18207. 2025.
mla: Gundlach, Fabian, and Beranger Fabrice Seguin. “Counting Two-Step Nilpotent
Wildly Ramified Extensions of Function Fields.” ArXiv:2502.18207, 2025.
short: F. Gundlach, B.F. Seguin, ArXiv:2502.18207 (2025).
date_created: 2025-02-26T08:51:57Z
date_updated: 2025-02-26T08:53:08Z
external_id:
arxiv:
- '2502.18207'
language:
- iso: eng
publication: arXiv:2502.18207
status: public
title: Counting two-step nilpotent wildly ramified extensions of function fields
type: preprint
user_id: '100450'
year: '2025'
...
---
_id: '58885'
abstract:
- lang: eng
text: 'There have been several attempts to conceptualize and operationalize pedagogical
content knowledge (PCK) in the context of teachers'' professional competencies.
A recent and popular model is the Refined Consensus Model (RCM), which proposes
a framework of dispositional competencies (personal PCK—pPCK) that influence more
action-related competencies (enacted PCK—ePCK) and vice versa. However, descriptions
of the internal structure of pPCK and possible knowledge domains that might develop
independently are still limited, being either primarily theoretically motivated
or strictly hierarchical and therefore of limited use, for example, for formative
feedback and further development of the RCM. Meanwhile, a non-hierarchical differentiation
for the ePCK regarding the plan-teach-reflect cycle has emerged. In this study,
we present an exploratory computational approach to investigate pre-service teachers''
pPCK for a similar non-hierarchical structure using a large dataset of responses
to a pPCK questionnaire (N=846). We drew on theoretical foundations and previous
empirical findings to achieve interpretability by integrating this external knowledge
into our analyses using the Computational Grounded Theory (CGT) framework. The
results of a cluster analysis of the pPCK scores indicate the emergence of prototypical
groups, which we refer to as competency profiles: (1) a group with low performance,
(2) a group with relatively advanced competency in using pPCK to create instructional
elements, (3) a group with relatively advanced competency in using pPCK to assess
and analyze described instructional elements, and (4) a group with high performance.
These groups show tendencies for certain language usage, which we analyze using
a structural topic model in a CGT-inspired pattern refinement step. We verify
these patterns by demonstrating the ability of a machine learning model to predict
the competency profile assignments. Finally, we discuss some implications of the
results for the further development of the RCM and their potential usability for
an automated formative assessment.'
article_type: original
author:
- first_name: Jannis
full_name: Zeller, Jannis
id: '99022'
last_name: Zeller
orcid: 0000-0002-1834-5520
- first_name: Josef
full_name: Riese, Josef
id: '429'
last_name: Riese
orcid: 0000-0003-2927-2619
citation:
ama: 'Zeller J, Riese J. Competency Profiles of PCK Using Unsupervised Learning:
What Implications for the Structures of pPCK Emerge From Non-Hierarchical Analyses?
Journal of Research in Science Teaching. Published online 2025. doi:10.1002/tea.70001'
apa: 'Zeller, J., & Riese, J. (2025). Competency Profiles of PCK Using Unsupervised
Learning: What Implications for the Structures of pPCK Emerge From Non-Hierarchical
Analyses? Journal of Research in Science Teaching. https://doi.org/10.1002/tea.70001'
bibtex: '@article{Zeller_Riese_2025, title={Competency Profiles of PCK Using Unsupervised
Learning: What Implications for the Structures of pPCK Emerge From Non-Hierarchical
Analyses?}, DOI={10.1002/tea.70001},
journal={Journal of Research in Science Teaching}, author={Zeller, Jannis and
Riese, Josef}, year={2025} }'
chicago: 'Zeller, Jannis, and Josef Riese. “Competency Profiles of PCK Using Unsupervised
Learning: What Implications for the Structures of PPCK Emerge From Non-Hierarchical
Analyses?” Journal of Research in Science Teaching, 2025. https://doi.org/10.1002/tea.70001.'
ieee: 'J. Zeller and J. Riese, “Competency Profiles of PCK Using Unsupervised Learning:
What Implications for the Structures of pPCK Emerge From Non-Hierarchical Analyses?,”
Journal of Research in Science Teaching, 2025, doi: 10.1002/tea.70001.'
mla: 'Zeller, Jannis, and Josef Riese. “Competency Profiles of PCK Using Unsupervised
Learning: What Implications for the Structures of PPCK Emerge From Non-Hierarchical
Analyses?” Journal of Research in Science Teaching, 2025, doi:10.1002/tea.70001.'
short: J. Zeller, J. Riese, Journal of Research in Science Teaching (2025).
date_created: 2025-03-04T08:08:37Z
date_updated: 2025-03-04T08:08:42Z
department:
- _id: '299'
doi: 10.1002/tea.70001
keyword:
- computational grounded theory
- language analysis
- machine learning
- pedagogical content knowledge
- unsupervised learning
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://onlinelibrary.wiley.com/doi/epdf/10.1002/tea.70001
oa: '1'
publication: Journal of Research in Science Teaching
publication_identifier:
eissn:
- 1098-2736
issn:
- 0022-4308
publication_status: published
status: public
title: 'Competency Profiles of PCK Using Unsupervised Learning: What Implications
for the Structures of pPCK Emerge From Non-Hierarchical Analyses?'
type: journal_article
user_id: '99022'
year: '2025'
...
---
_id: '58924'
author:
- first_name: Hendrik
full_name: Peeters, Hendrik
id: '49942'
last_name: Peeters
orcid: https://orcid.org/ 0000-0002-7143-3781
- first_name: Sebastian
full_name: Habig, Sebastian
last_name: Habig
- first_name: Sabine
full_name: Fechner, Sabine
id: '54823'
last_name: Fechner
orcid: 0000-0001-5645-5870
citation:
ama: 'Peeters H, Habig S, Fechner S. Influence de l’utilisation de la réalité augmentée
lors des expériences chimiques sur la connexion des niveaux de représentation
dans les explications des élèves. In: Munier V, Bächtold M, eds. Actes des
XIIIe Rencontres scientifiques de l’ARDIST. ; 2025:48-55.'
apa: Peeters, H., Habig, S., & Fechner, S. (2025). Influence de l’utilisation
de la réalité augmentée lors des expériences chimiques sur la connexion des niveaux
de représentation dans les explications des élèves. In V. Munier & M. Bächtold
(Eds.), Actes des XIIIe Rencontres scientifiques de l’ARDIST (pp. 48–55).
bibtex: '@inproceedings{Peeters_Habig_Fechner_2025, title={Influence de l’utilisation
de la réalité augmentée lors des expériences chimiques sur la connexion des niveaux
de représentation dans les explications des élèves}, booktitle={Actes des XIIIe
Rencontres scientifiques de l’ARDIST}, author={Peeters, Hendrik and Habig, Sebastian
and Fechner, Sabine}, editor={Munier, Valérie and Bächtold, Manuel}, year={2025},
pages={48–55} }'
chicago: Peeters, Hendrik, Sebastian Habig, and Sabine Fechner. “Influence de l’utilisation
de la réalité augmentée lors des expériences chimiques sur la connexion des niveaux
de représentation dans les explications des élèves.” In Actes des XIIIe Rencontres
scientifiques de l’ARDIST, edited by Valérie Munier and Manuel Bächtold, 48–55,
2025.
ieee: H. Peeters, S. Habig, and S. Fechner, “Influence de l’utilisation de la réalité
augmentée lors des expériences chimiques sur la connexion des niveaux de représentation
dans les explications des élèves,” in Actes des XIIIe Rencontres scientifiques
de l’ARDIST, Montpellier, 2025, pp. 48–55.
mla: Peeters, Hendrik, et al. “Influence de l’utilisation de la réalité augmentée
lors des expériences chimiques sur la connexion des niveaux de représentation
dans les explications des élèves.” Actes des XIIIe Rencontres scientifiques
de l’ARDIST, edited by Valérie Munier and Manuel Bächtold, 2025, pp. 48–55.
short: 'H. Peeters, S. Habig, S. Fechner, in: V. Munier, M. Bächtold (Eds.), Actes
des XIIIe Rencontres scientifiques de l’ARDIST, 2025, pp. 48–55.'
conference:
end_date: 2024-06-07
location: Montpellier
name: ' XIIIe Rencontres scientifiques de l’ARDIST'
start_date: 2024-06-04
date_created: 2025-03-06T13:44:19Z
date_updated: 2025-03-06T13:51:25Z
department:
- _id: '386'
editor:
- first_name: Valérie
full_name: Munier, Valérie
last_name: Munier
- first_name: Manuel
full_name: Bächtold, Manuel
last_name: Bächtold
language:
- iso: fre
main_file_link:
- open_access: '1'
url: https://ardist2024.sciencesconf.org/data/pages/Actes_13e_Rencontres_ARDiST.pdf
oa: '1'
page: 48-55
publication: Actes des XIIIe Rencontres scientifiques de l’ARDIST
publication_status: published
status: public
title: Influence de l'utilisation de la réalité augmentée lors des expériences chimiques
sur la connexion des niveaux de représentation dans les explications des élèves
type: conference
user_id: '49942'
year: '2025'
...
---
_id: '58925'
abstract:
- lang: eng
text: "Abstract\r\n Random fluctuations
in somatosensory signals affect the ability of effectively coordinating multimodal
information pertaining to the postural state during movement. Therefore, this
study aimed to investigate the impact of a compliant surface on cortico-cortical
causal information flow during multi-joint compound movements. Fifteen healthy
adults (7 female / 8 male, 25.9 ± 4.0 years) performed 5 × 20 repetitions of bodyweight
squats on firm and compliant surface. Motor behavior was quantified by center
of pressure (CoP) displacements, hip movement and the root mean square of the
rectus femoris activity. Using source space analysis, renormalized partial directed
coherence (rPDC) computed subject-level multivariate effective brain connectivity
of sensorimotor nodes. Bootstrap statistics revealed significantly decreased medio-lateral
CoP displacement (p < 0.001), significantly increased
velocity of medio-lateral hip motion (p < 0.001)
as well as significantly lower rectus femoris activity (p < 0.01)
in the compliant surface condition. On the cortical level, rPDC showed significantly
modulated information flow in theta and beta frequencies for fronto-parietal edges
(p < 0.01) only during the concentric phase of the
movement. The compliant surface led to increased difficulties controlling hip
but not center of pressure motion in the medio-lateral plane. Moreover, a decreased
activation of the prime movers accompanied by modulations of effective brain connectivity
among fronto-central nodes may point to altered demands on sensorimotor information
processing in presence of sensory noise when performing bodyweight squats on compliant
surface. Further studies are needed to evaluate a potential benefit for athletic
and clinical populations."
article_number: '80'
author:
- first_name: Tim
full_name: Lehmann, Tim
id: '41584'
last_name: Lehmann
- first_name: Anton Samuel
full_name: Visser, Anton Samuel
id: '52012'
last_name: Visser
- first_name: Tim
full_name: Havers, Tim
last_name: Havers
- first_name: Daniel
full_name: Büchel, Daniel
id: '41088'
last_name: Büchel
- first_name: Jochen
full_name: Baumeister, Jochen
id: '46'
last_name: Baumeister
orcid: 0000-0003-2683-5826
citation:
ama: Lehmann T, Visser AS, Havers T, Büchel D, Baumeister J. Dynamic modulations
of effective brain connectivity associated with postural instability during multi-joint
compound movement on compliant surface. Experimental Brain Research. 2025;243(4).
doi:10.1007/s00221-025-07039-2
apa: Lehmann, T., Visser, A. S., Havers, T., Büchel, D., & Baumeister, J. (2025).
Dynamic modulations of effective brain connectivity associated with postural instability
during multi-joint compound movement on compliant surface. Experimental Brain
Research, 243(4), Article 80. https://doi.org/10.1007/s00221-025-07039-2
bibtex: '@article{Lehmann_Visser_Havers_Büchel_Baumeister_2025, title={Dynamic modulations
of effective brain connectivity associated with postural instability during multi-joint
compound movement on compliant surface}, volume={243}, DOI={10.1007/s00221-025-07039-2},
number={480}, journal={Experimental Brain Research}, publisher={Springer Science
and Business Media LLC}, author={Lehmann, Tim and Visser, Anton Samuel and Havers,
Tim and Büchel, Daniel and Baumeister, Jochen}, year={2025} }'
chicago: Lehmann, Tim, Anton Samuel Visser, Tim Havers, Daniel Büchel, and Jochen
Baumeister. “Dynamic Modulations of Effective Brain Connectivity Associated with
Postural Instability during Multi-Joint Compound Movement on Compliant Surface.”
Experimental Brain Research 243, no. 4 (2025). https://doi.org/10.1007/s00221-025-07039-2.
ieee: 'T. Lehmann, A. S. Visser, T. Havers, D. Büchel, and J. Baumeister, “Dynamic
modulations of effective brain connectivity associated with postural instability
during multi-joint compound movement on compliant surface,” Experimental Brain
Research, vol. 243, no. 4, Art. no. 80, 2025, doi: 10.1007/s00221-025-07039-2.'
mla: Lehmann, Tim, et al. “Dynamic Modulations of Effective Brain Connectivity Associated
with Postural Instability during Multi-Joint Compound Movement on Compliant Surface.”
Experimental Brain Research, vol. 243, no. 4, 80, Springer Science and
Business Media LLC, 2025, doi:10.1007/s00221-025-07039-2.
short: T. Lehmann, A.S. Visser, T. Havers, D. Büchel, J. Baumeister, Experimental
Brain Research 243 (2025).
date_created: 2025-03-06T18:56:34Z
date_updated: 2025-03-06T18:57:03Z
department:
- _id: '172'
doi: 10.1007/s00221-025-07039-2
intvolume: ' 243'
issue: '4'
language:
- iso: eng
publication: Experimental Brain Research
publication_identifier:
issn:
- 0014-4819
- 1432-1106
publication_status: published
publisher: Springer Science and Business Media LLC
status: public
title: Dynamic modulations of effective brain connectivity associated with postural
instability during multi-joint compound movement on compliant surface
type: journal_article
user_id: '46'
volume: 243
year: '2025'
...
---
_id: '58691'
author:
- first_name: Vanessa
full_name: Albus, Vanessa
id: '80690'
last_name: Albus
citation:
ama: 'Albus V. Paradigmenwechsel und Metapher. Ein Weg zur Gesellschaft der Nachhaltigkeit?
In: Kokoschka V, Kosak S, Paganini C, Rademacher L, eds. Nachhaltigkeit in
der Medienkommunikation. Ethische Anforderungen und praktische Lösungsansätze.
Vol 23. Kommunikations- und Medienethik. Nomos; 2025:171-184.'
apa: Albus, V. (2025). Paradigmenwechsel und Metapher. Ein Weg zur Gesellschaft
der Nachhaltigkeit? In V. Kokoschka, S. Kosak, C. Paganini, & L. Rademacher
(Eds.), Nachhaltigkeit in der Medienkommunikation. Ethische Anforderungen und
praktische Lösungsansätze (Vol. 23, pp. 171–184). Nomos.
bibtex: '@inbook{Albus_2025, place={Baden-Baden}, series={Kommunikations- und Medienethik},
title={Paradigmenwechsel und Metapher. Ein Weg zur Gesellschaft der Nachhaltigkeit?},
volume={23}, booktitle={Nachhaltigkeit in der Medienkommunikation. Ethische Anforderungen
und praktische Lösungsansätze}, publisher={Nomos}, author={Albus, Vanessa}, editor={Kokoschka,
Vanessa and Kosak, Stefan and Paganini, Claudia and Rademacher, Lars}, year={2025},
pages={171–184}, collection={Kommunikations- und Medienethik} }'
chicago: 'Albus, Vanessa. “Paradigmenwechsel und Metapher. Ein Weg zur Gesellschaft
der Nachhaltigkeit?” In Nachhaltigkeit in der Medienkommunikation. Ethische
Anforderungen und praktische Lösungsansätze, edited by Vanessa Kokoschka,
Stefan Kosak, Claudia Paganini, and Lars Rademacher, 23:171–84. Kommunikations-
und Medienethik. Baden-Baden: Nomos, 2025.'
ieee: 'V. Albus, “Paradigmenwechsel und Metapher. Ein Weg zur Gesellschaft der Nachhaltigkeit?,”
in Nachhaltigkeit in der Medienkommunikation. Ethische Anforderungen und praktische
Lösungsansätze, vol. 23, V. Kokoschka, S. Kosak, C. Paganini, and L. Rademacher,
Eds. Baden-Baden: Nomos, 2025, pp. 171–184.'
mla: Albus, Vanessa. “Paradigmenwechsel und Metapher. Ein Weg zur Gesellschaft der
Nachhaltigkeit?” Nachhaltigkeit in der Medienkommunikation. Ethische Anforderungen
und praktische Lösungsansätze, edited by Vanessa Kokoschka et al., vol. 23,
Nomos, 2025, pp. 171–84.
short: 'V. Albus, in: V. Kokoschka, S. Kosak, C. Paganini, L. Rademacher (Eds.),
Nachhaltigkeit in der Medienkommunikation. Ethische Anforderungen und praktische
Lösungsansätze, Nomos, Baden-Baden, 2025, pp. 171–184.'
date_created: 2025-02-18T11:05:17Z
date_updated: 2025-03-06T21:48:36Z
ddc:
- '100'
editor:
- first_name: Vanessa
full_name: Kokoschka, Vanessa
last_name: Kokoschka
- first_name: Stefan
full_name: Kosak, Stefan
last_name: Kosak
- first_name: Claudia
full_name: Paganini, Claudia
last_name: Paganini
- first_name: Lars
full_name: Rademacher, Lars
last_name: Rademacher
file:
- access_level: open_access
content_type: application/pdf
creator: nilsz
date_created: 2025-03-06T21:47:04Z
date_updated: 2025-03-06T21:47:04Z
file_id: '58927'
file_name: Paradigmenwechsel und Metapher. Ein Weg zur Gesellschaft der Nachhaltigkeit.pdf
file_size: 134898
relation: main_file
file_date_updated: 2025-03-06T21:47:04Z
has_accepted_license: '1'
intvolume: ' 23'
language:
- iso: ger
oa: '1'
page: 171-184
place: Baden-Baden
publication: Nachhaltigkeit in der Medienkommunikation. Ethische Anforderungen und
praktische Lösungsansätze
publication_identifier:
isbn:
- ISBN 978-3-7560-1814-7
- ISBN 978-3-7489-4061-6 (eBook)
publication_status: published
publisher: Nomos
related_material:
link:
- relation: contains
url: https://www.nomos-elibrary.de/10.5771/9783748940616-171/paradigmenwechsel-und-metapher-ein-weg-zur-gesellschaft-der-nachhaltigkeit?page=3
series_title: Kommunikations- und Medienethik
status: public
title: Paradigmenwechsel und Metapher. Ein Weg zur Gesellschaft der Nachhaltigkeit?
type: book_chapter
user_id: '57447'
volume: 23
year: '2025'
...
---
_id: '58953'
abstract:
- lang: eng
text: In this article, we investigate symmetry properties of distributed systems
of mobile robots. We consider a swarm of n robots in the OBLOT model and analyze
their collective Fsync dynamics using of equivariant dynamical systems theory.
To this end, we show that the corresponding evolution function commutes with rotational
and reflective transformations of R^2. These form a group that is isomorphic to
O(2) x S_n, the product group of the orthogonal group and the permutation on n
elements. The theory of equivariant dynamical systems is used to deduce a hierarchy
along which symmetries of a robot swarm can potentially increase following an
arbitrary protocol. By decoupling the Look phase from the Compute and Move phases
in the mathematical description of an LCM cycle, this hierarchy can be characterized
in terms of automorphisms of connectivity graphs. In particular, we find all possible
types of symmetry increase, if the decoupled Compute and Move phase is invertible.
Finally, we apply our results to protocols which induce state-dependent linear
dynamics, where the reduced system consisting of only the Compute and Move phase
is linear.
author:
- first_name: Raphael
full_name: Gerlach, Raphael
id: '32655'
last_name: Gerlach
orcid: 0009-0002-4750-2051
- first_name: Sören
full_name: von der Gracht, Sören
id: '97359'
last_name: von der Gracht
orcid: 0000-0002-8054-2058
citation:
ama: Gerlach R, von der Gracht S. Analyzing Symmetries of Swarms of Mobile Robots
Using Equivariant Dynamical Systems. arXiv:250307576. Published online
2025.
apa: Gerlach, R., & von der Gracht, S. (2025). Analyzing Symmetries of Swarms
of Mobile Robots Using Equivariant Dynamical Systems. In arXiv:2503.07576.
bibtex: '@article{Gerlach_von der Gracht_2025, title={Analyzing Symmetries of Swarms
of Mobile Robots Using Equivariant Dynamical Systems}, journal={arXiv:2503.07576},
author={Gerlach, Raphael and von der Gracht, Sören}, year={2025} }'
chicago: Gerlach, Raphael, and Sören von der Gracht. “Analyzing Symmetries of Swarms
of Mobile Robots Using Equivariant Dynamical Systems.” ArXiv:2503.07576,
2025.
ieee: R. Gerlach and S. von der Gracht, “Analyzing Symmetries of Swarms of Mobile
Robots Using Equivariant Dynamical Systems,” arXiv:2503.07576. 2025.
mla: Gerlach, Raphael, and Sören von der Gracht. “Analyzing Symmetries of Swarms
of Mobile Robots Using Equivariant Dynamical Systems.” ArXiv:2503.07576,
2025.
short: R. Gerlach, S. von der Gracht, ArXiv:2503.07576 (2025).
date_created: 2025-03-11T08:21:05Z
date_updated: 2025-03-11T08:53:02Z
ddc:
- '004'
department:
- _id: '101'
external_id:
arxiv:
- '2503.07576'
file:
- access_level: open_access
content_type: application/pdf
creator: svdg
date_created: 2025-03-11T08:27:32Z
date_updated: 2025-03-11T08:27:32Z
file_id: '58954'
file_name: Analyzing_Symmetries_of_Swarms_of_Mobile_Robots_Using_Equivariant_Dynamical_Systems.pdf
file_size: 812198
relation: main_file
file_date_updated: 2025-03-11T08:27:32Z
has_accepted_license: '1'
keyword:
- dynamical systems
- coupled systems
- distributed computing
- robot swarms
- autonomous mobile robots
- symmetry
- equivariant dynamics
language:
- iso: eng
oa: '1'
page: '23'
project:
- _id: '106'
grant_number: '453112019'
name: 'Algorithmen für Schwarmrobotik: Verteiltes Rechnen trifft Dynamische Systeme'
publication: arXiv:2503.07576
status: public
title: Analyzing Symmetries of Swarms of Mobile Robots Using Equivariant Dynamical
Systems
type: preprint
user_id: '97359'
year: '2025'
...
---
_id: '59069'
abstract:
- lang: eng
text: Stable and bright single photon sources are key components for future
quantum applications. A simple fabrication method is an important requirement
for such sources. Here, we present a single photon source based on diced ridge
waveguides in titanium indiffused LiNbO3. These waveguides
can be easily fabricated by combining planar titanium in-diffusion without lithographic
patterning and easy-to-handle precision dicing. Such devices have the potential
to generate high single photon rates because ridge structures are typically less
prone to the photorefractive effect. We achieve waveguide propagation losses <0.4dBcm
and a SHG conversion efficiency of about 81%Wcm2. Harnessing
a type-0 SPDC process to generate 1550 nm photons, we obtain a SPDC brightness
of 3⋅1051s⋅mW⋅nm, with a heralding efficiency of ηh=45%
(ηh,wg=77.5% for the waveguide
itself excluded setup losses) and a heralded second-order correlation function
of gh2(0)<0.003
at low pump powers.
article_number: '593'
article_type: original
author:
- first_name: Christian
full_name: Kießler, Christian
id: '44252'
last_name: Kießler
- first_name: Michelle
full_name: Kirsch, Michelle
id: '69553'
last_name: Kirsch
- first_name: Sebastian
full_name: Lengeling, Sebastian
id: '44373'
last_name: Lengeling
- first_name: Harald
full_name: Herrmann, Harald
id: '216'
last_name: Herrmann
- first_name: Christine
full_name: Silberhorn, Christine
id: '26263'
last_name: Silberhorn
citation:
ama: Kießler C, Kirsch M, Lengeling S, Herrmann H, Silberhorn C. SPDC single-photon
source in Ti-indiffused diced ridge LiNbO3 waveguides. Optics Continuum.
2025;4(3). doi:10.1364/optcon.557439
apa: Kießler, C., Kirsch, M., Lengeling, S., Herrmann, H., & Silberhorn, C.
(2025). SPDC single-photon source in Ti-indiffused diced ridge LiNbO3
waveguides. Optics Continuum, 4(3), Article 593. https://doi.org/10.1364/optcon.557439
bibtex: '@article{Kießler_Kirsch_Lengeling_Herrmann_Silberhorn_2025, title={SPDC
single-photon source in Ti-indiffused diced ridge LiNbO3 waveguides},
volume={4}, DOI={10.1364/optcon.557439},
number={3593}, journal={Optics Continuum}, publisher={Optica Publishing Group},
author={Kießler, Christian and Kirsch, Michelle and Lengeling, Sebastian and Herrmann,
Harald and Silberhorn, Christine}, year={2025} }'
chicago: Kießler, Christian, Michelle Kirsch, Sebastian Lengeling, Harald Herrmann,
and Christine Silberhorn. “SPDC Single-Photon Source in Ti-Indiffused Diced Ridge
LiNbO3 Waveguides.” Optics Continuum 4, no. 3 (2025). https://doi.org/10.1364/optcon.557439.
ieee: 'C. Kießler, M. Kirsch, S. Lengeling, H. Herrmann, and C. Silberhorn, “SPDC
single-photon source in Ti-indiffused diced ridge LiNbO3 waveguides,”
Optics Continuum, vol. 4, no. 3, Art. no. 593, 2025, doi: 10.1364/optcon.557439.'
mla: Kießler, Christian, et al. “SPDC Single-Photon Source in Ti-Indiffused Diced
Ridge LiNbO3 Waveguides.” Optics Continuum, vol. 4, no. 3, 593,
Optica Publishing Group, 2025, doi:10.1364/optcon.557439.
short: C. Kießler, M. Kirsch, S. Lengeling, H. Herrmann, C. Silberhorn, Optics Continuum
4 (2025).
date_created: 2025-03-19T10:56:04Z
date_updated: 2025-03-19T16:03:25Z
department:
- _id: '15'
- _id: '623'
- _id: '288'
doi: 10.1364/optcon.557439
intvolume: ' 4'
issue: '3'
language:
- iso: eng
publication: Optics Continuum
publication_identifier:
issn:
- 2770-0208
publication_status: published
publisher: Optica Publishing Group
status: public
title: SPDC single-photon source in Ti-indiffused diced ridge LiNbO3 waveguides
type: journal_article
user_id: '216'
volume: 4
year: '2025'
...
---
_id: '59087'
author:
- first_name: Michael
full_name: Ströhmer, Michael
id: '523'
last_name: Ströhmer
citation:
ama: 'Ströhmer M. Von Paderborner Saugpumpen, Wasserkünsten und dem absoluten Nichts
- Naturphilosophische Experimente des 17. Jahrhunderts im europäischen Jesuitennetzwerk.
In: KOmmunale Wasserregime - Wasser und Macht in der europäischen Stadt, 1300-1900.
Vol 4. Umwelt- und Klimageschichte. ; 2025:141-164.'
apa: Ströhmer, M. (2025). Von Paderborner Saugpumpen, Wasserkünsten und dem absoluten
Nichts - Naturphilosophische Experimente des 17. Jahrhunderts im europäischen
Jesuitennetzwerk. In KOmmunale Wasserregime - Wasser und Macht in der europäischen
Stadt, 1300-1900 (Vol. 4, pp. 141–164).
bibtex: '@inbook{Ströhmer_2025, place={Bielefeld}, series={Umwelt- und Klimageschichte},
title={Von Paderborner Saugpumpen, Wasserkünsten und dem absoluten Nichts - Naturphilosophische
Experimente des 17. Jahrhunderts im europäischen Jesuitennetzwerk}, volume={4},
booktitle={KOmmunale Wasserregime - Wasser und Macht in der europäischen Stadt,
1300-1900}, author={Ströhmer, Michael}, year={2025}, pages={141–164}, collection={Umwelt-
und Klimageschichte} }'
chicago: Ströhmer, Michael. “Von Paderborner Saugpumpen, Wasserkünsten und dem absoluten
Nichts - Naturphilosophische Experimente des 17. Jahrhunderts im europäischen
Jesuitennetzwerk.” In KOmmunale Wasserregime - Wasser und Macht in der europäischen
Stadt, 1300-1900, 4:141–64. Umwelt- und Klimageschichte. Bielefeld, 2025.
ieee: M. Ströhmer, “Von Paderborner Saugpumpen, Wasserkünsten und dem absoluten
Nichts - Naturphilosophische Experimente des 17. Jahrhunderts im europäischen
Jesuitennetzwerk,” in KOmmunale Wasserregime - Wasser und Macht in der europäischen
Stadt, 1300-1900, vol. 4, Bielefeld, 2025, pp. 141–164.
mla: Ströhmer, Michael. “Von Paderborner Saugpumpen, Wasserkünsten und dem absoluten
Nichts - Naturphilosophische Experimente des 17. Jahrhunderts im europäischen
Jesuitennetzwerk.” KOmmunale Wasserregime - Wasser und Macht in der europäischen
Stadt, 1300-1900, vol. 4, 2025, pp. 141–64.
short: 'M. Ströhmer, in: KOmmunale Wasserregime - Wasser und Macht in der europäischen
Stadt, 1300-1900, Bielefeld, 2025, pp. 141–164.'
date_created: 2025-03-22T13:07:14Z
date_updated: 2025-03-22T13:07:40Z
intvolume: ' 4'
language:
- iso: ger
page: 141-164
place: Bielefeld
publication: KOmmunale Wasserregime - Wasser und Macht in der europäischen Stadt,
1300-1900
publication_identifier:
isbn:
- 978-3-8376-7161-2
publication_status: published
series_title: Umwelt- und Klimageschichte
status: public
title: Von Paderborner Saugpumpen, Wasserkünsten und dem absoluten Nichts - Naturphilosophische
Experimente des 17. Jahrhunderts im europäischen Jesuitennetzwerk
type: book_chapter
user_id: '523'
volume: 4
year: '2025'
...
---
_id: '59086'
citation:
ama: Ströhmer M, Fäßler P, eds. Kommunale Wasserregime - Wasser und Macht in
der europäischen Stadt 1300-1900. Vol 4.
apa: Ströhmer, M., & Fäßler, P. (Eds.). (n.d.). Kommunale Wasserregime -
Wasser und Macht in der europäischen Stadt 1300-1900 (Vol. 4).
bibtex: '@book{Ströhmer_Fäßler, place={Bielefeld}, series={Umwelt- und Klimageschichte},
title={Kommunale Wasserregime - Wasser und Macht in der europäischen Stadt 1300-1900},
volume={4}, collection={Umwelt- und Klimageschichte} }'
chicago: Ströhmer, Michael, and Peter Fäßler, eds. Kommunale Wasserregime - Wasser
und Macht in der europäischen Stadt 1300-1900. Vol. 4. Umwelt- und Klimageschichte.
Bielefeld, n.d.
ieee: M. Ströhmer and P. Fäßler, Eds., Kommunale Wasserregime - Wasser und Macht
in der europäischen Stadt 1300-1900, vol. 4. Bielefeld.
mla: Ströhmer, Michael, and Peter Fäßler, editors. Kommunale Wasserregime - Wasser
und Macht in der europäischen Stadt 1300-1900.
short: M. Ströhmer, P. Fäßler, eds., Kommunale Wasserregime - Wasser und Macht in
der europäischen Stadt 1300-1900, Bielefeld, n.d.
date_created: 2025-03-22T12:56:57Z
date_updated: 2025-03-22T13:01:58Z
editor:
- first_name: Michael
full_name: Ströhmer, Michael
last_name: Ströhmer
- first_name: Peter
full_name: Fäßler, Peter
last_name: Fäßler
intvolume: ' 4'
language:
- iso: ger
page: '296'
place: Bielefeld
publication_identifier:
unknown:
- 978-3-8376-7161-2
publication_status: unpublished
series_title: Umwelt- und Klimageschichte
status: public
title: Kommunale Wasserregime - Wasser und Macht in der europäischen Stadt 1300-1900
type: book_editor
user_id: '523'
volume: 4
year: '2025'
...
---
_id: '59169'
abstract:
- lang: eng
text: An r-regular graph is an r-graph, if every odd set of vertices is connected
to its complement by at least r edges. Let G and H be r-graphs. An H-coloring
of G is a mapping such that each r adjacent edges of G are mapped to r adjacent
edges of H. For every , let be an inclusion-wise minimal set of connected r-graphs,
such that for every connected r-graph G there is an which colors G. The Petersen
Coloring Conjecture states that consists of the Petersen graph P. We show that
if true, then this is a very exclusive situation. Our main result is that either
or is an infinite set and if , then is an infinite set. In particular, for all
, is unique. We first characterize and then prove that if contains more than one
element, then it is an infinite set. To obtain our main result we show that contains
the smallest r-graphs of class 2 and the smallest poorly matchable r-graphs, and
we determine the smallest r-graphs of class 2.
article_number: '16'
author:
- first_name: Yulai
full_name: Ma, Yulai
last_name: Ma
- first_name: Davide
full_name: Mattiolo, Davide
last_name: Mattiolo
- first_name: Eckhard
full_name: Steffen, Eckhard
id: '15548'
last_name: Steffen
orcid: 0000-0002-9808-7401
- first_name: Isaak H.
full_name: Wolf, Isaak H.
last_name: Wolf
citation:
ama: Ma Y, Mattiolo D, Steffen E, Wolf IH. Sets of r-Graphs that Color All r-Graphs.
Combinatorica. 2025;45(2). doi:10.1007/s00493-025-00144-4
apa: Ma, Y., Mattiolo, D., Steffen, E., & Wolf, I. H. (2025). Sets of r-Graphs
that Color All r-Graphs. Combinatorica, 45(2), Article 16. https://doi.org/10.1007/s00493-025-00144-4
bibtex: '@article{Ma_Mattiolo_Steffen_Wolf_2025, title={Sets of r-Graphs that Color
All r-Graphs}, volume={45}, DOI={10.1007/s00493-025-00144-4},
number={216}, journal={Combinatorica}, publisher={Springer Science and Business
Media LLC}, author={Ma, Yulai and Mattiolo, Davide and Steffen, Eckhard and Wolf,
Isaak H.}, year={2025} }'
chicago: Ma, Yulai, Davide Mattiolo, Eckhard Steffen, and Isaak H. Wolf. “Sets of
R-Graphs That Color All r-Graphs.” Combinatorica 45, no. 2 (2025). https://doi.org/10.1007/s00493-025-00144-4.
ieee: 'Y. Ma, D. Mattiolo, E. Steffen, and I. H. Wolf, “Sets of r-Graphs that Color
All r-Graphs,” Combinatorica, vol. 45, no. 2, Art. no. 16, 2025, doi: 10.1007/s00493-025-00144-4.'
mla: Ma, Yulai, et al. “Sets of R-Graphs That Color All r-Graphs.” Combinatorica,
vol. 45, no. 2, 16, Springer Science and Business Media LLC, 2025, doi:10.1007/s00493-025-00144-4.
short: Y. Ma, D. Mattiolo, E. Steffen, I.H. Wolf, Combinatorica 45 (2025).
date_created: 2025-03-27T09:46:34Z
date_updated: 2025-03-27T09:48:48Z
department:
- _id: '542'
doi: 10.1007/s00493-025-00144-4
intvolume: ' 45'
issue: '2'
language:
- iso: eng
publication: Combinatorica
publication_identifier:
issn:
- 0209-9683
- 1439-6912
publication_status: published
publisher: Springer Science and Business Media LLC
status: public
title: Sets of r-Graphs that Color All r-Graphs
type: journal_article
user_id: '15540'
volume: 45
year: '2025'
...
---
_id: '59263'
abstract:
- lang: eng
text: In dieser Arbeit betrachten wir algorithmische Lösungen für fundamentale Probleme
in modernen Kommunikationsnetzen. Im ersten Teil dieser Arbeit zeigen wir, wie
man ein Overlay-Netzwerk mit Grades und Durchmesser O(log n) in O(log n) Runden
ausgehend von einem beliebigen, schwach verbundenen Graphen konstruiert. Wir gehen
von einem synchronen Kommunikationsnetz aus, in dem Knoten Nachrichten an alle
Knoten senden können, deren Adresse sie kennen, und neue Verbindungen durch das
Versenden dieser Adressen hergestellt werden können. Wenn der Ausgangsgraph des
Netzwerks schwach zusammenhängend ist und einen konstanten Grad hat, dann konstruiert
unser Algorithmus die gewünschte Topologie mit hoher Wahrscheinlichkeit in O(log
n) Runden, wobei in jeder Runde nur O(log n) Nachrichten sendet und empfängt.
Da das Problem nicht schneller gelöst werden kann als durch sogenanntes Pointer
Doubling für O(log n) Runden (was sogar erfordern würde, dass jeder Knoten Ω(n)
Bits kommuniziert), ist unser Algorithmus asymptotisch optimal. Außerdem zeigen
wir, wie unser Algorithmus zur effizienten Lösung von Graphenproblemen im HYBRID
modelverwendet werden kann. Motiviert durch die Idee, dass Knoten zwei verschiedene
Arten der Kommunikation besitzen, nehmen wir an, dass die Kommunikation der Kanten
unbeschränkt ist, während nur polylogarithmisch viele Nachrichten über Kanten
gesendet werden können, die während der Ausführung eines Algorithmus etabliert
wurden. Für einen (ungerichteten) Graphen G mit beliebigem Grad zeigen wir, wie
man zusammenhängende Komponenten und einen Spannwald mit hoher Wahrscheinlichkeit
in O(log n) Zeitberechnen kann. Außerdem zeigen wir, wie man ein MIS mit hoher
Wahrscheinlichkeit in O(log ∆ + log log n), berechnet, wobei ∆ der Grad von G
ist. Im zweiten Teil der Arbeit betrachten wir das Problem der Berechnung von
kompakten Routing-Tabellen und Dekompositionen mit geringem Durchmesser für einen
(gewichteten) Graphen G := (V, E, ℓ), der durch k kürzeste Wege separiert werden
kann. Zu dieser Klasse von Graphen gehören planare Graphen, Graphen mit beschränkter
Treewidth und Graphen, die einen festen Minor Kr ausschließen. Wir präsentieren
Algorithmen im CONGEST- und im neuartigen HYBRID-Kommunikationsmodell, die in
allen relevanten Parametern konkurrenzfähig sind:• Für einen gegebenen Parameter
ϵ > 0 berechnen wir ein Routing-Schema mit Stretch 1 + ϵ. Unser Schema berechnet
Label der Größe Oe(kϵ−2) und wird in Oe(kϵ−3) Zeit im HYBRID-Modell, und Oe(kϵ−3·
HD) Zeit in CONGEST. Dabei bezeichnet HD den Hopdurchmesser des Graphen.• Für
einem Parameter D > 0 unterteilt unser Algorithmus zur Dekomposition den Graphen
in zusammenhängende Subgraphen mit starkem Durchmesser D. Eine Kante e ∈ E der
Länge ℓe hat ihre Endpunkte in zwei verschieden Subgraphen mit der Wahrscheinlichkeit
O(ℓe·log(k log n)/D). Die Dekomposition kann in Oe(k) Zeit im HYBRID-Modell und
O˜(kHD) Zeit in CONGEST berechnet werden. Wir stellen verteilte und parallele
Implementierungen von sequenziellen Divide-and-Conquer-Algorithmen vor, bei denen
wir exakte kürzeste Pfade durch approximative kürzeste Pfade ersetzen. Im Gegensatz
zu exakten Pfaden können diese in der verteilten und parallelen Umgebung effizient
berechnet werden. Außerdem, zeigen wir, dass es ausreicht, anstelle der expliziten
Berechnung von Vertex-Separatoren, einige zufällige Pfade begrenzter Länge zu
wählen und die Separatoren um diese herum zu konstruieren. Schließlich stellen
wir einen SetCover-Algorithmus für das Beeping-Modell vor. Unser Algorithmus läuft
in O(k3) Zeit und hat eine erwartete Approximationsgüte von O(∆3/k log2 ∆). Der
Wert k ∈ [3, log ∆] ist ein Parameter, mit dem wir Laufzeit gegen Approximationsgüte
eintauschen können, ähnlich wie bei dem Algorithmus von Kuhn und Wattenhofer [PODC
’03]. Dieser Algorithmus kann erweitert werden, um das DominatingSet-Problem in
der D-Nachbarschaft eines Graphen mittles eines verteiltes Algorithmus effizient
zu lösen.
- lang: eng
text: This thesis considers algorithmic solutions to problems that arise in the
theoretical study of modern communication networks, such ast he Internet. The
thesis is divided into two main parts. In the first part of this thesis, we show
how to construct an overlay network of degree O(log n) and diameter O(log n) in
O(log n) time starting from an arbitrary weakly connected graph. We assume a synchronous
communication network in which nodes can send messages to nodes they know the
identifier of, and new connections can be established by sending node identifiers.
If the initial network’s graph is weakly connected and has constant degree, then
our algorithm constructs the desired topology with each node sending and receiving
only O(log n) messages in each round in time O(log n), w.h.p. Since the problem
cannot be solved faster than by using pointer jumping for O(log n) rounds (which
would even require each node to communicate Ω(n) bits), our algorithm is asymptotically
optimal. Additionally, we show how our algorithm can be used to efficiently solvegraph
problems in the novel HYBRID model. Motivated by the idea that nodes possess two
different modes of communication, we assume that communication of the initial
edges is unrestricted, whereas only polylogarithmically many messages can be sent
over edges that have been established throughout an algorithm’s execution. For
an (undirected) graph G with arbitrary degree, we show how tocompute connected
components and a spanning forest in O(log n) time, w.h.p. Furthermore, we show
how to compute an MIS in timeO(log ∆ + log log n), w.h.p., where ∆ is the initial
degree of G. In the second part of the thesis, we consider the problems of computing
compact routing tables and low-diameter decompositions for a (weighted) graph
G := (V, E, ℓ) that can be separated through k shortest paths. This class of graphs
includes planar graphs, graphs of bounded treewidth, and graphs that exclude a
fixed minor Kr. We present algorithms in the CONGEST and the novel HYBRID communication
model that are competitive in all relevant parameters:• For a given parameter
ϵ > 0, we compute a routing scheme with stretch 1 + ϵ. Our scheme computes
labels of size Oe(kϵ−2)and is computed in Oe(kϵ−3) time in the HYBRID model and
Oe(kϵ−3· HD) time in CONGEST. Here, HD denotes thenetwork’s hop diameter.• Given
a parameter D > 0, our low-diameter decomposition algorithm divides the graph
into connected subgraphs of strongdiameter D. An edge e ∈ E of length ℓe has endpoints
in different subgraphs with probability O(ℓe·log(k log n)/D). The decomposition
can be computed in Oe(k) time in the HYBRID model and O˜(kHD) time in CONGEST.Broadly
speaking, we present distributed and parallel implementations of sequential divide-and-conquer
algorithms where we replaceexact shortest paths with approximate shortest paths.
In contrast to exact paths, these can be efficiently computed in the distributed
and parallel setting. Further, and perhaps more importantly, we show that instead
of explicitly computing vertex-separators to enable efficientparallelization of
these algorithms, it suffices to sample a few random paths of bounded length and
the nodes close to them. Finally, we present a SetCover algorithm in the Beeping
model. Our algorithm runs in O(k3) time and has an expected approximation ratio
ofO(∆3/k log2 ∆). The value k ∈ [3, log ∆] is a parameter that lets us trade runtime
for approximation ratio similar to the celebrated algorithm by Kuhn and Wattenhofer
[PODC ’03]. This algorithm can then be extended to effieciently solve the DominatingSet-problem
in a graph’s D-neigborhood in a distributed fashion.
author:
- first_name: Thorsten
full_name: Götte, Thorsten
last_name: Götte
citation:
ama: Götte T. Distributed Algorithms for Modern Communication Networks. LibreCat
University; 2025. doi:10.17619/UNIPB/1-2217
apa: Götte, T. (2025). Distributed Algorithms for Modern Communication Networks.
LibreCat University. https://doi.org/10.17619/UNIPB/1-2217
bibtex: '@book{Götte_2025, title={Distributed Algorithms for Modern Communication
Networks}, DOI={10.17619/UNIPB/1-2217},
publisher={LibreCat University}, author={Götte, Thorsten}, year={2025} }'
chicago: Götte, Thorsten. Distributed Algorithms for Modern Communication Networks.
LibreCat University, 2025. https://doi.org/10.17619/UNIPB/1-2217.
ieee: T. Götte, Distributed Algorithms for Modern Communication Networks.
LibreCat University, 2025.
mla: Götte, Thorsten. Distributed Algorithms for Modern Communication Networks.
LibreCat University, 2025, doi:10.17619/UNIPB/1-2217.
short: T. Götte, Distributed Algorithms for Modern Communication Networks, LibreCat
University, 2025.
date_created: 2025-04-02T14:02:32Z
date_updated: 2025-04-02T14:07:48Z
doi: 10.17619/UNIPB/1-2217
extern: '1'
language:
- iso: eng
publisher: LibreCat University
status: public
title: Distributed Algorithms for Modern Communication Networks
type: dissertation
user_id: '34727'
year: '2025'
...
---
_id: '59287'
alternative_title:
- Proceedings of the 18th International Conference on Wirtschaftsinformatik, Paderborn,
Germany, 2023, Vol. 2
citation:
ama: Beverungen D, Lehrer C, Trier M, eds. Solutions and Technologies for Responsible
Digitalization. Springer Nature Switzerland; 2025. doi:10.1007/978-3-031-80122-8
apa: Beverungen, D., Lehrer, C., & Trier, M. (Eds.). (2025). Solutions and
Technologies for Responsible Digitalization. Springer Nature Switzerland.
https://doi.org/10.1007/978-3-031-80122-8
bibtex: '@book{Beverungen_Lehrer_Trier_2025, place={Cham}, title={Solutions and
Technologies for Responsible Digitalization}, DOI={10.1007/978-3-031-80122-8},
publisher={Springer Nature Switzerland}, year={2025} }'
chicago: 'Beverungen, Daniel, Christiane Lehrer, and Matthias Trier, eds. Solutions
and Technologies for Responsible Digitalization. Cham: Springer Nature Switzerland,
2025. https://doi.org/10.1007/978-3-031-80122-8.'
ieee: 'D. Beverungen, C. Lehrer, and M. Trier, Eds., Solutions and Technologies
for Responsible Digitalization. Cham: Springer Nature Switzerland, 2025.'
mla: Beverungen, Daniel, et al., editors. Solutions and Technologies for Responsible
Digitalization. Springer Nature Switzerland, 2025, doi:10.1007/978-3-031-80122-8.
short: D. Beverungen, C. Lehrer, M. Trier, eds., Solutions and Technologies for
Responsible Digitalization, Springer Nature Switzerland, Cham, 2025.
date_created: 2025-04-03T08:16:56Z
date_updated: 2025-04-03T08:17:32Z
department:
- _id: '526'
doi: 10.1007/978-3-031-80122-8
editor:
- first_name: Daniel
full_name: Beverungen, Daniel
id: '59677'
last_name: Beverungen
- first_name: Christiane
full_name: Lehrer, Christiane
last_name: Lehrer
- first_name: Matthias
full_name: Trier, Matthias
id: '72744'
last_name: Trier
language:
- iso: eng
place: Cham
publication_identifier:
isbn:
- '9783031801211'
- '9783031801228'
issn:
- 2195-4968
- 2195-4976
publication_status: published
publisher: Springer Nature Switzerland
status: public
title: Solutions and Technologies for Responsible Digitalization
type: book_editor
user_id: '21671'
year: '2025'
...
---
_id: '60186'
author:
- first_name: A
full_name: Lang, A
last_name: Lang
- first_name: E
full_name: Schaefer, E
last_name: Schaefer
- first_name: Y
full_name: Kupriyanova, Y
last_name: Kupriyanova
- first_name: J
full_name: Goletzke, J
last_name: Goletzke
- first_name: KS
full_name: Weber, KS
last_name: Weber
- first_name: Anette
full_name: Buyken, Anette
id: '65985'
last_name: Buyken
- first_name: S
full_name: Kahl, S
last_name: Kahl
- first_name: OP
full_name: Zaharia, OP
last_name: Zaharia
- first_name: C
full_name: Herder, C
last_name: Herder
- first_name: VB
full_name: Schrauwen-Hinderling, VB
last_name: Schrauwen-Hinderling
- first_name: O
full_name: Kuss, O
last_name: Kuss
- first_name: R
full_name: Wagner, R
last_name: Wagner
- first_name: M
full_name: Roden, M
last_name: Roden
- first_name: S
full_name: Schlesinger, S
last_name: Schlesinger
- first_name: German
full_name: Diabetes Study Group, German
last_name: Diabetes Study Group
citation:
ama: Lang A, Schaefer E, Kupriyanova Y, et al. Cross-sectional association between
the isocaloric replacement of carbohydrates with protein and fat in relation to
fat compartments distribution and hepatic lipid content in recent-onset type 1
and type 2 diabetes. Nutr J. 2025;24(1):74.
apa: Lang, A., Schaefer, E., Kupriyanova, Y., Goletzke, J., Weber, K., Buyken, A.,
Kahl, S., Zaharia, O., Herder, C., Schrauwen-Hinderling, V., Kuss, O., Wagner,
R., Roden, M., Schlesinger, S., & Diabetes Study Group, G. (2025). Cross-sectional
association between the isocaloric replacement of carbohydrates with protein and
fat in relation to fat compartments distribution and hepatic lipid content in
recent-onset type 1 and type 2 diabetes. Nutr J, 24(1), 74.
bibtex: '@article{Lang_Schaefer_Kupriyanova_Goletzke_Weber_Buyken_Kahl_Zaharia_Herder_Schrauwen-Hinderling_et
al._2025, title={Cross-sectional association between the isocaloric replacement
of carbohydrates with protein and fat in relation to fat compartments distribution
and hepatic lipid content in recent-onset type 1 and type 2 diabetes.}, volume={24},
number={1}, journal={Nutr J}, author={Lang, A and Schaefer, E and Kupriyanova,
Y and Goletzke, J and Weber, KS and Buyken, Anette and Kahl, S and Zaharia, OP
and Herder, C and Schrauwen-Hinderling, VB and et al.}, year={2025}, pages={74}
}'
chicago: 'Lang, A, E Schaefer, Y Kupriyanova, J Goletzke, KS Weber, Anette Buyken,
S Kahl, et al. “Cross-Sectional Association between the Isocaloric Replacement
of Carbohydrates with Protein and Fat in Relation to Fat Compartments Distribution
and Hepatic Lipid Content in Recent-Onset Type 1 and Type 2 Diabetes.” Nutr
J 24, no. 1 (2025): 74.'
ieee: A. Lang et al., “Cross-sectional association between the isocaloric
replacement of carbohydrates with protein and fat in relation to fat compartments
distribution and hepatic lipid content in recent-onset type 1 and type 2 diabetes.,”
Nutr J, vol. 24, no. 1, p. 74, 2025.
mla: Lang, A., et al. “Cross-Sectional Association between the Isocaloric Replacement
of Carbohydrates with Protein and Fat in Relation to Fat Compartments Distribution
and Hepatic Lipid Content in Recent-Onset Type 1 and Type 2 Diabetes.” Nutr
J, vol. 24, no. 1, 2025, p. 74.
short: A. Lang, E. Schaefer, Y. Kupriyanova, J. Goletzke, K. Weber, A. Buyken, S.
Kahl, O. Zaharia, C. Herder, V. Schrauwen-Hinderling, O. Kuss, R. Wagner, M. Roden,
S. Schlesinger, G. Diabetes Study Group, Nutr J 24 (2025) 74.
date_created: 2025-06-11T08:54:08Z
date_updated: 2025-06-11T08:55:22Z
department:
- _id: '22'
external_id:
pmid:
- '40349038'
intvolume: ' 24'
issue: '1'
language:
- iso: eng
page: '74'
pmid: '1'
publication: Nutr J
publication_identifier:
issn:
- 1475-2891
status: public
title: Cross-sectional association between the isocaloric replacement of carbohydrates
with protein and fat in relation to fat compartments distribution and hepatic lipid
content in recent-onset type 1 and type 2 diabetes.
type: journal_article
user_id: '92491'
volume: 24
year: '2025'
...
---
_id: '60184'
author:
- first_name: KA
full_name: Della Corte, KA
last_name: Della Corte
- first_name: T
full_name: Bosler, T
last_name: Bosler
- first_name: C
full_name: McClure, C
last_name: McClure
- first_name: Anette
full_name: Buyken, Anette
id: '65985'
last_name: Buyken
- first_name: JD
full_name: LeCheminant, JD
last_name: LeCheminant
- first_name: L
full_name: Schwingshackl, L
last_name: Schwingshackl
- first_name: D
full_name: Della Corte, D
last_name: Della Corte
citation:
ama: 'Della Corte K, Bosler T, McClure C, et al. Dietary Sugar Intake and Incident
Type 2 Diabetes Risk: A Systematic Review and Dose-Response Meta-Analysis of Prospective
Cohort Studies. Adv Nutr. 2025;16(5):100413.'
apa: 'Della Corte, K., Bosler, T., McClure, C., Buyken, A., LeCheminant, J., Schwingshackl,
L., & Della Corte, D. (2025). Dietary Sugar Intake and Incident Type 2 Diabetes
Risk: A Systematic Review and Dose-Response Meta-Analysis of Prospective Cohort
Studies. Adv Nutr, 16(5), 100413.'
bibtex: '@article{Della Corte_Bosler_McClure_Buyken_LeCheminant_Schwingshackl_Della
Corte_2025, title={Dietary Sugar Intake and Incident Type 2 Diabetes Risk: A Systematic
Review and Dose-Response Meta-Analysis of Prospective Cohort Studies.}, volume={16},
number={5}, journal={Adv Nutr}, author={Della Corte, KA and Bosler, T and McClure,
C and Buyken, Anette and LeCheminant, JD and Schwingshackl, L and Della Corte,
D}, year={2025}, pages={100413} }'
chicago: 'Della Corte, KA, T Bosler, C McClure, Anette Buyken, JD LeCheminant, L
Schwingshackl, and D Della Corte. “Dietary Sugar Intake and Incident Type 2 Diabetes
Risk: A Systematic Review and Dose-Response Meta-Analysis of Prospective Cohort
Studies.” Adv Nutr 16, no. 5 (2025): 100413.'
ieee: 'K. Della Corte et al., “Dietary Sugar Intake and Incident Type 2 Diabetes
Risk: A Systematic Review and Dose-Response Meta-Analysis of Prospective Cohort
Studies.,” Adv Nutr, vol. 16, no. 5, p. 100413, 2025.'
mla: 'Della Corte, KA, et al. “Dietary Sugar Intake and Incident Type 2 Diabetes
Risk: A Systematic Review and Dose-Response Meta-Analysis of Prospective Cohort
Studies.” Adv Nutr, vol. 16, no. 5, 2025, p. 100413.'
short: K. Della Corte, T. Bosler, C. McClure, A. Buyken, J. LeCheminant, L. Schwingshackl,
D. Della Corte, Adv Nutr 16 (2025) 100413.
date_created: 2025-06-11T08:51:45Z
date_updated: 2025-06-11T08:52:32Z
department:
- _id: '22'
external_id:
pmid:
- '40122386'
intvolume: ' 16'
issue: '5'
language:
- iso: eng
page: '100413'
pmid: '1'
publication: Adv Nutr
publication_identifier:
issn:
- 2161-8313
- 2156-5376
status: public
title: 'Dietary Sugar Intake and Incident Type 2 Diabetes Risk: A Systematic Review
and Dose-Response Meta-Analysis of Prospective Cohort Studies.'
type: journal_article
user_id: '92491'
volume: 16
year: '2025'
...
---
_id: '60419'
author:
- first_name: David
full_name: Bartlitz, David
id: '104560'
last_name: Bartlitz
orcid: '0000-0003-2967-8299 '
citation:
ama: Bartlitz D. Weigerung der Gewährleistung der Interoperabilität einer Plattform
mit App eines Drittunternehmens. Anmerkung zu EuGH, Urt. v. 25. 2. 2025 - C-233/23.
Europäische Zeitschrift für Wirtschaftsrecht (EuZW). 2025;(10):483-484.
apa: Bartlitz, D. (2025). Weigerung der Gewährleistung der Interoperabilität einer
Plattform mit App eines Drittunternehmens. Anmerkung zu EuGH, Urt. v. 25. 2. 2025
- C-233/23. Europäische Zeitschrift für Wirtschaftsrecht (EuZW), 10,
483–484.
bibtex: '@article{Bartlitz_2025, title={Weigerung der Gewährleistung der Interoperabilität
einer Plattform mit App eines Drittunternehmens. Anmerkung zu EuGH, Urt. v. 25.
2. 2025 - C-233/23}, number={10}, journal={Europäische Zeitschrift für Wirtschaftsrecht
(EuZW)}, author={Bartlitz, David}, year={2025}, pages={483–484} }'
chicago: 'Bartlitz, David. “Weigerung der Gewährleistung der Interoperabilität einer
Plattform mit App eines Drittunternehmens. Anmerkung zu EuGH, Urt. v. 25. 2. 2025
- C-233/23.” Europäische Zeitschrift für Wirtschaftsrecht (EuZW), no. 10
(2025): 483–84.'
ieee: D. Bartlitz, “Weigerung der Gewährleistung der Interoperabilität einer Plattform
mit App eines Drittunternehmens. Anmerkung zu EuGH, Urt. v. 25. 2. 2025 - C-233/23,”
Europäische Zeitschrift für Wirtschaftsrecht (EuZW), no. 10, pp. 483–484,
2025.
mla: Bartlitz, David. “Weigerung der Gewährleistung der Interoperabilität einer
Plattform mit App eines Drittunternehmens. Anmerkung zu EuGH, Urt. v. 25. 2. 2025
- C-233/23.” Europäische Zeitschrift für Wirtschaftsrecht (EuZW), no. 10,
2025, pp. 483–84.
short: D. Bartlitz, Europäische Zeitschrift für Wirtschaftsrecht (EuZW) (2025) 483–484.
date_created: 2025-06-26T12:32:28Z
date_updated: 2025-06-26T12:43:10Z
department:
- _id: '845'
issue: '10'
language:
- iso: ger
main_file_link:
- url: https://beck-online.beck.de/Bcid/Y-300-Z-EUZW-B-2025-H-10-Gl-5
page: 483-484
publication: Europäische Zeitschrift für Wirtschaftsrecht (EuZW)
publication_status: published
status: public
title: Weigerung der Gewährleistung der Interoperabilität einer Plattform mit App
eines Drittunternehmens. Anmerkung zu EuGH, Urt. v. 25. 2. 2025 - C-233/23
type: journal_article
user_id: '95606'
year: '2025'
...
---
_id: '60507'
abstract:
- lang: eng
text: DNA origami nanostructures are powerful molecular tools for the controlled
arrangement of functional molecules and thus have important applications in biomedicine,
sensing, and materials science. The fabrication of DNA origami...
author:
- first_name: Emilia
full_name: Tomm, Emilia
id: '68157'
last_name: Tomm
- first_name: Guido
full_name: Grundmeier, Guido
id: '194'
last_name: Grundmeier
- first_name: Adrian
full_name: Keller, Adrian
id: '48864'
last_name: Keller
orcid: 0000-0001-7139-3110
citation:
ama: Tomm E, Grundmeier G, Keller A. Cost-efficient folding of functionalized DNA
origami nanostructures via staple recycling. Nanoscale. Published online
2025. doi:10.1039/d5nr01435b
apa: Tomm, E., Grundmeier, G., & Keller, A. (2025). Cost-efficient folding of
functionalized DNA origami nanostructures via staple recycling. Nanoscale.
https://doi.org/10.1039/d5nr01435b
bibtex: '@article{Tomm_Grundmeier_Keller_2025, title={Cost-efficient folding of
functionalized DNA origami nanostructures via staple recycling}, DOI={10.1039/d5nr01435b},
journal={Nanoscale}, publisher={Royal Society of Chemistry (RSC)}, author={Tomm,
Emilia and Grundmeier, Guido and Keller, Adrian}, year={2025} }'
chicago: Tomm, Emilia, Guido Grundmeier, and Adrian Keller. “Cost-Efficient Folding
of Functionalized DNA Origami Nanostructures via Staple Recycling.” Nanoscale,
2025. https://doi.org/10.1039/d5nr01435b.
ieee: 'E. Tomm, G. Grundmeier, and A. Keller, “Cost-efficient folding of functionalized
DNA origami nanostructures via staple recycling,” Nanoscale, 2025, doi:
10.1039/d5nr01435b.'
mla: Tomm, Emilia, et al. “Cost-Efficient Folding of Functionalized DNA Origami
Nanostructures via Staple Recycling.” Nanoscale, Royal Society of Chemistry
(RSC), 2025, doi:10.1039/d5nr01435b.
short: E. Tomm, G. Grundmeier, A. Keller, Nanoscale (2025).
date_created: 2025-07-03T11:26:30Z
date_updated: 2025-07-03T11:27:19Z
department:
- _id: '302'
doi: 10.1039/d5nr01435b
language:
- iso: eng
publication: Nanoscale
publication_identifier:
issn:
- 2040-3364
- 2040-3372
publication_status: published
publisher: Royal Society of Chemistry (RSC)
status: public
title: Cost-efficient folding of functionalized DNA origami nanostructures via staple
recycling
type: journal_article
user_id: '48864'
year: '2025'
...
---
_id: '60530'
article_type: original
author:
- first_name: Elke
full_name: Grimminger-Seidensticker, Elke
id: '85816'
last_name: Grimminger-Seidensticker
- first_name: 'Autorengruppe '
full_name: 'ComeNet 5, Autorengruppe '
last_name: ComeNet 5
citation:
ama: Grimminger-Seidensticker E, ComeNet 5 A. Körperbilder und Social Media im Sportunterricht.
Herausforderungen und Chancen für Lehrkräfte. sportunterricht. 2025;74(6):250-253.
doi:10.30426/SU-2025-06-2
apa: Grimminger-Seidensticker, E., & ComeNet 5, A. (2025). Körperbilder und
Social Media im Sportunterricht. Herausforderungen und Chancen für Lehrkräfte.
sportunterricht, 74(6), 250–253. https://doi.org/10.30426/SU-2025-06-2
bibtex: '@article{Grimminger-Seidensticker_ComeNet 5_2025, title={Körperbilder und
Social Media im Sportunterricht. Herausforderungen und Chancen für Lehrkräfte},
volume={74}, DOI={10.30426/SU-2025-06-2},
number={6}, journal={sportunterricht}, author={Grimminger-Seidensticker, Elke
and ComeNet 5, Autorengruppe }, year={2025}, pages={250–253} }'
chicago: 'Grimminger-Seidensticker, Elke, and Autorengruppe ComeNet 5. “Körperbilder
und Social Media im Sportunterricht. Herausforderungen und Chancen für Lehrkräfte.”
sportunterricht 74, no. 6 (2025): 250–53. https://doi.org/10.30426/SU-2025-06-2.'
ieee: 'E. Grimminger-Seidensticker and A. ComeNet 5, “Körperbilder und Social Media
im Sportunterricht. Herausforderungen und Chancen für Lehrkräfte,” sportunterricht,
vol. 74, no. 6, pp. 250–253, 2025, doi: 10.30426/SU-2025-06-2.'
mla: Grimminger-Seidensticker, Elke, and Autorengruppe ComeNet 5. “Körperbilder
und Social Media im Sportunterricht. Herausforderungen und Chancen für Lehrkräfte.”
sportunterricht, vol. 74, no. 6, 2025, pp. 250–53, doi:10.30426/SU-2025-06-2.
short: E. Grimminger-Seidensticker, A. ComeNet 5, sportunterricht 74 (2025) 250–253.
date_created: 2025-07-07T06:51:33Z
date_updated: 2025-07-07T06:54:22Z
department:
- _id: '17'
- _id: '174'
- _id: '320'
doi: 10.30426/SU-2025-06-2
intvolume: ' 74'
issue: '6'
language:
- iso: ger
page: 250 - 253
publication: sportunterricht
status: public
title: Körperbilder und Social Media im Sportunterricht. Herausforderungen und Chancen
für Lehrkräfte
type: journal_article
user_id: '85816'
volume: 74
year: '2025'
...
---
_id: '60602'
abstract:
- lang: eng
text: "Abstract\r\n It has been established
that, in Bayesian tasks, performance and typical errors in reading
information from filled visualizations depend both on the type of the provided
visualization and information format. However, apart from reading visualizations,
students should also be able to create visualizations on their own and successfully
use them as heuristic tools in modeling tasks. In this paper, we first want to
broaden the view on Bayesian reasoning to probabilistic tasks with two binary
events in general and embed the whole process of solving these tasks using probabilistic
visualizations in a modified modeling framework. Thereby, it becomes apparent
that most of the steps remained untouched by existing research. Second, in the
present empirical study, we focused on one part of the largely unexplored creation
process and examined entering statistical information
into empty visualizations as heuristic tools. N = 172
participants had to enter conditional and joint probabilities or the corresponding
frequencies into empty visualizations in a paper-and-pencil test. We analyze (a)
students’ performance when entering information in visualizations and (b) typical
errors, both dependent on the information format (probabilities
vs. natural frequencies), which empty visualization structure
(2⨯2 table, double tree, net diagram) was provided, and type of information
(conditional vs. joint information). The well-known positive effect of natural
frequencies on participants’ performance was evident when entering conditional
information into 2⨯2 tables and net diagrams. However, with respect to joint information,
no superior effect of frequencies was observed. Furthermore, the theoretical implementation
of our research in a modeling cycle allows us to identify desiderata for future
research."
author:
- first_name: Michael
full_name: Rößner, Michael
last_name: Rößner
- first_name: Karin
full_name: Binder, Karin
last_name: Binder
- first_name: Corbinian
full_name: Geier, Corbinian
last_name: Geier
- first_name: Stefan
full_name: Krauss, Stefan
last_name: Krauss
citation:
ama: Rößner M, Binder K, Geier C, Krauss S. Students’ performance and typical errors
in filling empty probabilistic visualizations with probabilities or frequencies.
Educational Studies in Mathematics. Published online 2025. doi:10.1007/s10649-024-10372-y
apa: Rößner, M., Binder, K., Geier, C., & Krauss, S. (2025). Students’ performance
and typical errors in filling empty probabilistic visualizations with probabilities
or frequencies. Educational Studies in Mathematics. https://doi.org/10.1007/s10649-024-10372-y
bibtex: '@article{Rößner_Binder_Geier_Krauss_2025, title={Students’ performance
and typical errors in filling empty probabilistic visualizations with probabilities
or frequencies}, DOI={10.1007/s10649-024-10372-y},
journal={Educational Studies in Mathematics}, publisher={Springer Science and
Business Media LLC}, author={Rößner, Michael and Binder, Karin and Geier, Corbinian
and Krauss, Stefan}, year={2025} }'
chicago: Rößner, Michael, Karin Binder, Corbinian Geier, and Stefan Krauss. “Students’
Performance and Typical Errors in Filling Empty Probabilistic Visualizations with
Probabilities or Frequencies.” Educational Studies in Mathematics, 2025.
https://doi.org/10.1007/s10649-024-10372-y.
ieee: 'M. Rößner, K. Binder, C. Geier, and S. Krauss, “Students’ performance and
typical errors in filling empty probabilistic visualizations with probabilities
or frequencies,” Educational Studies in Mathematics, 2025, doi: 10.1007/s10649-024-10372-y.'
mla: Rößner, Michael, et al. “Students’ Performance and Typical Errors in Filling
Empty Probabilistic Visualizations with Probabilities or Frequencies.” Educational
Studies in Mathematics, Springer Science and Business Media LLC, 2025, doi:10.1007/s10649-024-10372-y.
short: M. Rößner, K. Binder, C. Geier, S. Krauss, Educational Studies in Mathematics
(2025).
date_created: 2025-07-14T12:26:14Z
date_updated: 2025-07-14T12:30:58Z
doi: 10.1007/s10649-024-10372-y
language:
- iso: eng
publication: Educational Studies in Mathematics
publication_identifier:
issn:
- 0013-1954
- 1573-0816
publication_status: published
publisher: Springer Science and Business Media LLC
status: public
title: Students’ performance and typical errors in filling empty probabilistic visualizations
with probabilities or frequencies
type: journal_article
user_id: '87801'
year: '2025'
...
---
_id: '60606'
abstract:
- lang: eng
text: Streptavidin binding to DNA origami-supported high-density biotin
arrays is investigated for selected experimental parameters. While bidentate binding
and steric hindrance can be minimized, molecular crowding limits the binding yields
in 2D arrays.
author:
- first_name: Lukas
full_name: Rabbe, Lukas
last_name: Rabbe
- first_name: Emilia
full_name: Tomm, Emilia
id: '68157'
last_name: Tomm
- first_name: Guido
full_name: Grundmeier, Guido
id: '194'
last_name: Grundmeier
- first_name: Adrian
full_name: Keller, Adrian
id: '48864'
last_name: Keller
orcid: 0000-0001-7139-3110
citation:
ama: Rabbe L, Tomm E, Grundmeier G, Keller A. Toward high-density streptavidin arrays
on DNA origami nanostructures. RSC Advances. 2025;15(30):24536-24543. doi:10.1039/d5ra03393d
apa: Rabbe, L., Tomm, E., Grundmeier, G., & Keller, A. (2025). Toward high-density
streptavidin arrays on DNA origami nanostructures. RSC Advances, 15(30),
24536–24543. https://doi.org/10.1039/d5ra03393d
bibtex: '@article{Rabbe_Tomm_Grundmeier_Keller_2025, title={Toward high-density
streptavidin arrays on DNA origami nanostructures}, volume={15}, DOI={10.1039/d5ra03393d},
number={30}, journal={RSC Advances}, publisher={Royal Society of Chemistry (RSC)},
author={Rabbe, Lukas and Tomm, Emilia and Grundmeier, Guido and Keller, Adrian},
year={2025}, pages={24536–24543} }'
chicago: 'Rabbe, Lukas, Emilia Tomm, Guido Grundmeier, and Adrian Keller. “Toward
High-Density Streptavidin Arrays on DNA Origami Nanostructures.” RSC Advances
15, no. 30 (2025): 24536–43. https://doi.org/10.1039/d5ra03393d.'
ieee: 'L. Rabbe, E. Tomm, G. Grundmeier, and A. Keller, “Toward high-density streptavidin
arrays on DNA origami nanostructures,” RSC Advances, vol. 15, no. 30, pp.
24536–24543, 2025, doi: 10.1039/d5ra03393d.'
mla: Rabbe, Lukas, et al. “Toward High-Density Streptavidin Arrays on DNA Origami
Nanostructures.” RSC Advances, vol. 15, no. 30, Royal Society of Chemistry
(RSC), 2025, pp. 24536–43, doi:10.1039/d5ra03393d.
short: L. Rabbe, E. Tomm, G. Grundmeier, A. Keller, RSC Advances 15 (2025) 24536–24543.
date_created: 2025-07-15T06:06:48Z
date_updated: 2025-07-15T06:07:16Z
department:
- _id: '302'
doi: 10.1039/d5ra03393d
intvolume: ' 15'
issue: '30'
language:
- iso: eng
page: 24536-24543
publication: RSC Advances
publication_identifier:
issn:
- 2046-2069
publication_status: published
publisher: Royal Society of Chemistry (RSC)
status: public
title: Toward high-density streptavidin arrays on DNA origami nanostructures
type: journal_article
user_id: '48864'
volume: 15
year: '2025'
...
---
_id: '55037'
abstract:
- lang: eng
text: "Estimating ground state energies of many-body Hamiltonians is a central task\r\nin
many areas of quantum physics. In this work, we give quantum algorithms\r\nwhich,
given any $k$-body Hamiltonian $H$, compute an estimate for the ground\r\nstate
energy and prepare a quantum state achieving said energy, respectively.\r\nSpecifically,
for any $\\varepsilon>0$, our algorithms return, with high\r\nprobability, an
estimate of the ground state energy of $H$ within additive\r\nerror $\\varepsilon
M$, or a quantum state with the corresponding energy. Here,\r\n$M$ is the total
strength of all interaction terms, which in general is\r\nextensive in the system
size. Our approach makes no assumptions about the\r\ngeometry or spatial locality
of interaction terms of the input Hamiltonian and\r\nthus handles even long-range
or all-to-all interactions, such as in quantum\r\nchemistry, where lattice-based
techniques break down. In this fully general\r\nsetting, the runtime of our algorithms
scales as $2^{cn/2}$ for $c<1$, yielding\r\nthe first quantum algorithms for low-energy
estimation breaking the natural\r\nbound based on Grover search. The core of our
approach is remarkably simple,\r\nand relies on showing that any $k$-body Hamiltonian
has a low-energy subspace\r\nof exponential dimension."
author:
- first_name: Harry
full_name: Buhrman, Harry
last_name: Buhrman
- first_name: Sevag
full_name: Gharibian, Sevag
id: '71541'
last_name: Gharibian
orcid: 0000-0002-9992-3379
- first_name: Zeph
full_name: Landau, Zeph
last_name: Landau
- first_name: François Le
full_name: Gall, François Le
last_name: Gall
- first_name: Norbert
full_name: Schuch, Norbert
last_name: Schuch
- first_name: Suguru
full_name: Tamaki, Suguru
last_name: Tamaki
citation:
ama: Buhrman H, Gharibian S, Landau Z, Gall FL, Schuch N, Tamaki S. Beating Grover
search for low-energy estimation and state preparation. Physical Review Letters.
2025;135:030601. doi:10.1103/29qw-bssx
apa: Buhrman, H., Gharibian, S., Landau, Z., Gall, F. L., Schuch, N., & Tamaki,
S. (2025). Beating Grover search for low-energy estimation and state preparation.
Physical Review Letters, 135, 030601. https://doi.org/10.1103/29qw-bssx
bibtex: '@article{Buhrman_Gharibian_Landau_Gall_Schuch_Tamaki_2025, title={Beating
Grover search for low-energy estimation and state preparation}, volume={135},
DOI={10.1103/29qw-bssx}, journal={Physical
Review Letters}, author={Buhrman, Harry and Gharibian, Sevag and Landau, Zeph
and Gall, François Le and Schuch, Norbert and Tamaki, Suguru}, year={2025}, pages={030601}
}'
chicago: 'Buhrman, Harry, Sevag Gharibian, Zeph Landau, François Le Gall, Norbert
Schuch, and Suguru Tamaki. “Beating Grover Search for Low-Energy Estimation and
State Preparation.” Physical Review Letters 135 (2025): 030601. https://doi.org/10.1103/29qw-bssx.'
ieee: 'H. Buhrman, S. Gharibian, Z. Landau, F. L. Gall, N. Schuch, and S. Tamaki,
“Beating Grover search for low-energy estimation and state preparation,” Physical
Review Letters, vol. 135, p. 030601, 2025, doi: 10.1103/29qw-bssx.'
mla: Buhrman, Harry, et al. “Beating Grover Search for Low-Energy Estimation and
State Preparation.” Physical Review Letters, vol. 135, 2025, p. 030601,
doi:10.1103/29qw-bssx.
short: H. Buhrman, S. Gharibian, Z. Landau, F.L. Gall, N. Schuch, S. Tamaki, Physical
Review Letters 135 (2025) 030601.
date_created: 2024-07-04T09:02:42Z
date_updated: 2025-07-16T10:25:43Z
doi: 10.1103/29qw-bssx
external_id:
arxiv:
- '2407.03073'
intvolume: ' 135'
language:
- iso: eng
page: '030601'
publication: Physical Review Letters
publication_status: published
status: public
title: Beating Grover search for low-energy estimation and state preparation
type: journal_article
user_id: '71541'
volume: 135
year: '2025'
...