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)

Thursday 30 April

Information Theory · Cross-listed from cs.LG

MIFair: A Mutual-Information Framework for Intersectionality and Multiclass Fairness

Fairness in machine learning remains challenging due to its ethical complexity, the absence of a universal definition, and the need for context-specific bias metrics. Existing methods still struggle with intersectionality, multiclass settings, and limited flexibility and generality. To address these gaps, we introduce MIFair, a unified framework for bias assessment and mitigation based on mutual information. MIFair provides a flexible metric template and an in-processing mitigation method inspired by the Prejudice Remover, defining group fairness as statistical independence between prediction-derived variables and sensitive attributes. We further strengthen its information-theoretic foundation by establishing equivalences with widely used fairness notions such as independence and separation. MIFair naturally supports intersectionality, complex subgroup structures, and multiclass classification and employs regularization-based training to reduce bias according to the selected metric. Its key advantage is its versatility: it consolidates diverse fairness requirements into a single coherent framework, enabling consistent benchmarking and simplifying practical use. Experiments on real-world tabular and image datasets show that MIFair effectively reduces bias, including previously unaddressed multi-attribute scenarios, while maintaining strong predictive performance across the evaluated settings.
Read the full abstract

All authors Jeanne Monnier, Thomas George, Frédéric Guyard, Christèle Tarnec, Marios Kountouris

Analysis of PDEs

Gauge symmetry and uniqueness in inverse problems for the JMGT equation

In this paper, we study an inverse boundary value problem for the Jordan–Moore–Gibson–Thompson equation on a simple Riemannian manifold. We consider an all boundary measurement map that maps Dirichlet boundary data and initial data to the corresponding Neumann-type boundary data and final-time data. Our main result shows that the nonlinear acoustic coefficient $\beta$ is uniquely determined by this measurement map, and the linear damping coefficients $\alpha$ and $q$, along with the internal source term $F$, can be recovered up to a gauge symmetry. As a corollary, we also establish a specific case in which all coefficients are uniquely recovered. The proof relies on the method of first-order and second-order linearization and on the construction of geometric optics solutions. In the intermediate step, we establish the unique recovery of the lower-order coefficients in the linearized MGT equation.
Read the full abstract

All authors Dong Qiu, Xiang Xu, Yeqiong Ye, Ting Zhou

Number Theory

Frobenius Traces for Rank-2 Drinfeld Modules, Higher-Dimensional Galois Representations, and a Strong Multiplicity One Theorem in Positive Characteristic

In this paper, we prove that if the Frobenius traces agree at all but finitely many places, then two $l$-adic Galois representations, associated to rank-$2$ non-CM Drinfeld modules of generic characteristic, are isomorphic. As a generalization, we show that the "Frobenius trace equality at all but finitely many places forces isomorphism" between two Galois representations over a local field of positive characteristic holds under an absolute irreducibility assumption. Moreover, we formulate and prove a function field analogue of strong multiplicity one property for semisimple Galois representations over a local field of positive characteristic.
Read the full abstract

Optimization and Control

Frank-Wolfe Beyond 1/t Convergence

We consider smooth convex minimization over compact convex sets, i.e., $\min_{x \in C} f(x)$ with the (vanilla) Frank-Wolfe algorithm. Well-known lower bounds establish a worst-case $\Omega(1/t)$ primal-gap barrier in the general smooth convex case, and faster convergence usually requires favorable function properties such as Hölder error bounds or strong convexity. We present a new Local Dual Sharpness (LDS) condition, essentially a property of the feasible region and its LMO, under which the Frank-Wolfe algorithm converges in $o(1/t)$ for any smooth convex function, ruling out an $\Omega(1/t)$ lower bound under LDS. The condition is a generalization (and localization) of uniform convexity of sets and it is satisfied by any uniformly convex set. To our knowledge, this is the first unconditional $o(1/t)$ convergence result for uniformly convex sets. Combining LDS with stronger function properties, e.g., a local variant of Hölder error bounds, allows us to quantify the actual rates.
Read the full abstract

Metric Geometry

