Peer Revenue Past citations are no guarantee of future returns

Papers

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

Mathematics

math Watch Mathematics (sign in to use)

Sunday 10 May

Differential Geometry

Prescribed Angle Surfaces Associated with Torse-Forming Vector Fields in Riemannian Manifolds

In this paper, we introduce the notion of a prescribed angle hypersurface in a Riemannian manifold associated with a pair $(\mathcal{V},\theta)$, where $\mathcal{V}$ is a unit vector field along the hypersurface and $\theta$ denotes the angle between $\mathcal{V}$ and the unit normal vector field of the hypersurface. We study such hypersurfaces in case $\mathcal{V}$ is a torse-forming vector field. In the particular $3$-dimensional case, we determine the intrinsic and extrinsic curvatures of these hypersurfaces in terms of the prescribed angle and the potential function of $\mathcal{V}$. Using this, we classify prescribed angle surfaces under suitable assumptions.
Read the full abstract

Optimization and Control

Phases of Muon: When Muon Eclipses SignSGD

Muon and related spectral optimizers have recently demonstrated strong empirical performance as scalable stochastic methods, often outperforming Adam. Yet their behavior remains poorly understood. We analyze stochastic Muon, which orthogonalizes an exponential moving average of minibatch gradients, on a high-dimensional matrix-valued least squares problem, and we compare it with stochastic SignSGD, a simple baseline comparable to Adam. We derive explicit deterministic dynamics that provide a tractable framework for studying learning behavior. We show that Muon has non-linear sensitivity to the effective batch $B_{\rm eff}=B(1+\beta)/(1-\beta)$. With exact whitening and small $B_{\rm eff}$ Muon fails to resolve smaller eigenmodes, slowing down convergence. Momentum and finite Newton–Shulz iterations can act as a ridge which lessen this effect. This behavior is in contrast with SignSGD which has no transition, leading to different optimal learning rates, but with matching convergence rate up to a constant factor in the isotropic setting. For anisotropic data, large batch setting Muon performs a square-root preconditioning with respect to the data covariance spectrum while SignSGD provides no preconditioning for generic covariances. We analyze time to target loss in a power law covariance model and derive a phase diagram in the data exponent $\alpha$ and target exponent $\zeta$. Muon is favored for steep covariance spectra with rich targets ($\alpha>2$, $\zeta<\alpha+1$), SignSGD is favored for flat spectra ($\alpha<1$), and in other regions the winner depends on how the target loss scales with dimension. Our results shed light on why replacing Adam with Muon is not trivial even from a pure optimization perspective.
Read the full abstract

All authors Elliot Paquette, Noah Marshall, Lucas Benigni, Guangyuan Wang, Atish Agarwala, Courtney Paquette

Optimization and Control

Diagnostic Certificates of Data Quality and Regression Identifiability for Koopman Identification

Classical persistent excitation criteria usually assess whether an input or regressor signal is sufficiently rich. In Koopman and EDMD with control (EDMDc), however, data quality is determined by the concatenation of lifted state features and control inputs. Input-rich data can still visit a narrow state region, well-spread state samples can still produce degenerate lifted features, and both can fail to condition the final regression problem. This paper develops a diagnostic certificate framework for locating these failures. The certificates separate state-space coverage and clustering, lifted-feature nondegeneracy, and the final regression spectrum. The regression-spectrum certificate is the layer with direct theoretical guarantees: it controls the active standardized design's smallest singular value, has Fisher-information and one-step EDMDc stability interpretations, and admits a finite-sample lower bound under a population spectral gap. We also give structural examples and a Schur-complement condition showing why state, lifted, input, and regression diagnostics cannot be substituted for one another. As a sampling example, IGPE-DOPT uses these certificates to score candidate trajectory segments. Experiments on Duffing, Van der Pol, and Lorenz systems compare input-, state-, lifted-, and regression-oriented baselines. The results show that certificate layers separate, budget and weights shift bottlenecks, and downstream prediction or control performance is not monotone in any single certificate. The framework is therefore intended as an interpretable diagnostic and data-collection guide, not as a universal optimality claim.
Read the full abstract

