@inbook{65602, abstract = {{This chapter explores the crucial role of simulation and modelling of electronic and photonic components for terahertz (THz) systems. THz-related challenges already begin with setting up the signal generation and sampling parameters and continue with the realistic modelling of the electronic and photonic building blocks. Hereby, photonic components require not only the modelling of the optical signal propagation but also the modelling of the electronic interface in the THz regime. Furthermore, when advancing to the simulation of systems like fully integrated electronic transmit and receive frontends or photonically assisted analogue-to-digital converters (ADCs), it is up to the designer to find a suitable level of abstraction. Size, complexity, and available computational power versus accuracy must be taken into consideration and prioritized against each other.}}, author = {{Wrana, Dominik and Weizel, Maxim and Haussmann, Simon and Bahmanian, Meysam and Kallfass, Ingmar and Scheytt, J. Christoph}}, booktitle = {{Metrology for THz Communications}}, isbn = {{9783032019851}}, issn = {{0342-4111}}, publisher = {{Springer Nature Switzerland}}, title = {{{Simulation and Modelling of Electronic and Photonic Components}}}, doi = {{10.1007/978-3-032-01986-8_36}}, year = {{2026}}, } @inproceedings{65625, author = {{Friesen, Olga and Hölscher, Jonas and Siegmund, Michael B. K. and Claes, Leander and Henning, Bernd}}, title = {{{Experimental and Numerical Investigation of Jump Phenomena in the Frequency Response of Piezoelectric Systems}}}, year = {{2026}}, } @inproceedings{65606, abstract = {{Sound capture by microphone arrays opens the possibility to exploit spatial, in addition to spectral, information for diarization and signal enhancement, two important tasks in meeting transcription. However, there is no one-to-one mapping of positions in space to speakers if speakers move. Here, we address this by proposing a novel joint spatial and spectral mixture model, whose two submodels are loosely coupled by modeling the relationship between speaker and position index probabilistically. Thus, spatial and spectral information can be jointly exploited, while at the same time allowing for speakers speaking from different positions. Experiments on the LibriCSS data set with simulated speaker position changes show great improvements over tightly coupled subsystems.}}, author = {{Meise, Adrian Tobias and Cord-Landwehr, Tobias and Boeddeker, Christoph and Delcroix, Marc and Nakatani, Tomohiro and Haeb-Umbach, Reinhold}}, booktitle = {{ICASSP 2026 - 2026 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)}}, keywords = {{mixture models, meeting processing, diarization, source separation}}, location = {{Barcelona}}, publisher = {{IEEE}}, title = {{{Loose Coupling of Spectral and Spatial Models for Multi-Channel Diarization and Enhancement of Meetings in Dynamic Environments}}}, doi = {{10.1109/icassp55912.2026.11463540}}, year = {{2026}}, } @inproceedings{57866, abstract = {{The theory of Total Function NP (TFNP) and its subclasses says that, even if one is promised an efficiently verifiable proof exists for a problem, finding this proof can be intractable. Despite the success of the theory at showing intractability of problems such as computing Brouwer fixed points and Nash equilibria, subclasses of TFNP remain arguably few and far between. In this work, we define two new subclasses of TFNP borne of the study of complex polynomial systems: Multi-homogeneous Systems (MHS) and Sparse Fundamental Theorem of Algebra (SFTA). The first of these is based on B\'ezout's theorem from algebraic geometry, marking the first TFNP subclass based on an algebraic geometric principle. At the heart of our study is the computational problem known as Quantum SAT (QSAT) with a System of Distinct Representatives (SDR), first studied by [Laumann, L\"auchli, Moessner, Scardicchio, and Sondhi 2010]. Among other results, we show that QSAT with SDR is MHS-complete, thus giving not only the first link between quantum complexity theory and TFNP, but also the first TFNP problem whose classical variant (SAT with SDR) is easy but whose quantum variant is hard. We also show how to embed the roots of a sparse, high-degree, univariate polynomial into QSAT with SDR, obtaining that SFTA is contained in a zero-error version of MHS. We conjecture this construction also works in the low-error setting, which would imply SFTA is contained in MHS.}}, author = {{Aldi, Marco and Gharibian, Sevag and Rudolph, Dorian}}, booktitle = {{17th Innovations in Theoretical Computer Science Conference (ITCS 2026)}}, pages = {{7:1--7:24}}, title = {{{An unholy trinity: TFNP, polynomial systems, and the quantum satisfiability problem}}}, volume = {{362}}, year = {{2026}}, } @article{65631, abstract = {{Abstract Mathematics textbooks used to be the key resource for students’ self-regulated learning of mathematics. Primarily due to the digitalization of society, students have potentially greater access to a wider range of resources such as internet search engines, learning platforms, educational videos, and Generative AI. This study investigates the role of the mathematics textbook in comparison to other resources within students’ self-regulated learning practices. Data were collected via a survey of 1101 German secondary students, representing three school types ( Gymnasium , Gesamtschule , Realschule ) and three grade levels (6, 9, and upper secondary). The questionnaire assessed the frequency of resource use in and outside class, reasons and purposes of use, and resource-based strategies when facing learning challenges outside class. Results show that the printed mathematics textbook is the most frequently used resource both in class and outside class. The textbook remains the most relevant resource for key purposes, such as an aid for doing homework and preparing for tests and exams. However, its dominance diminishes with age: in upper secondary school, students increasingly rely on self-created notes, and online resources. Correlation analyses reveal moderate to strong links between in-class and out-of-class use, suggesting an association between resource use and classroom culture. The findings underscore the textbook’s enduring centrality as a foundational, trusted resource within a dynamic and increasingly diverse learning environment. This study calls for pedagogical approaches that integrate textbooks more intentionally within broader resource systems, supporting students’ agency and strategic resource selection in an era of digital abundance. }}, author = {{Stallmeister, Lea and Rezat, Sebastian}}, issn = {{0013-1954}}, journal = {{Educational Studies in Mathematics}}, keywords = {{mathematics, textbooks, userstudy, resources, digital resources, students, secondary eduction}}, publisher = {{Springer Science and Business Media LLC}}, title = {{{The role of the mathematics textbook in times of resource diversity}}}, doi = {{10.1007/s10649-026-10511-7}}, year = {{2026}}, } @article{65242, abstract = {{With the growing demand for lightweight solutions to reduce emissions, especially in the transportation, automotive and aerospace sectors, recyclable, continuous fiber-reinforced plastic composite laminates with a thermoplastic matrix are of rising interest. To achieve their maximum mechanical properties, the fiber-matrix adhesion (FMA) is critical. In this work, continuous fiber-reinforced thermoplastic laminates (CFRTPL) with a polypropylene (PP) matrix and twill woven glass fiber fabrics are produced by film stacking. The films used contain different amounts of maleic-anhydride-grafted PP (MA-g-PP) as a coupling agent to produce CFRTPL of different mechanical strengths. To analyze the FMA, the CFRTPL are subjected to Charpy-impact and tensile tests. Additionally, single fiber pull-out tests (SFPT) are conducted to further investigate the effect of MA-g-PP on the FMA. The results of the SFPT show an improvement in apparent interfacial shear strength (AIFSS) when the MA-g-PP content is increased, which can be attributed to an increase in FMA. However, the research shows that MA-g-PP has a low impact on the mechanical properties if the force is applied parallel to the warp and weft threads during tensile testing and the results of the Charpy-impact testing suffer from embrittlement of the matrix material. Subsequently, the results of this study are compared to three-point flexural tests conducted in a previous study. It can be concluded that tensile and impact tests are not suited to investigate FMA on a macroscopic scale, while SFPT and flexural tests provide a better alternative.}}, author = {{Moritzer, Elmar and Brandes, Philipp and Wittler, Maurice and Claes, Leander and Wippermann, Mareen and Haag, Markus and Gries, Thomas and Henning, Bernd}}, issn = {{0930-777X}}, journal = {{International Polymer Processing}}, publisher = {{Walter de Gruyter GmbH}}, title = {{{Fiber-matrix adhesion in glass fiber reinforced thermoplastic composite laminates and its effect on mechanical properties}}}, doi = {{10.1515/ipp-2025-0077}}, year = {{2026}}, } @article{65630, abstract = {{Mathematics textbooks used to be the key resource for students’ self-regulated learning of mathematics. Primarily due to the digitalization of society, students have potentially greater access to a wider range of resources such as internet search engines, learning platforms, educational videos, and Generative AI. This study investigates the role of the mathematics textbook in comparison to other resources within students’ self-regulated learning practices. Data were collected via a survey of 1101 German secondary students, representing three school types (Gymnasium, Gesamtschule, Realschule) and three grade levels (6, 9, and upper secondary). The questionnaire assessed the frequency of resource use in and outside class, reasons and purposes of use, and resource-based strategies when facing learning challenges outside class. Results show that the printed mathematics textbook is the most frequently used resource both in class and outside class. The textbook remains the most relevant resource for key purposes, such as an aid for doing homework and preparing for tests and exams. However, its dominance diminishes with age: in upper secondary school, students increasingly rely on self-created notes, and online resources. Correlation analyses reveal moderate to strong links between in-class and out-of-class use, suggesting an association between resource use and classroom culture. The findings underscore the textbook’s enduring centrality as a foundational, trusted resource within a dynamic and increasingly diverse learning environment. This study calls for pedagogical approaches that integrate textbooks more intentionally within broader resource systems, supporting students’ agency and strategic resource selection in an era of digital abundance.}}, author = {{Stallmeister, Lea and Rezat, Sebastian}}, journal = {{Educational Studies in Mathematics}}, publisher = {{Springer}}, title = {{{The role of the mathematics textbook in times of resource diversity}}}, doi = {{10.1007/s10649-026-10511-7}}, year = {{2026}}, } @article{65645, abstract = {{Curriculum material is often designed to address content-specific intended learning goals. However, research indicates that teachers’ personal goals may cause misalignments between their implementation of curriculum material and its intended learning goals. This study aims to investigate misalignments between teachers’ implementation of curriculum material and its intended learning goals and to which extent they are caused by teachers’ personal goals. To reach this aim, a qualitative study was conducted to examine how eight vocational school teachers implemented the learning activity “How many?” suggested for the initial training of early childhood educators on the topic of set perception and determination of cardinality. Each participant provided a lesson plan and self-recorded lesson video on the topic of set perception and determination of cardinality. In addition, participants were interviewed on how they used the provided curriculum material for designing their lessons and their potential reasons to adapt or omit “How many?”. To evaluate their lesson design’s alignment with the activity’s intended learning goals, the participants' lesson plans were analyzed using qualitative content analysis. Triangulation of the findings with the interview data revealed that only one participant fully adopted the intended learning goals as her own and implemented the activity completely in line with its intended learning goals. Meanwhile, the remaining participants’ personal goals, such as reducing math anxiety, seemed to cause misalignments regarding the intended learning goals. The study's results detail further constraints and affordances to the alignment between teachers’ lesson designs and learning goals intended by curriculum material. It is followed that it is central to support teachers in adopting intended learning goals as their personal goals. Otherwise, teachers’ classroom implementation of curriculum material may not suffice to reach desired outcomes.}}, author = {{Richter, Alix and Bruns, Julia}}, issn = {{1306-3030}}, journal = {{International Electronic Journal of Mathematics Education}}, number = {{2}}, publisher = {{Modestum Ltd}}, title = {{{All a question of the goal? Re-tracing (mis)alignments between teachers’ implementations of curriculum material and intended learning goals in the context of early childhood educator training in Germany}}}, doi = {{10.29333/iejme/18564}}, volume = {{21}}, year = {{2026}}, } @inproceedings{65013, author = {{Illian, Marvin and Khalili, Ramin and A. de A. Rocha, Antonio and Wang, Lin}}, booktitle = {{2026 24th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt)}}, publisher = {{IFIP}}, title = {{{Cells on Autopilot: Adaptive Cell (Re)Selection via Reinforcement Learning}}}, year = {{2026}}, } @article{65665, author = {{Ahmadi, Mehdi and Schlosser, Florian and Divkovic, Denis and Meschede, Henning}}, issn = {{2590-1745}}, journal = {{Energy Conversion and Management: X}}, publisher = {{Elsevier BV}}, title = {{{Cost-effective and low-carbon cooling strategies for data centers integrated into wind turbine towers}}}, doi = {{10.1016/j.ecmx.2026.101930}}, volume = {{31}}, year = {{2026}}, } @inbook{65670, abstract = {{Ensuring the veracity of assertions is {vital for building reliable and consistent knowledge graphs}. A variety of automatic fact-checking approaches have been proposed over the past decade. Among these, path-based fact-checking approaches are particularly attractive due to their independence of supplementary external knowledge and their faster runtimes compared to methods reliant on external corpora or embeddings. However, the effectiveness of these approaches is fundamentally limited by the incompleteness of existing knowledge graphs, which often lack the paths necessary to support or refute assertions. To address this limitation, we propose \system{}, a framework that supplements the knowledge graph with shallow knowledge---automatically extracted RDF assertions from external unstructured sources---even if this additional knowledge may not always fit a well-defined ontology nor be fully verified. By appending such shallow knowledge, we enhance the graph’s coverage and increase the chances of finding relevant evidence for fact checking. Comprehensive experiments on three widely used benchmark datasets demonstrate that integrating \system{} consistently and significantly enhances the performance of {state-of-the-art path-based fact-checking approaches}, yielding improvements of up to 0.24 in Area Under the Receiver Operating Characteristic Curve (AUROC). These results establish \system{} as a broadly applicable auxiliary component for improving the reliability and coverage of automatic fact checking in knowledge graphs. Our code is open-source and can be found at \url{https://github.com/dice-group/ShallKnow}.}}, author = {{Qudus, Umair and Pokharel, Neha and Röder, Michael and Ngonga Ngomo, Axel-Cyrille}}, booktitle = {{Lecture Notes in Computer Science}}, isbn = {{9783032251558}}, issn = {{0302-9743}}, keywords = {{fact checking}}, publisher = {{Springer Nature Switzerland}}, title = {{{No Need to Be a Know-It-All: Fact Checking with Shallow Knowledge}}}, doi = {{10.1007/978-3-032-25156-5_23}}, year = {{2026}}, } @inproceedings{65566, author = {{Haak, Anselm and Koopmann, Patrick and Mahmood, Yasir and Turhan, Anni-Yasmin}}, location = {{Lisbon}}, title = {{{ABox Abduction for Inconsistent Knowledge Bases under Repair Semantics}}}, year = {{2026}}, } @article{65682, author = {{Vernholz, Mats and Sims, Craig and Treagust, David}}, journal = {{Education Sciences}}, number = {{5}}, pages = {{782}}, title = {{{From Time-Saving to Skill-Building: Reframing Generative AI for Lesson-Planning—A Conceptual Design Paper}}}, doi = {{https://doi.org/10.3390/educsci16050782}}, volume = {{16}}, year = {{2026}}, } @inproceedings{64211, author = {{Wiebe, Vivien and Häsel-Weide, Uta}}, booktitle = {{Proceedings of the Nineteenth ERME Topic Conference: Connecting the Learning of Mathematics Teaching to Practice}}, editor = {{Mosvold, R. and Fauskanger, J. and Ferretti, F. and Vondrová, N.}}, location = {{Prag}}, pages = {{122--129}}, title = {{{ Initiating and establishing mathematical practices of determining and transforming numbers as a foundational skill in fostering mathematics teaching}}}, year = {{2026}}, } @article{65733, abstract = {{Abstract In this paper, we study the computation of shortest paths within the geometric amoebot model , a commonly used model for programmable matter. Shortest paths are essential for various tasks and therefore have been heavily investigated in many different contexts. We consider the reconfigurable circuit extension of the model where the amoebot structure is able to interconnect amoebots by so-called circuits. These circuits permit the instantaneous transmission of simple signals between connected amoebots. We propose distributed algorithms for the shortest path forest problem where, given a set of k sources and a set of $$\ell $$ ℓ destinations, the amoebot structure has to compute a forest that connects each destination to its closest source on a shortest path. Our main results are two algorithms for hole-free structures. The first algorithm constructs a shortest path tree for a single source within $$O(\log \ell )$$ O ( log ℓ ) rounds, and the second algorithm a shortest path forest for an arbitrary number of sources within $$O(\log n \log ^2 k)$$ O ( log n log 2 k ) rounds. The former algorithm also provides an O (1) rounds solution for the single pair shortest path problem (SPSP) and an $$O(\log n)$$ O ( log n ) rounds solution for the single source shortest path problem (SSSP) since these problems are special cases of the considered problem. Then, we adapt the latter algorithm to an offset version of the problem. This allows us to solve the problem for amoebot structures with holes within $$O(h \log ^3 n)$$ O ( h log 3 n ) rounds w.h.p. where h denotes the number of holes. }}, author = {{Padalkin, Andreas and Scheideler, Christian}}, issn = {{0178-2770}}, journal = {{Distributed Computing}}, number = {{2}}, publisher = {{Springer Science and Business Media LLC}}, title = {{{Polylogarithmic time algorithms for shortest path forests in programmable matter}}}, doi = {{10.1007/s00446-026-00505-2}}, volume = {{39}}, year = {{2026}}, } @article{65745, abstract = {{Abstract In this work, we address the numerical identification of entanglement in dynamical scenarios. To this end, we consider different programs based on the restriction of the evolution to the set of separable (i.e., non-entangled) states, together with the discretization of the space of variables for numerical computations. As a first approach, we apply linear splitting methods to the restricted, continuous equations of motion derived from variational principles. We utilize an exchange interaction Hamiltonian to confirm that the numerical and analytical solutions coincide in the limit of small time steps. The application to different Hamiltonians shows the wide applicability of the method to detect dynamical entanglement. To avoid the derivation of analytical solutions for complex dynamics, we consider variational, numerical integration schemes, introducing a variational discretization for Lagrangians linear in velocities. Here, we examine and compare two approaches: one in which the system is discretized before the restriction is applied, and another in which the restriction precedes the discretization. We find that the "first-discretize-then-restrict" method becomes numerically unstable, already for the example of an exchange-interaction Hamiltonian, which can be an important consideration for the numerical analysis of constrained quantum dynamics. Thereby, broadly applicable numerical tools, including their limitations, for studying entanglement over time are established for assessing the entangling power of processes that are used in quantum information theory.}}, author = {{Offen, Christian and Wembe, Boris and Ares, Laura and Sperling, Jan and Ober-Blöbaum, Sina}}, issn = {{1751-8113}}, journal = {{Journal of Physics A: Mathematical and Theoretical}}, publisher = {{IOP Publishing}}, title = {{{Numerical approaches to entangling dynamics from variational principles}}}, doi = {{10.1088/1751-8121/ae6d51}}, year = {{2026}}, } @article{65742, abstract = {{Abstract In this work, we address the numerical identification of entanglement in dynamical scenarios. To this end, we consider different programs based on the restriction of the evolution to the set of separable (i.e., non-entangled) states, together with the discretization of the space of variables for numerical computations. As a first approach, we apply linear splitting methods to the restricted, continuous equations of motion derived from variational principles. We utilize an exchange interaction Hamiltonian to confirm that the numerical and analytical solutions coincide in the limit of small time steps. The application to different Hamiltonians shows the wide applicability of the method to detect dynamical entanglement. To avoid the derivation of analytical solutions for complex dynamics, we consider variational, numerical integration schemes, introducing a variational discretization for Lagrangians linear in velocities. Here, we examine and compare two approaches: one in which the system is discretized before the restriction is applied, and another in which the restriction precedes the discretization. We find that the "first-discretize-then-restrict" method becomes numerically unstable, already for the example of an exchange-interaction Hamiltonian, which can be an important consideration for the numerical analysis of constrained quantum dynamics. Thereby, broadly applicable numerical tools, including their limitations, for studying entanglement over time are established for assessing the entangling power of processes that are used in quantum information theory.}}, author = {{Offen, Christian and Wembe, Boris and Ares, Laura and Sperling, Jan and Ober-Blöbaum, Sina}}, issn = {{1751-8113}}, journal = {{Journal of Physics A: Mathematical and Theoretical}}, publisher = {{IOP Publishing}}, title = {{{Numerical approaches to entangling dynamics from variational principles}}}, doi = {{10.1088/1751-8121/ae6d51}}, year = {{2026}}, } @inproceedings{65746, abstract = {{This paper presents a class of structure-preserving numerical methods for quantum optimal control problems, based on commutator-free Cayley integrators. Starting from the Krotov framework, we reformulate the forward and backward propagation steps using Cayley-type schemes that preserve unitarity and symmetry at the discrete level. This approach eliminates the need for matrix exponentials and commutators, leading to significant computational savings while maintaining higher-order accuracy. We first recall the standard linear setting and then extend the formulation to nonlinear Schrödinger and Gross-Pitaevskii equations using a Cayley-polynomial interpolation strategy. Numerical experiments on state-transfer problems illustrate that the CF-Cayley method achieves the same accuracy as high-order exponential or Cayley-Magnus schemes at substantially lower cost, especially for longtime or highly oscillatory dynamics. In the nonlinear regime, the structure-preserving properties of the method ensure stability and norm conservation, making it a robust tool for large-scale quantum control simulations. The proposed framework thus bridges geometric integration and optimal control, offering an efficient and reliable alternative to existing exponential-based propagators.}}, author = {{Wembe Moafo, Boris Edgar and Ali, Usman and Meier, Torsten and Ober-Blöbaum, Sina}}, location = {{Reykjavík, Iceland}}, title = {{{Cayley Commutator-free Methods for Krotov-Type Algorithms in Quantum Optimal Control}}}, doi = {{10.48550/ARXIV.2603.11697}}, year = {{2026}}, } @unpublished{65744, abstract = {{Optimal control problems with symmetries often admit a non stationary turnpike property called trim turnpike, which characterizes the convergence of optimal solutions to certain symmetry induced trajectories called trim primitives. In this paper we establish an exponential trim turnpike property for a class of optimal control problems with structural properties related to Abelian Lie group symmetries. The key ingredient of our approach is the introduction of an appropriate reduced optimal control problem. We show that extremals of the original problem can be characterized through a reduced Hamiltonian boundary value problem that coincides with the optimality system of the reduced problem. Under a hyperbolicity assumption on the equilibrium of the corresponding reduced Hamiltonian system we prove that optimal trajectories remain exponentially close, up to boundary layers near the endpoints, to a trim primitive defined by the static reduced problem. The theoretical results are illustrated on three representative examples: linear and nonlinear problems with quadratic cost and the Kepler orbital transfer problem.}}, author = {{Maslovskaya, Sofya and Ober-Blöbaum, Sina and Wembe Moafo, Boris Edgar}}, title = {{{Non static exponential turnpike property for optimal control problems with symmetries and boundary conditions}}}, year = {{2026}}, } @article{65747, abstract = {{In this work, we address the numerical identification of entanglement in dynamical scenarios. To this end, we consider different programs based on the restriction of the evolution to the set of separable (i.e., non-entangled) states, together with the discretization of the space of variables for numerical computations. As a first approach, we apply linear splitting methods to the restricted, continuous equations of motion derived from variational principles. We utilize an exchange interaction Hamiltonian to confirm that the numerical and analytical solutions coincide in the limit of small time steps. The application to different Hamiltonians shows the wide applicability of the method to detect dynamical entanglement. To avoid the derivation of analytical solutions for complex dynamics, we consider variational, numerical integration schemes, introducing a variational discretization for Lagrangians linear in velocities. Here, we examine and compare two approaches: one in which the system is discretized before the restriction is applied, and another in which the restriction precedes the discretization. We find that the "first-discretize-then-restrict" method becomes numerically unstable, already for the example of an exchange-interaction Hamiltonian, which can be an important consideration for the numerical analysis of constrained quantum dynamics. Thereby, broadly applicable numerical tools, including their limitations, for studying entanglement over time are established for assessing the entangling power of processes that are used in quantum information theory.}}, author = {{Offen, Christian and Wembe, Boris and Ares, Laura and Sperling, Jan and Ober-Blöbaum, Sina}}, issn = {{1751-8113}}, journal = {{Journal of Physics A: Mathematical and Theoretical}}, publisher = {{IOP Publishing}}, title = {{{Numerical approaches to entangling dynamics from variational principles}}}, doi = {{10.1088/1751-8121/ae6d51}}, year = {{2026}}, }