Minimal Parametric Networks in Hyperspaces and their Properties

This work investigates minimal parametric networks in hyperspaces of closed subsets of metric spaces endowed with the Hausdorff distance. It is shown that the problems of finding such networks are nontrivial only within finiteness classes, where all Hausdorff distances between elements are finite. It is demonstrated that when studying the properties of minimal parametric networks, it is convenient to view their interior vertices as solutions of the Fermat–Steiner problem on the adjacent vertices. In this connection, already within the framework of the Fermat–Steiner problem, the structure of solution classes in hyperspaces of closed subsets of metric spaces is described. Results on the existence of $d$-far points in the case of convex boundary sets are also generalized. Namely, conditions are shown under which realizing one-sided Hausdorff distances holds.
Read the full abstract

Numerical Analysis

Noise-induced enhancement of regime lifetimes – A data-driven approach using deterministic trajectories

We investigate the lifetime of dynamical regimes under the impact of noise motivated by low-dimensional models of the atmosphere. One may expect that the inclusion of noise tends to make the system leave prescribed regions of the state space faster. However, for relevant systems with complexities ranging from phenomenological toy models to reduced models of atmospheric dynamics, this intuition has proven misleading. As long as the noise is sufficiently small, the noisy system stays in regimes of interest on average longer than its deterministic counterpart, an effect we call “stochastic inertia”. This phenomenon has been observed through extensive numerical simulations for different noise levels. We propose a numerical technique for testing the occurrence of stochastic inertia, constructing, for any fixed noise level, a Markov chain on the set of points given by a sufficiently long trajectory of the system without noise. The method is shown to correctly predict the presence of stochastic inertia in simple systems, and its utility is demonstrated on a paradigm model of atmospheric dynamics.
Read the full abstract

All authors Henry Schoeller, Robin Chemnitz, Péter Koltai, Maximilian Engel, Stephan Pfahl

Differential Geometry

Can You Hear the Shape of a Hyperbolic Surface? Now for Real

