Combinatorics
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
Friday 13 March
A graph is split if its vertex set can be partitioned into a clique and an independent set. Let $K_{1,4}+e$ denote the graph obtained from $K_{1,4}$ by adding an edge between two leaves. Ryjáček et al. [J. Combin. Theory Ser. B 134 (2019), 239–263] conjectured that every $4$-connected graph with minimum degree at least 6 that contains neither $K_{1,4}$ nor $K_{1,4}+e$ as an induced subgraph is Hamiltonian. They proved the conclusion for $5$-connected graphs with the same minimum degree bound. We prove that every $3$-connected split graph of order at least 13 that contains neither of these induced subgraphs is Hamilton-connected. Together with Dirac's theorem, this proves the conjecture of Ryjáček et al. for split graphs.
Probability
A property of log-concave and weakly-symmetric distributions for two step approximations of random variables
In this paper we introduce a generalization of classical risk measures in which the risk is represented by a step function taking two values, corresponding to two endogenously determined market regimes. This extends the traditional framework where risk measures map random variables to single real numbers. For the quadratic loss function, we study the optimization problem of determining the optimal regime threshold and corresponding values. In the case of log-concave distributions we give conditions for the uniqueness of the regime changing. We treat the case of one dimension and also of multi-dimensions for elliptic distributions. We demonstrate the necessity of convexity through counterexamples.
Read the full abstract
Analysis of PDEs
Approximate null-controllability of discrete heat equations with potentials on lattices
We investigate approximate null-controllability for semi-discrete heat equations on the lattice $h\mathbb{Z}^d$ with a potential. By establishing spectral inequalities for the discrete Schrödinger operator $P_h = -\Delta_h + V$ on equidistributed sets, we derive observability estimates via the Lebeau-Robbiano method and the Hilbert Uniqueness Method. For bounded potentials, we obtain quantitative controllability results with explicit dependence on the potential and show near optimality of the geometric condition on the observation set. We also treat polynomial growth potentials, for which similar properties hold with weaker control cost estimates. These results extend discrete Carleman techniques to the full-space lattice setting and provide new spectral estimates for discrete Schrödinger operators.
Read the full abstract
Optimization and Control
Adding Decision Problem Makes Information More Valuable
We consider decision-making under incomplete information about an unknown state of nature. We show that a decision problem yields a higher value of information than another, uniformly across information structures, if and only if it is obtained by adding an independent, parallel decision problem.
Read the full abstract
Information Theory
Research on Linear Codes Holding $q$-Ary $t$-Designs
A $q$-ary $t$-$(n,w,\lambda)$ design is a collection $\mathcal{A}$ of vectors of weight $w$ in $\mathbb{F}_{q}^{n}$ with the property that every vector of weight $t$ in $\mathbb{F}_{q}^{n}$ is contained in exactly $\lambda$ members of $\mathcal{A}$. The supports of the vectors in a $q$-ary $t$-design form an ordinary $t$-design, possibly with repeated blocks. While linear codes supporting ordinary combinatorial designs have been extensively studied, the case where codes hold $q$-ary designs remains largely unexplored. This motivates a systematic investigation into whether codewords of a fixed weight in a linear code can form a $q$-ary $t$-design. Building on previous work, we develop two new criteria for this purpose. Applying these criteria, we show that several families of linear codes hold $q$-ary $2$-designs, including one- and two-weight codes, extremal self-dual codes, as well as certain dual codes, shortened codes, and punctured codes derived from them. Moreover, for linear codes that do not satisfy these criteria, we provide an alternative approach based on the automorphism group of the code. This method enables the construction of $q$-ary $2$-designs from doubly-extended Reed-Solomon codes. Notably, for a class of linear codes previously known to support $4$-designs, we demonstrate that their codewords of certain weights give rise to $q$-ary $2$-designs whose parameters are precisely determined.
Read the full abstract
Analysis of PDEs
Inviscid Limit for Yudovich solution to heat conductive Boussinesq equation on two-dimensional periodic domain
We establish the inviscid limit of the Yudovich solution to the heat conductive Boussinesq equation with initial velocity and temperature/buoyancy in $L^2$ and initial vorticity in $L^\infty$ on the two-dimensional periodic domain ${\bf T}^2$. Given any finite time $T>0$ and $p \in [1,\infty[$, we show that the solution to the diffusive Boussinesq equation converges in $L^\infty(0,T; W^{1,p}({\bf T}^2))$ to the solution to the Euler–Boussinesq equation as the viscosity tends to zero, provided that the initial vorticity, velocity, and temperature/buoyancy converge strongly in $L^2$. Our proof adapts and extends the arguments in [P. Constantin, T. D. Drivas, and T. M. Elgindi, Comm. Pure Appl. Math. 75 (2022), 60–82] to forcing terms in $L^1(0,T; L^\infty({\bf T}^2))$.
Read the full abstract
Analysis of PDEs
Regularity criteria for the surface growth model with a forcing term
Based on a compactness method, we establish regularity criteria for suitable weak solutions to the surface growth model with a forcing term. These criteria imply that the Hölder regularity of solutions follows from smallness conditions on several scale-invariant quantities. As a consequence, we obtain a partial regularity result stating that the one-dimensional biparabolic Hausdorff measure of the singular set is zero.
Read the full abstract
Analysis of PDEs
From Microscopic Damage to Macroscopic Games: A Dimensionality Reduction of Stem Cell Homeostasis
Tissues must maintain macroscopic homeostasis despite the continuous microscopic accumulation of cellular damage. Theoretical models of this process often suffer from a disconnect between microscopic biophysics and macroscopic phenomenological games. Here, we bridge this gap by deriving an exact dimensionality reduction of a physiologically structured partial differential equation (PDE) into a low-dimensional dynamical system. Under the condition of uniform mortality, we mathematically demonstrate that tissue homeostasis operates as an induced Nash equilibrium, where the per-capita net growth rates of stem and differentiated phenotypes perfectly equalize. This reduction yields closed-form algebraic rules, the Ratio and Equalization Laws, that map continuous microscopic state dynamics to measurable macroscopic observables. To demonstrate the biological utility of this framework, we present a concrete, falsifiable case study of the murine intestinal crypt. By modeling crypt regeneration following irradiation-induced stem cell depletion, our framework successfully recovers the experimentally observed reliance on progenitor dedifferentiation. Furthermore, the model generates explicit, testable predictions, enabling the in vivo estimation of hard-to-measure lineage plasticity rates directly from aggregate static cell counts. This work provides a rigorous, predictive mathematical foundation for understanding how fast-renewing tissues filter microscopic noise to sustain macroscopic regenerative capacity.
Read the full abstract
Analysis of PDEs
Quantitative stratification and global regularity for 1/2-harmonic mappings
In this paper, we extend the celebrated global regularity theory of Naber-Valtorta [Ann. Math. 2017] to 1/2-harmonic mappings into manifolds. Inspired by their work, we first adapt Lin's defect measure theory [Ann. Math. 1999] to such maps building on the partial regularity established by Millot-Pegon-Schikorra [Arch. Ration. Mech. Anal. 2021]. Then apply it to show that the set of singular points of such maps can be quantitatively stratified via a new notion of boundary symmetry with the aid of {the celebrated harmonic extension method by Caffarelli-Silverstre}. As in that of Naber-Valtorta, developing the necessary quantitative regularity estimates, and then combining it with the Reifenberg type theorems and a delicate covering argument allow us to get sharp growth estimates on the volume of tubular neighborhood around singular points and establish the rectifiability of each singular stratum.
Read the full abstract
Combinatorics
Bijections for rhombic alternative tableaux
We generalize well-known bijections between alternative tableaux and permutations to bijections between rhombic alternative tableaux (RAT) and assemblées of permutations. We show how these various bijections are connected. As a consequence, we find a refined enumeration formula for RAT. One of our bijections carries many statistics from RAT to assemblées; notably, it sends the number of free cells to the number of crossings, which answers a question of Mandelshtam and Viennot. We also find an $r!$-to-$1$ map from marked Laguerre histories to assemblées, answering a question of Corteel and Nunge.
Read the full abstract
Dynamical Systems
Synergies, Trade-offs, and Structural Pathways: A Directed Network Approach to SDG Prioritisation
To successfully implement the Sustainable Development Goals (SDGs), it is necessary to understand the process by which the achievement of one goal has a spillover effect in a development system. While existing research studies synergies and trade-offs among the SDGs, most empirical approaches operate at the goal level, treat interactions as undirected, or prioritise indicators without accounting for structural redundancy. In this paper, we propose a direction-sensitive and indicator-level network approach to detect high-impact and diversified entry points for policy intervention. By using statistically significant lagged correlations, we build a directed weighted network of SDG indicators and assign them into groups based on the balance of their positive and negative spillovers. Systemic effects are measured by weighted out-degree Opsahl centrality, and flow-based clustering is used to detect frequent paths of high positive spillovers. Applying the framework to the Indian context, it is found that the interlinkages in the SDGs are highly asymmetric and structured in specific structural subsystems. Although synergies slightly outweigh the total, trade-offs are still embedded in the sectors. Notably, the most influential indicators are focused on a single pathway of propagation, suggesting that influence-based prioritisation itself could result in redundant system-wide impacts. A cluster-based prioritisation approach leads to a more diversified set of interventions, triggering multiple structurally independent channels of beneficial spillovers. The proposed framework combines directionality, trade-off embedding, and structural propagation analysis in a single framework, providing a scalable solution for country-level SDG prioritisation under resource constraints.
Read the full abstract
Analysis of PDEs
Sharp asymptotic behavior of solutions to damped nonlinear Schrödinger equations
We consider large time asymptotics for damped nonlinear Schrödinger equations. It is known that the nonlinear solution asymptotically behaves like a linear solution when time $t$ tends to infinity in the energy space. We prove that its convergence rate can be refined and the obtained rate is sharp if initial data belong to certain function spaces. This result partially solves open problems concerning the optimal decay rate of scattering.
Read the full abstract
Analysis of PDEs
Blow-up and sharp lifespan estimates to the weakly coupled system of structurally damped wave equations with critical nonlinearities
In this paper, we would like to study the weakly coupled system of semilinear structurally damped wave equations with moduli of continuity in nonlinear terms whose powers belong to the critical curve in the $p-q$ plane. Our main purpose is to find a sharp condition for these moduli of continuity by investigating the global (in time) existence of small data Sobolev solutions and the blow-up result for solutions in finite time as well. Furthermore, when the blow-up phenomenon occurs, we are going to achieve the sharp lifespan estimates for the local (in time) Sobolev solution.
Read the full abstract
Statistics Theory
Multivariate normality test based on the uniform distribution on the Stiefel manifold
This study presents a new procedure for necessary tests of multivariate normality based on the uniform distribution on the Stiefel manifold. We demonstrate that the test statistic, which is formed by the product of the scaled residual matrix and the symmetric square root of a Wishart matrix, is exactly distributed as a matrix-variate normal distribution under the null hypothesis. Monte Carlo simulations are conducted to assess the Type I error rate and power in non-asymptotic settings.
Read the full abstract
Dynamical Systems
Three elliptic closed characteristics on the non-degenerate compact convex hypersurfaces in R^6
Let $\Sigma\subset \mathbb{R}^{2n}$ with $n\geq2$ be any $C^2$ compact convex hypersurface. The stability of closed characteristics has attracted considerable attention in related research fields. A long-standing conjecture states that all closed characteristics are irrationally elliptic, provided $\Sigma$ possesses only finitely geometrically distinct closed characteristics. This conjecture has been fully resolved only in $\mathbb{R}^4$, while it remains completely open in higher dimensions. Even in $\mathbb{R}^6$, it is unknown whether there exist three elliptic closed characteristics. In this paper, we first prove that for any $\Sigma\subset \mathbb{R}^{2n}$ with finitely many closed characteristics, there exist at least two elliptic closed characteristics, which possess a nice symplectic normal form. In particular, as a simple corollary, they are irrational elliptic when $\Sigma$ is non-degenerate. Moreover, for any non-degenerate $\Sigma\subset\mathbb{R}^{6}$ with finitely many closed characteristics, we obtain at least three elliptic characteristics, of which at least two are irrationally elliptic. Based on the $n$-or-$\infty$ conjecture, three elliptic closed characteristics are optimal. This result provide theoretical support for further research on this conjecture.
Read the full abstract
Functional Analysis
Optimal upper and lower sequence spaces with applications
We study the optimal upper $X_U$ and lower $X_L$ sequence spaces that can be assigned to each Banach lattice $X$. These spaces are symmetric, have the Fatou property and the unit vector basis has in these spaces very special properties. Determined by the order structure of $X$ the spaces $X_U$ and $X_L$ turn out to be very useful when studying Banach lattices. Among other results, in terms of these constructions, we identify Banach lattices that satisfy equal-norm upper and lower $p$-estimates, give a characterization of $L_p(\mu)$-spaces, derive some properties of the tensor product operator in Lorentz and Orlicz spaces, identify Orlicz spaces in which the unit vector basis is upper (resp. lower) semi-homogeneous.
Read the full abstract
Optimization and Control
Weakly Time-Coupled Approximation of Markov Decision Processes
Finite-horizon Markov decision processes (MDPs) with high-dimensional exogenous uncertainty and endogenous states arise in operations and finance, including the valuation and exercise of Bermudan and real options, but face a scalability barrier as computational complexity grows with the horizon. A common approximation represents the value function using basis functions, but methods for fitting weights treat cross-stage optimization differently. Least squares Monte Carlo (LSM) fits weights via backward recursion and regression, avoiding joint optimization but accumulating error over the horizon. Approximate linear programming (ALP) and pathwise optimization (PO) jointly fit weights to produce upper bounds, but temporal coupling causes computational complexity to grow with the horizon. We show this coupling is an artifact of the approximation architecture, and develop a weakly time-coupled approximation (WTCA) where cross-stage dependence is independent of horizon. For any fixed basis function set, the WTCA upper bound is tighter than that of ALP and looser than that of PO, and converges to the optimal policy value as the basis family expands. We extend parallel deterministic block coordinate descent to the stochastic MDP setting exploiting weak temporal coupling. Applied to WTCA, weak coupling yields computational complexity independent of the horizon. Within equal time budget, solving WTCA accommodates more exogenous samples or basis functions than PO, yielding tighter bounds despite PO being tighter for fixed samples and basis functions. On Bermudan option and ethanol production instances, WTCA produces tighter upper bounds than PO and LSM in every instance tested, with near-optimal policies at longer horizons.
Read the full abstract
Information Theory · Cross-listed from stat.ML
Batched Kernelized Bandits: Refinements and Extensions
In this paper, we consider the problem of black-box optimization with noisy feedback revealed in batches, where the unknown function to optimize has a bounded norm in some Reproducing Kernel Hilbert Space (RKHS). We refer to this as the Batched Kernelized Bandits problem, and refine and extend existing results on regret bounds. For algorithmic upper bounds, (Li and Scarlett, 2022) shows that $B=O(\log\log T)$ batches suffice to attain near-optimal regret, where $T$ is the time horizon and $B$ is the number of batches. We further refine this by (i) finding the optimal number of batches including constant factors (to within $1+o(1)$), and (ii) removing a factor of $B$ in the regret bound. For algorithm-independent lower bounds, noticing that existing results only apply when the batch sizes are fixed in advance, we present novel lower bounds when the batch sizes are chosen adaptively, and show that adaptive batches have essentially same minimax regret scaling as fixed batches. Furthermore, we consider a robust setting where the goal is to choose points for which the function value remains high even after an adversarial perturbation. We present the robust-BPE algorithm, and show that a suitably-defined cumulative regret notion incurs the same bound as the non-robust setting, and derive a simple regret bound significantly below that of previous work.
Read the full abstract
Representation Theory
On Moy-Prasad quotients over Laurent series fields
Let $k$ be an algebraically closed field and $G$ a connected reductive group over $k((t))$ satisfying some conditions. We define a stratification by conjugacy classes of twisted Levi subgroups of $G$ on each Moy-Prasad quotient $\mathfrak{k}_{x,r}/\mathfrak{k}_{x,r+}$ of $G$. We then calculate the strata in terms of the associated twisted Levi subgroups. This calculation is necessary for several followup papers on the local geometric Langlands program.
Read the full abstract
Information Theory
Boosting Spectral Efficiency via Spatial Path Index Modulation in RIS-Aided mMIMO
Next generation wireless networks focus on improving spectral efficiency (SE) while reducing power consumption and hardware cost. Reconfigurable intelligent surfaces (RISs) offer a viable solution to meet these requirements. In order to enhance the SE, index modulation (IM) has been regarded as one of the enabling technologies via the transmission of additional information bits over the transmission media such as subcarriers, antennas and spatial paths. In this work, we explore the usage of spatial paths and introduce spatial path IM (SPIM) for RIS-aided massive multiple-input multiple-output (mMIMO) systems. Thus, the proposed framework improves the network efficiency and the coverage with the use of RIS while SPIM provides SE improvement. In order to perform SPIM, we exploit the spatial diversity of the millimeter wave channel and assign the index bits to the spatial patterns of the channel between the base station and the users through RIS. We introduce a low complexity approach for the design of hybrid beamformers, which are constructed by the steering vectors corresponding to the selected spatial path indices for SPIM-mMIMO. Furthermore, we conduct a theoretical analysis on the SE of the proposed SPIM approach, and derive the SE relationship between the SPIM-based hybrid beamforming and fully digital (FD) beamforming. Via numerical simulations, we validate our theoretical results and show that the proposed SPIM approach presents an improved SE performance, even higher than that of the use of FD beamformers while using a few RF chains.
Read the full abstract
Number Theory
Disproof of the uniform Littlewood conjecture
We show that the uniform Littlewood Conjecture (ULC) recently introduced by Bandi, Fregoli and Kleinbock is false. More precisely the counterexamples form a residual set, the method further suggests positive Hausdorff dimension. For a mildly twisted problem, we indeed separately show that the Hausdorff dimension is at least $1$. Moreover, we disprove a uniform version of the $p$-adic Littlewood problem, as well as some twisted weaker version of a more general $S$-arithmetic setting, for any proper subset (possible infinite) of primes $S$. The latter contrasts the classical (non-uniform) case where the answer is known to be affirmative when $S$ has at least two elements. The disproof of ULC, our main new result, is semi-constructive; the non-constructive part involves effective results on Zaremba's famous conjecture by Bourgain and Kontorovich, as well as estimates for the cardinality of product sets over finite fields.
Read the full abstract
Combinatorics
A step towards the Erdős-Rogers problem
For $2\le k\le t<s$, the Erdős-Rogers function $f^{(k)}_{t,s}(N)$ denotes the largest $m$ such that every $K^{(k)}_s$-free $k$-graph on $N$ vertices contains a $K^{(k)}_t$-free induced subgraph on $m$ vertices. Mubayi and Suk (J. London Math. Soc. 2018) conjectured that $f^{(k)}_{k+1,k+2}(N)=(\log_{(k-2)}N)^{\Theta(1)}$ for $k\ge 4$, where $\log_{(i)}$ denotes the $i$-fold iterated logarithm. This is equivalent to the statement that $f^{(k)}_{k+1,s}(N)=(\log_{(k-2)}N)^{\Theta(1)}$ for every $s\ge k+2$. In this paper, we introduce multi-color patterns into a random construction of a $2$-graph to build a $4$-graph, and for the first time, combine them with multi-layer extremum structures to prove that $f^{(4)}_{5,s}(N)=(\log \log N)^{\Theta(1)}$ for every $s\ge 11$. More generally, using a variant of the Erdős-Hajnal stepping-up lemma, we also establish that $f^{(k)}_{k+1,s}(N)=(\log_{(k-2)}N)^{\Theta(1)}$ for every $s\ge k+7$.
Read the full abstract
Information Theory
A Partial-Exclusion Repair Scheme for MDS Codes
For scalar maximum distance separable (MDS) codes, the conventional repair schemes that achieve the cut-set bound with equality for the single-node repair have been proven to require a super-exponential sub-packetization level.As is well known, such an extremely high level severely limits the practical deployment of MDS codes.To address this challenge, we introduce a partial-exclusion (PE) repair scheme for scalar linear codes.In the proposed PE repair framework, each node is associated with an exclusion set.The cardinality of the exclusion set is called the flexibility of the node.The maximum value of flexibility over all nodes defines the flexibility of the PE repair scheme. Notably, the conventional repair scheme is the special case of PE repair scheme where the flexibility is 1. Under the PE repair framework, for any valid flexibility, we establish a lower bound on the sub-packetization level of MDS codes that meet the cut-set bound with equality for single-node repair. To realize MDS codes attaining the cut-set bound under the PE repair framework, we propose two generic constructions of Reed-Solomon (RS) codes. Moreover, we demonstrate that for a sufficiently large flexibility, the sub-packetization level of our constructions is strictly lower than the known lower bound established for the conventional repair schemes.This implies that, from the perspective of sub-packetization level, our constructions outperform all existing and potential constructions designed for conventional repair schemes. Finally, we implement the repair process for these codes as executable Magma programs, thereby exhibiting the practical efficiency of our constructions.
Read the full abstract
Optimization and Control · Cross-listed from cs.RO
Skill-informed Data-driven Haptic Nudges for High-dimensional Human Motor Learning
In this work, we propose a data-driven framework to design optimal haptic nudge feedback leveraging the learner's estimated skill to address the challenge of learning a novel motor task in a high-dimensional, redundant motor space. A nudge is a series of vibrotactile feedback delivered to the learner to encourage motor movements that aid in task completion. We first model the stochastic dynamics of human motor learning under haptic nudges using an Input-Output Hidden Markov Model (IOHMM), which explicitly decouples latent skill evolution from observable performance measures. Leveraging this predictive model, we formulate the haptic nudge feedback design problem as a Partially Observable Markov Decision Process (POMDP). This allows us to derive an optimal nudging policy that minimizes long-term performance cost and implicitly guides the learner toward superior skill states. We validate our approach through a human participant study (N=30) involving a high-dimensional motor task rendered through a hand exoskeleton. Results demonstrate that participants trained with the POMDP-derived policy exhibit significantly accelerated movement efficiency and endpoint accuracy compared to groups receiving heuristic-based feedback or no feedback. Furthermore, synergy analysis reveals that the POMDP group discovers efficient low-dimensional motor representations more rapidly.
Read the full abstract
Algebraic Geometry
Real line subbundles of real bundles on curves
For a stable real bundle $E$ of rank $2$ and degree $1$ on a real genus $2$ curve, we describe the action of the real structure of the curve on the set of $4$ maximal line subbundles of degree $0$ of $E$. This describes the Galois action on the set of lines through a real point in the moduli space of such bundles, and is a real algebraic extension of classical work of Newstead. Our proof is an application of techniques of Atiyah from the 1950's. We prove also results on real line subbundles in higher genus using work of Lange-Narasimhan.
Read the full abstract
Numerical Analysis · Cross-listed from cs.LG
Scaling Laws and Pathologies of Single-Layer PINNs: Network Width and PDE Nonlinearity
We establish empirical scaling laws for Single-Layer Physics-Informed Neural Networks on canonical nonlinear PDEs. We identify a dual optimization failure: (i) a baseline pathology, where the solution error fails to decrease with network width, even at fixed nonlinearity, falling short of theoretical approximation bounds, and (ii) a compounding pathology, where this failure is exacerbated by nonlinearity. We provide quantitative evidence that a simple separable power law is insufficient, and that the scaling behavior is governed by a more complex, non-separable relationship. This failure is consistent with the concept of spectral bias, where networks struggle to learn the high-frequency solution components that intensify with nonlinearity. We show that optimization, not approximation capacity, is the primary bottleneck, and propose a methodology to empirically measure these complex scaling effects.
Read the full abstract
Analysis of PDEs
Nontrivial weak solutions of the stationary KdV equation in sharp $L^p$ spaces
In this paper we utilize a convex integration scheme to construct non-trivial solutions to the stationary KdV equation which lie in $L^p(\mathbb{T})$, $p < 2$. In addition, we demonstrate this result is sharp in the sense that if $u \in L^2(\mathbb{T})$ is a weak solution then $u \in C^\infty(\mathbb{T})$.
Read the full abstract
Optimization and Control · Cross-listed from cs.LG
Asymptotic and Finite-Time Guarantees for Langevin-Based Temperature Annealing in InfoNCE
The InfoNCE loss in contrastive learning depends critically on a temperature parameter, yet its dynamics under fixed versus annealed schedules remain poorly understood. We provide a theoretical analysis by modeling embedding evolution under Langevin dynamics on a compact Riemannian manifold. Under mild smoothness and energy-barrier assumptions, we show that classical simulated annealing guarantees extend to this setting: slow logarithmic inverse-temperature schedules ensure convergence in probability to a set of globally optimal representations, while faster schedules risk becoming trapped in suboptimal minima. Our results establish a link between contrastive learning and simulated annealing, providing a principled basis for understanding and tuning temperature schedules.
Read the full abstract
Mathematical Physics · Cross-listed from physics.comp-ph
Reduced-Order Variational Deterministic-Particle-Based Scheme for Fokker-Planck Equations in Microscopic Polymer Dynamics
This study proposes an acceleration technique for the computational challenges in extending the variational deterministic-particle-based scheme (VDS) [Bao et al., Journal of Computational Physics 522 (2025) 113589] to 3D complex fluid simulations with multi-bead polymers. While the original VDS effectively captures configuration space dynamics for 2D dumbbell polymers, its direct extensions reveal critical scalability limitations. The growing configuration space dimensionality necessitates prohibitively large particle ensembles to maintain distributional accuracy, so its quadratic computational cost scaling impedes practical applications. In this paper, we develop a model reduction framework integrating proper orthogonal decomposition (POD) to speed up the computation of the VDS for microscopic Fokker-Planck equations. Numerical validation using bead-spring chain models in simple shear flow demonstrates that the computational efficiency of the reduced model increases systematically with molecular complexity. The reduced-order model introduces about $6\%$ relative error in predicting the dynamics while requiring only about $6\%$ of the original computational time for $4$-bead chain polymers, where the relative numerical error of the reference dynamics is about $5\% \sim 10\%$, and the degrees of freedom can be reduced significantly to about $0.1\%$ of the original model, which means the low-dimensional structure is found by POD. This establishes a practical pathway for multiscale and complex fluid simulations.
Read the full abstract
Differential Geometry
Warped area-minimizing hypersurface and warped product metric
Let $(M^n,g)$ be a smooth, compact, connected and oriented Riemannian manifold with $3\le n\le 7$ and $H_{n-1}(M;\mathbb{Z})\neq 0$, and let $u>0$ be smooth on $M$. Suppose that \[ -\gamma u^{-1}\Delta_g u+\Ricmin_g\ \geq\ (n-1)(n-3)\,u^{-2}|\nabla u|^2, \qquad \gamma=n-1, \] where $\Ricmin_g$ is the pointwise least Ricci curvature. Since both this hypothesis and the class of warped (weighted) area-minimizers are invariant under $u\mapsto\lambda u$, we normalize $u\equiv1$ on the minimizer. We prove that some non-trivial class in $H_{n-1}(M;\mathbb{Z})$ contains a warped area-minimizing hypersurface $\Sigma$ on which $u$ is constant, and that $M$ locally splits as a warped product $(-\epsilon,\epsilon)\times_f\Sigma$, $g=dt^2+f^2(t)g_\Sigma$, with $f=u^{-1}$ and $\operatorname{Ric}_{g_\Sigma}\geq (n-2)[(f')^2-ff'']\,g_\Sigma$. By extending the foliation via Federer–Fleming compactness of the constant-warped-area leaves, this local splitting upgrades to a global one: $M$ is covered by $\mathbb{R}\times_f\Sigma$, its universal cover is $\mathbb{R}\times_f\tilde\Sigma$ where $\tilde\Sigma$ is the universal cover of $\Sigma$, and $f=u^{-1}$ is periodic and bounded above and below, so $M$ fibres over $\mathbb{S}^1$ with fibre a quotient of $\Sigma$. This spectral bound is saturated with equality by warped product metrics, which is what makes it the natural threshold for warped rather than direct product rigidity. When $u\equiv1$ it reduces to $\Ricmin_g\geq0$ and our conclusion to the classical product splitting.