Peer Revenue Play credits. Real papers.

Papers

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

Mathematics

math Watch Mathematics (sign in to use)

Monday 20 April

Information Theory

The dimensions of Schur squares of HRS codes

The Schur square of linear codes over a finite field has emerged as a fundamental operation in both classical and quantum coding theory. In this paper, we investigate the Schur square problem of Hyperderivative Reed-Solomon (HRS) codes. By solving certain special determinants, we first give a lower bound and an upper bound for the dimensions of Schur squares of HRS codes, and then prove that when $p\geq t\geq 2s$ and $t\leq \frac{r+2s-1}{2}$, the dimension of the Schur square of the HRS code $HRS_{t}(\{\alpha_{1},\dots,\alpha_{r}\},s)$ (with length $rs$ and dimension $t$) reaches the upper bound $(2t-2s+1)s$. In particular, when $p \ge t=2s$ and $r\geq t+1$, the dimension of the Schur square equals $\frac{t(t+1)}{2}$ which is the dimension of the Schur squares of random codes with high probability. As an application in code-based cryptography, HRS codes with specific parameter settings might resist the attack of Schur square distinguisher.
Read the full abstract

Differential Geometry

Prolongation and Killing two-tensors

We present a systematic prolongation procedure and its implementation for Killing two-tensors. We use the resulting machinery to elucidate the natural quadratic mapping from Killing fields to Killing two-tensors in general and on irreducible locally symmetric spaces of compact type.
Read the full abstract

Mathematical Physics

Semiclassical resonances under local magnetic fields

We study resonances for the semiclassical magnetic Laplacian in the full plane with a compactly supported magnetic field in the framework of semiclassical complex scaling and black box scattering theory. Assuming that the magnetic field is locally constant, we prove the existence of semiclassical resonances near the Landau levels with exponentially small imaginary parts. We also prove that resonances emerge from a magnetic step discontinuity along a curved interface or a non-degenerate magnetic well, and in the vicinity of anharmonic Landau levels if the field has an isolated zero.
Read the full abstract

Number Theory

Sophie Germain Primes and the Totient of Fibonacci Numbers

We study the set $S(q)$ of residue classes $r$ modulo the Pisano period $\pi(q)$ for which $q \mid \varphi(F_m)$ for every $m \equiv r \pmod{\pi(q)}$. We prove that if $q$ is a Sophie Germain prime and $z(2q+1) \mid \pi(q)$, then $S(q)$ is a nonempty arithmetic progression, and for $q > 5$ its cardinality is odd and $q \equiv 8 \pmod{15}$. Conversely, we show that if a prime $p \equiv 1 \pmod{q}$ has $z(p) \mid \pi(q)$, then necessarily $p = 2q+1$, so $q$ is Sophie Germain. We conjecture that $S(q) \neq \emptyset$ forces the existence of such a prime $p$; this is verified for all $q \leq 50000$. Assuming that $z(2q+1) \mid \pi(q)$ holds for infinitely many Sophie Germain primes (verified computationally for approximately 23.9% of them), the Sophie Germain conjecture implies the existence of infinitely many primes $q \equiv 8 \pmod{15}$ with $(2q+1) \mid F_{\pi(q)}$ – a purely Fibonacci-theoretic condition. These results generalize to arbitrary Lucas sequences $U_n(P,Q)$ with non-square discriminant.
Read the full abstract

Number Theory

Duality Between Prime Factors and The Prime Number Theorem For Arithmetic Progressions – Higher Order Dualities

