Peer Revenue Publish or profit

Papers

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

Mathematics

math Watch Mathematics (sign in to use)

Sunday 29 March

Mathematical Physics

A Concentration of Measure Phenomenon in the Principal Chiral Model

We utilize the concentration of measure phenomenon to study the double limit (large-$N$ and continuum) of the $O(N)$ principal chiral model, where the large-$N$ limit is performed before the continuum one. The partition function in this double limit is demonstrated to be that of a free massive theory. The result depends crucially on the order in which the limits are taken.
Read the full abstract

Combinatorics

On four network monitoring parameters in graphs and their gaps

Let \( G \) be a finite simple undirected graph. Four graph parameters related to network monitoring are the geodetic set, edge geodetic set, strong edge geodetic set, and monitoring edge geodetic set, with corresponding minimum sizes, denoted by \( g(G), eg(G), seg(G) \), and \( meg(G) \), respectively. These parameters quantify the minimum number of vertices required to monitor all vertices and edges of \( G \) under progressively stricter path-based conditions. As established by Florent et al.\ (CALDAM 2023), these parameters satisfy the chain of inequalities: \( g(G) \leq eg(G) \leq seg(G) \leq meg(G). \) In 2025, Florent et al.\ posed the following question: given integers \( a, b, c, d \) satisfying \( 2 \leq a \leq b \leq c \leq d \), does there exist a graph \( G \) such that \( g(G) = a, \quad eg(G) = b, \quad seg(G) = c, \quad \text{and} \quad meg(G) = d? \) They partially answered this affirmatively under three specific hypotheses and gave some constructions to support it. In this article, we first identify quadruples of values that cannot be realized by any connected graph. For all remaining admissible quadruples, we provide explicit constructions of connected graphs that realize the specified parameters. These constructions are modular and efficient, with the number of vertices and edges growing linearly with the largest parameter, providing a complete and constructive characterization of such realizable quadruples.
Read the full abstract

Combinatorics

Sets of subspaces with restricted hyperplane intersection numbers

Let $\mathcal{X}$ be a set of $(h-1)$-dimensional subspaces of $\mathrm{PG}(kh-1,q)$ with the property that every hyperplane contains at most $t$ elements of $\mathcal{X}$. We prove the upper bound $|\mathcal{X}| \leq (t-k+2)q^h + t$, and characterise the structure of $\mathcal{X}$ in the case of equality. We call spanning sets attaining this bound length-maximal. For $k=3$, these sets are higher-dimensional analogues of maximal arcs; when $h=1$ they are precisely the maximal arcs of $\mathrm{PG}(2,q)$, which for $t<q$ exist if and only if $q$ is even and $t$ divides $q$. For $k=4$ and $q^h>2$, we show that any length-maximal set must satisfy $t = q^h+1$ and that every hyperplane is either a $t$-secant or a $1$-secant. Such sets exist for all $q$ and $h$, arising as field reductions of ovoids of $\mathrm{PG}(3,q^h)$. For $k \geq 5$ and $q^h>3$, no length-maximal set exists. The case $q^h=3$, that is $(q,h)=(3,1)$, is exceptional: there, examples arising from the ternary Golay code exist for $k=5$ and $k=6$, while none exist for $k\ge7$. In the language of additive codes, these results assert that additive codes over $\mathbb{F}_{q^h}$ attaining the natural Griesmer-type bound do not exist when the code dimension is $5$ or more and $q^h>3$, apart from these two sporadic $\mathbb{F}_3$ examples. We also determine the strongly regular graphs associated with length-maximal sets.
Read the full abstract

2603.27689 · 29 Mar · Main changes: (1) the k>=5 nonexistence theorem is corrected to q^h>3; (2) The k=4 bound is shown to be attained for all q and h by field reduction of ovoids of PG(3,q^h). (3) New section determining the associated strongly regular graphs. Hypotheses q>2 replaced by q^h>2 throughout; spanning condition added to the definition of length-maximal; minor corrections

Quantum Algebra

