Peer Revenue Returns subject to peer review

Papers

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

Mathematics

math Watch Mathematics (sign in to use)

Friday 20 March

Statistics Theory

Uncertainty Quantification Via the Posterior Predictive Variance

We use the law of total variance to generate multiple expansions for the posterior predictive variance. These expansions are sums of terms involving conditional expectations and conditional variances and provide a quantification of the sources of predictive uncertainty. Since the posterior predictive variance is fixed given the model, it represents a constant quantity that is conserved over these expansions. The terms in the expansions can be assessed in absolute or relative sense to understand the main contributors to the length of prediction intervals. We quantify the term-wise uncertainty across expansions varying in the number of terms and the order of conditionates. In particular, given that a specific term in one expansion is small or zero, we identify the other terms in other expansions that must also be small or zero. We illustrate this approach to predictive model assessment in several well-known models.
Read the full abstract

Probability

The logarithmic law of sample correlation matrices

Let $\mathbf{R}$ be the sample correlation matrix constructed from $\mathbf{X}\in \mathbb{R}^{p\times n}$, whose entries are independent and identically distributed random variables with mean zero and tail probability condition $\lim_{x\rightarrow \infty}x^3\mathbb{P}(|\xi|>x)=0$. We derive the universal logarithmic law for $\log \det \mathbf{R}$, \begin{equation*} \frac{\log \det \mathbf{R}-(p-n+1/2)\log (1-\frac{p-1}{n})+p-\frac{p}{n}}{\sqrt{-2\log (1-\frac{p-1}{n})-2\frac{p}{n}}}\stackrel{d}{\rightarrow} {N}(0,1), \end{equation*} if $p\le n$ as $p,n\rightarrow \infty$. Moreover, under the near-singularity case $0\le n-p\le n^{1-w}$ for any $w\in (0,1)$, it is shown that the tail probability condition can be weakened to $\lim_{x\rightarrow \infty}x^3(\log x)^{-1/4+\mathfrak{c}}\mathbb{P}(|\xi|>x)<\infty$ for any constant $0<\mathfrak{c}<1/4$.
Read the full abstract

All authors Yanpeng Li, Zhi Liu, Jiahui Xie, Wang Zhou

Logic

Distal Expansions of the Integers and the $p$-adic Fields

This paper investigates expansions of distal structures by a unary subset that arises as the image of a projection map. We first provide a sufficient condition for such an expansion to remain distal. Based on this criterion, we establish the distality of three kinds of expansions involving the integers or the $p$-adic fields. Let $R$ be an almost sparse sequence. We prove that $(\mathbb{Z};<,+,R)$ is distal, thereby answering a question posed by Tong. Furthermore, we show the distality of $(\mathbb{Q}_p;+,\cdot,p^{\mathbb{Z}})$ and $(\mathbb{Q}_p;+,\cdot,p^{\mathbb{Z}},p^R)$.The latter provides an example of a NIP expansion of the $p$-adic field without the rationality of the Poincaré series.
Read the full abstract

Differential Geometry

Harmonic Enneper Immersion in $\mathbb{R}^3$

We present a method for constructing harmonic immersions in $\mathbb{R}^3$, known as the Enneper-type representation. We also prove that any harmonic immersion in $\mathbb{R}^3$ can be obtained using this approach. Furthermore, we determine the number of non-planar rotational harmonic immersions in $\mathbb{R}^3$ that connect two coaxial circles in parallel planes, where both circles have the same radius $r > 0$ and are separated by a distance $l > 0$.
Read the full abstract

Statistics Theory · Cross-listed from cs.CE

Uniform Maximum Projection Designs for Computer Experiments