In 1977, the first author observed a duality between the largest and smallest prime factors of integers, and established as a consequence some new results on the Möbius function $\mu(n)$ using the Prime Number Theorem for Arithmetic Progressions. In that 1977 paper, higher order dualities were observed involving the $k$-th largest and $k$-th smallest prime factors, facilitated by the Möbius function and $\omega(n)^{k-1}$, where $\omega(n)$ is the number of distinct prime factors on $n$. In 2024, the first author and Jason Johnson proved new results involving $\mu(n)$ and $\omega(n)$, by exploiting the second order duality identity of Alladi (1977). We establish here extensions to all higher orders $k$, the results of Alladi (1977) and of Alladi-Johnson (2024), by utilizing the $k$-th order duality in Alladi's 1977 paper. First, we show that for each $k\geq 2$, $$ \sum_{n=2}^{\infty} \frac{\mu(n)\omega(n)^{k}}{n} =0, $$ where $\mu(n)$ is the Möbius Function and $\omega(n)$ counts the number of distinct prime factors of $n$. Further, using the General Duality Identity and the Prime Number Theorem of Arithmetic Progressions, we prove that for integers $j,\ell$ satisfying $1 \leq j \leq \ell$ and $(j,\ell)=1$ $$ \sum_{\substack{n=2 \\ p_1(n) \equiv j\;(mod\;\ell)}}^{\infty} \frac{\mu(n)\omega(n)^{k-1}}{n}=0, \nonumber $$ for every $k \geq 3$; this result for $k=1$ is due to Alladi (1977) and for $k=2$ due to Alladi-Johnson (2024). We also recast this result in the following manner as a density-type theorem: for integers $j,\ell$ satisfying $1 \leq j \leq \ell$ and $(j,\ell)=1$ $$ (-1)^k\sum_{\substack{n=2 \\ p_1(n) \equiv j\;(mod\;\ell)}}^{\infty} \frac{\mu(n){\omega(n)-1 \choose k-1}}{n}=\frac{1}{\varphi(\ell)}, \nonumber $$ for every $k \geq 3$. All results are established here in quantitative form.
Read the full abstract

Optimization and Control · Cross-listed from eess.SY

Kill-Probability-Maximization Guidance: Breaking from the Miss-Distance-Minimization Paradigm

Classical guidance laws aim at minimizing the miss distance, thus implicitly determining the minimum warhead lethality radius required against nominal targets. However, nonnominal targets or scenarios might render the designed warhead insufficient, causing a significant degradation in the single-shot kill probability (SSKP). We propose a guidance methodology that shifts the interceptor's objective from minimizing the miss distance to directly maximizing the SSKP, while taking into account the warhead's probabilistic lethality model. Complying with the generalized separation theorem, the new paradigm is based on modifying deterministic differential-game-based guidance laws using Bayesian decision theory. Extensive Monte Carlo simulations demonstrate consistent SSKP improvement over the standard and recently introduced estimation-aware guidance laws, when tested against nominal and nonnominal evasively maneuvering targets.
Read the full abstract

Information Theory · Cross-listed from cs.RO

Memory Centric Power Allocation for Multi-Agent Embodied Question Answering

This paper considers multi-agent embodied question answering (MA-EQA), which enables robot teams to answer queries based on their long-horizon observations. In contrast to existing edge resource management methods that optimize sensing, communication, or computation performance metrics, MA-EQA focuses on the quality of aggregated memory. To address this paradigm shift, we propose a quality of memory (QoM) model based on generative adversarial exam (GAE), which leverages forward simulation to evaluate memory retrieval and utilizes the resulting exam scores to quantify QoM. Based on the QoM model, we develop a memory-centric power allocation (MCPA) scheme that maximizes memory quality under communication resource constraints. Through analytical characterization in the noise-limited regime, we reveal a GAE-augmented capped water-filling structure for MCPA. Extensive experiments demonstrate that MCPA achieves significant improvements over existing benchmarks across diverse metrics and scenarios.
Read the full abstract

All authors Chengyang Li, Shuai Wang, Kejiang Ye, Weijie Yuan, Boyu Zhou, Yik-Chung Wu, Chengzhong Xu, Huseyin Arslan

Dynamical Systems

A generalization of the Takagi function for beta-expansions

