Peer Revenue Play credits. Real papers.

Papers

Fresh from arXiv, typeset properly. Highlighted words trade on the market.

Mathematics

math Watch Mathematics (sign in to use)

Saturday 18 April

Algebraic Geometry

The conformal limit for Nakajima quiver varieties

Inspired by Gaiotto's conformal limit construction for Higgs bundles we define and study a conformal limit construction for Nakajima quiver varieties. We prove that the conformal limit is indeed a limit of a one parameter family of points inside a specified quiver variety and that it gives a biholomorphic map between holomorphic Lagrangian submanifolds foliating two different quiver varieties. In the last part of the paper we discuss the analog of Simpson's conjecture on the completeness of these holomorphic Lagrangian submanifolds.
Read the full abstract

Logic

Categorical Equivalence Between Finitary Orthomodular Dynamic Algebras and Orthomodular Lattices

This paper reveals a categorical equivalence connecting two distinct quantum logic structures. The first is the orthomodular lattice, an algebraic system designed to formalize the properties of quantum systems. The second is a finitary orthomodular dynamic algebra, a specialized development of the orthomodular dynamic algebra where the underlying quantum actions are restricted to be finitary. The applicability of the result extends to more specialized lattices, such as Hilbert lattices of closed subspaces of a Hilbert space, beyond general orthomodular lattices. As these lattice structures exhibit connections to a diverse array of quantum structures, the established equivalence categorically bridges unital involutive m-semilattices with a broad spectrum of quantum formalisms.
Read the full abstract

Analysis of PDEs

Global solutions for the Alber equation in $H^1\mathfrak{S}^1(\mathbb{T})$

The Alber equation is the mixed-state nonlinear Schrödinger equation with singular ($\delta$-interaction) kernel. It is used in the modeling of stochastic ocean waves, where it appears with the focusing sign in the nonlinearity, on $d=1.$ The main result of the paper is global well-posedness for self-adjoint, non-negative data in the Schatten-Sobolev space $H^1\mathfrak{S}^1(\mathbb{T}),$ for both the focusing and defocusing cases. The Schatten class norms achieve control of the position density without derivative loss, and a systematic Fourier-Galerkin argument tailored to the $\delta$ kernel allows us to establish several qualitative properties of the solution, including energy conservation. In the focusing case, Hoffmann-Ostenhof and Gagliardo-Nirenberg estimates yield a global a priori $H^1\mathfrak{S}^1$ bound with no smallness condition. Non-negativity is a structural requirement for the energy argument to work. The propagation of higher Sobolev regularity $H^s\mathfrak{S}^1$ follows. As an application, small perturbations around Penrose-stable backgrounds are shown to grow at most polynomially in $H^1\mathfrak{S}$ over long timescales.
Read the full abstract

Mathematical Physics · Cross-listed from cond-mat.stat-mech

Solution of the Ising model with Brascamp-Kunz boundary conditions by the transfer matrix method

The square lattice Ising model under the Brascamp-Kunz boundary conditions is a well-known exactly solvable lattice model. The exact solution of this system has been derived within the framework of Pfaffian-type method. In this paper we provide a derivation for the solution by the Schultz-Mattis-Lieb method in the transfer matrix formalism. We set special interactions on the boundaries and take certain limit of these interactions, so that the system under the Brascamp-Kunz boundary conditions is transformed into another system under the toroidal boundary conditions. The Schultz-Mattis-Lieb method is applied to the mapping system and the partition function is exactly solved in the fermionic representation. The Fisher zeros are analytically calculated and the physical critical point is identified. We also discuss the difference between the transfer matrix approaches to the Brascamp-Kunz and to the toroidal boundary conditions. Our work introduces a member to the family of transfer-matrix-based studies for Ising model under various boundary conditions.
Read the full abstract

Optimization and Control

Semi-definite programs for online control of nonlinear systems with stability guarantees

