Results 41 to 50 of about 665 (180)

Data‐Based Refinement of Parametric Uncertainty Descriptions

International Journal of Robust and Nonlinear Control, Volume 36, Issue 6, Page 3210-3228, April 2026.
ABSTRACT We consider dynamical systems with a linear fractional representation involving parametric uncertainties which are either constant or varying with time. Given a finite‐horizon input‐state or input‐output trajectory of such a system, we propose a numerical scheme which iteratively improves the available knowledge about the involved constant ...
Tobias Holicki, Carsten W. Scherer
wiley   +1 more source

A classification of Prüfer domains of integer‐valued polynomials on algebras

Bulletin of the London Mathematical Society, Volume 58, Issue 4, April 2026.
Abstract Let D$D$ be an integrally closed domain with quotient field K$K$ and A$A$ a torsion‐free D$D$‐algebra that is finitely generated as a D$D$‐module and such that A∩K=D$A\cap K=D$. We give a complete classification of those D$D$ and A$A$ for which the ring IntK(A)={f∈K[X]∣f(A)⊆A}$\textnormal {Int}_K(A)=\lbrace f\in K[X] \mid f(A)\subseteq A ...
Giulio Peruginelli, Nicholas J. Werner
wiley   +1 more source

Traces of Hecke operators on Drinfeld modular forms for GL2(Fq[T])$\operatorname{GL}_2(\mathbb {F}_q[T])$

Mathematika, Volume 72, Issue 2, April 2026.
Abstract In this paper, we study traces of Hecke operators on Drinfeld modular forms of level 1 in the case A=Fq[T]$A = \mathbb {F}_q[T]$. We deduce closed‐form expressions for traces of Hecke operators corresponding to primes of degree at most 2 and provide algorithms for primes of higher degree.
Sjoerd de Vries
wiley   +1 more source

On the Mean‐Field Limit of Consensus‐Based Methods

Mathematical Methods in the Applied Sciences, Volume 49, Issue 5, Page 4214-4240, 30 March 2026.
ABSTRACT Consensus‐based optimization (CBO) employs a swarm of particles evolving as a system of stochastic differential equations (SDEs). Recently, it has been adapted to yield a derivative free sampling method referred to as consensus‐based sampling (CBS). In this paper, we investigate the “mean‐field limit” of a class of consensus methods, including
Marvin Koß, Simon Weissmann, Jakob Zech
wiley   +1 more source

Robust Control Design and Analysis Based on Lifting Linearization of Nonlinear Systems Under Uncertain Initial Conditions

International Journal of Robust and Nonlinear Control, Volume 36, Issue 5, Page 3047-3067, 25 March 2026.
ABSTRACT This paper presents a robust control synthesis and analysis framework for nonlinear systems with uncertain initial conditions. First, a deep learning‐based lifting approach is proposed to approximate nonlinear dynamical systems with linear parameter‐varying (LPV) state‐space models in higher‐dimensional spaces while simultaneously ...
Sourav Sinha, Mazen Farhood
wiley   +1 more source

Equivariant toric geometry and Euler–Maclaurin formulae

Communications on Pure and Applied Mathematics, Volume 79, Issue 3, Page 451-557, March 2026.
Abstract We first investigate torus‐equivariant motivic characteristic classes of toric varieties, and then apply them via the equivariant Riemann–Roch formalism to prove very general Euler–Maclaurin‐type formulae for full‐dimensional simple lattice polytopes.
Sylvain E. Cappell, Laurenţiu Maxim, Jörg Schürmann, Julius L. Shaneson   +3 more
wiley   +1 more source

Vector bundles on bielliptic surfaces: Ulrich bundles and degree of irrationality

Mathematische Nachrichten, Volume 299, Issue 3, Page 514-528, March 2026.
Abstract This paper deals with two problems about vector bundles on bielliptic surfaces. The first is to give a classification of Ulrich bundles on such surfaces S$S$, which depends on the topological type of S$S$. In doing so, we study the weak Brill–Noether property for moduli spaces of sheaves with isotropic Mukai vector. Adapting an idea of Moretti
Edoardo Mason
wiley   +1 more source

Subset‐Row Inequalities and Unreachability in Path‐Based Formulations for Vehicle Routing and Scheduling Problems

Networks, Volume 87, Issue 2, Page 111-130, March 2026.
ABSTRACT This work considers branch‐price‐and‐cut algorithms for variants of the vehicle‐routing problem in which subset‐row inequalities (SRIs) are used to strengthen the linear relaxation. SRIs often help to substantially reduce the size of the branch‐and‐bound search tree.
Stefan Faldum, Timo Gschwind, Stefan Irnich   +2 more
wiley   +1 more source

Qubit‐Efficient Quantum Local Search for Combinatorial Optimization

Advanced Quantum Technologies, Volume 9, Issue 3, March 2026.
We introduce a qubit‐efficient variational quantum algorithm for combinatorial optimization that adaptively uses from logarithmic to a linear number of qubits to implement quantum local search. The method encodes flip probabilities of spin groups into quantum amplitudes, enabling exploration of classically intractable neighborhoods while maintaining ...
Mikhail Podobrii, Viacheslav Kuzmin, Vladimir Voloshinov, Margarita Veshchezerova, Michael R. Perelshtein   +4 more
wiley   +1 more source

Direct Summand of Serial Modules

European Journal of Pure and Applied Mathematics
Let R be an associative ring and M a unitary left R-module. An R-module M is said to be uniserial if its submodules are linearly ordered by inclusion. A serial module is a direct sum of uniserial modules. In this paper, we bring our modest contribution to the open problem listed in the book of Alberto Facchini "Module Theory" which states that is any ...
Alhousseynou BA, Mankagna A. Diompy, Andre S. Diabang   +2 more
openaire   +1 more source