Statistics Theory · Cross-listed from cs.DS
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
Friday 15 May
We study the query complexity of obtaining a relative Fisher information guarantee for sampling from a log-smooth non-log-concave distribution; this is a sampling analog of finding an approximate stationary point in optimization. Our algorithm is based on the proximal sampler, which is an implicit discretization of the Langevin diffusion, and requires an implementation of the backward step known as the restricted Gaussian oracle (RGO). We show that by leveraging the recent results for log-concave sampling with high-accuracy guarantees in Rényi divergence, we can obtain an approximate RGO implementation that – when used with the proximal sampler – yields a complexity guarantee in relative Fisher information that inherits the same dimension dependence as log-concave sampling, and improves upon prior work for non-log-concave sampling. We also show a converse reduction that any improvement in the dimension dependence in relative Fisher information for non-log-concave sampling will yield an improved dimension dependence for high-accuracy log-concave sampling.
Analysis of PDEs
Anisotropic gradient rearrangement of BV functions and applications
In this paper, we introduce a symmetrization technique for the distributional gradient of a function of bounded variation in the anisotropic setting. This generalizes the result obtained in the Euclidean case in [Amato-Gentile-Nitsch-Trombetti, 2024] by separating the absolutely continuous part of the anisotropic gradient from its singular part. Our main result is an $L^1$ comparison between the function and its anisotropic symmetrization. Moreover, as an application, we derive isoperimetric inequalities for some geometric functionals related to the torsional rigidity.
Read the full abstract
Dynamical Systems · Cross-listed from q-bio.CB
How nature discovers rare Turing islands: exploration by common limit cycles
Turing patterns are a cornerstone of biological self-organization, yet their emergence typically requires finely tuned parameters occupying narrow regions of high-dimensional space. This poses a fundamental challenge: how can evolving biological systems reliably find and exploit such rare conditions? In this work, we propose that common biochemical limit cycles, such as those arising from genetic feedback loops, can act as natural explorers of Turing space. By coupling a reaction-diffusion system to an orbit that modulates some of its parameters, we show that the system can dynamically sweep through Turing-permissive regimes and generate transient spatial patterns. We use an entropy-based measure in Fourier space to quantify pattern formation and demonstrate how cycles enhance the detectability and robustness of Turing islands. We further explore how coupling to positional gradients increases reproducibility, suggesting a route from oscillatory dynamics to stable developmental programs. Our results highlight a powerful mechanism by which nature might bootstrap complex spatial structure from simple temporal motifs.
Read the full abstract
Optimization and Control
Finding directional stationary points of DC programs
We address the problem of computing stationary points for non-smooth, non-convex optimization problems. While this topic is well studied in the smooth setting, fewer algorithmic and theoretical results exist for the non-smooth case. Within Difference-of-Convex functions (DC) programming, the well-known DC Algorithm (DCA) is a standard method for computing critical points, whose definition depends on the chosen DC decomposition. More recently, some works have focused on computing directional stationary points - a stronger notion that does not depend on any particular DC decomposition - for specific non-smooth DC programs, where the second DC component is the pointwise maximum of finitely many smooth convex functions. In this contribution, we propose a new and unified approach for identifying directional stationary points of non-smooth DC programs, where both DC components may be non-smooth. Our framework generalizes both the classical DCA and the above recent approaches. It applies when the second DC component is the pointwise maximum of a continuous family of smooth convex functions, and more generally, to any continuous convex function on the whole space. We also establish strong convergence results. Specifically, when the second DC component is the pointwise maximum of finitely many $C^{1,1}$ - smooth convex functions, we prove under the Łojasiewicz inequality that the entire sequence generated by our algorithm converges. This extends previous results requiring global $C^{1,1}$ - smoothness. Finally, we introduce a randomized (stochastic) variant of our method and prove its almost sure convergence, thereby extending our deterministic results to the randomized setting.
Read the full abstract
Analysis of PDEs
Large-data $L^2$-decay for attractive-dissipative nonlinear Schrödinger equations without the strong dissipative condition
We prove a large-data $L^2$-decay estimate for nonlinear dissipative Schrödinger equations with attractive-dissipative power nonlinearity. The main difficulty is the lack of sign definiteness of the standard energy when $\Re\lambda<0$, which prevents the usual energy argument from directly yielding a uniform gradient bound. We introduce an augmented energy, obtained by adding a suitable multiple of the decreasing $L^2$-norm to the standard energy. This produces an additional dissipative term and gives a direct uniform-in-time $H^1$ bound without the iteration argument used in previous works. Consequently, for arbitrary initial data in the weighted energy space $\Sigma = H^1 \cap \mathcal{F}H^1$, we obtain the decay rate previously known under the strong dissipative condition throughout the sharp decay range $1<p\le 1+2/d$. This removes the remaining restriction $p\le 1+4/(3d)$ in the attractive-dissipative case.
Read the full abstract
Combinatorics · Cross-listed from cs.DS
Exploration of $k$-edge-deficient temporal graphs in linear time
We study the Temporal Exploration problem, where an agent must visit all vertices of a temporal graph while traversing at most one available edge per time step. Unlike static graphs, which can be explored in linear time, temporal constraints can substantially increase exploration time even when every snapshot of the graph is connected. To better understand the source of this complexity, we focus on a near-static setting and consider always-connected $k$-edge-deficient temporal graphs, in which each snapshot is connected and differs from a fixed underlying $n$-vertex graph by at most $k$ edges. Although such graphs are structurally close to static graphs, they can still exhibit non-trivial temporal behaviour. Prior work showed that these graphs can be explored in $O(kn \log n)$ time steps and established a lower bound of $\Omega(n \log k)$, leaving open whether linear-time exploration in $n$ is possible. We resolve this question by showing that any always-connected $k$-edge-deficient temporal graph admits an exploration schedule of length $O(nk \log k)$. Moreover, given such a temporal graph, the corresponding exploration schedule can be computed in polynomial time. The obtained bound is linear in the number of vertices up to a factor depending only on $k$, removes the extraneous logarithmic dependence on $n$, and is nearly optimal. In particular, for constant $k$, our result yields an order-optimal $\Theta(n)$ exploration time, showing that temporal exploration in this near-static regime essentially retains the linear-time character of static graph traversal.
Read the full abstract
Dynamical Systems
A non-logarithmic approach to the rate of convergence of the deterministic chaos game
The aim of this paper is to provide a different perspective in the study of the rate of convergence of the chaos game algorithm to the attractor of an iterated function system. We prove that for any function $\psi$ with $\lim\limits_{\ve\to 0}\psi(\ve)=\infty$, a typical (in the sense of the Baire category) driver yields a rate of recovery comparable to $\psi$. This result extends the main theorem from Leśniak et al. (Rev. Real Acad. Cienc. Exactas Fis. Nat. Ser. A-Mat. 118, 157, 2024). Moreover, thanks to the change of perspective, we are able to prove that a typical driver gives arbitrarily slow rate of recovery.
Read the full abstract
Numerical Analysis
Fractional backward spectral approximation theory for weakly singular adjoint integral equations
We introduce a new class of fractional backward orthogonal functions designed for the spectral approximation of weakly singular adjoint Volterra integral equations. These basis functions generate an approximation space that naturally reflects the terminal-endpoint singular behaviour produced by weakly singular kernels. We develop the basic approximation theory for the proposed backward orthogonal basis, including weighted projection estimates, Gauss-type interpolation estimates, inverse inequalities, and stability bounds for the associated weakly singular adjoint integral operator. The error analysis and numerical results show that the proposed backward Jacobi method is particularly suitable for solutions with terminal-endpoint weak singularities and can recover high-order convergence rates that are typically lost when usual polynomial approximations are applied directly to such weakly regular solutions.
Read the full abstract
Information Theory · Cross-listed from stat.AP
Active Redundancy Allocation Strategy at Component and System Level
Researchers and practitioners in the field of reliability engineering and optimization frequently use active redundancy techniques to intensify the performance of systems. In this article, we study allocation strategies of non-matching active redundancies (spares) in coherent systems consisting of possibly dependent and identical components for achieving better system reliability. The dependence of the components is modeled through copulas using the distortion function. Sufficient conditions are derived to establish optimal allocation strategies for two heterogeneous active redundancies at the component or system levels. Moreover, the results are true for the component lifetimes following a general family of parametric distributions. The results guarantee the likelihood ratio (reversed hazard) ordering between the coherent systems at the component level (system level) active redundancies. Some aging properties are also established in this endeavor. Several examples are provided to demonstrate the theoretical results.
Read the full abstract
Optimization and Control
Degree Bounds for Positivstellensätze of general semialgebraic sets
Let $p_{\min}$ denote the minimum of a polynomial $p$ over a (general) compact semialgebraic set $S \subseteq \mathbb{R}^n$. A standard way to approximate $p_{\min}$ is via hierarchies built from Positivstellensätze, which certify nonnegativity of polynomials on $S$ using sums of squares or other classes of globally nonnegative polynomials. As the degree of the certificate grows, the values generated by these hierarchies converge asymptotically to $p_{\min}$. A natural question is, then, to determine explicit bounds on the certificate's degree needed to obtain a prescribed $\varepsilon$-approximation to $p_{\min}$, or equivalently certify the positivity of $f:=p - p_{\min} + \varepsilon$ on $S$. We improve the current best degree bounds for Putinar's and Schmüdgen's SOS-Positivstellensatz over $S$. Also, we obtain degree bounds for Krivine–Stengle's and the recently introduced extended-Handelman's $\mathbb{R}_+$-Positivstellensätze over $S$; providing the first explicit degree bounds for linear optimization-based hierarchies over general compact semialgebraic sets. Our approach is based on a lift-and-project construction in which we add new variables to construct an algebraic representation of the distance to the set $S$ using Łojasiewicz's inequality. This lets us lift the problem of certifying the positivity of $f$ on the (complex) set $S$ to the problem of certifying the positivity of a related polynomial $F$ on a higher-dimensional hypercube. By projecting out the added variables, non-negativity certificates for $F$ on the hypercube become non-negativity certificates for $f$ on $S$. Our approach offers a unified methodology to obtain degree bounds for several Positivstellensatz-based hierarchies over general compact sets, narrowing the gap between results for the hypercube (or other simple sets) and more general semialgebraic sets.
Read the full abstract
Differential Geometry
On the triviality of the generalized tangent bundle
We study the relations between the triviality of the tangent bundle $TM$ and the generalized tangent bundle $\mathbb{T}M = TM\oplus T^*M$ of a manifold. We show that the generalized tangent bundle of a paralellizable manifold is trivial. We also prove that the converse implication does not hold, by studying the cases of the Möbius strip, spheres and projective spaces. Finally, we relate the triviality of the generalized tangent bundle to generalized geometric structures.
Read the full abstract
Statistics Theory
Goodness-of-Fit Testing for Point Processes in Large Populations
Suppose we have an observed path from a point process counting event occurrences in a large population. Based on the observed path, we would like to test the null hypothesis that the conditional intensity of the point process belongs to a particular parametric family. We propose a novel approach to conducting such goodness-of-fit tests. The idea is to construct a unitary transformation of a natural parametric testing process such that it converges weakly to a “standard” target process, independent of the particular parametric form assumed under the null hypothesis. This transformation therefore paves the way for asymptotically distribution-free goodness-of-fit testing of parametric point processes. We demonstrate the good finite-sample performance of our approach through Monte Carlo simulations of Aalen-type survival processes, without and with censoring, mixture cure models, and software reliability models, and we illustrate its applicability with observed human lifetimes as well as real software failures.
Read the full abstract
Logic
Axiomatizing logics of finite Gödel-Kripke models
We investigate completeness for modal Gödel logics with respect to finite Gödel-Kripke models, along with related aspects. It is well known that the logics studied in [4, 11] fail to be complete with respect to finite Gödel-Kripke models. We show that the natural candidate axiomatic extensions do not restore completeness, thereby resolving a 15 year open problem posed in the aforementioned works. We then provide new axiomatizations that are complete for finite models and characterize intermediate witnessing conditions that hold for the basic logics.
Read the full abstract
Information Theory
Real-Time Reconstruction and Actuation Error Analysis for Markov Sources over MPR Channels
We study real-time reconstruction and actuation for two binary Markov sources that share a wireless multi-packet reception (MPR) channel. Each sensor follows a stationary randomized sampling policy, and the receiver maintains source estimates using the most recently decoded updates. We derive closed-form expressions for the steady-state real-time reconstruction error (RTE) and the cost of actuation error (CAE) as functions of the source transition probabilities and the effective update probabilities. We then characterize these update probabilities under randomized sampling, linking the physical-layer MPR model to task-oriented reconstruction and actuation metrics. Using these expressions, we formulate a sampling-constrained optimization problem with a weighted-error objective. The resulting analysis reveals how source dynamics, semantic weights, and MPR coupling affect the allocation of sampling resources. Numerical results show that optimized randomized sampling outperforms random, greedy, and time-sharing baselines.
Read the full abstract
Probability
Set-indexed and multiple sums in high dimensions
We consider multiple and set-indexed sums of random vectors taking values in Euclidean space of growing dimension. It is shown that, when viewed as finite metric spaces, the sets of values of such sums converge in probability. The limit is identified as a generalisation of the Wiener spiral, which appears as the high-dimensional limit of single-index sums.
Read the full abstract
Probability
Mean-Field Backward Stochastic Differential Equations with Nonlinear Resistance and Double Mean Reflections
In this paper, we investigate mean-field backward stochastic differential equation (MFBSDE) with double mean reflections and nonlinear resistance. Specifically, the constraints are formulated in terms of the expectation of the solution, and a compensating term is incorporated into the generator. We establish the existence and uniqueness for both the case of Lipschitz generator and the case where the generator is quadratic and the terminal value is bounded. Finally, when the compensating term is absolutely continuous, we study the well-posedness of a variant type of doubly mean reflected MFBSDE with nonlinear resistance, whose generator depends on the density function of the compensating term.
Read the full abstract
Combinatorics
Representability of $q$-matroids via rank-metric codes
Multilinear representability extends classical linear representability of matroids by assigning subspaces, rather than vectors, to ground elements. This notion is closely related to almost affine codes. In this paper, we introduce and study a $q$-analogue of multilinear representability for $q$-matroids, motivated by known connections between $q$-matroids, classical matroids, and rank-metric codes. We define $m$-multilinear representability in terms of almost affine matrix rank-metric codes satisfying a natural divisibility condition. We prove that nontrivial uniform $q$-matroids admit no purely multilinear representations, and we derive necessary conditions for multilinear representations of almost uniform $q$-matroids. We further show that the non-Pappus $q$-matroid, if multilinearly representable, must have block size at least $9$. Finally, we prove that no rank-$2$ $q$-matroid on $\mathbb{F}_2^4$ admits a purely $m$-multilinear representation for $1<m<4$, and we classify pure multilinearity for all $q$-matroids on $\mathbb{F}_2^3$ and $\mathbb{F}_2^4$ in the corresponding ranges. At present, no example is known of a purely multilinear $q$-matroid.
Read the full abstract
Category Theory · Cross-listed from q-fin.MF
Clearing in Liability Networks via Sheaves on Directed Hypergraphs
We associate to a decorated liability network a liability sheaf on a directed hypergraph whose hyperedges separate the distribution of payments from the collection of receipts. Clearing configurations are precisely the global sections of this sheaf, and the global-section object is canonically the equalizer of the identity and a clearing operator $\Phi=A\circ D$ factored into collective distribution $D$ and aggregation $A$; an institution-edge duality identifies it equivalently with the equalizer of the dual operator $D\circ A$ on the edge side. This identifies liability clearing as a finite-limit construction in the ambient data category. The construction is functorial under change of coefficient category: a Clearing Invariance Theorem shows that a finite-limit-preserving functor compatible with constraint subobjects induces a canonical isomorphism on global-section objects, enabling uniform comparison of clearing problems across categories of payment data. Existence, uniqueness, and iterative computation of clearing sections are organized by the structure carried on payment objects: Tarski's theorem yields existence and a complete-lattice structure under complete-lattice global elements; Scott continuity refines this to convergent Kleene iteration; an acyclic underlying graph admits a unique clearing section in finitely many steps with no order or metric hypothesis; and Banach's theorem on global elements yields uniqueness under metric contraction. The Eisenberg–Noe model and lattice liability networks arise as special cases.
Read the full abstract
Combinatorics
Arc-disjoint Steiner Cycles in Digraphs
Let $D=(V(D), A(D))$ be a digraph of order $n$ and let $S\subseteq V(D)$ with $2\leq |S|\leq n$. A directed cycle $C$ of $D$ is called a directed $S$-Steiner cycle (or, an $S$-cycle for short) if $S\subseteq V(C)$. Steiner cycles have applications in reliable designs for telecommunication and transportation networks. Two $S$-cycles are called arc-disjoint if they have no common arcs. We use $\lambda_{S}^{c}(D)$ to denote the maximum number of pairwise arc-disjoint $S$-cycles in $D$. The directed cycle $k$-arc-connectivity of $D$ is defined as $$\lambda_{k}^{c} (D)=\min\left \{ \lambda _{S}^{c}(D)\mid S\subseteq V(D),\left | S \right | =k,2\le k\le n \right \}.$$ In this paper, we determine the complexity for $\lambda_{S}^{c} (D)$ on Eulerian digraphs, planar digraphs and symmetric digraphs. We also obtain exact values of $\lambda_{k}^{c} (D)$ on complete digraphs, complete bipartite digraphs and complete regular multipartite digraphs.
Read the full abstract
Numerical Analysis
Adaptive Artificial Anti-Diffusion Methods for Hyperbolic Systems of Conservation Laws
We introduce new adaptive artificial anti-diffusion (AAAD) methods for one- and two-dimensional hyperbolic systems of conservation laws. The key idea is to reduce the amount of numerical dissipation present in a given numerical method by adding an anti-diffusion (AD) term acting in linearly degenerate fields only. This way, the resolution of contact waves can be improved without risking oscillations, which may be caused if the AD acts in nonlinear fields as well. The AD coefficients are selected adaptively: they are supposed to be proportional to the mesh size near the contact waves to enhance the resolution and to be very small in the smooth parts of the computed solution to ensure a sufficiently high (formal) order of accuracy there. The proposed AAAD methods are realized using either the second-order central-upwind numerical fluxes or their fifth-order extensions implemented within the alternative weighted essentially non-oscillatory (A-WENO) framework. We test the proposed schemes on a series of benchmarks for the one- and two-dimensional Euler equations of gas dynamics and the obtained results demonstrate the robustness and high resolution of the new AAAD methods.
Read the full abstract
Optimization and Control · Cross-listed from cs.CG
Optimizing Line Segment Inspection with Limited-Range Drones
Optimization problems with drones are widely studied in a variety of civilian tasks, mainly due to their ability to traverse rough terrains and to carry cameras and other sensors for surveillance tasks. The limited battery life of these aerial robots poses challenges in operational research. In this paper, we address the following optimization problem. We are given a set of line segments (e.g. tubes in a solar plant) to inspect by drones. The objective is to detect broken pipes using artificial intelligence and path planning must be carried out efficiently. On the one hand, the limited capacity of the batteries necessitates periodic visits (tours) to a fixed base station. However, it is desirable to allocate a set of tours for each drone to ensure that the segments are covered as quickly as possible, aiming to minimize the makespan, which is the maximum time spent by any drone. We are able to prove that this optimization problem is strongly NP-hard even when the segments are positioned on a line and the scenario involves only two drones. Then, approximation algorithms are proposed. Our computational experiments demonstrate that the proposed algorithm achieves near-optimal performance across diverse operational scenarios.
Read the full abstract
Number Theory
Positive density for Sun's $2^k+m$ conjecture
In 2013, Zhi-Wei Sun proposed a Romanov-type conjecture stating that every integer $n > 1$ can be written as $n = k + m$ with $k, m \ge 1$ such that $2^k + m$ is a prime. In this paper, we unconditionally prove that the natural numbers satisfying this property have a positive density. We compute this density to be at least $0.0734$. We also discuss the limitations of our method. Under a uniform Hardy-Littlewood prime pairs conjecture, we show that the lower bound of density obtained by this method cannot exceed $1/(\log 2 + 1) \approx 0.5906$.
Read the full abstract
Analysis of PDEs
Quantitative stability for fractional Hardy inequalities: Rearrangement-free techniques and Emden-Fowler analysis
A classical result due to Frank and Seiringer asserts that for $1\leq p<\frac Ns$, there exists a sharp constant $\mathcal{C}_{N,s,p}>0$ such that $$ \delta_{s,p}(u):=\int_{\mathbb{R}^N}\int_{\mathbb{R}^N}\frac{|u(x)-u(y)|^p}{|x-y|^{N+sp}}\,dx\,dy-\mathcal{C}_{N,s,p}\int_{\mathbb{R}^N}\frac{|u(x)|^p}{|x|^{sp}}\,dx\ge0, $$ for all $u\in W^{s,p}(\mathbb{R}^N)$. The optimal constant is explicitly known. We investigate quantitative refinements of this inequality. Our first result shows that, under the normalization $ \int_{\mathbb{R}^N}\frac{|u(x)|^p}{|x|^{sp}}\,dx=1,$ the inequality \[ \delta_{s,p}(u)\gtrsim\bigl(\mathrm{dist}_{s,p}(u,\mathcal{Z})\bigr)^\alpha, \] holds, where $\alpha=\max\{4,2p\}$, $\mathcal{Z}$ denotes the family of “virtual” extremals, and the distance is measured in Marcinkiewicz (weak-$L^{p_s^*}$) space. The stability exponent remains constant for $p\le2$, while it depends on $p$ for $p>2$. Our approach is based on a localized Poincaré-Sobolev inequality combined with suitable rescaling and Lorentz embeddings. We exploit a decomposition of the nonlocal energy together with Lorentz estimates, which enables us to control the deficit $\delta_{s,p}(u)$ in terms of the distance to $\mathcal{Z}$. The method also applies to the local case $s=1$, the argument is rearrangement-free and the exponent in the stability estimate improves the existing literature. For $p=2$, via an Emden-Fowler correspondence and pseudo-differential operators, we show that the nonlocal Hardy deficit coincides with the local one and obtain quantitative stability on $\mathbb{R}\times\mathbb{S}^{N-1}$ using the diagonalization of the fractional Hardy quadratic form due to Frank, Lieb, and Seiringer. As an application, we establish a Hardy-Heisenberg-type uncertainty principle in the nonlocal setting, which appears to be new in the literature.
Read the full abstract
Mathematical Physics · Cross-listed from quant-ph
Quantum game theory for 2 2 games: a mathematical framework
We develop a rigorous mathematical framework for quantum game theory applied to static 2x2 games, extending classical concepts to the quantum setting where players may employ arbitrary unitary operations (pure strategies) or probability measures over the continuous group SU(2) (mixed strategies). The Eisert-Wilkens-Lewenstein protocol is introduced as the standard implementation of quantum 2x2 games. We prove the existence of Nash equilibria for continuous quantum mixed strategies via a fixed-point argument, generalising the classical Nash theorem to the quantum case.
Read the full abstract
Probability · Cross-listed from cs.GT
The Privacy Subsidy: Kyle's $\lambda$ under Noise-Perturbed Order-Flow Observation
Privacy-preserving cryptocurrency exchanges alter what the pricing mechanism observes about order flow. We derive the unique linear Kyle equilibrium when a committed Bayesian market maker observes order flow perturbed by independent Gaussian privacy noise. The price-impact coefficient and informed-trader strategy rescale by reciprocal factors of the privacy parameter (one down, one up), so their product is invariant. A welfare decomposition then identifies a closed-form per-period transfer from the protocol's LP pool to traders – the "privacy subsidy", the break-even fee any privacy-aggregated exchange must charge. The result is the single-period closed-form privacy-noise analog of Loss-Versus-Rebalancing (Milionis et al. 2022). The primary application is shielded AMMs with explicit additive-noise injection (e.g., differential privacy); related designs (batched swaps, sealed-bid auctions, oracle-pegged crossings) require separate frameworks that we leave to future work.
Read the full abstract
Combinatorics
Multicritical Scaling Limit of Shifted Schur Measure
We investigate the multicritical scaling limit of the shifted Schur measures. Under an appropriate scaling limit and specific conditions on the continuous parameters, we explicitly determine the limit shape of strict partitions distributed according to the shifted Schur measure. We then show that, under a multicritical condition, the edge scaling limit of the correlation function converges to a determinant of the higher-order Airy kernel. This rigorously demonstrates a transition from a Pfaffian point process to a determinantal distribution in the scaling limit.
Read the full abstract
Probability
Turbulent stretching of FENE dumbbell polymer model via special stochastic scaling and singular limits
We investigate the stretching mechanism of Finitely Extensible Nonlinear Elastic (FENE) model of polymers in a random turbulent flow. The turbulent model includes a dominant space-scale $\ell\sim N^{-1}$, a dominant time-scale $\tau$, and is white in time. Under suitable scaling assumption, the polymer density equation, initially a stochastic Fokker-Planck equation in the presence of transport-stretching noise, converges weakly as $N\uparrow \infty$ to a limit deterministic equation with a new extra term, a second order operator. This operator, whose shape has been predicted in the physical literature by other arguments, express a sort of average `turbulent stretching' effect. With respect to other derivation of this effective model, the main novelty of our approach is that the deterministic limit is obtained pathwise, without having to take averages with respect to different realizations of the random flow. Next, we consider the limit as $\tau \downarrow 0$ and we identify the stationary distribution of the polymer length. The analysis is carried out in appropriate weighted spaces, which take into account the singularity of the FENE force near the boundary and the no-flux boundary condition, and combines stochastic scaling limit and singular limit techniques.
Read the full abstract
Number Theory
Bailey pairs, Eichler integrals and unified Witten-Reshetikhin-Turaev invariants
In 1999, Lawrence and Zagier expressed the Witten-Reshetikhin-Turaev (WRT) invariant of the Poincaré homology sphere as the limiting value of the Eichler integral of a weight 3/2 modular form. Habiro's construction of the unified WRT invariant subsequently recast this result as an identity for a $q$-hypergeometric series at roots of unity. This motivated Hikami to prove analogous $q$-series identities involving the unified WRT invariants of certain Brieskorn homology spheres. Hikami also made several conjectures of a similar type for $q$-series with no apparent connection to quantum invariants. In this paper we use the Bailey pair machinery and a novel relation between incomplete quadratic Gauss sums with periodic coefficients to construct infinite families of identities between $q$-multisums at roots of unity and limiting values of Eichler integrals of weight 3/2 modular forms. These identities include all of Hikami's results and conjectures as well as a generalization of the result of Lawrence and Zagier.
Read the full abstract
Combinatorics
A proof of Haemers' toughness conjecture
We prove that if $\Gamma$ is a connected graph with minimum degree $\delta$ and Laplacian eigenvalues $0=\mu_1<\mu_2\leqslant \cdots \leqslant \mu_n$, then the toughness of $\Gamma$ is bounded below by $\mu_2/(\mu_n-\delta)$.
Combinatorics
On the number of directions formed by Cartesian products in $\mathbb{F}_{p^2}^2$
We prove a lower bound on the number of directions determined by Cartesian products $A\times A$ in the affine plane over the finite field $\mathbb F_{p^2}$. Our lower bound holds for sets of size $p^{2/3}<|A|<p$, which are not contained in any affine copy of $\mathbb F_p$. The proof combines a structural result of Li and Roche-Newton on the set of directions formed by Cartesian products with a lower bound of Fancsali, Sziklai and Takáts. A key step shows that, unless the set of directions exhibits closure properties forcing subfield structure, one obtains a direction for which an algebraic multiplicity parameter in the latter theorem can be made explicit.