We associate a musical instrument, a "hyperbolic marimba", to every pair $(X,\Gamma)$ where $X$ is a hyperbolic surface and $\Gamma\subset X$ a simple multicurve labeled with musical keys. It works as follows: take a geodesic and every time it hits $\Gamma$, play the corresponding note. In this paper we investigate to which extent the so-produced melodies characterize $(X,\Gamma)$ up to isometry. In the accompanying website "HyperMarimba" (available at https://ludox73.github.io/HyperMarimba/story.html ), the reader can actually listen to the produced melodies. They can also visualize some of the phenomena we investigate.
Read the full abstract

Combinatorics

Cliques in minimally globally rigid graphs

We show that every minimally generically globally rigid graph in $\mathbb R^d$ which contains a subgraph isomorphic to $K_{d+2}$ is itself isomorphic to $K_{d+2}$, confirming a conjecture by Garamvölgyi, Jackson, and Jordán. The proof is entirely generated by ChatGPT 5.5.

Algebraic Topology

The transverse singular complex

Let $M$ be a smooth manifold without boundary and let $\mathcal{T}$ be a countable collection of manifolds with corners, each equipped with a smooth map to $M$. We show that the singular simplicial set $\mathrm{Sing}(M)$ of $M$ deformation retracts onto the simplicial subset $\mathrm{Sing}^{\mathcal{T}}\!(M)$ of smooth singular simplices that are transverse to every element of $\mathcal{T}$.
Read the full abstract

Analysis of PDEs

On three-dimensional flows of thermo-viscoelastic fluids of Giesekus type

Viscoelastic rate-type fluid models constitute a fundamental framework for the mathematical description of complex materials exhibiting coupled elastic and viscous effects, with a wide range of applications in engineering, biomaterials, and medicine. In realistic regimes, thermal effects are essential and lead to strongly coupled systems in which heat conduction and temperature-dependent constitutive laws play a decisive role. In this paper, we develop a thermodynamically consistent model for heat-conducting viscoelastic rate-type fluids. We establish the existence of a global weak solution in the full three-dimensional setting. In contrast to the existing literature, no smallness, regularity, or structural restrictions on the initial data are imposed beyond natural energy and entropy bounds, and no additional regularising mechanisms such as artificial stress diffusion are required. The analysis is based on a weak-strong framework combining energy and entropy balances with compactness tools, allowing us to treat the full nonlinear coupling between the fluid velocity, the temperature, and the elastic stress.
Read the full abstract

Mathematical Physics · Cross-listed from gr-qc

Near–extremal gravitational collapse in 4+1 dimensions: Schwarzschild–de–Sitter space

We numerically study a formation of near extremal horizons from a gravitational collapse of radially symmetric gravitational waves in $4+1$ dimensions within the framework of pure Einstein gravity with positive cosmological constant. Evolution of a regular initial data with cosmological horizon leads to a formation of a black hole with mass exceeding $99\%$ of the extremal value corresponding to the black hole and cosmological horizons coinciding. We demonstrate how our results fit within the framework of characteristic gluing, and present some evidence that the third law of black hole thermodynamics may not hold in the cosmological context, where the extremality corresponds to the maximal mass of the Schwarzschild black hole in de–Sitter space.
Read the full abstract

Analysis of PDEs

Classification results of Liouville equations and rigidity of Riemannian surfaces

We study the Liouville equation $\triangle u+e^{2u} =0$ in a Riemannian surface $(M, g)$ with nonnegative $Ricci$ curvature. Under some asymptotic lower bound assumptions, we classify all the solutions to this equation, meanwhile we obtain the rigidity results for the ambient manifold. Note that our assumptions are optimal in some sense and differ from the classical assumption of finite total curvature.
Read the full abstract

Numerical Analysis

Flexible GMRES converges in two phases

We derive a sharp upper bound on the residuals produced by the flexible GMRES (FGMRES) method. The bound shows that FGMRES exhibits two phases of convergence depending on the residual tolerance of the inner preconditioner. For small tolerances, the convergence of FGMRES is practically geometric with a constant rate throughout, while for looser tolerances the two-phase behavior becomes more pronounced. We also show that the derived bound cannot be improved and construct an example for which it becomes an equality.
Read the full abstract

Dynamical Systems · Cross-listed from physics.soc-ph

Clustering in co-evolving opinion dynamics: reduced SPDE models

Clustering is a fundamental collective phenomenon in agent-based models (ABMs) of opinion dynamics. To study clustering in systems with co-evolving social and opinion variables, we derive stochastic partial differential equation (SPDE) models that describe the evolution of clusters. Specifically, these SPDE models are reduced in the sense that their domain accounts only for social variables, while opinion variables are instead incorporated in a multiplicative (Eulerian velocity-type) fashion. The model reduction is primarily guided by computational efficiency, as well as model interpretability. We consider two settings: one in which opinions do not affect social interactions, and another one in which a feedback mechanism couples the two. Our approach extends reduced PDE modelling to a stochastic framework, which is essential for capturing long-term cluster behaviour. Numerical experiments indeed demonstrate that the proposed reduced SPDEs substantially decrease computational cost compared to full-state SPDE models, such as the Dean–Kawasaki equation, while still accurately reproducing the clustering behaviour of the underlying ABM. As a result, these reduced models provide an efficient tool for studying systems with large populations, including those arising in the analysis of real-world data: in particular, we provide an application related to the large-scale General Social Survey (GSS), which comprises opinion and social data of the US population since 1972.
Read the full abstract

All authors Sebastian Zimper, Nataša Djurdjevac Conrad, Federico Cornalba, Ana Djurdjevac

Category Theory

Colored Markov polycategories and diagrammatic differentiation

Many stochastic systems are built by wiring typed components together, but the wiring is often neither purely sequential nor type-homogeneous. This paper develops categorical semantics for such systems using ordered polycategories whose morphisms are Markov kernels. The basic operation is kernel slotwise composition, which connects one output slot of a many-output kernel to one input slot of another and marginalizes the internal wire. We prove its structural laws by assigning trace semantics to finite acyclic diagrams. We then introduce colored Markov polycategories, where objects and kernels carry colors and typed connections are realized by interface kernels satisfying identity and composition laws. This gives a colored kernel slotwise composition and trace semantics for typed stochastic diagrams. To describe systems whose structure changes, we co-index colored Markov polycategories and parameter spaces over an indexing category. Finally, for finite acyclic parameterized diagrams, we prove a diagrammatic differentiation result. The derivative of an expected scalar objective is obtained from local reverse-mode contributions at the parameterized vertices, with stochastic and deterministic kernels handled through local gradient representing functions. The construction gives a typed, compositional language for finite acyclic stochastic systems and their parameter sensitivities.
Read the full abstract

Information Theory · Cross-listed from eess.IV

Diffusion-OAMP for Joint Image Compression and Wireless Transmission

Joint image compression and wireless transmission remain relatively underexplored compared to generic image restoration, despite its importance in practical communication systems. We formulate this problem under an equivalent linear model, and propose Diffusion-OAMP, a training-free reconstruction framework that embeds a pre-trained diffusion model into the OAMP algorithm. In Diffusion-OAMP, the OAMP linear estimator produces pseudo-AWGN observations, while the diffusion model serves as a nonlinear estimator under an SNR-matching rule. This framework offers a way to incorporate multiple generative priors into OAMP. Experiments with varying compression ratios and noise levels show that Diffusion-OAMP performs favorably against classic methods in the evaluated settings.
Read the full abstract

All authors Wentao Hou, Yimin Bai, Zelei Luo, Jiadong Hong, Lei Liu

Probability

Stationary Distribution of Brownian Motion in the Half-Plane with Two-sided Reflections

We investigate the unique stationary measure of a positive recurrent reflecting Brownian motion in the upper half-plane, where the direction of reflection is constant on each half-axis. The Laplace transform of the stationary distribution is characterized by a functional equation, whose resolution is reduced to solving a discontinuous Riemann boundary value problem. By applying the Sokhotski-Plemelj formulas, we derive an explicit expression for the Laplace transform. Finally, we establish the local behavior of the stationary density at the origin and its asymptotics along the boundary axes using Tauberian theorems and asymptotic analysis.
Read the full abstract

Differential Geometry

On Killing tensors on Riemannian symmetric spaces

A Killing tensor field on a Riemannian space corresponds to an integral of the geodesic flow polynomial in momenta. A Killing tensor field is called decomposable if it is a polynomial in Killing vector fields. In this paper, we first prove that the study of Killing tensor fields on symmetric spaces can be reduced to the case of compact irreducible ones. Then we introduce the class of top slot Killing tensor fields. We obtain an explicit and elegant description of such tensor fields and prove that the quadratic Killing tensor fields are spanned by the top-slot ones. We also show that quadratic Killing tensor fields on the quaternionic projective space and on the Cayley projective space are spanned by the indecomposable ones constructed in our earlier paper and the decomposable ones. This completes the classification of quadratic Killing tensor fields on Riemannian symmetric spaces of rank one.
Read the full abstract

Algebraic Topology

Rational characteristic classes of bundles with fibre a product of spheres

We prove the existence of many non-trivial characteristic classes of smooth oriented bundles with fibre a product $ S^{n}\times S^{n} $ of odd-dimensional spheres. We do so by proving injectivity of the map from the ring of rational characteristic classes of oriented fibrations with fibre $ S^{n}\times S^{n} $; the latter is proven by Berglund–Zeman to be isomorphic to the group cohomology of the symmetric powers of the standard representation of a certain finite-index subgroup $ \Gamma $ of $ \mathrm{SL}_{2}(\mathbb{Z}) $. These characteristic classes of smooth bundles are not generalised Miller–Morita–Mumford classes, and they exist in arbitrarily large cohomological degrees. Inspired by an example given by Morita, we provide a collection of smooth oriented $ S^{n}\times S^{n} $-bundles, indexed by cyclic subgroups of $ \Gamma $, which detect any given non-zero characteristic class of such fibrations.
Read the full abstract

Mathematical Physics

Constrained Symplectic and Contact Hamiltonian Systems: A Review

Singular theories, characterised by the presence of degeneracies in their Lagrangian or Hamiltonian descriptions, require the systematic implementation of constraints in order to obtain well-defined dynamics. While the symplectic framework provides the standard geometrical setting for conservative mechanical systems, those theories which exhibit dissipative effects are most appropriately discussed within the context of contact geometry. In this review, we present the geometrical structure underlying pre-symplectic and pre-contact manifolds, and develop the corresponding constraint algorithms that determine the admissible subset of phase space upon which consistent Hamiltonian evolution exists. We then close the discussion of each of the constraint algorithms with an example.
Read the full abstract

Analysis of PDEs

Stein's square function associated with the Bochner-Riesz means on Métivier groups and its applications

In this paper, we study the $L^p$-boundedness of Stein's square function $\mathfrak{S}^{\alpha}(\mathcal{L})$ associated with the sub-Laplacian $\mathcal{L}$ on Métivier group $G$. A key aspect of our result is that the smoothness condition is expressed in terms of the topological dimension $d$ of the underlying Métivier group $G$. Consequently, we also present several applications of the $L^p$-boundedness of $\mathfrak{S}^{\alpha}(\mathcal{L})$. First, we provide an alternate proof of the sharp $L^p$-boundedness result for spectral multipliers on Métivier groups, recently obtained by Niedorf [Niedorf, Studia Math., 2025]. Next we prove $L^p$-boundedness of maximal spectral multipliers and consequently establish sharp $L^p$-boundedness result for the maximal Bochner-Riesz operator on Métivier groups, which also yields pointwise almost everywhere convergence of Bochner-Riesz means with smoothness parameter given in terms of the topological dimension of $G$. In case of Métivier groups our result improves upon the existing works of Mauceri-Meda [Mauceri, Meda, Rev. Mat. Iberoam., 1990] and Horwich-Martini [Horwich, Martini, J. Lond. Math. Soc., 2021]. Our result further imply the mixed norm regularity estimates for the solution of fractional Schrödinger equation on Métivier groups, where the regularity index is again expressed in terms of the topological dimension of $G$. Finally, we study the $L^{p_1}(G) \times L^{p_2}(G)$ to $L^p(G)$ boundedness of the bilinear Bochner-Riesz means and its maximal version, associated with the sub-Laplacian on Métivier group $G$. Our result improves upon the recent work of the author with Bagchi and Molla [Bagchi, Molla, Singh, J. Funct. Anal., 2026] in the range $2\leq p_1, p_2 <\infty$. In the same range, ......
Read the full abstract

Analysis of PDEs

Frame-indifferent discretization in nonlinear thermoviscoelasticity: Analysis and numerical simulations

We consider a quasi-static nonlinear model in thermoviscoelasticity at a finite-strain setting in the Kelvin-Voigt rheology where both the elastic and viscous stress tensors comply with the principle of frame indifference under rotations. We refine the discretization schemes in [Badal-Friedrich-Kružík '23, Mielke-Roubíček '20] by imposing frame indifference already at a time-discrete level. This is justified both analytically and numerically.
Read the full abstract

All authors Rufat Badal, Manuel Friedrich, Martin Horák, Martin Kružík, Lennart Machill

Optimization and Control

Data-Driven Continuous-Time LQR: Linking Reinforcement Learning and Behavioral System Theory

Behavioral system theory and reinforcement learning (RL) have independently developed data-driven approaches to the continuous-time LQR problem, yet their respective methods have largely evolved in separation. We connect these two adjacent lines of work by studying their data-driven parameterizations, namely a closed-loop (CL) parameterization from behavioral system theory and an integral RL (IRL) parameterization. The CL parameterization characterizes the closed-loop system via a matrix that satisfies equality constraints. While this parameterization has been extensively studied for discrete-time systems, we adapt key results to the continuous-time setting and develop a policy iteration (PI) scheme, derive an algebraic Riccati equation, and introduce an alternative convex program. The IRL parameterization utilizes off-policy data to perform policy evaluation, which is used for PI or value iteration. Within the IRL framework, we derive a policy gradient flow and propose convex programs for the LQR problem. Finally, we provide a unified treatment of these parameterizations that enables a systematic understanding of existing approaches, and clarifies their structural relationships.
Read the full abstract

Geometric Topology

Circle Pattern Theorem for Quasi-simplicial Triangulated Surfaces

The Circle Pattern Theorem characterizes the existence and rigidity of circle patterns with prescribed intersection angles on simplicial triangulations of closed surfaces. In this paper we extend the theorem to quasi-simplicial triangulations – triangulations that may contain loops and multiple edges, but whose lifts to the universal cover are simplicial. Chow and Luo first considered such triangulations – under the name generalized triangulations (J.~Differential Geom.~63(1):97–129, 2003) – but with the strong restriction that any three vertices determine at most one triangle; this condition keeps the combinatorics within the simplicial complex framework and consequently excludes most quasi-simplicial triangulations. We remove this restriction, work instead with the more flexible framework of Delta complexes, and use a finite covering technique to reduce the problem to the simplicial case. We prove that the curvature image is completely characterized by KAT inequalities imposed on all subsets of the lifted vertex set.
Read the full abstract

Logic · Cross-listed from cs.LO

A Logic of Inability

Coalition Logic is primarily concerned with what coalitions can achieve, whereas what coalitions cannot achieve – their inability – has received comparatively little explicit attention. This asymmetry matters in artificial intelligence and safety-critical multi-agent systems, where one often needs to specify not merely what agents are instructed or disposed not to do, but what they are unable to bring about. We develop a conservative extension of Coalition Logic with an explicit inability operator, interpreted as the negation of coalition ability. This operator is introduced as a conservative and formally tractable starting point for studying inability as a modal concept in its own right. We prove soundness, completeness, and conservativity over standard Coalition Logic, and analyse the resulting modal behaviour: anti-monotonicity with respect to coalition inclusion, contravariance with respect to goal strength, asymmetric interaction with conjunction and disjunction, failure of superadditivity, non-equivalence with opponent ability, and the connection between grand-coalition inability and systemic impossibility. Making this definable operator explicit reveals a systematic modal structure governing the limits of agency, and supports reasoning about constraints, negative capabilities, and impossibility in multi-agent systems.
Read the full abstract

Rings and Algebras

Fixed-point-free automorphisms of solvable Lie algebras

In this paper, we investigate the existence of fixed-point-free automorphisms for finite-dimensional Lie algebras. By a result of Jacobson, a Lie algebra admitting a fixed-point-free automorphism is solvable. We prove that such a Lie algebra must be even strongly unimodular. We find a necessary and sufficient criterion such that a complex almost abelian Lie algebra admits a fixed-point-free automorphism. For complex filiform Lie algebras we show that the existence of a fixed-point-free automorphism is equivalent to not being characteristically nilpotent.
Read the full abstract

Geometric Topology

Geometric densities and compression radii of knot types

We introduce scale-free compression radii and packing ratios of knot types and clarify their relation to geometric densities. Let $D$ be a Euclidean-invariant, scale-covariant size functional on embedded closed curves. For a curve $\gamma$, we define the $D$-density by $\operatorname{Len}(\gamma)/D(\gamma)$, the $D$-compression radius by $D(\gamma)/\operatorname{Thi}(\gamma)$, and the corresponding packing ratio as its reciprocal. For each representative, ropelength is the product of the $D$-density and the $D$-compression radius. The main point is not this formal cancellation, but the separation it suggests after optimization within a fixed knot type: density, compression, and ropelength generally have different minimizing sequences. We establish the basic optimized inequality and a criterion for equality, and compute the unknot case for diameter and minimal enclosing radius. We also prove polygonal approximation theorems for the compression radii associated with these two size functionals, using standard convergence properties of polygonal thickness, and formulate sufficient hypotheses for analogous results for other $L^p$-type size functionals. Finally, we discuss relations with distortion, trunk, and supertrunk. The framework is intended as a structural companion to density-type invariants rather than as an immediate source of stronger ropelength lower bounds. In particular, the optimized factorization alone does not yield new ropelength bounds; such bounds require independent estimates for the density and compression factors.
Read the full abstract

Information Theory

Semidefinite and linear programming bounds for sum-rank-metric codes and non-existence results

The sum-rank metric provides a unifying framework that generalizes both the celebrated Hamming and rank metrics, and has found applications in areas such as network coding, distributed storage, and space-time coding. A central problem is to determine the maximum size of a code with prescribed minimum distance. In this paper, we derive new sharp upper bounds on the size of a sum-rank-metric code using spectral and optimization techniques, including a semidefinite programming (SDP) bound that can outperform the best existing bounds based on computational experiments. Furthermore, we compare the Delsarte linear programming (LP) bound and a recent eigenvalue LP bound, and show equivalences between them, with particular emphasis on extremal regimes of the sum-rank metric. Finally, we show how to use the several SDP, LP and eigenvalue bounds to prove non-existence results for certain optimal and perfect sum-rank metric codes. Our results suggest that the combination of spectral and optimization methods effectively captures the hybrid nature of the sum-rank metric, providing new techniques that overcome the limitations of classical coding-theoretic approaches.
Read the full abstract

All authors Aida Abiad, Antonina P. Khramova, Sven C. Polak, Ferdinando Zullo

Combinatorics

Sufficient conditions for spanning $k$-trees in tough graphs

The toughness of a graph $G$, denoted by $\tau(G)$, is defined by $\tau(G)=$min $\{\frac{|S|}{c(G-S)}:S\subseteq V(G)$ and $c(G-S)\geq2\}$. A graph $G$ is said to be $\tau$-tough if $\tau(G)\geq \tau$. Let $k\geq2$ be an integer. A tree $T$ is called a $k$-tree if $d_{T}(v)\leq k$ for each $v\in V(T)$, that is, the maximum degree of a $k$-tree is at most $k$. A $k$-tree $T$ is a spanning $k$-tree if $T$ is a spanning subgraph of a connected graph $G$. In 1989, Win [Graphs Combin. 5 (1989) 201–205] proved that if $\tau(G)\geq\frac{1}{k-2}$, where $k\geq3$, then $G$ contains a spanning $k$-tree. Liu, Fan and Shu [Discrete Math. 348 (2025) 114593] provided a tight sufficient condition based on the spectral condition for connected $\frac{1}{k}$-tough and $\frac{1}{k-1}$-tough graphs to contain a spanning $k$-tree, where $k\geq3$ is an integer. A natural and interesting problem arises: Can the value of $\tau$ be refined? When $\frac{1}{k-2}>\tau\geq\frac{1}{k-1}$, we initially establish a lower bound on the size to ensure that a connected $\frac{t}{t(k-2)+1}$-tough graph $G$ contains a spanning $k$-tree, where $k\geq3$ and $t\geq1$ are integers. Meanwhile, we provide two sufficient conditions in terms of spectral radius and signless Laplacian spectral radius for a connected $\frac{t}{t(k-2)+1}$-tough graph $G$ to contain a spanning $k$-tree, where $k\geq3$ and $t\geq1$ are integers. When $t=1$, we obtain the result $\eta=1$ from Liu, Fan and Shu.
Read the full abstract

Mathematical Physics

No-Go Theorem for Quasiparticle BEC in the Spin-Boson Model

We analyze the possibility of Bose-Einstein condensation (BEC) at finite temperature in the spin-boson model within the frameworks of functional integral representations and the resolvent algebra. Because a sesquilinear form arising from the zero mode appears, analogous to the case of the free Bose gas, a BEC-type component is also formally present in the spin-boson model. However, according to arxiv:1207.4621, quasiparticles do not undergo BEC, so we have to exclude this possibility. A no-go theorem for BEC is obtained, but we find that the spin-boson model is not a model that follows the criterion in arxiv:1207.4621.
Read the full abstract