Combinatorics · Cross-listed from cs.FL
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
Monday 23 March
We construct automata with input(s) in Fibonacci representation (also known as Zeckendorf representation) recognizing some basic arithmetic relations and study their number of states. We also consider some basic operations on Fibonacci-automatic sequences and discuss their state complexity. Furthermore, as a consequence of our results, we improve a bound in a recent paper of Bosma and Don. We also discuss the state complexity and runtime complexity of using a reasonable interpretation of Büchi arithmetic to actually construct some of the studied automata recognizing relations.
Analysis of PDEs
Time-periodic leapfrogging vortex rings in the 3D Euler equations
We prove the existence of time-periodic leapfrogging vortex rings for the three-dimensional incompressible Euler equations, thereby providing a rigorous realization of a phenomenon first conjectured by Helmholtz (1858). In the leapfrogging motion, two coaxial vortex rings periodically exchange positions, a striking behavior repeatedly observed in experiments and numerical simulations, yet lacking complete mathematical justification. Our construction relies on a desingularization of two interacting vortex filaments within the contour dynamics formulation, which yields a Hamiltonian description of nearly concentric vortex rings. The main difficulty stems from a singular small-divisor problem arising in the linearized transport dynamics, where the effective time scale degenerates with the ring thickness parameter. To overcome this obstruction, we develop a degenerate KAM-type analysis combined with pseudo-differential operator techniques to control the linearized dynamics around symmetric configurations. Combining these tools with a Nash-Moser iteration scheme, we construct families of nontrivial time-periodic solutions in an almost uniformly translating frame. This establishes the first rigorous construction of classical leapfrogging motion for axisymmetric Euler flows without swirl, with no restriction on the time interval of existence.
Read the full abstract
Optimization and Control
Compressed Distributed Stochastic Nonconvex Optimization with Differential Privacy
This paper studies distributed stochastic nonconvex optimization problems with compressed communication and differential privacy, in which each agent aims to minimize the sum of all agents' cost functions by using local compressed information exchange. To this end, we propose a compressed distributed stochastic gradient descent algorithm, which is robust under a general class of compression operators that allow both relative and absolute compression errors. We then show that the proposed algorithm finds the first-order stationary point for smooth nonconvex functions with the linear speedup convergence rate $\mathcal{O}(1/\sqrt{nT})$ and converges to the optimum if the global cost function additionally satisfies the Polyak–Łojasiewicz (P–Ł) condition with the convergence rate $\mathcal{O}(1/(nT^\theta)),\theta\in(0,1)$, where $T$ is the total number of iterations and $n$ is the number of agents. Furthermore, if the P–Ł ~constant is known in advance, we show that the proposed algorithm achieves a convergence rate $\mathcal{O}(1/(nT))$. Finally, we show that the proposed algorithm is able to achieve $(0,\delta)$-differential privacy without sacrificing convergence accuracy. Numerical experiments are carried out to
Read the full abstract
Probability
Individual-based stochastic model with unbounded growth, birth and death rates: a tightness result
We study population dynamics through a general growth/degrowth-fragmentation process, with resource consumption and unbounded growth/degrowth, birth and death rates. Our model is structured in a positive trait called energy (which is a proxy for any biological parameter such as size, age, mass, protein quantity...), and the jump rates of the process can be arbitrarily high depending on individual energies, which has not been considered yet in the literature. After a preliminary study to construct well-defined objects (which is necessary contrary to similar works, because of the explosion of individual rates), we consider a classical sequence of renormalizations of the underlying process and obtain a tightness result for the associated laws in large-population asymptotics. We characterize the accumulation points of this sequence as solutions of an integro-differential system of equations, which proves the existence of measure solutions to this system. Furthermore, if such a measure solution is unique, then our tightness result becomes a convergence result towards this unique process. We illustrate our work with the case of allometric rates (i.e. they are assumed to be power functions) and eventually present numerical simulations in this allometric setting.
Read the full abstract
Numerical Analysis
Piecewise-polynomial interpolations and quadratures for parametric PDEs with log-Laplace random inputs
We establish a sparsity in terms of $\ell_p$-summability and weighted $\ell_2$-summability for the coefficients of the Laguerre generalized piecewise-polynomial chaos expansion of solutions to parametric elliptic PDEs with log-Laplace random inputs. From the sparsity, we derive convergence rates for semi-discrete approximations with respect to parametric variables. These rates are valid for sparse-grid, piecewise-polynomial interpolations and the generated quadratures, and to related extended least-squares approximations and generated quadratures.
Read the full abstract
Combinatorics
On the transitivity of Gilbert graphs and their complements
The Gilbert graph $\text{Gilbert}(q,n,d)$, which arises naturally in graph theory and coding theory, is the regular graph on $\mathbb{F}_q^n$ in which two vertices are adjacent if their Hamming distance is less than $d$, and it is vertex-transitive. We classify all parameters $(q,n,d)$ for which $\text{Gilbert}(q,n,d)$ is edge-transitive or distance-transitive, and separately classify all parameters for which its complement has these properties. We prove that $\text{Gilbert}(q,n,d)$ is edge-transitive if and only if it is distance-transitive, and that this occurs precisely when $d=2$, $(q,d)=(2,3)$, or $(q,d)=(2,n)$. For the complement graphs, we determine all parameters yielding edge- or distance-transitivity using spectral methods based on Krawtchouk polynomials and the structure of the Hamming association scheme. In contrast to the Gilbert graphs, where the parameter sets corresponding to edge- and distance-transitivity coincide, we show that for their complements the set of parameters yielding distance-transitivity is strictly contained in the set yielding edge-transitivity. As an application, we compute the exact values of the Lovász $\vartheta$-function of Gilbert graphs, as well as of their complements, in all cases where either one of them is edge-transitive.
Read the full abstract
Combinatorics
Permutations with a fixed number of occurrences of a pattern: A case generalizing 231
We determine a set of permutation patterns $q$ so that the number of permutations with $r$ occurrences of $q$ is asymptotically $n^r$ times the number of permutations avoiding $q$, partially settling a conjecture of Conway and Guttman. We also use these asymptotics to prove nonrationality and nonalgebraicity for certain ordinary generating functions for permutations with $r$ copies of a pattern.
Read the full abstract
Number Theory
Proportion of periodic points in reduction of polynomials
In 2014, Juul, Kurlberg, Madhu and Tucker asked the following: given $K$ a number field and $f$ a rational function with coefficients in $K$, if $f_\mathfrak{p}$ denotes the reduction of $f$ modulo a prime ideal $\mathfrak{p}$ in the ring of integers of $K$, what is the limit inferior of the proportion of periodic points of $f_\mathfrak{p}$ when the norm of $\mathfrak{p}$ goes to infinity? Recent results of Fariña-Asategui and the author show that when $f$ is a polynomial of degree $d \geq 2$ non-linearly conjugate over $\mathbb{C}$ to a Chebyshev polynomial then the limit is zero. In this article, we address the remaining cases to give a complete classification of the problem in the case of polynomials.
Read the full abstract
Information Theory
Rateless DeepJSCC for Broadcast Channels: a Rate-Distortion-Complexity Tradeoff
In recent years, numerous data-intensive broadcasting applications have emerged at the wireless edge, calling for a flexible tradeoff between distortion, transmission rate, and processing complexity. While deep learning-based joint source-channel coding (DeepJSCC) has been identified as a potential solution to data-intensive communications, most of these schemes are confined to worst-case solutions, lack adaptive complexity, and are inefficient in broadcast settings. To overcome these limitations, this paper introduces nonlinear transform rateless source-channel coding (NTRSCC), a variable-length JSCC framework for broadcast channels based on rateless codes. In particular, we integrate learned source transformations with physical-layer LT codes, develop unequal protection schemes that exploit decoder side information, and devise approximations to enable end-to-end optimization of rateless parameters. Our framework enables heterogeneous receivers to adaptively adjust their received number of rateless symbols and decoding iterations in belief propagation, thereby achieving a controllable tradeoff between distortion, rate, and decoding complexity. Simulation results demonstrate that the proposed method enhances image broadcast quality under stringent communication and processing budgets over heterogeneous edge devices.
Read the full abstract
Dynamical Systems
An algorithm to detect and rigorously verify blenders
We present a characterisation of blenders based on mapping properties of certain sets of curves that can be rigorously verified by computer-assisted methods. We develop an algorithm to construct these sets of curves that requires only a rough approximation of the strong unstable direction in a prescribed region. Since our approach does not rely on precise data, such as the exact location of invariant manifolds or fixed points, it provides a systematic framework to verify blenders in explicit examples. Here, we apply this framework to rigorously verify that a family of three-dimensional Hénon-like maps presents blenders.
Read the full abstract
Analysis of PDEs
Nonexistence of multi-bubble radial solutions to the 3D energy critical wave equation
In this work we consider the focusing, energy-critical wave equation in 3D radial case. It has been verified that any global or type II blow-up solution decomposes into a superposition of several decoupled grounds states, a free wave and a small error, as time tends to infinity or the blow-up time. This is usually called soliton resolution. However, all known examples of soliton resolution in the 3D radial case come with no more than one soliton. In this work we prove the nonexistence of any global or type II blow up solution with two or more solitons, thus give a complete classification of asymptotic behaviours of radial solutions.
Read the full abstract
Mathematical Physics · Cross-listed from quant-ph
Thermal expectation estimation via single-trajectory Gibbs sampling with non-destructive measurements
Estimating thermal expectation values of quantum many-body systems is a central challenge in physics, chemistry, and materials science. Standard quantum Gibbs sampling protocols address this task by preparing the Gibbs state from scratch after every measurement, incurring a full mixing time cost at each step. Recent advances in single-trajectory Gibbs sampling [Jiang et al. 2026] substantially reduce this overhead: once stationarity is reached, measurements can be collected along a single trajectory without re-thermalizing, provided the measurement channel preserves the Gibbs ensemble. However, explicit constructions of such non-destructive measurements have been limited primarily to observables that commute with the Hamiltonian. In this work, we fundamentally extend the single-trajectory framework to arbitrary, non-commuting observables. We provide two measurement constructions that extract measurement information without fully destroying the Gibbs state, thereby eliminating the need for full re-mixing between samples. First, we construct a measurement that satisfies exact detailed balance. This ensures the system remains in equilibrium throughout the trajectory, allowing measurement outcomes to decorrelate in an autocorrelation time that could be significantly shorter than the global mixing time. Second, assuming the underlying quantum Gibbs sampler has a positive spectral gap, we design a simplified measurement scheme that ensures the post-selected state serves as a warm start for rapid re-mixing. This approach successfully decouples the resampling cost from the global mixing time. Both measurement schemes admit efficient quantum circuit implementations, requiring only polylogarithmic Hamiltonian simulation time.
Read the full abstract
Information Theory
Spatio-Temporal Attention Enhanced Multi-Agent DRL for UAV-Assisted Wireless Networks with Limited Communications
In this paper, we employ multiple UAVs to accelerate data transmissions from ground users (GUs) to a remote base station (BS) via the UAVs' relay communications. The UAVs' intermittent information exchanges typically result in delays in acquiring the complete system state and hinder their effective collaboration. To maximize the overall throughput, we first propose a delay-tolerant multi-agent deep reinforcement learning (MADRL) algorithm that integrates a delay-penalized reward to encourage information sharing among UAVs, while jointly optimizing the UAVs' trajectory planning, network formation, and transmission control strategies. Additionally, considering information loss due to unreliable channel conditions, we further propose a spatio-temporal attention based prediction approach to recover the lost information and enhance each UAV's awareness of the network state. These two designs are envisioned to enhance the network capacity in UAV-assisted wireless networks with limited communications. The simulation results reveal that our new approach achieves over 50% reduction in information delay and 75% throughput gain compared to the conventional MADRL. Interestingly, it is shown that improving the UAVs' information sharing will not sacrifice the network capacity. Instead, it significantly improves the learning performance and throughput simultaneously. It is also effective in reducing the need for UAVs' information exchange and thus fostering practical deployment of MADRL in UAV-assisted wireless networks.
Read the full abstract
Analysis of PDEs
Higher-order derivative estimates for the parabolic Lamé system on a smooth bounded domain
We consider the parabolic Lamé system on a bounded domain. We focus on two types of inequalities for higher-order derivatives of solutions. The first is related to an $L^p$-$L^p$ estimate locally in time in the Lebesgue space setting, which includes the endpoint cases $p=1$ and $p=\infty$. The second concerns an equivalent norm of Besov spaces by means of the solution of the parabolic Lamé system.
Read the full abstract
Combinatorics
Characterization of strongly $\mathbb{Z}_\ell$-connected graphs of small order
A graph is strongly $\Z_{\ell}$-connected if for each boundary function $\beta: V(G)\mapsto \Z_{\ell}$ with $\beta(v) \equiv d(v) \pmod{2}$ for every vertex $v$ and $\sum_{v \in V(G)} \beta(v) \equiv 0 \pmod{2\ell}$, there exists an orientation $D$ of $G$ such that $d_D^+(v) - d_D^-(v) \equiv \beta(v) \pmod{2\ell}$ for each $v \in V(G)$. This is a useful notion for studying circular flows of graphs. This note presents a fully self-contained, manual proof of a characterization of $4$-vertex strongly $\mathbb{Z}_\ell$-connected graphs for any integer $\ell\geq 2$, which will be used in our further study in this topic.
Read the full abstract
Statistics Theory
Feature Incremental Clustering with Generalization Bounds
In many learning systems, such as activity recognition systems, as new data collection methods continue to emerge in various dynamic environmental applications, the attributes of instances accumulate incrementally, with data being stored in gradually expanding feature spaces. How to design theoretically guaranteed algorithms to effectively cluster this special type of data stream, commonly referred to as activity recognition, remains unexplored. Compared to traditional scenarios, we will face at least two fundamental questions in this feature incremental scenario. (i) How to design preliminary and effective algorithms to address the feature incremental clustering problem? (ii) How to analyze the generalization bounds for the proposed algorithms and under what conditions do these algorithms provide a strong generalization guarantee? To address these problems, by tailoring the most common clustering algorithm, i.e., $k$-means, as an example, we propose four types of Feature Incremental Clustering (FIC) algorithms corresponding to different situations of data access: Feature Tailoring (FT), Data Reconstruction (DR), Data Adaptation (DA), and Model Reuse (MR), abbreviated as FIC-FT, FIC-DR, FIC-DA, and FIC-MR. Subsequently, we offer a detailed analysis of the generalization error bounds for these four algorithms and highlight the critical factors influencing these bounds, such as the amounts of training data, the complexity of the hypothesis space, the quality of pre-trained models, and the discrepancy of the reconstruction feature distribution. The numerical experiments show the effectiveness of the proposed algorithms, particularly in their application to activity recognition clustering tasks.
Read the full abstract
Numerical Analysis
A fully decoupled and structure-preserving relaxation Crank–Nicolson finite element method for Gross–Pitaevskii–Poisson model
We propose a fully decoupled, structure-preserving relaxation Crank–Nicolson finite element method (FEM) for the coupled Gross–Pitaevskii–Poisson (GPP) system modeling ultracold plasmas. By introducing suitable auxiliary variables to reformulate the nonlinear interaction and charge density terms, the original system is recast into an equivalent form that enables a linear, fully decoupled numerical scheme. The proposed method preserves key physical invariants, including the mass of each component and a modified discrete energy, at the fully discrete level. We establish the well-posedness and uniqueness of the scheme and rigorously derive optimal error estimates, achieving second-order accuracy in time and optimal $(k+1)$-th order convergence in space for $P^k$ finite element approximations. Numerical experiments confirm the theoretical results and demonstrate the effectiveness of the method in preserving conservation properties and accurately capturing complex dynamical behaviors of the coupled GPP system.
Read the full abstract
Algebraic Geometry
Polyptych lattices and marked chain-order polytopes
The theory of polyptych lattices is a framework to obtain a family of toric degenerations whose polytopes are related by piecewise-linear transformations. It can be regarded as a generalization of toric degenerations arising from cluster algebras. In this paper, we study polyptych lattices consisting of transfer maps for marked chain-order polytopes, and obtain a family of toric degenerations of a projective variety to marked chain-order polytopes for the Gelfand-Tsetlin poset. We also compute the Cox ring of this projective variety.
Read the full abstract
Commutative Algebra
Cohen-Macaulay approximations over generically Gorenstein rings
Let $(R,\mathfrak{m})$ be a Cohen-Macaulay local ring with canonical module that is generically Gorenstein. In this paper, I prove isomorphisms relating the minimal MCM approximations and minimal FID hulls of modules constructed from a canonical ideal $\,\omega \subset R$, including $\,\omega/xR$, with $\,x \in \omega\,$ a nonzerodivisor, $\,(\omega/xR)^{\vee}:=\text{Ext}^1_R(\omega/xR,\omega)$, $\,R/\omega^2$, and $\,\omega/\omega^2$. I also prove that if $R$ is not Gorenstein, then $\delta_{R}\left(\omega/xR \right)=\delta_{R}\left(\left(\omega/xR \right)^{\vee} \right)=0\,$ and $\,\gamma_{R}\left(\Omega^{1}_{R}\left(\omega/xR \right) \right)=\gamma_{R}\left(\Omega^{1}_{R}\left(\left(\omega/xR\right)^{\vee}\right) \right)=0$, where $\delta_R$ is Auslander's $\,\delta$-invariant and $\gamma_R$ is the dual $\gamma$-invariant.
Read the full abstract
Algebraic Geometry
On superspecial hyperelliptic curves of genus 5 whose automorphism groups contain $(\mathbb{Z}/2\mathbb{Z})^3$
While the numbers of superspecial curves of genus at most 3 are well understood, and several computational approaches have been developed to count superspecial curves of genus 4 with large automorphism groups, much less is known in higher genera. In this paper, we construct a feasible algorithm to enumerate superspecial hyperelliptic curves of genus 5 whose automorphism groups contain $(\mathbb{Z}/2\mathbb{Z})^3$. We implement and executing our algorithm in Magma, we succeeded in enumerating such superspecial curves in every characteristic $11 < p < 1000$.
Read the full abstract
Numerical Analysis
Stability and Bifurcation Analysis of Nonlinear PDEs via Random Projection-based PINNs: A Krylov-Arnoldi Approach
We present a numerical framework for the stability and bifurcation analysis of nonlinear partial differential equations (PDEs) in which the solutions are sought in the function space spanned by physics-informed random projection neural networks (PI-RPNNs), and discretized via a collocation approach. These are shallow, single-hidden-layer networks with randomly sampled and fixed a priori hidden-layer weights; only the linear output layer weights are optimized, reducing training to a single least-squares solve. This linear output structure enables the explicit generalized eigenvalue formulation governing the linear stability of stationary solutions, separating the physical domain interior dynamics from the algebraic constraints imposed by boundary conditions (BCs), at no additional training cost and without requiring additional PDE solves. However, the random projection collocation matrix is inherently numerically rank-deficient, rendering naive eigenvalue computation unreliable and contaminating the true eigenvalue spectrum with spurious near-zero modes. To overcome this limitation, we introduce a matrix-free shift-invert Krylov-Arnoldi method that operates directly in weight space, avoiding explicit inversion of the numerically rank-deficient collocation matrix and enabling the reliable computation of several leading eigenpairs of the physical Jacobian - the discretized Frechet derivative of the PDE operator with respect to the solution field, whose eigenvalue spectrum determines linear stability. We further prove that the PI-RPNN-based generalized eigenvalue problem is almost surely regular, guaranteeing solvability with standard eigensolvers, and that the singular values of the random projection collocation matrix decay exponentially for analytic activation functions, rigorously explaining the observed ill-conditioning.
Read the full abstract
Information Theory · Cross-listed from cs.IR
Toward a Theory of Hierarchical Memory for Language Agents
Many recent long-context and agentic systems address context-length limitations by adding hierarchical memory: they extract atomic units from raw data, build multi-level representatives by grouping and compression, and traverse this structure to retrieve content under a token budget. Despite recurring implementations, there is no shared formalism for comparing design choices. We propose a unifying theory in terms of three operators. Extraction ($\alpha$) maps raw data to atomic information units; coarsening ($C = (\pi, \rho)$) partitions units and assigns a representative to each group; and traversal ($\tau$) selects which units to include in context given a query and budget. We identify a self-sufficiency spectrum for the representative function $\rho$ and show how it constrains viable retrieval strategies (a coarsening-traversal coupling). Finally, we instantiate the decomposition on eleven existing systems spanning document hierarchies, conversational memory, and agent execution traces, showcasing its generality.
Read the full abstract
Geometric Topology
The non-peripheral curve graph and divergence in big mapping class groups
We introduce a numerical invariant $\zeta(\Sigma)$ measuring the end-complexity of $\Sigma$ and use it to organize coarse-geometric features of Map($\Sigma$). Our main tool is the non-peripheral curve graph $C_{\rm np}(\Sigma)$, whose vertices are those essential simple closed curves that cannot be pushed out of every compact subsurface, with edges given by disjointness. Assuming Map($\Sigma$) is CB-generated and $\zeta(\Sigma)\ge 5$, we prove that $C_{\rm np}(\Sigma)$ is connected, has infinite diameter, is Gromov hyperbolic, and that the Map($\Sigma$)-action has unbounded orbits. As applications, we show that if $\zeta(\Sigma)\ge 4$ then Map($\Sigma$) has infinite coarse rank, and if $\zeta(\Sigma)\ge 5$ then Map($\Sigma$) has at most quadratic divergence, hence is one-ended.
Read the full abstract
Number Theory
On the series expansion of the secondary zeta function about $s=1$ and its coefficients
The secondary zeta function is defined as a generalized zeta series over the imaginary parts of non-trivial zeros assuming (RH). This function admits Laurent series expansion at the double pole at $s=1$. In this article, we derive a new formula for the expansion coefficients of the regular part, which is similar to the Stieltjes constants formula for the Riemann zeta function. We also numerically verify and compute the new formula to high precision for several test cases. Lastly, we also apply the Brent's (BPT) Theorem for improving convergence of the main formula.
Read the full abstract
Optimization and Control
Sinkhorn algorithms for entropic vector quantile regression
Vector quantile regression (VQR) is an optimal transport (OT)-based framework that extends linear quantile regression to vector-valued response variables and can be formulated as an OT problem with a mean-independence constraint. In this paper, we study Sinkhorn-type algorithms for VQR with entropic regularization, building on the authors' previous work on its duality theory. We first study a direct adaptation of the classical Sinkhorn iteration based on solving the full Schrödinger-type system characterizing the dual potentials, which requires solving an implicit functional equation at each iteration. Since the implicit equation does not admit a closed-form solution in general, we consider a modified algorithm that replaces the implicit update with a gradient ascent step, resulting in a computational scheme that does not involve any subroutine. The latter algorithm can be viewed as an implementable version of the former, idealized scheme that serves as a theoretical benchmark. For both algorithms, and for general compactly supported marginals, we establish linear convergence in both the dual objective value and the iterates. A key innovation in our analysis is the derivation of explicit quantitative bounds on the dual potentials and Sinkhorn iterates.
Read the full abstract
Combinatorics
Perfect divisibility and perfect-Pollyanna in bull-free graphs
A graph $G$ is perfectly divisible if, for each induced subgraph $H$ of $G$, $V(H)$ can be partitioned into $A$ and $B$ such that $H[A]$ is perfect and $\omega(H[B])<\omega(H)$. A bull is a graph consisting of a triangle with two disjoint pendant edges. Hoàng [Discrete Math. 349 (2026) 114809] proposed four conjectures: 1. $P_5$-free graphs are perfectly divisible; 2. Odd hole-free graphs are perfectly divisible; 3. Even hole-free graphs are perfectly divisible; and 4. $4K_1$-free graphs are perfectly divisible. Karthick et al. [Electron. J. Combin. 29 (2022) P3.19] proposed a conjecture: Fork-free graphs are perfectly divisible. In this paper, we prove that all of five conjectures above hold for bull-free graphs. Our results also generalize some results of Chudnovsky and Sivaraman [J. Graph Theory 90 (2019) 54–60] and Karthick et al. [Electron. J. Combin. 29 (2022) P3.19]. We say that a class ${\cal C}$ is perfect-Pollyanna if ${\cal C}\cap {\cal G}$ is perfectly divisible for any hereditary class ${\cal G}$ in which each triangle-free graph is 3-colorable. Let $H\in\{\text{house, hammer, diamond}\}$. In this paper, we prove that the class of $(\text{bull}, H)$-free graphs is perfect-Pollyanna. Let ${\cal C}$ be the class of $(\text{bull}, H)$-free graphs. This implies that ${\cal C}\cap {\cal G}$ is perfectly divisible if and only if all of triangle-free graphs in ${\cal G}$ are perfectly divisible. As corollaries, we show that $(\text{bull},{\cal H})$-free graphs are perfectly divisible, where ${\cal H}$ is one of $\{P_{11},C_4\},\{P_{14},C_5,C_4\}$, and $\{P_{17},C_6,C_5,C_4\}$.
Read the full abstract
Dynamical Systems
Singularity for graph-directed conjugate equations indexed by a two-vertex digraph
We study graph-directed conjugate functional equations on the unit interval indexed by the complete digraph with self-loops on two vertices. We focus on the singularity and regularity of the solutions for compatible systems of weak contractions. First, we show that both solutions are singular in the affine case unless the two systems coincide; second, we obtain a dichotomy between singularity and smoothness for a class of linear fractional systems; and finally, we give a sufficient condition for singularity in a non-linear setting.
Read the full abstract
Number Theory
On the series expansion of the prime zeta function about $s=1$ and its coefficients
In this article, we derive a series expansion of the prime zeta function about the $s=1$ logarithmic singularity and prove general formula for its expansion coefficients, which is similar to the Stieltjes expansion coefficients for the Riemann zeta function. These results can also be viewed as a generalization of Mertens's Theorems to higher order. We also numerically verify and compute the presented formulas to high precision for several test cases.
Read the full abstract
Numerical Analysis · Cross-listed from cs.LG
Generalization Limits of In-Context Operator Networks for Higher-Order Partial Differential Equations
We investigate the generalization capabilities of In-Context Operator Networks (ICONs), a new class of operator networks that build on the principles of in-context learning, for higher-order partial differential equations. We extend previous work by expanding the type and scope of differential equations handled by the foundation model. We demonstrate that while processing complex inputs requires some new computational methods, the underlying machine learning techniques are largely consistent with simpler cases. Our implementation shows that although point-wise accuracy degrades for higher-order problems like the heat equation, the model retains qualitative accuracy in capturing solution dynamics and overall behavior. This demonstrates the model's ability to extrapolate fundamental solution characteristics to problems outside its training regime.
Read the full abstract
Combinatorics · Cross-listed from cs.GT
Stationary Online Contention Resolution Schemes: Theory and Applications to Bayesian Online Resource Allocation
Motivated by problems in Bayesian reusable resource allocation, we introduce the concept of stationary online contention resolution schemes (S-OCRSs). OCRSs are a central tool used to solve non-reusable resource allocation problems. They convert solutions to fluid approximations of problems into feasible online policies while approximately preserving allocation probabilities. S-OCRSs depart from standard OCRSs in that they ensure that the probability of allocating any given set of resources is independent of the arrival order of requests. We show how S-OCRSs can be used to solve reusable resource allocation problems, and discuss a general 'maximum-entropy' approach to construct and analyze S-OCRSs. Our approach, using a unified method for a variety of feasibility constraints, obtains results that match the state-of-the-art for OCRSs, and even improves it for a bipartite matching feasibility constraint. Our results for reusable resource allocation also extend to the assortment optimization setting, and our policies can be implemented using prices.