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)

Wednesday 6 May

Differential Geometry

Holomorphicity of stable minimal surfaces of low genus

We prove that a (branched) minimal immersion from $\mathbb{C}$ to $\mathbb{R}^n$ is stable if and only if it lives in an even dimensional affine subspace and is holomorphic for some orthogonal complex structure on the subspace. More generally, we prove that the same result holds for a class of genus $0$ surfaces that can have infinite total curvature. This contributes to an inquiry initiated by Micallef, who previously proved the equivalence in genus $0$ assuming completeness and finite total curvature. As a corollary, we prove a holomorphicity result for covering stable minimal surfaces of genus $0$ and $1$, recovering a theorem of Fraser and Schoen as a particular case. Our approach is new, based on a method of constructing variations developed by the first named author and Marković. For unstable surfaces, we get explicit destabilizations and destabilization radii that can be read from the Weierstrass-Enneper data.
Read the full abstract

Metric Geometry

A characterization of the ellipsoid in terms of pairs of sections associated by a harmonic homology

Let $K$ be a convex body in an affine chart of the $n$ dimensional real Projective space $\mathbb{RP}^n$, $n \geq 3$, let $H$ be a hyperplane which is not a support hyperplane of $K$ and let $p_1,p_2 \in \mathbb{RP}^n \setminus H$ be two distinct interior points of $K$. In this work we prove that if for every $(n-2)$-plane $l \subset H$, there exists a harmonic homology, with plane $G$ and center $\tau$, such that $l\subset G$, $\tau \in H$ and which maps the hypersection of $K$ defined by aff$\{p_1, l\}$ onto the hypersection of $K$ defined by aff$\{p_2, l\}$, then $K$ is an ellipsoid.
Read the full abstract

Mathematical Physics

Anchored random clusters and SLE excursions

We provide a pedagogical review of CFT techniques to compute certain Schramm-Loewner Evolution (SLE) observables in the upper half-plane. The approach relies on the ability to express the observables as bulk-boundary correlation functions that involve degenerate boundary operators and, therefore, obey certain differential equations. In particular, we recover Schramm's left-passage probability for SLE, the SLE Green's functions, and the generalized densities of “anchored” critical percolation clusters first obtained by Kleban, Simmons, and Ziff. We also obtain new formulas corresponding to the densities of pivotal points between critical Fortuin-Kasteleyn (FK) clusters.
Read the full abstract

Classical Analysis and ODEs

A Unified Geometric Perspective on Zygmund's Maximal Function Conjecture and Related Questions for the Stein Hilbert Transform

The Zygmund vector-field maximal function conjecture is a long-standing open problem in harmonic analysis. It is notoriously difficult in part because the vector-field maximal function is non-translation-invariant and lies beyond the scope of finite-type theory. Its resolution would yield a Lebesgue differentiation theorem along vector fields, i.e., pointwise recovery of functions from averages along vector fields. We establish an \(L^2\) boundedness criterion that substantially enlarges the class of admissible geometric degeneracies. More precisely, the power-type decay condition in Bourgain's theorem can be replaced by the much weaker logarithmic-polynomial decay \((\log\tfrac{1}{\tau})^{-p}\), \(p>2\). This condition no longer yields the power-type integrability underlying Bourgain's argument, yet \(L^2\) boundedness persists, permitting degeneracies far beyond any power-law regime. Our result also provides a unified geometric perspective on finite-type, intermediate-degenerate, and highly non-finite-type vector fields, with their behavior organized through the angular-variation quantity \(w_x(t)\). This perspective places several classical boundedness criteria within a common hierarchy. Motivated by Lacey and Li's work on the Stein vector-field Hilbert transform conjecture, we further introduce a non-centered rectangular maximal operator adapted to the variable geometry of vector fields and prove its weak-type \((1,1)\) boundedness. Together, these results provide new tools and a unified geometric framework for the study of two fundamental conjectural problems in non-translation-invariant analysis.
Read the full abstract

Functional Analysis

