Peer Revenue Returns subject to peer review

Papers

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

Mathematics

math Watch Mathematics (sign in to use)

Wednesday 11 March

Optimization and Control

Equilibrium under Time-Inconsistency: A New Existence Theory by Vanishing Entropy Regularization

This paper develops a framework for establishing the existence of solutions to the equilibrium Hamilton-Jacobi-Bellman (EHJB) equation arising in time-inconsistent stochastic control problems. The time-inconsistency in our setting arises from the initial-time dependence such as the non-exponential discounting. The classical approach typically relates the existence of equilibrium to the classical solution of the EHJB, whose existence is still an open problem under general model assumptions. We resolve this challenge by building on a vanishing entropy regularization approach. Using fixed-point arguments, we first establish the existence of classical solutions to the exploratory equilibrium Hamilton-Jacobi-Bellman Equation (EEHJB) by deriving a series of delicate PDE estimates for the solution and its derivatives. Building on these estimates for the solution of the EEHJB and its derivatives, we then conduct a rigorous convergence analysis under suitable norms as the entropy regularization vanishes. Our main result shows that solutions of the EEHJB converge to a strong solution of the original EHJB, corresponding to the limit of the regularized equilibria. This convergence yields a verification argument ensuring that the limiting relaxed equilibrium indeed constitutes an equilibrium for the original time-inconsistent control problem. We thus establish the well-posedness of the EHJB and the existence of equilibria in diffusion models under time-inconsistency, without resorting to conventional stringent regularity assumptions of the EHJB.
Read the full abstract

All authors Zhenhua Wang, Xiang Yu, Jingjie Zhang, Zhou Zhou

Probability

Survival of a long random string among hard Poisson traps

In [AJM26], we gave large-time asymptotic bounds on the annealed survival probability of a moving polymer taking values in ${\mathbb R}^d, d \geq 1$. This polymer is a solution of a stochastic heat equation driven by additive spacetime white noise on $[0,T] \times [0,J]$, in an environment of Poisson traps. For fixed $J$, the annealed survivial probability decays exponentially with rate proportional to $T^{d/(d+2)}$. In this work we examine the large $J$ asymptotics of the annealed survival probability for any fixed time $T>0$. We prove upper and lower bounds for the annealed survival probability in the cases of hard obstacles. Our bounds decay exponentially with rate proportional to $J^{d/(d+2)}$. The exponents also depend on time $T >0$.
Read the full abstract

Probability

Optimising two-block averaging kernels to speed up Markov chains

We study the problem of selecting optimal two-block partitions to accelerate the mixing of finite Markov chains under group-averaging transformations. The main objectives considered are the Kullback-Leibler (KL) divergence and the Frobenius distance to stationarity. We establish explicit connections between these objectives and the induced projection chain. In the case of the KL divergence, this reduction yields explicit decay rates in terms of the log-Sobolev constant. For the Frobenius distance, we identify a Cheeger-type functional that characterises optimal cuts. This formulation recasts two-block selection as a structured combinatorial optimisation problem admitting difference-of-submodular decompositions. We further propose several algorithmic approximations, including majorisation-minimisation and coordinate descent schemes, as computationally feasible alternatives to exhaustive combinatorial search. Our numerical experiments reveal that optimal cuts under the two objectives can substantially reduce total variation distance to stationarity and demonstrate the practical effectiveness of the proposed approximation algorithms.
Read the full abstract

Combinatorics

On the minimum degree of minimal $k$-$\{1,2\}$-factor critical $k$-planar graphs

