Peer Revenue Past citations are no guarantee of future returns

Papers

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

Mathematics

math Watch Mathematics (sign in to use)

Wednesday 13 May

Probability

Dean-Kawasaki Equation with Biot-Savart and Keller-Segel Interactions: Existence and Large Deviations

We establish the existence of probabilistically weak, renormalized kinetic solutions to the Dean–Kawasaki equation with singular interaction kernels, including those of Biot–Savart and Keller–Segel type. Under a suitable regularization of the square-root noise coefficient, we further prove a restricted large deviation principle for probabilistically weak solutions to the regularized Dean–Kawasaki equation. The Biot–Savart and Keller–Segel type interactions introduce a scaling criticality within the $L^1$ framework of the Dean–Kawasaki equation and the associated skeleton equation, which gives rise to a significant new challenge. In contrast to [Fehrman, Gess; Invent. Math., 2023], our large deviation analysis relies on a novel exponential tightness argument specifically adapted to the Dean–Kawasaki noise. This approach, combined with a weak-strong uniqueness result for the associated skeleton equation, allows us to partially overcome the criticality induced by the singular interaction kernel.
Read the full abstract

Analysis of PDEs

Global Yudovich-type solutions to a reduced model for micropolar fluids with zero viscosity

In this paper, we study the well-posedeness at low regularity of a two-dimensional system obtained as a reduced model for micropolar fluid dynamics. At the mathematical level, the system presents a coupling between an Euler-type equation for the two-dimensional velocity field of the fluid and an advection-diffusion equation for the scalar microrotation field. For this model, we prove global existence and uniqueness of Yudovich-type solutions, namely weak solutions for which the vorticity is only bounded (with some additional integrability property) and the microrotation field remains bounded and of finite energy. To the best of our knowledge, this is the first result which extends the genuine Yudovich framework to a system obtained by perturbing the incompressible Euler equations with some sort of heterogeneity.
Read the full abstract

Optimization and Control

Nonsmooth Set-Gradient Ascent to the Pareto Front via Layered Hypervolume and Magnitude Indicators

A nonsmooth set-gradient ascent method is developed for moving finite approximation sets toward the Pareto front in multiobjective optimization. The method optimizes layered set indicators: a base indicator is evaluated on successive nondomination layers, and the layer values are combined with rapidly decreasing weights. This gives ascent directions to nondominated and dominated points while preventing deeper layers from compensating for deterioration of the first front. Two base indicators are treated: the hypervolume indicator and the magnitude indicator of the dominated set, whose expansion over coordinate projections contains extent, projected-area, and volume terms. The scalar objectives are nonsmooth because nondomination layers change combinatorially and the active orthogonal-union geometry changes piecewise. On fixed strata, where layer assignments and active geometry remain unchanged, the indicators are piecewise smooth and chamberwise continuous. For the magnitude indicator, an exact gradient formula is derived as a linear combination of hypervolume gradients of projected shadow sets. Thus, for fixed objective dimension, magnitude gradients have the same asymptotic time complexity as hypervolume gradients. Lexicographic layer aggregation is related to a unary infinitesimal encoding. For finite-$\epsilon$ surrogates, the main nonsmoothness mechanisms are isolated and chamberwise Lipschitz continuity on bounded sets is proved; a two-point counterexample shows that hard-layer scalarization is not globally continuous across layer switches. The theory motivates a projected finite-difference implementation with repulsion and recovery from stagnation. Numerical examples and reproducible code cover two- and three-objective settings, including objective-space tests, curved fronts, a supersphere benchmark, and traces comparing layered magnitude and hypervolume ascent.
Read the full abstract

Mathematical Physics · Cross-listed from nlin.SI

On the Darboux-Halphen system: Jacobi vs Lie

Two constructions of the Darboux-Halphen system are discussed. In the Jacobi construction we start with transcendental functions which are fixed as the first integrals. In the Lie construction we use a single-valued representation of the simple Lie algebra $sl(2,\mathbb R)$ which is non-integrable in Lie's terminology.
Read the full abstract

Number Theory

Wieferich Primes and Monogenic Trinomials