The Local Operator Moment Problem on $\mathbb{R}$

We study the connections between operator moment sequences ${\mathcal T}=\displaystyle(T_n)_{n\in\mathbb{Z}_+}$ of self-adjoint operators on a complex Hilbert space $\mathcal{H}$ and the local moment sequences $\langle{\mathcal T}x,x\rangle = (\langle T_nx,x\rangle)_{n\in\mathbb{Z}_+}$ for arbitrary $x\in \mathcal{H}$. We provide necessary and sufficient conditions for solving the operator moment problem on $\mathbb{R}$, and we show that these criteria are automatically valid on compact subsets of $\mathbb{R}$. Applications of the compact case are used to study subnormal operator weighted shifts. A Stampfli-type propagation theorem for subnormal operator weighted shifts is also established. In addition, we discuss the validity of Tchakaloff's Theorem for operator moment sequences with compact support. In the case of a recursively generated sequence of self-adjoint operators, necessary and sufficient conditions for an affirmative answer to the operator recursive moment problem are provided, and the support of the associated representing operator-valued measure is described.
Read the full abstract

All authors Raul E. Curto, Abderrazzak Ech-charyfy, Hamza El Azhar, El Hassan Zerouali

Number Theory

Rational orbits under correspondences

Consider an algebraic function like $F(x) = \sqrt{x^3 - 1}$. If $p \in \mathbb{Q}$ is a rational number, how many iterates of $p$ under $F$ can also be rational? The dynamics of algebraic functions may be formalized in the language of correspondences on curves and their iterates. In this paper we show that if $F$ is a correspondence from $\mathbb{P}^1$ to itself defined over a finitely generated field $K$ of characteristic 0 satisfying several minor constraints, then either for each $n \geq 12$ there are only finitely many $p \in \mathbb{Q}$ for which $F^n(p)$ contains a $K$-rational point or $F$ belongs to an explicit list of known exceptional correspondences.
Read the full abstract

Algebraic Geometry

Local isomorphisms for families of projective non-unruled manifolds

Let $\pi\cln \cX\to S$ and $\pi\cln \cY\to S$ be two smooth families of projective non-uniruled manifolds over a Riemann surface $S$ (probably non-compact). Suppose these two families are pointwise isomorphic. We prove that there exists an open dense subset $U\subset S$ such that the two restricted families are locally isomorphic over $U$. This partially answers Wehler's question on locally isomorphic of families of compact complex manifolds.
Read the full abstract

Number Theory

Special periods and some non-tempered cases of the Gan-Gross-Prasad conjecture

In this paper, we establish a relationship between special periods and special L-values of automorphic representations of classical groups, and prove the non-tempered global Gan–Gross–Prasad conjecture in several cases. Our approach consists of two main steps. First, inspired by Rallis' tower property, we study the interaction between special periods and the tower property for the genericity of global theta lifts. Second, we investigate the relationship between the analytic properties of L-functions and special periods via the Rankin–Selberg integral method. Combining these results with non-vanishing criteria for global theta lifts in terms of various L-values, we prove three explicit higher-corank families of non-tempered cases of the global Gan–Gross–Prasad conjecture.
Read the full abstract

Analysis of PDEs

Global spherically symmetric solutions to the multidimensional isentropic compressible Navier–Stokes–Korteweg system with large initial data

In this paper, we investigate the global existence of spherically symmetric strong solutions with large initial data to an initial-boundary value problem of the multidimensional isentropic compressible Navier-Stokes-Korteweg system in an unbounded exterior domain. We consider the case when the pressure $p(\rho)=\rho^\gamma$, the viscosity coefficients $\mu(\rho)$ and $ \lambda(\rho)$ satisfy either $\mu(\rho)=\tilde{\mu}, \lambda(\rho)=\tilde{\lambda}\rho^\alpha$ or $\mu(\rho)=\tilde{\mu}\rho^\alpha, \lambda(\rho)=\tilde{\lambda}\rho^\alpha$, and the capillarity coefficient $\kappa(\rho)=\tilde{\kappa}\rho^\beta$, where $\alpha,\beta,\gamma \in \mathbb{R}$ are parameters, and $\tilde{\mu},\tilde{\lambda},\tilde{\kappa}$ are given real constants. Under suitable restrictions on the parameters $\alpha,\beta$ and $\gamma$, we establish the global existence and uniqueness of spherically symmetric strong solutions. The proof relies on the radically weighted energy method combined with the technique developed by Y.~Kanel'\cite{28}.
Read the full abstract

