Peer Revenue Play credits. Real papers.

Papers

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

Mathematics

math Watch Mathematics (sign in to use)

Friday 3 April

Mathematical Physics

Higher order derivative moments of CUE characteristic polynomials and the Riemann zeta function

We use random matrix theory for the Circular Unitary Ensemble (CUE) to study moments of derivatives of the Riemann zeta function shifted a small distance from the critical line. The corresponding CUE moments are studied in the limit of large matrix size in two regimes: when the spectral parameter is (1) suitably far inside the unit disc, and (2) at a small distance from the unit circle. In case (1), we obtain an asymptotic formula as a combinatorial sum over contingency tables, while in case (2) we obtain a sum over certain determinants with multiplicative coefficients given by Kostka numbers. The latter result is also valid exactly on the unit circle. Then, we consider the analogous problem for mean values of derivatives of the zeta function with suitable shifts. Assuming the Lindelöf hypothesis, we show that this mean value gives rise to the same sum over contingency tables obtained in the CUE. For sufficiently low-order moments, we establish this result unconditionally.
Read the full abstract

Information Theory

Posterior Matching over Binary-Input Memoryless Symmetric Channels: Non-Asymptotic Bounds and Low-Complexity Encoding

We study variable-length feedback (VLF) codes over binary-input memoryless symmetric (BMS) channels using posterior matching with small-enough-difference (SED) partitioning. Prior analyses of SED-based schemes rely on bounded log-likelihood ratio (LLR) increments, restricting their scope to discrete-output channels such as the binary symmetric channel (BSC). We remove this restriction and provide an analysis of posterior matching that covers a broad class of BMS channels, including continuous-output channels such as the binary-input AWGN channel. We derive a novel non-asymptotic achievability bound on the expected decoding time that decomposes into communication, confirmation, and recovery terms with explicit dependence on the channel capacity~$C$, the KL divergence~$C_1$, and the Bhattacharyya parameter of the channel. The proof develops new stopping-time and overshoot bounds for submartingales and random walks with unbounded increments, drawing on tools from renewal theory. On the algorithmic side, we propose a low-complexity encoder that enforces the exact SED partition at every step by grouping messages according to their log-likelihood ratios that are assumed to land on a lattice, and applying a batched correction step that restores the partition balance. The resulting encoder complexity is polynomial in the number of transmitted bits. For continuous-output channels, the lattice structure is enforced through output quantization satisfying an exact induced-lattice constraint; the associated capacity loss is $O(\log B / B^2)$ for a $B$-level quantizer. These results yield a VLF coding scheme for BMS channels that simultaneously achieves strong non-asymptotic performance and practical encoder complexity.
Read the full abstract

Complex Variables

A note on the Erdös minimal area problem

We answer a question of Erdős, Herzog, and Piranian \cite[Problem $4$, page $135$]{EHP} on the minimal area of polynomial lemniscates when all the zeros of the polynomial are constrained to lie on a compact set $K$ whose logarithmic capacity is greater than $1$. We show that the minimal area decays exponentially fast and prove that the Fekete polynomials are asymptotic minimizers for the area problem.
Read the full abstract

Numerical Analysis

Learning Contractive Integral Operators with Fredholm Integral Neural Operators

We generalize the framework of Fredholm Neural Networks, to learn non-expansive integral operators arising in Fredholm Integral Equations (FIEs) of the second kind in arbitrary dimensions. We first present the proposed Fredholm Integral Neural Operators (FREDINOs), for FIEs and prove that they are universal approximators of linear and non-linear integral operators and corresponding solution operators. We furthermore prove that the learned operators are guaranteed to be contractive, thereby strictly satisfying the mathematical property required for the convergence of the fixed point scheme. Finally, we also demonstrate how FREDINOs can be used to learn the solution operator of non-linear elliptic PDEs, via a Boundary Integral Equation (BIE) formulation. We assess the proposed methodology numerically, via several benchmark problems: linear and non-linear FIEs in arbitrary dimensions, as well as a non-linear elliptic PDE in 2D. Built on tailored mathematical/numerical analysis theory, FREDINOs offer high-accuracy approximations and interpretable schemes, making them well suited for scientific machine learning/numerical analysis computations.
Read the full abstract