We consider a generalized Takagi function for beta-expansions with the base $1<\beta\leq2$, motivated by multifractal analysis for digit frequency sets of beta-expansions [20]. We show that it is pointwise $\alpha$-Hölder continuous for any $\alpha\in(0,1)$ but not pointwise Lipschitz continuous on the unit interval except a Lebesgue null set. Our proof relies on a formula for the generalized Takagi function reflecting its oscillations of the sum of digits and some basic limit theorems for the corresponding beta-map.
Read the full abstract

Differential Geometry

Weil–Petersson homeomorphisms, minimal lagrangian diffeomorphisms, and maximal surfaces in anti-de Sitter space

In this paper, we study the class of Weil–Petersson circle homeomorphisms from the point of view of three-dimensional anti-de Sitter space $\mathbf{AdS}^{2,1}$. We show that a homeomorphism $\varphi:\mathbf{RP}^1\to\mathbf{RP}^1$ is Weil–Petersson if and only if its graph, viewed as a curve in the boundary at infinity of $\mathbf{AdS}^{2,1}$, is the asymptotic boundary of a complete maximal spacelike surface in $\mathbf{AdS}^{2,1}$ with finite renormalized area. As an application, we obtain the following AdS-independent result in Teichmüller theory: a homeomorphism is Weil–Petersson if and only if its minimal lagrangian extension to $\mathbf{H}^2$ has square-integrable Beltrami differential. We also provide two further new technical characterizations, which we believe to be of independent interest, and which are essential for the proofs of our main results.
Read the full abstract

All authors Farid Diaf, Alex Moriani, Rym Smaï, Graham Andrew Smith, Enrico Trebeschi

Number Theory

Semistable Reduction Theorem for Overconvergent $F$-isocrystals over Laurent Series Fields

We prove the semistable reduction theorem for $\mathcal{E}^{\dag}_K$-valued and $K$-valued overconvergent $F$-isocrystals over $k((t))$-varieties which were introduced by Lazda and Pál. As an application, we prove the finite dimensionality of $\mathcal{E}^{\dag}_K$-valued rigid cohomology with compact support.
Read the full abstract

Rings and Algebras

Local and 2-local $\frac{1}2$-derivations of infinite-dimensional Lie algebras

In this work, we describe local and 2-local $\frac12$-derivations of infinite-dimensional Lie algebras. We prove that all local and 2-local $\frac12$-derivations of the Witt algebra as well as of the positive Witt algebra and the classical one-sided Witt algebra are $\frac12$-derivations. We also give an example of an infinite-dimensional Lie algebra with a local (2-local) $\frac12$-derivation which is not a $\frac12$-derivation. Further we prove that all local (2-local) $\frac12$-derivations on the $\mathcal{W}(a,b)$ algebra are $\frac12$-derivations.
Read the full abstract

Number Theory

Explicit Kodaira-Spencer maps over PEL Shimura varieties

The goal of our work is to construct a class of morphisms between two canonical line bundles on integral models of PEL Shimura varieties via Kodaira–Spencer maps, and explicitly compute such morphisms and their effects on the canonical metrics of line bundles. This result provides a concrete method for comparing two canonical line bundles and the corresponding arithmetic intersection numbers. In particular, it allows us to give an explicit relationship between the height functions defined by these two line bundles.
Read the full abstract

Functional Analysis

Multilinear embedding theorem for fractional sparse operators

We show some simple sufficient conditions for which the multilinear embedding theorem holds for fractional sparse operators. By verifying these conditions, we establish the theorem for power weights. We also provide Morrey-type sufficient conditions for which the $L^p \to L^q$, $1<p,q<\infty$, infinitesimal relative bounds hold for Schrödinger operators of the form $(-\Delta)^{\alpha/2}+v$.
Read the full abstract

All authors Naoya Hatano, Ryota Kawasumi, Hiroki Saito, Hitoshi Tanaka

Group Theory

Uniform two-generator presentations for $SL_n(\mathbb{Z})$ with polynomial complexity bounds

