Number Theory
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
Sunday 22 February
We establish a novel framework for bounding the adapted power gain $G_p$ and approximation gain $G_a$ of coprime integer solutions to the generalized diagonal superelliptic equation $By^n = Ax^n + k$ with $x, y \ge 2$. By first deriving a purely structural lower bound for $G_a$, we demonstrate that these equations are inherently predisposed to high ABC-qualities ($q = G_a \cdot G_p$). Combined with the Strong ABC conjecture ($q < q_{max}$), we prove that the power gain is uniformly bounded by $G_p < q_{max}/G_{a,min}$, providing a theoretical foundation for the numerical observation $G_p < 3$ for $n=2$ under the Ultra-Strong conjecture ($q < 1.5$). Specifically, we show that for $k=1$, the structural density forces $q > n/2$, which excludes solutions for $n \ge 4$ under $q < 2$. We validate our theoretical bounds using high-quality ABC triples, specifically analyzing the Reyssat (1987), de Weger (1985), and Nitaj (1993) cases to demonstrate the sharpness of the structural approximation gain.
Probability
Hydrodynamic limit for Glauber-Kawasaki dynamics on the Sierpiński gasket
We prove the hydrodynamic limit for Glauber-Kawasaki dynamics on the Sierpiński gasket, a prototypical fractal graph that lacks translational invariance. The main novelty lies in incorporating Glauber dynamics, allowing for particle creation and annihilation with birth-death rates depending locally on the particle configuration. In the macroscopic limit, the particle density evolves according to a nonlinear reaction–diffusion equation, where the reaction term is explicitly determined by the microscopic rates. The key new ingredient is a replacement lemma adapted to the fractal geometry of the Sierpiński gasket. We establish this lemma by deriving 1-block and 2-blocks estimates on the Sierpiński gasket graph, which require new arguments due to the absence of classical lattice structures.
Read the full abstract
Information Theory · Cross-listed from quant-ph
Structural Analysis of Directional qLDPC Codes
Directional codes, recently introduced by Gehér–Byfield–Ruban \cite{Geher2025Directional}, constitute a hardware-motivated family of quantum low-density parity-check (qLDPC) codes. These codes are defined by stabilizers measured by ancilla qubits executing a fixed direction word (route) on square- or hex-grid connectivity. In this work, we develop a comprehensive word-first analysis framework for route-generated, translation-invariant CSS codes on rectangular tori. Under this framework, a direction word $W$ deterministically induces a finite support pattern $P(W)$, from which we analytically derive: (i)~a closed-form route-to-support map; (ii)~the odd-multiplicity difference lattice $L(W)$ that classifies commutation-compatible $X/Z$ layouts; and (iii)~conservative finite-torus admissibility criteria. Furthermore, we provide: (iv)~a rigorous word equivalence and canonicalization theory (incorporating dihedral lattice symmetries, reversal/inversion, and cyclic shifts) to enable symmetry-quotiented searches; (v)~an “inverse problem” criterion to determine when a translation-invariant support pattern is realizable by a single route, including reconstruction and non-realizability certificates; and (vi)~a quasi-cyclic (group-algebra) reduction for row-periodic layouts that explains the sensitivity of code dimension $k$ to boundary conditions. As a case study, we analyze the word $W=\texttt{NE$^2$NE$^2$N}$ end-to-end. We provide explicit stabilizer dependencies, commuting-operator motifs, and an exact criterion for dimension collapse on thin rectangles: for $(L_x, L_y) = (2d, d)$ with row alternation, we find $k=4$ if $6 \mid d$, and $k=0$ otherwise.
Read the full abstract
Logic
Affine logic with the integration operator
Affine continuous logic is extended to affine integration logic. Affine compactness theorem is proved by both the ultramean construction and Henkin's method. Also, a proof system and a completeness theorem are given. An appropriate variant of the Keisler-Shelah isomorphism theorem holds in this setting. This helps us to characterize non-forking extensions in affine stable theories by means of the notion of elementary embedding in the expanded logic.
Read the full abstract
Analysis of PDEs
Symmetry and Approximate Symmetry for Solutions of Mixed Local-Nonlocal Singular Equations
In this article, we establish radial symmetry for positive weak solutions of a class of mixed local-nonlocal equations with possibly singular nonlinearity via the moving plane method. Furthermore, we provide a quantitative version of Gidas-Ni-Nirenberg type theorem for mixed local-nonlocal equations. In this regard, we establish a weak Harnack-type inequality and an analogue of the Alexandroff-Bakelman-Pucci inequality in the mixed nonhomogeneous setting with a lower order term, which appear to be new. To the best of our knowledge, this paper initiates the study of the quantitative properties of solutions to mixed problems.
Read the full abstract
Optimization and Control
New reformulations for 0-1 quadratic programming problem using quadratic nonconvex reformulation techniques and valid inequalities
It is well-known that the quadratic convex reformulation (QCR) technique can speed up some general-purpose solvers such as CPLEX and Gurobi. Recently, the method of quadratic nonconvex reformulation (QNR) was proposed, which provides an alternative way for accelerating a solver via reformulation technique. This paper proposes several new reformulations for 0-1 quadratic programming problems using the QNR technique. Such a technique provides more flexibility in adding nonconvex quadratic constraints into the problem formulation, so that some valid inequalities, such as the triangle inequalities, can be incorporated into the formulation to tighten the lower bound of the problem. We analyze the effects of the proposed reformulations on the lower bounds implemented in the solver, and propose some methods to maximize the McCormick relaxation bounds of the reformulations. Our numerical experiments compare the proposed reformulations with the existing quadratic convex reformulations, showing the effectiveness of the proposed reformulations on 0-1 quadratic programming problems.
Read the full abstract
Numerical Analysis
On the convergence of explicit formulas for $L^2$ solutions to the Benjamin-Ono and continuum Calogero-Moser equations
By developing discrete counterparts to recent advances in nonlinear integrability, and in particular to the discovery of explicit formulas, we design and analyze fully-discrete approximations to the Benjamin-Ono (BO) and continuum Calogero-Moser (CCM) equations on the torus. We build on the key observation that discretizing such explicit formulas yields schemes that are exact in time (requiring only spatial discretization) and have a computational cost independent of the final time $T$. In this work, we first generalize the fully-discrete schemes of arXiv:2412.13480 to include numerical approximations with better structure preservation properties, including the conservation of mass and momentum in the case of the (BO) equation. Secondly, building on recent analyses of the corresponding Lax operators, we extend the convergence results to this class of schemes for rough solutions $u(t)$ merely belonging to $L^2(\mathbb{T})$ for (BO) and $L^2_{+}(\mathbb{T})$ for (CCM), the latter of which is precisely the scaling-critical regularity. Our main theorem states that the $L^2(\mathbb{T})$-norm of the error goes to zero as the truncation parameters go to infinity, uniformly on any bounded time interval $[-T,T]$. As an example, we apply our scheme to the (BO) equation with a square-wave initial profile, and obtain the first numerical evidence of the Talbot effect for (BO) supported by a rigorous convergence result.
Read the full abstract
Analysis of PDEs
Convergence analysis of a semi-implicit time discretization for the doubly degenerate Richards equation
A key contribution of this work is the derivation of convergence results for the semi-implicit time discretization in the general doubly degenerate setting. This paper presents a mathematical analysis of a doubly degenerate parabolic equation and its application to the Richards equation using a bounded auxiliary variable. We establish the existence of weak solutions using a semi-implicit time discretization combined with maximal monotone operator theory. The analysis is conducted within weighted Sobolev spaces, allowing for a rigorous treatment of the equation's strict degeneracy and strong nonlinearities. Unlike previous works that often rely on strict parabolicity or high regularity, we establish these results without imposing strictly positive lower bounds on the diffusivity. Furthermore, we prove that the Richards equation using the introduced auxiliary variable preserves the physical bounds of the saturation and demonstrate the unconditional linear convergence of the L-scheme linearization to the semi-discrete solution.
Read the full abstract
Differential Geometry
E8 bundles and some new anomaly cancellation formulas
Using $E_8$ bundles, we construct some new modular forms over $SL(2,{\bf Z})$, $\Gamma^0(2)$ and $\Gamma_0(2)$ and get some new anomaly cancellation formulas of characteristic forms which generalize some anomaly cancellation formulas in [13].
Dynamical Systems · Cross-listed from nlin.AO
Analytical characterization of self sustained nonlinear oscillators modelling human walking and bouncing
Researchers have developed hybrid Van der Pol Rayleigh Duffing type oscillators to model human induced forces; however, their analytical framework has largely relied on the Lindstedt Poincare perturbation method, energy balance approaches, and harmonic balance techniques. This paper aims to apply new mathematical tools to these existing models and address potential research gaps. An analytical proof for the stability of the limit cycle has been formulated by using the Krylov Bogolyubov perturbation method. The multiple scales method has been modified to highlight an iterative algorithm for determining the order of approximation required to capture nonlinear effects. The describing function method is utilised to formulate an alternate amplitude. Comparisons between first order amplitudes obtained from perturbation analysis and the describing function formulations reveal conditions under which the two approaches converge. These conditions are exploited to formulate additional constraints for the estimation of model parameters, offering a systematic alternative to purely optimisation based approaches.
Read the full abstract
Representation Theory
Serre duality, Mukai pairing and universal Auslander–Reiten triangle
We study the relationship between Serre duality and the Mukai pairing for smooth and proper dg-algebras. We introduce an alternative definition of the Mukai pairing and prove that it coincides with the Mukai pairings defined by Căldăraru–Willerton and by Shklyarov. Our construction places both the Mukai pairing and Serre duality within a unified framework based on an elementary pairing between Hochschild homology and Hochschild cohomology. As a consequence, the adjointness of the boundary–bulk and bulk–boundary maps follows naturally. As an application, we investigate Auslander–Reiten theory for the perfect derived category of a non-positive smooth and proper dg-algebra. We construct an exact triangle of dg-$A$-$A$-bimodules, called a universal Auslander–Reiten triangle in the sense that the derived tensor product of this triangle with an indecomposable dg-$A$-module $M$ yields an Auslander–Reiten triangle starting from $M$. In particular, this provides a functorial construction of Auslander–Reiten triangles. In the case of path algebras of quivers, our construction recovers the universal Auslander–Reiten triangle associated with quiver Heisenberg algebras.
Read the full abstract
Combinatorics
Kneser- and Jin-type inverse theorems in discrete abelian groups
We characterize the pairs of sets $A, B$ in an arbitrary (countable or uncountable) discrete abelian group $\Gamma$ satisfying $\tilde{m}(A+B)<\tilde{m}(A)+\tilde{m}(B)$, where $\tilde{m}$ is an arbitrary finitely additive translation-invariant probability measure on $\Gamma$, extending M.~Kneser's theorem on Haar measure in compact abelian groups. We then characterize, for an arbitrary Følner sequence or Følner net $\mathbf F=(F_{i})_{i\in I}$ on $\Gamma$, those $A$, $B$ satisfying $\underline{d}_{\mathbf F}(A+B)<\underline{d}_{\mathbf F}(A)+\underline{d}_{\mathbf F}(B)$, where $\underline{d}_{\mathbf F}(C):=\liminf_{i\in I} |C\cap F_{i}|/|F_{i}|$. This extends Kneser's theorem on lower asymptotic density in $\mathbb N$. We also generalize theorems of Prerna Bihani and Renling Jin by characterizing pairs $A$, $B$ satisfying $d^{*}(A+B)<d^{*}(A)+d^{*}(B)$, where $d^{*}$ is upper Banach density on $\Gamma$.
Read the full abstract
Probability
Limit Theory of the Multi-set Allocation Occupancy (MAO) Distribution: Normal and Poisson Approximations via MAO Norm
This paper investigates the asymptotic behavior of the Multi-set Allocation Occupancy (MAO) distribution, which models the count vector $X=(X_{=0},\ldots,X_{=T})$ from $T$ independent rounds of sampling without replacement of size $m$ from $N$ individuals. Focusing on $X_{=t}$ (individuals in exactly $t$ subsets) and employing the MAO norm – a combinatorial tool yielding closed-form factorial moments – we derive the exact marginal distribution of a single individual as $\mathrm{Bin}(T,p)$ with $p=m/N$. Using the MAO norm, we prove that for any fixed number of distinct individuals, their joint distribution differs from the product of marginals by $O(1/N)$, establishing the weak dependence required for limit theorems. Based on these findings, we delineate two asymptotic regimes: 1. Normal approximation: When $N\to\infty$ with $p=m/N$ fixed, $X_{=t}$ obeys a central limit theorem and can be approximated by a normal distribution with mean $N\pi_t$ and variance obtained from the MAO norm, where $\pi_t = \binom{T}{t} p^t (1-p)^{T-t}$.2. Poisson approximation: When the expected value $\lambda_N := N\pi_t \to 0$, $X_{=t}$ converges in distribution to $\mathrm{Poisson}(\lambda)$. By symmetry, if $\lambda_N \to N$, then $N-X_{=t}$ converges to a Poisson distribution. All theoretical results are rigorously proved via moment methods and are corroborated by extensive numerical simulations, which further demonstrate that the approximations remain valid even when the subset sizes are not equal. The MAO norm thus emerges as a unifying tool that connects the exact combinatorial structure of the model to its asymptotic theory. These findings offer clear guidance for choosing the appropriate approximation in practical applications, and they open the door to using the MAO distribution as a null model for detecting non random aggregation in fields as diverse as ecology, sociology, and statistical physics.
Read the full abstract
Logic
Compactness in Constructive Mathematics via Affine Logic
We study topology, particularly compactness, as an extension of Shulman's work on constructive mathematics via affine logic, while allowing propositional impredicativity. We introduce a notion of compactness in affine logic and prove the fundamental properties of compactness, including the extreme value theorem and the Heine-Borel theorem for 'cuts', which are a version of Dedekind cuts in affine logic. Moreover, from the antithesis translation of the Heine-Borel theorem for cuts to intuitionistic logic, we derive the Heine-Borel theorem for one-sided reals intuitionistically, and have verified the proof with an interactive theorem prover. The code is available at https://github.com/hziwara/CutsHeineBorel.
Read the full abstract
Combinatorics
The Strong Spectral Property and the Jacobian Method for Weighted Laplacian Matrices
Strong matrix properties, roughly speaking, refer to generic conditions on a matrix such that its spectral perturbation and pattern perturbation interact nicely to cover a neighborhood in the ambient space. With a rich history, these strong properties originate from various fields, including the inverse eigenvalue problem, the sign pattern problem, and structural graph theory. In this paper, we introduce a new strong property, the strong spectral property for weighted Laplacian matrices (SSPWL), and establish the corresponding Supergraph and Bifurcation lemmas. Instead of the space of symmetric matrices, the SSPWL considers the ambient space spanned by all weighted Laplacian matrices. Moreover, we provide a detailed study comparing the Jacobian Method and some strong properties, leading to a full understanding between these two techniques used in different problems. Using these tools, we identify the potential boundaries of the spectral regions of weighted Laplacian matrices associated with connected graphs on $4$ vertices, extending the analysis from the previous work [S. M. Fallat, H. Gupta, and J. C.-H. Lin. Inverse eigenvalue problem for Laplacian matrices of a graph. SIAM J. Matrix Anal. Appl., 46:1866–1886, 2025]. In addition, this analysis can be used to identify the absolute algebraic connectivity of such small ordered graphs, and we establish the existence of strong weighted Laplacian matrices for several graph families.
Read the full abstract
Optimization and Control · Cross-listed from stat.ML
Implicit Bias and Convergence of Matrix Stochastic Mirror Descent
We investigate Stochastic Mirror Descent (SMD) with matrix parameters and vector-valued predictions, a framework relevant to multi-class classification and matrix completion problems. Focusing on the overparameterized regime, where the total number of parameters exceeds the number of training samples, we prove that SMD with matrix mirror functions $\psi(\cdot)$ converges exponentially to a global interpolator. Furthermore, we generalize classical implicit bias results of vector SMD by demonstrating that the matrix SMD algorithm converges to the unique solution minimizing the Bregman divergence induced by $\psi(\cdot)$ from initialization subject to interpolating the data. These findings reveal how matrix mirror maps dictate inductive bias in high-dimensional, multi-output problems.
Read the full abstract
Optimization and Control
Effective Second-Harmonic Generation Coefficient and C-eigenvalue of Nonlinear Susceptibility Tensors
The effective second-harmonic generation (SHG) coefficient is a crucial data that quantifies the efficiency of transforming fundamental frequency light into its second harmonic. With the help of the symmetry of nonlinear optical susceptibility tensors, we mainly discuss the computability of such a effective SHG coefficient in uniaxial crystals. For one thing, the calculation of effective SHG coefficient is converted into the optimization models with some geometric constraints by means of the peculiarity of fundamental frequency light. Secondly, the number of variables of such maximum models are cutted in half to $2$ to calculate it easier, and a comparison between the effective SHG coefficient and C-eigenvalue of susceptibility tensor is given also. Finally, some examples of typical crystal classes are presented to verify the correctness and broader applicabilities of the theoretical results.
Read the full abstract
Saturday 21 February
Dynamical Systems
Chirality and Racemization on Isotopy Classes of Quasigroups
We develop a structural and dynamical theory of chirality for quasigroups formulated at the level of isotopy classes. Interpreting isotopy as a gauge symmetry of re-coordinatization and mirror parastrophy as handedness reversal, we introduce a gauge-invariant continuous-time two-state Markov model in which transitions occur only between a quasigroup and its mirror. We prove that this dynamics descends to the isotopy quotient, yielding a reduced generator governed by a single class-dependent rate $k([Q])$. Symmetric mirror transitions lead to convergence toward a racemic equilibrium, whereas the vanishing condition $k([Q])=0$ characterizes dynamical chiral stability. By restricting admissible transitions to those generated by intrinsic symmetries, we show that $k([Q])=0$ is equivalent to the absence of mirror-isotopisms. A concrete example of order $7$ demonstrates the existence of structurally chiral quasigroup classes.
Read the full abstract
General Mathematics
Asymptotic zero distribution of the polynomials $\widetilde{\Xi}_n$
We consider the polynomials $\Xi_n$ introduced in~\cite{TallaWaffo2025arxiv2511.02843} and studied in further details in\cite{TallaWaffo2026arxiv2602.16761}, which are expressed in terms of Eulerian polynomials of type~B, and study the zero distribution of the rescaled family \[ \widetilde{\Xi}_n(x) := \Xi_n(\sqrt{x}), \qquad n\ge 2. \] Writing the zeros of $\widetilde{\Xi}_n$ in the interval $(0,1)$ as $0< x_{n,1} \le \cdots \le x_{n,n-1} < 1$ and forming the empirical measures \[ \mu_n := \frac1{n-1}\sum_{k=1}^{n-1}\delta_{x_{n,k}}, \] we prove that $(\mu_n)_{n\ge2}$ converges weakly to a deterministic probability measure $\mu$ supported on $(0,1)$. We give an explicit formula for the limiting density and the limiting distribution function of~$\mu$. The proof is based on a representation of $\Xi_n$ in terms of type~B Eulerian polynomials, a ratio asymptotic for these polynomials derived from a classical series identity, and the Stieltjes transform method. We also provide numerical experiments illustrating the convergence of the empirical zero distributions to~$\mu$.
Read the full abstract
Number Theory
Algebraic Characterizations of Angle Multisections over Rings
Let $n,$ $m \geq 2$ be integers, and let $R$ be a subring of $\mathbb R$ with field of fractions $F.$ In this article, we generalize the rational angle bisection problem previously proposed by the author to the following problem: which linearly independent vectors $\boldsymbol{a},$ $\boldsymbol{b} \in R^n$ form an angle with a sequence of $m$-sector vectors lying in $R^n$? When $\boldsymbol{a}$ and $\boldsymbol{b}$ are nonorthogonal, we prove that this condition is equivalent to the existence of a root in $F$ of a certain $m$-th degree polynomial over $R.$ In particular, when $R = \mathbb Z,$ the condition holds if and only if the polynomial has a root among the divisors of its constant term. When $m = 2^e$ with an integer $e \geq 1,$ we also prove that the condition is equivalent to $\cos (\theta /2^{e-1}) \in F,$ where $\theta$ is the angle between $\boldsymbol{a}$ and $\boldsymbol{b}.$
Read the full abstract
General Mathematics
Mathematical Modeling in the Textile Industry
A mathematical model, describing some different weaving structures, is made in this article. The terms self-mirror and rotation-stable weaving structure are initiated here. There are used the properties and operations in the set of the binary matrices and an equivalence relation in this set. Some combinatorial problems about finding the cardinal number and the elements of the factor set according to this relation is discussed. We propose an algorithm, which solves these problems. The presentation of an arbitrary binary matrix using sequence of nonnegative integers is discussed. It is shown that the presentation of binary matrices using ordered n-tuples of natural numbers makes the algorithms faster and saves a lot of memory. Implementing these ideas a computer program, which receives all of the examined objects, is created. In the paper we use object-oriented programming using the syntax and the semantic of C++ programming language. Some advantages in the use of bitwise operations are shown. The results we have received are used to describe the topology of the different weaving structures.
Read the full abstract
Number Theory
Modularity of a certain "rank-2 attractor" Calabi-Yau threefold
We attempt to prove that the 4-dimensional Galois representations associated with a certain Calabi-Yau threefold are reducible, with 2-dimensional composition factors coming from specific modular forms of weights 2 and 4, both level 14. This was essentially conjectured by Meyer and Verrill. It was revisited in its present form by Candelas, de la Ossa, Elmi and van Straten, whose computations of Euler factors in a whole pencil of Calabi-Yau threefolds highlighted this fibre as one of three overwhelmingly likely to be “rank-2 attractors”. Unfortunately there is an error in Section 7.
Read the full abstract
Information Theory · Cross-listed from quant-ph
A Symplectic Proof of the Quantum Singleton Bound
We present a symplectic linear-algebraic proof of the Quantum Singleton Bound for stabiliser quantum error-correcting codes together with a Lean4 formalisation of the linear-algebraic argument. The proof is formulated in the language of finite-dimensional symplectic vector spaces modelling Pauli operators and relies on distance-based erasure correctability and the cleaning lemma. Using a dimension-counting argument within the symplectic stabiliser framework, we derive the bound $k + 2(d-1) \le n$ for any $[[n, k, d]]$ stabiliser code. This approach isolates the algebraic structure underlying the bound and avoids the heavier analytic machinery that appears in entropy-based proofs, while remaining well-suited to formal verification.
Read the full abstract
General Mathematics
On the Failure of Step-Response Tests to Certify Admissibility of Spectral Averaging Operators
We study translation-invariant smoothing operators on finite cyclic groups Z/NZ, expressed as periodic convolutions and analyzed via the discrete Fourier transform on Z/NZ. Step responses are widely used as a practical diagnostic for whether a smoothing operator preserves bounded ranges, for example whether it maps signals in [0,1]^N back into [0,1]^N. We show step-based diagnostics can be fundamentally misleading for periodic convolution operators. First, we give a sharp characterization: a constant-preserving periodic convolution maps [0,1]^N into [0,1]^N if and only if its convolution kernel is componentwise nonnegative, equivalently each row of the associated matrix is a probability vector. The proof is constructive and yields worst-case witnesses in {0,1}^N together with certified lower bounds on the magnitude of boundedness violation. We then analyze three standard Fourier-domain averaging constructions, Fejer (Cesàro) averaging, sharp spectral truncation, and a signed spectral control, and demonstrate a Nyquist-adjacent blind spot: at cutoff K = Nyquist - 1, the canonical step can exhibit essentially zero overshoot while the operator remains strongly non-admissible, with explicit binary inputs yielding outputs below 0 and above 1. Reproducible artifacts and a self-contained demo are provided.
Read the full abstract
Analysis of PDEs
A generalized Helmholtz-type decomposition of symmetric tensor fields and applications to ray transforms
We study a solenoidal-potential type decomposition of a symmetric $m$-tensor field in $\Rb^2$, and its implications to injectivity questions for the momentum and elastic ray transforms. For symmetric tensor fields, a general decomposition with a restriction on the dimension and order of the decomposition was proved in [16]. We extend the result to dimension $2$ under a mean-zero assumption. We use the decomposition in $2$ dimensions to prove the injectivity of the momentum and elastic ray transforms. We also prove a connection between the two integral transforms for $2$-tensors. Later, we use our decomposition to prove the injectivity of integral transforms, including longitudinal and elastic ray transforms, without any mean-zero assumption on tensor fields. Next, we explore connections between different integral transforms and use these to relate their corresponding properties.
Read the full abstract
Probability
An Erd\H os Rényi Law for the Longest Consecutive Monotone Block in a Random Permutation
The Erd\H os-Rényi law states that given a sequence $\{X_j\}_{j=1}^\infty$ of i.i.d.~($p$) coin-tosses, the longest run $L_n$ of heads in the first $n$ coin tosses approaches $\log_{1/p}n$ almost surely. In this paper we explore a formulation of this result in the case of random permutations and prove an Erd\H os-Rényi law for the longest consecutive monotone block in a random permutation.
Read the full abstract
Algebraic Geometry
Klein coverings over hyperelliptic genus 3 curves
We characterize the moduli space of étale Klein coverings (i.e. Galois with deck group $\mathbb{Z}_2^2$) of hyperelliptic curves of genus 3. We prove that the Prym map on each component is injective. As an application, we show that the Prym map of étale Klein coverings of genus 3 curves is generically finite.
Read the full abstract
Statistics Theory · Cross-listed from stat.ME
Structure-Adaptive Estimation of Heterogeneous Treatment Effects with Kernel Methods
We study conditional average treatment effect (CATE) estimation from observational data in regimes with potentially weak overlap, when the nuisance response functions lie in a reproducing kernel Hilbert space (RKHS), but the contrast function is structurally simpler. We consider three forms of such simplicity: (i) membership in a lower-complexity RKHS with faster eigenvalue decay, (ii) a source condition relative to the nuisance kernel, or (iii) dependence on a known low-dimensional covariate representation. We develop a unified two-stage kernel ridge regression procedure that remains valid under weak overlap and attains minimax rates determined by the complexity of the contrast function. The procedure avoids propensity-score estimation and separate nuisance convergence-rate assumptions. We also show that a simple model-selection step over candidate contrast spaces and regularization levels satisfies an oracle inequality, enabling adaptation to unknown CATE regularity.
Read the full abstract
Probability
Estimates on Escape Times for the Elephant Random Walk
We study the gambler's ruin problem for the Elephant Random Walk, focusing on escape time from a symmetric interval of the form $\{-N, \ldots, N\}$. As our main result, we derive tight exponential bounds for the tail of this escape time. We then illustrate the usefulness of such bounds by proving that, in the diffusive regime, the Elephant's average behavior mirrors that of the traditional symmetric random walk: the expected escape time grows quadratically with $N$.
Read the full abstract
Numerical Analysis
Efficient computation of the singular value decomposition with linear photonic circuits
In light of today's massive data processing, digital computers are reaching fundamental performance limits due to physical limitations and energy consumption. For specific applications, tailored analog systems offer promising alternatives to digital processors. In this work, we investigate the potential of linear photonic chips for accelerating the computation of the singular value decomposition (SVD) of a matrix. The SVD is a key primitive in linear algebra and forms a crucial component of various modern data processing algorithms. Our main insights are twofold: first, hybrid systems of digital controller and photonic chip asymptotically perform on par with large-scale CPU/GPU systems in terms of runtime. Second, such hybrid systems clearly outperform digital systems in terms of energy consumption.