Equivalence of Extended $U(1)$ Chern-Simons and Reshetikhin-Turaev TQFTs

We establish the equivalence between $U(1)$ Chern-Simons and Reshetikhin-Turaev TQFTs associated with finite quadratic modules. For gauge group $U(1)$ and even level $k$, we prove that the corresponding Chern-Simons TQFT is naturally isomorphic to the Reshetikhin-Turaev TQFT determined by the pointed modular category $C(\mathbb Z_k,q_k)$. The equivalence holds both for closed $3$-manifolds and for bordisms with boundary, so that the two constructions define naturally isomorphic extended $(2+1)$-dimensional TQFTs. In particular, the finite quadratic module $(\mathbb Z_k,q_k)$ completely determines the $U(1)$ Chern-Simons theory.
Read the full abstract

Dynamical Systems

Non-autonomous parabolic implosion

We study parabolic implosion in a general non-autonomous setting. Let $f(w)=w+w^2+O(w^3)$ be a holomorphic germ tangent to the identity. We consider the iteration of non-autonomous perturbations of the form \[ w_{j+1}=f(w_j)+\varepsilon_{j,n}^2. \] We show that, when the $\varepsilon_{j,n}^2$'s satisfy a Lavaurs-type condition, the element $w_n$ can be described by means of a suitable Lavaurs map $L_{u_n}$, whose phase $u_n$ is an explicit function of the perturbation parameters. In particular, whenever $u_n\to u\in \mathbb C$, the non-autonomous dynamics converges locally uniformly on compact subsets of the parabolic basin to the corresponding Lavaurs map $L_u$. Our study provides a general description of additive non-autonomous parabolic implosion and yields several deterministic and random convergence results as corollaries, as well as a unified proof of several previous results. As an application, we also obtain strong discontinuity results for the Julia sets of fibered holomorphic endomorphisms of $\mathbb P^2(\mathbb C)$.
Read the full abstract

Dynamical Systems · Cross-listed from astro-ph.EP

Low-Energy Round-Trip Trajectories to Near-Earth Objects using Low Thrust

Near-Earth Objects (NEOs) are attractive exploration targets due to their accessibility, scientific value, and resources. Although trajectory design has revealed efficient pathways to these bodies, systematic strategies for Earth-NEO transfers, especially with low thrust, remain limited. This work presents a streamlined methodology that blends the Sun-Earth circular restricted three-body problem (CR3BP) with the heliocentric two-body problem (2BP) to design low-energy round-trip trajectories. The current planar implementation enables efficient large-scale exploration of near-Earth space. Three-body manifold trajectories and transit orbits provide natural pathways for Earth departure and return through the L1 and L2 libration points, while the 2BP framework identifies spacecraft-NEO encounters through intersections of their elliptical orbits. This hybrid structure supports generating large collections of round-trip trajectories without heavy optimization, enabling rapid preliminary mission design across broad NEO populations. Rendezvous and takeoff maneuvers are first modeled as impulsive, then translated into low-thrust arcs to improve propellant efficiency. Round-trip transfers are assembled by combining compatible outbound and inbound branches under simple mission constraints. This modular approach is well suited for complex mission architectures that conventional patched-conics methods cannot systematically uncover. Applied to a representative NEO population, the method yields a large ensemble of round-trip trajectories with low launch and return energies, broad temporal flexibility, and competitive rendezvous and departure impulses compared to existing 2BP solutions.
Read the full abstract

All authors Alessandro Beolchi, Mauro Pontani, Kathleen Howell, Chiara Pozzi, Sean Swei, Elena Fantino

Statistics Theory

The asymptotic effect of tuning parameters