We give a uniform explicit construction of finite two-generator presentations for the special linear groups over the integers in all ranks at least three. The construction builds on the generating-pair work of Conder–Liversidge–Vsemirnov and on a standard Tietze-elimination observation pointed out by Button. It recovers Trott's odd-rank generating pair and extends the same monomial/transvection form uniformly to even rank by a sign correction. After rebalancing, the construction has quadratic transvection words, quartically many relators, and sextic total relator length. We also derive several consequences, including infinite–infinite and finite–finite variants, consequences for congruence quotients, a presentation for the projective quotient, and an exact relator count, valid for both the unbalanced and balanced presentations.
Read the full abstract

Optimization and Control · Cross-listed from eess.SY

Trajectory-Based Optimization for Air Traffic Control in the Terminal Maneuvering Area

We present a trajectory-based optimization framework for arrival sequencing and scheduling in the terminal maneuvering area (TMA). Unlike node-link scheduling models that reduce trajectories to time-delay variables, the proposed method computes implementable per-aircraft speed profiles and path extensions that achieve required landing separation through terminal air traffic control actions. The framework combines an analytic TMA path model, consisting of a tangent leg, a radius-to-fix turn, and a final-approach segment, with a nonlinear program (NLP) that jointly optimizes path stretch and segment speeds under a weighted objective. Three landing-order policies are examined: First-Entry-First-Serve (FEFS), First-on-Final-First-Serve (FOFFS), and FOFFS with Constrained Position Shifting (CPS) up to $k$ positions. CPS is implemented through a two-phase approach coupling mixed-integer linear programming (MILP) with NLP to select an optimized landing order before trajectory optimization. The aircraft population follows a realistic weight-class fleet mix with pair-specific wake-turbulence separation, and each scenario is perturbed by a Gaussian wind sample projected onto each segment to convert commanded airspeeds into ground speeds. An online rolling-horizon formulation commits each aircraft trajectory irrevocably upon entry, enabling real-time decision-making. Monte Carlo experiments on the simplified A80 TMA show that: (i) FOFFS consistently outperforms FEFS in delay, path stretch, and fuel burn by exploiting geometric asymmetries among arrival streams; (ii) CPS further reduces separation violations and path stretch, though with diminishing returns and rapidly increasing solver cost; (iii) fuel estimates from BADA 3 and OpenAP show consistent qualitative trends; and (iv) per-entry optimization completes in near real-time, supporting practical deployment.
Read the full abstract

Combinatorics

The Cactus Criterion: When Nonlinear Hodge Theory Reduces to Linear on Graphs

Let $G$ be a finite connected simple graph with a chosen orientation of its edges. For the edge potential $\psi(t)=\cosh t-1,$ we minimize $\sum_{e\in E^\to}\psi(z_e)$ over each affine class $\omega+dC^0(G)\subset C^1(G)$. The minimizer is the unique representative satisfying the nonlinear coclosed equation $\delta\sinh z=0,$ and hence defines a nonlinear selector $\Picc:C^1(G)\to C^1(G).$ We show that $\Picc$ is real analytic, identify its image as $\imop \Picc=\Mcc=\operatorname{arsinh}(\ker\delta),$ and compute its differential as a weighted Hodge projector. In particular, $\Picc$ agrees with the ordinary Hodge projector $\PiH$ to first order at the origin, and the first nonlinear correction is cubic. Our main global theorem is a graph-theoretic criterion: for every admissible edge potential – even, $C^2$, strictly convex, and non-quadratic – the associated nonlinear selector coincides with $\PiH$ on all of $C^1(G)$ if and only if $G$ is a cactus graph. Finally, we work out the two-triangle graph, the smallest connected simple obstruction, and record a self-concordant Newton method for computing $\Picc$.
Read the full abstract

Numerical Analysis

A Deep Ritz Method for High-Dimensional Steady States of the Cahn-Hilliard Equation

