Peer Revenue Returns subject to peer review

Papers

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

Mathematics

math Watch Mathematics (sign in to use)

Friday 13 March

Probability

Universality for the 2D Random Walk Loop Soup

We show that the scaling limit of the random walk loop soup on suitable planar graphs is the Brownian loop soup, under a topology on multisets of unrooted, unparameterized, and macroscopic loops. The result holds assuming only convergence of simple random walk to Brownian motion, a Russo-Seymour-Welsh type crossing estimate, and the bounded density of the graphs. The proof relies on Wilson's algorithm and Schramm's finiteness theorem. Precisely, we approximate the random walk loop soup by the set of loops erased in a greedy variant of Wilson's algorithm, thereby establishing convergence. The resulting limit is identified using the result of Lawler and Trujillo Ferreras arXiv:math/0409291.
Read the full abstract

Probability

Clustering without geometry in sparse networks with independent edges

The coexistence of sparsity and clustering (non-vanishing average fraction of triangles per node) is one of the few structural features that, irrespective of finer details, are ubiquitously observed across large real-world networks. This fact calls for generic models producing sparse clustered graphs. Earlier results suggested that sparse random graphs with independent edges fail to reproduce clustering, unless edge probabilities are assumed to depend on underlying metric distances that, thanks to the triangle inequality, naturally favour triadic closure. This observation has opened a debate on whether clustering implies (latent) geometry in real-world networks. Alternatively, recent models of higher-order networks can replicate clustering by abandoning edge independence. In this paper, we mathematically prove, and numerically confirm, that a sparse random graph with independent edges, recently identified in the context of network renormalization as an invariant model under node aggregation, produces finite clustering without any geometric or higher-order constraint. The underlying mechanism is an infinite-mean node fitness, which also implies a power-law degree distribution. Further, as a novel phenomenon that we characterize rigorously, we observe the breakdown of self-averaging of various network properties. Therefore, as an alternative to geometry or higher-order dependencies, node aggregation invariance emerges as a basic route to realistic network properties.
Read the full abstract

Numerical Analysis

PhaseJumps: fast computation of zeros from planar grid samples

We consider complex-valued functions on the complex plane and the task of computing their zeros from samples taken along a finite grid. We introduce PhaseJumps, an algorithm based on comparing changes in the complex phase and local oscillations among neighboring grid points. The algorithm is applicable to possibly non-analytic input functions, and also computes the direction of phase winding around zeros. PhaseJumps provides a first effective means to compute the zeros of the short-time Fourier transform of an analog signal with respect to a general analysis window, and makes certain recent signal processing insights more widely applicable, overcoming previous constraints to analytic transformations. We study the performance of (a variant of) PhaseJumps under a stochastic input model motivated by signal processing applications and show that the input instances that may cause the algorithm to fail are fragile, in the sense that they are regularized by additive noise (smoothed analysis). Precisely, given samples of a function on a grid with spacing $\delta$, we show that our algorithm computes zeros with accuracy $\sqrt{\delta}$ in the Wasserstein metric with failure probability $O\big(\log^2(\tfrac{1}{\delta}) \delta\big)$, while numerical experiments suggest even better performance.
Read the full abstract

Optimization and Control

Reinforcement Learning for Discounted and Ergodic Control of Diffusion Processes

This paper develops a quantized Q-learning algorithm for the optimal control of controlled diffusion processes on $\mathbb{R}^d$ under both discounted and ergodic (average) cost criteria. We first establish near-optimality of finite-state MDP approximations to discrete-time discretizations of the diffusion, then introduce a quantized Q-learning scheme and prove its almost-sure convergence to near-optimal policies for the finite MDP. These policies, when interpolated to continuous time, are shown to be near-optimal for the original diffusion model under discounted costs and – via a vanishing-discount argument – also under ergodic costs for sufficiently small discount factors. The analysis applies under mild conditions (Lipschitz dynamics, non-degeneracy, bounded continuous costs, and Lyapunov stability for ergodic case) without requiring prior knowledge of the system dynamics or restrictions on control policies (beyond admissibility). Our results complement recent work on continuous-time reinforcement learning for diffusions by providing explicit near-optimality rates and extending rigorous guarantees both for discounted cost and ergodic cost criteria for diffusions with unbounded state space.
Read the full abstract