Probability

A localized coupling approach to interacting continuous-state branching processes

We introduce a class of continuous-state branching processes with immigration, predation and competition, which can be viewed as a combination of the classical Lotka-Volterra model and continuous-state branching processes with competition that were introduced by Berestycki, Fittipaldi, and Fontbona (Probab. Theory Relat. Fields, 2018). This model can be constructed as a unique strong solution to a class of two-dimensional stochastic differential equations with jumps. We establish sharp conditions for the uniform ergodicity in the total variation of this model. Our proof relies on a novel, localized Markovian coupling approach, which is of its own interest in the ergodicity theory of Markov processes with interactions.
Read the full abstract

Numerical Analysis

Generalized Transferable Neural Networks for Steady-State Partial Differential Equations

Deep learning has emerged as a compelling framework for scientific and engineering computing, motivating growing interest in neural network-based solvers for partial differential equations (PDEs). Within this landscape, network architectures with deterministic feature construction have become an appealing approach, offering both high accuracy and computational efficiency in practice. Among them, the transferable neural network (TransNet) is a special class of shallow neural networks (i.e., single-hidden-layer architectures), whose hidden-layer parameters are predetermined according to the principle of uniformly distributed partition hyperplanes. Although TransNet has demonstrated strong performance in solving PDEs with relatively smooth solutions, its accuracy and stability may deteriorate in the presence of highly oscillatory solution structures, where activation saturation and system conditioning issues become limiting factors. In this paper, we propose a generalized transferable neural network (GTransNet) for solving steady-state PDEs, which augments the original TransNet design with additional hidden layers while preserving its interpretable feature-generation mechanism. In particular, the first hidden layer of GTransNet retains TransNet's parameter sampling strategy but incorporates an additional symmetry constraint on the neuron biases, while the subsequent hidden layers omit bias terms and employ a variance-controlled sampling strategy for selecting neuron weights.
Read the full abstract

All authors Tao Cheng, Lili Ju, Zhonghua Qiao, Xiaoping Zhang

Algebraic Geometry

New $\mu$-Zariski pairs of surface singularities

To the best of the authors' knowledge, all previously known examples of $\mu$-, $\mu^*$-, link-, or ordinary Zariski pairs of surface singularities in $\mathbb{C}^3$ consist of (possibly weighted) Lê-Yomdin singularities. In this paper, we present an example of a $\mu$-Zariski pair involving surface singularities that are not of Lê-Yomdin type.
Read the full abstract

All authors Christophe Eyral, Masaharu Ishikawa, Mutsuo Oka, Öznur Turhan

Category Theory · Cross-listed from cs.LO

Compositionality of Lyapunov functions via assume-guarantee reasoning

Assume-guarantee reasoning is a technique for compositional model checking in which system specifications are checked under certain assumptions on system parameters or inputs, and provide guarantees on observations of system state. We present a categorical framework for assume-guarantee reasoning for safety problems by viewing systems as lenses, following our earlier work on the compositionality of generalized Moore machines. Generalized Moore machines include ordinary Moore machines, partially observable Markov (decision) processes, and systems of parameterized ODEs (control systems); our framework gives assume-guarantee reasoning specially adapted to each of these cases. In particular, we give a novel formulation of assume-guarantee reasoning for (local) input-to-state stability ((L)ISS) Lyapunov functions on systems of parameterized ODEs. Our framework is categorically natural and straightforwardly compositional. A flavor of generalized Moore machine is determined by a tangency: a fibration with a section. We show that symmetric monoidal loose right modules of assume-guarantee certified generalized Moore machines over symmetric monoidal double categories of certified wiring diagrams can be constructed 2-functorially from fibrations internal to the 2-category of tangencies.
Read the full abstract

Probability · Cross-listed from cs.LG

Generating DDPM-based Samples from Tilted Distributions

