1,197+ open-access research outputs.
Let $G = \mathrm{SL}(n,\mathbb{C})$, let $B$ be a fixed Borel subgroup, and let $P \supset B$ be a parabolic subgroup determined by a composition $(c_1,\dots,c_k)$ of $n$. Write $P'$ for the derived g…
We analyze the convergence rate of an accelerated backward forward method for solving convex composite optimization problems. The method was developed by Taylor, Hendrickx and Glineur, and is differen…
This contribution proposes novel data-driven surrogate modeling approaches for parameterized parabolic PDEs, where the parameter dependence can be split into two parts with different decay behavior of…
By results of Dantzig (1951) and Adler (2013), computing the optimal solutions of a linear program is equivalent to finding optimal strategies in zero-sum bimatrix games. Dantzig's original result was…
A proper orientation $D$ of an undirected graph $G$ is an orientation of $G$ such that $d_D^+(u)\not=d_D^+(v)$ for any edge $uv\in E(G)$. Denote the proper orientation number $\vec{\chi}(G)$ of an und…
The predictive simulation of fluid dynamics in densely packed microfluidic devices, such as Deterministic Lateral Displacement (DLD) arrays, is severely bottlenecked by the stagnation of standard iter…
We define a regular polynomial skew product $(p(z),q(z,w))$ of $\mathbb{C}^2$ of degree $d\geq 2$ to be special if it is triangularly conjugate to a map of the form $(p(z),q(w))$, where $p$ and $q$ ar…
The Dynamic Mode Decomposition (DMD) and the more general Extended DMD (EDMD) are powerful tools for computational analysis of dynamical systems in data-driven scenarios. They are built on the theoret…
We study the moduli space $B\textrm{Diff}^+(M)$, for $M$ a reducible, oriented 3-manifold with irreducible prime factors $P_1,\ldots,P_n$. A programme of C\'esar de S\'a-Rourke, Hendriks-Laudenbach, a…
Large-scale power system planning mostly uses linearized, active power only approximations of the power flow equations, ignores many operational constraints, and tests the operational feasibility of t…
Carnevale, Schein and Voll proved self-reciprocity of the generalized Igusa functions, and Maglione and Voll did the same for the Hall-Littlewood-Schubert series. We introduce a simultaneous generaliz…
In his classical work, W. Blaschke proved that a convex body whose shadow boundaries are flat for every direction of parallel illumination must be an ellipsoid. An extension recently proposed by I. Go…
We propose two novel data-driven dynamic mode decomposition (DMD)-type methods, the Crank--Nicolson DMD and the semi-implicit DMD, to predict the highly oscillatory dynamics of the semiclassical Schr\…
We continue our investigations of bilinear sums with modular square roots and the large sieve for square moduli in our recent article "On bilinear sums with modular square roots and applications II", …
A graph is called strongly $\Z_{2k+1}$-connected if for each boundary function $\beta: V(G)\mapsto \Z_{2k+1}$ with $\sum_{v\in V(G)}\beta(v)\equiv 0\pmod{2k+1}$, there exists an orientation $D$ of $G$…
We study the degree landscape of the partition graph $G_n$, whose vertices are the integer partitions of $n$ and whose edges correspond to elementary transfers of one unit between parts, followed by r…
We show: 1) The existence of the first twisted Hilbert space that is not isomorphic to its dual; this solves a problem posed by Cabello in [Nonlinear centralizers in homology, Math. Ann. 358 (2014), n…
A graph is strongly $\Z_{\ell}$-connected if for each boundary function $\beta: V(G)\mapsto \Z_{\ell}$ with $\beta(v) \equiv d(v) \pmod{2}$ for every vertex $v$ and $\sum_{v \in V(G)} \beta(v) \equiv …
Piecewise-linear nonlinear systems appear in many engineering disciplines. Prediction of the dynamic behavior of such systems is of great importance from practical and theoretical viewpoint. In this p…
Let $G$ be a graph with vertex set $V=V(G)$. A double Roman dominating function on a graph $G$ is a function $f : V \to \{0,1,2,3\}$ satisfying the conditions that if $f(v) = 0$, then vertex $v$ must …
Free open-access publishing with Google Scholar indexing.
Submission Guide →