Dynamical Systems
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
Friday 20 February
In this note we document a gap in an argument in the above paper, and point to new work in the literature giving a complete proof of the main result.
Information Theory · Cross-listed from cs.LG
Noise Scheduling as Information-Guided Allocation in Diffusion Training
We introduce InfoNoise, an online adaptive noise schedule for diffusion training that reallocates optimization effort toward noise levels where denoising is most informative. Together with loss weighting, a noise schedule induces an effective allocation across denoising problems, often fixed before informative noise levels are known. InfoNoise makes this allocation data-adaptive by estimating a conditional-entropy-rate profile from denoising losses during training, without auxiliary models or offline search. Through I–MMSE, this profile identifies where noisy observations rapidly reduce uncertainty about the clean sample and guides adaptation of the training noise distribution. It changes only this distribution, keeping the objective, weighting, and parameterization fixed. On image benchmarks, where schedules have been extensively tuned, InfoNoise matches or slightly exceeds strong baselines and can reach the same quality with fewer updates. On representation, sequence, and modality shifts, including DNA and language generation, InfoNoise improves over fixed and adaptive baselines and reaches target quality with up to $3\times$ less training compute. These results establish the conditional-entropy-rate profile as the data-dependent target for noise schedule design and make online adaptation a practical alternative to manual schedule search.
Read the full abstract
Optimization and Control · Cross-listed from cs.LG
JEPA-Bisim: Learning Robust Visual Representations for Planning with Joint-Embedding Predictive World Models
World models learned from high-dimensional visual observations allow agents to make decisions and plan directly in latent space, avoiding pixel-level reconstruction. However, recent latent predictive architectures (JEPAs), including the DINO world model (DINO-WM), display a degradation in test time robustness due to their sensitivity to “slow features". These include visual variations such as background changes and distractors that are irrelevant to the task being solved. We address this limitation by augmenting the predictive objective with a bisimulation encoder that enforces control-relevant state equivalence, mapping states with similar transition dynamics to nearby latent states while limiting contributions from slow features. We evaluate our model on a navigation task (PointMaze) and on a manipulation task (PushT) under different test-time background changes and visual distractors. Across all benchmarks, our model consistently improves robustness to slow features while operating in a reduced latent space, up to $10\times$ smaller than that of DINO-WM. Moreover, our model is agnostic to the choice of pre-trained visual encoder and maintains robustness when paired with DINOv2, SimDINOv2, and iBOT features.
Read the full abstract
Numerical Analysis
From an Elementary Proof of Error Representation for Hermite Quadrature to a Rediscovery of Legendre Polynomials and Rodrigues Formula
We generalize two-point interpolatory Hermite quadrature to functions with available values and the first (n-1) derivatives at both end points. Armed with integration by parts in the reverse form we provide an elementary derivation of an exact error represenation of Hermite quadrature rule. This approach possesses several advantages over the classical approaches: i) Only integration by parts is needed for the derivation; ii) the error representation requires much milder regularity, namely the existence of nth-order derivative rather than a (2n)th-order derivative of the function under consideration. As a result, our error formula is valid for less regular functions for which the classical ones are not valid; iii) our approach rediscovers Legendre polynomials and more interestingly it provides a surprisingly elegant relation between Legendre polynomial and Hermite interpolation. In particular, Legendre polynomials are precisely the error kernels for interpolatory Hermite quadrature rules; and iv) We also rediscover the Rodrigues formula for Legendre polynomials as part of our findings. For those who are interested in a different proof of the exact error representation for Hermite quadrature rule, we provide an alternative proof using the Peano kernel theorem. We also provide a composite interpolatory Hermite quadrature rule for practical applications.
Read the full abstract
Combinatorics
Mixed jeu de taquin and a problem of Soojin Cho
Serrano (2010) introduced the shifted plactic monoid, governing Haiman's (1989) mixed insertion algorithm, as a type B analogue of the classical plactic monoid that connects jeu de taquin of Young tableaux with the Robinson-Schensted-Knuth insertion algorithm. Serrano proposed a corresponding definition of skew shifted plactic Schur functions. Cho (2013) disproved Serrano's conjecture regarding this definition, by showing that the functions do not live in the desired ring and hence cannot provide an algebraic interpretation of tableau rectification or of the corresponding structure coefficients. Cho asked for a new definition with particular properties. We introduce such a definition and prove that it behaves as desired. We also introduce a new jeu de taquin theory that computes mixed insertion.
Read the full abstract
Numerical Analysis
Discretization in Multilayered Media with High Contrasts: Is It All About the Boundaries?
Wave propagation in multilayered media with high material contrasts poses significant numerical challenges, as large variations in wavenumbers lead to strong reflections and complex transmission of the incoming wave field. To address these difficulties, we employ a boundary integral formulation thereby avoiding volumetric discretization. In this framework, the accuracy of the numerical solution depends strongly on how the material interfaces are discretized. In this work, we demonstrate that standard meshing strategies based on resolving the maximum wavenumber across the domain become computationally inefficient in multilayered configurations, where high wavenumbers are confined to localized subdomains. Through a systematic study of multilayer transmission problems, we show that no simple discretization rule based on the maximum wavenumber or material contrasts emerges. Instead, the wavenumber of the background (exterior) medium plays a dominant role in determining the optimal boundary resolution. Building on these insights, we propose an adaptive approach that achieves uniform accuracy and efficient computation across multiple layers. Numerical experiments for a range of multilayer configurations demonstrate the scalability and robustness of the proposed approach.
Read the full abstract
Combinatorics
The Sandpile Group of a Cone Over a Bi-Coconut Tree
The sandpile group of a connected graph is a finite abelian group whose cardinality is the number of spanning trees in the graph. We compute the spanning tree number and sandpile group structure for the cone over a bi-coconut tree, generalizing work of Reiner and Smith on the cone over a coconut tree. We also answer one of their questions, by exhibiting a family of trees whose sandpile groups are all cyclic but their number of leaves grows without bound.
Read the full abstract
Combinatorics
A note on a cyclotomic-friendly application of RSK
We give a combinatorial realization of a level-$\ell$ Robinson-Schensted-Knuth correspondence conjectured to exist by Song and Wang for cyclotomic Schur categories. We show that cyclotomic basis elements can be canonically reorganized into flagged block composition matrices encoding families of biwords, so that the correspondence is obtained by applying the classical RSK correspondence componentwise. This perspective identifies the level-$\ell$ correspondence as an iteration of classical RSK, specializing to the usual correspondence when $\ell=1$ and behaving naturally under restriction to lower levels.
Read the full abstract
Operator Algebras
Notes on C*-algebras, representations, and Morita equivalence (with a view toward C*-algebras of reductive groups)
These notes give an expanded account of my lectures at the CIRM-IHP research school on 'Methods in representation theory and operator algebras', January 6-10, 2025. Their main goal is to explain a proof of a theorem of A. Wassermann, that identifies the reduced C*-algebra of a real reductive group, up to Morita equivalence, with a direct sum of much simpler C*-algebras. Along the way we introduce the basic theory of representations and Morita equivalence of C*-algebras that is needed to understand the theorem and its proof. The target audience is Masters- and PhD-level students, and other mathematicians who are not specialists in operator algebras.
Read the full abstract
Functional Analysis
The heat equation and independence of the spectrum of the Hodge Laplacian on $\ell^p$
We study the heat equation associated to the Hodge Laplacian on simplicial complexes. Using recently developed techniques for magnetic Schrödinger operators, we prove Davies-Gaffney-Grigoryan type estimates for the kernel of the heat semigroup on $\ell^2,$ which we then use to extend the semigroup to $\ell^p$ for $p\in[1,\infty]$ under suitable curvature and volume growth conditions. Furthermore, we establish $p$-independence of the Hodge Laplacian spectrum under the assumption of form bounded curvature and uniform subexponential volume growth. While the main focus of the paper is the Hodge Laplacian on simplicial complexes, the results are indeed proven for general positive magnetic Schrödinger operators on graphs.
Read the full abstract
Numerical Analysis
Sparse Dictionary-Based Solution of Dynamic Inverse Problems
In ill-posed dynamic inverse problems expected spatial features and temporal correlation between frames can be leveraged to improve the quality of the computed solution, in particular when the available data are limited and the dimensionality of the unknown is large. One way to take advantage of the spatial and temporal traits believed to characterize the solution is to encode them into the entries of a dictionary, and to seek the solution as a sparse linear combination of the dictionary atoms. To promote a vector of coefficients with mostly vanishing entries, we consider a stochastic extension of the dictionary coding problem model with a random hierarchical sparsity promoting prior. We compute the Maximum A Posteriori (MAP) estimate of the coefficient vector using the Iterative Alternating Sequential Algorithm (IAS), which has been demonstrated to efficiently solve inverse problems with minimal need for parameter tuning. The proposed methodology is tested on real-world dynamic Computed Tomography and MRI datasets, where it is compared to the popular Alternating Direction Method of Minimizers (ADMM). The computed examples show the that proposed methodology is competitive with the ADMM for compressed sensing, with a significantly lower sensitivity to hyper-parameter selection.
Read the full abstract
Group Theory
A Structural Fixed-Point Principle in Kunen's Theorem on Quasigroups
Kunen proved that a quasigroup satisfying a Moufang-type identity ($N1$) must be a loop. We reformulate the argument in the category $\mathbf{Set}$ as a fixed-point extraction principle. From $N1$ one canonically obtains an idempotent endomorphism $j:G\to G$. Its fixed-point object $\mathrm{Fix}(j)=\mathrm{Eq}(j,\mathrm{id}_G)$ splits off as a retract. The $N1$-symmetry forces $j$ to coequalize the (regular) translation action, hence $j$ factors through the terminal object. Thus $\mathrm{Fix}(j)\cong 1$, yielding a unique global identity element. This provides a conceptual reformulation of Kunen's original algebraic proof \cite{Kunen}.
Read the full abstract
Mathematical Physics · Cross-listed from hep-th
Conformally-flat gravitational analogues to the Schwinger effect
We study particle creation for scalar fields in conformally flat spacetimes using resummed heat-kernel techniques. We make use of an analogy between quantum scalar fields in conformally flat spacetimes and scalar field theories with a Yukawa coupling in Minkowski space. The correspondence holds exactly at the level of the effective action and includes nonconformal curvature couplings. This framework provides access to particle creation at strong curvature. In a radiation dominated universe, the particle production rates in arbitrary dimensions are independently confirmed through explicit calculations of the Bogoliubov coefficients. We also find new exact gravitational analogues of the Schwinger effect in quantum field theory in curved spacetime.
Read the full abstract
Probability
Power Partitions and Hayman Functions
We prove, within the probabilistic framework of Khinchin families, that the generating function $P_k$ of partitions into $k$-th powers is strongly Gaussian in the sense of Báez-Duarte, and even further that it is a Hayman function. Thus the Hardy–Ramanujan asymptotic formula for the number $p_k(n)$ of partitions of $n$ into $k$-th powers which reads \[ p_k(n) \sim \frac{\alpha_k}{n^{(3k+1)/(2k+2)}} \exp\!\Big(\beta_k\, n^{1/(k+1)}\Big), \qquad n\to\infty, \] where $\alpha_k$ and~$\beta_k$ are explicit constants depending only on $k$, follows directly from Hayman's asymptotic formula for strongly Gaussian power series. The proof of strong Gaussianity of $P_k$ combines a Gaussianity criterion for Khinchin families with certain bounds of Tenenbaum, Wu and Li on the generating function; the asymptotic formula is recovered by computing asymptotic approximations of the mean and variance of the associated family. Analogous results are presented for the generating function $Q_k$ of partitions into distinct $k$-th powers.
Read the full abstract
Mathematical Physics · Cross-listed from hep-th
Strong coupling structure of $\mathcal{N}=4$ SYM observables with matrix Bessel kernel
In this paper I continue the program of studying the strong coupling expansion of certain observables in $\mathcal{N}=4$ supersymmetric Yang-Mills theory, which are given by a determinant with a matrix Bessel kernel. I show that, by reorganizing the transseries of the determinant at large values of the 't Hooft coupling, a simple underlying structure emerges, in which each exponentially suppressed correction is related to the perturbative series in a simple way. This new approach provides an efficient method to generate the full transseries for $\mathcal{N}=4$ SYM observables, such as the cusp anomalous dimension, multi-gluon scattering amplitudes, and the octagon form factor. Using high-precision numerical analysis, I verify the results and provide a complete description of the resurgence structure of the strong coupling expansion.
Read the full abstract
Metric Geometry
Simultaneous random polytope approximation characterizes the Euclidean ball
In this work, we present a new geometric characterization of the Euclidean ball based on approximation by random polytopes. We investigate when a single boundary sampling density is asymptotically optimal for two random polytope approximation problems, and show that for a convex body in $\R^d$ with $C^2$ boundary and everywhere positive principal curvatures, one fixed density minimizes the leading expected errors for any two distinct intrinsic volume differences of inscribed random polytopes if and only if the body is a Euclidean ball. We show that an analogous characterization holds for the volume and mean width differences of circumscribed random polytopes, and that uniform sampling gives the converse statement in both models. We also determine the unique density minimizing the average of two normalized leading errors, and obtain an explicit positive gap for every nonball. The proofs combine classical random polytope asymptotics, Hölder's inequality, and a curvature rigidity argument based on the Hsiung–Minkowski identities and Newton–Maclaurin inequalities.
Read the full abstract
Dynamical Systems
Global Attractors for Dissipative Flows on Degenerate Constraint Manifolds
A class of dissipative dynamical systems evolving on smooth constraint hypersurfaces endowed with degenerate induced bilinear forms is studied. The intrinsic evolution is generated by constraint–preserving vector fields on manifolds whose tangent bundles admit a nontrivial null distribution associated with the degeneracy of the induced structure. In this indefinite setting, the absence of coercive Lyapunov functionals prevents the direct application of classical attractor theory developed for Riemannian phase spaces. Dissipation is instead characterized relative to functionals that are compatible with the null distribution and exhibit decay exclusively in directions transverse to the associated foliation. Under suitable involutivity and regularity assumptions on the null distribution, all bounded trajectories are shown to be asymptotically confined to invariant leaves of the corresponding foliation. Asymptotic compactness of the intrinsic evolution is then established without coercivity by reducing the dynamics to a projected semiflow on the quotient manifold determined by the characteristic distribution. In the presence of a bounded absorbing set and continuous semiflow structure, the intrinsic evolution admits a compact global attractor saturated by the null leaves, whose effective asymptotic dynamics are governed by a compact invariant subset of the reduced phase space. Furthermore, when the compatible functional satisfies a Morse–type nondegeneracy condition in directions transverse to the null distribution and the induced transversal linearization admits no center spectrum, the projected semiflow possesses no neutral directions. The resulting framework provides a mechanism by which constraint–induced degeneracy enforces effective dimensional reduction in dissipative geometric evolution systems.
Read the full abstract
Probability
Quenched path limits and periodization stability for tilted Brownian motion in Poissonian potentials on $\mathbb{H}^d$
We analyze the existence of Brownian motion tilted by a potential of full support on hyperbolic spaces $\mathbb{H}^d$. On compact spaces, it is classical that these path limits, called Q-processes, exist and can be directly defined using the ground state of the corresponding Schrödinger operator. On non-compact spaces like $\mathbb{H}^d$, the existence fails in general. We show that for stationary random potentials on $\mathbb{H}^d$ with suitable spectral and sup norm bounds, the Q-processes exist a.s. For potentials that are factors of a Poisson point process, the method works up to sup norm $(d-1)^2/8$. In this case, we also show that the path limit can be approximated by periodic potentials. As a tool, we use the foliated space defined by the point process. It turns out that the global ground state of this foliated space serves as a substitute for the non-existing $L^2$ ground states on the leaves of the foliation. Restricting the global ground state to a leaf gives a generalized eigenwave that can be plugged into the usual machinery to get the Q-process.
Read the full abstract
Combinatorics
Polytopes of alternating sign matrices with dihedral symmetries
We study the convex hulls of $n \times n$ alternating sign matrices invariant under subgroups of the dihedral group of the square. For each non-trivial symmetry class, the symmetry determines the full matrix affinely from a smaller set of entries, allowing us to study the corresponding convex hull in a lower-dimensional space. For the vertical, vertical$\unicode{x2013}$horizontal, half-turn, diagonal, diagonal$\unicode{x2013}$antidiagonal, and total symmetry classes, we give polynomial-size linear inequality descriptions, determine the dimensions, identify all facets, and give exact facet counts. For the quarter-turn class, the natural fixed-point relaxation is not integral. We obtain the exact hull by adding parity-type Chvátal$\unicode{x2013}$Gomory inequalities, determine its dimension, and construct a family of facets indexed by Ferrers diagrams of Catalan-number cardinality, while the complete facet structure remains open. The formulations yield strongly polynomial-time algorithms for linear optimization over every non-empty symmetry class. We also show that the full-matrix polytopes of all classes except the quarter-turn class have the integer Carathéodory property and hence the integer decomposition property.
Read the full abstract
Optimization and Control · Cross-listed from eess.SY
Convex Block-Cholesky Approach to Risk-Constrained Low-thrust Trajectory Design under Operational Uncertainty
Designing robust trajectories under uncertainties is an emerging technology that may represent a key paradigm shift in space mission design. As we pursue more ambitious scientific goals (e.g., multi-moon tours, missions with extensive components of autonomy), it becomes more crucial that missions are designed with navigation (Nav) processes in mind. The effect of Nav processes is statistical by nature, as they consist of orbit determination (OD) and flight-path control (FPC). Thus, this mission design paradigm calls for techniques that appropriately quantify statistical effects of Nav, evaluate associated risks, and design missions that ensure sufficiently low risk while minimizing a statistical performance metric; a common metric is Delta-V99: worst-case (99%-quantile) Delta-V expenditure including statistical FPC efforts. In response to the need, this paper develops an algorithm for risk-constrained trajectory optimization under operational uncertainties due to initial state dispersion, navigation error, maneuver execution error, and imperfect dynamics modeling. We formulate it as a nonlinear stochastic optimal control problem and develop a computationally tractable algorithm that combines optimal covariance steering and sequential convex programming (SCP). Specifically, the proposed algorithm takes a block-Cholesky approach for convex formulation of optimal covariance steering, and leverages a recent SCP algorithm, SCvx*, for reliable numerical convergence. We apply the developed algorithm to risk-constrained, statistical trajectory optimization for exploration of dwarf planet Ceres with a Mars gravity assist, and demonstrate the robustness of the statistically-optimal trajectory and FPC policies via nonlinear Monte Carlo simulation.
Read the full abstract
Rings and Algebras
Rota-Baxter operators on $\omega$-Lie algebras
This article explores Rota-Baxter operators on finite-dimensional $\omega$-Lie algebras over a field of characteristic not 2. We provide several methods for constructing left-symmetric algebras, $\omega$-Lie algebras, and Hom-Lie algebras via compatible Rota-Baxter operators on a given $\omega$-Lie algebra. We also study the geometric structures of compatible Rota-Baxter operators of weight $0$ and isometric Rota-Baxter operators of weight $1$ over the field of complex numbers. In particular, we prove that the affine variety of all isometric Rota-Baxter operators of weight $1$ on any finite-dimensional non-Lie complex simple $\omega$-Lie algebra is $1$-dimensional. Furthermore, we show that for every $4$-dimensional non-Lie complex $\omega$-Lie algebra, there always exists a nilpotent compatible Rota-Baxter operator of weight $0$ such that the induced Hom-Lie algebra is nonabelian but solvable.
Read the full abstract
Probability
Weak approximation of kinetic SDEs: closing the criticality gap
We study the weak convergence of a generic tamed Euler-Maruyama scheme for kinetic stochastic differential equations (SDEs) with integrable drifts. We show that the marginal density of the considered scheme converges at rate 1/2 to the corresponding marginal density of the SDE. The convergence rate is independent from the criticality gap, which is new compared to previous results.
Read the full abstract
Commutative Algebra
An algebraic theory of Lojasiewicz exponents
We develop a unified algebraic and valuative theory of Lojasiewicz exponents for pairs of graded families and filtrations of ideals. Within this framework, local Lojasiewicz exponents, gradient exponents, and exponents at infinity are all realized as asymptotic containment thresholds between filtrations, governed by integral closure. This reformulation shows that Lojasiewicz exponents are fundamentally valuative optimization problems. The central structural contribution of the paper is a finite-max principle. Under verifiable algebraic hypotheses, the a priori infinite valuative supremum bounding the Lojasiewicz exponent reduces to a finite maximum, and computes the Lojasiewicz exponent precisely. We identify two complementary mechanisms leading to this phenomenon: finite testing arising from normalized blowups and Noetherian Rees algebras, and attainment via compactness of normalized valuation spaces under linear boundedness assumptions. This finite-max framework yields strong structural consequences. We prove rigidity results showing that common extremal valuations force equality of Lojasiewicz ratios, and we establish stratification and stability phenomena for Lojasiewicz exponents in families, including fractional linearity and wall-chamber behavior along natural one-parameter deformations. The theory recovers and explains classical results in toric and Newton-polyhedral settings, particularly, for Newton nondegenete case, where the Lojasiewicz exponent is computed by finitely many toric divisorial valuations corresponding to facet data. Finally, we illustrate why the hypotheses underlying the finite-max principle are essential, delineating the precise scope of the theory.
Read the full abstract
Analysis of PDEs
Reconstruction algorithms for the fractional Laplacian and applications to inverse problems
We introduce two reconstruction schemes that enable the recovery of a function in the entire Euclidean space $\mathbb{R}^n$ from local data $(u|_W, [(-\Delta)^s u]|_W)$, where $W$ is an arbitrarily small nonempty open subset of $\mathbb R^n$ and $(-\Delta)^s$ denotes the fractional Laplace operator of order $s\in (0,1)$. These procedures rely crucially on the weak Unique Continuation Property (UCP) for the fractional Laplacian. We apply these schemes to two distinct inverse problems. Following the seminal work from Ghosh et al., the first one concerns the recovery of a potential (Calderón-type problem) from the fractional Schrödinger equation under nonlocal Robin-type exterior conditions. The second one involves recovering the solution of the space-fractional heat equation in $\mathbb{R}^n$ from localized time-dependent measurements within a ball. To tackle these problems, we introduce new analytical tools such as a generalized weak Kelvin transform and a fractional Robin-to-Robin map. Finally, we provide numerical simulations for one of the reconstruction methods, illustrating the stability issues and the severe ill-posedness inherent to such inverse problems.
Read the full abstract
Information Theory
A Generalized Information Bottleneck Method: A Decision-Theoretic Perspective
The information bottleneck (IB) method seeks a compressed representation of data that preserves information relevant to a target variable for prediction while discarding irrelevant information from the original data. In its classical formulation, the IB method employs mutual information to evaluate the compression between the original and compressed data and the utility of the representation for the target variable. In this study, we investigate a generalized IB problem, where the evaluation of utility is based on the $\mathcal{H}$-mutual information that satisfies the concave (CV) and averaging (AVG) conditions. This class of information measures admits a statistical decision-theoretic interpretation via its equivalence to the expected value of sample information. Based on this interpretation, we derive an alternating optimization algorithm to assess the tradeoff between compression and utility in the generalized IB problem.
Read the full abstract
Numerical Analysis
Well-posedness and time stepping adaptivity for a class of collocation discretisations of time-fractional subdiffusion equations
Time-fractional parabolic equations with a Caputo time derivative of order $\alpha\in(0,1)$ are discretised in time using collocation methods, which assume that the Caputo derivative of the computed solution is piecewise-polynomial. For such discretisations of any order $m\ge 0$, with any choice of collocation points, we give sufficient conditions for existence and uniqueness of collocation solutions. Furthermore, we investigate the applicability and performance of such schemes in the context of the a-posteriori error estimation and adaptive time stepping algorithms.
Read the full abstract
Combinatorics
Domination and packing in graphs
The dominating number $\gamma(G)$ of a graph $G$ is the minimum size of a vertex set whose closed neighborhoods cover all vertices of $G$, while the packing number $\rho(G)$ is the maximum size of a vertex set whose closed neighborhoods are pairwise disjoint. In this paper we investigate graph classes $\mathcal{G}$ for which the ratio $\gamma(G)/\rho(G)$ is bounded by a constant $c_{\mathcal{G}}$ for every $G \in \mathcal{G}$. Our main result is an improved upper bound on this ratio for planar graphs. We also extend the list of graph classes admitting a bounded ratio by showing this for chordal bipartite graphs and for homogeneously orderable graphs. In addition, we provide a simple, direct proof for trees.
Read the full abstract
Combinatorics
A Jump in the Codegree Turán Densities of Long Tight Cycles
We study the codegree Turán density of $\mathcal{C}_\ell^r$, the $r$-uniform hypergraph tight cycle of length $\ell$. A result of Han, Lo, and Sanhueza-Matamala states that if $\ell$ is sufficiently large and $r/\gcd(r,\ell)$ is even, then the codegree Turán density of $\mathcal{C}_\ell^r$ is $1/2$. We prove that whenever the latter assumption is not satisfied, there is a significant drop in the codegree Turán density. That is, if $\ell$ is sufficiently large and $r/\gcd(r,\ell)$ is odd, then the codegree Turán density of $\mathcal{C}_\ell^r$ can be at most $1/3$. Moreover, this bound is tight for infinitely many uniformities $r$ and all sufficiently large $\ell$ in the corresponding residue classes modulo $r$. Our proof makes use of a group-theoretic connection between Turán-type theorems for tight cycles and “oriented colorings” of the edge set of a hypergraph.
Read the full abstract
Probability · Cross-listed from cs.LG
Communication-Efficient Byzantine-Robust Federated Conformal Prediction via Partial Sharing
We propose PRISM-FCP (Partial shaRing and robust calIbration with Statistical Margins for Federated Conformal Prediction), a communication-efficient Byzantine-robust federated conformal prediction framework that uses partial model sharing to mitigate stochastic model-poisoning attacks during training and histogram-based filtering to mitigate adversarial calibration submissions. Existing robust FCP approaches primarily address adversarial behavior during calibration, leaving training-stage poisoning to separate robust-training mechanisms. PRISM-FCP instead considers the coupling between the two stages. During training, clients partially share updates by transmitting only $M$ of $D$ parameters per round. Under the stated stochastic attack model, this attenuates the expected energy of each Byzantine client's perturbation contribution to the aggregate by a factor of $M/D$ relative to full sharing. When this benefit outweighs the optimization slowdown caused by partial updates, it can reduce training error and improve interval efficiency. During calibration, the server uses client-provided characterization vectors to filter suspected Byzantine clients before estimating the conformal quantile from the retained clients. Experiments on synthetic benchmarks and the UCI Superconductivity and YearPredictionMSD datasets, including Gaussian, ALIE, and sign-flipping training-stage attacks, demonstrate near-nominal empirical coverage and favorable communication–performance tradeoffs in the studied settings.
Read the full abstract
Analysis of PDEs
Limiting Absorption Principle and Radiation Condition for the Fractional Helmholtz Equation
We investigate elliptic fractional equations in the whole space, involving zero order perturbations of the fractional Laplacian $(-\Delta)^s$, $0<s<1$. Our main objective is to determine appropriate radiation conditions at infinity that ensure existence and uniqueness of solutions to the fractional type Helmholtz equation. Extending classical scattering theory for the Helmholtz equation, we introduce and analyze suitable Sommerfeld type radiation conditions for fractional orders. A central contribution is the explicit computation of the outgoing free space Greens function for the operator $(-\Delta)^s-k^{2s}$, for all $0<s<1$, any dimension and $k>0$, obtained via contour integration and a limiting absorption principle. We show that its asymptotic behavior at infinity coincides with a rescaled version of the classical Helmholtz fundamental solution, thereby justifying the standard Sommerfeld radiation condition for compactly supported sources. In addition, using resolvent estimates and a limiting absorption framework, we establish existence and uniqueness of outgoing solutions for compactly supported data, and for weighted sources. We further derive a convolution representation of the solution in terms of the outgoing fundamental solution. For inhomogeneous media with compactly supported perturbations, we reformulate the problem as a Lippmann Schwinger integral equation of Fredholm type and prove unique solvability away from a discrete set of frequencies. Our analysis provides a rigorous foundation for scattering theory of fractional Helmholtz operators and offers a framework suitable for numerical implementation of these nonlocal wave propagation models.