A graph of order $n$ is said to be $k$-factor-critical $(0\le k<n)$ if the removal of any $k$ vertices results in a graph with a perfect matching. A $k$-factor-critical graph $G$ is minimal if $G-e$ is not $k$-factor-critical for any edge $e$ in $G$. In 1998, Favaron and Shi posed the conjecture that every minimal $k$-factor-critical graph is of minimum degree $k+1$. A natural extension of this notion arises from $\{1,2\}$-factors. A spanning subgraph of $G$ is called a $\{1,2\}$-factor if each of its components is a regular graph of degree one or two. A graph is $k$-\emph{$\{1,2\}$-factor critical} if the removal of any $k$ vertices results in a graph with a $\{1,2\}$-factor. A recent conjecture in the area states that every minimal $k$-$\{1,2\}$-factor critical graph $G$ satisfies $k+1\le \delta(G)\le k+2$. In this paper, we prove that the conjecture holds for $k$-planar graphs, that is, graphs in which the deletion of any set of $k$ vertices yields a planar graph. In particular, this resolves the conjecture for planar graphs.
Read the full abstract

Combinatorics

Inequalities Involving Core, Corona, and Critical Sets in General Graphs

Let $\alpha(G)$ denote the cardinality of a maximum independent set. An independent set $I$ of $G$ is critical if $\left|I\right|-\left|N(I)\right|\ge\left|J\right|-\left|N(J)\right|$ for every independent set $J$ of $G$. Let $\text{core}(G)$ and $\text{corona}(G)$ be the intersection/union of all maximum independent sets of $G$. Let $\text{ker}(G)$ and $\text{diadem}(G)$ be the intersection/union of all critical independent sets of $G$. In this paper we prove that \[ \left|\text{corona}(G)\right|+\left|\text{core}(G)\right|\le2\alpha(G)+k, \] \noindent where $k$ is the number of vertex-distinct odd cycles in $G$, thus confirming a recent conjecture in the area. Moreover, we prove that \[ \left|\text{nucleus}(G)\right|+\left|\text{diadem}(G)\right|\le2\alpha(G), \] \noindent thereby confirming another conjecture (Levit–Mandrescu 2014). As an application of these facts, we obtain a chain of inequalities \[ \left|\text{nucleus}(G)\right|+\left|\text{diadem}(G)\right|\le2\alpha(G)\le\left|\text{corona}(G)\right|+\left|\text{core}(G)\right|\le2\alpha(G)+k. \] \noindent The paper concludes with a collection of related open problems.
Read the full abstract

Combinatorics

On Bipartite-Almost Bipartite Graphs and the Determinantal Factorization

A graph is almost bipartite if it contains exactly one odd cycle, and it is Konig-Egervary if the sum of the independence number and the matching number equals the order of the graph. We introduce the class of Bipartite-Almost Bipartite graphs (BAB-graphs), defined through a controlled union of a bipartite graph and several almost bipartite non-Konig-Egervary graphs. This family unifies and generalizes the previously studied classes of almost bipartite non-Konig-Egervary and R-disjoint graphs. While an almost bipartite non-Konig-Egervary graph contains a single odd cycle, an R-disjoint graph has exactly k pairwise disjoint odd cycles. A BAB-graph may contain many odd cycles that are not necessarily disjoint. We describe the structure of BAB-graphs by means of the Gallai-Edmonds decomposition and obtain explicit expressions for nucleus(G), diadem(G), and ker(G), which allow us to extend several known results for the previous classes. Moreover, we show that the determinant of the adjacency matrix of a BAB-graph can be factorized in terms of the determinants of the adjacency matrices of its component graphs. As a consequence, we confirm the conjecture stating the validity of this factorization for R-disjoint graphs. Finally, we derive combinatorial consequences of these results and establish new bounds for |corona(G)| + |ker(G)|.
Read the full abstract

Differential Geometry

The Kobayashi-Hitchin correspondence for nef and big classes

In this paper, we establish the Kobayashi-Hitchin correspondence for nef and big cohomology classes by introducing the notions of adapted closed positive $(1,1)$-currents and adapted Hermitian-Yang-Mills metrics. As applications, we investigate the equality cases of both the Bogomolov-Gieseker inequality for semistable reflexive sheaves with respect to big classes admitting a bimeromorphic Zariski decomposition and the Miyaoka-Yau inequality for projective varieties with big anti-canonical divisor.
Read the full abstract