Combinatorics

New Extremal Ranges and Constructions of the Erdős–Kleitman Problem

For integers $n\ge s\ge2$, let $e(n,s)$ denote the maximum size of a family $\mathcal F\subseteq2^{[n]}$ with no $s$ pairwise disjoint members. The problem of determining $e(n,s)$, now called the Erdős–Kleitman problem, is the non-uniform analogue of the Erdős matching conjecture. We prove that for every fixed $m\ge3$, there exist constants $\beta_m$ and $\delta_m$ such that for sufficiently large $s$, the extremal families for $e(ms+c,s)$ are \[ \mathcal P'(m,s,\ell;L'):=\binom{L'}m\cup\binom{[ms+c]}{\ge m+1} \] for some $L'$ with $\ell=s-c$ and $|L'|=m\ell-1$, when $\beta_m s^{(m-1)/m}\le c\le \delta_m s$. This determines the extremal families in an unknown range when $\ell$ is large, complementing our earlier work on the range when $\ell$ is small. Moreover, for $m=3$, we sharpen this to the asymptotically optimal range. Let \[ t(s)=\frac{17-18s+\sqrt{49-852s+1284s^2}}{20}=0.8916\cdots s+O(1) \] We prove that \(\mathcal P'(3,s,\ell;L')\) is the unique extremal family when $t(s)<\ell<s-((4/3)^{1/3}+o(1))s^{2/3}$. Note that the lower bound \(t(s)\) of $\ell$ is exact, while the the constant \((4/3)^{1/3}\) in the upper bound of $\ell$ is best possible. Kupavskii and Sokolov introduced four candidate extremal families and conjectured that the value of $e(n,s)$ is the maximum of their sizes. We disprove this conjecture by constructing a new family $\mathcal R(m,s,\ell)$ that is larger than each of their four proposed candidates when $\alpha_{\mathrm R}s^{1/2}\le c\le \beta_{\mathrm R}s^{(m-1)/m}$ for some constants $\alpha_{\mathrm R}$ and $\beta_{\mathrm R}$. This also shows that the exponent $(m-1)/m$ in the first result is tight.
Read the full abstract

Algebraic Geometry

The equations of general Hassett maximal cubic fourfolds

In this note, we discuss Hassett maximal cubic fourfolds and construct an explicit irreducible component of maximal dimension sixteen of the locus $\mathcal{Z}$ of Hassett maximal cubic fourfolds. We utilize algebraic and arithmetic methods to analyze the associated lattice of these fourfolds. % By studying general integral quadratic forms and proving the ADC property for a specific ternary form, we demonstrate that the primitive image of our lattice spans the entire Hassett subset, confirming the Hassett maximality of the cubic fourfolds we describe.
Read the full abstract

Algebraic Geometry

Refined lattice point counting on the moduli space of Klein surfaces

We introduce the moduli space of metric Möbius graphs, which extend ribbon graphs to the non-orientable world. This space contains both the moduli space of Riemann surfaces and the moduli space of non-orientable Klein surfaces. Each metric Möbius graph is equipped with a measure of non-orientability. We count lattice points in this moduli space, weighted by the measure of non-orientability, and prove a refined version of Norbury's recursion for this count. Taking the limit as the mesh becomes finer, we deduce a recursion for the Euclidean volumes, yielding a refined version of the Witten–Kontsevich recursion. As an application, we give a geometric definition of the refined Euler characteristic of the moduli space and compute it explicitly, thereby answering a question of Goulden, Harer, and Jackson.
Read the full abstract

All authors Nitin Kumar Chidambaram, Elba Garcia-Failde, Alessandro Giacchetto, Kento Osuga

Numerical Analysis · Cross-listed from cs.LG

HS-FNO: History-Space Fourier Neural Operator for Non-Markovian Partial Differential Equations

Neural operators provide fast surrogate models for time-dependent partial differential equations, but their standard autoregressive use usually assumes that the instantaneous field $u(t,\cdot)$ is a complete state. This assumption fails for delay equations, distributed-memory systems, and other non-Markovian dynamics: two trajectories may agree at time $t$ and nevertheless have different futures because their histories differ. We introduce the History-Space Fourier Neural Operator (HS-FNO), a neural operator for delay and memory-driven PDEs formulated on the lifted state $u_t(\theta,x)=u(t+\theta,x)$, $\theta\in[-\tau,0]$. The key computational step is to decompose one history-state update into a learned predictor for the newly exposed future slice and an exact shift-append transport for the portion of the history window already known from the previous state. This avoids learning deterministic history coordinates, reduces the learned output dimension, and enforces the natural discrete history update. We test HS-FNO on five benchmark families covering delayed reaction–diffusion, spatial epidemiology, nonlocal neural-field dynamics, delayed waves, and distributed-memory closures. Across ten random seeds, HS-FNO attains the lowest aggregate one-step, history-space, and rollout errors among the principal baselines. The largest gain occurs in autoregressive prediction, where aggregate rollout error decreases from $0.241$, $0.188$, and $0.185$ for current-state, lag-stack, and unconstrained history-to-history operators, respectively, to $0.094$. The same model uses fewer parameters than unconstrained history prediction. These results indicate that enforcing the discrete shift structure of history-state evolution is an effective inductive bias for non-Markovian PDE surrogate modeling.
Read the full abstract

Rings and Algebras

Varieties of bicommutative algebras with identity of degree three

The variety of bicommutative algebras is the class of all nonassociative algebras satisfying the polynomial identities $(x_1x_2)x_3=(x_1x_3)x_2$ and $x_1(x_2x_3)=x_2(x_1x_3)$. In this paper we provide a complete description of varieties of bicommutative algebras over a field of characteristic zero that satisfy a polynomial identity of degree three. Furthermore, we establish a sufficient and necessary condition for a variety of bicommutative algebras to have a distributive lattice of subvarieties.
Read the full abstract

Numerical Analysis

A boundary integral method for wave scattering in a heterogeneous medium with a moving obstacle

We propose a time-domain boundary integral method to model linear wave propagation with refractive, focusing, and Doppler effects arising from medium heterogeneities and moving obstacles. In contrast to existing techniques, our method avoids volumetric discretization and yields a formulation posed only on the boundary of the obstacle. We combine two classical ingredients: a geometric–optics parametrix to capture leading-order behavior at propagating wavefronts, and a ray-based characterization of the distorted causal geometry. The former provides a framework for defining layer potentials and deriving the associated boundary integral equations, while the latter enables a pure boundary-only formulation. Taken together, these ingredients extend existing numerical techniques for the homogeneous, fixed-boundary case to the heterogeneous, moving-boundary setting, with appropriate modifications to capture the discrete causal structure arising from the intersection of distorted light cones with the worldsheet of the moving boundary. Numerical experiments demonstrate the ability of the method to resolve Doppler effects from moving obstacles, including a rotating turbine configuration, with stable performance up to Mach 0.9. In heterogeneous media, the method captures strong refractive effects from spherical inclusions: wave propagation wrapping around a gas bubble in water, and defocusing from a hot fireball rising through a stratified atmosphere.
Read the full abstract

Group Theory

Simple Lattices in Products of Davis Complexes

Burger and Mozes (1997) constructed the first examples of simple uniform lattices in products of trees. In this paper, we construct simple uniform lattices in products of certain Davis complexes. More precisely, we consider lattices in products of trees and two-dimensional Davis complexes of the right-angled Coxeter group whose defining graph is an odd graph. As part of the proof, we define an analogue of the Burger-Mozes universal groups in this setting, and provide a local criterion for a vertex transitive group to be dense in the universal group.
Read the full abstract

Combinatorics

$\mathit{SB}(3,n)$ has no Hamiltonian cycle when $n$ is even: a sign-of-permutation proof, with extension to all odd $m\equiv 3\pmod 4$

We resolve exercise 7.2.2.4–224 of Knuth's Pre-Fascicle 8a (10 April 2026 draft, rated [46]): the digraph $\mathit{SB}(3,n)$ has no Hamiltonian cycle when $n$ is even. The argument is a sign-of-permutation obstruction. Writing the successor map of a candidate Hamiltonian cycle as $f_S = A_b \circ \sigma$, $\operatorname{sgn}(A_b)=+1$ when $m$ is odd, so $\operatorname{sgn}(f_S)=\operatorname{sgn}(\sigma)$ for every choice set $S$. A short dihedral Burnside computation shows $\operatorname{sgn}(\sigma)=-1$ on $\Sigma_3^n$ for even $n$, contradicting the sign $+1$ required of a single $3^n$-cycle. The same argument gives the stronger statement that $\mathit{SB}(m,n)$ has no Hamiltonian cycle whenever $m$ is odd with $m\equiv 3\pmod 4$ and $n$ is even; this restricts the residue classes in which Knuth's hint to Ex.~225 (existence of Hamiltonian cycles in $\mathit{SB}(m,n)$ for all $m>3$ and $n>2$) can hold.
Read the full abstract

Numerical Analysis

A Patchwise Local Fourier Extension Method for Function Approximation on General Two-Dimensional Domains

We propose a patchwise local Fourier extension method for approximating smooth functions on general two dimensional domains with curved boundaries. The domain is embedded into a Cartesian background grid and decomposed into rectangular interior patches and one-side curved trapezoidal boundary patches. After local data transfer, all patches are converted into fixed-size tensor-product arrays and approximated by a truncated-SVD stabilized local Fourier extension procedure. Unlike global Fourier frame approximations, the proposed method localizes both the geometry and the ill-conditioned extension process. For fixed local parameters, the local algebraic operations are performed on fixed-size systems, and the reference Fourier extension matrices and their singular value decompositions are reused across patches. Boundary patches require additional one-dimensional transfer or completion steps, but their costs remain uniformly bounded by the local resolution. Consequently, the online complexity is \(O(N)\), where \(N\) denotes the total number of retained output points for fixed local resolution. Numerical experiments on smooth curved domains and on a mildly rough boundary domain demonstrate that the method achieves high accuracy with a fixed set of local parameters. The smooth-cover correction reduces the boundary-induced error by several orders of magnitude in the full-domain rough-boundary test, without changing the underlying scan-based partition.
Read the full abstract

Symplectic Geometry

Metriplectic dynamical systems on contact manifolds

Flows on symplectic, Poisson, contact, and metriplectic manifolds are reviewed in order to describe our main result, which is to associate a natural metriplectic dynamical system on the general one-jet bundle $J^1N=T^*N\times \mathbb{R}$, which is at once a (trivial) Poisson manifold and a contact manifold. Unlike the standard contact Hamiltonian system, our metriplectic system is thermodynamically consistent in that $$\dot{H} = 0 \quad\mathrm{and}\quad \dot{S} \geq 0$$ under the flow. Here $H$ is the Hamiltonian, while $S$ is the entropy function which is nothing but the $\mathbb{R}$ coordinate function of $J^1N$. As an example we derive the Duffing equation (autonomous and nonautonomous versions) either as a contact Hamiltonian system or as a metriplectic system. We show that for both systems the Duffing equation is a subsystem of three dimensional systems that contain a thermodynamic component, a form that facilitates asymptotic stability analysis of the relevant equilibrium state.
Read the full abstract

Combinatorics

On $4$-perfect-matching covers of cubic graphs with two adjacent odd circuits in a $2$-factor

Let $G$ be a cubic graph admitting a $2$-factor consisting of exactly two odd circuits, and let the complementary $1$-factor contain precisely three spokes (along with an arbitrary number of chords). We show that four perfect matchings can cover $G$. As a consequence, $G$ fulfils the $7/5$-Conjecture of Alon and Tarsi.
Read the full abstract

Statistics Theory

The Statistical Cost of Adaptation in Multi-Source Transfer Learning

Multi-source transfer learning can improve target-domain estimation by leveraging related source data, but its benefits depend on unknown source-to-target biases. This raises a fundamental question: can a bias-agnostic estimator perform as well as an oracle that knows the true bias configuration? To study this, we introduce the intrinsic cost of adaptation, defined as the smallest worst-case ratio between the risk of any bias-agnostic estimator and the oracle risk. An intrinsic cost of one means oracle performance is achievable without knowing the biases, whereas a larger cost quantifies the unavoidable price of adaptation. Focusing on parametric estimation, we show that multi-source transfer behaves fundamentally differently from the single-source setting: adaptation is not always possible, even with only two sources. For a fixed number of sources, we characterize the intrinsic cost of adaptation and identify a phase transition separating regimes where oracle performance is achievable from those where it is not. As the number of sources grows, we further show that the adaptation cost increases. When adaptation over the full bias configuration space is impossible, additional structure can substantially reduce the cost. We study settings with ordered biases, clustered source parameters, and sufficiently separated non-informative sources, and propose estimators tailored to each regime, with supporting theoretical and empirical results. Overall, our results delineate the statistical limits of multi-source transfer, clarifying when oracle performance is attainable, when structural assumptions help, and when adaptation is fundamentally impossible.
Read the full abstract

Probability

Counting subgraphs in bounded-size Achlioptas processes

Achlioptas processes such as the Bohman–Frieze process are much harder to analyse than the classical Erdős–Rényi process, due to the dependence between edges added at different stages. This dependence means that most analysis so far is dynamic, often based on the differential equation method. In the Erdős–Rényi case there is an alternative static approach, pioneered by Erdős, Rényi and Bollobás, based on evaluating the expectation (and higher moments) of various subgraph counts, and using this to study the component structure. Here we show that this latter approach can be applied (with some complications) to the Bohman–Frieze process. For example, we are able to show that the expected number $\mu_{k,t,n}$ of $k$-vertex tree components after $tn$ steps satisfies (essentially) $\mu_{k,t,n}=c_{k,t}n(1+O(k/\sqrt{n}))$. Our method gives a very complicated formula for $c_{k,t}$, which seems to be unusable. However, since $c_{k,t}$ does not depend on $n$, we may use recent results obtained by the differential equation method and branching process analysis to find the asymptotics of $c_{k,t}$ as $k\to\infty$. The latter results also give a formula for $\mu_{k,t,n}$ of the form $c_{k,t}n$ plus an error term, with a much more usable description of $c_{k,t}$ but a much worse error term. We combine the best of both worlds to prove a number of new results about the process near criticality. In particular, we obtain extremely sharp bounds on the size of the largest non-giant component near criticality, including the limiting distribution of its fluctuations.
Read the full abstract

Statistics Theory · Cross-listed from stat.ME

Proximal Path-Specific Inference

Causal mediation analysis has been extended to estimate path-specific effects with multiple intermediate variables, isolating treatment effects through a mediator of interest while excluding pathways through its ancestors. Such analyses address bias from recanting witnesses, i.e., treatment-induced mediator-outcome confounders. However, existing methods typically rely on stringent assumptions precluding general unmeasured confounding, which are often violated in practice. In this paper, we relax these restrictions by leveraging observed covariates as proxy variables to accommodate unmeasured confounding among the treatment, recanting witness, mediator, and outcome. Using proximal confounding bridge functions, we develop four nonparametric identification strategies for the path-specific effect. We further derive the efficient influence function and propose a quadruply robust, locally efficient estimator. To handle high-dimensional nuisance parameters, we propose a proximal debiased machine learning approach. We theoretically guarantee that our estimator achieves $\sqrt{n}$-consistency and asymptotic normality even when machine learning estimators for nuisance functions converge at slower rates. Our approaches are validated via semiparametric and nonparametric simulations and an application to the CDC WONDER Natality study, estimating the path-specific effect of prenatal care on preterm birth through preeclampsia, independent of maternal smoking during pregnancy.
Read the full abstract

All authors Yang Bai, Sihan Wu, Baoluo Sun, Yifan Cui

Probability

Multipoint connectivity in the branching interlacement process

We consider the branching interlacement model introduced by Zhu as an analog of Sznitman's random interlacement for branching random walks. We show that two points of the interlacement are connected via at most $\lceil d/4 \rceil$ trajectories of the interlacement, using a different proof than Procaccia and Zhang. This upper bound is sharp, in the sense that almost surely there exist two points not connected by $\lceil d/4\rceil - 1$ trajectories. We extend this result by proving that $k$ points of the interlacement are connected via at most $\lceil d(k-1)/4\rceil -(k-2)$ trajectories, and that this bound is also sharp.
Read the full abstract

Combinatorics

Integral Shell Polytopes of Composition Algebras

Integral systems in real composition algebras give rise to finite metric configurations whose geometry is linked to both regular polytopes and root-systems. In this work we investigate, to our knowledge for the first time in this form, the shell polytopes obtained by fixing the integral norm and taking the convex hull of the corresponding integral elements. The first shells recover the familiar root-polytopal configurations attached to the classical Hurwitz systems, while the Okubo algebra gives a quite different behaviour. The Okubo integral closure does not recover the Gosset polytope directly: it selects a two-adic hierarchy whose first visible layers are a cross-polytope and a \(D_8\) root polytope. We further show that the natural intermediate lattice is isometric to the rescaled cubic lattice; consequently every shell decomposes into explicit orbits of the hyperoctahedral group \(W(B_8)\), and the higher Okubo shells admit a complete combinatorial description in cubic-lattice coordinates. The full \(E_8\) Gosset polytope is then recovered from the intermediate lattice by maximal-isotropic gluing along \((\ZZ/2)^4\). This gives an interplay between non-unital composition, integral lattice shadows, and the geometry of \(E_8\).
Read the full abstract

Analysis of PDEs · Cross-listed from stat.ML

Quantitative Local Convergence of Mean-Field Stein Variational Gradient Flow

Stein Variational Gradient Descent (SVGD) is a deterministic interacting-particle method for sampling from a target probability measure given access to its score function. In the mean-field and continuous-time limit, it is known that the flow converges weakly toward the target, but no quantitative rate is known for the last iterate. In this paper, we establish quantitative local convergence in strong norms for this dynamics, when the interaction kernel is of Riesz type on the $d$-dimensional torus. Specifically, assuming that the initial density and the target are smooth and close in $L^2$-norm, we obtain explicit polynomial convergence rates in $L^2$-norm that depend on the dimension and on the regularity parameters of the kernel, the initialization and the target. We further show that these rates are sharp in certain regimes, and support the theory with numerical experiments. In the edge case of kernels with a Coulomb singularity, we recover the global exponential convergence result established in prior work. Our analysis is inspired by recent results on Wasserstein gradient flows of kernel mean discrepancies.
Read the full abstract

All authors Lénaïc Chizat, Maria Colombo, Roberto Colombo, Xavier Fernández-Real

Rings and Algebras

Commutators of finite multiplicative order

This article studies the equation $[A,B]^k = \Id_n$ for matrices over $\CC$,characterizing the pairs $(k,n)$ for which solutions exist via a classical result of Lam and Leung on sums of roots of unity. The problem is next generalized to matrix rings $M_n(S)$ over arbitrary unital rings $S$, where a sufficient condition on the unity of $S$ is established and explicit constructions of solutions are provided. Beyond matrix rings, the structural implications of the equation $[a,b]^n = 1$ in a general unital ring $R$ are investigated, yielding a collection of idempotents whose properties govern the ring's structure. We prove that under a suitable condition on these idempotents, $[a,b]^n = 1$ implies $R$ is isomorphic to $M_n(S)$ for some unital ring $S$. We also provide an alternative proof using a result on characterisation of matrix rings by Goyal and Khurana. These results together establish a framework connecting commutator equations and classical criteria for recognizing full matrix rings.
Read the full abstract

Optimization and Control

Controllability of quasilinear parabolic equations under multiplicative mobile controls

This paper addresses the controllability of a class of quasi-linear parabolic equations governed by multiplicative controls with mobile support. To prove the existence of such a control forcing the solution to rest at time $T>0$, we first establish the decay property of solutions for the uncontrolled system. Unlike the case of the linear heat equation, the nonlinearity in the principal part of the operator introduces significant challenges. These difficulties necessitate a novel approach, ultimately leading us to solve the controllability problem within the framework of classical solutions. Through a carefully constructed smooth transition, we demonstrate that there exists a multiplicative control driving the state exactly to rest at time $t=T$.
Read the full abstract

Optimization and Control

Barrier Certificates for Uncertain Temporal Specifications

This paper studies satisfying temporal logic specifications on stochastic dynamical systems, where the predicates evolve randomly over time. Such randomness may arise from uncertain environment models or external stochastic processes causing the sets associated with predicate satisfaction to vary in a non-deterministic manner. As a result, verifying whether a stochastic dynamical system satisfies a temporal specification depends also on the uncertainty in the predicates. We develop a certificate-based framework to bound the probability of satisfying temporal logic specifications with randomly evolving predicates. We first show that temporal logic specifications with stochastic predicates can be transformed to specifications with deterministic predicates on an augmented space which is extended to include the stochastic space of predicate's uncertainty. We then utilize barrier certificates on an augmented space to provide tractable optimization-based conditions and to avoid the computational burden of dynamic programming. Focusing on linear dynamics and safety-type specifications, we derive analytical conditions under which barrier certificates guarantee bounds on the probability of violating the stochastic safety predicates. The approach is demonstrated on numerical case studies.
Read the full abstract

Algebraic Geometry

On the tangent degree and the degree of the tangent variety of a projective variety

The tangent degree $\tau(X)$ of a projective variety $X^n\subset\mathbb P^N$ is the number of tangent spaces to $X$ at smooth points passing through a general point of the tangent variety $Tan(X)\subseteq\mathbb P^N$, if positive and finite; it is equal to zero if $\dim(Tan(X))<2n$. In this paper we focus on general properties of $\tau(X)$ and of $deg(Tan(X))$. For example $\tau(X)\neq 1$ if $N=2n$ and, as soon as $Tan(X)$ does not coincide with the secant variety, we prove a linear lower bound for the degree of $Tan(X)$ in terms of its codimension in the spirit of the paper Ciliberto.Russo.2006. Then we consider the cases in which the previous two invariants attain the lower bounds found here, either in small dimension/codimension and/or under the smoothness assumption. Finally for $N\geq 2n+1$ we consider varieties $X^n\subset\mathbb P^N$ having $\tau(X)>1$ and provide their classification in small dimension.
Read the full abstract

2605.09437 · 10 May · 34 pages. Dedicated to Ciro Ciliberto on the occasion of his 75th birthday. Submitted for publication on January 2026. Most contents used as material for a series of lectures at IBS in Daejeon (South Korea) in March 2026

Category Theory

Parity complexes redux

We fix the notion of parity complex by a judicious selection from among the axioms originally considered by Street. We show that parity complexes so defined, together with the morphisms of parity complexes defined by Verity, form a category equivalent to the category of strong Steiner complexes (nés augmented directed complexes with strongly loop-free unital bases). To this end, we isolate the purely combinatorial structure possessed by the bases of free augmented directed complexes. This analysis reveals the essential advantage of Steiner's formalism to be that the role of subsets in Street's formalism is played instead by multisets.
Read the full abstract

Combinatorics

Parallel packing a square with isosceles right triangles and equilateral triangles

Suppose that $I$ is a unit square. Let $T$ (resp. $\Delta$) be an isosceles right triangle (resp. an equilateral triangle). We prove that any collection of triangles homothetic to $T$ (resp. $\Delta$), whose total area does not exceed $\frac{1}{2}$ (resp. $\frac{\sqrt{3}}{4}$), can be parallel packed into $I$. These upper bounds are tight.
Read the full abstract

Information Theory

Universal Feature Selection with Noisy Observations and Weak Symmetry Conditions

This paper relaxes the restrictive symmetry conditions adopted in [4], [5] and extends their universal feature selection framework to accommodate noisy observations as well as attribute structures that may exhibit directional preferences. We introduce the notion of weak spherical symmetry, quantified by second-moment distances, which allows controlled deviations from rotational invariance. Under this relaxed condition, we develop a universal feature selection framework based on the singular value decomposition of the canonical dependence matrix computed from noisy data. Our main result shows that the selected features achieve asymptotically optimal error exponents up to a residual term that depends on the symmetry deviation $\delta$ and the noise levels $\eta_1, \eta_2$. When $\delta, \eta_1, \eta_2$ are relatively small, our result recovers that of [5], thereby demonstrating that exact spherical symmetry is unnecessary. Overall, our findings highlight the robustness of the selection framework against second-moment deviations and observation noise, thereby broadening its applicability across diverse inference tasks and providing a theoretically grounded tool for universal feature selection in practical scenarios.
Read the full abstract

Complex Variables

Stability of the Monomial Basis Kernel of Reinhardt domains

On a pseudoconvex Reinhardt domain $\Omega\subset\mathbb{C}^n$ the $p$-Bergman space $A^p(\Omega)$ admits a canonical basis of monomials indexed by a subset $S_p(\Omega)\subset\mathbb{Z}^n$. The corresponding $p$-Monomial Basis Kernel (or $p$-MBK) is defined by a series involving these monomials and their norms. This article records stability properties of the $p$-MBK and of the index set $S_p(\Omega)$ with respect to the parameter $p$. First, under mild hypotheses, the $p$-MBK depends continuously on $p\in[1,\infty)$, and a Ramadanov-type theorem holds for $p$-MBK for an increasing sequence of pseudoconvex Reinhardt domains. Second, for certain special classes of monomial polyhedra, we explicitly compute the index set and the associated Threshold exponents. Finally, these explicit models are used to illustrate structural properties of the index sets under finite unions, intersections, and products.
Read the full abstract

Functional Analysis

Construction of Nonuniform Wavelet Frames on Non-Archimedean Fields

A constructive algorithm based on the theory of spectral pairs for constructing nonuniform wavelet basis in $L^2(\mathbb R)$ was considered by Gabardo and Nashed (J Funct. Anal. 158:209-241, 1998). In this setting, the associated translation set $\Lambda =\left\{ 0,r/N\right\}+2\,\mathbb Z$ is no longer a discrete subgroup of $\mathbb R$ but a spectrum associated with a certain one-dimensional spectral pair and the associated dilation is an even positive integer related to the given spectral pair. The main objective of this paper is to develop oblique and unitary extension principles for the construction nonuniform wavelet frames over non-Archimedean Local fields of positive characteristic. An example and some potential applications are also presented.
Read the full abstract