The Cahn-Hilliard equation is a fundamental model for describing phase separation phenomena in binary mixtures. Traditional numerical methods, such as finite difference and finite element methods, often incur substantial computational cost, particularly when computing steady-state solutions in high-dimensional settings. To address this challenge, we propose a deep learning-based framework – the Deep Ritz method – for computing steady states of the Cahn-Hilliard equation under periodic boundary conditions. An enhanced augmented Lagrangian formulation is incorporated to strictly enforce the mass conservation constraint, while separable Fourier feature mappings are employed to naturally encode periodicity and enhance the representation of nontrivial solution structures. The proposed method exhibits a notable dual capability: it not only achieves fast convergence to steady states but also effectively identifies multiple nontrivial solutions corresponding to different local minimizers of the energy functional. Extensive numerical experiments in one-, two-, and three-dimensional cases demonstrate that the method can successfully capture a rich variety of phase separation patterns, including droplet-type, lamellar, and tubular structures. We also compare the numerical results with those computed by finite difference method (FDM) for one- and two-dimensional cases, highlighting the effectiveness and robustness of the proposed approach in exploring complex high-dimensional energy landscapes.
Read the full abstract

Mathematical Physics · Cross-listed from quant-ph

Mutually-commuting von Neumann algebra models of quantum networks and violation of Bell-type inequalities

Employing mutually-commuting von Neumann algebras to represent the algebra of observables on quantum systems provides a framework for studying quantum information theory in systems with infinite degrees of freedom and quantum field theory, yielding many profound results that differ from non-relativistic quantum systems. In this paper, we establish a mutually-commuting von Neumann algebra model of quantum networks with arbitrary structures. We derive Bell-type inequalities on this model, and determine various bounds for Bell-type inequalities based on the structure of underline von Neumann algebras, and identify the algebraic structural conditions required for their violation. The conditions on the algebraic structure of observables for maximal violation of Bell-type inequalities, which we discovered in the context of von Neumann algebra models, can in turn guide the search for measurements in the non-relativistic setting.
Read the full abstract

Differential Geometry

Quantification of scalar curvature under $C^0$ convergence using smoothing

A quantitative version of the scalar lower bound under $C^0$ convergence was conjectured by Gromov. More recently, Mazurowski and Yao proved that a refined form of Gromov's conjecture holds in dimension three. Furthermore, they constructed examples demonstrating that such a refinement is necessary. In this paper, we establish that the refined quantitative bound holds in all dimensions greater than or equal to three.
Read the full abstract

Algebraic Geometry

The Quotient of Milnor Number by Tjurina Number of Hypersurface Singularities in Arbitrary Characteristic

In this paper, we use Hilbert-Samuel multiplicity, Hilbert-Kunz multiplicity, and s-multiplicity to establish a sharp upper bound for the quotient of the generalized Milnor numbers and the Tjurina numbers for isolated hypersurface singularities of any dimension in positive characteristic. Using this result, we also derive an upper bound for the quotient of the Milnor numbers $\mu$ and the Tjurina numbers $\tau$ for isolated hypersurface singularities of any dimension in characteristic zero. In particular, as a corollary, we obtain that for an isolated surface singularity $(f,0) \subset (\mathbb{C}^3,0)$, $\frac{\mu(f)}{\tau(f)}< \frac{3}{2}$, which partially answers a conjecture of P. Almirón. This is also a weak version of Durfee's conjecture. We have also constructed a family of hypersurface singularities of any dimension for which $\frac{\mu}{\tau}$ tends to the bound we get, which means that the bound is sharp, and at the same time answers an open problem raised by P. Almirón.
Read the full abstract

Algebraic Geometry

Hodge Atoms at Conifold Degenerations: F-Bundles, Limiting Mixed Hodge Modules, and the Rigid-Flexible Decomposition