This paper develops a semidefinite-programming-based method for online feedback control of nonlinear systems using a state-dependent representation. We formulate sequences of time-varying SDPs whose optimal solutions jointly yield a stabilizing feedback controller and a Lyapunov certificate satisfying stability conditions and quadratic performance specifications. We further establish compact conditions certifying recursive feasibility of the resulting SDP sequences and derive estimates of the region of attraction. Numerical examples on representative nonlinear systems illustrate the flexibility and effectiveness of the proposed method.
Read the full abstract

Number Theory

Geometry-of-numbers methods over global fields II: Coregular representations

We develop geometry-of-numbers methods to count orbits in coregular vector spaces having bounded invariants over any global field. We apply these techniques to bound the average ranks and determine average Selmer group sizes of elliptic curves and Jacobians of hyperelliptic curves over any base global field $F$ of characteristic not $2$, $3$ or $5$.
Read the full abstract

Numerical Analysis

Convergence theory for Hermite approximations under adaptive coordinate transformations

Recent work has shown that parameterizing and optimizing coordinate transformations using normalizing flows, i.e., invertible neural networks, can significantly accelerate the convergence of spectral approximations. We present the first error estimates for approximating functions using Hermite expansions composed with adaptive coordinate transformations. Our analysis establishes an equivalence principle: approximating a function $f$ in the span of the transformed basis is equivalent to approximating the pullback of $f$ in the span of Hermite functions. This allows us to leverage the classical approximation theory of Hermite expansions to derive error estimates in transformed coordinates in terms of the regularity of the pullback. We present an example demonstrating how a nonlinear coordinate transformation can enhance the convergence of Hermite expansions. Focusing on smooth functions decaying along the real axis, we construct a monotone transport map that aligns the decay of the target function with the Hermite basis. This guarantees spectral convergence rates for the corresponding Hermite expansion. Our analysis provides theoretical insight into the convergence behavior of adaptive Hermite approximations based on normalizing flows, as recently explored in the computational quantum physics literature.
Read the full abstract

Probability

A Distributional Equation Approach to Front Propagation

Travelling waves of mean-field particle systems are usually studied through the partial differential equation satisfied by the mean-field limit. We develop a different and entirely probabilistic set of tools. The wave profile is characterised as the solution of a distributional fixed-point equation for a tagged particle seen in the frame of the wave, and that equation is solved by relating it to a linear one — a smoothing transform — whose solutions are the martingale limits of a branching random walk. We apply this approach to a range of models, recover some known results and obtain a number of new ones. We first study models where particles evolve according to independent Lévy processes and, at Poisson epochs synchronise randomly selected pairs of particles (the lower of the two moves instantaneously to the position of the higher of the two). We characterise the speeds and travelling waves for all such models. In particular, this covers the case where the Lévy process is a continuous-time random walk with an arbitrary jump distribution; previously, only exponentially distributed jumps had been treated. We also consider a variant in which, instead of synchronising, the lower of the two particles jumps up by a random amount, drawn independently at each jump. This model is motivated by the so-called power-of-2 systems from queueing theory. Finally, we consider a new model where updates are given by the mixture of synchronisation and power-of-2: each update is a random value but the resulting position of the lower particle is capped by that of the higher one. In all cases, we characterise the speed, the travelling waves and their tail behaviour; the probabilistic nature of our approach makes the tail analysis particularly tractable.
Read the full abstract

Numerical Analysis · Cross-listed from eess.IV

Structured 3D-SVD: A Practical Framework for the Compression and Reconstruction of Biological Volumetric Images