Tuning parameters are parameters involved in an estimating procedure for the purpose of reducing the risk of some other estimator. Examples include the degree of penalization in penalized regression and likelihood problems, as well as the balance parameter in hybrid methods. Typically tuning parameters are set to the minimizers of some estimator of the risk, a step which introduces additional randomness and makes standard methodology inapplicable. We derive precise asymptotic theory for this situation. Our framework allows for smooth, but otherwise arbitrary, loss functions and for the risk to be estimated by cross-validation procedures. Results include consistency of the optimal estimator towards a well-defined quantity and asymptotic normality after proper scaling and centring. We give explicit forms and estimators for the limiting variance matrix and results sharply characterizing the distance from the training error to the cross-validated estimator of the risk.
Read the full abstract

Representation Theory

Classification of GVZ and Nested GVZ $p$-groups up to Order $p^6$

Let $G$ be a finite group and let $\Irr(G)$ denote the set of irreducible complex characters of $G$. For a normal subgroup $N \trianglelefteq G$ and $\chi \in \Irr(G)$, we say that $\chi$ is fully ramified over $N$ if $\chi(g)=0$ for all $g \in G \setminus N$. A group $G$ is said to be of central type if there exists $\chi \in \Irr(G)$ that is fully ramified over $Z(G)$. Motivated by this notion, an irreducible character $\chi \in \Irr(G)$ is called of central type if $\chi$ vanishes on $G \setminus Z(\chi)$, where \[ Z(\chi)=\{\, g \in G : |\chi(g)|=\chi(1) \,\} \] is the center of $\chi$. Groups in which every irreducible character is of central type are called GVZ-groups. Furthermore, a group $G$ is said to be nested if for all $\chi,\psi \in \Irr(G)$, either $Z(\chi)\subseteq Z(\psi)$ or $Z(\psi)\subseteq Z(\chi)$. It is known that a GVZ-group is nilpotent. In this article, we classify all GVZ and nested GVZ $p$-groups of order at most $p^6$, where $p$ is an odd prime.
Read the full abstract

Algebraic Geometry

Motivic counting of curves on split quintic del Pezzo surfaces

We prove the "all-the-heights” version of the Batyrev–Manin–Peyre conjecture for split quintic del Pezzo surfaces, both for counting rational points over global function fields in positive characteristic and for the motivic version over a general base field.

Operator Algebras

Operator Norm Bounds for Multi-leg Matrix Tensors and Applications to Random Matrix Theory

We study the extremal values of multi-leg traces of matrix tensors under operator norm constraints. A graphical representation gives upper and lower bounds expressed as powers of the common tensor-factor dimension. The lower bounds are attained by matrices that permute tensor factors and are exact within this family. We prove the bounds first for two tensor factors and then for an arbitrary number. Leaving some indices uncontracted produces matrices for which we obtain both moment and operator norm bounds; a single choice of coefficient matrices attains the lower bounds for every positive integer moment. We also obtain exact scalar and operator norm maxima in special cases with sufficiently many tensor factors sharing the same cyclic contraction. As an application, the operator norm bounds yield a uniform comparison between Ginibre products and their free circular counterparts with growing matrix coefficients.
Read the full abstract

Information Theory

A Weak Structural Form of Commutative Equivalence in Finite Codes

We investigate the structural relationship between prefix-free codes over the binary alphabet and a class of unlabeled rooted trees, which we call symmetric trees. We establish a canonical correspondence between prefix-free codes and symmetric trees, preserving not only the lengths of codewords but also some additional commutative structure. Using this correspondence, we provide a result related to the commutative equivalence conjecture. We show that for every code, there exists a prefix-free code such that, for each fixed word length, the sums of powers of two determined by the occurrences of a distinguished symbol are equal.
Read the full abstract

Combinatorics · Cross-listed from cs.DS

Exact Algorithms for Edge Deletion to Cactus

We study two related problems on simple, un-directed graphs: Edge Deletion to Cactus and Spanning Tree to Cactus. Edge Deletion to Cactus has been known to be NP-hard on general graphs at least since 1988. We show improved exact algorithms for the former and a polynomial time algorithm for the latter.
Read the full abstract

Numerical Analysis

Quasi-random splitting method for accurate and efficient multiphysics simulation

