@article{59171, abstract = {{To model dynamical systems on networks with higher-order (non-pairwise) interactions, we recently introduced a new class of ordinary differential equations (ODEs) on hypernetworks. Here, we consider one-parameter synchrony breaking bifurcations in such ODEs. We call a synchrony breaking steady-state branch ‘reluctant’ if it is tangent to a synchrony space, but does not lie inside it. We prove that reluctant synchrony breaking is ubiquitous in hypernetwork systems, by constructing a large class of examples that support it. We also give an explicit formula for the order of tangency to the synchrony space of a reluctant steady-state branch.}}, author = {{von der Gracht, Sören and Nijholt, Eddie and Rink, Bob}}, issn = {{1364-5021}}, journal = {{Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences}}, keywords = {{higher-order interactions, synchrony breaking, network dynamics, coupled cell systems}}, number = {{2301}}, publisher = {{The Royal Society}}, title = {{{Higher-order interactions lead to ‘reluctant’ synchrony breaking}}}, doi = {{10.1098/rspa.2023.0945}}, volume = {{480}}, year = {{2024}}, } @inbook{59581, author = {{Häsel-Weide, Uta and Nührenbörger, M.}}, booktitle = {{Beiträge zum Mathematikuntericht 2024. 57. Jahrestagung der Gesellschaft für Didaktik der Mathematik}}, editor = {{Ebers, P. and Rösken, F. and Barzel, B. and Büchter, A. and Schacht, F. and Scherer, P.}}, pages = {{207--210}}, title = {{{ Praktiken der Förderung im inklusiven Mathematikunterricht}}}, doi = {{https://doi.ohttps://doi.org/10.37626/GA9783959872782.0 rg/10.37626/GA9783959872782.0}}, year = {{2024}}, } @unpublished{58873, abstract = {{We prove that the Patterson-Sullivan and Wigner distributions on the unit sphere bundle of a convex-cocompact hyperbolic surface are asymptotically identical. This generalizes results in the compact case by Anantharaman-Zelditch and Hansen-Hilgert-Schr\"oder.}}, author = {{Delarue, Benjamin and Palmirotta, Guendalina}}, booktitle = {{arXiv:2411.19782}}, title = {{{Patterson-Sullivan and Wigner distributions of convex-cocompact hyperbolic surfaces}}}, year = {{2024}}, } @article{53542, abstract = {{AbstractThis work deals with the extension problem for the fractional Laplacian on Riemannian symmetric spaces G/K of noncompact type and of general rank, which gives rise to a family of convolution operators, including the Poisson operator. More precisely, motivated by Euclidean results for the Poisson semigroup, we study the long-time asymptotic behavior of solutions to the extension problem for $$L^1$$ L 1 initial data. In the case of the Laplace–Beltrami operator, we show that if the initial data are bi-K-invariant, then the solution to the extension problem behaves asymptotically as the mass times the fundamental solution, but this convergence may break down in the non-bi-K-invariant case. In the second part, we investigate the long-time asymptotic behavior of the extension problem associated with the so-called distinguished Laplacian on G/K. In this case, we observe phenomena which are similar to the Euclidean setting for the Poisson semigroup, such as $$L^1$$ L 1 asymptotic convergence without the assumption of bi-K-invariance.}}, author = {{Papageorgiou, Efthymia}}, issn = {{1424-3199}}, journal = {{Journal of Evolution Equations}}, keywords = {{Mathematics (miscellaneous)}}, number = {{2}}, publisher = {{Springer Science and Business Media LLC}}, title = {{{Asymptotic behavior of solutions to the extension problem for the fractional Laplacian on noncompact symmetric spaces}}}, doi = {{10.1007/s00028-024-00959-6}}, volume = {{24}}, year = {{2024}}, } @article{21199, abstract = {{As in almost every other branch of science, the major advances in data science and machine learning have also resulted in significant improvements regarding the modeling and simulation of nonlinear dynamical systems. It is nowadays possible to make accurate medium to long-term predictions of highly complex systems such as the weather, the dynamics within a nuclear fusion reactor, of disease models or the stock market in a very efficient manner. In many cases, predictive methods are advertised to ultimately be useful for control, as the control of high-dimensional nonlinear systems is an engineering grand challenge with huge potential in areas such as clean and efficient energy production, or the development of advanced medical devices. However, the question of how to use a predictive model for control is often left unanswered due to the associated challenges, namely a significantly higher system complexity, the requirement of much larger data sets and an increased and often problem-specific modeling effort. To solve these issues, we present a universal framework (which we call QuaSiModO: Quantization-Simulation-Modeling-Optimization) to transform arbitrary predictive models into control systems and use them for feedback control. The advantages of our approach are a linear increase in data requirements with respect to the control dimension, performance guarantees that rely exclusively on the accuracy of the predictive model, and only little prior knowledge requirements in control theory to solve complex control problems. In particular the latter point is of key importance to enable a large number of researchers and practitioners to exploit the ever increasing capabilities of predictive models for control in a straight-forward and systematic fashion.}}, author = {{Peitz, Sebastian and Bieker, Katharina}}, journal = {{Automatica}}, publisher = {{Elsevier}}, title = {{{On the Universal Transformation of Data-Driven Models to Control Systems}}}, doi = {{10.1016/j.automatica.2022.110840}}, volume = {{149}}, year = {{2023}}, } @inproceedings{46756, author = {{Wallner, Melina and Häsel-Weide, Uta}}, booktitle = {{International Symposium in Elementary Mathematics Teaching. Proceedings: New Directions in Elementary Mathematics Education}}, editor = {{Novotna, J. and Moraova, H.}}, location = {{Prag}}, pages = {{346--354}}, publisher = {{Charles University}}, title = {{{Conceptual understanding of third grades for axial symmetry}}}, year = {{2023}}, } @article{49326, abstract = {{Many networked systems are governed by non-pairwise interactions between nodes. The resulting higher-order interaction structure can then be encoded by means of a hypernetwork. In this paper we consider dynamical systems on hypernetworks by defining a class of admissible maps for every such hypernetwork. We explain how to classify robust cluster synchronization patterns on hypernetworks by finding balanced partitions, and we generalize the concept of a graph fibration to the hypernetwork context. We also show that robust synchronization patterns are only fully determined by polynomial admissible maps of high order. This means that, unlike in dyadic networks, cluster synchronization on hypernetworks is a higher-order, i.e., nonlinear, effect. We give a formula, in terms of the order of the hypernetwork, for the degree of the polynomial admissible maps that determine robust synchronization patterns. We also demonstrate that this degree is optimal by investigating a class of examples. We conclude by demonstrating how this effect may cause remarkable synchrony breaking bifurcations that occur at high polynomial degree.}}, author = {{von der Gracht, Sören and Nijholt, Eddie and Rink, Bob}}, issn = {{0036-1399}}, journal = {{SIAM Journal on Applied Mathematics}}, keywords = {{Applied Mathematics}}, number = {{6}}, pages = {{2329--2353}}, publisher = {{Society for Industrial & Applied Mathematics (SIAM)}}, title = {{{Hypernetworks: Cluster Synchronization Is a Higher-Order Effect}}}, doi = {{10.1137/23m1561075}}, volume = {{83}}, year = {{2023}}, } @article{49372, author = {{Klüners, Jürgen and Wang, Jiuya}}, issn = {{2730-9657}}, journal = {{La Matematica}}, publisher = {{Springer Science and Business Media LLC}}, title = {{{Idélic Approach in Enumerating Heisenberg Extensions}}}, doi = {{10.1007/s44007-023-00067-w}}, year = {{2023}}, } @article{49425, author = {{Seitz, Simone and Häsel-Weide, Uta and Wilke, Yannik and Wallner, Melina}}, journal = {{Teachers and Teaching}}, pages = {{1--16}}, title = {{{Expertise and professionalism for inclusive (mathematics) teaching and learning: reflections on findings from interdisciplinary professionalisation research}}}, doi = {{https://doi.org/10.1080/13540602.2023.2284876 }}, year = {{2023}}, } @inproceedings{34135, abstract = {{By one of the most fundamental principles in physics, a dynamical system will exhibit those motions which extremise an action functional. This leads to the formation of the Euler-Lagrange equations, which serve as a model of how the system will behave in time. If the dynamics exhibit additional symmetries, then the motion fulfils additional conservation laws, such as conservation of energy (time invariance), momentum (translation invariance), or angular momentum (rotational invariance). To learn a system representation, one could learn the discrete Euler-Lagrange equations, or alternatively, learn the discrete Lagrangian function Ld which defines them. Based on ideas from Lie group theory, in this work we introduce a framework to learn a discrete Lagrangian along with its symmetry group from discrete observations of motions and, therefore, identify conserved quantities. The learning process does not restrict the form of the Lagrangian, does not require velocity or momentum observations or predictions and incorporates a cost term which safeguards against unwanted solutions and against potential numerical issues in forward simulations. The learnt discrete quantities are related to their continuous analogues using variational backward error analysis and numerical results demonstrate the improvement such models can have both qualitatively and quantitatively even in the presence of noise.}}, author = {{Lishkova, Yana and Scherer, Paul and Ridderbusch, Steffen and Jamnik, Mateja and Liò, Pietro and Ober-Blöbaum, Sina and Offen, Christian}}, booktitle = {{IFAC-PapersOnLine}}, location = {{ Yokohama, Japan}}, number = {{2}}, pages = {{3203--3210}}, publisher = {{Elsevier}}, title = {{{Discrete Lagrangian Neural Networks with Automatic Symmetry Discovery}}}, doi = {{10.1016/j.ifacol.2023.10.1457}}, volume = {{56}}, year = {{2023}}, } @article{50298, abstract = {{A finite classical polar space of rank $n$ consists of the totally isotropic subspaces of a finite vector space equipped with a nondegenerate form such that $n$ is the maximal dimension of such a subspace. A $t$-Steiner system in a finite classical polar space of rank $n$ is a collection $Y$ of totally isotropic $n$-spaces such that each totally isotropic $t$-space is contained in exactly one member of $Y$. Nontrivial examples are known only for $t=1$ and $t=n-1$. We give an almost complete classification of such $t$-Steiner systems, showing that such objects can only exist in some corner cases. This classification result arises from a more general result on packings in polar spaces.}}, author = {{Schmidt, Kai-Uwe and Weiß, Charlene}}, journal = {{Combinatorial Theory}}, number = {{1}}, title = {{{Packings and Steiner systems in polar spaces}}}, doi = {{10.5070/c63160424}}, volume = {{3}}, year = {{2023}}, } @article{50297, abstract = {{We show that there exist ordered orthogonal arrays, whose sizes deviate from the Rao bound by a factor that is polynomial in the parameters of the ordered orthogonal array. The proof is nonconstructive and based on a probabilistic method due to Kuperberg, Lovett and Peled.}}, author = {{Schmidt, Kai‐Uwe and Weiß, Charlene}}, journal = {{Journal of Combinatorial Designs}}, number = {{9}}, pages = {{422--431}}, publisher = {{Wiley}}, title = {{{Existence of small ordered orthogonal arrays}}}, doi = {{10.1002/jcd.21903}}, volume = {{31}}, year = {{2023}}, } @phdthesis{50300, abstract = {{Digital communications relies heavily on the usage of different types of codes. Prominent codes nowadays are rank-metric codes and subspace codes - the q-analogs of binary codes and binary codes with constant weight. All these codes can be viewed as subsets of classical association schemes. A central coding-theoretic problem is to derive upper bounds for the size of codes. This thesis investigates Delsartes powerful linear program whose optimum is precisely such a bound for codes in association schemes. The linear programs for binary codes and binary constant-weight codes have been extensively studied since the 1970s, but their optimum is still unknown. We determine in a unified way the optimum of the linear program in several ordinary q-analogs as well as in their affine counterparts. In particular, bounds and constructions for codes in polar spaces are established, where the bounds are sharp up to a constant factor in many cases. Moreover, based on these results, an almost complete classification of Steiner systems in polar spaces is provided by showing that they could only exist in some corner cases.}}, author = {{Weiß, Charlene}}, title = {{{Linear programming bounds in classical association schemes}}}, doi = {{10.17619/UNIPB/1-1672}}, year = {{2023}}, } @inproceedings{51131, author = {{Graf, Lara Marie and Häsel-Weide, Uta and Höveler, K. and Nührenbörger, M.}}, booktitle = {{Proceedings of the Thirteenth Congress of the European Society for Research in Mathematics Education (CERME13)}}, editor = {{Drijvers, P. and Csapodi, C. and Palmér, H. and Gosztonyi, K. and Kónya, E.}}, pages = {{3203--3210}}, title = {{{Insights into out-of-field teachers’ self-reports: Fostering the understanding of addition and subtraction as a basis for children to overcome difficulties in mathematics}}}, year = {{2023}}, } @article{31189, abstract = {{Given a geometrically finite hyperbolic surface of infinite volume it is a classical result of Patterson that the positive Laplace-Beltrami operator has no $L^2$-eigenvalues $\geq 1/4$. In this article we prove a generalization of this result for the joint $L^2$-eigenvalues of the algebra of commuting differential operators on Riemannian locally symmetric spaces $\Gamma\backslash G/K$ of higher rank. We derive dynamical assumptions on the $\Gamma$-action on the geodesic and the Satake compactifications which imply the absence of the corresponding principal eigenvalues. A large class of examples fulfilling these assumptions are the non-compact quotients by Anosov subgroups.}}, author = {{Weich, Tobias and Wolf, Lasse Lennart}}, journal = {{Communications in Mathematical Physics}}, title = {{{Absence of principal eigenvalues for higher rank locally symmetric spaces}}}, doi = {{https://doi.org/10.1007/s00220-023-04819-1}}, volume = {{403}}, year = {{2023}}, } @unpublished{51206, abstract = {{We present a numerical algorithm for the computation of invariant Ruelle distributions on convex co-compact hyperbolic surfaces. This is achieved by exploiting the connection between invariant Ruelle distributions and residues of meromorphically continued weighted zeta functions established by the authors together with Barkhofen (2021). To make this applicable for numerics we express the weighted zeta as the logarithmic derivative of a suitable parameter dependent Fredholm determinant similar to Borthwick (2014). As an additional difficulty our transfer operator has to include a contracting direction which we account for with techniques developed by Rugh (1992). We achieve a further improvement in convergence speed for our algorithm in the case of surfaces with additional symmetries by proving and applying a symmetry reduction of weighted zeta functions.}}, author = {{Schütte, Philipp and Weich, Tobias}}, booktitle = {{arXiv:2308.13463}}, title = {{{Invariant Ruelle Distributions on Convex-Cocompact Hyperbolic Surfaces -- A Numerical Algorithm via Weighted Zeta Functions}}}, year = {{2023}}, } @article{51351, author = {{Steffen, Eckhard and Wolf, Isaak Hieronymus}}, issn = {{0166-218X}}, journal = {{Discrete Applied Mathematics}}, keywords = {{Applied Mathematics, Discrete Mathematics and Combinatorics}}, pages = {{185--189}}, publisher = {{Elsevier BV}}, title = {{{Bounds for the chromatic index of signed multigraphs}}}, doi = {{10.1016/j.dam.2023.05.008}}, volume = {{337}}, year = {{2023}}, } @inbook{45190, author = {{Cappello, Chiara and Steffen, Eckhard}}, booktitle = {{The Digital Twin of Humans}}, isbn = {{9783031261039}}, pages = {{93----110}}, publisher = {{Springer International Publishing}}, title = {{{Graph-Theoretical Models for the Analysis and Design of Socio-Technical Networks}}}, doi = {{10.1007/978-3-031-26104-6_5}}, year = {{2023}}, } @article{51357, author = {{Steffen, Eckhard and Wolf, Isaak Hieronymus}}, issn = {{0012-365X}}, journal = {{Discrete Mathematics}}, keywords = {{Discrete Mathematics and Combinatorics, Theoretical Computer Science}}, publisher = {{Elsevier BV}}, title = {{{Rotation r-graphs}}}, doi = {{10.1016/j.disc.2023.113457}}, year = {{2023}}, } @article{31210, abstract = {{In this paper we complete the program of relating the Laplace spectrum for rank one compact locally symmetric spaces with the first band Ruelle-Pollicott resonances of the geodesic flow on its sphere bundle. This program was started by Flaminio and Forni for hyperbolic surfaces, continued by Dyatlov, Faure and Guillarmou for real hyperbolic spaces and by Guillarmou, Hilgert and Weich for general rank one spaces. Except for the case of hyperbolic surfaces a countable set of exceptional spectral parameters always left untreated since the corresponding Poisson transforms are neither injective nor surjective. We use vector valued Poisson transforms to treat also the exceptional spectral parameters. For surfaces the exceptional spectral parameters lead to discrete series representations of $\mathrm{SL}(2,\mathbb R)$. In higher dimensions the situation is more complicated, but can be described completely.}}, author = {{Arends, Christian and Hilgert, Joachim}}, issn = {{2270-518X}}, journal = {{Journal de l’École polytechnique — Mathématiques}}, keywords = {{Ruelle resonances, Poisson transforms, locally symmetric spaces, principal series representations}}, pages = {{335--403}}, title = {{{Spectral correspondences for rank one locally symmetric spaces: the case of exceptional parameters}}}, doi = {{10.5802/jep.220}}, volume = {{10}}, year = {{2023}}, }