This work introduces Structured 3D-SVD as a practical framework for the reconstruction, compression, and analysis of biological volumetric data. Inspired by the logic of matrix singular value decomposition (SVD), the proposed approach represents third-order volumetric data in the spatial domain and supports progressive reconstruction through ordered quasi-singular coeffients. The experimental evaluation was carried out on two biological volumetric datasets: one full-volume scan of a fish and another of a brain. The results show that Structured 3D-SVD achieves reconstruction quality close to that of Tucker decomposition while requiring shorter computation times and outperforms canonical polyadic decomposition (CPD) in both accuracy and runtime. In addition, a progressive reconstruction analysis shows that relatively low truncation levels are sufficient to preserve the main volumetric structures, while higher truncation levels lead to more detailed reconstructions.
Read the full abstract

Functional Analysis

Takesaki duality for weak* closed $L^p$-operator crossed products

The aim of this paper is to study Takesaki duality for weak* closed $L^p$-operator crossed product $W^*_p(G,A,\alpha)$, where $G$ is a countable discrete Abelian group, $A$ is a unital separable weak* closed $L^p$-operator algebra ($p>1$), and $\alpha$ is a weak* continuous $p$-completely isometric action of $G$ on $A$. In this paper, we construct a weak* continuous homomorphism $\Phi$ from $W^*_p(\hat{G},W^*_p(G,A,\alpha),\hat{\alpha})$ to $\mathcal{B}(l^{p}(G))\bar{\otimes}A$. We show that $\Phi$ is an isomorphism if and only if either $p=2$ or $G$ is finite, and $\Phi$ is an isometric isomorphism if either $p=2$ or $G$ is trivial. It is also proved that $\Phi$ is equivariant for the double dual action $\hat{\hat{\alpha}}$ of $G$ on $W^*_p(\hat{G},W^*_p(G,A,\alpha),\hat{\alpha})$ and the action $\mathrm{Ad}\rho_p\otimes\alpha$ of $G$ on $\mathcal{B}(l^p(G))\bar{\otimes} A$. Furthermore, we prove that $W^*_p(\hat{G},W^*_p(G,A,\alpha),\hat{\alpha})$ is weak* continuous isometrically isomorphic to $\mathcal{B}(l^{p}(G))\bar{\otimes}A$ if and only if either $p=2$ or $G$ is trivial, and $W^*_p(\hat{G},W^*_p(G,A,\alpha),\hat{\alpha})$ is weak* continuous isomorphic to $\mathcal{B}(l^{p}(G))\bar{\otimes}A$ if and only if either $p=2$ or $G$ is finite when $A=M_n^p$. This shows that Takesaki duality theorem of von Neumann algebras can be generalized to weak* closed $L^2$-operator algebras, and this theorem can not be generalized to weak* closed $L^p$-operator algebras when $p\in (1,\infty)\setminus\{2\}$.
Read the full abstract

Category Theory

Biprops

We define biprops as a generalization of coloured props and of symmetric weak multicategories. These are bicategories whose objects form a free monoid. They are equipped with some structure resembling a symmetric strict tensor product. We prove that a symmetric weak multicategory gives rise to a biprop and a symmetric weak multifunctor gives rise to a morphism of biprops. This is a functor from the category of symmetric weak multicategories to the category of biprops.
Read the full abstract

Information Theory

Jointly Correlated Dual-Side Fluid Antenna System

Fluid antenna systems (FASs) have introduced a new paradigm for wireless system design by revealing how mutual correlation can be exploited to harvest inherent spatial diversity. While existing studies have mainly focused on one-sided FAS configurations, i.e., with FAS deployed at either the transmitter or the receiver, this work investigates the ergodic capacity of a jointly correlated dual-side FAS under statistical eigenmode transmission. Specifically, a jointly correlated dual-side channel model is developed, and the corresponding ergodic capacity together with a tight closed-form upper bound is derived. In addition, the optimal power allocation is studied, and a practical iterative algorithm is proposed for its implementation.
Read the full abstract

All authors Zhentian Zhang, Yuanhui Wu, Kai-Kit Wong, Hao Jiang, An Li

Mathematical Physics · Cross-listed from cond-mat.mtrl-sci

On the Energy Dissipation in the Landau-Lifshitz-Gilbert Equation