Given $n$ independent samples from a $d$-dimensional probability distribution, our aim is to generate diffusion-based samples from a distribution obtained by tilting the original, where the degree of tilt is parametrized by $\theta \in \mathbb{R}^d$. We define a plug-in estimator and show that it is minimax-optimal. We develop Wasserstein bounds between the distribution of the plug-in estimator and the true distribution as a function of $n$ and $\theta$, illustrating regimes where the output and the desired true distribution are close. Further, under some assumptions, we prove the TV-accuracy of running Diffusion on these tilted samples. Our theoretical results are supported by extensive simulations. Applications of our work include finance, weather and climate modelling, and many other domains, where the aim may be to generate samples from a tilted distribution that satisfies practically motivated moment constraints.
Read the full abstract

All authors Himadri Mandal, Dhruman Gupta, Rushil Gupta, Sarvesh Ravichandran Iyer, Agniv Bandyopadhyay, Achal Bassamboo, Varun Gupta, Sandeep Juneja

Numerical Analysis

Order jumps in Spectral Deferred Corrections

Spectral deferred corrections (SDC) are time-stepping schemes were a low-order integrator is used iteratively to produce a higher order numerical approximation. SDC methods are well-known to obtain at least one additional order of accuracy per iteration. We analyse the phenomenon of "order jumps", which were observed experimentally in previous work, where the order increases by two in a single iteration. Our analysis relies on Butcher series for the analysis of Runge–Kutta methods (RKM) and includes the case of collocation and discontinuous collocation RKM. We prove that order jumps can be obtained by using appropriate inconsistent, implicit, parallelisable error discretisations. We also investigate the stability properties of order-jump SDC methods and show that, in general, they reduce to that of explicit RKM. Suitable combinations of error discretisations, informed by our analysis, could balance order gains and stability and deliver improved SDC methods in the future.
Read the full abstract

All authors Eugen Bronasco, Joscha Fregin, Daniel Ruprecht, Gilles Vilmart

Mathematical Physics

Cartan connections for an infinite family of integrable vortices

An infinite family of integrable vortex equations is studied and related to the Cartan geometry of the underlying Riemann surfaces. This Cartan picture gives an interpretation of the vortex equations as the flatness of a non-Abelian connection. Solutions of the vortex equations also give rise to magnetic zero-modes for a certain Dirac operator on the lifted geometry. The family of integrable vortex equations is parametrised by a positive number $n$, that is equal to unity in the standard case and an integer in the case of polynomial vortex equations; finally, it may be extended to any positive real number.
Read the full abstract

Probability

The Variational Approach in Filtering and Correlated Noise

The variational formulation of nonlinear filtering due to Mitter and Newton characterizes the filtering distribution as the unique minimizer of a free energy functional involving the relative entropy with respect to the prior and an expected energy. This formulation rests on an absolute continuity condition between the joint path measure and a product reference measure. We prove that this condition necessarily fails whenever the signal and observation diffusions share a common noise source. Specifically we show that the joint and product measures are mutually singular, so no choice of reference measure can salvage the formulation. We then introduce a conditional variational principle that replaces the prior with a reference measure that preserves the noise correlation structure. This generalization recovers the Mitter–Newton formulation as a special case when the noises are independent, and yields an explicit free energy characterization of the filter in the linear correlated-noise setting.
Read the full abstract

Number Theory

A proof of Wolstenholme's theorem and congruence properties via an Egorychev-type integral

We present a detailed proof of Wolstenholme's theorem using an Egorychev-type contour integral and an exponential change of variables. All formal series manipulations are justified, and the connection with harmonic sums and Bernoulli numbers is made completely explicit. We further derive the classical refinement modulo $p^4$ and provide a precise extraction of the $B_{p-3}$ term. Our purpose is not to provide the most concise proofs, but rather to demonstrate, by showing how established results can be recovered, a general method based on complex analysis for deriving congruence properties in number theory.
Read the full abstract

Probability

Nonzero-Sum Stochastic Differential Games for Controlled Convection-Diffusion SPDEs