All authors Erhan Bayraktar, Ali D. Kara, Somnath Pradhan, Serdar Yuksel

Combinatorics

An effective Mayer-Vietoris Theorem for discrete Morse homology

The Mayer-Vietoris theorem is known for its wide applications, especially in determining homology. In fact, this theorem provides us with a long exact sequence, where the underlying homology groups fit in. However, this theorem does not provide an explicit way to compute homology. In this paper we prove an “effective" version of the Mayer-Vietoris theorem using discrete Morse theory. Suppose, we have a Mayer-Vietoris type setup, i.e., let $X$ be a simplicial complex and $A$ and $B$ be two subcomplexes of $X$, such that $A \cup B=X$. Moreover, let $\mathcal{W}_A$, $\mathcal{W}_{B}$ and $\mathcal{W}_{A \cap B}$ be gradient vector fields on $A$, $B$ and $A \cap B$ respectively (which need not be “coherent", i.e., they do not need to coincide on their intersection). Then, the main theorem of our paper provides an explicit way to compute the homology groups of $X$, using the combinatorial information regarding the trajectories of the aforementioned gradient vector fields, we do not even need to know the individual homology groups $H_{*}(A)$, $H_{*}(B)$ and $H_{*}(A \cap B)$. In principle, the homology of $X$ can always be computed explicitly using our theorem irrespective of the choice of the gradient vector fields. Further, if we choose the subcomplexes $A$ and $B$ wisely so that each of $A$, $B$ and $A \cap B$ admits an efficient gradient vector field, then the computation of the homology groups is considerably reduced.
Read the full abstract

Mathematical Physics · Cross-listed from quant-ph

Asymptotic non-Hermitian degeneracy phenomenon and its exactly solvable simulation

Up to these days, the popular PT-symmetric imaginary cubic oscillator did not find any consistent probabilistic quantum-mechanical interpretation because its Hamiltonian has been shown, by mathematicians, intrinsic-exceptional-point (IEP) singular. In the paper we explain why there is even no reasonable small-perturbation-based regularization of the similar unacceptable (i.e., IEP-singular) quantum models. The explanation is based on a partial formal analogy of the IEP singularity with the conventional exceptional point (EP). What is important is that we are able to construct a simplified $N$ by $N$-matrix (and exactly solvable) toy-model Hamiltonian admitting the asymptotic (i.e., high-excitation) EP-related wave-function degeneracy which, in some sense (i.e., in the limit of large $N$) mimics several aspects of its IEP analogue. In this comparison, the difference is that the regularization of the EP singularities is possible (using an ad hoc perturbation of size ${\cal O}(1/N)$) while an analogous regularization of the IEP singularity is not (we have to consider $N \to \infty$).
Read the full abstract

Optimization and Control · Cross-listed from eess.SY

Unifying Decision Making and Trajectory Planning in Automated Driving through Time-Varying Potential Fields

This paper proposes a unified decision making and local trajectory planning framework based on Time-Varying Artificial Potential Fields (TVAPFs). The TVAPF explicitly models the predicted motion via bounded uncertainty of dynamic obstacles over the planning horizon, using information from perception and V2X sources when available. TVAPFs are embedded into a finite horizon optimal control problem that jointly selects the driving maneuver and computes a feasible, collision free trajectory. The effectiveness and real-time suitability of the approach are demonstrated through a simulation test in a multi-actor scenario with real road topology, highlighting the advantages of the unified TVAPF-based formulation.
Read the full abstract

All authors David Costa, Francesco Cerrito, Massimo Canale, Carlo Novara

Information Theory