The dynamics of magnetization near a stable equilibrium in ferromagnetic nanomagnets are examined within the Landau–Lifshitz–Gilbert (LLG) framework. For a small angle precession, the dependence of ferromagnetic resonance (FMR) frequency, the damping constant and the resulting quality factor $Q$ of the resonance on the local curvature around the free-energy minimum is systematically analyzed. Special attention is devoted to the behavior of the FMR decay time in the vicinity of bifurcation points, where the number of metastable energy minima changes and the commonly used approximation for the quality factor $Q\simeq 1/2\alpha$ (where $\alpha$ denotes the Gilbert damping) fails.
Read the full abstract

All authors Kutay Kulbak, Mohamed Iyad Boualem, Charlie Masse, Mariana Delalibera de Toledo, Vasily V. Temnov

Optimization and Control · Cross-listed from eess.SY

Distributed Optimization with Nesterov Momentum and Finite-Time Quantized Averaging over Directed Networks: Extended Version

In modern large-scale networked systems, rapidly solving optimization problems while utilizing communication resources efficiently is critical for addressing complex tasks. However, distributed optimization over bandwidth-limited networks must cope with two obstacles: limited-bandwidth communication, and slow convergence when the objective is ill-conditioned. In this paper, we consider unconstrained distributed optimization over strongly connected directed networks, where nodes exchange quantized (i.e., compressed) messages. We propose QANM (Quantized Averaged Nesterov Momentum), an algorithm that combines Nesterov momentum with a finite-time quantized averaging protocol. At every iteration, QANM enables all nodes to reach exact agreement, without requiring doubly stochastic weight matrices or undirected communication. For strongly convex and smooth objectives, we show that the objective gap of QANM decays at the accelerated rate $1-\kappa^{-1/2}$ (where $\kappa$ is the condition number), up to a residual of order $\Delta^2$ determined by the quantization level $\Delta$. This improves the condition-number dependence of the transient iteration complexity from $\kappa$ to $\sqrt{\kappa}$ compared with gradient descent that utilizes the same quantized averaging mechanism. Finally, we evaluate QANM on a distributed sensor fusion problem, showing that our algorithm exhibits the fastest initial error reduction compared with other methods from current literature.
Read the full abstract

All authors Ruochen Wu, Xu Du, Mohammadreza Doostmohammadian, Karl H. Johansson, Apostolos I. Rikos

Combinatorics

Lower bounds on the $g$-numbers of spheres without large missing faces

We establish several new lower bounds on the $g$-numbers of simplicial spheres without large missing faces. For this class of spheres, we derive bounds on the $g$-numbers in terms of the independence numbers of their graphs, extending a result of Chudnovsky and Nevo. As a consequence, we show that flag $(d-1)$-spheres – and more generally, flag normal $(d-1)$-pseudomanifolds – satisfy $g_2\geq (1/2-\delta(d))f_0$, where $\delta(d)$ is a function of $d$ with $\delta(d)\to 0$ as $d\to \infty$. We further prove that, for simplicial $(d-1)$-spheres without large missing faces, an initial segment of the $g$-vector forms a level sequence, yielding additional inequalities among the $g$-numbers. Finally, we show that simplicial $4$-spheres without missing faces of dimension greater than two satisfy $g_2\geq \frac{2}{5}f_0 - \frac{6}{5}$.
Read the full abstract

Operator Algebras

An order-theoretic characterization of C*-algebras

We give an order-theoretic characterization of the essential image of the forgetful functor from the category of real/complex unital C*-algebras to the category of real/complex unital operator systems. It is based on the characterization of JB-algebras among the order unit spaces in terms of the existence of gauge-reversing bijections obtained by M. Roelands and the author in arXiv:2507.09526. To this end, we show that a unital operator system is completely order isomorphic to a C*-algebra if and only if each of its matrix spaces admits a compatible JB-algebra structure. As an application, we prove that for $n\ge 4$ the range of a unital n-positive projection on a unital real C*-algebra is unitally n-order isomorphic to a unital real C*-algebra, which is the analogue of a result proven for complex C*-algebras by Choi–Effros.
Read the full abstract