This paper studies a two-player nonzero-sum stochastic differential game governed by a controlled convection-diffusion stochastic partial differential equation (SPDE) with spatially heterogeneous coefficients. The diffusion and transport operators depend on the players' controls, allowing each agent to influence the system dynamics. We prove the existence and uniqueness of solutions to both the forward uncontrolled SPDE and the associated adjoint backward SPDE (BSPDE) in a Hilbert space framework. Using a Hamiltonian approach, we derive sufficient and necessary maximum principles characterizing Nash equilibria. Special attention is given to operators with piecewise constant coefficients, where interface transmission conditions arise naturally. As an illustration, we provide two examples from composite materials where the game structure models the interaction between different material phases in a diffusion process.
Read the full abstract

Geometric Topology

Infinitesimal sl(2)-symmetries on the equivariant skein lasagna module

We construct an sl(2)-action on the equivariant skein lasagna module.
Read the full abstract

All authors You Qi, Louis-Hadrien Robert, Joshua Sussan, Emmanuel Wagner, Paul Wedrich

Algebraic Geometry

A penalised Saito functional for heuristic search of free line arrangements

We introduce the penalised Saito functional $\mathfrak S_{\lambda,\beta}(\mathcal{A};d_1,d_2)$ for a reduced arrangement $\mathcal{A}$ of $n$ lines and a prescribed pair $d_1+d_2=n-1$. It measures the alignment of a candidate Saito determinant with the defining polynomial while penalising the failure of the candidate derivations to be logarithmic. We prove that the functional takes values in $[0,1]$, vanishes exactly when $\mathcal{A}$ is free with exponents $(1,d_1,d_2)$, and lies strictly between $0$ and $1$ otherwise. For fixed $(d_1,d_2)$, it is upper semicontinuous on the reduced configuration space, continuous at arrangements free with the prescribed pair, and converges as $\lambda\to\infty$ to the corresponding binary freeness test. We use a numerical approximation of this functional, together with a small $b_2$-shell term, to guide fixed-cardinality line-replacement searches over $\mathbb{Q}$ and selected quadratic extensions. Numerical values are used only to select candidates; every reported arrangement is certified in exact arithmetic using Saito's criterion. At the current snapshot, the certified database contains $6{,}146$ representatives with distinct Weisfeiler–Leman fingerprints and cardinalities up to $n=28$. Among them, $3{,}012$ have multiplicity gap $\epsilon(\mathcal{A})=d_1-m(\mathcal{A})\geq2$, including lower-bound-extremal examples with $\epsilon=7$. These non-supersolvable arrangements provide test cases for studying realisation spaces and the persistence of freeness among realisations of the same intersection lattice, in connection with Terao's conjecture.
Read the full abstract

Information Theory

Weight distribution bounds to relate minimum distance, list decoding, and symmetric channel performance

We study relationships between worst-case and random-noise properties of error correcting codes. More concretely, we consider connections between minimum distance, list decoding radius, and block error probability on noisy channels. A recent result of Pernice, Sprumont, and Wootters established the tight connection between list decoding radius and symmetric channel performance for linear codes. We extend this result to general codes. The proof proceeds by directly bounding the weight distribution rather than by sharp threshold techniques. We then turn to the relation between minimum distance and symmetric channel performance. The results we just described imply that a $q$-ary code of relative distance $\delta$ has vanishing error probability on the symmetric channel up to the Johnson radius $J_q(\delta)$. We improve upon this bound in the case of linear codes, for a range $\delta$, for $q\ge 4$. In our proof we consider the erasure properties of codes, and bound their weight distribution through inequalities introduced by Samorodnitsky. The latter part of the proof gives a more general technique that bounds the symmetric channel performance of a linear code with constant relative distance and good erasure channel performance.
Read the full abstract

Combinatorics

Face $S_3$-colorings and Petrie monochromatic circuits for efficient total arc colorings of cubic maps of girth 4