Combinatorics

Refinements of Alon-Babai-Suzuki-type intersection theorems via non-shadows and binomial support

We prove a multilevel non-shadow refinement of the Alon–Babai–Suzuki (ABS) nonuniform restricted-intersection theorem. Let $K=\{k_1,\dots,k_r\}$ and let $L$ be a set with $|L|=s$. If $\mathcal{F}\subseteq \bigcup_{k\in K}\binom{[n]}{k}$ is $L$-intersecting and $k_i>s-r$ for every $i$, then $|\mathcal{F}| + \sum_{j=s-r+1}^{s} |\mathcal{N}_j(\mathcal{F})| \le N(n,s,r),$ equivalently $|\mathcal{F}| \le \sum_{j=s-r+1}^{s} |\partial_j\mathcal{F}|.$ Thus the ABS bound is sharpened by the total non-shadow deficit on the top $r$ levels. In the modular setting, we take a coefficient-sensitive viewpoint: the polynomial method depends not just on the degree of the annihilator polynomial $P_L(t)=\prod_{\ell\in L}(t-\ell)\in\mathbb{F}_p[t]$, but on which binomial terms actually appear in it. This yields a gap-free modular bound depending only on the active support levels of $P_L$. For almost-initial residue patterns $L=\{0,1,\dots,s-m-1\}\cup R \pmod p$ we obtain the collapse $|\mathcal{F}|\le \sum_{i=0}^{m}\binom{n}{s-i}.$ In particular, for consecutive residues $L=\{0,1,\dots,s-1\}\pmod p$ we get the sharp bound $|\mathcal{F}|\le \binom{n}{s}$, giving a partial negative answer to a question of Alon–Babai–Suzuki: the modular ABS bound $N(n,s,r)$ is not attainable in the consecutive-residue regime whenever $r\ge 2$.
Read the full abstract

Combinatorics

Binomial Random Matroids

Let $\mathcal B=\mathcal B_{k,n,p}$ be a random collection of $k$-subsets of $[n]$ where each possible set is present independently with probability $p$. Let $\cal E_{\mathcal B}$ be the event that $\mathcal B$ defines the set of bases of a matroid. We prove that If $p= 1-\frac{c_n}{(k(n-k)\binom nk)^{1/2}}$ where $0\leq c_n\leq \infty$, then \[ \lim_{n\to\infty}\Pr[\cal E_{\cal B}\mid |\cal B|\geq2]=\begin{cases}1&c_n\to0.\\e^{-c^2/2}&c_n\to c.\\0&c_n\to \infty.\end{cases}\] In addition, we identify a condition preventing the occurence of $\cal E_{\cal B}$ and prove a hitting time version for the occurence of $\cal B$. We also prove that when $\cal E_{\mathcal B}$ occurs, $\mathcal B$ defines a sparse paving matroid w.h.p. In addition, study a greedy algorithm that produces a random matroid defined by a collection of hyperplanes. We use this to improve the estimates in \cite{HPV} on $\log m(n,k),\log p(n,k), \log s(n,k)$ where $ m(n, k), p(n, k), s(n, k)$ denote the number of matroids, paving matroids, and sparse paving matroids (respectively) of rank $k$ on $[n]$. Our improvement lies in that we can deal with $k$ growing slowly with $n$ as opposed to $k=O(1)$ in \cite{HPV}. More generally, we obtain estimates for the number of matchings in nearly-regular hypergraphs with small codegree, which may be of independent interest.
Read the full abstract

Statistics Theory

Version-Robust Methods for Identifying Minimal Sufficient Statistics