Optimization and Control · Cross-listed from cs.LG

Towards Fully Parameter-Free Stochastic Optimization: Grid Search with Self-Bounding Analysis

Parameter-free stochastic optimization aims to design algorithms that are agnostic to the underlying problem parameters while still achieving convergence rates competitive with optimally tuned methods. While some parameter-free methods do not require the specific values of the problem parameters, they still rely on prior knowledge, such as the lower or upper bounds of them. We refer to such methods as “partially parameter-free”. In this work, we target achieving “fully parameter-free” methods, i.e., the algorithmic inputs do not need to satisfy any unverifiable condition related to the true problem parameters. We propose a powerful and general grid search framework, named Grasp, with a novel self-bounding analysis technique that effectively determines the search ranges of parameters, in contrast to previous work. Our method demonstrates generality in: (i) the non-convex case, where we propose a fully parameter-free method that achieves near-optimal convergence rate, up to logarithmic factors; (ii) the convex case, where our parameter-free methods are competitive with strong performance in terms of acceleration and universality. Finally, we contribute a sharper guarantee for the model ensemble, a final step of the grid search framework, under interpolated variance characterization.
Read the full abstract

All authors Yuheng Zhao, Yu-Hu Yan, Amit Attia, Tomer Koren, Lijun Zhang, Peng Zhao

Information Theory

Anti-Jamming Optimization for EM-Compliant Active RIS via Decoupling Architecture

Wireless communication systems are increasingly vulnerable to sophisticated jamming attacks with the rapid evolution of jamming technologies and advanced signal processing techniques. While traditional anti-jamming techniques offer limited performance gains, active reconfigurable intelligent surfaces (RISs) have emerged as a promising channel-domain solution for improving resilience against jamming. Nonetheless, existing studies often rely on simplified electromagnetic (EM) models that do not fully capture mutual coupling (MC) and impedance mismatches in RIS hardware. In this paper, we propose an EM-compliant active (EMC-Active) RIS model for anti-jamming systems, explicitly incorporating the EM and physical properties at active RIS, such as MC effects, channel correlation, and discrete phase. To evaluate the anti-jamming performance of the proposed EMC-Active RIS, we develop a low-complexity alternating optimization (AO) algorithm based on the decoupling architecture (DA) to maximize the ergodic achievable rate. By leveraging the DA to explicitly eliminate MC effects among REs, the original coupled system is transformed into a tractable and scalable uncoupled representation. Numerical results demonstrate that the DA-based AO algorithm can significantly reduce the modeling and optimization complexity and efficiently solve the problem in an alternating manner with substantially reduced iteration overhead.
Read the full abstract

All authors Yang Cao, Wenchi Cheng, Jingqing Wang, Lifeng Wang

Group Theory

Conjugacy classes of positive $3$-braids

The conjugacy problem in braid groups has been extensively studied, particularly from an algorithmic perspective. Established methods based on Garside structures, such as initial summit sets and super summit sets, provide effective procedures for determining whether two braids are conjugate. In contrast, explicit structural descriptions of conjugacy classes are less frequently addressed. Although cyclic sliding offers a powerful mechanism for navigating distinguished subsets within a conjugacy class, it is well known that conjugate braids cannot, in general, be obtained from one another solely through iterated cyclic sliding. In this paper, we provide a direct and explicit characterization of the conjugacy classes of positive $3$-braids. Specifically, for any given positive $3$-braid, we determine all of its conjugates in a concrete and closed form.
Read the full abstract

Logic

Ultracontact algebras and stack systems

We study the class of structures that, in a way, generalize various approaches to the contact relation on Boolean algebras.
Read the full abstract