Space-filling experimental designs are widely used in engineering computer experiments, where only a limited number of expensive model evaluations can be afforded. Distance-based designs such as Maximin or Minimax ensure global space-filling, while Latin hypercube sampling enforces uniform one-dimensional projections, yet neither guarantees uniformity in lowdimensional subspaces. Maximum Projection (MaxPro) designs were introduced to improve uniformity in low-dimensional subspaces, yet their original formulation relies on the Euclidean distance and may induce systematic density distortions in bounded domains. We demonstrate that the standard MaxPro criterion leads to statistically non-uniform sampling, resulting in undersampling of corner regions and biased Monte Carlo estimates. To remedy this issue, we introduce a periodic variant of the criterion, termed Uniform Maximum Projection (uMaxPro), in which the Euclidean metric is replaced by a periodic distance based on the minimum image convention. The proposed uMaxPro designs preserve the projection-aware structure of MaxPro while achieving statistical uniformity of the design-generation mechanism. Numerical experiments show unbiased Monte Carlo integration with reduced variance, excellent subspace projection performance, and competitive discrepancy properties. The methodology is further validated on benchmark engineering problems, including a meso-scale finite element model of concrete, demonstrating improved accuracy in surrogate modeling and probabilistic estimation. The resulting criterion provides a simple and computationally efficient modification of MaxPro that enhances its robustness for nonadaptive computer experiments. The construction algorithm, open-source implementation, and reproducible optimized designs are provided to facilitate practical adoption of the method.
Read the full abstract

Probability

Topological trapping in circular midpoint opinion dynamics

We study a discrete-time asynchronous midpoint dynamics on the circle in which, at each step, a uniformly chosen neighboring pair moves to the midpoint along the shortest arc. Although the update rule is locally contractive, we show that the global relaxation mechanism depends sharply on the boundary topology. Under open boundary conditions the system converges almost surely to consensus through pure contraction. Under periodic boundary conditions the graph contains a single cycle, and the wrapped edge increments define an integer-valued winding number. While consensus remains the unique absorbing state for every fixed system size, we show that topology profoundly reshapes the transient dynamics. We prove that branch-crossings are the only mechanism capable of modifying the winding number and compute explicitly their probability for disordered initial data. Local averaging rapidly suppresses large gradients and drives the system into a no-branch-crossing regime where the winding number freezes. Inside a fixed winding sector we construct an adaptive co-moving frame in which the dynamics becomes an exact Euclidean midpoint process and establish strict contraction toward a twisted linear profile determined by the winding number. Our results isolate a minimal mechanism by which a single cycle induces sector locking and escape, even though the final equilibrium remains unchanged.
Read the full abstract

Dynamical Systems

The equivalence of precompactness, zero maximal pattern entropy and bounded mean complexity for finite partitions

In this paper, we investigate several types of low complexity of finite partitions, including precompactness, zero maximal pattern entropy, bounded mean complexity and mean equicontinuity. We first show that a collection of finite partitions in a standard probability space is precompact in the Rokhlin metric if and only if it has zero maximal pattern entropy if and only if the collection of the characteristic functions of atoms in those partitions is precompact in $L^2$ if and only if it has bounded mean complexity with respect to the Hamming distance. Next, we show that for a countably infinite discrete amenable group acting on a standard probability space, a finite partition has zero maximal pattern entropy if and only if each characteristic function of an atom in the partition is almost periodic if and only if it has bounded mean complexity with respect to some (and hence any) Følner sequence if and only if it is mean equicontinuous with respect to some (and hence any) tempered Følner sequence.
Read the full abstract

Number Theory

Irreducibility and Monodromy of Automorphic Galois Representations of $\mathrm{GL}(4)$

We prove that over totally real fields, the $p$-adic Galois representations attached to non-self-dual regular algebraic cuspidal automorphic representations of $\mathrm{GL}(4)$ are irreducible. We then develop the theory of extra-twists in a general setting and use it to compute the monodromy group (over $\mathbb{Q}$) of these Galois representations, in both self-dual and non-self-dual settings, and prove $p$-adic and residual big image results.
Read the full abstract

Analysis of PDEs

Curved fronts of combustion reaction-diffusion equations

This paper is concerned with curved fronts of combustion reaction-diffusion equations in $\mathbb{R}^N$ $(N\geq2)$. By mixing finite planar fronts and constructing suitable super- and subsolutions, we prove the existence, uniqueness and stability of polytope-like curved fronts in $\mathbb{R}^N$. Besides, we show that these curved fronts are transition fronts.
Read the full abstract

Optimization and Control

Multimodal branched transport infers anatomically aligned brain reaction maps