Let $f_\theta$ be the joint density of a random sample $X$. A frequently used criterion asserts that a statistic $T(X)$ is minimal sufficient if, for any sample points $x$ and $y$, $T(x) = T(y)$ exactly when there exists a finite constant $h_{xy} > 0$, independent of $\theta$, such that $f_\theta(y) = f_\theta(x)h_{xy}$ for all $\theta$. We show that this criterion is false in general via a counterexample exploiting the non-uniqueness of versions of Radon–Nikodym derivatives. Although Sato (1996) established sufficient regularity conditions for the validity of this criterion, these conditions are frequently intractable to verify in practice. We resolve this limitation by introducing a version-robust method applicable whenever sufficiency is known. Moreover, our method allows us to generalize Sato's approach from Euclidean settings to arbitrary analytic Borel sample spaces and separable measurable statistic spaces. We also obtain a method for exponential-family densities under verifiable hypotheses. Taken together, these results clarify when pointwise likelihood-ratio arguments for minimal sufficiency are mathematically sound in irregular settings. Finally, we construct a counterexample demonstrating that a distinct criterion for minimal sufficiency due to Pfanzagl (1994, 2017) similarly fails in the absence of supplementary hypotheses. Identifying minimal sufficient statistics is important not only for parsimonious data reduction but also because, in models admitting complete sufficiency, such statistics provide a practical route to the complete sufficient structure underlying optimal estimation and prediction.
Read the full abstract

Tuesday 10 March

Mathematical Physics

General off-diagonal integrability of metric and nonmetric geometric flow and Finsler-Lagrange-Hamilton modified Einstein equations

Over the last seventy years, many Finsler-type geometric and modified gravity theories have been elaborated. They have been formulated in terms of different classes of Finsler generating functions, metric and nonmetric structures, nonlinear and linear connections, and various sets of postulated fundamental geometric objects with corresponding nonholonomic dynamical or evolution equations. In several approaches, the resulting gravitational and matter field equations were not completely defined geometrically, or were developed only for restricted models. We present a progress report with historical remarks and a summary of new results on Finsler - Lagrange - Hamilton geometric flow and gravity theories. Such theories can be constructed in an axiomatic form on (co) tangent Lorentz bundles as nontrivial modifications of Einstein gravity.
Read the full abstract

Dynamical Systems

The Geometry of Quasi-Cycles: How Stoichiometric Covariance Alters Pre-Bifurcation Signatures

Environmental enrichment can destabilize predator–prey coexistence through a Hopf bifurcation, yet real ecosystems are finite and intrinsically stochastic. We investigate how mechanistically derived demographic noise shapes near-Hopf dynamics in the Rosenzweig–MacArthur model by systematically comparing two diffusion closures that share identical deterministic drift but differ solely in predation-induced covariance structure. Starting from a continuous-time Markov chain description, we derive a full-covariance stochastic differential equation whose diffusion tensor inherits stoichiometric coupling, generating a negative prey–predator cross-covariance. This model is contrasted with a drift-matched diagonal-noise comparator. Using linear noise approximation, Lyapunov analysis, and matrix-valued power spectral density formulations, we propagate local covariance structure through the entire diagnostic chain, including stochastic sensitivity ellipses and a dimensionless noisy-precursor indicator. The results highlight that drift equivalence does not imply covariance equivalence and show how event-level noise geometry influences macroscopic behavior in nonlinear ecological systems. This work integrates bifurcation theory and stochastic analysis to advance multi-scale modeling of complex interacting systems.
Read the full abstract

All authors Louis Shuo Wang, Jiguang Yu, Ye Liang, Jilin Zhang

Dynamical Systems

Exploring Collatz Dynamics with Human-LLM Collaboration

