Analysis of PDEs
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
Wednesday 13 May
We study the long time behavior of regular solutions of the supercritical gSQG equations in the fully nonlinear regime. More precisely, under the assumption of small initial data in the critical Sobolev norm, we prove the existence of the unique global solution that satisfies the energy inequality (1.3) and for which the critical norm $||{\theta(t)}||_{H^{1+\beta-2\alpha}}$ decays to 0 as time goes to infinity.
Complex Variables
A survey on normal forms of real submanifolds with CR singularity
We survey results dating back from the seminal works of Bishop and Moser-Webster as well as more recent advances.
Statistics Theory · Cross-listed from quant-ph
Three ways to find comfort with the Bell proof and the results of the Bell experiments
Bell's theorem states that no description of a Bell experiment can be simultaneously local, realistic in the sense of counterfactual definiteness, and free of conspiracy between settings and hidden state. The recent generation of experiments has confirmed the predicted violation of the CHSH inequality, so one of the assumptions must be abandoned. Which one, and how one reconstructs a coherent worldview after doing so, is a question on which many authors disagree. This paper is written by three such authors. All three reject both counterfactual definiteness and conspiratorial violation of statistical independence of setting choices and state. After a joint exposition of the classical half of Bell's theorem in the language of Pearl-style causal graphs, a joint summary of the loophole-free experiments, and a joint survey of the recent literature, each author states where they have presently arrived. Gill accepts irreducible and non-local quantum randomness and finds the choice between locality and realism a false dichotomy. In his later works, Bell derives counterfactual definiteness from classical local causality, and that is what has to go. The metaphysical concepts "realism", "locality", "causality" need to be reconsidered. Helland reconstructs the Hilbert-space formalism from a theory of accessible variables, and from this theory he concludes that every observer must be limited in a specific sense. Jongejan proposes a geometric hidden-variable construction in which the degree of violation of the CHSH inequality depends on the number of dimensions of space, Tsirelson's bound corresponding to three dimensions. The authors conclude with a discussion.
Read the full abstract
Dynamical Systems
On fixed point results in metric spaces for large triangle-perimeter contractions
In this paper we introduce a corrected extension of Burton's theory of large contractions in the context of triangle-perimeter contractions introduced by Petrov. Combining these two lines of research, we prove a fixed point result for large triangle-perimeter contractions with an auxiliary assumption, which is of utmost importance. Firstly, we give a counterexample to the main result related to large triangle-perimeter contractions that currently exists in literature. Then, we prove that given an additional condition, a fixed point result for large triangle-perimeter contractions holds. Lastly, we illustrate with an example that this new framework is strictly broader than Burton's and Petrov's theory.
Read the full abstract
Numerical Analysis
On a posteriori stopping rules of adaptive stochastic heavy ball method for ill-posed problems
In this paper we develop a stochastic heavy ball method for solving ill-posed inverse problems. The method updates the iterate using only a randomly selected equation at each iteration step while incorporating a momentum term into the process. To facilitate fast convergence, we propose an adaptive strategy for selecting the step size and the momentum coefficient. Inspired by the spirit of the discrepancy principle, we introduce an a posteriori stopping rule for our adaptive stochastic heavy ball method. This rule avoids the need to compute residuals of all equations in the system at every iteration or at fixed frequency intervals, thereby enhancing computational efficiency and practicality. Additionally, convex penalty functions are employed to capture the specific features of the desired solutions. Under suitable conditions, we establish almost sure convergence as well as convergence in expectation. Extensive numerical experiments are conducted to evaluate the performance of the proposed method, demonstrating its efficiency and promising potential for solving large-scale ill-posed problems.
Read the full abstract
Information Theory
On the Generalization of Knowledge Distillation: An Information-Theoretic View
Knowledge distillation is widely used to improve generalization in practice, yet its theoretical understanding remains elusive. In the standard distillation setting, a teacher model provides soft predictions to guide the training of a student model. We model teacher and student training as coupled stochastic processes and introduce a distillation divergence, defined as the Kullback-Leibler divergence between these two stochastic kernels. Within this framework, we derive two generalization bounds for the student model relative to the teacher's generalization gap: an upper bound under a sub-Gaussian assumption via algorithmic stability, and a lower bound under a central condition with sharper dependence on the distillation divergence. We further develop a loss-sharpness-aware bound with an explicit tightness regime, showing that the teacher's local flatness can strictly tighten the bound. Additionally, in a linear Gaussian case study, the distillation divergence admits an interpretable decomposition into bias, variance, and rank-bottleneck costs, yielding practical guidance for distillation design.
Read the full abstract
Optimization and Control · Cross-listed from cs.AI
A Constraint Programming Approach for n-Day Lookahead Playoff Clinching in the NHL
In professional sports, a team has clinched the playoffs if they are guaranteed a postseason spot, regardless of the outcomes of any remaining games. As the season progresses, sports fans and other stakeholders are interested in precisely when, and under what conditions, their team will clinch the playoffs. In this paper, we investigate playoff clinching in the context of the National Hockey League (NHL), where it is computationally challenging to produce clinching scenarios due, in part, to complex tie-breakers. We present an algorithm that determines under which combinations of game outcomes in the next $n$ days a team will clinch the playoffs (i.e., "$n$-day lookahead clinching"). Our approach is a custom tree search which employs various preprocessing techniques, pruning strategies, and node ordering heuristics to efficiently explore the space of possible outcomes. The tree search leverages a constraint programming (CP)-based subroutine for inference that determines if a team has clinched the playoffs for some snapshot in time of the regular season (i.e., "0-day lookahead clinching"). This CP subroutine aims to find a counter-example in which the team being evaluated is eliminated, taking into account qualification rules and the NHL's extensive list of tie-breakers. We validate the efficacy of our algorithm using hundreds of scenarios based on public NHL data for the seasons 2021-22 through 2024-25. The methods introduced can be readily extended to other metrics of interest, including mathematical proof of playoff elimination, clinching the President's Trophy, as well as clinching (or being eliminated from clinching) any other seed in the standings.
Read the full abstract
Probability · Cross-listed from stat.ML
State-of-art minibatches via novel DPP kernels: discretization, wavelets, and rough objectives
Determinantal point processes (DPPs) have emerged as a kernelized alternative to vanilla independent sampling for generating efficient minibatches, coresets and other parsimonious representations of large-scale datasets. While theoretical foundations and promising empirical performance have been demonstrated, there are two challenges for current proposals for DPP-based coresets or minibatches. The first is the need for families of DPPs with certain key variance reduction properties, usually constructed in a continuous setting, of which there are few known examples. The second is the need for an ad-hoc construction of a discrete DPP defined on a given dataset, that inherits such variance reduction. In this work, we contribute to the programme of establishing DPPs as a subsampling toolbox for ML by advancing on these two fronts. First, we propose new DPPs on the Euclidean space based on wavelets, with provably better accuracy guarantees than the best known rates. Second, we introduce a general method to convert such continuous DPPs, which are more amenable to proving analytical statements, into discrete kernels, which are pertinent for subsampling tasks such as minibatch and coreset constructions. This conversion mechanism simultaneously preserves the desired variance decay and reveals a low-rank decomposition of the discrete kernel, which makes sampling the corresponding DPP computationally inexpensive. En route, we enlarge the class of ML tasks amenable to improvements via DPP-based minibatches and coresets to include objective functions with arbitrarily low regularity, and rate guarantees that explicitly adapt to this regularity.
Read the full abstract
Numerical Analysis
Polynomial interpolation–regression on the sphere
We introduce an interpolation–regression operator for polynomial approximation on the unit sphere $\mathbb{S}^2$ from discrete samples. The approximant is a spherical polynomial of degree $r$ which interpolates the data on a prescribed subset of nodes and uses the remaining sampling nodes to minimize the residual in a least squares sense. Under natural rank assumptions on the associated Vandermonde matrices, the approximant is unique and is characterized by an orthogonality condition with respect to the discrete inner product on the sampling set. We then focus on the case in which the sampling and interpolation nodes are antipodally symmetric. In this setting, when the polynomial is expressed in real spherical harmonics, the constrained problem can be decomposed into independent even and odd components. In the same framework, we prove equivariance under the antipodal map and, more generally, under orthogonal transformations preserving the node sets. We also consider spherical designs. In this case, the normal matrix is a scalar matrix. Consequently, the spectral condition number of the associated KKT matrix can be written explicitly. Numerical experiments in both antipodal and non-antipodal settings illustrate the effectiveness of the proposed method.
Read the full abstract
Optimization and Control · Cross-listed from eess.SY
D-Optimized Sampling Design for System Identification
Traditional system identification with multisine inputs relies on uniform sampling and periodic excitation to preserve Fourier orthogonality and avoid spectral leakage, limiting its use in scenarios with irregular sampling or nonperiodic inputs. This work investigates continuous-time system identification under nonperiodic multisine excitation and nonuniform sampling. We develop a nonparametric frequency response function estimator suited to such conditions and design irregular sampling schemes that enhance the informativeness of measurements and reduce spectral leakage. The proposed sampling scheme improve the statistical accuracy of system identification in settings where periodic excitation is impractical.
Read the full abstract
Optimization and Control
Recasting AI Data Centers as Engines for Carbon Removal
AI data centers (AIDCs) are rapidly increasing electricity demand and associated CO2 emissions, yet they also generate continuous low-grade waste heat. Here, we assess whether this heat can be upgraded by heat pumps to drive direct air capture (DAC) and reduce the climate impact of AI infrastructure. We develop a thermodynamically integrated DAC-AIDC system and conduct a region-resolved assessment across the United States, accounting for AIDC capacity, server composition, local climate, electricity prices, and grid carbon intensity. We find that AIDC waste heat can substantially improve net CO2 removal and lower the levelized cost of capture. In carbon-intensive regions, integration can flip DAC from net-positive to net-negative. Under a 2030 scenario with more GPU-intensive AIDCs and cleaner grids, several states achieve removal ratios above 1, indicating that integrated systems can offset their own operational emissions and deliver additional carbon removal.
Read the full abstract
Probability
Discrepancy and Fisher information
We give an online algorithm that keeps a symmetric random walk inside a convex body by discarding some of its steps. The expected number of discarded steps is controlled by a Fisher-information-type quantity associated with the body. For the cube, this gives a dimension-free bound: a walk with unit Euclidean steps can be kept bounded in all coordinates while discarding only a small constant fraction of the steps on average.
Read the full abstract
Numerical Analysis
Hypernetwork-Conditioned WENO5 Conservative-Form CNNs for One-Dimensional Conservation Laws
We study a conservative data-driven discretization for one-dimensional hyperbolic conservation laws based on the classical fifth-order WENO finite-volume scheme and a hypernetwork architecture. In the proposed Hyper–WENO5 Conservative-Form Convolutional Neural Network (Hyper–CFCNN), a lightweight target network predicts the nonlinear WENO weights on each stencil, while a hypernetwork generates the target-network parameters from problem metadata, including the mesh spacing, mesh layout, and coarse descriptors of the initial condition. The construction preserves the standard polynomial reconstruction and conservative flux-difference update of WENO, which enables adaptation across problem instances and spatial resolutions without retraining. We also consider an unknown-flux variant, Hyper–CFCNN–F, in which a compact FluxNet is used in place of the analytical flux inside the numerical flux function while retaining a conservative update form. To improve long-time prediction quality, training uses a multi-step recurrent loss that penalizes error accumulation over successive time advances. Numerical experiments on one-dimensional test problems, including single- and multi-shock Burgers equations, the shallow-water system, and the Shu–Osher Euler example, show that Hyper–CFCNN attains accuracy comparable to classical WENO5, achieves near machine-precision conservation in the known-flux setting on fine meshes, and generalizes to unseen spatial resolutions and initial conditions without retraining. The flux-learning variant remains stable on meshes outside the training set and exhibits bounded conservation drift. These results show that hypernetwork-conditioned conservative WENO discretizations provide an effective framework for adaptive high-order learning of nonlinear conservation laws with either known or unknown fluxes.
Read the full abstract
Optimization and Control
Guaranteed cost structured control in infinite-horizon linear-quadratic cooperative differential games
In this paper, we consider the infinite-horizon linear-quadratic cooperative differential games with output feedback information structure. We first show that computing Pareto optimal controls under output feedback is difficult even for low-dimensional games. To address this, we introduce the concept of feedback guaranteed cost structured control (GCSC). At a feedback GCSC, the total weighted team cost remains below a prescribed threshold while satisfying the structural constraint. We derive monotonicity properties of the feedback GCSC set and the admissible weight set, respectively. Further, we show that Pareto optimal controls (if they exist) belong to the class of feedback GCSCs. We provide performance measures of the Pareto optimal controls and the proposed GCSC relative to the output feedback optimal control. We also establish verification and synthesis conditions for a feedback GCSC using linear matrix inequalities, where the synthesis formulation is convex and requires no semi-definite programming relaxation. Finally, we illustrate the effectiveness of the proposed approach through numerical examples, including a microgrid tracking synchronization case study.
Read the full abstract
History and Overview of Mathematics
A philosophical history of infinitesimals
We explore the issue of providing a foundational framework for Leibnizian infinitesimals in the light of modern standard and nonstandard approaches. We outline a trichotomy of ordinals, cardinals and ringinals as a historiographic tool. A ringinal is a concept of infinite number, arithmetic in nature, different from Cantor's transfinite ordinals and cardinals. The continuum is not necessarily identifiable with R; even if one seeks such an identification, infinitesimals are not ruled out. Analysis with unlimited numbers (via the predicate standard) is possible in a conservative extension of Zermelo-Fraenkel set theory and in this sense is epistemologically 'safe'. We sketch a recent theory of infinitesimal analysis that formalizes Leibnizian definitions and heuristic principles while eschewing both the axiom of choice and ultrafilters, thus challenging received philosophical views on the nature of infinitesimals.
Read the full abstract
Functional Analysis
Triebel-Lizorkin spaces and expansive matrices
We survey recent classification theorems for expansive matrices that generate the same anisotropic homogeneous Triebel-Lizorkin function space or sequence space. The function spaces are classified precisely by those matrices for which their associated homogeneous quasi-norms on Euclidean space are equivalent, whereas the sequence spaces are classified by a strictly stronger condition. We unravel this discrepancy between function spaces and sequence spaces by showing that two sequence spaces are retracts of each other whenever the corresponding function spaces are the same.
Read the full abstract
Combinatorics
Combinatorial construction of known positive series for partition classes defined by Capparelli, Meurman, Primc, and Primc in the $k$=1 Case
Recently, Capparelli, Meurman, A. Primc and M. Primc introduced a class of colored partitions which has since been called CMPP partitions. This generalized earlier work by M. Primc and Šikić, and by Trupčević. One main reason why CMPP partitions are significant is the authors' conjecture that the generating functions are infinite products in all cases. CMPP partitions are true extensions of the partition classes in the Rogers-Ramanujan-Gordon identities which are defined by difference conditions. As such, a natural question is to look for generating functions similar to the series side of Andrews-Gordon identities. Russell found such bivariate series for one case. These evidently positive series overlap with the positive series found earlier by Griffin, Ono and Warnaar in the edge cases. Russell used symbolic computation in the proofs. We will combinatorially interpret Russell's bivariate series extending one case of the series due to Griffin, Ono and Warnaar in a base partition and moves setting, and supply some missing cases, as well.
Read the full abstract
Algebraic Geometry
Orbits of subgroups of codimension one to four of the Iwahori group in the affine flag variety of $\text{SL}_2$
We describe how each finite dimensional Schubert cell in the affine flag variety of $\text{SL}_2$ decomposes into orbits for a chain of subgroups of codimension one to four of the Iwahori group.
Geometric Topology
Presentations and Representations of the Multi-Virtual Twin Group and Associated Subgroups
Motivated by the notion of the multi-virtual braid group introduced by L. Kauffman and by the study of extensions of the well-known twin group T_n, n >= 2, we introduce a new group called the multi-virtual twin group M_kVT_n, where k >= 1 and n >= 2, together with two associated subgroups: the multi-virtual pure twin group M_kVPT_n and the multi-virtual semi-pure twin group M_kVHT_n.We classify all homogeneous 2-local representations of M_kVT_n into GL_n(C) for all k >= 1 and n >= 3, and show that they fall into exactly eight distinct types. We also investigate their main properties, including faithfulness and irreducibility, proving that they are generally unfaithful and providing necessary and sufficient conditions for their irreducibility.Furthermore, for certain values of k and n, we construct non-local representations of M_kVPT_n induced from those of M_kVT_n, and we determine the conditions under which these induced representations are irreducible. Finally, we present several problems for future research in this area.
Read the full abstract
Dynamical Systems
Reverse Iterated Function Systems: Density, Dimensions, and $p$-adic Extension
Strichartz initiated the study of reverse iterated function systems (RIFSs) on integer lattices and the dimensions of their invariant sets. We develop a dimension theory for RIFSs through forward orbits, first on locally compact complete metric spaces and then for one-dimensional affine systems. For an affine RIFS $\mathcal F=\{f_i(x)=r_i x+b_i\}_{i=1}^m$ on $\mathbb R$, we introduce the semigroup-growth exponent\[ d_{\mathcal F}=\lim_{R\to\infty}\frac{\log\#\{g\in G^*(\mathcal F):|g'|\le R\}}{\log R}, \] where $G^*(\mathcal F)$ is the semigroup of distinct maps generated by $\mathcal F$. We prove that this limit exists and that $\dim_{\mathrm B}K(\mathcal F^{-1})\le d_{\mathcal F}\le s$. Every forward orbit has mass dimension $d_{\mathcal F}$ if it is locally finite and infinity otherwise; its Beurling dimension is $d_{\mathcal F}$ if it is uniformly locally finite and infinity otherwise. These formulas extend to suitably discrete invariant sets. Moreover, $d_{\mathcal F}=s$ if and only if the dual IFS has no exact overlaps, while $d_{\mathcal F}=0$ if and only if $\mathcal F$ is degenerate. Under finite overlaps, we obtain two-sided polynomial orbit-counting estimates. For non-overlapping uniformly locally finite orbits, renewal theory gives a limiting central density in the non-arithmetic case and a multiplicatively periodic asymptotic profile in the arithmetic case. We also determine the lower and discrete Hausdorff dimensions of rational lattice orbits with finite overlaps. Finally, for expansion ratios that are signed powers of a fixed prime $p$, we identify the Euclidean mass and Beurling dimensions of every rational orbit with the $p$-adic box-counting dimensions of the orbit and its attractor, without any separation assumption.
Read the full abstract
Geometric Topology
Non-arithmeticity of length spectra of subgroups of mapping class groups
In this paper, we prove that every non-elementary subgroup of the mapping class group of a surface has non-arithmetic Teichmüller length spectrum. Namely, Teichmüller translation lengths of its pseudo-Anosov elements generate a dense additive subgroup of $\mathbb{R}$. We prove this by introducing the notion of cross-ratios on $\mathcal{MF}$ and $\mathcal{PMF}$, and studying its geometric and dynamical properties, despite the lack of negatively curved features of the Teichmüller space nor the conformal geometry on $\mathcal{PMF}$.
Read the full abstract
Analysis of PDEs
Exact conservation as selection principle: discrete exterior calculus for the incompressible Navier-Stokes and Euler equations
We formulate a new discrete-exterior calculus based discretisation of the incompressible Euler and Navier-Stokes equations that preserves the geometric structure of the continuum, and establish a rigorous convergence and structure theory for a new discretisation. The discretisation operates on prismatic Delaunay-Voronoi meshes over closed Riemannian manifolds. The geometry of Euler and Navier-Stokes equations is maintained via a discrete Lie derivative that is built from an extrusion-based contraction for the nonlinear term in vector-invariant form. Conservation of energy and Kelvin circulation links the discrete scheme to the continuum: at the discrete level, energy conservation is a stability property, and in the vanishing-resolution limit it becomes both a constructive route into the conservative weak-solution theory of the continuum equations and a selection principle on the limits the scheme can reach. This correspondence appears in four regimes. Smooth solutions: convergence at rate $\mathcal{O}(h^{\min(r_{\rm rec},\,r_\star)}\,|\log h|)$ in dimensions $d=2,3$, uniformly in viscosity $\nu \ge 0$; first order on general meshes, second order under centroid proximity and reconstruction symmetry. Leray-Hopf weak regime: subsequential $L^2$ limits of the discrete Navier-Stokes system are weak solutions of the viscous equations. Inviscid measure-valued regime: limits are conservative measure-valued Euler solutions, with concentration defect vanishing above the Onsager threshold $\alpha > 1/3$ provided the discrete solutions admit a uniform $C^{0,\alpha}$ bound; the scheme reaches the energy-conserving side of the Onsager landscape but not the dissipative side. Dissipative regime: no subsequence converges to an energy-dissipating Euler solution at any Hölder regularity, an exclusion that follows from discrete energy conservation.
Read the full abstract
Differential Geometry
Separable surfaces that are critical points of the Dirichlet energy
In this paper, we study surfaces $z=\varphi(x,y)$ in Euclidean space that satisfy the equation $\varphi_{xx}+\varphi_{yy}=\frac{\Lambda}{2}$ where $\Lambda\in\r$ is a real constant. We classify these surfaces when they are the zero level sets of an implicit equation of the type $f(x)+g(y)+h(z)=0$, where $f$, $g$ and $h$ are smooth functions of one variable. If $\Lambda=0$, we find a large family of surfaces with interesting symmetry properties. However, if $\Lambda\not=0$, we show that the surfaces must be either surfaces of revolution or of the type $z=f(x)+g(y)$; furthermore, explicit parametrizations of these surfaces are obtained.
Read the full abstract
Representation Theory
On the additivity of projective presentations of maximal rank
We study projective presentations of finite-dimensional modules over finite-dimensional algebras. We discuss if projective presentations of maximal rank behave additively. More precisely, we ask if the direct sum of copies of a projective presentation of maximal rank is again of maximal rank. The modules which have a projective presentation of maximal rank are exactly the $\tau$-regular modules. This class of modules can be seen as a generalization of modules of projective dimension at most one, and of $\tau$-rigid modules. The $\tau$-regular modules form open subsets of module varieties. Their closures are therefore unions of irreducible components, which are called generically $\tau$-regular. We discuss when a $\tau$-regular module or a generically $\tau$-regular component can be reduced to a module or component of projective dimension at most one, and we show that this is closely related to the question on the additivity of maximal rank presentations.
Read the full abstract
Differential Geometry
Geometric aspects of the curve shortening flow in the hyperbolic plane
We define a new notion of translations in the hyperbolic plane and explicitly solve the equation of the curve shortening flow. Next, we consider the class of ancient convex solutions and solve the equation of the curve shortening flow when the curvature function is given by separation of variables. Lastly, we prove some area estimates for closed ancient solutions of the curve shortening flow.
Read the full abstract
Differential Geometry
A necessary condition for cylindrical curves in terms of curvature and torsion
We establish necessary conditions for a regular curve to lie on a circular cylinder in terms of its curvature $\kappa$ and torsion $\tau$. By identifying a fundamental function $\psi = \sin^2 \alpha$, representing the squared sine of the angle between the tangent vector and the axis of the cylinder, we reduce the geometric inclusion problem to a compatibility condition between an explicit eighth-degree polynomial equation and a differential equation for $\psi$. This approach yields a single ODE involving only $\kappa$ and $\tau$ that governs the inclusion of the curve in the cylinder. The robustness of this framework is demonstrated through specific examples of cylindrical curves. Furthermore, we analyze the case of curves with constant curvature $\kappa_0$, obtaining an explicit ODE for the torsion. Remarkably, we prove that if $\kappa_0 = 1/\rho$, this equation admits an explicit, exact solution for $\tau$.
Read the full abstract
Information Theory
Skew Polycyclic Codes over $\frac{\mathbb{F}_{p^m}[u]}{\langle u^t \rangle}$
Let $R^t$ denote the finite chain ring $\frac{\mathbb{F}_{p^m}[u]}{\langle u^t \rangle},$ where $p$ is a prime and $t$ is a positive integer. In this article, for a prime $p$ and an automorphism $\theta$ of $\mathbb{F}_{p^m}$, we give the structure of the left ideals of the ring $\frac{R^t[x,\Theta]}{\langle f(x) \rangle},$ where $f(x)$ is in the center of the skew polynomial ring $R^t[x,\Theta]$ and $\Theta$ is an automorphism of $R^t$ that extends $\theta$ with $\Theta(u)=u$. These left ideals are also referred to as skew polycyclic codes associated to $f(x).$ In particular, when the central element \( f(x)\) is \(x^{np^s}-\lambda \), where $\lambda=\lambda_0+u\lambda_1+\cdots +u^{t-1}\lambda_{t-1}$ with $\lambda_0\ne0,$ and \( n=1,2 \), we give a more refined form of the left ideals (which are also called skew constacyclic codes). Moreover, the case $\lambda_1 \neq 0$ is analyzed in detail, yielding a simpler form of generators that reveals a more refined structural characterization of the left ideals. As an application, for $n=1,t=3$ and $n=2,t=2$ we give a full description of the left ideals by including certain necessary conditions that were omitted in available literature, preventing the different classes of left ideals from being mutually disjoint and in certain cases, we also compute $i$-th torsion codes.
Read the full abstract
Operator Algebras
Categorical (Co)Limits of Quantum Graphs
We begin with the characterization of quantum graphs as left ideals in $\mathcal M \otimes_{eh} \mathcal M$ (the extended Haagerup tensor product of $\mathcal M$ with itself) to avoid technicalities surrounding representation dependence of quantum graphs. These left ideals roughly correspond to a canonical complement of a quantum graph. Using these left ideals and some operator space theory, we find a new, representation-free characterization of a morphism of quantum graphs compatible with previous representation-dependent morphisms. A notion of categorical (co)limit of quantum graphs follows. We also briefly explore an alternative quantization of graphs as bimodules over $C^*$-algebras ($C^*$-graphs), mostly to emphasize the point that a morphism of $C^*$-graphs is not a morphism of $C^*$-correspondences.
Read the full abstract
Geometric Topology
Lefschetz Fibrations on Knot Traces of Alternating and Extended Alternating Knots
In our previous work, we introduced a simple and explicit method for constructing a positive allowable Lefschetz fibration (PALF) from a $2$-handlebody decomposition of any given compact Stein surface. In this paper, we apply this construction to knot traces whose attaching circles are either alternating knots or extended alternating knots (a generalized class introduced herein). We demonstrate that each such knot trace admits a PALF whose regular fiber has a genus exactly equal to the number of white regions in the associated planar graph, yielding PALFs whose regular fibers have a significantly small genus. As immediate corollaries, we prove that knot traces of positive pretzel knots with $s$ rows admit PALFs with regular fibers of genus $s-1$, and those of positive torus knots admit PALFs with regular fibers of genus $1$. Furthermore, we define positive torus-pretzel knots by replacing each twist block of a positive pretzel knot with the crossings of a positive torus knot, and we establish that their knot traces also admit PALFs with regular fibers of genus $s-1$.
Read the full abstract
Mathematical Physics
A note on unitary invariance of Connes spectral distances between quantum states
In this paper, we study some properties of Connes spectral distances between quantum states under unitary transformations. We mainly focus on spectral triples with matrix algebras acting on finite-dimensional Hilbert spaces via unital representations. We find that there is a direct correspondence between the Lipschitz unit sphere and the set of optimal elements of finite Connes spectral distances. Quantum trace distance is one of the most important unitarily invariant distance measures. We prove that for any finite-dimensional matrix algebra, there exist finite-dimensional spectral triples for which the Connes spectral distances coincide with the quantum trace distances between quantum states. We also construct finite-dimensional spectral triples in which the Lipschitz seminorm coincides with the operator norm for traceless Hermitian elements, and the Connes spectral distances between one-qubit states are exactly the quantum trace distances. These results provide a better understanding of the unitary invariance of Connes spectral distance and the relationships between Connes spectral distance and other quantum distance measures. These concrete examples are valuable for studying the geometric structures of finite spectral triples and mathematical relations of qubits and other quantum states in the framework of noncommutative geometry.