Reweighted information inequalities

We establish a variant of the log-Sobolev and transport-information inequalities for mixture distributions. If a probability measure $\pi$ can be decomposed into components that individually satisfy such inequalities, then any measure $\mu$ close to $\pi$ in relative Fisher information is close in relative entropy or transport distance to a reweighted version of $\pi$ with the same mixture components but possibly different weights. This provides a user-friendly interpretation of Fisher information bounds for non-log-concave measures and explains phenomena observed in the analysis of Langevin Monte Carlo for multimodal distributions.
Read the full abstract

Analysis of PDEs

Monotonicity formulas for harmonic functions on the infinite regular tree

We continue the program initiated in \cite{SVGS}. In this paper, we focus on the infinite $d-$regular tree, and prove the monotonicity of a weighted Dirichlet energy, a Weiss-type monotonicity formula, and a generalization of the Almgren monotonicity formula of \cite{SVGS} for $p\ge 1$. We also compute examples in the infinite $2-$ and $3-$regular trees.
Read the full abstract

Optimization and Control

Solving Chance Constrained Programs via a Penalty based Difference of Convex Approach

We develop two penalty based difference of convex (DC) algorithms for solving chance constrained programs. First, leveraging a rank-based DC decomposition of the chance constraint, we propose a proximal penalty based DC algorithm in the primal space that does not require a feasible initialization. Second, to improve numerical stability in the general nonlinear settings, we derive an equivalent lifted formulation with complementary constraints and show that, after minimizing primal variables, the penalized lifted problem admits a tractable DC structure in the dual space over a simple polyhedron. We then develop a penalty based DC algorithm in the lifted space with a finite termination guarantee. We establish exact penalty and stationarity guarantees under mild constraint qualifications and identify the relationship of the local minimizers between the two formulations. Numerical experiments demonstrate the efficiency and effectiveness of our proposed methods compared with state-of-the-art benchmarks.
Read the full abstract

Optimization and Control

On Two-Player Scalar Discounted Linear Quadratic Games

This paper studies feedback Nash equilibria (FNE) in scalar two-player discounted linear-quadratic games. By explicitly discounting the objective function, we reveal the existence of finite-cost equilibria that do not necessarily stabilize the system, motivating a distinction between stable FNE and FNE. We provide a sufficient condition ensuring that every FNE is stabilizing, together with an analytical characterization of the existence, uniqueness, and multiplicity of FNE. For the symmetric setting, closed-form expressions are derived together with a complete characterization of multiplicity in terms of the game parameters. The local attractive and repelling properties of a FNE under the best-response dynamics are characterized and related to multiplicity in the symmetric setting. Analytical and numerical results further reveal an anti-coordination structure in the value functions when multiple FNE exist. Finally, the Community Cost is investigated, showing how the ordering of FNE depends on the relative weighting of the players' objectives.
Read the full abstract

Combinatorics

Aromatic and clumped multi-indices: algebraic structure and Hopf embeddings

Butcher forests extend naturally into aromatic and clumped forests and play a fundamental role in the numerical analysis of volume-preserving methods. The design of general volume-preserving methods is a challenging open problem, and recent attempts showed progress on specific dynamics. We introduce aromatic and clumped multi-indices, that are algebraic objects that simplify the study of volume-preservation to the one-dimensional setting, while retaining much of the structure (in stark opposition to standard multi-indices). We provide their algebraic structure of pre-Lie-Rinehart algebra, Hopf algebroid, and Hopf algebra, apply them in numerical analysis, and generalise to the aromatic context the Hopf embedding from multi-indices to the BCK Hopf algebra.
Read the full abstract

Mathematical Physics · Cross-listed from gr-qc

The Bianchi IX Attractor in Modified Gravity