Statistics Theory · Cross-listed from stat.ME

Causal discovery under mean independence and linearity

Causal discovery methods such as LiNGAM identify causal structure from observational data by assuming mutually independent disturbances. This assumption is fragile: shared volatility, common scale effects, or other forms of dependence can cause the methods to recover the wrong causal order, even with infinite data. We introduce the Linear Mean-Independent Acyclic Model (LiMIAM), which replaces full independence with weaker one-sided mean-independence restrictions on the disturbances. Under finite-order consequences of these restrictions, source nodes are generically identifiable, and hence a compatible causal order can be recovered recursively. Our proof is constructive and leads to DirectLiMIAM, a sequential residual-based algorithm for causal discovery under dependent noise. In simulations with mean-independent but dependent disturbances, DirectLiMIAM outperforms LiNGAM methods. A large-scale empirical application to the oil market highlights the implausibility of the independence assumption and the ability of DirectLiMIAM to recover a realistic causal ordering, from policy to production and from prices to inflation.
Read the full abstract

All authors Geert Mesters, Alvaro Ribot, Anna Seigal, Piotr Zwiernik

Combinatorics

More on the Erd\H os–Kleitman problem on matchings in set families

Let $e(n,s)$ denote the maximum size of a family $\mathcal{F}$ of subsets of an $n$-element set that contains no $s$ pairwise disjoint members. In 1968, answering a question of Erdős, Kleitman determined $e(sm-1,s)$ and $e(sm,s)$ for all integers $m,s\ge 1$. Half a century later, Frankl and Kupavskii determined $e(s(m+1)-\ell, s)$ for $\ell \leq \frac{s-3}{m+3}$. They showed that the corresponding extremal example is closely connected with the extremal example for the Erdős Matching Conjecture, and conjectured that the same remains true for all $\ell \leq s/2$. In this paper, we prove an approximate version of their conjecture for $s\ge s_0(m)$.
Read the full abstract

Combinatorics

A short proof of Mathar's 2016 recurrence conjecture for OEIS A176677

For the OEIS sequence A176677, defined by the quadratic convolution recurrence $a(0) = a(1) = 1$ and $a(n+1) = \sum_{p=0}^n a(p) a(n-p) - 1$ for $n \ge 1$, R.~J.~Mathar contributed in March 2016 the conjectured order-4 P-recursive recurrence \[ (n+1)\,a(n) + 2(-3n+1)\,a(n-1) + (9n-13)\,a(n-2) - 4\,a(n-3) + 4(-n+4)\,a(n-4) = 0. \] We give a short proof. The convolution recurrence translates directly into the algebraic equation $z(1-z) G(z)^2 - (1-z) G(z) + (1 - z - z^2) = 0$ for the ordinary generating function $G(z)$, and Mathar's recurrence then drops out as the coefficient form of a 1st-order linear inhomogeneous ODE $q_0(z) G(z) + q_1(z) G'(z) = R(z)$ that we verify by polynomial division modulo the algebraic equation. The polynomial $q_1(z)$ admits the factorization $q_1(z) = -z(z-1)(2z-1)(2z^2 + 3z - 1)$, whose roots are exactly the singularities of $G$. Deutsch's combinatorial interpretation (Motzkin paths of length $n-1$ with two-coloured level-zero horizontal steps) is preserved.
Read the full abstract

Optimization and Control · Cross-listed from cs.LG

Online Nonstochastic Prediction: Logarithmic Regret via Predictive Online Least Squares