We propose a quasi-random operator splitting method for evolution equations driven by multiple mechanisms. The method uses a one-dimensional low-discrepancy sequence to determine the ordering of the subflows through a direct point-to-permutation construction, while applying each subflow exactly once per time step. Thus, for a decomposition into \(p\) operators, the proposed method requires only \(p\) subflow evaluations per step, compared with essentially \(2p-2\) evaluations for the classical multi-operator Strang splitting when \(p\geq 3\). In contrast to randomized splitting, the quasi-random ordering is deterministic once the underlying sequence is fixed and avoids the run-to-run fluctuations caused by random permutations. To analyze the resulting scheme, we develop a convergence framework that connects the discrepancy of the induced operator orderings with cancellation of the leading commutator errors accumulated over time. For an arbitrary fixed number of bounded linear operators, we establish a global error of order \(O(\tau^2\log N)\), equivalently \(O(\tau^2|\log\tau|)\) for fixed terminal time, which is essentially second order. We further extend the same cancellation mechanism to the nonlinear Allen–Cahn equation and obtain the same essentially second-order convergence behavior under suitable Sobolev regularity assumptions. Numerical experiments for bounded linear systems and the Allen–Cahn equation confirm the predicted convergence rates and show that the proposed quasi-random splitting strategy retains the low per-step computational cost of a Lie-type splitting method while achieving accuracy close to second order.
Read the full abstract

Numerical Analysis

Explicit relaxation Particle-in-Cell methods for Vlasov-Poisson equations with a strong magnetic field

In this work, we present a novel family of explicit relaxation Particle-in-Cell (ER-PIC) methods for the Vlasov-Poisson equation with a strong magnetic field. These schemes achieve exact energy conservation by combining a splitting framework with the dynamic updating of a relaxation parameter at each time step. Using an averaging technique, we rigorously establish second-order error bounds for the Strang-type ER-PIC method and uniform first order accuracy in position for the Lie-Trotter ER-PIC scheme. Numerical experiments across the fluid, finite Larmor radius, and diffusion regimes confirm the accuracy and energy conservation of our methods.
Read the full abstract

Group Theory

Automorphisms of a Free Centre-by-Centre-by-Metabelian Group of Rank 3

Let $F_{3}$ be the free group of rank $3$ and let $G_{3} = F_{3}/[F_{3}^{\prime\prime}, F_{3}, F_{3}]$, that is, $G_{3}$ is a free centre-by-centre-by-metabelian group of rank $3$. We show that ${\rm Aut}(G_{3})$ contains a proper finitely generated subgroup that is dense with respect to the formal power series topology.
Read the full abstract

Analysis of PDEs

Factorization method for a simply supported obstacle from point source measurements via far–field transformation

We consider an inverse shape problem for recovering an unknown simply supported obstacle in two dimensions from near–field point–source measurements for the biharmonic Helmholtz equation. The measured data consist of the scattered field and its Laplacian on a closed measurement curve surrounding the obstacle. By exploiting an operator splitting of the biharmonic operator, we decouple the scattered field into propagating and evanescent components. This decoupling allows us to reformulate the measured data in terms of an acoustic near–field operator for a sound–soft scatterer. Since the acoustic near–field operator does not directly admit the symmetric factorization required by the factorization method, we introduce a far–field transformation (defined independently of the obstacle) that augments the near–field operator into a far–field operator with a symmetric factorization. This yields a rigorous factorization method characterization of the obstacle and leads to a practical reconstruction algorithm based on spectral data of the transformed operator. Finally, we present numerical experiments with synthetic data that demonstrate stable reconstructions under noise and illustrate the role of regularization, including a variant that uses only the scattered field data.
Read the full abstract

Mathematical Physics

Waves within a network of slowly time-modulated interfaces: time-dependent effective properties, reciprocity and high-order dispersion