We consider vacuum anisotropic spatially homogeneous models in certain modified gravity theories (such as Hořava-Lifshitz, $\lambda$-$R$ or $f(R)$ gravity), which are expected to describe generic spacelike singularities for these theories. These models perturb the well-known Bianchi models in general relativity (GR) by a parameter $v\in (0,1)$ with GR recovered at $v=1/2$. We prove an analogue of the well-known Ringström attractor theorem in GR to the supercritical theories: for any $v\in (1/2,1)$, all solutions of Bianchi type $\mathrm{IX}$ converge to an analogue of the Mixmaster attractor, consisting of Bianchi type I solutions (Kasner states) and heteroclinic chains of Bianchi type II solutions. In contrast to GR, there are no solutions that converge to a different set other than the Mixmaster (such as the locally rotationally symmetric solutions in GR).
Read the full abstract

Combinatorics

Centered colorings and weak coloring numbers in minor-closed graph classes

Let $\mathcal{C}$ be a proper minor-closed class of graphs. Given the minors excluded in $\mathcal{C}$, we determine the maximum $q$-centered chromatic number and the maximum $q$th weak coloring number of graphs in $\mathcal{C}$ within an $\mathcal{O}(q)$-factor. Moreover, when $\mathcal{C}$ excludes a planar graph, we determine it within a constant factor. Our results imply that the $q$-centered chromatic number of $K_t$-minor-free graphs is in $\mathcal{O}(q^{t-1})$, improving on the previously known $\mathcal{O}(q^{h(t)})$ bound with a large and non-explicit function $h$. We include similar bounds for another family of parameters, the fractional treedepth fragility rates. All our bounds are proved via the same general framework.
Read the full abstract

All authors Jędrzej Hodor, Hoang La, Piotr Micek, Clément Rambaud

Group Theory

Balanced groups and the virtually cyclic dimension of poly-surfaces groups