We present a comprehensive structural analysis of the Collatz conjecture through ~1014 computational experiments yielding 630 formal results. By systematically deploying 29 distinct mathematical paradigms–including transfer operator spectral theory, S-unit equations, p-adic interpolation, martingale methods, modular sieving, formal language theory, cascade algebra, discrete logarithm obstruction, and Diophantine approximation–we establish a Paradigm Exhaustion Theorem: every known framework for promoting distributional convergence ("almost all orbits descend") to pointwise convergence ("all orbits descend") encounters an irreducible structural obstruction when applied to the Syracuse map. On the unconditional side, we prove: (i) the Syracuse transfer operator has a uniform spectral gap for all M, implying equidistribution modulo any power of 2; (ii) any nontrivial cycle of length L satisfies D > 2^F for all L >= 3, giving ord_D(2) > F and F+1 distinct residues mod D; (iii) divergent starting points have natural density 0 and Hausdorff dimension ~0.68; (iv) the formal language of divergent-compatible v-sequences is not context-free; (v) cylinder-averaged density-1 convergence is proved unconditionally via spectral contraction on the invariant core I_2; (vi) a discrete logarithm triple filter achieves 100% cycle blockage for all L tested. We identify the Distributional-to-Pointwise Gap as the irreducible core and prove it equivalent to the divergence component. The modular sieve is permanently nonempty via the Mersenne Bypass. The present work is not a proof of the Collatz conjecture; it characterizes why the conjecture resists proof. The 29-paradigm exhaustion constitutes the most comprehensive structural survey of Collatz attack surfaces to date. Produced through human-LLM collaboration; see Section 12.
Read the full abstract

Optimization and Control

Avoiding Semi-Infinite Programming in Distributionally Robust Control Based on Mean-Variance Metrics

Conventional stochastic control methods have several limitations. They focus on optimizing the average performance and, in some cases, performance variability; however, their problem settings still require an explicit specification of the probability distributions that determine the system's stochastic behavior. Distributionally robust control (DRC) methods have recently been developed to address these challenges. However, many DRC approaches involve handling infinitely many inequalities. For instance, DRC problems based on the Wasserstein distance are commonly obtained by solving semi-infinite programming (SIP) problems. Our proposed method eliminates the need for SIP when solving discrete-time, discounted, distributionally robust optimal control problems. By introducing a penalty term based on a specific distributional distance, we establish upper bounds, and under appropriate conditions, demonstrate the equivalence between distributionally robust optimization problems and mean-variance minimization problems. This reformulation reduces the original DRC problem to a discounted mean-variance cost optimization problem. In linear-quadratic regulator settings, the corresponding control laws are obtained by solving the Riccati equation. Numerical experiments demonstrate that the theoretical maximum value of the discounted cumulative cost for the proposed method is lower than that for the conventional method.
Read the full abstract

Numerical Analysis · Cross-listed from cs.LG

Estimating Condition Number with Graph Neural Networks

In this paper, we propose a fast method for estimating the condition number of sparse matrices using graph neural networks (GNNs). For efficient deployment of GNNs, we introduce a graph feature construction with $\mathrm{O}(\mathrm{nnz} + n)$ complexity, where $\mathrm{nnz}$ is the number of non-zero elements in the matrix and $n$ denotes the matrix dimension. We propose two schemes for estimating the matrix condition number using GNNs; one follows by decomposing the condition number and predicts the relatively more computationally intensive part $\|\mathbf{A}^{-1}\|$, without explicitly forming the inverse, while the other is to predict the whole condition number $\kappa$. Our approach can be extended to an arbitrary norm. Extensive experiments are conducted for the estimation of the 1-norm and 2-norm condition numbers, which show that our method achieves a significant speedup over the traditional numerical estimation methods. Our software for GNN condition number estimator is made publicly available at https://github.com/inEXASCALE/sparse-kappa.
Read the full abstract

Optimization and Control · Cross-listed from eess.SY

Optimal Control Synthesis of Closed-Loop Recommendation Systems over Social Networks