Let $G=(V(G),E(G))$ be a finite connected simple cubic graph. A total coloring $\mu:V(G)\cup E(G)\rightarrow\{0,1,2,3\} $ is efficient if each color yields an efficient dominating set, where the efficient dominating condition applies to the restriction of each color class to $V(G)$. If the girth of $G$ is 4 and $\mu$ uses 4 colors both on vertices and edges of each 4-cycle, then $\mu$ is an ETGC. Maps $M(G)$ of such $G$ are considered on the orientable surfaces. We show that a necessary condition for ETGCs to exist on $M(G)$ is that they have only face lengths divisible by 4. When such ETGCs exist, for which 7 constructive tools are provided, the faces of the maps $M(G)$ possessing them are shown to be colorable by the group $S_3$ of 3-permutations whenever the ETGCs are periodic. For the vertex coloring of each ETGC, there are two orthogonal edge colorings: directed and reversed. There are two injections into the set of face $S_3$-colorings: one from the set of periodic directed ETGCs, the other from that of periodic reversed ETGCs. We take each edge of $G$ as a pair of opposite arcs. Let $A^\leftrightarrow$ be the set of such arcs and let $G^\leftrightarrow$ be the digraph with vertex set $V(G)$ and arc set $A^\leftrightarrow$. A ditotal coloring $\mu^\leftrightarrow$ of $G^\leftrightarrow$ is given by having bijections via $\mu^\leftrightarrow$ from the sets formed by: {\bf(a)} each vertex and the arcs arriving to it; {\bf(b)} each vertex and the arcs departing from it; {\bf(c)} each vertex and its neighbors; {\bf(d)} each pair of oppositely oriented arcs of an edge and its end-vertices. Then, each ETGC of an $M(G)$ has a ditotal coloring. The Petrie dual of the resulting map $M(G^\leftrightarrow)$ is formed by monochromatic directed cycles.
Read the full abstract

Representation Theory

Semisimplicity criterion for 2-tonal partition algebras

We determine the semisimplicity criterion for even partition algebras over the complex field. Specifically we prove that the even/2-tonal partition algebras $P_n^2(\delta)$ over $\mathbb{C}$ are semisimple for all $n$ if and only if parameter $\delta \not\in \mathbb{N}_0$ .
Read the full abstract

All authors C. Ahmed, G. M. Benkart, O. H. King, P. P. Martin, A. E. Parker

Classical Analysis and ODEs

A Bilinear Kakeya Inequality in the Heisenberg Group

We prove a bilinear Kakeya inequality in the first Heisenberg group and a sharp bilinear Kakeya estimate for Euclidean curved tubes in $\R^2$. By adapting an argument of Fässler, Pinamonti and Wald involving Heisenberg projections, we show that the latter implies the former. We prove the estimate for curved tubes using a combination of techniques developed by Pramanik, Yang and Zahl, Wolff and Schlag. We introduce a novel broadness hypothesis inspired by works of Zahl, which rules out bush-type configurations that break transversal structure. We argue that such a hypothesis is needed for proving the bilinear estimates we present. We also introduce necessary additional linear terms to the estimate to counteract Szemerédi–Trotter-type clustering phenomena.
Read the full abstract

Combinatorics

Cliques in graphs constructed from Strongly Orthogonal Subsets in exceptional root systems

Given a root system $R$, two roots are said to be strongly orthogonal if neither their sum nor difference is a root. Gashi defined a family of graphs with vertices labelled by sums of $k$-element strongly orthogonal subsets of roots, and edges connect vertices whose difference is also a vertex. Gashi and the current authors established Erdős–Ko–Rado type results for graphs developed from Type $A$ root systems. In this paper, we study graphs developed from the exceptional root systems $G_2$, $F_4$, $E_6$, $E_7$, and $E_8$. We compute graph-theoretic invariants including regularity, connectivity, and clique numbers, and analyze clique structures with respect to sunflower properties. The automorphism group contains the Weyl group; we use these symmetries to obtain complete counts of maximum cliques and maximum sunflowers. Unlike type $A$, where all maximal cliques are sunflowers for large rank, sunflower cliques comprise at most 11% of maximum cliques in the simply-laced exceptional types $E_6$, $E_7$, and $E_8$.
Read the full abstract

Analysis of PDEs

Characterization of spacetime singularities for the Schrödinger equation by initial state