All authors Luca Carai, Ivo Düntsch, Rafał Gruszczyński, Anna Laura Suarez

Optimization and Control

Forecast-Enhanced Lyapunov Optimization for Real-Time EV Charging Scheduling

Electric vehicles (EVs) play a vital role in achieving carbon neutrality. Various approaches have been developed for online optimal EV charging scheduling to maximize their environmental and economic benefits. Among them, Lyapunov optimization has gained wide adoption due to its ease of implementation, no need for predictions, and rigorous performance guarantees. However, this prediction-free nature also limits the performance of Lyapunov optimization, as it cannot fully leverage the relatively accurate short-term forecasts often available in practice. To overcome this limitation, this paper proposes a forecast-enhanced Lyapunov optimization method for real-time EV charging scheduling. Specifically, we design novel virtual queues and embed the traditional Lyapunov optimization within a receding horizon control framework to incorporate short-term predictions. The proposed algorithm is further extended by introducing heterogeneous penalty parameters to reduce the optimality gap. We prove that the proposed algorithm achieves bounded charging delay and a bounded optimality gap between online and offline solutions, both depending on the prediction window length. Numerical experiments demonstrate that the proposed method reduces operational costs compared to the traditional prediction-free Lyapunov optimization algorithm, while still satisfying all charging requirements.
Read the full abstract

All authors Shihan Huang, Yue Chen, Richard Chen, Adam Wierman

Number Theory

Reduction mod $p$ of semi-stable representations of some super-Breuil weights

We determine the mod $p$ reductions of the semi-stable representations $V_{k, \mathcal{L}}$ of weight $k \in [p + 5, 2p]\cup[2p + 6, 3p + 1]$ and $v_p(\mathcal{L}) < 1-k/2$ for primes $p \geq 5$. In particular, this shows that the techniques introduced in [CG24] involving the $p$-adic and mod $p$ local Langlands correspondences can be used to compute the reduction of $V_{k, \mathcal{L}}$ outside the range $k \in [3, p + 1]$. Moreover, this shows that the bound on $v_p(\mathcal{L})$ given by Bergdall-Levin-Liu [BLL23] can be improved, at least for weights $k \in [2p + 6, 3p + 1]$.
Read the full abstract

Group Theory

Uniformly Almost Flatness and Solubility in Finitely Generated Groups

Tointon and the author conjectured that, for a finitely generated residually finite group, virtual nilpotence is equivalent to the condition that the diameters of its finite coset spaces admit a uniform polynomial lower bound in terms of their sizes. We first verify this conjecture for the class of finitely generated soluble groups. We then prove that this polynomial lower bound condition implies that the group has a finite-index subgroup whose finite quotients are all soluble. An immediate consequence of these two results is the verification of the conjecture for finitely generated linear groups. In addition, we establish the same conclusion for certain finitely generated abelian-by-cyclic groups under the weaker assumption that their finite quotients satisfy this polynomial lower bound condition.
Read the full abstract

Probability · Cross-listed from stat.ML

Extraction of informative statistical features in the problem of forecasting time series generated by Itô-type processes

In this paper, we consider the problem of extraction of most informative features from time series that are regarded as observed values of stochastic processes satisfying the Itô stochastic differential equations with unknown random drift and diffusion coefficients. We do not attract any additional information and use only the information contained in the time series as it is. Therefore, as additional features, we use the parameters of statistically adjusted mixture-type models of the observed regularities of the behavior of the time series. Several algorithms of construction of these parameters are discussed. These algorithms are based on statistical reconstruction of the coefficients which, in turn, is based on statistical separation of normal mixtures. We obtain two types of parameters by the techniques of the uniform and non-uniform statistical reconstruction of the coefficients of the underlying Itô process. The reconstructed coefficients obtained by uniform techniques do not depend on the current value of the process, while the non-uniform techniques reconstruct the coefficients with the account of their dependence on the value of the process. Actually, the non-uniform techniques used in this paper represent a stochastic analog of the Taylor expansion for the time series. The efficiency of the obtained additional features is compared by using them in the autoregressive algorithms of prediction of time series. In order to obtain pure conclusion that is not affected by unwanted factors, say, related to a special choice of the architecture of the neural network prediction methods, we used only simple autoregressive algorithms. We show that the use of additional statistical features improves the prediction.
Read the full abstract