We study online prediction for marginally stable, partially observed linear dynamical systems under nonstochastic disturbances. Our objective is to minimize the cumulative squared prediction loss and compete with the best-in-hindsight Luenberger predictor. Standard online learning methods typically rely on bounded domains/gradients, and thus their guarantees may fail to deal with potentially unbounded trajectories in marginally stable systems. In this paper, we introduce an unconstrained online least squares method that stabilizes the learning process via tailored predictive hints. With model knowledge, we prove that hints constructed from any stabilizing Luenberger predictor render the hint residuals uniformly bounded, achieving logarithmic regret despite unbounded trajectory growth. We also discuss model-free prediction and introduce a simple universal hint for symmetric systems, under which logarithmic regret is maintained without model knowledge. Our results provide an adaptive, instance-wise optimal online predictor compared to classical fixed-gain observers under nonstochastic disturbances.
Read the full abstract

Tuesday 5 May

Functional Analysis

Noncommutative Cauchy Bound and Noncommutative Montel Bound for Roots of Polynomials

In 1829, Cauchy derived an upper bound for every root of a complex polynomial using the maximum of the absolute values of the coefficients. In 1931, Montel derived an upper bound using the sum of the absolute values of the coefficients. We derive noncommutative versions of the Cauchy and Montel bounds.
Read the full abstract

Information Theory · Cross-listed from cs.NI

FLUID: Slack-based Low-latency Delivery

We introduce FLUID (Fountain LiqUId Delivery), a protocol that uses fountain coding and receiver feedback for low-latency delivery of data blocks over lossy networks. Idealized Automatic Repeat reQuest (ARQ) protocols are bandwidth-optimal, but must deliver every packet in a block and therefore can require additional rounds under packet loss. FLUID uses a controlled amount of slack to relax this all-packets requirement, allowing delivery to finish once enough encoded packets have been received. This yields substantially tighter delivery latency while remaining deterministically close to the ARQ bandwidth optimum. FLUID is controlled by a slack parameter $\epsilon$. Under the Loss-Product Rule, delivery finishes once the product of packet loss fractions across transmission rounds falls below $\epsilon$. Thus, FLUID can finish delivery in a small number of rounds even when every round experiences packet loss, while $\epsilon$ controls the gap between FLUID and bandwidth-optimal ARQ.
Read the full abstract

Analysis of PDEs

A unified Boussinesq–Euler formulation and finite-time blow-up for a Hou–Luo type boundary-jet system

We derive a unified vorticity–stream formulation $(Bm)$ for two parity-reduced inviscid systems in the meridian plane: the 2D inviscid Boussinesq equations $(m=1)$ and the 3D axisymmetric Euler equations with swirl $(m=2)$. In the Boussinesq case we set $\Theta=\vartheta/r$ and write $\Theta=u^2$ only when a smooth square-root branch has been fixed; equivalently, one may keep the scalar variable $\Theta$ throughout. In the squared radial variable $q=r^2$, the two cases are encoded by the same parameterized system with $m=1,2$. At the boundary $q=1$, a Taylor expansion gives an exact boundary jet: the transport equations close on the boundary, while the elliptic relation also contains the next normal jet $\varphi_{qq}(x,1,t)$. If the boundary jet is closed by the first-order Taylor truncation $\varphi_{qq}(x,1,t)=0$, it reduces to a closed unified $(1+1)$D system $(Q0)$ with the local boundary velocity law $u=-(m+2)^{-1}\omega$. We prove finite-time blow-up for this closed Hou–Luo type model on a periodic interval by a Riccati argument in the spirit of Choi–Hou–Kiselev–Luo–Šverák–Yao. The theorem is therefore a blow-up result for the closed boundary-jet model, not for the unrestricted Boussinesq or Euler systems.
Read the full abstract

Information Theory

Information Density as a Quantitative Measure for AI-enabled Virtual Sensing: Feasibility and Limits