A prime $p$ is called a Wieferich prime if $2^{p-1}\equiv 1 \pmod{p^2}$. A monic polynomial $f(x)\in {\mathbb Z}[x]$ of degree $N\ge 2$ is called monogenic if $f(x)$ is irreducible over ${\mathbb Q}$ and $\{1,\theta,\theta^2,\ldots,\theta^{N-1}\}$ is a basis for the ring of integers of ${\mathbb Q}(\theta)$, where $f(\theta)=0$. In this article, we show that ${\mathcal F}_p(x):=x^{2p}+2x^{p}+2$ is monogenic if and only if $p$ is not a Wieferich prime.
Read the full abstract

Combinatorics

Almost Affine Invariance Over Prime Fields: Green Problem 90

Let $A\subset \mathbb{F}_p$ with density 1/2. We call a set $A$ almost affine invariant under an affine transformation $\phi(x)=ax+b$ if \[|A \triangle \phi(A)| =o(p).\] We determine that, the threshold value of $K$ such that $A$ is almost affine invariant simultaneously under all $\phi(x)$ with $|a|, |b|\le K$ and $a\neq 0$, is $K=o(\log p)$. This solves Ben Green's Open Problem 90.
Read the full abstract

Metric Geometry

Stability for barriers of n-dimensional convex bodies with surface area close to Jones' bound

