@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}}, } @unpublished{49371, abstract = {{To model dynamical systems on networks with higher order (non-pairwise) interactions, we recently introduced a new class of 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}}, booktitle = {{arXiv:2311.17186}}, title = {{{Higher order interactions lead to "reluctant" synchrony breaking}}}, 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}}, } @unpublished{44840, abstract = {{In this article we investigate the convergence behavior of gathering protocols with fixed circulant topologies using tools form dynamical systems. Given a fixed number of mobile entities moving in the Euclidean plane, we model a gathering protocol as a system of ordinary differential equations whose equilibria are exactly all possible gathering points. Then, we find necessary and sufficient conditions for the structure of the underlying interaction graph such that the protocol is stable and converging, i.e., gathering, in the distributive computing sense by using tools from dynamical systems. Moreover, these tools allow for a more fine grained analysis in terms of speed of convergence in the dynamical systems sense. In fact, we derive a decomposition of the state space into stable invariant subspaces with different convergence rates. In particular, this decomposition is identical for every (linear) circulant gathering protocol, whereas only the convergence rates depend on the weights in interaction graph itself.}}, author = {{Gerlach, Raphael and von der Gracht, Sören and Dellnitz, Michael}}, booktitle = {{arXiv:2305.06632}}, keywords = {{Dynamical Systems, Coupled Systems, Distributed Computing, Robot Swarms, Autonomous Mobile Robots, Gathering}}, pages = {{38}}, title = {{{On the Dynamical Hierarchy in Gathering Protocols with Circulant Topologies}}}, 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}}, } @unpublished{50299, abstract = {{A finite classical polar space of rank $n$ consists of the totally isotropic subspaces of a finite vector space over $\mathbb{F}_p$ equipped with a nondegenerate form such that $n$ is the maximal dimension of such a subspace. A $t$-$(n,k,\lambda)$ design in a finite classical polar space of rank $n$ is a collection $Y$ of totally isotropic $k$-spaces such that each totally isotropic $t$-space is contained in exactly $\lambda$ members of $Y$. Nontrivial examples are currently only known for $t\leq 2$. We show that $t$-$(n,k,\lambda)$ designs in polar spaces exist for all $t$ and $p$ provided that $k>\frac{21}{2}t$ and $n$ is sufficiently large enough. The proof is based on a probabilistic method by Kuperberg, Lovett, and Peled, and it is thus nonconstructive.}}, author = {{Weiß, Charlene}}, booktitle = {{arXiv:2311.08288}}, title = {{{Nontrivial $t$-designs in polar spaces exist for all $t$}}}, year = {{2023}}, } @article{48596, author = {{Häsel-Weide, Uta and Schmidt, R. and Büker, Petra}}, journal = {{Zeitschrift für Schul- Und Professionsentwicklung. (PFLB)}}, number = {{1}}, pages = {{215--229}}, title = {{{„FInDig“: Fach – Inklusion – Digitalisierung vernetzen. Ein Planungs- und Reflexionsmodell für die Lehrkräftebildung}}}, volume = {{5}}, 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}}, } @article{31059, abstract = {{In this article we prove meromorphic continuation of weighted zeta functions in the framework of open hyperbolic systems by using the meromorphically continued restricted resolvent of Dyatlov and Guillarmou (2016). We obtain a residue formula proving equality between residues of weighted zetas and invariant Ruelle distributions. We combine this equality with results of Guillarmou, Hilgert and Weich (2021) in order to relate the residues to Patterson-Sullivan distributions. Finally we provide proof-of-principle results concerning the numerical calculation of invariant Ruelle distributions for 3-disc scattering systems.}}, author = {{Schütte, Philipp and Weich, Tobias and Barkhofen, Sonja}}, journal = {{Communications in Mathematical Physics}}, pages = {{655--678}}, title = {{{Meromorphic Continuation of Weighted Zeta Functions on Open Hyperbolic Systems}}}, doi = {{ttps://doi.org/10.1007/s00220-022-04538-z}}, volume = {{398}}, 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}}, } @unpublished{51207, abstract = {{Let $X=X_1\times X_2$ be a product of two rank one symmetric spaces of non-compact type and $\Gamma$ a torsion-free discrete subgroup in $G_1\times G_2$. We show that the spectrum of $\Gamma \backslash X$ is related to the asymptotic growth of $\Gamma$ in the two direction defined by the two factors. We obtain that $L^2(\Gamma \backslash G)$ is tempered for large class of $\Gamma$.}}, author = {{Weich, Tobias and Wolf, Lasse Lennart}}, booktitle = {{arXiv:2304.09573}}, title = {{{Temperedness of locally symmetric spaces: The product case}}}, 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}}, } @unpublished{51375, abstract = {{We consider the quantum dynamics of a many-fermion system in $\mathbb R^d$ with an ultraviolet regularized pair interaction as previously studied in [M. Gebert, B. Nachtergaele, J. Reschke, and R. Sims, Ann. Henri Poincar\'e 21.11 (2020)]. We provide a Lieb-Robinson bound under substantially relaxed assumptions on the potentials. We also improve the associated one-body Lieb-Robinson bound on $L^2$-overlaps to an almost ballistic one (i.e., an almost linear light cone) under the same relaxed assumptions. Applications include the existence of the infinite-volume dynamics and clustering of ground states in the presence of a spectral gap. We also develop a fermionic continuum notion of conditional expectation and use it to approximate time-evolved fermionic observables by local ones, which opens the door to other applications of the Lieb-Robinson bounds.}}, author = {{Hinrichs, Benjamin and Lemm, Marius and Siebert, Oliver}}, booktitle = {{arXiv:2310.17736}}, title = {{{On Lieb-Robinson bounds for a class of continuum fermions}}}, year = {{2023}}, }