We extend the Hodge atoms framework of Katzarkov–Kontsevich–Pantev–Yu to one-parameter conifold degenerations of Calabi–Yau threefolds. For a degeneration $\pi\colon X \to \Delta$ whose central fiber $X_0$ has $r$ ordinary double points, we construct a canonical rigid-flexible decomposition of the Hodge atoms of the nearby smooth fiber attached to the corrected degeneration object. The rigid atom $A(\IC^H_{X_0})$ is preserved across the degeneration, while the flexible atoms $A(i_{k*}\QQ^H_{\{p_k\}}(-1))$ are rank-one contributions, one for each vanishing cycle. The total degeneration atom $A(P^H)$ is the atom of the corrected mixed Hodge module $P^H\in\MHM(X_0)$ and fits into an exact sequence of atoms whose non-split structure is controlled by the intersection matrix $(\langle\delta_i,\delta_j\rangle)$. The technical core is the Stokes–Extension Identification, which identifies the Stokes matrix of the Dubrovin connection at the conifold locus with the matrix of the variation morphism $\varF\colon\varphi_\pi(F) \to \psi_\pi(F)$ under mixed Hodge module realization.
Read the full abstract

Numerical Analysis

Optimal asymptotic analyses on Laguerre and Hermite orthogonal approximation for functions of algebraic and logarithmic regularitiesYali

Based on the Hilb-type formula and van der Corput-type lemmas, we present optimal asymptotic estimates for the decay of the Laguerre and Hermite coefficients for functions with algebraic and logarithmic singularities, which in turn yield the convergence rates of the corresponding spectral orthogonal projections. Numerous examples are provided to verify the optimality of these asymptotic results.
Read the full abstract

Optimization and Control

A Numerical Analysis for Pursuit-Evasion Games under the Stackelberg Eqilibrium

This study presents a numerical analysis framework for pursuit–evasion differential games under the Stackelberg equilibrium. The Semi-DCNLP method is introduced as an optimization solver for flight path optimization problems formulated under the Stackelberg equilibrium. In a spacecraft pursuit-evasion differential game, the Semi-DCNLP method produces trajectories that closely match those obtained with a shooting method. This agreement supports the validity of the proposed approach.
Read the full abstract

2604.17742 · 20 Apr · 15 pages, 6 figures. English translation of a paper originally published in Japanese in the Journal of the Japan Society for Aeronautical and Space Sciences, Vol.63, No.5, pp.204–209 (2015). This version is posted on arXiv to improve accessibility and facilitate broader to dissemination to an international audience

Algebraic Geometry

Algebraic Degree of Network Games: Balanced Factors and Strategy Scaling

The algebraic degree of a network game is the generic number of isolated complex-torus solutions of its polynomial indifference system. We recast the classical semi-mixed coefficient formula as an edge-marked player-level polynomial whose monomials are balanced directed multigraphs with prescribed in- and out-degrees. This representation separates the intrinsic counting problem from strategy-label refinements: exact evaluation remains $\#\mathrm P$-complete, but for a fixed number of players it is polynomial in the numerical strategy dimensions, while nonvanishing is decided by a capacitated flow test. It also characterizes inclusion-minimal positive-degree supports as integral transportation forests and yields a sharp $2N-1$-arc positive core. Exact-support coefficients form connected transportation fibers and give a nonnegative support calculus. Under proportional strategy growth $m\mathbf k$, a lattice local limit theorem expresses the first-order degree asymptotic through the capacity and maximum-entropy flow of the essential support. All counts are generic and complex; reality and simplex feasibility remain payoff-dependent.
Read the full abstract

Geometric Topology

Some experimental results on stable equivalence of GST Links for the Generalized Property R Conjecture

Gompf-Scharlemann-Thompson and Meier-Zupan constructed an infinite family of R-links that are potential counterexamples of the generalized property R conjecture. Their works also show that whether these links are stably handleslide trivial is an interesting open problem related to the Slice-Ribbon conjecture. In this work, we implement an algorithm to construct all these links explicitly, the details of this algorithm will the content of another paper. With such an algorithm, the stable handleslide triviality of some of these links is verified. Moreover, many links are shown to be stably handleslide equivalent. Some of the results are obtained independently in \cite{Knots in the fiber}
Read the full abstract