How external stimulation is transformed into distributed reaction patterns remains unresolved at the level of propagation architecture. Existing large-scale control models quantify transition costs on prescribed networks but do not infer the routing map itself from source and target activity. Here we combine task-related blood-oxygen-level-dependent responses, source-reconstructed electrophysiology and tractography-derived anisotropy to estimate stimulation and reaction measures, define an anatomical transport cost, and infer a branched propagation architecture by variational optimisation. Unlike standard transport formulations, branched transport favours aggregation of signal into shared neural highways before redistribution. We further attach a stochastic graph-induced dynamics to the inferred map and quantify the trade-off between geometric efficiency and dynamical controllability. We show that multimodal data generate anatomically aligned brain reaction maps, that anisotropic costs qualitatively reshape routing backbones relative to isotropic baselines, and that hybrid geometric–dynamical optimisation reveals non-trivial rank reversals across branching regimes.
Read the full abstract

Numerical Analysis

Eigenvalue stability and new perturbation bounds for the extremal eigenvalues of a matrix

Let $A$ be a full ranked $ n\times n$ matrix, with singular values $\sigma_1 (A) \ge \dots \ge \sigma_n (A) >0$. The condition number $\kappa(A):= \sigma_1(A)/\sigma_n(A)=\|A\|\cdot \|A\|^{-1}$ is a key parameter in the analysis of algorithms taking $A$ as input. In practice, matrices (representing real data) are often perturbed by noise. Technically speaking, the real input would be a noisy variant $\tilde A =A +E$ of $A$, where $E$ represents the noise. The condition number $\kappa (\tilde A)$ will be used instead of $\kappa (A)$. Thus, it is of importance to measure the impact of noise on the condition number. In this paper, we focus on the case when the noise is random. We introduce the notion of regional stability, via which we design a new framework to estimate the perturbation of the extremal singular values and the condition number of a matrix. Our framework allows us to bound the perturbation of singular values through the perturbation of singular spaces. We then bound the latter using a novel contour analysis argument, which, as a co-product, provides an improved version of the classical Davis-Kahan theorem in many settings. Our new estimates concerning the least singular value $\sigma_n(A)$ complement well-known results in this area, and are more favorable in the case when the ground matrix $A$ is large compared to the noise matrix $E$.
Read the full abstract

Analysis of PDEs

Regularity of Solutions to Beckmann's Parametric Optimal Transport

Beckmann's problem in optimal transport minimizes the total squared flux in a continuous transport problem from a source to a target distribution. In this article, the regularity theory for solutions to Beckmann's problem in optimal transport is developed utilizing an unconstrained Lagrangian formulation and solving the variational first order optimality conditions. It turns out that the Lagrangian multiplier that enforces Beckmann's divergence constraint fulfills a Poisson equation and the flux vector field is obtained as the potential's gradient. Utilizing Schauder estimates from elliptic regularity theory, the exact Hölder regularity of the potential, the flux and the flow generating is derived on the basis of Hölder regularity of source and target densities on a bounded, regular domain. If the target distribution depends on parameters, as is the case in conditional (“promptable”) generative learning, we provide sufficient conditions for separate and joint Hölder continuity of the resulting vector field in the parameter and the data dimension. Following a recent result by Belomnestny et al., one can thus approximate such vector fields with deep ReQu neural networks in C^(k,alpha)-Hölder norm. We also show that this approach generalizes to other probability paths, like Fisher-Rao gradient flows.
Read the full abstract

Optimization and Control

The incomplete Traveling Tournament Problem

We present a new problem called the incomplete Traveling Tournament problem, which introduces the well known Traveling Tournament Problem into the realm of incomplete round-robin tournaments. We focus on the case where teams can face each opponent at most once. We give a formal description of this problem and show that it is NP-hard. We first discuss how we can obtain lower bounds and how to strengthen them. Then, we propose two integer programming formulations and compare their LP-relaxations. We also propose a third formulation that assumes that home-away patterns of teams are fixed. We discuss how a recently proposed metaheuristic for incomplete round-robin scheduling can be tailored to our problem. In doing so, we present a novel neighborhood structure and show it fully connects the home-away pattern solution space. Finally, problem instances are proposed, for which we derive lower and upper bounds. We show that these instances are challenging, making the development of efficient algorithms for the incomplete Traveling Tournament problem an interesting direction for future research.
Read the full abstract

Optimization and Control

Branched Optimal Transport for Stimulus to Reaction Brain Mapping