All authors Victor Korolev, Mikhail Ivanov, Tatiana Kukanova, Artyom Rukavitsa, Alexander Vakshin, Peter Solomonov, Alexander Zeifman

Geometric Topology

On hyperbolic L-space knots with braid index four and tunnel number two

There are only three known strongly invertible hyperbolic L-space knots with braid index four and tunnel number two. They are t09284, t10496 and o9_34409 in the SnapPy census. In this paper, we give the first infinite family of strongly invertible hyperbolic L-space knots with braid index four and tunnel number two that includes t10496 and o9_34409.
Read the full abstract

Analysis of PDEs

Global well-posedness and scattering for defocusing energy-critical inhomogeneous NLS in dimensions $d\ge 3$

We study the defocusing energy-critical inhomogeneous nonlinear Schrödinger equation \[ i\partial_tu+\Delta u=|x|^{-b}|u|^{\frac{4-2b}{d-2}}u, \qquad (t,x)\in\R\times\R^d, \] with initial data $u_0\in\dot H_x^1(\R^d)$, where $d\ge 3$ and $0<b<\min\{2,\frac d2\}$. We prove global well-posedness and scattering for arbitrary non-radial data. The main difficulties are that, when $d\ge 6$, the derivative of the critical nonlinearity is only Hölder continuous, so the short-time perturbation argument cannot be closed in $\dot S^1$, and that the singular coefficient $|x|^{-b}$ breaks translation symmetry. To handle these issues, we exploit the weak-space structure $|x|^{-b}\in L^{\frac{d}{b},\infty}(\R^d)$, introduce exotic Strichartz norms, and prove a long-time stability theorem for the general energy-critical inhomogeneous nonlinear Schrödinger equation. We also show that profiles escaping to spatial infinity are asymptotically linear because of the decay of $|x|^{-b}$. Consequently, almost periodic solutions are compact modulo scaling only, with neither spatial nor frequency center parameters. Combined with the concentration–compactness argument of Kenig–Merle [Invent. Math. 166 (2006), 645–675], this yields the main theorem.
Read the full abstract

Numerical Analysis

Singularity Formation: Synergy in Theoretical, Numerical and Machine Learning Approaches

This thesis develops numerical and theoretical approaches for understanding and analyzing singularity formation in Partial Differential Equations (PDEs). The singularity formation in the Navier-Stokes Equation (NSE) is famously challenging as one of the seven Clay Prize problems. Unlike simpler equations such as the Nonlinear Heat (NLH) or Keller-Segel (KS) equations, where formal asymptotics near blowup are better understood, the intrinsic complexity of NSE makes quantitative analytical treatment difficult, if not impossible, without numerical guidance. Building on numerical insights, we introduce a robust analytical framework to simplify and systematize pen-and-paper proofs for simpler singular PDEs. We present a novel approach based on enforcing vanishing modulation conditions for perturbations around approximate blowup profiles, complemented by singularly weighted energy estimates. We demonstrate the efficacy of our method on PDEs with complicated asymptotics, such as NLH and the Complex Ginzburg-Landau (CGL) equation, and address the open problem of singularity formation in the 3D KS equation with logistic damping. We develop and refine numerical approaches that facilitate deeper insights into singularity formation. We demonstrate that machine learning methods significantly enhance our capability to identify and characterize potential blowup solutions with high precision. We improve on existing Physics-Informed Neural Network (PINN) and Neural Operator (NO) frameworks. Moreover, we present a novel machine learning paradigm, the Kolmogorov-Arnold Network (KAN) architecture, whose interpretability and excellent scaling properties are achieved through learnable nonlinearities.
Read the full abstract