Let $K$ be a convex body (a non-empty compact convex set) in $n$-dimensional Euclidean space. A set $B$ is called a barrier (or an `opaque set') for $K$ if every line that intersects $K$, also intersects $B$. Although this concept was introduced more than a century ago, the barrier with minimal surface area for a given set $K$ is still unknown, even in the two-dimensional case. A classical lower bound by Jones states that the surface area $S(B)$ of a sufficiently regular barrier $B$ is at least $S(\partial K)/2$, half the surface area of the boundary of $K$. We will extend a known stability version for $n=2$ to arbitrary dimensions: if $S(B)-S(\partial K)/2$ is small, then the orientation measure of $B$ is close to the surface area measure of a symmetrization of $K$. For instance, if $K$ is the unit cube in 3D, most of the points of a barrier with surface area close to $3$ must have almost axis parallel normals. One of the main contributions of the paper is the new concept of weak barriers, which only encodes orientation information of a barrier, disregarding the relative positions of its parts. We characterize weak barriers geometrically in terms of the convexification of $B$. Convex geometric tools then allow one to quantify the above mentioned stability for weak barriers in all dimensions.
Read the full abstract

Probability · Cross-listed from stat.ML

On the Limits of Latent Reuse in Diffusion Models

Diffusion models are often trained in low-dimensional latent spaces, which are then reused for related but shifted datasets. In this work, we study when such latent reuse remains reliable under distribution shift. We consider a source-target setting in which both datasets are approximately low-dimensional but may lie near different subspaces. We show that freezing and reusing a source latent space induces a target-domain score error governed by two quantities: the principal-angle misalignment between the source and target subspaces, and the target ambient noise amplified by the diffusion time scale. Motivated by these limits, we further study mixed source-target training and characterize how the required shared latent dimension depends on the relative geometry of the two distributions. Our results provide theoretical guidance on when latent reuse is reliable and when learning a shared representation may be necessary.
Read the full abstract

Analysis of PDEs

Classification of solutions to the singular Liouville's equation associated with the $N$ Finsler Laplacian

In this paper, we classify a class of singular Liouville's equation associated with the Finsler-$N$-Laplacian for any $\beta\in (0,N)$ \begin{align*} -\mathrm{div}\left(F^{N-1}(\nabla u)DF(\nabla u)\right)=\hat{F}^{o}(x)^{-\beta}e^u\ \ \text{in } \mathbb{R}^{N}\backslash \{0\}, \end{align*} under the finite mass condition $\int_{\mathbb{R}^{N}}\hat{F}^{o}(x)^{-\beta}e^u dx<+\infty$. Here $F$ is a convex function, which is positively homogeneous of degree 1, and its polar $F^{o}$ represents a Finsler metric on $\mathbb{R}^{N}$, $\hat{F}^{o}(x)=F^{o}(-x)$. Our result relaxes the mass condition required in the classification result in [39]
Read the full abstract

Numerical Analysis

Revisiting CUR Perturbation Analysis: A Local Tangent-Space Expansion

CUR decompositions approximate a matrix using selected columns, rows, and their intersection. Classical CUR theory provides exactness results for low-rank matrices and perturbation bounds controlled by the size of the noise. In this work we develop a local perturbation expansion for a fixed-index rank-truncated CUR map near an admissible rank-\(r\) matrix. We show that the Fréchet derivative of the rank-truncated CUR map is a sampling-induced oblique tangent-space projector determined by the selected rows and columns. Consequently, the local recovery error for an underlying low-rank matrix is governed not by the full perturbation norm alone, but by the image of the perturbation under this sampling-induced tangent projector. In particular, perturbations that are invisible to the selected rows and columns are removed to first order. We compare this behavior with the classical local expansion of the rank-\(r\) SVD truncation. SVD removes orthogonal-normal perturbations to first order, whereas rank-truncated CUR removes perturbations in the kernel of the sampling-induced oblique tangent projector. Numerical experiments illustrate these regimes and confirm the predicted first- and second-order local rates.
Read the full abstract

Optimization and Control · Cross-listed from cs.LG

Rescaled Asynchronous SGD: Optimal Distributed Optimization under Data and System Heterogeneity

Asynchronous stochastic gradient descent (ASGD) is a standard way to exploit heterogeneous compute resources in distributed learning: instead of forcing fast workers to wait for slow ones, the server updates the model whenever a gradient arrives. Vanilla ASGD applies each arriving gradient with the same weight. When local data distributions are heterogeneous, this becomes problematic: faster workers contribute more updates, and we show theoretically that the method is biased toward a frequency-weighted average of the local objectives rather than the desired global objective. Existing remedies typically move away from the simple ASGD template by introducing gathering phases, buffering, or extra memory. We show that this is unnecessary. Keeping the standard ASGD mechanism, we recover the correct objective by rescaling worker-specific stepsizes in proportion to their computation times, so that each worker contributes the same aggregate learning rate over a cycle. In the non-convex setting, under smoothness and bounded heterogeneity assumptions, we prove that the resulting method, Rescaled ASGD, converges to stationary points of the correct global objective in the fixed-computation model. Its time complexity matches the known lower bound in the leading term, while the effects of staleness and data heterogeneity appear only in lower-order terms. Experiments confirm that the method converges to the correct objective and is competitive with state-of-the-art baselines.
Read the full abstract

Combinatorics

Inhomogeneous $q$-Whittaker polynomials II: ring theorem and positive specializations

We study inhomogeneous $q$-Whittaker polynomials which extend both $q$-Whittaker and stable Grothendieck polynomials. We prove that inhomogeneous $q$-Whittaker polynomials (in countably many variables) form a basis of certain commutative ring extending the ring of symmetric functions to a subring of its completion. We then describe positive specializations of that ring and relate them with a subset of Macdonald-positive specializations of the ring of symmetric functions. We also show some related probability distributions obtained from positive specializations of inhomogeneous $q$-Whittaker polynomials.
Read the full abstract

Algebraic Geometry · Cross-listed from cs.LG

Strategic PAC Learnability via Geometric Definability

Strategic classification studies learning settings in which individuals can modify their features, at a cost, in order to influence the classifier's decision. A central question is how the sample complexity of the induced (strategic) hypothesis class depends on the complexities of the underlying hypothesis class and the cost structure governing feasible manipulations. Prior work has shown that in several natural settings, such as linear classifiers with norm costs, the induced complexity can be controlled. We begin by showing that such guarantees fail in general - even in simple cases: there exist hypothesis classes of VC dimension $1$ on the real line such that, even under the simplest interval neighborhoods, the induced class has infinite VC dimension. Thus, strategic behavior can turn an easy learning problem into a non-learnable one. To overcome this, we introduce structure via a geometric definability assumption: both the hypothesis class and the cost-induced neighborhood relation can be defined by first-order formulas over $\mathbb{R}_{\mathtt{exp}}$. Intuitively, this means that hypotheses and costs can be described using arithmetic operations, exponentiation, logarithms, and comparisons. This captures a broad range of natural classes and cost functions, including $\ell_p$ distances, Wasserstein distance, and information-theoretic divergences. Under this assumption, we prove that learnability is preserved, with sample complexity controlled by the complexity of the defining formulas.
Read the full abstract

All authors Yuval Filmus, Shay Moran, Elizaveta Nesterova, Nir Rosenfeld, Alexander Shlimovich

Algebraic Geometry

Quadratic Euler Characteristic of Geometrically Cyclic Branched Coverings

For an $n$-fold geometrically cyclic branched covering $Y$ of a smooth, projective scheme $X$ branched at a smooth closed subscheme $Z\subset X$ with $n \in k^\times$, we compute the quadratic Euler characteristic of $Y$ in terms of certain Euler classes on $X$ and $Z$ using the quadratic Riemann-Hurwitz formula of Levine. When $n$ is odd, we relate the quadratic Euler characteristic of $Y$ to the quadratic Euler characteristics of $X$ and $Z$, obtaining similar formulae to the situation in topology. As an application, we compute the quadratic Euler characteristic of geometrically cyclic branched double coverings of $\mathbb{P}^2$.
Read the full abstract

Spectral Theory

Ultrametric Graphons and Hierarchical Community Networks: Spectral Theory and Applications

We develop a theory of ultrametric graphons as limiting objects for random networks with nested hierarchical community structure. A graphon $W:[0,1]^2\to[0,1]$ is called ultrametric if $W(x,y)=w(d(x,y))$, where $d$ is an ultrametric on $[0,1]$ induced by a family of nested partitions and $w$ is a positive kernel. The resulting random graphs exhibit a nested hierarchical community structure in which the density of connections is governed by the ultrametric distance between vertices. The Laplacian $L_d^k$ of the deterministic graph sampled from an ultrametric graphon is itself an ultrametric Laplacian, whose eigenvalues and spectral projectors admit completely explicit closed-form expressions in terms of the community sizes and inter-community connection densities. We show that the normalized eigenvalues and spectral projectors of the random Laplacian $L_r^k$ are arbitrarily close to those of $L_d^k$ with high probability as $k\to\infty$, so that the explicit formulas for $L_d^k$ provide closed-form approximations for the spectrum and spectral projectors of $L_r^k$. As applications: a sign structure theorem generalizes the Fiedler vector criterion to hierarchical networks with arbitrarily many communities; a detectability threshold $p^*=\min_i\rho_i$ governs spectral community detection for one-level hierarchical graphons; the pseudo-inverse Laplacian $L_W^+$ is constructed and shown to be the almost sure limit of the pseudo-inverse of $L_r^k$, implying that hitting and commute times collapse to quantities depending only on the expected degrees of the endpoints; and explicit closed-form stability conditions for the SIS disease-free equilibrium reveal a fundamental tension between homogeneous and heterogeneous community structures, confirmed by numerical experiments.
Read the full abstract

Analysis of PDEs

The evolution variational inequality for weighted Wasserstein metrics in non-convex bounded domains

In this paper, we establish the evolution variational inequality for the weighted Wasserstein distance, without assuming convexity of domains. Thanks to this evolution variational inequality, we can carry out some arguments with weighted Wasserstein metrics in not only convex but also non-convex domains. Therefore finally, we apply the evolution variational inequality to the minimizing movement in weighted Wasserstein metrics to obtain weak solutions of Keller–Segel systems and Cahn–Hilliard type equations in non-convex domains. The key point to remove the convexity assumption is a control of the boundary integral. To deal with the boundary integral, we use estimates for functions on the boundary, the Sobolev trace embedding and the variant of Kato's inequality. Then, the boundary integral can be absorbed by good known terms.
Read the full abstract

Functional Analysis

Solving the Sylvester equation in Banach modules

For given unital complex Banach algebras $\mathcal{A}_1$ and $\mathcal{A}_2$, let $\mathfrak{M}$ be a Banach module acting between them. Let $a\in \mathcal{A}_1$, $b\in\mathcal{A}_2$, and $c\in\mathfrak{M}$ be provided such that $\sigma_{\mathcal{A}_1}(a)\cap\sigma_{\mathcal{A}_2}(b) \neq\emptyset$. In this paper we completely characterize the consistency of the Sylvester equation $$ax-xb=c.$$ Precisely, we establish verifiable sufficient and necessary solvability conditions, and we provide some formulas for particular solutions $x\in\mathfrak{M}$ when the equation is solvable. Moreover, we characterize the uniqueness of the solutions.
Read the full abstract

Algebraic Geometry

Remarks on diagonal dimension for algebraic stacks

This note is concerned with the Rouquier dimension of the bounded derived category of coherent complexes on a Noetherian algebraic stack. Specifically, we study the diagonal dimension of a morphism, which can be used to produce upper bounds on Rouquier dimension. First, we obtain an explicit upper bound for smooth morphisms with a regular target. Second, we identify classical generators of a fibre product, recovering a result of Elagin–Lunts–Schnürer. Finally, we show that the diagonal dimension of a variety in arbitrary characteristic with mild singularities is at most twice its Krull dimension.
Read the full abstract

Analysis of PDEs

Ultracontractivity of Heat semigroups in $\mathrm{L}^{2}\left( \Omega \right)$ with non-local Robin boundary conditions using Nash's inequality

We study heat equations $\frac{\partial u}{\partial t} - \operatorname{div} \left( A \nabla u \right) = 0$ on bounded Lipschitz domains $\Omega$ in $\mathbb{R}^{d}$ for $d \in \mathbb{N}$, where $-\operatorname{div} \left( A \nabla \cdot \right)$ is a second-order uniformly elliptic operator with generalised Robin boundary conditions. These boundary conditions are formally given by $\nu \cdot A \nabla u + Bu = 0$ where $\nu$ is the outer unit normal on $\partial\Omega$ and $B \in \mathcal{L} \left( \mathrm{L}^{2}\left( \partial \Omega \right) \right)$ is a general operator which is allowed to destroy the positivity preserving property of the solution semigroup. Ultracontractivity of the solution semigroup is shown by using Nash's inequality on the Sobolev space $H^{1}( \Omega )$.
Read the full abstract

Combinatorics

Semi-interlaced polytopes

The Minkowski mixed volume of $n$ subpolytopes $D_1, \dots, D_n$ of a polytope $P \subset {\mathbb R}^n$ clearly does not exceed the normalized volume $n! \text{Vol}(P)$. Equality holds if and only if the subpolytopes are interlaced, i.e., each proper face $F \subsetneq P$ intersects at least $\dim(F) + 1$ of the polytopes $D_i$. Efficiently computing mixed volumes for more general collections of subpolytopes is crucial for estimating the complexity of numerically solving polynomial systems. Motivated by relaxing the bound $\dim(F) + 1$ to $\dim(F)$, we prove a combinatorial formula for the mixed volume of a broad class of semi-interlaced polytopes. This class includes, in particular, the off-coordinate polytopes used in computing algebraic degrees – such as Maximum Likelihood, Euclidean Distance, and Polar degrees – via the Kouchnirenko–Bernshtein theory. We also present applications of our results to the Arnold monotonicity problem (1982-16), which concerns the dependence of Milnor numbers on the Newton polyhedra.
Read the full abstract

Group Theory

Groups with classifiable actions on the line

We motivate and study the class $\mathcal{C}$ of countable groups $G$ such that the conjugacy relation between minimal actions of $G$ on $\mathbb{R}$ by orientation-preserving homeomorphisms is smooth – that is, admits a Borel transversal. No example of amenable group outside of $\mathcal{C}$ is known. We show a number of stability properties of $\mathcal{C}$ under group-theoretic operations and that $\mathcal{C}$ contains all finitely generated groups of piecewise affine homeomorphisms of the interval. We exhibit a finitely generated group $G$ that is not in $\mathcal{C}$, such that $G$ is amenable if and only if Thompson's group $F$ is amenable. We also prove that the semiconjugacy relation among cocompact actions of a countable group $G$ is smooth if and only if $G \in \mathcal{C}$, and that it is essentially countable even when $G$ is not finitely generated. In the Appendix, we show that there is no good analogue of the space of harmonic actions for a countable non-finitely generated group.
Read the full abstract

Information Theory · Cross-listed from cs.LG

The Diffusion Encoder

We construct a new kind of encoder, leveraging the expressive power of diffusion models. In a traditional variational autoencoder, the encoder and decoder jointly negotiate a latent representation of the input. This is made possible by the reparameterization trick, which simplifies training at the cost of restricting the encoder to a simple family of distributions. Replacing this encoder with a diffusion model requires rethinking how the decoder pressure can be transmitted back to the encoder, given that they tend to update their internal estimates of the latent in opposing directions. We solve this problem with an alternating training scheme, inspired by the expectation-maximization algorithm. Our method enables more reliable synchronization between encoder and decoder, while preserving the simple and efficient training objective of standard diffusion models.
Read the full abstract

Combinatorics

Note on a magic rectangle set on dihedral group

Let $\Gamma$ be a group of order $mnk$ and $MRS_{\Gamma}(m,n;k)=(a_{i,j}^s)_{m\times n}$ be a collection of $k$ arrays $m\times n$ whose entries are all distinct elements of $\Gamma$. If there exist elements $\rho,\sigma\in\Gamma$ such that for every row $i$, there exists an ordering of elements such that $$ a_{i,j_1}^s a_{i,j_2}^s \dots a_{i,j_{n-1}}^s a_{i,j_n}^s= \rho $$ and for every column $j$ there exists an ordering of elements such that $$ a_{i_1,j}^s a_{i_2,j}^s \dots a_{i_{m-1},j}^s a_{i_m,j}^s = \sigma, $$ then $MRS_{\Gamma}(m,n;k)$ is called a \emph{$\Gamma$-magic rectangle set}. We investigate magic rectangle sets over dihedral groups and prove that $\mathrm{MRS}_{\Gamma}(m,n;k)$ exists for every dihedral group $\Gamma$ of order $mnk$, provided that $m$ and $n$ are even. As a consequence, we obtain broad existence results for magic rectangles and magic squares over dihedral groups.
Read the full abstract

Analysis of PDEs

Optimal stability of complement value problems for p-Lévy operators

We establish the optimal convergence of solutions to integro-differential equations (IDEs) governed by symmetric integrodifferential $p$-Lévy operators, $1 < p < \infty$, in the presence of nonlocal Dirichlet or Neumann boundary conditions. For illustrative purposes, consider the particular case of the (fractional) $p$-Laplacian $(-\Delta)^s_p$ with $0 < s \le 1$. If $(-\Delta)^s_p u_s = f_s $ in $\Omega \subset \mathbb{R}^d,$ augmented with a Dirichlet or Neumann data $g_s$ then under suitable assumptions on $\Omega$, $f_s$ and $g_s$, we show that $(u_s)_s$ strongly converges as $s \to 1^-$ in the the optimal, that is, $\|u_s - u_1\|_{W^{s,p}(\Omega)} \to 0$. \smallskip Another subsequent goal underpinning our approach is the robustness of the nonlocal trace spaces; specifically, we also show that the nonlocal trace spaces converge, in an appropriate sense, to the local trace space.
Read the full abstract

Geometric Topology

Generating the mapping class group of a nonorientable surface of genus $g \geq 13$ by two elements

Let $N_g$ be a closed, connected, nonorientable surface of genus $g$. We prove that for $g \ge 13$, the mapping class group $\text{Mod}(N_g)$ can be generated by exactly two elements. This improves the previously known bound of $g \ge 19$.

Probability

Percolation representations of additive particle systems

It is well-known that additive interacting particle systems with a local state space of cardinality two have a percolation representation in terms of open paths in a graphical representation. In this paper, it is shown how such a percolation representation can be constructed more generally when the local state space is a finite distributive lattice. The theory is demonstrated on Krone's two-stage contact process.
Read the full abstract

Analysis of PDEs

Refined estimates of the propagation speed in porous medium equation of combustion type

We are concerned with the Cauchy problem $u_{t}=(u^{m})_{xx}+f(u)$, where the nonliearity $f(u)$ is of combustion type and the initial data is compactly supported. In \cite{lou2024convergence}, among other things, the authors prove that by considering a multiple of a given initial data, there is a critical value such that the corresponding transition solution spreads at the asymptotic speed $2y_{0}\sqrt{t}[1+o(1)]\ \text{as} \ t\rightarrow\infty$, while the lower order term $o(1)$ remains unknown. In this paper, for a family of functions of combustion type, we refine the estimates of the asymptotic speed of the transition solution and provide a precise characterization of the lower order term $o(1)$. Our result also reveals that there is no unified characterization of the lower order term for general combustion type functions $f$.
Read the full abstract

Functional Analysis

Petrov type extension for multivalued contraction mappings

In this paper, we introduce the concept of multivalued $\lambda $% -contracting perimeters of triangles. This concept generalizes the Nadler's contraction by considering triplets of points instead of pairs. Fundamental properties of such mappings are analyzed, including their continuity and their relationship to classical multivalued contractions. By means of a counterexample, we show that a mapping which satisfies the condition of multivalued $\lambda $-contracting perimeters of triangles is not necessarily a multivalued $\lambda $-contraction. We also introduce the notion of property of forming a triangle. Then, we investigate the relation between this property and the fact that there is no periodic point of prime period $2$ for any multivalued mapping. Furthermore, using the new concept and property mentioned above, we present some fixed point results for multivalued mappings. Finally, we provide an illustrative and comparative example.
Read the full abstract

Mathematical Physics · Cross-listed from quant-ph

Intraparticle entanglement-based Random Access Code protocols: Contextuality-enabled quantum advantage and implications

We provide the first explicit identification and quantitative characterization of the physical origin of the quantum advantage in the Random Access Code (RAC) protocol. This is achieved by formulating the protocol in terms of intraparticle entanglement between co-measurable degrees of freedom of a single particle and establishing a fundamental correspondence between the protocol's success probability and the underlying resource powering it. For this purpose, we use a relevant Bell-type inequality derived from the assumption of noncontextuality of measurement outcomes. The formulated analysis reveals that the magnitude of quantum-mechanical violation of this inequality, signifying a form of quantum contextuality, is quantitatively commensurate with the “quantum enhancement" of success probability in any intraparticle entanglement-assisted $n$-bit RAC protocol. In particular, the maximal success probability achievable in a quantum $n \mapsto 1$ RAC protocol corresponds to the maximal quantum violation of the relevant Bell-type inequality. Our framework not only demonstrates how quantum contextuality entailed by intraparticle entanglement serves as an effective resource for enhancing RAC performance, but also offers a significant operational advantage: the proposed scheme is readily implementable in a single-particle interferometric setup requiring coherence preservation only for a single particle, rather than between spatially separated entangled systems.
Read the full abstract

Logic · Cross-listed from cs.LO

Adequate Losses via Quantitative Linear Logic

As neural components are increasingly embedded in existing symbolic software – including safety-critical systems – the question arises of how to specify and enforce the safety of the newly introduced neural parts. Unlike traditional logical specifications, these must be amenable not only to the standard Boolean interpretation, but also to training and optimisation. The latter calls for a quantitative interpretation of the logical syntax, subject to further requirements such as smoothness and differentiability. Moreover, the qualitative and quantitative sides of the logic must share a unifying proof-theoretic and categorical semantics. Finally, the new logic should link cleanly to the substructural and program logics that underpin the verification of existing symbolic programs. In this paper, we present a logic that ticks all of these boxes. We introduce a family of calculi, pQLL, indexed by a hardness degree $p$, prove a cut-elimination theorem for them, and establish completeness with respect to enriched residuated `soft' lattices. At $p = \infty$, \pQLL reduces to multiplicative additive linear logic (MALL), and provability in pQLL converges to provability in MALL as $p \to \infty$. We express optimisation objectives in the syntax of this logic and prove the quantitative adequacy of neuro-symbolic loss functions – a result that has eluded the neuro-symbolic machine learning community for nearly a decade.
Read the full abstract

All authors Matteo Capucci, Robert Atkey, Charles Grellois, Ekaterina Komendantskaya, Matthew Daggitt