This paper addresses the problem of designing recommendation systems for social networks and e-commerce platforms from a control-theoretic perspective. We treat the design of recommendation systems as a state-feedback infinite-horizon optimal control problem with a performance index that (i) rewards alignment and engagement, (ii) penalizes polarization and large deviations from an uncontrolled baseline, and (iii) regularizes exposure across neighboring users. The recommendation entries are fed to the platform users, who are assumed to follow a networked, multi-topic, continuous-time opinion dynamics. We show that the designed control yields a stabilizing recommendation system under simple algebraic spectral conditions on the weights that encode the platform's preference for engagement, stability of preferences, polarization, and cross-user diversity. Conversely, we show that when ill-posed weights are selected in the optimal control problem (namely, when engagement is excessively rewarded), the closed-loop system can exhibit destabilizing, pathological behaviors that conflict with the design objectives.
Read the full abstract

Statistics Theory · Cross-listed from stat.ME

An operator-level ARCH Model

AutoRegressive Conditional Heteroscedasticity (ARCH) models are standard for modeling time series exhibiting volatility, with a rich literature in univariate and multivariate settings. In recent years, these models have been extended to function spaces. However, functional ARCH and generalized ARCH (GARCH) processes established in the literature have thus far been restricted to model “pointwise” variances. In this paper, we propose a new ARCH framework for data residing in general separable Hilbert spaces that accounts for the full evolution of the conditional covariance operator. We define a general operator-level ARCH model. For a simplified Constant Conditional Correlation version of the model, we establish conditions under which such models admit strictly and weakly stationary solutions, finite moments, and weak serial dependence. Additionally, we derive consistent Yule–Walker-type estimators of the infinite-dimensional model parameters. The practical relevance of the model is illustrated through simulations and a data application to high-frequency cumulative intraday returns.
Read the full abstract

All authors Alexander Aue, Sebastian Kühnert, Gregory Rice, Jeremy VanderDoes

Information Theory

Fly-PRAC: Packet Recovery for Random Linear Network Coding

Network Coding (NC) is a compelling solution for increasing network efficiency. However, it discards corrupted packets and cannot achieve optimal performance in noisy communications. Since most of the information in corrupted packets is error-free, discarding them is not the best strategy. Several packet recovery techniques such as PRAC and S-PRAC were proposed to exploit corrupted packets. Yet, they are slow and only practical when the packet size is small and communication channels are not very noisy. We propose a packet recovery scheme called Fly-PRAC to address these issues. Fly-PRAC exploits algebraic relations between a group of coded packets to estimate their corrupted parts and recovers them. Unlike previous schemes, Fly-PRAC can recover coded packets at the intermediate node without decoding them. We have compared Fly-PRAC against S-PRAC. Results show when the bit error rate ({\epsilon}) is 10^-4, Fly-PRAC outperforms S-PRAC by two folds for a payload of 900B. In two-hop communication with {\epsilon} = 10^-4 and a payload size of 500B, by enabling the recovery in the intermediate node, Fly-PRAC reduces transmissions by 16%. In a Sparse Network Coding (SNC) scenario, with two non-zero elements in the coefficient vectors and a payload of 800B, there is a reduction by 31% on average for decoding delay.
Read the full abstract

All authors Hosein K. Nazari, Stefan Senk, Peyman Pahlevani, Juan A. Cabrera, Frank H. P. Fitzek

Combinatorics · Cross-listed from cs.CG

Large chirotopes with computable numbers of triangulations

Chirotopes are a common combinatorial abstraction of (planar) point sets. In this paper we investigate decomposition methods for chirotopes, and their application to the problem of counting the number of triangulations supported by a given planar point set. In particular, we generalize the convex and concave sums operations defined by Rutschmann and Wettstein for a particular family of chirotopes (which they call chains), and obtain a precise asymptotic estimate for the number of triangulations of the double circle, using a functional equation and the kernel method.
Read the full abstract

All authors Mathilde Bouvel, Valentin Féray, Xavier Goaoc, Florent Koechlin

