Dynamical Systems
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
Wednesday 18 February
In this study, we investigate the existence of traveling wave solutions for a SIR model on two-dimensional lattice. The existence of traveling waves is established within the framework of upper and lower solutions and the Schauder fixed-point theorem. Moreover, we construct a Lyapunov functional to analyze the asymptotic behavior of the traveling wave solutions. This is a challenging task due to the two-dimensional lattice structure.
Optimization and Control
Metaheuristic algorithms for the induced P-median problem with upgrades
Facility location problems (FLPs) are a family of optimisation problems with significant social impact. This class of problems has been the subject of study since the 1960s, with classical approaches including the Weber problem and the p-Median problem. Currently, more complex variations of these problems are being investigated. In particular, the Induced p-Median Problem with Upgrades (IpMU) represents a variation of the classical p-Median problem, where the concepts of transport cost and time are separated as distinct metrics in the input graph of the problem. Furthermore, the problem includes a budget which allows one to relax the graph costs, reducing the cost of the edges, thus improving the associated routes between the designated medians and the customers. In this study, a metaheuristic algorithm, based on the Greedy Randomized Adaptive Search Procedure (GRASP), is proposed. A two-phase resolution scheme is defined, studying the median problem and the upgrading problem independently. In this approach, a larger set of state-of-the-art instances was analysed to ensure a fair comparison with previous proposals. In addition, the characteristics of the instances were studied to assess their complexity. The results obtained are promising when compared to the state-of-the-art, which is based entirely on mathematical programming models. The execution time was improved on average by two orders of magnitude for the harder instances, and the best known result was obtained in more than 99% of the tested instances.
Read the full abstract
Algebraic Geometry
Proof of Miyanishi's conjecture on endomorphisms of varieties
If $X$ is a quasi-projective variety over a field $k$ and $\phi$ a birational endomorphism of $X$ that is injective outside a closed subset of codimension $\geq 2$, we prove that $\phi$ is an automorphism. This generalizes an old theorem of Ax and proves a conjecture of Miyanishi. A key step in our proof is a finiteness result on class groups, which is of interest in its own right.
Read the full abstract
Analysis of PDEs
Global dynamic stability of contact lines in fluids: 2-D droplet problem
In this paper, we investigate the dynamics of an incompressible viscous Navier-Stokes fluid evolving above a one-dimensional flat surface. The fluid is subject to a uniform gravitational field and capillary forces acting along the free boundary. The interface between the fluid and the surrounding air is a free surface whose motion is driven by gravity, surface tension, and the fluid velocity field. The triple-phase intersections where the fluid, the air above the vessel, and the solid vessel wall meet are referred to as contact points, and the angles formed there are called contact angles. The model under consideration incorporates boundary conditions that allow for full motion of the contact points and dynamic contact angles. Under these conditions, \cite{Yang} established the existence of equilibrium configurations for the model. These equilibria consist of a quiescent fluid occupying a domain whose upper boundary can be represented as the graph of a function in polar coordinates, minimizing a gravity-capillary energy functional subject to a fixed mass constraint. The equilibrium contact angles may take any value in $(0,\pi)$ depending on the choice of capillary parameters. In the present work, we develop a framework of a priori estimates for this model. We prove that, for initial data sufficiently close to equilibrium, the system admits global solutions that converge exponentially fast to a (horizontally) shifted equilibrium state.
Read the full abstract
Number Theory
Quantum modularity of signatures in TQFT and generalized Dedekind sums
We prove the quantum modularity of the signature of $ \mathrm{SU}(2) $-TQFT for a genus 2 surface, which was conjectured by Marché–Masbaum in 2025. Our approach is based on a quantum modularity of generalized Dedekind sums associated with general modular forms. In the case of Eisenstein series for $ \Gamma(N) $, these generalized Dedekind sums admit trigonometric sum expressions, which coincide with the formula for the $ \mathrm{SU}(2) $-TQFT signature. Furthermore, we express both the $ \mathrm{SU}(2) $-TQFT and generalized Dedekind sums as radial limits of Eichler integrals.
Read the full abstract
Combinatorics
The Smallest String Attractors of Fibonacci, Period-Doubling, and Thue–Morse Words
A string attractor of a string $T[1..|T|]$ is a set of positions $\Gamma$ of $T$ such that any nonempty substring $w$ of $T$ has an occurrence that crosses a position in $\Gamma$, i.e., there is a position $i$ such that $w = T[i..i+|w|-1]$ and the intersection $[i,i+|w|-1]\cap \Gamma$ is nonempty. The size of the smallest string attractor of Fibonacci words and period-doubling words of length at least $2$ is known to be $2$. The size of the smallest string attractor of Thue–Morse words of length at least $25$ is known to be $4$. We completely characterize the set of all smallest string attractors of Fibonacci words, period-doubling words, and Thue–Morse words. For Fibonacci words, we show a recursive formula describing the $2^{n-4} + 2^{\lceil n/2 \rceil - 2}$ distinct position pairs that are the smallest string attractors of the $n$th Fibonacci word for $n \geq 7$. For period-doubling words, we show that the $n$th period-doubling word has exactly two smallest string attractors for every $n\geq 2$, and give them explicitly. For Thue–Morse words, we show a formula describing the 32 sets of four positions that are the smallest string attractors of the $n$th Thue–Morse word for $n\geq 6$. Our results show that strings with the same smallest attractor size can have a drastically different number of distinct smallest attractors.
Read the full abstract
Optimization and Control
Null controllability of one-dimensional quasilinear parabolic equations via multiplicative controls
This paper is concerned with the null controllability problem for a class of quasilinear parabolic equations under multiplicative control, locally supported in space. For the purpose of proving the existence of a multiplicative control forcing the solution rest at a time $T>0$, we need to establish the decay property of solutions for the system without control first. We have obtained decay estimates for the $L^\infty$-norm and the $H^1$-norm of solutions to the homogenous quasilinear parabolic equations. Notably, the decay of the $L^\infty$-norm requires no smallness condition on the initial data, whereas the decay of the $H^1$-norm requires that the $L^\infty$-norm remains small. Based on the decay estimates and maximum modulus estimate of solutions to quasilinear parabolic equations, together with the local null controllability of quasilinear parabolic equations under additive controls, we prove the null controllability of the quasilinear parabolic equations via multiplicative controls. As a byproduct, we also obtain the global null controllability for large time to the quasilinear parabolic equations via additive controls. Given that the controllability under multiplicative control is achieved over a long time horizon, we finally investigate the existence of time optimal control.
Read the full abstract
Optimization and Control
Local adapt-then-combine algorithms for distributed nonsmooth optimization: Achieving provable communication acceleration
This paper is concerned with the distributed composite optimization problem over networks, where agents aim to minimize a sum of local smooth components and a common nonsmooth term. Leveraging the probabilistic local updates mechanism, we propose a communication-efficient Adapt-Then-Combine (ATC) framework, FlexATC, unifying numerous ATC-based distributed algorithms. Under stepsizes independent of the network topology and the number of local updates, we establish sublinear and linear convergence rates for FlexATC in convex and strongly convex settings, respectively. Remarkably, in the strong convex setting, the linear rate is decoupled from the objective functions and network topology, and FlexATC permits communication to be skipped in most iterations without any deterioration of the linear rate. In addition, the proposed unified theory demonstrates for the first time that local updates provably lead to communication acceleration for ATC-based distributed algorithms. Numerical experiments further validate the efficacy of the proposed framework and corroborate the theoretical results.
Read the full abstract
Statistics Theory
Ratio Covers of Convex Sets and Optimal Mixture Density Estimation
We study density estimation in Kullback-Leibler divergence: given an i.i.d. sample from an unknown density $p^\star$, the goal is to construct an estimator $\widehat{p}$ such that $\mathrm{KL}(p^\star,\widehat{p})$ is small with high probability. We consider two fundamental settings involving a finite dictionary of densities: (i) model aggregation, where $p^\star$ belongs to the dictionary, and (ii) convex aggregation (mixture density estimation), where $p^\star$ is a mixture of densities from the dictionary. Crucially, we make no assumption on the base densities: their ratios may be unbounded and their supports may differ. For both problems, we identify the best possible high-probability guarantees in terms of the dictionary size, sample size, and confidence level. These optimal rates are higher than those achievable when density ratios are bounded by absolute constants; for mixture density estimation, they match existing lower bounds in the special case of discrete distributions. Our analysis of the mixture case hinges on two new covering results. First, we provide a sharp, distribution-free upper bound on the local Hellinger entropy of the class of mixtures of $M$ distributions. Second, we prove an optimal ratio covering theorem for convex sets: for every convex compact set $K \subset \mathbb{R}_+^d$, there exists a subset $A \subset K$ with at most $2^{O(d)}$ elements such that each element of $K$ is coordinate-wise dominated by an element of $A$ up to a universal constant factor. This geometric result is of independent interest; notably, it yields new cardinality estimates for $\varepsilon$-approximate Pareto sets in multi-objective optimization with convex feasible set.
Read the full abstract
Combinatorics
Gödel Implication on Finite Chains: Catalan Enumeration and a Continuum Limit Law
We study the distribution of output values produced by all fully bracketed implication terms on $n$ distinct variables in Gödel $m$-valued logic on the finite chain $V_m$. The Catalan decomposition of bracketings yields a stratified system of recurrences for the output counts. Passing to tail sums reduces this system to a finite iteration of a single map $\Phi_x$ and its inverse branch $\Psi_x$. For each fixed $m$, this reduction gives a common dominant square-root singularity at $r=1/(4m)$, coefficient asymptotics of order $(4m)^n n^{-3/2}$, and limiting proportions for every truth level. In the four-valued case these proportions are obtained explicitly in nested radicals. The main new phenomenon appears when the number of truth values also tends to infinity. If $K_m$ denotes the output level under the limiting $n\to\infty$ distribution and $X_m=K_m/(m-1)$, then $X_m\Rightarrow X$, where $X$ has density $(1+2t)^{-3/2}$ on $[0,1)$ together with an atom of mass $1/\sqrt{3}$ at $1$. In particular, the top mass converges to $1/\sqrt{3}$, while the bottom mass is asymptotic to $1/m$. We further show that the same probability law arises intrinsically when Gödel implication is defined directly on $[0,1]$ and valuations are sampled from Lebesgue product measure: the continuum tail generating function satisfies an exact first-order differential equation whose critical specialization is the ODE appearing in the finite-chain Euler limit. We also record a root-split refinement whose pair-count generating functions factor as products of the level generating functions and inherit the same square-root scale.
Read the full abstract
Probability
Martin Boundary and Invariant Fields of Multiplicative SHE
We study invariant measures of nonlinear multiplicative stochastic heat equations in the weak disorder regime. Under a natural second-moment condition, we show that positive invariant measures are in one-to-one correspondence with bounded positive harmonic functions of the underlying space. This implies that the space of invariant measures inherits the structure of the Martin boundary. We also show that whenever the deterministic semigroup flow converges to a bounded harmonic function, the stochastic evolution converges to the corresponding invariant measure. The results apply to many settings with nontrivial Martin boundary, such as negatively curved manifolds and trees.
Read the full abstract
Analysis of PDEs
The nonlinear Schrödinger equation with combined nonlinearities in 1D
We consider the one-dimensional nonlinear Schrödinger equation $$ iu_t + u_{xx} + \mathcal{N}(u)u=0, \quad x,t \in \mathbb R, $$ with the nonlinearity term that is expressed as a sum of powers, possibly infinite: $$ \mathcal{N}(u) = \sum d_k |u|^{\alpha_k}, \quad \alpha_k > 0. $$ We first investigate the local well-posedness of this equation for any positive powers of $\alpha_k$ in a certain weighted class of initial data, subset of $H^1 (\mathbb R)$. For that we use an approach of Cazenave-Naumkin [19], thus, avoiding any Strichartz estimates. Then, using the pseudo-conformal transformation, we extend the local result to the global one for the initial data with a quadratic phase. Furthermore, we investigate the asymptotic behavior of such global solutions and prove scattering for data with the quadratic phase $e^{ib|x|^2}$ with sufficiently large positive $b$, in $H^1(\mathbb R)$. One of the advantages of considering an infinite sum in the nonlinearity term is being able to consider exponential nonlinearities, such as $e^{\gamma |u|^{k}} u$, as well as sine or cosine nonlinearities, and obtain well-posedness in those cases, the first such result for most of those nonlinearities. To conclude, we show numerical simulations for various examples of combined nonlinearities, including the double nonlinearity and an exponential one, then investigate the behavior of solutions with positive or negative initial $b$ in a quadratic phase data. Furthermore, we also show that a ground state in the NLS equation with combined nonlinearities no longer provides a sharp threshold for global behavior such as scattering vs. finite time blow-up, instead the equation has a much richer dynamics.
Read the full abstract
Algebraic Geometry
Algebraic and analytic structure of Morikawa's sangaku problem
Let $\mu(r)$ denote the minimal side length of a square inscribed in the curvilinear triangular region formed by two tangent circles of radii $1$ and $r \ge 1$ together with their common tangent line. The problem of finding a closed-form expression for $\mu(r)$ was posed in early nineteenth-century Japan by Morikawa. It was proved by Holly and Krumm (2021) that no expression in radicals exists for $\mu(r)$. In this article we show that $\mu$ is an algebraic function, and consequently real-analytic on $[1,\infty)$ outside a finite explicitly computable set. In particular, although no expression in radicals exists, the function admits convergent Taylor expansions at all non-exceptional values of $r$, whose coefficients may be computed by Newton iteration from the defining algebraic equation. We illustrate the method by explicitly computing the Taylor expansion of $\mu(r)$ centered at $r=1$.
Read the full abstract
Combinatorics
On the discrete Heine-Shephard problem for four lattice polygons
We study the set of square-free parts of volume polynomials associated with four planar lattice polytopes. This is motivated by the problem of describing possible pairwise intersection numbers of four curves in $(\mathbb{C}^*)^2$ with prescribed Newton polytopes and generic coefficients. It is known that for arbitrary convex bodies in $\mathbb{R}^2$, the corresponding square-free polynomials are characterized by the Plücker-type inequalities. We show that this characterization fails in the lattice setting: the interior of the space defined by the Plücker-type inequalities contains integer polynomials that are and are not realizable by lattice polytopes. This phenomenon arises from additional arithmetic constraints on the mixed areas of lattice polytopes. These constraints become apparent when we study a "discrete diagram", which maps a pair of planar lattice polytopes to their mixed area together with their lattice widths in a given direction.
Read the full abstract
Algebraic Geometry
Topology of the Vakil–Zinger moduli space
We derive a set of generators for the rational homology of the desingularised genus one mapping space $\widetilde{\mathcal{M}}_{1,n}(\mathbb{P}^r,d)$ constructed by Vakil–Zinger and qualitatively describe the relations among the generators. The results build on a detailed study of the stratifications of the moduli spaces coming from tropical geometry and the constraints coming from the weight filtration on the Borel–Moore homology groups of strata, extending the techniques from the previous study on $\overline{\mathcal{M}}_{g,n}.$ Our results imply that the even homology of $\widetilde{\mathcal{M}}_{1,n}(\mathbb{P}^r,d)$ is tautological and controlled by genus-zero and reduced genus-one Gromov–Witten theory. We verify the Hodge and Tate conjectures for $\widetilde{\mathcal{M}}_{1,n}(\mathbb{P}^r,d),$ completely describe its rational Picard group, and recover known results on the vanishing of odd cohomology. Our techniques also apply to the pure weight homology groups of genus one stable maps $\overline{\mathcal{M}}_{1,n}(\mathbb{P}^r,d).$
Read the full abstract
Tuesday 17 February
Probability · Cross-listed from cs.GT
Can a Weaker Player Win? Adaptive Play in Repeated Games
Consider a two-player game repeated N times. Player 1 can choose between two styles (for interpretability, offensive and defensive), whereas Player 2 uses a single fixed style. Let X N\,:= \#wins -\#losses for Player 1 after N games, and define the match gain as E[sign(X N )], with sign(0) = 0. We assume Player 1 is weaker in the sense that each pure style is losing in expectation. Our objective is to identify under which parameter regimes Player 1 can nevertheless achieve a positive gain under an optimal adaptive policy. Using dynamic programming, we solve the finite-horizon control problem and numerically identify parameter regimes in which the optimal gain is strictly positive at some horizon N $\star$ . We also derive structural conditions guaranteeing that g $\star$ N is always negative, and regimes (notably with fair (D)) where g $\star$ N is nonnegative for all N and can be strictly positive for every N $\ge$ 2. We then characterize the asymptotic behavior as N $\rightarrow$ $\infty$ for a weak player. In the safe case, where the defensive style induces a sure draw, the limiting gain varies continuously with the parameters and may take any value in [0, 1]. In the non-safe case, the limiting gain converges to -1 when both styles are strictly losing, and to 0 when (D) is fair (and non-safe).
Read the full abstract
Probability · Cross-listed from stat.OT
Profiling vs. Case-specific Evidence: A Probabilistic Analysis
The use of profiling evidence in criminal trials is a longstanding controversy in legal epistemology and evidence law theory. Many scholars, even when they oppose its use at trial, still assume that profiling evidence can be probative of guilt. We reject that assumption. Profiling evidence may support a generic hypothesis, but is not evidence that the defendant is guilty of the specific crime of which they are accused. We contrast profiling evidence with case-specific evidence, which speaks more directly to the facts of the case. Our critique departs from others by grounding the argument in a probabilistic analysis of evidentiary value. We also explore the implications of our account for debates about stereotyping.
Read the full abstract
Dynamical Systems
Dynamical Invariants from Asymptotic Composants
Asymptotic composants and their incidence relations are powerful invariants of 1-dimensional inflation tilings spaces, which can distinguish many MLD classes of tilings. In particular, and unlike most other invariants, they can often provide obstructions to a tiling space being MLD to its reflection. We present a simple algorithm to determine these asymptotic composants for primitive inflation tiling spaces in one dimension, and illustrate how they can be used to tell different MLD classes of tilings apart. In an Appendix, we then show that the structure of asymptotic composants, together with the orbit separation dimension (OSD), can distinguish all MLD classes of inflations tilings with pure-point spectrum for a bunch of small inflation factors, which illustrates the power of these invariants.
Read the full abstract
General Mathematics
$n$th Roots of $n$th Powers
General Mathematics
Spectral Geometry of Fourier Curves with Prime Frequencies: A Comparative Experimental Study
We present a comparative experimental study of planar curves arising from a Fourier series whose frequencies are the prime numbers, together with several randomized control models. Starting from the series $F_n(t)=\sum_{p\le n} v_p(n!)\, e^{i p t},~t\in[-\pi,\pi]$, introduced and motivated in a companion work, we investigate the geometric complexity of the associated planar curves obtained by sampling in the complex plane. To test whether the observed multiscale behavior reflects arithmetic structure or can be reproduced as a generic consequence of sparsity or density, we compare the prime frequency model with randomized alternatives, including random frequency sets, a Cramér type random model, and a shuffled coefficient model. Using consistent box counting protocols and Monte Carlo ensembles, we observe stable scale dependent behavior for the prime frequency curves that is not reproduced by the randomized models. All results are experimental and are presented as evidence motivating further theoretical investigation.
Read the full abstract
General Mathematics
Markov Number Graphs Extended to all Integer Triples
We study the graphs generated when the formula for linking Markov triples is applied to general triples of integers. We find there are a finite number of equivalence classes of graphs, each with particular properties.
Numerical Analysis
An entropy-stable oscillation-eliminating dgsem for the euler equations on curvilinear meshes
We develop an entropy-stable high-order numerical method for the two-dimensional compressible Euler equations on general curvilinear meshes. The proposed approach is based on a nodal discontinuous Galerkin spectral element method (DGSEM) that satisfies the summation-by-parts (SBP) property. At the semidiscrete level, entropy stability is established through the SBP structure and the discrete metric identities associated with curvilinear coordinate mappings. By incorporating entropy-stable numerical fluxes at element interfaces, a global discrete entropy inequality is obtained. To further control nonphysical oscillations near strong discontinuities, the entropy-stable DG formulation is combined with a modified oscillation-eliminating discontinuous Galerkin (OEDG) method, which was originally proposed in [59]. We observe that the zero-order damping coefficient in the original OEDG method naturally serves as an effective shock indicator, which enables localization of the oscillation control mechanism and significantly reduces computational cost. Moreover, while the original OEDG formulation relies on local orthogonal modal bases and is primarily restricted to simplicial meshes, we reformulate the OE procedure using projection operators, allowing for a systematic extension to general curvilinear meshes. The resulting method preserves conservation and entropy stability while effectively suppressing spurious oscillations. A series of challenging numerical experiments is presented to demonstrate the accuracy, robustness, and effectiveness of the proposed entropy-stable OEDG method on both Cartesian and curvilinear meshes.
Read the full abstract
Number Theory
Binomial sums and properties of the Bernoulli transform
In this paper, we study the binomial sum $S_{n}(q):=% \overset{n}{\underset{k=0}{\sum }}a_{k}\binom{n}{k}\left( 1-q\right) ^{k}q^{n-k}$ for a given sequence $\left( a_{n}\right) $ of real or complex numbers. We express $S_{n}(q)$ in function of the powers of $q,$ and, we explicit it when the sequence $\left( a_{n}\right) $ is the sequence of Fibonacci numbers, Laguerre polynomials, Meixner polynomials, binomial coefficients and the sequence $\left[ n\right] _{p}.$ We establish later some properties, relations, probabilistic interpretations and generating functions between $S_{n}(q)$ and $S_{n}(x+q-xq).$ Further identities related to Appell polynomials are also given in the last of the paper.
Read the full abstract
Combinatorics
An Explicit Skew-Hadamard Matrix of Order 1252 via Cyclotomic Unions
We construct a skew-Hadamard matrix of order 1252 = 2(5^4 + 1) using a bordered skew-Hadamard difference family over GF(5^4), with blocks given as unions of cyclotomic classes of order N = 16. This order has been reported as missing in some widely used open-source computational tables; we provide an explicit instance together with verification artifacts. We prove the structural prerequisites for the bordered construction (skew-symmetry of one block and the constant autocorrelation-sum condition), and we compute algebraic invariants to facilitate classification: the associated tournament adjacency matrix has full rank over GF(2), and the matrix has full rank over GF(3) and GF(5). We also exhibit an explicit affine subgroup of the automorphism group of size 24 375. All claims are supported by a reproducible artifact bundle including the explicit matrix and verification logs.
Read the full abstract
Mathematical Physics · Cross-listed from hep-th
Group character averages via a single Laguerre
Average of exponential ${\rm Tr}_R e^X$, i.e. of a group rather than an algebra character, in Gaussian matrix model is known to be an amusing generalization of Schur polynomial, where time variables are substituted by traces of products of non-commuting matrices ${\rm Tr} \left(\prod_i A_{k_i}\right)$ and are thus labeled by weak compositions. The entries of matrices $A_k$ are made from extended Laguerre polynomials, what introduces additional difficulties. We describe the generic sum rules, which express arbitrary traces through convolutions of a single Laguerre polynomial $L_{N-1}^1(z_{k_i})$, what is a considerable simplification.
Read the full abstract
Differential Geometry
On a class of hypersurfaces of a product of two space forms
We extend the notion of class $\mathcal{A}$, previously defined for hypersurfaces of $\mathbb{S}^n\times \mathbb{R}$ and $\mathbb{H}^n\times \mathbb{R}$, where $\mathbb{S}^n$ and $\mathbb{H}^n$ denote the sphere and hyperbolic space, respectively, to hypersurfaces of a product $\mathbb{Q}_{c_1}^{k} \times \mathbb{Q}_{c_2}^{n-k+1}$, $2\leq k\leq n-1$, of two space forms with arbitrary constant curvatures $c_1$ and $c_2$. When $c_1$ and $c_2$ are not both equal to $0$, such a hypersurface is in class $\mathcal{A}$ if and only if it has a flat normal bundle when regarded as a submanifold of the underlying flat ambient space. We provide an explicit local construction of all hypersurfaces in class $\mathcal{A}$ that do not split in any open subset in terms of parallel families of hypersurfaces of the factors, and show how it simplifies for the hypersurfaces within this class that have a constant product angle function. We also show that hypersurfaces with constant mean curvature in class $\mathcal{A}$ are given in terms of parallel families of isoparametric hypersurfaces in each factor and a solution of a second order ODE. Finally, we classify hypersurfaces with constant mean curvature in class~$\mathcal{A}$ that have a constant product angle function.
Read the full abstract
Mathematical Physics · Cross-listed from quant-ph
Contractivity of time-dependent driven-dissipative systems
Experimentally relevant quantum systems are frequently described by a time-dependent Lindblad master equation in which the dissipation due to interaction with an environment is fixed, but the experimenter has control over the Hamiltonian, which therefore can change with time. A fundamental question that is also of practical relevance is to determine when such systems invariably lose information about their initial state (are exponentially contractive independent of the Hamiltonian) or when the control can be used to prevent this loss of information to some degree. Here, we identify the necessary and sufficient criterion on the dissipator for Hamiltonian-invariant contractivity. If the dissipator does not fulfil this criterion, but by itself is exponentially contractive, we also establish exponential contractivity for sufficiently weak or slow drives and construct examples where strong or fast driving prevents exponential contraction.
Read the full abstract
Statistics Theory · Cross-listed from cs.LG
Can Generative Artificial Intelligence Survive Data Contamination? Theoretical Guarantees under Contaminated Recursive Training
As artificial intelligence (AI)-generated content proliferates, models are increasingly trained on their own outputs, risking progressive degradation or collapse. In this article, we provide the first positive, rigorous theoretical results, to the best of our knowledge, showing that under model-agnostic mild conditions, the model converges to the true data-generating distribution. The convergence rate is the minimum of the model's intrinsic rate and the fraction of real data at each training iteration, revealing a phase transition between data-limited and model-limited regimes. We further show that, for biased real data, correcting the bias prevents the persistence and amplification of early bias over training iteration. Extensive experiments across simulations, real images and texts validate our theoretical framework, establishing quantitative conditions for long-term AI stability in contaminated environments.
Read the full abstract
Analysis of PDEs
An intrinsic expansion approach to the Galerkin approximations for the Navier-Stokes equations (with an appendix by Chengzhang Fu)
We study the Galerkin approximation of the three-dimensional Navier-Stokes equations. In particular, we examine the convergence of these solutions in a sequence of finite dimensional spaces as the dimension goes to infinity. For any sequence of steady state or, respectively, time dependent Galerkin solutions that converges to a solution of the Navier-Stokes equations, we obtain a subsequence with an intrinsic asymptotic expansion in appropriate nested function spaces. Consequently, an induced asymptotic expansion is obtained in a more standard spatial Sobolev or, respectively, spatiotemporal Sobolev-Lebesgue space. In the case of steady states, we establish certain relations among leading terms of this expansion.
Read the full abstract
Combinatorics
Counting Colored Trees
We consider the enumeration of plane trees (rooted ordered trees) whose vertices are colored according to a specific coloring rule that prescribes which possible pairs of colors can occur as the colors of a parent vertex and its child. This general construction covers many different examples that have been studied in the literature. Some general necessary and sufficient conditions for two different coloring rules to result in the same counting sequence are established. We also provide exhaustive lists of counting sequences arising from coloring rules with two or three colors, and we find formulas and closed form expressions for many of these sequences. The famous Fibonacci, Catalan, Narayana, and Schröder sequences appear in several cases. Some of these coloring rules are extended to families of coloring rules with arbitrarily many colors.