In this paper we obtain explicit linear upper bounds for the virtually cyclic dimension of normally poly-surface and normally poly-free groups. Our approach is based on a structural study of the balanced property (Lück's Condition~C), which provides structural control over commensurators of virtually cyclic subgroups. We prove general stability results showing that the balanced property is preserved under suitable short exact sequences, direct limits, and acylindrical graph of groups decompositions. As applications, we establish that normally poly-hyperbolic groups, normally poly-free groups, and normally poly-surface groups are balanced. These classes include, in particular, pure braid groups of surfaces with non-empty boundary, Artin groups of FC-type, right-angled Artin groups, and fundamental groups of mapping tori of surface homeomorphisms.
Read the full abstract

Numerical Analysis · Cross-listed from cs.LG

Linearized Attention Cannot Enter the Kernel Regime at Any Practical Width

Understanding whether attention mechanisms converge to the kernel regime is foundational to the validity of influence functions for transformer accountability. Exact NTK characterization of softmax attention is precluded by its exponential nonlinearity; linearized attention is the canonical tractable proxy and the object of study here. This paper establishes that even this proxy does not converge to its NTK limit at any practical width, revealing a fundamental trade-off in the learning dynamics of attention. An exact correspondence is established between parameter-free linearized attention and a data-dependent Gram-induced kernel; spectral amplification analysis shows that the attention transformation cubes the Gram matrix's condition number, requiring width $m = \Omega(\kappa_d(\mathbf{G})^6 n\log n)$ for NTK convergence, where $\kappa_d(\mathbf{G})$ is the effective condition number of the rank-$\min(n,d)$ truncation of the input Gram matrix; for natural image datasets this threshold is physically infeasible ($m \gg 10^{24}$ for MNIST and $m \gg 10^{29}$ for CIFAR-10, 12–17 orders of magnitude beyond the largest known architectures). Influence malleability is introduced to characterize this non-convergence: linearized attention exhibits 2–9$\times$ higher malleability than ReLU networks under adversarial data perturbation, with the gap depending on dataset condition number and task setting. A dual implication is established: the same data-dependent kernel is shown theoretically to reduce approximation error when targets align with the data geometry, while, empirically, creating vulnerability to adversarial manipulation of the training data. The structural argument extends to trainable QKV attention under standard initialization, with direct consequences for influence methods applied to deployed transformer architectures.
Read the full abstract

Mathematical Physics

The Lee-Huang-Yang energy for a dilute gas of hard spheres: an upper bound

We consider a quantum gas consisting of $N$ hard spheres with radius $\frak{a} > 0$, obeying bosonic statistics and moving in the box $\Lambda = [0;L]^3$ with periodic boundary conditions. We are interested in the ground state energy per unit volume in the thermodynamic limit, with $N, L \to \infty$ at fixed density $\rho = N / L^3$. We derive an upper bound for the ground state energy density, matching the famous Lee-Huang-Yang formula, up to lower order terms, in the dilute limit $\rho \frak{a}^3 \ll 1$.
Read the full abstract

All authors Giulia Basti, Morris Brooks, Serena Cenatiempo, Alessandro Olgiati, Benjamin Schlein

Analysis of PDEs

Generic small-scale creation in the two-dimensional Euler equation

The Cauchy problem for the two-dimensional incompressible Euler equation is globally well-posed for smooth initial data. We prove that, for all $p>2$ and for a dense $G_\delta$ set of initial vorticities in $W^{1,p}$, the solutions lose regularity in infinite time, in the sense that the $L^p$ norm of the gradient of the vorticity is unbounded. This confirms a long-standing conjecture of Yudovich.
Read the full abstract

Information Theory · Cross-listed from cs.LG

Fractals made Practical: Denoising Diffusion as Partitioned Iterated Function Systems

What is a diffusion model actually doing when it turns noise into a photograph? We show that the deterministic DDIM reverse chain operates as a Partitioned Iterated Function System (PIFS) and that this framework serves as a unified design language for denoising diffusion model schedules, architectures, and training objectives. From the PIFS structure we derive three computable geometric quantities: a per-step contraction threshold $L^*_t$, a diagonal expansion function $f_t(\lambda)$ and a global expansion threshold $\lambda^{**}$. These quantities require no model evaluation and fully characterize the denoising dynamics. They structurally explain the two-regime behavior of diffusion models: global context assembly at high noise via diffuse cross-patch attention and fine-detail synthesis at low noise via patch-by-patch suppression release in strict variance order. Self-attention emerges as the natural primitive for PIFS contraction. The Kaplan-Yorke dimension of the PIFS attractor is determined analytically through a discrete Moran equation on the Lyapunov spectrum. Through the study of the fractal geometry of the PIFS, we derive three optimal design criteria and show that four prominent empirical design choices (the cosine schedule offset, resolution-dependent logSNR shift, Min-SNR loss weighting, and Align Your Steps sampling) each arise as approximate solutions to our explicit geometric optimization problems tuning theory into practice.
Read the full abstract

Mathematical Physics · Cross-listed from hep-th

Two Times for Freudenthal

We investigate the algebraic structure of the two-time physics introduced some time ago by I. Bars and his co-authors, clarifying its relations with quadratic and cubic Jordan algebras, as well as with reduced Freudenthal triple systems (FTS) based on them. In particular, the `extended' phase space introduced by Bars can be endowed with the structure of a reduced FTS constructed over a semi-simple cubic Jordan algebra (named Lorentzian spin factor), characterized by a primitive, invariant symmetric tensor of rank $4$. The $Sp(2,\mathbb{R})$-gauge fixing procedure typical of two-time physics yields algebraic-differential constraints on the quartic polynomial associated to such a tensor, implying that only two (isomorphic) nilpotent orbits of the non-transitive action of the automorphism group of the Lorentzian spin factor are spanned by the conjugated variables which coordinatize the `extended' phase space. We illustrate our results in relativistic, manifestly Lorentz-covariant physical systems, as well as in non-relativistic systems (such as the non-relativistic massive particle, the hydrogen atom, and the Carroll particle with non-vanishing energy).
Read the full abstract

Logic

In Defence of the Material Conditional

The material conditional has long been charged with paradox. Defined truth-functionally, it renders true any conditional whose antecedent is false or consequent true – hence, seemingly absurd statements such as `If unicorns exist, then $2+2=4$'. This has been taken as proof that the connective cannot capture the meaning of ordinary if-then sentences, which appear to imply a causal or evidential link. I argue, by contrast, that the paradoxes arise from a confusion of what it expresses caused by cognitive biases. The material conditional properly belongs to the class of indicative, not subjunctive, conditionals – those that register patterns of co-variation rather than counterfactual dependence. When understood as a formal device marking entailment under a background theory, it faithfully represents a mode of reasoning essential to science itself: correlation without causation. The faults ascribed to it, therefore, are not flaws in meaning or standard use, but as misapplication and misreading.
Read the full abstract

Number Theory

The weight two and opposite sign cases for the Fourier relative trace formulas

We provide an adelic relative trace formula proof to the Petersson/Bruggeman-Kuznetsov (PBK) formulas, specifically in the holomorphic case for $\kappa=2$ and the non-holomorphic case for $m_1m_2<0$. Given two sets of hypothesis on the non archimedean test function $f$, called the geometric and spectral assumptions, this approach allows us to obtain refined PBK formulas.
Read the full abstract

Differential Geometry

Rigidity and Gap Phenomena in the Sphere–Ball Correspondence

This survey reviews a collection of parallel phenomena between free boundary submanifolds in the Euclidean unit ball and closed submanifolds in the sphere, with particular emphasis on rigidity mechanisms, pinching thresholds, and canonical models. We do not regard the two theories as a unified system in one-to-one correspondence. Rather, we emphasize that in several typical settings – including low topology, strong pinching, spectral extremality, and symmetry reduction – the free boundary condition often forces stronger rigidity in the unit ball than in the closed setting. The exposition is organized around six interconnected themes. We first contrast the failure of the spherical Bernstein problem in high dimensions with the dimension-independent rigidity of free boundary minimal disks in the unit ball. We then discuss the parallel roles played by the Clifford torus and the critical catenoid in uniqueness, Morse index, and eigenvalue characterizations. Next, we review the transition from the Lawson–Simons stable currents method to the Bochner–Hardy techniques developed for free boundary problems, summarize pinching and gap theorems driven by the second fundamental form and its traceless part, and outline the linear comparison framework between Morse index and topology in the minimal, constant mean curvature, and weighted settings. Finally, we survey existence results obtained from group actions, isoparametric foliations, and recent equivariant eigenvalue optimization, thereby illustrating both the striking analogies and the essential boundary-driven differences between the closed spherical theory and the free boundary theory in the ball.
Read the full abstract

Optimization and Control

Convergence Rate of a Functional Learning Method for Contextual Stochastic Optimization

We consider a stochastic optimization problem involving two random variables: a context variable $X$ and a dependent variable $Y$. The objective is to minimize the expected value of a nonlinear loss functional applied to the conditional expectation $\mathbb{E}[f(X, Y,\beta) \mid X]$, where $f$ is a nonlinear function and $\beta$ represents the decision variables. We focus on the practically important setting in which direct sampling from the conditional distribution of $Y \mid X$ is infeasible, and only a stream of i.i.d. observation pairs $\{(X^k, Y^k)\}_{k=0,1,2,\ldots}$ is available. In our approach, the conditional expectation is approximated within a prespecified parametric function class. We analyze a simultaneous learning-and-optimization algorithm that jointly estimates the conditional expectation and optimizes the outer objective. Using a specially designed measure of non-optimality, combining the squared norm of the objective function's gradient and the mean square error of the auxiliary parametric model, we establish that the method achieves a convergence rate of order $\mathcal{O}\big(1/\sqrt{N}\big)$, where $N$ denotes the number of observed pairs.
Read the full abstract

Numerical Analysis

Embedded Trefftz DG method for the Helmholtz equation

We study an embedded Trefftz discontinuous Galerkin method for the Helmholtz equation. The method starts from a polynomial DG space and enforces the Trefftz property through local constraints, avoiding an explicit construction of Trefftz basis functions. For the global coupling we use a simple symmetric interior penalty DG bilinear form. Since the resulting formulation is not coercive, stability is proved by a $T$-coercivity argument combined with a Schatz-type duality technique. This yields wavenumber-explicit stability, quasi-optimality, and convergence estimates in standard DG norms under an explicit mesh resolution condition.
Read the full abstract

Mathematical Physics · Cross-listed from hep-th

Noncommutative QFT and Relative Entropy on Axisymmetric Bifurcate Killing Horizons

We construct a deformed algebraic quantum field theory on bifurcate Killing horizons in stationary axisymmetric spacetimes. The deformation is generated by the commuting actions of affine dilations along the null generators of the horizon and rotations about the axis of symmetry, analogously to the Moyal-Rieffel deformation. Physically, this effectively implements a noncommutative geometric structure of the horizon. Moreover, we compute the relative entropy between coherent states in the deformed horizon theory, which remains strictly positive and exhibits a novel second-order correction in the deformation parameter, which becomes particularly significant for black holes whose horizon area is sufficiently small for Planck-scale effects to become non-negligible.
Read the full abstract

Probability

Maximal and minimal displacement of supercritical branching random walks on free products of groups

We prove that the maximal and minimal displacement of branching random walks with mean offspring number $\rho>1$ on free products of finite groups grows linearly almost surely. More precisely, we establish that the linear speed for the maximal (respectively minimal) displacement is given by the largest (respectively smallest) intersection point of the large deviation rate function of the underlying random walk with the horizontal line at height $\log\rho$. The proof is based on constructing an associated multitype branching process which consists of particles that travel fast enough, and distinguishing the types via the suffix of the particles locations.
Read the full abstract

All authors Robin Kaiser, Martin Klötzer, Konrad Kolesko, Ecaterina Sava-Huss

Representation Theory

The resolving completion of an exact category

For an exact category we provide two constructions of an ambient category in which the initial category is resolving: In the derived category and in the Gabriel–Quillen embedding. For the first construction we describe a pre-aisle and its right orthogonal using different acyclicty conditions. We provide necessary and sufficient conditions when this pair is a t-structure.
Read the full abstract

Logic · Cross-listed from cs.LO

Support is Search

For intuitionistic propositional logic, Sandqvist's base-extension semantics defines a support relation parametrised by atomic bases, with validity identified as support in every base. Sandqvist's completeness theorem answers the global question: which formulae are valid? This paper addresses the local question: given a fixed base, what does support in that base correspond to? We show that support in a fixed base coincides with proof-search in a hereditary Harrop logic program with a quantifier over atoms, via an encoding of formulae as logic programming goals. The encoding is a variant of the Russell-Prawitz translation of the connectives, with quantification restricted to atoms, and it is obtained by reading the semantic clauses in continuation-passing style. So read, the universal quantifiers over base extensions and atoms in those clauses need not range over a completed totality: they are eigenvariables under a standard freshness discipline. Base-extension semantics thereby acquires an explicit computational content: support is proof-search. The result complements Sandqvist's global theorem with a local correspondence and makes the constructive character of the framework explicit.
Read the full abstract

Mathematical Physics · Cross-listed from hep-th

Jones index from Rényi entropies in the Ising conformal field theory

We study the relation between the Jones index and the Rényi entropies of two disjoint intervals on the line and of the ground state for a generic value of the Rényi index in the two conformal field theory models given by the Ising model and a free Majorana fermion, where Haag duality is satisfied. The analytic expressions of the crossing asymmetry for all the submodels displaying a violation of the Haag duality that are closed under the fusion rules are obtained. In the limiting regime where the two intervals become adjacent, the leading term of the expansion of the crossing asymmetry provides the Jones global index, for any finite value of the Rényi index.
Read the full abstract