Modern IoT and sensor networks generate vast amounts of data, posing significant challenges for storage, transmission, and real-time processing. Traditional approaches, such as compressive sensing and machine learning-based compression, often suffer from computational inefficiencies and irreversible data loss. This paper introduces Information Density as a quantitative metric to support sensor deployment and enable AI-driven virtual sensing. We propose a framework that leverages spatial, temporal and inter-modal correlations among sensor signals to perform sensing tasks even in the absence of physical sensors. Two complementary measures: (i) Phase in Eigen Space and (ii) Mutual Information, are developed to quantify and assess information density, enabling the selection of optimal sensor configurations across both intra-modality and cross-modality scenarios. Validated using real-world data from Madrid's smart city infrastructure, this framework demonstrates the feasibility of replacing physical sensors with virtual ones under bounded error conditions (e.g., achieving $<3.21\%$ mean error with a single sensor). The results highlight the potential for scalable and energy-efficient sensing systems in smart environments.
Read the full abstract

All authors Hrishikesh Dutta, Roberto Minerva, Reza Farahbakhsh, Noel Crespi

Dynamical Systems

Persistence of periodic billiard orbits under domain deformation

We prove that if a polygon admits a periodic billiard orbit satisfying a certain combinatorial criterion, then there are paths of polygons in parameter space for which every polygon in the path admits a periodic billiard orbit of the same type.

Probability

Well-posedness of reflected BSDEs with default time and irregular barrier: An application to optimal control

We consider a reflected backward stochastic differential equations with default time and an optional barrier in a filtration generated by a one-dimensional Brownian motion and a defaultable process. We suppose that the barrier have trajectories with left and right finite limits. We provide the existence and uniqueness result when the coefficient is scholastic Lipschitz by using a modified penalization method. Under an additional assumption of right-upper semi-continuity along stopping times on the trajectories of the barrier, we characterize the state process for such RBSDEs as the value function of an optimal stopping problem associated with a non-linear $f$-expectation.
Read the full abstract

Group Theory · Cross-listed from cs.LG

Probing Structural Mathematical Reasoning in Language Models with Algebraic Trapdoors