We consider wave propagation through a 1D periodic network of slowly time-modulated interfaces. Each interface is modelled by time-dependent spring-mass jump conditions, where mass and rigidity interface parameters are modulated in time. Low-frequency homogenisation yields a leading-order model described by an effective time-dependent wave equation, i.e.\ a wave equation with effective mass density and Young's modulus which are homogeneous in space but depend on time. This means that time-dependent bulk effective properties can be created by an array where only interfaces are modulated in time. The occurrence of k-gaps in case of a periodic modulation is also analysed. Second-order homogenisation is then performed and leads to an effective model which is reciprocal but encapsulates higher-order dispersive effects. These findings and the limitations of the models are illustrated through time-domain simulations.
Read the full abstract

All authors Michaël Darche, Raphaël Assier, Sébastien Guenneau, Bruno Lombard, Marie Touboul

Dynamical Systems

Multifractal aspects of $\alpha$-expansions

In \cite{[NE]} we introduce $\alpha$-expansions a real numbers in $(0,1]$, given by \[ \sum_{i=1}^{\infty}(\alpha-1)^{i-1}\alpha^{-(d_{1}+\dots+d_{i})}\] with $\alpha>1$ and $d_{i}\in\mathbb{N}$ and discuss ergodic theoretical and dimension theoretical aspects of this expansions. In this sequel we study mutifractal aspects of this expansions.
Read the full abstract

Information Theory

Sharper upper bounds for $q$-ary and constant-weight $B_2$ codes

We derive refined entropy upper bounds for $q$-ary $B_2$ codes by exploiting the Fourier structure of the i.i.d. difference distribution $D=X-Y$. Since the pmf of $D$ is an autocorrelation, its Fourier series is a nonnegative trigonometric polynomial of degree at most $q-1$. This leads to a natural convex relaxation over candidate difference distributions, equivalently expressible through an infinite family of positive semidefinite Toeplitz constraints. The resulting formulation admits a simple Gram interpretation and yields certified upper bounds through truncated semidefinite programs. Combined with the prefix-suffix method, this gives improved asymptotic rate upper bounds for $q$-ary $B_2$ codes; in particular, for $q\in\{9,10,11,12,13\}$ the resulting values improve on the best bounds known in the literature. We also study binary constant-weight $B_2$ codes. Extending the distance-distribution method of Cohen, Litsyn, and Zémor to the constant-weight setting, and combining it with Litsyn's asymptotic linear-programming bound for constant-weight codes, we derive a new upper bound on the constant-weight $B_2$ rate.
Read the full abstract

Analysis of PDEs

Radon Transform over Tensor Fields: Injectivity, Range, and Unique Continuation Principle

A central objective in inverse problems arising in integral geometry is to understand the kernel characterization, inversion formulas, stability estimates, range characterization, and unique continuation properties of integral transforms. In this paper, we study all these aspects for Radon transforms acting on symmetric $m$-tensor fields in $\mathbb{R}^n$. Our results show that these transforms admit a coherent analytic structure, extending several key features of the classical Radon transform and tensor ray transforms to a broader geometric setting.
Read the full abstract

Number Theory

Sharp Hausdorff Dimension Bounds for Sets with Bounded and Growing Digits in $N$-expansions

We establish sharp bounds for the Hausdorff dimension of sets of irrational numbers in $(0,1)$ whose digits in the $N$-expansion are either uniformly bounded or tend to infinity. For sets with digits bounded by an integer $M \ge N$, we obtain improved Jarník-type bounds that generalize and refine classical results for regular continued fractions, with explicit dependence on $N$ (Theorem~1.1). For sets with digits that grow without bound, we obtain precise asymptotics that extend Good's theorems to $N$-expansions, proving in particular that the set of numbers whose digits tend to infinity has Hausdorff dimension exactly $1/2$, and that the dimension of sets with uniformly large digits approaches $1/2$ as the lower bound increases, with explicit logarithmic decay (Theorem~1.2). The results reveal how the parameter $N$ influences the dimensional properties of these exceptional sets. Our methods combine careful estimates of fundamental interval lengths with optimized covering arguments for upper bounds and Cantor set constructions via mass distribution principles for lower bounds.
Read the full abstract

Functional Analysis

Weak supermajorization between symplectic spectra of positive definite matrix and its pinching