A central problem in systems neuroscience is to determine how an external stimulation is propagated through the brain so as to produce a reaction. Current deterministic and stochastic control models quantify transition costs between brain states on a prescribed network, but do not treat the transport network itself as an unknown. Here we propose a variational framework in which the inferred object is a graph/current connecting a stimulation source measure to a reaction target measure. The model is posed as an anisotropic branched optimal transport problem, where concavity of the flux cost promotes aggregation and branching. The support of an optimal current defines a stimulus-to-reaction routing architecture, interpreted as a brain reaction map. We prove existence of minimizers in discrete and continuous formulations and introduce a hybrid stochastic extension combining ramified transport with a path-space Kullback–Leibler control cost on the induced graph dynamics. This approach provides a mathematical mechanism for inferring propagation architectures rather than controlling trajectories on fixed substrates.
Read the full abstract

Rings and Algebras

Reynolds Leibniz bialgebras of any weight

This paper studies bialgebraic structures associated with a Reynolds Leibniz algebra of weight $\lambda$, that is, a Leibniz algebra equipped with a Reynolds operator of weight $\lambda$. We first present equivalent characterizations of Reynolds Leibniz bialgebras of weight $\lambda$, using matched pairs and Manin triples. Next, we examine compatibility conditions between solutions of the classical Leibniz Yang-Baxter equation and Reynolds operators of weight $\lambda$, framed in terms of triangular Reynolds Leibniz bialgebras. Finally, building on results of Ayupov et al., we classify two-dimensional triangular Reynolds Leibniz bialgebras of weight $\lambda$.
Read the full abstract

Analysis of PDEs

Minimum principles and a priori estimates for 2-Hessian problems

In this paper we investigate a class of $2$-Hessian equations and establish a minimum principle for a $P$-function in the sense of L.E. Payne (see R. Sperb \cite{Sp81}). The analysis is based on a sharp matrix inequality providing an estimate for a suitable combination of second-order partial derivatives of the solution. Exploiting this estimate, we derive a differential inequality for the associated $P$-function and obtain a minimum principle in higher dimensions under a convexity assumption. As an application of our results, together with convexity results established in X.-N. Ma and L. Xu \cite{MX08}, P. Liu, X.-N. Ma and L. Xu \cite{LMX10}, P. Salani \cite{Sa12}, and Y. Ye \cite{Ye13}, we derive a priori bounds for solutions of several classical $2$-Hessian boundary value problems.
Read the full abstract

Optimization and Control

Games with Incomplete Information Played by Risk-Revising Players

This paper introduces risk-revising players to a class of games with incomplete information. These players enter the game with ex ante risk preferences represented by coherent risk measures and develop time-consistent interim revisions of them contingent on their private information. The standard Nash equilibrium at ex ante stage and Bayesian Nash equilibrium at interim stage are extended to their risk-averse counterparts. Risk-revising Bayesian Nash equilibrium is proposed to capture behavioral outcomes resulting from interim plays based on revised risk preferences. We discuss existence results of these equilibrium concepts. When players' risk revisions correspond to their ex ante equilibrium play, connections are established between equilibria at the ex ante and interim stages. The effect of risk-aversion is analyzed using comparative statics. With the help of the dual representation of risk measures, we illustrate the role of risk-aversion in representing inconsistent beliefs. A numerical example is presented to illustrate the proposed equilibrium concepts under a specific choice of risk preference.
Read the full abstract

Numerical Analysis · Cross-listed from cs.CE

Surrogate Modeling with Low-Rank Function Representation for Electromagnetic Simulation

High-fidelity electromagnetic (EM) simulations are indispensable for the design of microwave and wave devices, yet repeated full-wave evaluations over high-dimensional design spaces are often computationally prohibitive. While neural surrogates can amortize this cost, learning high-dimensional EM response mappings remains difficult under limited simulation budgets due to strong and heterogeneous parameter couplings. In this work, we introduce low-rank tensor function representations as a principled surrogate modeling paradigm for EM problems and provide a systematic study of representative low-rank formats, including Tucker-style low-rank tensor function representation (LRTFR) as well as neural functional tensor-train (TT) and tensor-ring (TR) baselines. Building on these insights, we propose a pairwise low-rank tensor network (PLRNet) that uses learnable pairwise interaction factors over compact coordinate-wise embeddings. Experiments on representative EM surrogate tasks demonstrate that the proposed framework achieves a more favorable overall trade-off between accuracy, robustness, and parameter efficiency, with stable optimization in high-dimensional regimes.
Read the full abstract

All authors Mingze Sun, Liang Li, Xile Zhao, Zheng Tan, Yulu Hu, Xing Li, Bin Li

