arXiv preprints from January 1, 2026 through September 22, 2026 — 09:41:27 EST
We study the problem of computing an $ε$-approximate Nash equilibrium of a two-player, bilinear game with a bounded payoff matrix $A \in \mathbb{R}^{m \times n}$, when the players' strategies are constrained to lie in simple sets. We provide algorithms which solve this problem in $\tilde{O}(ε^{-2/3})$ matrix-vector multiplies...
In the merry-go-round fictitious forces are acting like centrifugal force and Coriolis force. Like the Lorentz force Coriolis force is velocity dependent and, following Arnold, can be modeled by twisting the symplectic form. If the merry-go-round is accelerated an additional fictitious force shows up, the Euler force. In this...
Let $C\subset\mathbb{R}^2$ be a convex body, and for a positive integer $N$, let $\mathcal{P}$ be a configuration of $N$ points in $[0,1)^2$. The discrepancy of $\mathcal{P}$ with respect to $C$ is defined by \begin{equation*} \mathcal{D}(\mathcal{P},\,...
This paper investigates the concept of the $q$-Berezin range and $q$-Berezin number of bounded linear operators acting on Hardy space. We obtain the $q$-Berezin range of some classes of operators on Hardy space. In addition, the convexity of the $q$-Berezin range is explored for finite-rank, diagonal, multiplication, weighted shift,...
Code loops are Moufang loops constructed from doubly even binary codes. Then, given a code loop $L$, we ask which doubly even binary code $V$ produces $L$. In this sense, $V$ is called a representation of $L$. In this article we define and show how to determine all minimal and reduced representations of nonassociative code loops of...
This paper deals with the gradient-based extremum seeking control (ESC) with actuation dynamics governed by distributed wave partial differential equations (PDEs). To achieve the control objective of real-time optimization for this class of infinite-dimensional systems, we first solve the trajectory generation problem to re-design the...
We consider the approximation of the 2D frictionless contact problem in elasticity using the Virtual Element Methods (VEMs). To overcome the volumetric locking phenomenon in the nearly incompressible case, we adopt a mixed displacement/pressure ($u/p$) variational formulation, where pressure is introduced as an independent unknown. We...
In this paper, we analyze the density of the Fibonacci word and its derived forms by examining the morphisms associated with each. It offers a comparative analysis of the density of Fibonacci numbers alongside other words derived from Fibonacci word. Fibonacci words over the alphabet $\{a,b\}$, we define a novel \emph{power} operation...
We prove that the fiber product of the Torelli map $t\colon \mathcal{M}^{ct}_g \to \mathcal{A}_g$ with any product $\mathcal{A}_{g_1}\times\dots\times \mathcal{A}_{g_k} \to \mathcal{A}_g$ for $g=g_1+\dots+g_k$ has a reduced scheme structure. As a consequence, letting $d=\text{codim}(t^*[\mathcal{A}_{g_1}\times\dots\times...
Two linear recurrences exhibit mirror symmetry connecting the constants $e$ and $π$. When parametrized, their asymptotic connection constants extend to meromorphic functions satisfying additive functional equations with rational coefficients. We call such functions additive Gamma functions (AGFs), recognizing Euler's $Γ(z)$ as the...
We begin with a review of Tutte's homotopy theory, which concerns the structure of certain graph associated to a matroid (together with some extra data). Concretely, Tutte's path theorem asserts that this graph is connected, and his homotopy theorem asserts that every cycle in the graph is a composition of ''elementary cycles'', which...
Suppose that $f(x) \in \mathbb{R}[x_1,\dots, x_n]$ and $g(x) \in \mathbb{R}[x_1,\dots, x_n]$ are two real polynomials of degree $d$ in $n$ variables. If the polynomials $f$ and $g$ are the same up to orthogonal symmetry a natural question is then what element of the orthogonal group induces the orthogonal symmetry; i.e. to find the...
Oncolytic virotherapy (OVT) is a promising cancer treatment strategy in which engineered viruses selectively infect and destroy tumor cells. Motivated by the biological mechanisms underlying viral spread and tumor invasion into the tissue, we analyze a non-cooperative reaction-diffusion model capturing the invasion of tumor tissue by...
We propose a novel dispersive regularization framework for the numerical simulation of the one-dimensional shallow water equations (SWE). The classical hyperbolic system is regularized by a third-order dispersive term in the momentum equation, which renders the system equivalent, via the Madelung transform, to a defocusing cubic...
The Lamperti transform offers a powerful bridge between self-similar processes and stationary dynamics, making it especially useful for analyzing anomalous diffusion models that lack stationary increments. In this paper we examine the Lamperti transforms of scaled sub-fractional and bi-fractional Brownian motions, deriving explicit...
We show that a set function $ν$ satisfies the gross substitutes property if and only if its homogeneous generating polynomial $Z_{q,ν}$ is a Lorentzian polynomial for all positive $q \le 1$, answering a question of Eur-Huh. We achieve this by giving a rank 1 upper bound for the distance matrix of an ultrametric tree, refining a...
We generalize the global construction of code loops introduced by Nagy, which is based on the connection between Moufang loops and groups with triality. This follows from the construction of a nilpotent group $G_n$ of class 3 with triality and $2n$ generators, based on embeddings of $G_n$ into direct products of copies of $G_3$. In...
We state and prove the spectral expansion of the theta series attached to the Rankin-Selberg spherical variety $(\mathrm{GL}_{n+1} \times \mathrm{GL}_n)/\mathrm{GL}_n$. This is a key result towards the fine spectral expansion of the Jacquet-Rallis trace formula. Our expansion is written in terms of regularized Rankin--Selberg periods...
Let $(X,ω)$ be a translation surface whose Veech group $Γ$ is a lattice. We prove that the generic orbit of the group of affine homeomorphisms of $(X,ω)$ can be used to approximate each point of $X$ with Diophantine precision. The proof utilizes an induced $SL_2(\mathbb{R})$-action on a fiber bundle $Y$ whose base is...
This article proposes new perspectives for developing derivative based numerical algorithms, supported by the introduction of a generalized derivative operators. It demonstrates that these operators have the potential to enhance and extend existing derivativebased numerical methods. To this end, two iterative derivative driven methods...
We develop energy-conserving numerical methods for a two-dimensional hyperbolic approximation of the Serre-Green-Naghdi equations with variable bathymetry and either periodic or reflecting boundary conditions. The hyperbolic formulation avoids the costly inversion of an elliptic operator present in the classical model. Our schemes...
We study a quasilinear chemotaxis system of singular type, where the diffusion operator is given by $Δu^m$ with $0<m<1$, corresponding to the fast diffusion regime, and where the chemotactic drift is nonlinear. Since Hölder continuity constitutes the optimal regularity class for weak solutions to the porous medium equation, we...
We study the accumulation of zeros of a polynomial arising from the enumeration of edge-coloured graphs along certain limit curves. The polynomial is a variant of an edge-chromatic polynomial, which specialises to the partition function of the ferromagnetic Ising model on a random regular graph. We call this accumulation behaviour a...
By modifying a construction of Abe and Tange, we exhibit arbitrarily large families of Lagrangian slice disks with Weinstein deformation equivalent exteriors. This answers a Lagrangian version of a question of Hitt and Sumners. We raise other open questions related to Lagrangian slice disks and their exteriors.
Artificial intelligence has advanced rapidly through large neural networks trained on massive datasets using thousands of GPUs or TPUs. Such training can occupy entire data centers for weeks and requires enormous computational and energy resources. Yet the optimization algorithms behind these runs have not kept pace. Most large scale...