@phdthesis{62750, abstract = {{Diese Dissertation enthält Beiträge zum Bereich der Mehrzieloptimierung mit einem Fokus auf unbeschränkten Problemen, die auf einem allgemeinen Hilbertraum definiert sind. Für Mehrzieloptimierungsprobleme mit lokal Lipschitz-stetigen Zielfunktionen definieren wir ein multikriterielles Subdifferential, das wir erstmals im Kontext allgemeiner Hilberträume analysieren. Aufbauend auf diesen theoretischen Untersuchungen präsentieren wir ein Abstiegsverfahren, bei welchem in jeder Iteration eine Abstiegsrichtung mittels einer numerischen Approximation des multikriteriellen Subdifferentials bestimmt wird. Im Kontext konvexer, stetig differenzierbarer Zielfunktionen mit Lipschitz-stetigen Gradienten, führen wir eine Familie von dynamischen Gradientensystemen mit Trägheitsterm ein, die bekannte kontinuierliche Systeme aus der skalaren Optimierung verallgemeinern. Wir stellen drei neue Systeme vor: eines mit konstanter Dämpfung, eines mit asymptotisch abnehmender Dämpfung und eines, das zusätzlich eine zeitabhängige Tikhonov-Regularisierung beinhaltet. Aufbauend auf den Untersuchungen der neuen dynamischen Gradientensysteme, entwickeln wir ein beschleunigtes Gradientenverfahren zur Mehrzieloptimierung, das auf einer Diskretisierung des multikriteriellen Gradientensystems mit asymptotisch abnehmender Dämpfung beruht. Das hergeleitete Verfahren bewahrt die günstigen Konvergenzeigenschaften des kontinuierlichen Systems und erreicht eine schnellere Konvergenz als klassische Verfahren.}}, author = {{Sonntag, Konstantin}}, publisher = {{Paderborn University}}, title = {{{First-order methods and gradient dynamical systems for multiobjective optimization}}}, doi = {{10.17619/UNIPB/1-2457}}, year = {{2025}}, } @article{62980, abstract = {{We introduce a new classification of multimode states with a fixed number of photons. This classification is based on the factorizability of homogeneous multivariate polynomials and is invariant under unitary transformations. The classes physically correspond to field excitations in terms of single and multiple photons, each of which is in an arbitrary irreducible superposition of quantized modes. We further show how the transitions between classes are rendered possible by photon addition, photon subtraction, and photon-projection nonlinearities. We explicitly put forward a design for a multilayer interferometer in which the states for different classes can be generated with state-of-the-art experimental techniques. Limitations of the proposed designs are analyzed using the introduced classification, providing a benchmark for the robustness of certain states and classes.}}, author = {{Kopylov, Denis A. and Offen, Christian and Ares, Laura and Wembe Moafo, Boris Edgar and Ober-Blöbaum, Sina and Meier, Torsten and Sharapova, Polina R. and Sperling, Jan}}, issn = {{2643-1564}}, journal = {{Physical Review Research}}, number = {{3}}, publisher = {{American Physical Society (APS)}}, title = {{{Multiphoton, multimode state classification for nonlinear optical circuits}}}, doi = {{10.1103/sv6z-v1gk}}, volume = {{7}}, year = {{2025}}, } @unpublished{62979, abstract = {{We introduce a new classification of multimode states with a fixed number of photons. This classification is based on the factorizability of homogeneous multivariate polynomials and is invariant under unitary transformations. The classes physically correspond to field excitations in terms of single and multiple photons, each of which being in an arbitrary irreducible superposition of quantized modes. We further show how the transitions between classes are rendered possible by photon addition, photon subtraction, and photon-projection nonlinearities. We explicitly put forward a design for a multilayer interferometer in which the states for different classes can be generated with state-of-the-art experimental techniques. Limitations of the proposed designs are analyzed using the introduced classification, providing a benchmark for the robustness of certain states and classes.}}, author = {{Meier, Torsten and Sharapova, Polina R. and Sperling, Jan and Ober-Blöbaum, Sina and Wembe Moafo, Boris Edgar and Offen, Christian}}, title = {{{Multiphoton, multimode state classification for nonlinear optical circuits}}}, year = {{2025}}, } @unpublished{63187, author = {{Kidner, Arnott Jeffery Joel and Steffen, Eckhard and Yu, Weiqiang}}, booktitle = {{arXiv:2512.14285}}, title = {{{Edge-coloring 4- and 5-regular projective planar graphs with no Petersen-minor}}}, year = {{2025}}, } @unpublished{61759, abstract = {{Intersection distribution and non-hitting index are concepts introduced recently by Li and Pott as a new way to view the behaviour of a collection of finite field polynomials. With both an algebraic interpretation via the intersection of a polynomial with a set of lines, and a geometric interpretation via a (q+1)-set possessing an internal nucleus, the concepts have proved their usefulness as a new way to view various long-standing problems, and have applications in areas such as Kakeya sets. In this paper, by exploiting connections with diverse areas including the theory of algebraic curves, cyclotomy and the enumeration of irreducible polynomials, we establish new results and resolve various Open Problems of Li and Pott. We prove geometric results which shed new light on the relationship between intersection distribution and projective equivalence of polynomials, and algebraic results which describe and characterise the degree of Sf - the index of the largest non-zero entry in the intersection distribution of f. We provide new insights into the non-hitting spectrum, and show the limitations of the non-hitting index as a tool for characterisation. Finally, the benefits provided by the connections to other areas are evidenced in two short new proofs of the cubic case. }}, author = {{Klawuhn, Lukas-André Dominik and Huczynska, Sophie and Paterson, Maura}}, pages = {{36}}, title = {{{The Intersection Distribution: New Results and Perspectives}}}, year = {{2025}}, } @unpublished{63384, abstract = {{Two fundamental ways to represent a group are as permutations and as matrices. In this paper, we study linear representations of groups that intertwine with a permutation representation. Recently, D'Alconzo and Di Scala investigated how small the matrices in such a linear representation can be. The minimal dimension of such a representation is the \emph{linear dimension of the group action} and this has applications in cryptography and cryptosystems. We develop the idea of linear dimension from an algebraic point of view by using the theory of permutation modules. We give structural results about representations of minimal dimension and investigate the implications of faithfulness, transitivity and primitivity on the linear dimension. Furthermore, we compute the linear dimension of several classes of finite primitive permutation groups. We also study wreath products, allowing us to determine the linear dimension of imprimitive group actions. Finally, we give the linear dimension of almost simple finite $2$-transitive groups, some of which may be used for further applications in cryptography. Our results also open up many new questions about linear representations of group actions.}}, author = {{Devillers, Alice and Giudici, Michael and Hawtin, Daniel R. and Klawuhn, Lukas-André Dominik and Morgan, Luke}}, title = {{{Linear dimension of group actions}}}, year = {{2025}}, } @unpublished{63510, abstract = {{It has been shown recently that optimal control problems with the dynamical constraint given by a second order system admit a regular Lagrangian formulation. This implies that the optimality conditions can be obtained in a new form based on the variational approach. In this paper we extend the first order necessary optimality conditions obtained previously to second order optimality conditions. This results in a complete characterization of the optimality conditions in a new Lagrangian form.}}, author = {{Konopik, Michael and Leyendecker, Sigrid and Maslovskaya, Sofya and Sina Ober-Blöbaum, Sina Ober-Blöbaum and Almagro, Rodrigo T. Sato Martín de}}, booktitle = {{arXiv:2507.06024}}, title = {{{Second order optimality conditions in a new Lagrangian formulation for optimal control problems}}}, year = {{2025}}, } @article{59797, author = {{Konopik, Michael and T. Sato Martín de Almagro, Rodrigo and Maslovskaya, Sofya and Ober-Blöbaum, Sina and Leyendecker, Sigrid}}, journal = {{Journal of Nonlinear Science}}, number = {{11}}, title = {{{Variational integrators for a new Lagrangian approach to control affine systems with a quadratic Lagrange term}}}, doi = {{10.1007/s00332-025-10229-5}}, volume = {{36}}, year = {{2025}}, } @article{59799, author = {{Konopik, Michael and Leyendecker, Sigrid and Maslovskaya, Sofya and Ober-Blöbaum, Sina and T. Sato Martín de Almagro, Rodrigo}}, journal = {{Nonlinearity}}, number = {{11}}, title = {{{A new Lagrangian approach to optimal control of second-order systems}}}, doi = {{10.1088/1361-6544/ae1d08}}, volume = {{38}}, year = {{2025}}, } @article{51208, abstract = {{AbstractApproximation of subdifferentials is one of the main tasks when computing descent directions for nonsmooth optimization problems. In this article, we propose a bisection method for weakly lower semismooth functions which is able to compute new subgradients that improve a given approximation in case a direction with insufficient descent was computed. Combined with a recently proposed deterministic gradient sampling approach, this yields a deterministic and provably convergent way to approximate subdifferentials for computing descent directions.}}, author = {{Gebken, Bennet}}, issn = {{0926-6003}}, journal = {{Computational Optimization and Applications}}, keywords = {{Applied Mathematics, Computational Mathematics, Control and Optimization}}, publisher = {{Springer Science and Business Media LLC}}, title = {{{A note on the convergence of deterministic gradient sampling in nonsmooth optimization}}}, doi = {{10.1007/s10589-024-00552-0}}, year = {{2024}}, } @article{46019, abstract = {{We derive efficient algorithms to compute weakly Pareto optimal solutions for smooth, convex and unconstrained multiobjective optimization problems in general Hilbert spaces. To this end, we define a novel inertial gradient-like dynamical system in the multiobjective setting, which trajectories converge weakly to Pareto optimal solutions. Discretization of this system yields an inertial multiobjective algorithm which generates sequences that converge weakly to Pareto optimal solutions. We employ Nesterov acceleration to define an algorithm with an improved convergence rate compared to the plain multiobjective steepest descent method (Algorithm 1). A further improvement in terms of efficiency is achieved by avoiding the solution of a quadratic subproblem to compute a common step direction for all objective functions, which is usually required in first-order methods. Using a different discretization of our inertial gradient-like dynamical system, we obtain an accelerated multiobjective gradient method that does not require the solution of a subproblem in each step (Algorithm 2). While this algorithm does not converge in general, it yields good results on test problems while being faster than standard steepest descent.}}, author = {{Sonntag, Konstantin and Peitz, Sebastian}}, journal = {{Journal of Optimization Theory and Applications}}, publisher = {{Springer}}, title = {{{Fast Multiobjective Gradient Methods with Nesterov Acceleration via Inertial Gradient-Like Systems}}}, doi = {{10.1007/s10957-024-02389-3}}, year = {{2024}}, } @unpublished{51334, abstract = {{The efficient optimization method for locally Lipschitz continuous multiobjective optimization problems from [1] is extended from finite-dimensional problems to general Hilbert spaces. The method iteratively computes Pareto critical points, where in each iteration, an approximation of the subdifferential is computed in an efficient manner and then used to compute a common descent direction for all objective functions. To prove convergence, we present some new optimality results for nonsmooth multiobjective optimization problems in Hilbert spaces. Using these, we can show that every accumulation point of the sequence generated by our algorithm is Pareto critical under common assumptions. Computational efficiency for finding Pareto critical points is numerically demonstrated for multiobjective optimal control of an obstacle problem.}}, author = {{Sonntag, Konstantin and Gebken, Bennet and Müller, Georg and Peitz, Sebastian and Volkwein, Stefan}}, booktitle = {{arXiv:2402.06376}}, title = {{{A Descent Method for Nonsmooth Multiobjective Optimization in Hilbert Spaces}}}, year = {{2024}}, } @article{52726, abstract = {{Heteroclinic structures organize global features of dynamical systems. We analyse whether heteroclinic structures can arise in network dynamics with higher-order interactions which describe the nonlinear interactions between three or more units. We find that while commonly analysed model equations such as network dynamics on undirected hypergraphs may be useful to describe local dynamics such as cluster synchronization, they give rise to obstructions that allow to design of heteroclinic structures in phase space. By contrast, directed hypergraphs break the homogeneity and lead to vector fields that support heteroclinic structures.}}, author = {{Bick, Christian and von der Gracht, Sören}}, issn = {{2051-1329}}, journal = {{Journal of Complex Networks}}, keywords = {{Applied Mathematics, Computational Mathematics, Control and Optimization, Management Science and Operations Research, Computer Networks and Communications}}, number = {{2}}, publisher = {{Oxford University Press (OUP)}}, title = {{{Heteroclinic dynamics in network dynamical systems with higher-order interactions}}}, doi = {{10.1093/comnet/cnae009}}, volume = {{12}}, year = {{2024}}, } @article{49905, abstract = {{For 0 ≤ t ≤ r let m(t, r) be the maximum number s such that every t-edge-connected r-graph has s pairwise disjoint perfect matchings. There are only a few values of m(t, r) known, for instance m(3, 3) = m(4, r) = 1, and m(t, r) ≤ r − 2 for all t  = 5, and m(t, r) ≤ r − 3 if r is even. We prove that m(2l, r) ≤ 3l − 6 for every l ≥ 3 and r ≥ 2l.}}, author = {{Ma, Yulai and Mattiolo, Davide and Steffen, Eckhard and Wolf, Isaak Hieronymus}}, issn = {{0209-9683}}, journal = {{Combinatorica}}, keywords = {{Computational Mathematics, Discrete Mathematics and Combinatorics}}, pages = {{429--440}}, publisher = {{Springer Science and Business Media LLC}}, title = {{{Edge-Connectivity and Pairwise Disjoint Perfect Matchings in Regular Graphs}}}, doi = {{10.1007/s00493-023-00078-9}}, volume = {{44}}, year = {{2024}}, } @article{53101, abstract = {{In this work, we consider optimal control problems for mechanical systems with fixed initial and free final state and a quadratic Lagrange term. Specifically, the dynamics is described by a second order ODE containing an affine control term. Classically, Pontryagin's maximum principle gives necessary optimality conditions for the optimal control problem. For smooth problems, alternatively, a variational approach based on an augmented objective can be followed. Here, we propose a new Lagrangian approach leading to equivalent necessary optimality conditions in the form of Euler-Lagrange equations. Thus, the differential geometric structure (similar to classical Lagrangian dynamics) can be exploited in the framework of optimal control problems. In particular, the formulation enables the symplectic discretisation of the optimal control problem via variational integrators in a straightforward way.}}, author = {{Leyendecker, Sigrid and Maslovskaya, Sofya and Ober-Blöbaum, Sina and Almagro, Rodrigo T. Sato Martín de and Szemenyei, Flóra Orsolya}}, issn = {{2158-2491}}, journal = {{Journal of Computational Dynamics}}, keywords = {{Optimal control problem, Lagrangian system, Hamiltonian system, Variations, Pontryagin's maximum principle.}}, pages = {{0--0}}, publisher = {{American Institute of Mathematical Sciences (AIMS)}}, title = {{{A new Lagrangian approach to control affine systems with a quadratic Lagrange term}}}, doi = {{10.3934/jcd.2024017}}, year = {{2024}}, } @article{53534, abstract = {{It is known that the notion of a transitive subgroup of a permutation group $G$ extends naturally to subsets of $G$. We consider subsets of the general linear group $\operatorname{GL}(n,q)$ acting transitively on flag-like structures, which are common generalisations of $t$-dimensional subspaces of $\mathbb{F}_q^n$ and bases of $t$-dimensional subspaces of $\mathbb{F}_q^n$. We give structural characterisations of transitive subsets of $\operatorname{GL}(n,q)$ using the character theory of $\operatorname{GL}(n,q)$ and interpret such subsets as designs in the conjugacy class association scheme of $\operatorname{GL}(n,q)$. In particular we generalise a theorem of Perin on subgroups of $\operatorname{GL}(n,q)$ acting transitively on $t$-dimensional subspaces. We survey transitive subgroups of $\operatorname{GL}(n,q)$, showing that there is no subgroup of $\operatorname{GL}(n,q)$ with $1