Probability

Indistinguishability in One-or-Two-Ended Forests on Unimodular Random Graphs

Indistinguishability is a form of ergodicity, introduced by Lyons and Schramm for percolation clusters, that has become a fundamental notion in the theory of random infinite graphs. We prove the indistinguishability of connected components for a broad family of random one-ended or two-ended oriented forests on unimodular graphs using a new approach. We unify these models by introducing `coalescing Markov trajectories' (CMTs), which encompass a wide range of classical coalescing models, including river models and coalescing random walks. We also establish the indistinguishability of level-sets, a problem that has not previously been studied and lies beyond the scope of existing techniques. Using the latter, we prove that the clusters of the stationary voter model on a unimodular graph are indistinguishable. The core of the proof approach is the reduction of the indistinguishability of the components (respectively, level-sets) to the ergodicity (respectively, tail triviality) of the ancestry chain of the root. This shows a structural property that the ancestry chain is the fundamental object governing indistinguishability. For CMTs, the proof is completed by proving the tail triviality of Markov chains on unimodular random graphs, which is of independent interest. The flexibility of the approach is illustrated by further applications: It yields indistinguishability results for some point-map models on Bernoulli and Poisson point processes, including Howard's model and the strip point-map. It also yields a new and substantially simpler proof of indistinguishability for the wired uniform spanning forest, which is the only one-ended model for which indistinguishability was previously studied in the literature.
Read the full abstract

Information Theory

On the Fundamental Limits of Hierarchical Secure Aggregation with Dropout and Collusion Resilience

We study the fundamental communication limits of information-theoretic secure aggregation in a hierarchical network consisting of a server, multiple relays, and multiple users per relay. Communication proceeds over two rounds and two hops, and the system is subject to arbitrary user and relay dropouts. Up to $T$ users may collude with either the server or any single relay. The server aims to recover the sum of the inputs of all users that survive the first round, while learning no additional information beyond the aggregate sum and the inputs of the colluding users. Each relay, however, must learn nothing about the users' inputs except for the information revealed by the inputs of the colluding users under the same collusion model. We introduce a four-dimensional rate tuple that captures the communication cost across rounds and hops. Under a delayed message availability model, we establish necessary and sufficient conditions for feasibility and fully characterize the optimal first-round communication rates. For the second round, we characterize the optimal user-to-relay rate and derive lower and upper bounds on the relay-to-server rate. While these bounds do not coincide in general, they are tight in certain regimes of interest. Our results reveal a sharp threshold phenomenon: secure aggregation is feasible if and only if the total number of surviving users across surviving relays exceeds the collusion threshold. Achievability is established via a vector linear coding scheme with carefully structured correlated randomness exhibiting MDS-like properties, ensuring correctness and information-theoretic security under all possible dropout patterns. Entropic converse bounds are also derived.
Read the full abstract

All authors Zhou Li, Yizhou Zhao, Xiang Zhang, Giuseppe Caire

Analysis of PDEs

Couette Taylor instabilities for counter-rotating cylinders in the small-gap regime

We study the Couette Taylor instabilities for an incompressible viscous fluid between two coaxial cylinders of nearly equal radii, allowing counter-rotation with the ratio of rotation rate $\mu \in [-1,1]$. Working in a rotating frame and in a small-gap and small-viscosity regime, we derive the corresponding limiting Navier Stokes system and analyze the linear stability of the Couette flow. In particular, we numerically compute the critical Taylor number for general perturbations and identify a transition near $\mu_c \approx -0.8$: for $\mu > \mu_c$ the most unstable mode is axisymmetric, whereas for $\mu < \mu_c$ the most unstable mode is non-axisymmetric. Near criticality, slowly varying traveling waves are governed by a time-independent Ginzburg Landau equation. The nonlinear coefficient changes sign near $\hat{\mu}_c \approx -0.65$, yielding a supercritical regime for $\mu > \hat{\mu}_c$ and a subcritical regime for $\mu_c < \mu < \hat{\mu}_c$. In the subcritical range, we classify small-amplitude steady states, including Taylor vortex flows, wavy vortices, a two-parameter family of quasi-periodic flows, and a localized traveling perturbation of the Couette flow.
Read the full abstract

All authors Dongfen Bian, Emmanuel Grenier, Gérard Iooss, Zhuolun Yang

Statistics Theory

Minimax and Adaptive Covariance Matrix Estimation under Differential Privacy

Estimating covariance matrices is fundamental to a wide range of statistical applications. This paper studies minimax and adaptive estimation of high-dimensional covariance matrices under $\rho$-zero-concentrated differential privacy ($\rho$-zCDP) over three nested classes: the pointwise-decay class $\mathcal{H}_\alpha$, the row-tail class $\mathcal{G}_\alpha$, and the separated-block class $\mathcal{F}_\alpha$. We consider both squared operator norm loss and normalized squared Frobenius norm loss. For $\mathcal{H}_\alpha$ and $\mathcal{G}_\alpha$, we develop center–outer dyadic estimators tailored to the refined geometry of the two classes, while for $\mathcal{F}_\alpha$, we develop a blockwise tridiagonal estimator. The resulting minimax-optimal rates reveal a nontrivial interplay among the smoothness $\alpha$, the loss, the geometry of the covariance class, and the privacy constraint. In contrast to the non-private setting, privacy distinguishes covariance classes that share the same leading non-private rate and induces a polynomial dependence on the ambient dimension. We further develop procedures that adapt to the unknown decay parameter over all three covariance classes under both losses, at the cost of at most polylogarithmic factors. To establish minimax lower bounds, we develop a novel differentially private van Trees inequality that connects Fisher information with the $\rho$-zCDP constraint and may be useful for other private estimation problems. We also construct carefully designed prior distributions to obtain matching minimax lower bounds.
Read the full abstract

Numerical Analysis

Enhancing Future Prediction of Linear and Nonlinear Reduced-Order Models for Transport-Dominated Problems Using Lagrangian Data

Designing effective reduced-order models (ROMs) for parametrized transport-dominated problems remains challenging because of the well-known Kolmogorov barrier. Autoencoder-based nonlinear ROMs have been developed to improve the compression ability for such systems. However, despite their stronger compression ability, autoencoder-based ROMs constructed in the Eulerian frame may fail to accurately predict future solutions, due to the poor coherence between historical and future solutions in the Eulerian frame. In contrast, we show that representing transport-dominated dynamics in the Lagrangian frame can lead to a significantly faster decay of the Kolmogorov n-width and improve coherence between historical and future solutions. Building on these insights, we develop two non-intrusive ROMs leveraging Lagrangian data: a Lagrangian autoencoder-based ROM and a Lagrangian parametric dynamic mode decomposition. Numerical experiments demonstrate that these Lagrangian ROMs achieve more accurate and stable future predictions than their Eulerian counterparts.
Read the full abstract

Analysis of PDEs

Large-Amplitude Steady Solitary Water Waves with General Vorticity

We study two-dimensional steady solitary gravity water waves with general vorticity, allowing for overhanging free-surface profiles. The main challenges arise from the free boundary, the unbounded fluid domain, and the inherent complexity of the general vorticity setting. To address these, we introduce a conformal reformulation that reduces the problem to an equivalent system on a fixed strip, consisting of an overdetermined elliptic problem coupled with an elliptic boundary-value problem. This framework enables a local analysis without imposing restrictive assumptions on the vorticity. Using the center-manifold construction of Chen, Walsh and Wheeler \cite{chennonlinearity}, we first establish the existence of small-amplitude solitary waves for such non-trivial vorticity distributions. Subsequently, via a global analytic bifurcation argument, we prove the existence of continuous branches of large-amplitude solitary waves for analytic vorticity functions. Along these global solution curves, the free surfaces may develop overhanging profiles and need not remain graphs over the horizontal coordinate. Our results provide a new constructive framework for large-amplitude solitary waves with general vorticity, extending the existing theory beyond the classical settings of constant vorticity \cite{susannaarma} and non-overhanging profiles \cite{milesjma}.
Read the full abstract

Analysis of PDEs

Double phase quasiconvex functionals and their partial regularity theory

We consider degenerate nonautonomous energies $$ \int_\Omega f(x, Dv)\, dx, $$ for vector-valued functions $v \in W^{1,1}(\Omega, \mathbb{R}^N)$, where the integrand $f(x,P)$ satisfies growth and weak uniform quasiconvexity assumption associated with the double phase function $H(x,t)=t^p + a(x)t^q$. We establish partial Hölder regularity for the gradients of minimizers under suitable, and possibly minimal, regularity assumptions on $H$ and $f$. Our approach relies on two approximation results: $\mathcal{A}$-harmonic approximation and a variational version of the $\phi$-harmonic approximation.
Read the full abstract

Commutative Algebra

On $w$-Hilbert domains

In this paper, we introduce the notion of a $w$-Hilbert domain and investigate its basic properties. More precisely, we explore its relationship with Hilbert domains, strong Mori domains, and UMT domains by providing various examples using $D+M$ constructions. Furthermore, we characterize the polynomial rings and some of their extensions that are $w$-Hilbert domains.
Read the full abstract

Number Theory

Asymptotic Formula for $(t+1)$-Regular Partitions

A partition is $t$-regular if none of its parts is divisible by $t$. Let $p(N,t)$ be the number of $(t+1)$-regular partitions of a positive integer $N$. In 1971, Hagis proved an asymptotic formula for $p(N,t)$ using the circle method, when $t$ fixed. In this article, we use the saddle point method and extend the result of Hagis in different ranges of $t$, obtaining explicit bounds. We also discuss an application of our result to estimate zeros in the character table of the symmetric group.
Read the full abstract

Number Theory

Torsion Packet Envelope and Rational Points of Algebraic Curves

In this paper, we give an elementary new method for determining the rational points on algebraic curves using torsion packets. We also provide examples of curves for which all rational points can be completely determined by our method.

Analysis of PDEs

Self-similar Dynamics in the Critical $p$-Laplacian Patlak-Keller-Segel Model: Shrinking Blow-up and Expanding Propagation

In this paper, we study the following Patlak-Keller-Segel model with $p$-Laplacian diffusion \begin{align*} \left\{ \begin{aligned} &\rho _t=\nabla \cdot \left( \left| \nabla \rho \right|^{p-2}\nabla \rho \right) -\chi \nabla \cdot \left( \rho \nabla c \right), &0=\varDelta c+\rho ^m, \end{aligned}\right. \end{align*} and the exponent $m>0$ is chosen as $$ m = \frac{(p-2)N + p}{N}. $$ This relation ensures the scale invariance of the system and is conjectured to be the critical exponent that separates global boundedness from finite-time blow-up. We prove that, at the critical threshold $m=\frac{(p-2)N + p}{N}$, the system indeed admits finite-time blow-up solutions. More precisely, in the slow diffusion regime $p>2$, there exist backward self-similar blow-up solutions that are radially decreasing, compactly supported, and concentrate into a Dirac $\delta$-measure at the blow-up time $T$; and their supports shrink toward the origin at the rate $(T-t)^{\frac1{mN}}$. For the fast diffusion case $1<p\le 2$, we show that there are no backward self-similar blow-up solutions with finite-mass. Additionally, we also explore forward self-similar solutions in both the slow diffusion and fast diffusion cases. These solutions also carry finite mass and exhibit a Dirac $\delta$-singularity at the initial moment. Specifically, in the slow diffusion case, the support expands at the rate $t^{\frac1{mN}}$, whereas in the fast diffusion case, the solution becomes strictly positive for all positive times. Our work provides the first blow up analysis for the $p$-Laplacian Keller-Segel system when $p\ne 2$, and it confirms that the exponent $m$ given above is indeed the sharp threshold between global existence and finite time singularity formation.
Read the full abstract

Combinatorics

Structural and Spectral Properties of Prime Order Element Graph of Finite Abelian Groups

Given a finite group $G$, the Prime Order Element (POE) Graph $\Gamma(G)$ consists of the group elements as the vertices, and two vertices $x$ and $y$ are adjacent if and only if $o(xy)$ is prime. This paper presents a thorough structural and spectral analysis of the POE graphs associated with the finite Abelian groups of different types. The order of a finite Abelian group may be a prime or a product of primes, which influences the structure of POE graphs. The POE graph is connected when the order of the Abelian group is a square-free integer. The POE graphs of the other Abelian groups have multiple connected components. Some of these components are isomorphic to the POE graph of a lower-order group. We study various graph-theoretic properties of the components, including regularity and bipartiteness. Arranging the elements of the group in a number of particular orders, we observe the block structure in the adjacency matrix of POE graphs. It assists us in investigating the spectral properties of POE graphs. We explicitly derive the characteristic polynomials governing both integral and irrational eigenvalues, and compute the eigenvalues with multiplicity in terms of the structure of the graphs.
Read the full abstract