Let $A = \begin{bmatrix} E & F \\ F^T & G \end{bmatrix}$ be a $2n \times 2n$ real positive definite matrix, where $E, F,$ and $G$ are $n \times n$ blocks. It is shown that $\ d(E \oplus G) \prec^w d(A)$. Here $d(A)$ denotes the $n$-vector consisting of the symplectic eigenvalues of $A$ arranged in the non-decreasing order. We also observe the following weak supermajorization relation, which is interesting on its own: $ \lambda \left( \left(\mathscr{C}(G)^{1/2} \mathscr{C}(E) \mathscr{C}(G)^{1/2}\right)^{1/2} \right) \prec^w \lambda \left( \left(G^{1/2} E G^{1/2} \right)^{1/2} \right)$. Here $\lambda \left( \left( G^{1/2}E G^{1/2} \right)^{1/2} \right)$ denotes the $n$-vector with entries given by the eigenvalues of $\left( G^{1/2}E G^{1/2} \right)^{1/2}$ in the non-decreasing order.
Read the full abstract

Optimization and Control

Optimal resource allocation for maintaining system solvency

We study two optimal allocation problems for a system of independent Brownian agents whose states evolve under a limited shared control. At each time, a unit of resource can be divided and allocated across components to increase their drifts, with the objective of maximizing either (i) the probability that all components avoid ruin, or (ii) the expected number of components that avoid ruin. We identify drift thresholds separating trivial and nontrivial regimes, and derive the associated Hamilton-Jacobi-Bellman equations on the positive orthant with mixed boundary conditions at the absorbing boundary and at infinity. We also establish the existence, uniqueness, and regularity of a bounded classical solution and a verification theorem linking the PDE to the stochastic control value function. Finally, we prove a conjecture on the optimality of a socialistic allocation rule : the push-the-laggard strategy. It is optimal for the all-survive value function, while it is suboptimal for the count-survivors criterion.
Read the full abstract

Mathematical Physics · Cross-listed from gr-qc

$q$-Deformed Quantum Mechanics and the Thermodynamics of Black Hole/White Hole Spectral pair

In this work, we investigate the thermodynamics of Schwarzschild black and white holes within a $q$-deformed Wheeler–DeWitt framework. By introducing a $q$-deformed Heisenberg–Weyl algebra at a root of unity, we derive a finite-dimensional Hilbert space, a bounded mass spectrum, and an adiabatic invariant leading to a bounded entropy-mass relation. The deformation results in a universal logarithmic correction, as well as a minimum temperature and a maximum entropy that matches the de Sitter bound. Also, we examine the interpretation of a cold remnant, which is dynamically stable because its radiation rate approaches zero, even though its heat capacity remains negative. We also explore the holographic implications of this limited entropy. Our results thus provide a consistent semiclassical picture, where quantum deformation naturally introduces an entropy bound, avoids divergences at the final evaporation stage, and suggests a smooth transition from quantum gravity to cosmology.
Read the full abstract

Group Theory

The hypercenter of an algebraic group

We show that any connected algebraic group $G$ over a field admits a nilpotent normal subgroup $Z_\infty(G)$ such that the quotient $G/Z_\infty(G)$ has trivial center. We construct $Z_\infty(G)$ as the final term of the transfinitely extended upper central series of $G$; accordingly, we call it the hypercenter of $G$. We establish several related results about the upper central series of $G$, along with an analogue for algebraic groups of a well-known theorem of Fitting's.
Read the full abstract

Category Theory

Unitary, Inner product, and Dagger categories

This article provides an alternate characterization of dagger categories, which are central to the study of categorical quantum mechanics, in terms of inner product categories. An inner product category is an "achiral involutive" category with an inner product combinator. Inner product categories are, in turn, precisely the same as unitary categories, which are a weaker form of dagger categories. In unitary categories, there is an isomorphism between an object and its dagger, instead of the identity function as in the case of dagger categories. Every unitary category is equipped with a global inner product structure, which allows one to strictify the involutive structure on the unitary category to obtain a dagger category, making unitary categories 2-categorically equivalent to dagger categories. By regarding the inner product as an abstract metric on an (achiral) involutive category, one can define metric-preserving maps (isometries) in inner product categories, and also develop other notions of special maps – unitary, Hermitian, positive, and normal maps – in this setting.
Read the full abstract