Numerical Analysis · Cross-listed from cs.NE

Intrinsic Numerical Robustness and Fault Tolerance in a Neuromorphic Algorithm for Scientific Computing

The potential for neuromorphic computing to provide intrinsic fault tolerance has long been speculated, but the brain's robustness in neuromorphic applications has yet to be demonstrated. Here, we show that a previously described, natively spiking neuromorphic algorithm for solving partial differential equations is intrinsically tolerant to structural perturbations in the form of ablated neurons and dropped spikes. The tolerance band for these perturbations is large: we find that as many as 32 percent of the neurons and up to 90 percent of the spikes may be entirely dropped before a significant degradation in the accuracy results. Furthermore, this robustness is tunable through structural hyperparameters. This work demonstrates that the specific brain-like inspiration behind the algorithm contributes to a significant degree of robustness expected from brain-like neuromorphic algorithms.
Read the full abstract

Number Theory

On the discrete convolution of the Liouville and Möbius functions

In this article we study some properties of the discrete convolution of Liouville function $S(n):=\sum_{m_{1}+m_{2}=n}\lambda\left(m_{1}\right)\lambda\left(m_{2}\right)$, which is a Goldbach-type counting function of representations. In particular, using the general approach introduced in a recent paper \cite{CGZ}, we will give an explicit formula for weighted averages of $S(n)$ with a general weights $f(w)$ that verify suitable conditions. This formula allows us to obtain interesting information about the Dirichlet and power series of $S(n)$ and the discrete convolution with an arbitrary numbers of factors $\lambda(n)$.
Read the full abstract

Information Theory · Cross-listed from quant-ph

Learning from Radio using Variational Quantum RF Sensing

In modern wireless networks, radio channels serve a dual role. Whilst their primary function is to carry bits of information from a transmitter to a receiver, the intrinsic sensitivity of transmitted signals to the physical structure of the environment makes the channel a powerful source of knowledge about the world. In this paper, we consider an agent that learns about its environment using a quantum sensing probe, optimised using a quantum circuit, which interacts with the radio-frequency (RF) electromagnetic field. We use data obtained from a ray-tracer to train the quantum circuit and learning model and we provide extensive experiments under realistic conditions on a localisation task. We show that using quantum sensors to learn from radio signals can enable intelligent systems that require no channel measurements at deployment, remain sensitive to weak and obstructed RF signals, and can learn about the world despite operating with strictly less information than classical baselines.
Read the full abstract

Geometric Topology

The AJ conjecture and connected sums of torus knots

The set of isotopy classes of nontrivial torus knots $T(p,q)$ in $S^3$ is in bijection with the set of coprime integer pairs $(p,q)$ satisfying $|p|>q\geq 2$. We verify the AJ conjecture for the connected sums $T(p,q)\# T(a,b)$ when $p$ and $a$ have the same sign. Notably, in cases where $pq=ab$ but $p\ne a$, the recurrence polynomial $\alpha(t,M,L)$ of $T(p,q)\#T(a,b)$ has repeated factors involving the variable $L$ after evaluation at $t=-1$. These appear to be the first examples of knots exhibiting this phenomenon. Therefore, the AJ conjecture requires a slight modification to accommodate this possibility.
Read the full abstract

Optimization and Control

A Trust-Region Interior-Point Stochastic Sequential Quadratic Programming Method

In this paper, we propose a trust-region interior-point stochastic sequential quadratic programming (TR-IP-SSQP) method for solving optimization problems with a stochastic objective and deterministic nonlinear equality and inequality constraints. In this setting, exact evaluations of the objective function and its gradient are unavailable, but their stochastic estimates can be constructed. In particular, at each iteration our method builds stochastic oracles, which estimate the objective value and gradient to satisfy proper adaptive accuracy conditions with a fixed probability. To handle inequality constraints, we adopt an interior-point method (IPM), in which the barrier parameter follows a prescribed decaying sequence. Under standard assumptions, we establish global almost-sure convergence of the proposed method to first-order stationary points. We implement the method on a subset of problems from the CUTEst test set, as well as on logistic regression problems, to demonstrate its practical performance.
Read the full abstract

