Number Theory
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
Thursday 23 April
Let $\mathbf{B}_{\mathrm{dR}}^{+, \dagger} \subset \mathbf{B}_{\mathrm{dR}}^{+}$ be the “convergent" de Rham period ring which is the (un-completed) stalk at the de Rham point of the Fargues–Fontaine curve. We develop a Tate–Sen formalism to relate Galois representations over $\mathbf{B}_{\mathrm{dR}}^{+, \dagger}$ to regular connections over convergent functions. As a consequence, when the Sen weights (of the mod $t$ reduction) satisfy a $p$-adic non-Liouville condition, Galois cohomology of a $\mathbf{B}_{\mathrm{dR}}^{+, \dagger}$-representation compares to that of its $\mathbf{B}_{\mathrm{dR}}^{+}$-base change, and hence is finite. In addition, restricted to objects whose Sen weights are algebraic numbers, the categories of $\mathbf{B}_{\mathrm{dR}}^{+, \dagger}$-representations and $\mathbf{B}_{\mathrm{dR}}^{+}$-representations are equivalent.
Number Theory
The Smallest Invariant Factor of Elliptic Curves, and Coincidences
For an elliptic curve E over Q and a natural number j, Cojocaru has shown that there is an explicit constant C_E,j giving (under GRH) the density of primes p of good reduction such that the smallest invariant factor of E(F_p) is j. For E without complex multiplication, we study the question of when C_E,j is positive (a necessary and, on GRH, sufficient condition for there to be infinitely many such p), strengthening a result by Kim. Our arguments are group-theoretic using the image of the adelic Galois representation of E. Experimentally, C_E,j appears to vanish only when there is a coincidence of division fields; we document a number of families of such coincidences arising from abelian division fields.
Read the full abstract
Numerical Analysis
Positivity-Preserving and Entropy-Stable Oscillation-Eliminating DGSEM for the Compressible Euler Equations on Curvilinear Meshes with Adaptive Mesh Refinement
We extend the entropy-stable oscillation-eliminating discontinuous Galerkin spectral element method (ES-OEDG) on curvilinear meshes \cite{YangFu26} to adaptive mesh refinement (AMR) grids with nonconforming interfaces. The formulation is developed for two-dimensional curvilinear quadrilateral meshes with 2:1 refinement and a single level of hanging nodes. A central contribution is the design and analysis of interface fluxes. We propose a flux-interpolation coupling that evaluates pairwise numerical fluxes between coarse- and fine-side nodal states before interpolation. The coupling is globally conservative and satisfies a semi-discrete entropy inequality under a scaled Guermond–Popov wave-speed condition. For $N\ge2$, however, the sign correction required for entropy and positivity reduces formal consistency, and convergence on a severe curvilinear nonconforming mesh is close to first order. We also analyze the classical mortar flux, which retains high-order accuracy for smooth solutions but is not entropy stable and can exhibit entropy violations. Under suitable wave-speed and CFL conditions, both couplings preserve positive cell-average density and pressure, allowing the Zhang–Shu limiter to enforce nodal positivity. We further develop a complete AMR framework with an efficient indicator derived from the zero-order oscillation-elimination damping coefficient and an admissible refinement/coarsening transfer procedure that preserves conservation and positivity. Numerical experiments show that, despite reduced convergence rates on severe checkerboard meshes, the entropy-stable flux achieves robustness, solution quality, and resolution comparable to the mortar flux in shock-dominated AMR simulations.
Read the full abstract
Representation Theory
Quantization of nilpotent coadjoint $GL_N$-orbit closures in positive characteristics
Let $G$ be a reductive group over an algebraically closed field of positive characteristic $p$, good for the root system of $G$. The closures of $G$-orbits in the Hilbert nullcone of the coadjoint representation are conical affine Poisson varieties, generically of full rank, known as nilpotent coadjoint orbits. In this paper, we classify the filtered Hamiltonian quantizations of these orbit closures for $G = GL_N$ and any $p > 0$. Our main new technique is a construction of quantizations from certain primitive quotients of the enveloping algebra, inducing them from the stabiliser in $G$ of the Frobenius twisted $p$-character.
Read the full abstract
Probability
Long-time dynamics of stochastic 2D hydrodynamic-type evolution equations driven by multiplicative Lévy noise
This paper investigates the long-time dynamics of solutions for an abstract nonlinear stochastic hydrodynamic-type equation driven by multiplicative Lévy noise. The framework encompasses several key hydrodynamical models, including the stochastic 2D Navier-Stokes equations, magnetohydrodynamic equations, the magnetic Bérnard problem, as well as various stochastic shell models of turbulence. Under the assumption that the nonlinear noise coefficients satisfy local Lipschitz and linear growth conditions, we first establish global well-posedness using a truncation technique. Then, by introducing a mean random dynamical system, we prove the existence and uniqueness of weak pullback mean random attractors for the system. Furthermore, when the external force is time-independent, we study the existence of invariant measures for the corresponding autonomous system, as well as the double limiting behavior of invariant measures with respect to the intensities of Gaussian and Lévy noise. Finally, under additional assumptions on the bilinear nonlinear term (e.g., as in the Navier-Stokes equations), we examine the existence and uniqueness of pullback measure attractors, along with the asymptotically autonomous stability of such attractors as the time parameter tends to negative infinity. It is worth noting that the results of this paper are new even for the single stochastic 2D Navier-Stokes equations.
Read the full abstract
Combinatorics
Extremal 1-planar graphs without k-cliques
In 2016, Dowden initiated the study of planar Turán-type problems, which has since attracted considerable attention. Recently, Bekos et al. proved that every $K_3$-free $1$-planar graph on $n\ge 4$ vertices has at most $3n-6$ edges. In this paper, we strengthen this bound to $3n - 8$, which is tight for all even $n \ge 8$. Furthermore, we show that every $K_4$-free $1$-planar graph on $n \ge 3$ vertices has at most $\bigl\lfloor \tfrac{7n}{2} \bigr\rfloor - 7$ edges, and this bound is tight for all integers $n \ge 9$. We also prove that every $K_5$-free $1$-planar graph on $n \ge 3$ vertices has at most $4n - 8$ edges, which is tight for $n = 8$ and for all integers $n \ge 10$.
Read the full abstract
Combinatorics
Piercing all maximum cliques in hypergraphs
Graphs whose maximum clique size exceeds half of the total number of vertices satisfy a classical property: the family of their maximum sized cliques can be pierced by a single vertex. This result dates back to a 1965 theorem by Hajnal. Motivated by this theorem, Jung, Keszegh, Pálvölgyi, and Yuditsky recently conjectured that an analogous result should hold for hypergraphs of larger uniformity, with an appropriate constant replacing the threshold $1/2$. In this paper we refute this conjecture in a strong form. We show that for any constant $c<1$ and integers $k\ge 3$ and $t\ge 1$, there exist $k$-uniform hypergraphs $G$ whose maximum clique size exceeds $c|V(G)|$, yet the family of maximum size cliques of $G$ cannot be pierced by $t$ vertices. This demonstrates that no universal constant threshold guarantees bounded piercing number for maximum cliques in uniform hypergraphs. We discuss further questions concerning the relationship between clique size and piercing maximum cliques in hypergraphs, and introduce a geometric variant of the problem using Helly's Theorem.
Read the full abstract
Information Theory
Generative Learning Enhanced Intelligent Resource Management for Cell-Free Delay Deterministic Communications
Cell-free multiple-input multiple-output (CF-MIMO) architecture significantly enhances wireless network performance, offering a promising solution for delay-sensitive applications. This paper investigates the resource allocation problem in CF-MIMO systems, aiming to maximize energy efficiency (EE) while satisfying delay violation rate constraint. We design a Proximal Policy Optimization (PPO) with a primal-dual method to solve it. To address the low sample efficiency and safety risks caused by cold-start of the designed safe deep reinforcement learning (DRL) method, we propose a novel offline pretraining framework based on virtual constrained Markov decision process (CMDP) modeling. The virtual CMDP consists of reward and cost prediction module, initial-state distribution module and state transition module. Notably, we propose an evidence-aware conditional Gaussian Mixture Model (EA-CGMM) inference approach to mitigate data sparsity and distribution drift issues in state transition modeling. Simulation results demonstrate the effectiveness of CMDP modeling and validate the safety and efficiency of the proposed pretraining framework. Specifically, compared with non-pretrained baseline, the agent pretrained through our proposed framework achieves twice the initial EE and maintains a low delay constraint violation rate of $1\%$, while ultimately converging to an EE that is $4.7\%$ higher with a $50\%$ reduction in exploration steps. Additionally, our proposed pretraining framework implementation exhibits comparable performance to the SOTA diffusion model-based implementation, while achieving a $14$-fold reduction in computational complexity.
Read the full abstract
Mathematical Physics · Cross-listed from physics.chem-ph
Reaction-Diffusion Processes with Surface Autocatalysis
Autocatalytic processes underlie diverse systems in which replication is triggered at interfaces, including heterogeneous catalysis on solid substrates, enzyme activity at membranes, viral infections, biofilm growth, and spatially structured ecosystems. In a typical scenario, particles move in a bulk medium and interact with surface regions, where they may either disappear or reproduce through branching, splitting or fission. Here, we develop a general theoretical framework to understand such surface-mediated autocatalytic processes. We show that the interplay between loss and replication at surfaces gives rise to rich population dynamics. For this purpose, we derive a renewal-type nonlinear integral equation for the generating function of the population size, providing access to its full probability distribution and statistical moments. We further establish an equivalent description in terms of a Fokker-Planck equation with nonlinear Robin-type boundary conditions that encode surface reactions. Our results identify distinct dynamical regimes and universal scaling laws, and provide a unified framework to predict when surface activity promotes extinction or explosive growth. These findings offer quantitative insight into catalytic efficiency, metabolic regulation, and population persistence in spatially heterogeneous environments.
Read the full abstract
Mathematical Physics
Derivation of Gibbs measure from Gibbs state with the fractional Bessel interaction in Two Dimensions
We derive the classical Gibbs measure on $\mathbb{T}^2$ associated with the fractional Bessel interaction potential $\widehat{v}_\beta(k)=\langle k\rangle^{-\beta}$ from a renormalized grand-canonical quantum Bose gas with the same interaction. Our result covers the whole range $\frac32<\beta\leq2$, where $\widehat{v}_\beta(k)$ is not summable and the quantum model cannot be written in the usual density-square form, as the associated self-energy diverges. We therefore need to renormalize the zero mode by a centered number-fluctuation term and then develop a detailed analysis for the high-frequency remainders. All this allows us to implement a low-frequency localization and obtain the convergence of the quantum relative free energy to the classical fractional-Bessel free energy, as well as the convergence of the reduced density matrices to the limiting Gibbs measure.
Read the full abstract
Spectral Theory
Quantum Mixing for Schrödinger eigenfunctions in Benjamini-Schramm limit
Let $\{X_n\}_{n\in\mathbb{N}}$ be a sequence of compact hyperbolic surfaces which is uniformly discrete and Benjamini-Schramm converges to $\mathbb{H}$ and let $\{V_n\}_{n\in\mathbb{N}}$ be a sequence of potentials such that the $L^2$-norm of $V_n$ is $o(1)$ with respect to the volume of $X_n$. We prove quantum mixing for the eigenfunctions of $-\Delta_{X_n}+V_n$ in any sufficiently large spectral window $I$ for bounded observables which are polynomial mixing with respect to the geodesic flow. Examples of such sequences of potentials include point-cloud potentials just below the thermodynamic limit, Hartree potentials for dilute Bose gases in hyperbolic space, and sequences induced by bounded potentials in $L^p(\mathbb{H})$ for some $p>0$. This is the first result of this kind beyond the locally symmetric setting. The proof combines classical geodesic flow mixing on $T^1X_n$, replacing Nevo's ergodic theorem, with the Duhamel formula and recently developed geometric wave-kernel estimates by the first author.
Read the full abstract
Information Theory
Robust Beamforming for MIMO Radar with Imperfect Prior Distribution Information
This paper studies a multiple-input multiple-output (MIMO) radar system for sensing the unknown and random angular location (angle) of a point target, based on the target-reflected echo signals and known prior distribution information about the target's angle specified by a probability density function (PDF). We consider a challenging yet practical scenario where the knowledge of such PDF is imperfect, due to the inaccuracy in PDF acquisition or unpredicted change of target appearance pattern; while the real (actual) PDF is modeled as an unknown perturbed version of the imperfect known PDF bounded by a given uncertainty radius. Such PDF imperfection motivates us to study the robust transmit beamforming design to optimize the worst-case sensing performance among all possible real PDFs. Since the sensing mean-squared error (MSE) is difficult to be characterized explicitly, we adopt the worst-case posterior Cramér-Rao bound (PCRB) as the performance metric. We formulate the beamforming optimization problem to minimize the maximum PCRB among all possible real PDFs, which is highly non-trivial since the PCRB has a complex intractable expression over the real PDF, and there are infinite constraints corresponding to the continuous set of real PDFs bounded by the uncertainty radius. To address these challenges, we derive a tractable quadratic approximation of the PCRB via second-order Taylor expansion, and leverage the S-procedure to equivalently transform the infinite constraints into a linear matrix inequality, based on which the problem is reformulated into a convex optimization problem solvable with polynomial time complexity. The obtained solution approaches the globally optimal robust beamforming solution as the uncertainty radius decreases. Numerical results validate the effectiveness of our proposed robust beamforming design.
Read the full abstract
Optimization and Control
Entropic regularization of Monge's problem
We study the vanishing-regularization limit of entropically regularized optimal transport (EOT) for the Euclidean distance cost $c(x,y)=\|x-y\|$ in dimension $d>1$. We develop a comprehensive variational convergence framework that entails two main results. First, we resolve the longstanding entropic selection problem: the EOT minimizer converges to a distinguished optimal transport plan that is characterized explicitly as the solution of a constrained EOT problem on each transport ray. Denoting by $\varepsilon>0$ the regularization parameter, this selection holds for all $o(\varepsilon)$-approximate minimizers, with sharp failure at the $O(\varepsilon)$ scale. Second, we establish an explicit second-order expansion of the entropic transport cost. The second-order term encodes the geometry of the regularization and reveals the optimal asymptotic tradeoff between entropy and transport cost.
Read the full abstract
Optimization and Control
Infinite Horizon Optimal Control Problems with Discount Factors
This paper is dedicated to the analysis of infinite horizon optimal control problems subject to semilinear parabolic equations with constraints on the controls and discounted cost functionals. The discount factors on the cost and the state components are allowed to differ from each other. First-order as well as second-order optimality conditions are derived and the importance of allowing different discount factors for the second-order analysis for the class of nonlinearities under consideration is demonstrated. Finally convergence and rate of convergence for the approximation of the infinite horizon problem by a family of finite horizon problems is proven.
Read the full abstract
Combinatorics
Tight constructions for reconfigurations of independent transversals
For a graph $G$ and partition $\mathcal{U}$ of its vertex set, an independent transversal of $(G, \mathcal{U})$ is an independent set of $G$ that contains one vertex from each block of $\mathcal{U}$. Buys, Kang, and Ozeki studied when a reconfiguration graph on independent transversals of $(G,\mathcal{U})$ is connected, meaning any independent transversal can be transformed into any other one through a sequence of one-vertex modifications while always maintaining an independent transversal. Analogous to a theorem of Haxell, they proved that this is the case if $G$ has maximum degree $\Delta$ and each block of $\mathcal{U}$ has size at least $2\Delta$, except if the union of some $k \ge 1$ blocks of $\mathcal{U}$ induces $k$ disjoint copies of the complete bipartite graph $K_{\Delta, \Delta}$ in $G$. Solving one of their problems, we exactly characterize the partition structure in the latter exceptional instances of their theorem, showing that there is a rich variety of them but they are generated by a simple constructive procedure.
Read the full abstract
Numerical Analysis
A nonconforming method for a generalized Darcy-Forchheimer model
We analyze a dual mixed nonconforming discretization of a generalized Darcy-Forchheimer model. Compared to the analogous scheme proposed by Girault and Wheeler, we consider general, i.e., nonquadratic, Forchheimer nonlinearities; we admit mixed, inhomogeneous boundary conditions; we allow for more general, i.e., with lower Lebesgue regularity, permeability tensors; we construct general-order schemes; we prove convergence to the exact solution under low regularity assumptions, based on novel Sobolev-trace inequalities for broken spaces; we derive error estimates of general-order assuming extra regularity of the exact solution and data; we present numerical results assessing the performance of the proposed schemes for different types of nonlinearity and nonlinear solvers.
Read the full abstract
Combinatorics
Combinatorial aspects of the non-symmetric strong spectral property for graphs
In this paper, we investigate the non-symmetric Strong Spectral Property (nSSP) from a combinatorial perspective. To zero-nonzero patterns of matrices we associate directed graphs and study when they require or allow the nSSP, providing a framework that avoids verifying the nSSP for individual matrices. A new combinatorial method is introduced and used to recognise several patterns that require the nSSP. It is shown that loop assignments in double paths play a critical role in establishing this property, and we show that an open question regarding irreducible tridiagonal patterns has a negative answer. We also investigate whether the minimum number of arcs in a directed graph on $n$ vertices that requires the nSSP, is equal to $2n-1$, and confirm this minimum for several specific digraph families.
Read the full abstract
Combinatorics
On the largest chromatic number of $F$-free hypergraphs
Given a hypergraph $F$, what is the largest chromatic number that an $F$-free hypergraph can have? In the case of graphs, this question is easy to answer: the chromatic number is unbounded if $F$ contains a cycle, and the largest chromatic number of $F$-free graphs is $k-1$ if $F$ is a forest on $k$ vertices. The situation is more complicated for hypergraphs. The strong coloring of a hypergraph is a coloring of the vertices such that every hyperedge is rainbow. The weak coloring of a hypergraph is a coloring of the vertices such that no hyperedge is monochromatic. The strong/weak chromatic number of a hypergraph is the minimum number of colors in a strong/weak coloring of the hypergraph. Our question has been completely answered for the weak chromatic number, similarly to the graph case. We characterize the hypergraphs $F$ such that $F$-free hypergraphs have bounded strong chromatic number. The only remaining case is when $F$ is the 3-uniform expansion $S_k^+$ of a star with $k$ edges. Concerning the strong chromatic number of $S_k^+$-free hypergraphs, we give bounds that are asymptitically sharp as $k\rightarrow\infty$. We also consider the same problem when the Berge copies of a graph $F$ are forbidden. We characterize when the strong/weak chromatic numbers are bounded in this case, and obtain sharp results or bounds for specific trees. In particular, when $F$ is a path, we give a tight bound when $r=3$ and an asymptotically sharp bound when $r=4$.
Read the full abstract
Mathematical Physics
Jordan-Twist Bethe Ansatz and Many-Body Exceptional-Point Amplification in the Finite-$U$ Anderson Impurity
We construct an interacting integrable realization of many-body exceptional-point amplification in the static equal-velocity linearized finite-$U$ Anderson impurity. Two spin-orbit branches are linearized about counterpropagating Fermi points and folded into equal-velocity chiral components. The impurity carries the constant pseudo-Hermitian matrix $M=\gamma\sigma_x+i\beta\sigma_z$, while the hybridization is a component scalar. A canonical $GL(2,\mathbb C)$ transformation preserves the Anderson interaction, and a position-dependent version maps the model to the conventional Anderson Hamiltonian plus a conserved complexified pseudospin charge with boundary twist $G=\exp(iML/v)$. The exact two-electron Anderson $R$-matrix is rational in the dressed rapidity $u(p)=p(p-2\epsilon_d-U)/(2U\Gamma_A)$ and yields YBE, RLL, and twisted RTT relations for arbitrary particle number. At $\beta^2=\gamma^2$, $G$ is nontrivial unipotent. On every pseudospin-$S$ multiplet, the deformed Hamiltonian is similar to a single Jordan block of order $2S+1$; finite $U$ shifts its energy but does not split it. Approaching the unipotent point through a singularly conjugated diagonal twist, the descendant spin roots contract to $\lambda=\infty$ with scaled positions fixed by $L_r^{(-2S-1)}(2x)$. For the maximal descendant at large $S$, their normalized zeros converge to the Szego curve. Curvature, unequal velocities, and nonscalar channel couplings lie outside the theorem.
Read the full abstract
Information Theory
Design of MDP Convolutional Codes and Maximally Recoverable Codes Through the Lens of Matrix Completion
The matrix completion problem provides a unifying lens through which many fundamental problems in coding theory can be viewed. In this paper, we investigate Locally Recoverable Codes (LRCs) with Maximal Recoverability (MR) and Maximum Distance Profile (MDP) convolutional codes in the framework of matrix completion. In particular, we present techniques that are general enough to provide constructions for both types of codes. A common feature of our code constructions is the sparsity of their generator matrices and the property that a large number of the entries of the generator matrices are elements of a small subfield of a larger extension field.
Read the full abstract
Optimization and Control
Adaptation and Development of Super Schemes for Unconstrained Optimization Problems
In this paper, we propose a class of super-schemes for efficiently solving nonlinear unconstrained optimization problems. The proposed approach introduces two novel choices of step-size parameters, leading to efficient descent directions without requiring second-order information. We develop one-step, two-step, and three-step iterative schemes (denoted by SS1, SS2, and SS3) and establish that these methods achieve higher-order convergence of orders two, four, and six, respectively. Despite their high convergence rates, the computational complexity of the proposed methods remains comparable to existing gradient-based methods, with a cost of $\mathcal{O}(n^2)$ per iteration. The proposed methods are simple to implement and do not require complicated line-search procedures. Their effectiveness is demonstrated through extensive numerical experiments on a wide range of problems, including large-scale and ill-conditioned cases. The results show that the proposed methods significantly outperform classical methods, such as the Barzilai-Borwein method and other gradient-based approaches, in terms of iteration count and computational efficiency. Finally, the numerical results are consistent with the theoretical analysis, confirming the stability of the proposed schemes for test optimization problems.
Read the full abstract
Mathematical Physics · Cross-listed from cond-mat.str-el
Symplectic symmetry of quadratic-band-touching Hamiltonians in two dimensions
The internal low-energy symmetry of the massless Lorentz-invariant Dirac Hamiltonian in $2+1$ dimensions is known to be $O(2N)$, where $N$ is the number of two-component Dirac fermions. Here we point out that there exists an analogous internal symmetry of the single-particle quadratic-band-touching Hamiltonian in two spatial dimensions, and it is the unitary symplectic group, $USp(2N)$. All fermionic bilinears belong to one of the three small irreducible representations of this group. The interacting theory that respects the $USp(2N)$ symmetry and the spatial rotations is constructed and found to allow two independent interaction terms. When these interactions are infrared-relevant the symplectic symmetry either remains preserved or becomes spontaneously broken to $USp(N) \times USp(N)$. The symmetry in the lattices such as honeycomb to infinite order in the dispersion's expansion in powers of local momentum is given by the overlap of the symplectic and the orthogonal groups. We show that this overlap is $O(2N) \bigcap USp(2N) = U(N)$.
Read the full abstract
Differential Geometry
Embedded special Legendrian surfaces in $\mathbb S^5$
We construct the first smooth embedded compact special Legendrian surfaces in \(\mathbb S^5\) of genus greater than one. More precisely, for every sufficiently large integer \(k\), we construct an embedded special Legendrian surface whose conformal structure is the Fermat curve of degree \(k\) and genus \(\tfrac12(k-1)(k-2)\). Our approach combines an elementary implicit function theorem with the description of special Legendrian surfaces via loop algebra-valued meromorphic connections and a characterization of the unitarizability locus in the ${SL}_{3}(\mathbb C)$-character variety of the thrice-punctured sphere.
Read the full abstract
Differential Geometry
Pohozaev identities and bubbling obstruction for Yang-Mills fields in conformal dimension
We study bubbling for sequences of Yang-Mills connections on closed four-manifolds and we derive a compatibility of Pohozaev type between the weak limit connection and the bubble formed at a concentration point, involving the Weyl tensor of the background metric. This yields obstruCtions to bubbling extending earlier results of Yin beyond the locally conformally flat case. As an application, we rule out certain bubbling configurations on CP2.
Read the full abstract
Functional Analysis
Boxing inequalities for relative fractional perimeter and fractional Poincaré-type inequalities on John domains with the BBM factor
For $0<\delta,\tau<1$ and $1\le s\le \frac{n}{n-\delta}$, we prove that for a given $s$-John domain $\Omega\subset \mathbb{R}^n$, the following Boxing inequality holds for every Lebesgue measurable set $U\subset\Omega$ with $|U|/|\Omega|\le\gamma<1$: \[ \mathcal{H}^{s(n-\delta)}_{\infty}(U\setminus\mathcal{N}_U)\le C(1-\delta)\int_\Omega\int_{|x-y|<\tau\operatorname{dist}(y,\partial\Omega)}\frac{|\chi_U(x)-\chi_U(y)|}{|x-y|^{n+\delta}}\,dx\,dy, \] where $\mathcal{H}^{s(n-\delta)}_{\infty}(U)$ denotes the $s(n-\delta)$-dimensional Hausdorff content of $U$, $\mathcal{N}_U$ is a set of Lebesgue measure zero and the constant $C$ depends only on $n,\tau,s,\gamma$, the John constant and the diameter of $\Omega$. Moreover, we establish the functional formulation of the above Boxing inequality and discuss the equivalence between these two formulations. Based on the Boxing inequality, we prove the fractional Poincaré–Wirtinger trace inequality on $s$-John domains, of which the fractional Sobolev–Poincaré inequality and fractional Hardy-type inequality are special cases. Notably, we prove all of the aforementioned inequalities with the Bourgain–Brezis–Mironescu (BBM) factor $1-\delta$. Furthermore, with the aid of the Bourgain–Brezis–Mironescu formula, we recover the Poincaré–Wirtinger trace inequality. Finally, by showing that, under the separation property, any domain supporting the Boxing inequality is necessarily a John domain, we conclude that the John domain condition is essentially sharp for the above inequalities. All the above inequalities with the BBM factor are new even for Lipschitz domains.
Read the full abstract
Probability · Cross-listed from cs.DS
Efficient generation of expected-degree graphs via edge-arrivals
We study the efficient generation of random graphs with a prescribed expected degree sequence, focusing on rank-1 inhomogeneous models in which vertices are assigned weights and edges are drawn independently with probabilities proportional to the product of endpoint weights. We adopt a temporal viewpoint, adding edges to the graph one at a time up to a fixed time horizon, and allowing for self-loops or duplicate edges in the first stage. Then, the simple projection of the resulting multigraph recovers exactly the simple Norros–Reittu random graph, whose expected degrees match the prescribed targets under mild conditions. Building on this representation, we develop an exact generator based on edge-arrivals for expected-degree random graphs with running time $O(n+m)$, where $m$ is the number of generated edges, and hence proportional to the output size. This removes the typical vertex sorting used by widely-used fast generator algorithms based on edge-skipping for rank-1 expected-degree models, which leads to a total running time of $O(n \log n + m)$. In addition, our algorithm is simpler than those in the literature, easy to implement, and very flexible, thus opening up to extensions to directed and temporal random graphs, generalization to higher-order structures, and improvements through parallelization.
Read the full abstract
Combinatorics
A non-existence result for vertex-girth-regular graphs
A $k$-regular graph of girth $g$ is called vertex-girth-regular if every vertex is contained in the same number of cycles of length $g$. For integers $n, k, g$ and $\lambda$, we denote such a graph on $n$ vertices in which every vertex lies on exactly $\lambda$ cycles of length $g$ by a $\text{vgr}(n,k,g,\lambda)$-graph. It is well-known that any vertex-girth-regular graph satisfies $\lambda \le \frac{k(k-1)^{\left\lfloor \frac{g}{2} \right\rfloor}}{2}$. Graphs for which $\lambda$ is close to this bound are of particular interest in connection with the cage problem, since requiring many girth cycles through every vertex is a natural way to isolate highly structured candidates for small regular graphs of prescribed girth. In this paper, we prove that for every $k\ge 3$ and every integer $0< \varepsilon \leq \frac{k-1}{2}$, there does not exist a $\text{vgr}(n,k,5,\frac{k(k-1)^2}{2}-\varepsilon)$-graph. Previous non-existence results had already settled all odd girths at least $7$ and very recently also girth $3$, leaving girth $5$ as the only girth for which no non-trivial non-existence result was known. Thus, our result resolves the final remaining case and completes the picture for odd girths.
Read the full abstract
Operator Algebras
The similarity of irreducible operators in factors
An operator $T$ in a separable factor $\mathcal{M}$ is said to be irreducible in $\mathcal{M}$ if the von Neumann subalgebra $W^*(T)$ generated by $T$ is an irreducible subfactor of $\mathcal{M}$, i.e., $W^*(T)'\cap\mathcal{M}=\mathbb{C}I$. We say that $T$ is a single generator of $\mathcal{M}$ if $W^*(T)=\mathcal{M}$. In this paper, we study generators of separable factors related to maximal abelian self-adjoint subalgebras. As an application, we obtain a complete characterization of normal operators in separable factors which are similar to irreducible operators.
Read the full abstract
Numerical Analysis · Cross-listed from physics.comp-ph
A Thin Sheet Volume Integral Equation Solver for Simulation of Bianisotropic Metasurfaces
A thin-sheet (TS) volume integral equation (VIE) formulation incorporating generalized sheet transition conditions (GSTCs) is presented for the simulation of three-dimensional (3D) bianisotropic metasurfaces. The metasurface is represented as an equivalent thin sheet, with its constitutive tensors derived from the GSTC susceptibility tensors. Invoking the thin-sheet approximation, the governing VIEs are reduced to surface integral equations (SIEs), in which tangential and normal flux density components are treated as distinct sets of unknowns and discretized using Rao-Wilton-Glisson and pulse basis functions, respectively. In contrast to conventional GSTC approaches based on conventional SIEs, which represent only tangential fields, the proposed framework rigorously enforces the bianisotropic GSTCs, including normal field interactions, while retaining the flux-based VIE character of the formulation. Numerical examples, including a comparison with an SIE-GSTC solver that neglects the normal susceptibility components, demonstrate the accuracy and robustness of the proposed TS-VIE-GSTC solver for polarization rotation on planar and curved sheets, perfect reflection, beam steering with spatially varying susceptibilities, multi-directional attenuation, and oblique phase-shift transformation.
Read the full abstract
Combinatorics
Spectral radius conditions for edge-disjoint spanning trees in $(k+c)$-edge-connected graphs
Let $\tau(G)$ denote the spanning tree packing number of a graph $G$. Recently, Zhang and Fan [J. Graph Theory 112 (2) (2026) 128–144] posed the problem of finding a tight spectral radius condition for an $m$-edge-connected graph $G$ to guarantee $\tau(G)\ge k$ for $k+1\le m\le 2k-1$. They solved the cases $m=k$ and $k=2, m=3$. In this paper, we study this problem for all $m=k+c$, where $1\le c\le k-1$. For $1\le c\le k-2$, we obtain a tight spectral radius condition for a $(k+c)$-edge-connected graph to contain $k$ edge-disjoint spanning trees. We also obtain a tight spectral radius condition for $(2k-1)$-edge-connected graphs. In both cases, we give graph families containing all extremal graphs, and the graphs with maximum spectral radius in these families serve as the corresponding extremal graphs. Each graph in these families consists of a large clique and a small remaining part, with certain restrictions on the edges inside the small part and between the two parts. Moreover, for the case $m=k+1$, we further determine the unique extremal graph.