We discuss spacetime singularities of a solution to the Schrödinger equation with a metric perturbation and a sublinear potential. The quasi-homogeneous wave front set, due to Lascar (1977), of a solution is characterized by that of the free solution, and a classical high-energy scattering data. In the one-dimensional case, it further reduces to the homogeneous wave front set, due to Nakamura (2005), of the initial time-slice. For the proof of the former result we implement an idea inspired by Nakamura (2009), which was originally devised for spatial singularities of the Schrödinger equation. As for the latter result, we use an exact Egorov-type formula for the free propagator, and a special partition of unity conforming with the classical flow.
Read the full abstract

Analysis of PDEs

Planar doubling nodal solutions to the Yamabe equation with maximal rank

This article constructs two families of nodal solutions to the Yamabe equation, each concentrating along two planar circles. One family is conformally equivalent to the one previously obtained by Medina–Musso. The second family is a twisted variant of the first; it is new and is derived from ansatzes that are not Kelvin invariant, in contrast to a standard assumption in earlier works. In addition, in dimension 3, these solutions attain maximal rank. By means of a continuous family of conformal transformations, we then analyze the interaction of the two circles, which display a crossing phenomenon reminiscent, in some sense, of leap-frogging behavior in vortex dynamics.
Read the full abstract

Number Theory

Points of low degree on curves over function fields

We show that the geometric classification of smooth projective curves admitting infinitely many points of degree $d\leq 5$ extends from number fields to function fields of characteristic 0. Over number fields, this classification was established by Faltings for $d=1$, Harris–Silverman for $d=2$, Abramovich–Harris for $d=3,4$ and Kadets–Vogt for $d=4,5$. Our approach uses a specialization argument to reduce the problem over function fields to the number field case.
Read the full abstract

Algebraic Geometry

Automorphisms of the boundary complex of $\overline{\mathcal{M}}_{0, n}(\mathbb{P}^r, d)$

We compute the automorphism group of the dual complex $\mathsf{T}_{d, n}$ of the boundary divisor in the Kontsevich moduli space $\overline{\mathcal{M}}_{0, n}(\mathbb{P}^r, d)$. When $d \geq 2$, we find that $\mathrm{Aut}(\mathsf{T}_{d, n}) \cong \mathbb{S}_{n}$, while $\mathrm{Aut}(\mathsf{T}_{1, n}) \cong \mathbb{S}_{n + 1}$ for all $n \geq 4$. The complex $\mathsf{T}_{1, n}$ is also the dual complex of the boundary divisor in the Fulton–MacPherson compactification of the configuration space of $n$ points on $X$, if $X$ is any smooth, proper, and connected algebraic variety over $\mathbb{C}$. Following work of Massarenti, this implies that $\mathsf{T}_{1, n}$ admits automorphisms which in general do not extend to $X[n]$.
Read the full abstract

Optimization and Control

Separable QCQPs and Their Exact SDP Relaxations

This paper studies exact semidefinite programming relaxations (SDPRs) for separable quadratically constrained quadratic programs (QCQPs). We consider the construction of a larger separable QCQP from multiple QCQPs with exact SDPRs. We show that exactness is preserved when such QCQPs are combined through a separable horizontal connection, where the coupling is induced through the right-hand-side parameters of the constraints. The proposed framework provides a simple sufficient condition for exactness of the resulting SDPR. We then identify notable classes of QCQPs for which this condition holds, including convex QCQPs, QCQPs defined by sign-pattern and graph-structural conditions, and separable homogeneous QCQPs with a limited number of constraints. Two examples illustrate the constructive nature of the proposed framework, showing how heterogeneous QCQPs can be combined to yield new instances with exact SDP relaxations.
Read the full abstract

Combinatorics

The record statistic and forward stability of Schubert products

We initiate a probabilistic study of forward stability for products of Schubert polynomials through the record statistic (left-to-right maxima) of permutations. Building on the explicit record formula for forward stability obtained by Hardt and Wallach, we study random pairs of permutations drawn from three natural families: uniform permutations, Grassmannian permutations, and Boolean permutations. For each family, we determine record probabilities and use them to analyze the asymptotic behavior of forward stability. For uniform and Grassmannian permutations, we obtain asymptotics for the mean together with limiting distribution results. For Boolean permutations, we prove linear-order growth of the mean, and our analysis also produces an explicit time-inhomogeneous Markov chain that yields an exact linear-time uniform sampler. Beyond these cases, we prove that the record-set statistic is equidistributed on the avoidance classes of $132$ and $231$, and consequently the corresponding forward stability distributions coincide. We conclude with conjectures for numerous further permutation classes and a conjectural recursive criterion for when two avoidance classes have the same record-set distribution.
Read the full abstract