We introduce a benchmark suite for evaluating structural mathematical reasoning in language models, built on subgroup-construction problems in SL(3, Z) with cryptographic-style verifier-prover asymmetry. Each instance presents a finitely generated subgroup as a list of integer matrices and asks for an arithmetic invariant – index, surjection-at-prime, or membership – that the construction-time information (N, K) pins down in O(1) closed form, but that the solver, lacking that information, must derive by either Aschbacher-classification analysis or by a membership query in SL(3, Z) of unknown decidability. The benchmark therefore distinguishes models with internalized algebraic priors (Aschbacher classes, McLaughlin's theorem, Property (T), the congruence subgroup property) from models that rely on general-purpose computation. We report empirical results across five representative reasoning traces from two state-of-the-art models. The headline result: on the index variant, one model spent 152 minutes of reasoning, explicitly identified the kernel-side membership question as the bottleneck, attempted constructive verification, and abstained with "DON'T KNOW" rather than commit to its computed cokernel candidate – demonstrating calibrated meta-cognition on the open-decidability boundary that the benchmark was designed to probe. We argue that the benchmark exposes a four-way classification of model behavior (commit-correct, commit-wrong, abstain-correct, abstain-wrong) that standard answer-key scoring conflates.
Read the full abstract

Classical Analysis and ODEs

Radial Integration in Continuous Dimension: A Mellin-Gamma Classification of Euclidean Ball Volume

We classify positive linear functionals on $C_c(\mathbb{R}_{>0})$ satisfying scaling covariance of degree $x/2$ and Gaussian normalization to $\pi^{x/2}$. We prove that the unique such functionals are represented by the Mellin–Gamma measures \[ d\mu_x(u) = \frac{\pi^{x/2}}{\Gamma(x/2)}\, u^{x/2 - 1}\, du, \quad x > 0. \] The result is a rigidity statement: the Mellin–Gamma structure is forced by the axioms, without assuming analytic continuation, special functions, or a priori formulas. The proof reduces the scaling condition, via a logarithmic change of variables, to translation invariance on $\mathbb{R}$, where Haar measure uniqueness determines the measure up to normalization, which is fixed by the Gaussian integral. As a consequence, the Euclidean ball volume formula \[ V(x) = \frac{\pi^{x/2}}{\Gamma(x/2 + 1)} \] is recovered as the mass of the unit interval. We further analyze the induced dimension-shift structure, identifying two multiplicative cocycles whose ratio is a coboundary given by the dimension function $x$, and give an independent characterization via a shifted Bohr–Mollerup theorem.
Read the full abstract

Algebraic Geometry

Smoothing low-dimensional cycles in algebraic cobordism

We show that every cycle in the degree $d$ algebraic cobordism group $\Omega_d(X)$ of a smooth projective variety $X$ over a field of characteristic $0$ is smoothable when $2d<\dim(X)$, that is, it can be written as a linear combination of cycles represented by smooth closed subvarieties of $X$. This generalizes a result of Kollár and Voisin from Chow groups to algebraic cobordism groups.
Read the full abstract

Statistics Theory · Cross-listed from stat.ML

Perturbation is All You Need for Extrapolating Language Models

This paper develops a statistical theory of extrapolation for large language models, by reinterpreting them through pre-post-additive noise models. In contrast to the standard autoregressive next-token prediction based on an exact prefix, we introduce a perturbation-based procedure that first transforms the prefix into a semantic neighbour and then conditions on this perturbed variant for next-token prediction. This yields a hierarchical model with a pre-post-additive noise structure. Within this framework, we develop a rigorous theory of extrapolability, namely, the capacity of a model class to make reliable predictions for token sequences that lie outside the empirical support of the training corpus, by establishing five properties of the proposed procedure: adaptivity, contractivity, robustness, extrapolability, and double robustness. We evaluate the finite sample performance of the proposed procedure using both synthetic and real world language data. Results show that the proposed method consistently improves out-of-support prediction while maintaining competitive in-support performance, demonstrating that perturbation offers a practical route to language modelling.
Read the full abstract

All authors Zetai Cen, Jin Zhu, Xinwei Shen, Chengchun Shi

Group Theory · Cross-listed from quant-ph

Hidden Prime-Factor Subgroups in Molecular and Condensed-Phase Systems

We describe a group theoretic analysis of Shor's algorithm and other related hidden subgroup problems in mathematics and relate these to symmetries of molecular and condensed phase assemblies. By recasting Shor's algorithm through the lens of group theory, we expose the possibility that physical systems such as molecular orbitals, condensed phase assemblies and optical beams may be designed such that these contain information pertaining to the solution to hard mathematical problems such as prime-factoring. We discuss real molecular systems, whose orbitals are constructed from symmetry-adapted linear combinations of atomic orbitals, and show that these contain information pertaining to the prime-factors of corresponding integers. Due to the broad significance of prime-factoring towards a variety of encryption problems in cyber-security, we believe this novel and fundamental approach may have broad impact.
Read the full abstract

Information Theory · Cross-listed from eess.SY

Adaptive Diagonal Loading for Norm Constrained Beamforming

Reliable adaptive beamforming is critical for large microphone arrays operating in highly dynamic acoustic environments. In scenarios characterized by fast-moving talkers and interferers, the available sample support for estimating the spatial correlation matrix is often snapshot-deficient. This deficiency, coupled with array imperfections, degrades the White Noise Gain (WNG), leading to severe target signal cancellation. To ensure stable and robust beamforming, we propose a novel adaptive diagonal loading method that guarantees the WNG remains strictly within specified bounds. By leveraging the Kantorovich inequality, we map the desired WNG to a strict upper bound on the condition number of the correlation matrix. Furthermore, we present three estimation techniques for the adaptive loading level, ranging from trace-based bounding to exact eigenvalue decomposition, offering scalable computational complexities of $\mathcal{O}(M)$, $\mathcal{O}(M^2)$, and $\mathcal{O}(M^3)$. Our approach demonstrates highly stable beamforming under fast-changing interference.
Read the full abstract

All authors Manan Mittal, Ryan M. Corey, John R. Buck, Andrew C. Singer

Dynamical Systems

Symbolic Regression via Neural Networks

Identifying governing equations for a dynamical system is a topic of critical interest across an array of disciplines, from mathematics to engineering to biology. Machine learning – specifically deep learning – techniques have shown their capabilities in approximating dynamics from data, but a shortcoming of traditional deep learning is that there is little insight into the underlying mapping beyond its numerical output for a given input. This limits their utility in analysis beyond simple prediction. Simultaneously, a number of strategies exist which identify models based on a fixed dictionary of basis functions, but most either require some intuition or insight about the system, or are susceptible to overfitting or a lack of parsimony. Here we present a novel approach that combines the flexibility and accuracy of deep learning approaches with the utility of symbolic solutions: a deep neural network that generates a symbolic expression for the governing equations. We first describe the architecture for our model, then show the accuracy of our algorithm across a range of classical dynamical systems.
Read the full abstract

Spectral Theory

Sharp Dirichlet eigenvalue inequalities on triangles

We prove sharp Dirichlet eigenvalue inequalities for planar triangles. We settle a conjecture of Laugesen and Siudeja by showing that the equilateral triangle uniquely minimizes a scale-invariant functional of the first Dirichlet eigenvalue, area, and perimeter. Consequences include an optimal two-term lower bound for the first Dirichlet eigenvalue in terms of area and perimeter. We also prove a Cheeger-type inequality with an explicit best constant considered by Parini. To prove these conjectures we propose a new method for proving Dirichlet eigenvalue inequalities on triangles. Our method is based on a new computable lower bound for second-order directional shape derivatives under vertex perturbations. It also uses validated finite-element error estimates and recently developed analytic estimates for eigenvalues of nearly degenerate triangles. The method is not specific to the functionals considered in this paper and it can be used to prove various other eigenvalue inequalities on triangles.
Read the full abstract

Combinatorics

The pebbling number of Fibonacci cubes

The $n$-th Fibonacci cube $\Gamma_n$ is the subgraph of the hypercube $Q_n$ induced by binary strings with no two consecutive ones. We determine $\pi(\Gamma_n) = 2^n$ for $n \le 6$, so the pebbling number of $\Gamma_n$ equals that of the ambient hypercube $Q_n$ despite $\Gamma_n$ having far fewer vertices. The lower bound is a standard potential argument. For the upper bound, the Weight Function Lemma yields $2^n+1$ – one too many – so we close the gap by exhaustive MILP verification. We conjecture $\pi(\Gamma_n) = 2^n$ for all $n$.
Read the full abstract

2605.04328 · 5 May · v2: withdrawn. Mollard (Discrete Applied Mathematics 358, January 2025, Theorem 1) proves the pebbling number of the Fibonacci cube satisfies pi(Gamma_n) = 2^n for all n >= 1, strictly subsuming the n <= 6 result of this paper. Withdrawing to avoid duplication

Combinatorics · Cross-listed from cs.LG

On the Architectural Complexity of Neural Networks

We introduce a unified theoretical framework for the rigorous analysis and systematic construction of deep neural networks (DNNs). This framework addresses a gap in existing theory by explicitly modeling the structure of tensor operations – lower level information that is often abstracted. Our framework enables two novel objectives: (1) analysis of the evolution of architectural complexity over deep learning history, and (2) automatic construction of novel architectures based on new types of tensor operations. Our study of DNNs introduced over the past 40 years reveals a connection between groundbreaking architectures and increases in different types of architectural complexity. Moreover, we identify several large classes of higher complexity architectures that have not yet been explored. We then collect a dataset of 3,000+ higher complexity architectures, which we publicly release at: https://github.com/combinatoriallabs/ArchitecturalComplexity.
Read the full abstract

All authors Nicholas J. Cooper, François G. Meyer, Michael L. Roberts, Carlos Zapata-Carratalá, Lijun Chen, Danna Gurari