Numerical Analysis · Cross-listed from cs.MS

High-Precision Computation and PSLQ Identification of Stokes Multipliers for Anharmonic Oscillators

We present a large-scale computational study combining arbitrary-precision arithmetic, sequence acceleration, and the PSLQ integer relation algorithm to discover exact closed-form expressions for fundamental constants arising in asymptotic analysis. We compute the Stokes multipliers C_M of the one-dimensional anharmonic oscillators H = p^2/2 + x^2/2 + g x^{2M} for M = 2, 3, ..., 11, extracting 17-30 significant digits from up to 1200 perturbation coefficients computed at 300-digit working precision. The computational pipeline consists of three stages: (i) Rayleigh-Schrodinger recursion in the harmonic oscillator basis, (ii) Richardson extrapolation of order 40-100 to accelerate convergence of ratio sequences, and (iii) PSLQ searches over bases of Gamma-function values and algebraic numbers. This pipeline discovers three new exact identities: C_3^2 pi^4 = 32, C_5^4 Gamma(1/4)^4 pi^5 = 2^{12} 3^2, and C_7^6 Gamma(1/3)^9 pi^6 = 2^{20} 3^3, in addition to confirming the known C_2^2 pi^3 = 6. Equally significant is a negative result: exhaustive PSLQ searches at 30-digit precision with coefficient bounds up to 2000 find no closed form for C_4, strongly suggesting the x^8 case introduces a genuinely new transcendental number. A number-theoretic pattern emerges: closed-form existence correlates with Euler's totient function phi(M-1)/2, which counts algebraically independent Gamma-function transcendentals at denominator M-1. We formulate conjectures connecting computational constant recognition to classical number theory, and provide all code and data for full reproducibility.
Read the full abstract

Logic

A note on existentially t-henselian fields

A field is existentially t-henselian if it is has the same existential theory in the first-order language of rings as a field that admits a nontrivial henselian valuation. This property turns out to be equivalent to $\mathbb{Z}$-largeness, which is a property identified in previous work with Fehm, and which holds for $F$ if and only if $tF[\![t]\!]$ is not Diophantine in $F(\!(t)\!)$, without extra constants. In this short note, we further investigate this property in order to count the number of existential theories of henselian valuations on a given field, and to find other characterizations of existential t-henselianity.
Read the full abstract

Number Theory

Monodromy groups of polynomials of composition length 2

We study the monodromy groups of compositions of two indecomposable polynomials. In particular, we show that such monodromy groups either fulfill a certain “largeness" property, or belong to an explicit list of exceptions. Such largeness results are crucial for dealing with compositions of more than two polynomials, and consequently are expected to have a wide range of applications to problems concerning the arithmetic of polynomials and arithmetic dynamics. In particular, our main result is a key ingredient in the solution of a long-standing open problem due to Davenport, Lewis and Schinzel, achieved in a companion paper.
Read the full abstract

Analysis of PDEs

Stability of a Korteweg–de Vries equation close to critical lengths

In this paper, we investigate the quantitative exponential stability of the Korteweg-de Vries equation on a finite interval with its length close to the critical set. Sharp decay estimates are obtained via a constructive PDE control framework. We first introduce a novel transition-stabilization approach, combining the Lebeau–Robbiano strategy with the moment method, to establish constructive null controllability for the KdV equation. This approach is then coupled with precise spectral analysis and invariant manifold theory to characterize the asymptotic behavior of the decay rate as the length of the interval approaches the set of critical lengths. Building on our classification of the critical lengths, we show that the KdV equation exhibits distinct asymptotic behaviors in neighborhoods of different types of critical lengths.
Read the full abstract