Number Theory

Large values of $L(\sigma,\chi)$ over sets of characters with small product set

We obtain (conditional and unconditional) results on large values of $L$-functions $L(s,\chi)$ in the critical strip $1/2 \leq \Re s \leq 1$ when the character $\chi$ runs through the ratio set ${\mathcal A}/{\mathcal A}$ of a thin set ${\mathcal A}$ of characters with small product set modulo a prime $q$. Some of these bounds are based on new zero-density estimates on average over sets of characters with a small product set. These bounds follow from a mean value estimate for character sums, which is based on the work of D. R. Heath-Brown (1979). As yet another application of this mean value estimate, we obtain an unconditional version of a conditional (on the Generalised Riemann Hypothesis) result of Z. Rudnick and A. Zaharescu (2000) about gaps between primitive roots.
Read the full abstract

All authors Pranendu Darbar, Bryce Kerr, Marc Munsch, Igor Shparlinski

Mathematical Physics

On a stability of time-optimal version of the Boundary Control method

Let $\Omega$ be a Riemannian manifold with boundary. The time-optimal version of the BC-method determines the parameters in the $T$-neigh\-bor\-hood $\Omega^T$ of $\partial\Omega$ from the boundary observations (response operator) $R^{2T}$ on the time segment $[0,2T]$. It visualizes the invisible waves supported in $\Omega^T$, by reconstructing the operator $W^T$ that creates these waves. The visualization is based on the triangular factorization of the operator $C^T:=W^{T\,*}W^T$ in the form $C^T:=F^{T\,*}F^T$ with a factor $F^T=U^{T}W^T$, where $U^T$ is a unitary operator. The factorization $C^T\mapsto F^T$ has certain continuity properties, due to which the time-optimal reconstruction $R^{2T}\mapsto C^T\mapsto F^T\mapsto W^T$ turns out to be continuous (stable) in the sense of relevant operator topologies (convergences). As an example, determination of the potential $q$ in the wave equation $u_{tt}-\Delta u+qu=0$ from $R^{2T}$ is considered. We show that $R^{2T}_j\to R^{2T}$ implies $q_j\to q$ in $H^{-2}(\Omega^T)$. However, the question of quantitative estimates of stability (the rate of convergence) remains open.
Read the full abstract

Combinatorics · Cross-listed from cs.DM

Sample compression schemes for balls in structurally sparse graphs

Sample compression schemes were defined by Littlestone and Warmuth (1986) as an abstraction of the structure underlying many learning algorithms. In a sample compression scheme, we are given a large sample of vertices of a fixed hypergraph with labels indicating the containment in some hyperedge. The task is to compress the sample in such a way that we can retrieve the labels of the original sample. The size of a sample compression scheme is the amount of information that is kept in the compression. Every hypergraph with a sample compression scheme of bounded size must have bounded VC-dimension. Conversely, Moran and Yehudayoff (J. ACM, 2016) showed that every hypergraph of bounded VC-dimension admits a sample compression scheme of bounded size. We study a specific class of hypergraphs emerging from balls in graphs. The schemes that we construct (contrary to the ones constructed by Moran and Yehudayoff) are proper, meaning that we retrieve not only the labeling of the original sample but also a hyperedge (ball) consistent with the original labeling. First, we prove that for every graph $G$ of treewidth at most $t$, the hypergraph of balls in $G$ has a proper sample compression scheme of size $\mathcal{O}(t\log t)$; this is tight up to the logarithmic factor and improves the quadratic (improper) bound that follows from the result of Moran and Yehudayoff. Second, we prove an analogous result for graphs of cliquewidth at most $t$.
Read the full abstract

All authors Romain Bourneuf, Jędrzej Hodor, Piotr Micek, Clément Rambaud