Commutative Algebra

Varieties of minimal degree in weighted projective space

We initiate a study of varieties of minimal degree in weighted projective spaces. We call a weighted projective space $\mathbf{P}(w_0,\dots,w_n)$ divisible if $w_i \mid w_{i+1}$ for all $i$. We provide sharp bounds for when a non-degenerate subvariety of a divisible weighted projective space has minimal degree. We define a weighted notion of $1$-generic matrices and, in analogy with the classical theory, show that there is a theory of weighted determinantal scrolls. Moreover, we characterize precisely when these have minimal degree and determine their weighted $N_p$ properties, and tie this to two weighted notions of regularity. Finally, we propose conjectural bounds for more general weighted threefolds and pose several natural questions. Throughout, we highlight the differences between this theory and the classical case.
Read the full abstract

Functional Analysis

The Kerman-Sawyer trace theorem for product Morrey spaces

By using parallel corona decomposition, the Kerman-Sawyer trace theorem is extended from Lebesgue spaces to product Morrey spaces. By discretizing the multilinear fractional integral operator based on dyadic analysis, the framework of product Morrey spaces naturally arises in the course of estimating the operator. Within this natural setting, by establishing Sawyer-type testing estimates (to the setting of measures), we obtain an extension of the Kerman-Sawyer trace theorem. The classical approach to the Kerman-Sawyer trace theorem typically relies on a reduction to Carleson's embedding theorem. In contrast, in this paper we employ a parallel corona decomposition, which allows us to overcome the difficulties inherent in the multilinear setting and to provide a transparent and streamlined proof. By incorporating recent developments in the theory of weights, this work clarifies the relationship between trace inequalities and Morrey spaces and contributes to a deeper understanding of these topics.
Read the full abstract

All authors Naoya Hatano, Ryota Kawasumi, Hiroki Saito, Hitoshi Tanaka

Probability

Exact Simulation from Tempered Stable Distributions with Infinite Variation ($\alpha\ge1$)

We develop the first exact and computationally tractable method for simulating from tempered stable distributions in the infinite variation case, which corresponds to $\alpha\in[1,2)$. A small simulation study shows that the approach works well.

Differential Geometry

Symmetries and the First Laplace Eigenvalue of Lawson Surfaces

In this paper, we study the first eigenvalue of the Laplace–Beltrami operator on the Lawson minimal surfaces $\xi_{m,k}$ embedded in the unit three-sphere $\mathbb{S}^3$. Motivated by Yau's conjecture on the first eigenvalue of closed embedded minimal hypersurfaces in the sphere, we develop a symmetry-based approach to the equality $\lambda_1(\xi_{m,k})=2$ for the family of Lawson surfaces with $m$ and $k$ even. Our method exploits the discrete reflection symmetries intrinsic to Lawson's construction, together with the algebraic structure of the associated reflection group, Courant's nodal domain theorem, and the coordinate eigenfunctions arising from Takahashi's theorem. More precisely, we show that the equality $\lambda_1(\xi_{m,k})=2$ follows once a natural topological obstruction for invariant nodal sets in the fundamental patch is verified.
Read the full abstract

Combinatorics

A closure result on spanning $k$-trees of graphs with given minimum degree

Let $k\geq2$ be an integer. A $k$-tree is a tree with maximum degree at most $k$. In this paper, we give a closure result on spanning $k$-trees of graphs with given minimum degree. Let $\delta\geq1$ be an integer, and $G$ be a connected graph of order $n$ with minimum degree $\delta$. Let $u$ and $v$ be two nonadjacent vertices of $G$ satisfying $d_{G}(u)+d_{G}(v)\geq n-1-(k-2)\delta$. Then $G$ has a spanning $k$-tree if and only if $G+uv$ has a spanning $k$-tree.
Read the full abstract