23,682+ open-access research outputs.
This article is essentially an English translation of a paper of mine, published in \emph{La Gaceta de la RSME}. Its aim is to present, for a broad mathematical audience, a research programme in localโฆ
In this paper, we study complete simplicial toric varieties admitting faithful actions of large symmetric groups. First, we correct a recent classification result by Esser, Ji, and Moraga concerning $โฆ
We construct transported PDEs on self-similar fractal domains from reference equations posed on the unit interval, and derive explicit self-similar interacting particle systems that approximate the reโฆ
We study the temporal-spatial regularity properties of tamed Euler approximations for L\'evy-driven SDEs with superlinearly growing drift and diffusion coefficients. We first introduce a novel tamed Eโฆ
We develop a finite-gap construction for the Pohlmeyer--Lund--Regge (PLR) equation and the associated Lund--Regge curve evolution. From the hyperelliptic spectral data we build a Baker--Akhiezer functโฆ
We study a distributed optimal control problem for a nonisothermal Caginalp-type phase-field model that describes tumour growth under thermal therapy. The PDE system couples a possibly viscous Cahn-Hiโฆ
We consider an incompressible magnetohydrodynamics (MHD) model in which the classical first-order time derivatives in the momentum and magnetic induction equations are replaced by variable-order Caputโฆ
Recent research has focused on developing GPU-accelerated first-order solvers for linear programming (LP). This line of work, however, has largely overlooked the role of presolving, and thus prior resโฆ
The Gauss circle problem concerns with the evaluation of $\sum_{n \leq x}r(n)$, where $r(n)$ denotes the number of representations of $n$ as sums of two squares and $x \geq 2$. Let $\Psi_G(x,y)$ denotโฆ
Column generation is a widely used decomposition technique for large-scale linear programs, but it often suffers from slow convergence due to poor initial dual estimates and dual oscillations. Stabiliโฆ
We study the control of finite-state systems driven by exogenous disturbances, and design causal policies that track the performance of a lookahead benchmark controller. This objective is formalized tโฆ
As a cornerstone of reduced-order modeling, the POD-Galerkin framework has garnered widespread attention and remains one of the most widely adopted approaches. Constructing POD-Galerkin PROMs involvesโฆ
Zeroth-order optimization aims to minimize an objective function using only function evaluations, and is therefore fundamental in black-box optimization, hyperparameter tuning, bandit learning, and adโฆ
This paper studies the space of degree $d>1$ invariant q-laminations, i.e., geodesic laminations invariant under the $d$-tupling map of the circle and associated with equivalence relations. Our maโฆ
Two-stage stochastic integer programs provide a powerful framework for modeling decision-making under uncertainty, but they are notoriously difficult to solve at scale due to their high dimensionalityโฆ
One of the central open problems in both algebraic combinatorics and representation theory is to find a positive combinatorial rule for Kronecker coefficients $ g_{\lambda \, \mu \, \nu}$. A notable aโฆ
For every nonzero integer $m$ and every integer $n \ge 1$, the $n$\textsuperscript{th} harmonic number $H_n = 1 + \tfrac12 + \dots + \tfrac1n$ satisfies the identity \[ H_n \;=\; \frac{1}{m}\,\sum_{โฆ
High-order partial differential equations (PDEs) require derivative regularity that standard $C^0$ finite element infrastructures do not directly provide on unstructured meshes. We propose a mesh-intrโฆ
ReLU neural networks trained as surrogate models can be embedded exactly in mixed-integer linear programs (MILPs), enabling global optimization over the learned function. The tractability of the resulโฆ
Many engineered systems must balance competing objectives, such as performance and safety, cost and reliability, or efficiency and sustainability, and are naturally modeled as compositions of interactโฆ
Free open-access publishing with Google Scholar indexing.
Submission Guide โ