Number Theory

Möbius disjointness conjecture for Furstenberg's flow on $\mathbb{T}^\omega$ in short intervals

Furstenberg's flow on the infinite-dimensional torus $\mathbb{T}^\omega$ is defined by \[ T (x_1, x_2, \ldots, x_\nu, \ldots) = (x_1 + \alpha, x_2 + h(x_1), \ldots, x_\nu + h(x_1 + (\nu-2)\beta), \ldots) \] with $\alpha\in \mathbb{R}$ satisfying certain diophantine conditions, $\beta\in \mathbb{R}\backslash\mathbb{Q},$ and $h: \mathbb{R}\to \mathbb{R}$ being $1$-periodic and analytic. This flow is irregular in the sense that its Birkhoff average does not exist for some $x\in \mathbb{T}^\omega$, and it is a generalization of Furstenberg's irregular flow on $\mathbb{T}^2$. The main result of this paper is that the Möbius Disjointness Conjecture of Sarnak holds for the above flow $(\mathbb{T}^\omega, T)$ in short intervals $(N-M, N]$ with $N^{5/8+\varepsilon} \leqslant M\leqslant N$.
Read the full abstract

Complex Variables

Sharp Estimates of Hankel Determinants for certain classes of convex univalent functions

Let $\mathcal{A}$ denote the class of analytic functions $f$ such that $f(0)=0$ and $f'(0)=1$ in the unit disk $\mathbb{D}:=\{z \in \mathbb{C}: |z|<1\}.$ We examine the properties of the class $\mathcal{C}(\varphi)$ defined as $\mathcal{C}(\varphi) := \left\{ f \in \mathcal{A} : 1+zf''(z)/f'(z) \prec \varphi(z):=1+z+ m/n\, \, z^2, \text{ with } 2m \le n,\text{ for } m, n \in \mathbb{N} \right\},$ and compute the sharp second and third Hankel determinants for the functions in $\mathcal{C}(\varphi)$. Furthermore, we determine the extremal functions for the sharp estimates of the Hankel determinants.
Read the full abstract

Dynamical Systems · Cross-listed from cond-mat.mtrl-sci

On the complementary roles of anisotropic crack density and anisotropic crack driving force in phase-field modeling of mixed-mode fracture

Phase-field models for anisotropic fracture employ two complementary mechanisms: (i) the anisotropic crack density function, controlling direction-dependent fracture resistance, and (ii) the anisotropic strain energy, governing the fracture driving force. Although the unified framework was presented in Pranavi et al.[Comput. Mech., 73 (2024)], the distinct roles of these mechanisms and their interaction remain uninvestigated. This work addresses this gap by first validating the formulation against mixed-mode fracture experiments on a soft elastomer (Lu et al. [Extreme Mech. Lett., 48 (2021)]), and then conducting systematic parametric studies on single-edge-notched (SEN) and open-hole tension (OHT) specimens to isolate each mechanism. The SEN studies show that the crack density anisotropy controls the crack path and toughness while leaving the elastic response unchanged, whereas the anisotropic strain energy deflects the crack but saturates rapidly. The OHT studies reveal a geometry-dependent role expansion: the anisotropic strain energy governs fiber-orientation-dependent stiffness, peak force, and fracture displacement. When both mechanisms act together, the combined response exhibits nonlinear synergistic interaction exceeding the linear sum of the individual contributions. These results establish that the crack density anisotropy governs the crack path (fracture resistance), while the anisotropic strain energy governs the driving force and, in stress-concentration geometries, additionally controls the elastic strain energy distribution around the stress concentrator.
Read the full abstract

All authors Guk Heon Kim, Minseo Kim, Kwangsan Chun, Jaemin Kim