All authors Yuchen Fang, Jihun Kim, Sen Na, James Demmel, Javad Lavaei

Statistics Theory · Cross-listed from stat.ML

A Diffusion Analysis of Policy Gradient for Stochastic Bandits

We study a continuous-time diffusion approximation of policy gradient for $k$-armed stochastic bandits. We prove that with a learning rate $\eta = O(\Delta^2/\log(n))$ the regret is $O(k \log(k) \log(n) / \eta)$ where $n$ is the horizon and $\Delta$ the minimum gap. Moreover, we construct an instance with only logarithmically many arms for which the regret is linear unless $\eta = O(\Delta^2)$.
Read the full abstract

Analysis of PDEs

A Uniqueness Condition for Conservation Laws with Discontinuous Gradient-Dependent Flux

The paper is concerned with a scalar conservation law with discontinuous gradient-dependent flux. Namely, the flux is described by two different functions $f(u)$ or $g(u)$, when the gradient $u_x$ of the solution is positive or negative, respectively. In the stable case where $f(u)<g(u)$ for all $u\in R$, it was proved in [1] that the limits of vanishing viscosity approximations form a contractive semigroup w.r.t. the $L^1$ distance. Further, they coincide with the limits of a suitable family of front tracking approximations. In the present paper we introduce a simple condition that guarantees that every weak, entropy admissible solution of a Cauchy problem coincides with the corresponding semigroup trajectory, and hence is unique.
Read the full abstract

Dynamical Systems

Random Dynamics of a Family of Cubic Polynomials

In this work, we study the non-autonomous dynamics generated by random iterations of the cubic family of the form $z^3 + cz$. The parameter sequence is chosen randomly from a bounded Borel subset of $\mathbb{C}$. We investigate topological properties of the corresponding Julia sets, with particular emphasis on conditions leading to total disconnectedness. We prove that the set of parameter sequences for which the Julia set is totally disconnected is dense in the parameter space. We also construct examples where the Julia set is totally disconnected but the associated non-autonomous system is not hyperbolic. Finally, under suitable probabilistic assumptions on the parameter distribution, we show that almost every sequence produces a totally disconnected Julia set.
Read the full abstract

Combinatorics

Relative Difference sets from Almost Perfect Nonlinear Functions

In this paper we explore a connection between certain Almost Perfect Nonlinear Functions (APN functions) and relative difference sets. In particular, we show that the image set of certain 2-to-1 APN functions is a relative difference set. Through a result of Pott this further provides a connection between APN functions and bent functions.
Read the full abstract

Analysis of PDEs

Emergent Loewner Dynamics in Slime Mold Growth

Growth fronts of slime molds are characterized through a direct geometric analysis based on Loewner evolutions, using experimentally acquired time-resolved images. The associated Loewner driving functions reconstructed from expanding pseudopod boundaries display statistical properties consistent with Gaussian-like behavior. A geometric estimate of the diffusivity parameter~$\kappa$ is inferred from fractal scaling, while Brownian diagnostics are assessed on the reconstructed driving signal. These findings show that the boundaries of a growing living organism display statistical and geometric properties consistent with emergent Loewner dynamics over experimentally accessible scales. This study establishes a quantitative framework for analyzing biological growth interfaces and suggests new connections between morphogenesis, stochastic geometry, and network reorganization under varying environmental conditions. We provide, to our knowledge, the first explicit reconstruction of a Loewner driving function from a living growth interface, revealing an emergent Brownian-like conformal growth regime at expanding fronts.
Read the full abstract

All authors Claire David, Aurèle Boussard, Nizare Riane, Michel L. Lapidus, Audrey Dussutour