Peer Revenue Equity in science

Papers

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

Mathematics

math Watch Mathematics (sign in to use)

Friday 6 March

Representation Theory

Covariant representations of algebraic group actions and applications

If $G$ is an algebraic affine group acting on an affine variety $X$, there is a natural notion of covariant representation for the pair $(G,X)$. In this paper, we classify the irreducible covariant representations for any such pair by adapting the Mackey machine to this algebraic setting. Next, we give applications for continuous representations of motion groups on Banach spaces and other related examples.
Read the full abstract

Differential Geometry

Barycenter technique for the higher order $Q$-curvature equation

Let $k\ge1$ be an integer, and $(M,g)$ be a smooth, closed Riemannian manifold of dimension $2k+1\le n\le 2k+3$, or $(M,g)$ be locally conformally flat of dimension $n\ge 2k+1$. Applying the Bahri-Coron barycenter method, we show the existence of a conformal metric with constant $Q$-curvature of order $2k$, or equivalently, the existence of a positive solution for the $2k$-th order $Q$-curvature equation involving the GJMS operator $P_{g}$. We only assume a natural positivity preserving condition on $P_{g}$ and do not suppose any condition on the sign of the {mass} of $P_{g}$. In particular, we obtain existence without using a positive mass theorem.
Read the full abstract

Optimization and Control · Cross-listed from cs.LG

Gradient Flow Polarizes Softmax Outputs towards Low-Entropy Solutions

Understanding the intricate non-convex training dynamics of softmax-based models is crucial for explaining the empirical success of transformers. In this article, we analyze the gradient flow dynamics of the value-softmax model, defined as ${L}(\mathbf{V} \sigma(\mathbf{a}))$, where $\mathbf{V}$ and $\mathbf{a}$ are a learnable value matrix and attention vector, respectively. As the matrix times softmax vector parameterization constitutes the core building block of self-attention, our analysis provides direct insight into transformer's training dynamics. We reveal that gradient flow on this structure inherently drives the optimization toward solutions characterized by low-entropy outputs. We demonstrate the universality of this polarizing effect across various objectives, including logistic and square loss. Furthermore, we discuss the practical implications of these theoretical results, offering a formal mechanism for empirical phenomena such as attention sinks and massive activations.
Read the full abstract

Probability

Transposition Approach to Optimal Control of McKean-Vlasov SPDEs

In this paper, we investigate an optimal control problem for McKean-Vlasov stochastic partial differential equations, in which the coefficients depend on the law of the state process. For systems with nonconvex control sets, we establish a Pontryagin-type stochastic maximum principle that provides necessary optimality conditions for admissible controls. The analysis is based on the classical spike variation method together with the introduction of an adjoint backward stochastic partial differential equation involving Lions derivatives with respect to probability measures. Our results extend the stochastic maximum principle for McKean-Vlasov controlled stochastic differential equations to the infinite-dimensional SPDE setting.
Read the full abstract

Functional Analysis

Inequalities for Pairs of Measure Spaces and Applications

We study a family of inequalities on pairs of measure spaces involving functions defined on product domains. Our main result establishes a Jensen-type inequality under a general product-measure framework, extending classical inequalities such as Hölder's and Minkowski's as special cases. The inequality admits sharp characterizations of equality and yields quantitative, variational, and probabilistic refinements under additional convexity assumptions. Several corollaries illustrate power-mean, entropy-type, and erasure-robust inequalities, as well as applications to convolution-type operators and weighted discrete models.
Read the full abstract

Optimization and Control · Cross-listed from q-fin.RM

General bounds on functionals of the lifetime under life table constraints in a joint actuarial-financial framework

In life insurance, life tables provide survival probabilities at integer ages but leave the distribution of deaths within each year unspecified. This incompleteness is particularly relevant for modern insurance products such as variable annuities, whose payoffs depend jointly on lifetime uncertainty and financial market performance. The valuation of such contracts must therefore be carried out in a joint actuarial-financial framework, as their values depend not only on the full information about mortality rates but also on the interaction between mortality risk, asset dynamics and embedded guarantees. Standard approaches impose fractional-age assumptions or mortality rate models, but the resulting valuations strongly depend on these assumptions, which makes it difficult to generalize them. We hence derive upper and lower bounds of hybrid functionals of the lifetime with respect to mortality rates, which are compatible with the observed life table at integer ages and the given financial market. We derive two sets of results under distinct assumptions. In the first, we assume that each mortality trajectory is almost surely consistent with all the tabulated one-year survival probabilities. In the second, we consider a relaxed formulation that allows for deviations of the mortality rates while still being consistent in expectation with the given reference life table. These distinct yet complementary formulations characterize the worst- and best-case contract values over all mortality processes that remain compatible with the observed life-table information and the financial market. The resulting bounds provide insurers with a practical and robust risk-management tool for assessing the impact of adverse mortality dynamics on variable annuities, quantifying the uncertainty arising from incomplete life-table information, and incorporating mortality model risk into pricing decisions.
Read the full abstract

Geometric Topology

The generalized Lefschetz number and loop braid groups

We study the interplay between braid group theory and topological dynamics in three dimensions. While classical braid theory has been extensively applied to surface homeomorphisms to analyze fixed and periodic points, an analogous framework in three-dimensional manifolds has been lacking. In this work, we use loop braid groups, a three-dimensional generalization of classical braid groups, to investigate homeomorphisms of the $3$-ball that leave invariant a trivial link of finitely many circles. In our main theorem we relate matrix representations of loop braid groups, which are related to the Burau representation, to the abelianized generalized Lefschetz number. This result provides information on the existence of fixed points of such homeomorphisms and on their linking numbers with the invariant link. As an application, we obtain a lower bound for the number of periodic points of a given period. Our theorem establishes a three-dimensional analogue of a classical result for braids in the disk, and connects loop braid groups with Nielsen fixed point theory and topological dynamics in dimension three.
Read the full abstract

Algebraic Geometry

A Classification of Flexible Kokotsakis Polyhedra with Reducible Quadrilaterals

We study a class of mechanisms known as Kokotsakis polyhedra with a quadrangular base. These are $3\times3$ quadrilateral meshes whose faces are rigid bodies and joined by hinges at the common edges. In contrast to existing work, the quadrilateral faces do not necessarily have to be planar. In general, such a mesh is rigid. The problem of finding and classifying the flexible ones is old, but until now largely unsolved. It appears that the tangent values of the dihedral angles between different faces are algebraically related through polynomials. Specifically, this article deals with the case when these polynomials are reducible. We explore the conditions for reducibility to characterize all possible shape restrictions that lead to flexible polyhedra.
Read the full abstract

Number Theory

Rational Preperiodic Points of Quadratic Rational Maps over $\mathbb{Q}$ with Nonabelian Automorphism Groups

Let $f:\mathbb{P}^1\to\mathbb{P}^1$ be a quadratic rational map defined over the rational field $\mathbb{Q}$ with nonabelian automorphism group. We prove that no such map has a $\mathbb{Q}$-rational periodic point with exact period $N\ge 4$. We also give an explicit parametrization of such maps that have $\mathbb{Q}$-rational periodic points of exact period $1$, $2$, and $3$. In addition, we show that the number of $\mathbb{Q}$-rational preperiodic points of such a map $f$ cannot exceed $6$. As a result, we completely classify all portraits of $\mathbb{Q}$-rational preperiodic points for quadratic rational maps defined over $\mathbb{Q}$ with nonabelian automorphism group, showing that there are exactly $7$ such portraits, one of which is the empty portrait.
Read the full abstract

Numerical Analysis

A General and Robust 3D Finite Element Dynamics Framework for Railway Vehicle-Bridge Interaction with Nonlinear Wheel-Rail Contact Modeling

A key challenge in 3D finite element models of coupled railway vehicle-bridge dynamics is the rigorous definition of kinematic constraints and the development of an efficient, robust solution. This paper presents a novel approach that can be implemented in general finite element software using constraint equations tailored to wheel-rail contact behavior, essential for analyzing lateral vehicle-bridge interactions. The method employs absolute coordinates to describe the motion of nodes defining the track position and orientation for each wheelset, without assuming infinitesimal displacements or rotations. This general formulation enables realistic simulations of extreme scenarios involving large lateral movements caused by strong winds or earthquakes. The proposed wheel-rail contact model is first validated against published results, and a 3D numerical example demonstrates the method's performance and capabilities.
Read the full abstract

Complex Variables

Szegő type correlations for two-dimensional outpost ensembles

We consider two-dimensional Coulomb systems for which the coincidence set contains an outpost in the form of a suitable Jordan curve. We study asymptotics for correlations along the union of the outpost and the outer boundary of the droplet. These correlations turn out to have a universal character and are given in terms of the reproducing kernel for a certain Hilbert space of analytic functions, generalizing the Szegő type edge correlations obtained recently by Ameur and Cronvall. There are several additional results, for example on the effect of insertion of an exterior point charge in the presence of an outpost.
Read the full abstract

Probability

Random Quadratic Form on a Sphere: Synchronization by Common Noise

We introduce the Random Quadratic Form (RQF): a stochastic differential equation which formally corresponds to the gradient flow of a random quadratic functional on a sphere. While the one-point dynamics of the system is a Brownian motion and thus has no preferred direction, the two-point motion exhibits nontrivial synchronizing behaviour. In this work we study synchronization of the RQF, namely we give both distributional and path-wise characterizations of the solutions by studying invariant measures and random attractors of the system. The RQF model is motivated by the study of the role of linear layers in transformers and illustrates the synchronization by common noise phenomena arising in the simplified models of transformers. In particular, we provide an alternative (independent of self-attention) explanation of the clustering behaviour in deep transformers and show that tokens cluster even in the absence of the self-attention mechanism.
Read the full abstract

Combinatorics

Asymptotic Transfer in Critical Recursive Composition Schemes

The composition $\mathcal{F} \circ \mathcal{G}$ of two combinatorial classes $\mathcal{F}$ and $\mathcal{G}$ is a standard combinatorial construction and translates into the composition $F(G(z))$ of their corresponding counting generating functions. Such a composition is called critical if $G(\rho_G) = \rho_F$, where $\rho_F$ and $\rho_G$ denote the corresponding radii of convergences of $F$ and $G$, respectively. In this case, both the singular behaviours of $F$ and $G$ influence that of $F\circ G$. Such critical decomposition schemes appear quite frequently in the context of map enumeration. For example by using the block-decomposition one has $M(z) = B(z(1+M(z))^2)$ and $\rho_B = \rho_M (1+M(\rho_M))^2$, where $M(z)$ denotes the generating series of all rooted planar maps and $B(y)$ the generating series of $2$-connected rooted planar maps. This can be extended to multivariate generating functions by taking several statistics into account, for example face counts. Since critical composition schemes show (usually) a condensation phenomenon – in the above situation this means that there is giant $2$-connected block of linear size and linearly many small blocks – it is very plausible that statistical properties on $2$-connected maps transfer to corresponding properties of all maps and back. The purpose of the present paper is to make this precise on the level of the singular structure of the corresponding multivariate generating functions. In particular we show that moving $3/2$-singularities transfer. Since such kind of singularities are closely related to central limit theorems of the corresponding statistics this methods provides also a kind of transfer of central limit theorems. Actually this method is quite flexible and is applied to a variety of face and pattern counting statistics in map enumeration.
Read the full abstract

Analysis of PDEs

Ergodicity for a Constantin-Lax-Majda-DeGregorio model of turbulent flow

This paper presents a mathematical analysis of a one-dimensional model of turbulence based on a stochastic generalized Constantin-Lax-Majda-DeGregorio (gCLMG) equation. We focus on the specific case where the nonlinearity in the equation allows the existence of the anomalous enstrophy cascade, which is an inviscid conserved quantity, and some effective energy estimates for mathematical analysis. The existence of an invariant measure in the attractor is proved via the classical Krylov-Bogoliubov argument. The uniqueness of the measure and exponential mixing are proved under a sufficiently large viscosity condition, in which the nonlocal structure of the nonlinear term plays a prominent role. The construction of this invariant measure is the first step towards a theoretical understanding of turbulent phenomena that cause anomalous cascades in the zero viscous limit, viewed from the dynamical systems theory.
Read the full abstract

Group Theory

On Posets of Classes of Subgroups with Same Set of Orders of Elements

In this paper, we study the posets of classes of subgroups of finite group having same set of orders of elements. We show that this poset is a chain only in the case of p-groups and moreover, we characterize all finite groups for which this poset is C2, the chain with two elements. We also show that this poset forms a lattice in the case of finite cyclic and dihedral groups and give a characterization when this lattice is distributive and modular.
Read the full abstract

Group Theory

Finiteness conditions on skew braces and solutions of the Yang-Baxter equation

A finite non-degenerate set-theoretic solution $(X,r)$ of the Yang-Baxter equation gives rise to a structure skew brace $B(X,r)$ that is a $\lambda_f$-skew brace, i.e. every element has finitely many $\lambda$-images, and whose additive group is $FC$. This motivates the study of finiteness conditions on skew braces. We first study the general class of $\lambda_f$ skew braces and the subclass where the additive group is $FC$, showing that these properties share a resemblance to finite conjugacy, having an analog of the $FC$-center and several analogous structural results. Furthermore, by passing through the structure skew brace of a solution, this property measures whether elements are contained in a finite decomposition factor, identifying a class of infinite solutions that may exhibit similar properties to finite ones. Finally, we show that for a sub skew brace where both groups have finite index, both indices need to coincide and that such a sub skew brace contains a strong left ideal of finite index.
Read the full abstract

Statistics Theory

Sparse Estimation for High-Dimensional Lévy-driven Ornstein–Uhlenbeck Processes from Discrete Observations

We study high-dimensional drift estimation for Lévy-driven Ornstein–Uhlenbeck processes based on discrete observations. Assuming sparsity of the drift matrix, we analyze Lasso and Slope estimators constructed from approximate likelihoods and derive sharp nonasymptotic oracle inequalities. Our bounds disentangle the contributions of discretization error and stochastic fluctuations, and establish minimax optimal convergence rates under suitable choices of tuning parameters in a high-frequency regime. We further quantify the sample complexity required to attain these rates depending on the Lévy noise. The results extend the theory of high-dimensional statistics for stochastic processes to a substantially broader class of noise mechanisms, in particular pure jump processes. They also demonstrate that Lasso and Slope remain competitive for jump-driven systems, providing practical guidance for inference in applications where Lévy processes are a natural modeling choice.
Read the full abstract

Probability

Existence of measurable versions of stochastic processes

Let $(X, \mfA,P)$, $(Y, \mfB,Q)$ be two arbitrary probability spaces and $\P:=\{(\mfA,P_y):y\in{Y}\}$ be a regular conditional probability (rcp) on $\mfA$ with respect to $Q$. Denote by $R$ the skew product of $P$ and $Q$ determined by $\P$ on the product $\sigma$-algebra $\mfA\otimes\mfB$ and by $\wh{R}$ its completion. I prove that if $(X, \mfA,P)$ is separable in the Fréchet-Nikodým pseudo-metric, then the stochastic process $\{\xi_y:y\in{Y}\}$ has an equivalent measurable modification if and only if it is measurable with respect to a certain particular $\sigma$-algebra larger than $\mfA\otimes\mfB$. The theorem is a strong generalization of \cite[Theorem 5.5]{mms2} and \cite[Theorem 6.1]{smm},where it was proved only that a suitable class of liftings transfer a measurable process into a measurable process. It is known that not every process possesses an equivalent measurable modification (cf. \cite[Section 19.5]{St}). My approach is essentially different from earlier trials. It reverts to \cite[Theorem 3]{ta1}, where Talagrand proved existence of an equivalent separable modification of a measurable process (in case of $R=P\times{Q}$), provided $Y$ is endowed with a separable pseudometric.
Read the full abstract

Group Theory

Haar-Type Measures on Topological Quasigroups and Kunen's Theorem

Haar measure is a fundamental structure in harmonic analysis on locally compact groups. Its existence reflects the compatibility between topology and the associative algebraic structure of groups. In this paper we propose a framework for Haar-type measures on topological quasigroups. Since associativity is absent, strict translation invariance is generally too strong to expect. We therefore introduce quasi-invariant measures whose defect is measured by a modular cocycle attached to translations. We then explain, in a detailed and cautious form, how Moufang-type identities may impose strong constraints on this cocycle. In particular, under additional quasi-invariance assumptions for right translations, the Moufang-type identity $(N1)$ leads naturally to a multiplicativity relation for the cocycle. This suggests a measure-theoretic interpretation of Kunen's theorem: the emergence of loop structure may be viewed as the collapse of a modular defect in the translation geometry of a quasigroup.
Read the full abstract

Information Theory

On the Secrecy Performance of Continuous-Aperture Arrays Over Fading Channels

The secrecy performance of continuous-aperture array (CAPA)-based wiretap channels in terms of secrecy rate and secrecy outage probability (SOP) is analyzed. First, the system models of CAPA systems with maximum-ratio transmission under a Rayleigh fading channel are established, and approximate probability density functions for the legitimate user Bob's signal-to-noise ratio (SNR) and the eavesdropper Eve's SNR are derived using Mercer's theorem and Landau's eigenvalue theorem. Three scenarios are considered, including a single Eve, multiple independent Eves, and multiple collaborative Eves. Next, the expressions of the secrecy rate and SOP under these three scenarios are derived, and the high-SNR slope, high-SNR power offset, diversity order, and array gain in Bob's high-SNR region are obtained. It is then theoretically proven that, in all three scenarios, the CAPA system achieves the same high-SNR slope and the same diversity order, with the latter being equal to the spatial degrees of freedom. Moreover, the CAPA system with a single Eve has the smallest high-SNR offset and the highest array gain, whereas the CAPA system with multiple collaborative Eves exhibits the largest high-SNR offset and the lowest array gain. Finally, the theoretical analyses of secrecy rate, SOP, high-SNR performance are validated by the simulation results, and a higher secrecy rate and a lower SOP are achieved by the CAPA systems compared to the spatially-discrete array systems with half-wavelength antenna spacing.
Read the full abstract

All authors Xuan Yang, Chongjun Ouyang, Dongming Li, Yuanwei Liu

Information Theory · Cross-listed from cs.CR

Alkaid: Resilience to Edit Errors in Provably Secure Steganography via Distance-Constrained Encoding

While provably secure steganography provides strong concealment by ensuring stego carriers are indistinguishable from natural samples, such systems remain vulnerable to real-world edit errors (e.g., insertions, deletions, substitutions) because their decoding depends on perfect synchronization and lacks error-correcting capability. To bridge this gap, we propose Alkaid, a provably secure steganographic scheme resilient to edit errors via distance-constrained encoding. The key innovation integrates the minimum distance decoding principle directly into the encoding process by enforcing a strict lower bound on the edit distance between codewords of different messages. Specifically, if two candidate codewords violate this bound, they are merged to represent the same message, thereby guaranteeing reliable recovery. While maintaining provable security, we theoretically prove that Alkaid offers deterministic robustness against bounded errors. To implement this scheme efficiently, we adopt block-wise and batch processing. Extensive experiments demonstrate that Alkaid achieves decoding success rates of 99% to 100% across diverse error channels, delivers a payload of 0.2 bits per token for high embedding capacity, and maintains an encoding speed of 6.72 bits per second, significantly surpassing state-of-the-art (SOTA) methods in robustness, capacity, and efficiency.
Read the full abstract

All authors Zhihan Cao, Gaolei Li, Jun Wu, Jianhua Li, Hang Zhang, Mingzhe Chen

Dynamical Systems

Design of Hierarchical Excitable Networks

We provide a method to systematically construct vector fields for which the dynamics display transitions corresponding to a desired hierarchical connection structure. This structure is given as a finite set of directed graphs $\mathbf{G}_1,\dotsc,\mathbf{G}_N$ (the lower level), together with another digraph $\mathbf{\Gamma}$ on $N$ vertices (the top level). The dynamic realizations of $\mathbf{G}_1,\dotsc,\mathbf{G}_N$ are heteroclinic networks and they can be thought of as individual connection patterns on a given set of states. Edges in $\mathbf{\Gamma}$ correspond to transitions between these different patterns. In our construction, the connections given through $\mathbf{\Gamma}$ are not heteroclinic, but excitable with zero threshold. This describes a dynamical transition between two invariant sets where every $\delta$-neighborhood of the first set contains an initial condition with $\omega$-limit in the second set. Thus, we prove a theorem that allows the systematic creation of hierarchical networks that are excitable on the top level, and heteroclinic on the lower level. Our results modify and extend the simplex realization method by Ashwin & Postlethwaite.
Read the full abstract

Number Theory

Ramanujan Complexes from Unitary Groups over Number Fields

In this article, we construct new families of Ramanujan complexes with local structure distinct from all previously known examples. Our approach is based on unitary groups over number fields, more specifically on what we call super-definite unitary groups, that is definite unitary groups that are anisotropic modulo their center at a finite place. These arise naturally as groups of units in central division algebras with involution of the second kind. Our first main result gives a general construction of infinite families of Ramanujan complexes associated with a super-definite unitary group $G$ over a totally real number field and a finite place $v_0$. The structure of the resulting complex is governed by the type of the Bruhat-Tits building at $v_0$. It includes new examples of type $A_n$ when $v_0$ is split, and novel families of type ${}^2\!A'_n$, ${}^2 \! A''_n$ (with $n$ even), $B$-$C_n$, ${}^2 \! B$-$C_n$ and $C$-$BC_n$ in the non-split case. This construction works uniformly across all ranks. Since much of the motivation for constructing expander complexes comes from computer science, we investigate the algorithmic explicitness of our construction in the latter part of the paper, and provide an example in rank 5 where it becomes fully explicit. In particular, this example yields golden gates for the real Lie group $PU(5)$.
Read the full abstract

Commutative Algebra

Homogeneous Border Bases on Infinite Order Ideals

Border bases are traditionally restricted to 0-dimensional ideals due to the finiteness of the underlying order ideal. In this paper we extend the theory to homogeneous ideals of positive Krull dimension by introducing homogeneous border bases, defined relative to an infinite order ideal. Moreover, we provide two characterizations of these bases: one via border reductors and, most notably, one in terms of formal multiplication matrices. Although the latter condition a priori requires verification in infinitely many degrees, we prove that it is sufficient to check only finitely many of them, thereby obtaining an effective criterion.
Read the full abstract

Optimization and Control

Policy Iteration Achieves Regularized Equilibrium under Time Inconsistency

For a general entropy-regularized time-inconsistent stochastic control problem, we propose a policy iteration algorithm (PIA) and establish its convergence to an equilibrium policy with an exponential convergence rate. The design of the PIA is based on a coupled system of non-local partial differential equations, called the exploratory equilibrium Hamilton–Jacobi–Bellman (EEHJB) equation. As opposed to the standard time-consistent case, policy improvement fails in general and the target value function (now an equilibrium value function) is not even known to exist a priori. To overcome these, we prove that the value functions generated by the PIA form a Cauchy sequence in a specialized Banach space, hence admit a limit, and the rate of convergence is exponential, on the strength of the Bismut–Elworthy–Li formula of stochastic representation. The limiting value function is shown to fulfill the EEHJB equation, which induces an equilibrium policy in a Gibbs form. Such convergence in value additionally implies uniform convergence of the generated policies to the equilibrium policy, again with an exponential rate. As a byproduct, the PIA gives a constructive proof of the global existence and uniqueness of a classical solution to our general EEHJB equation, whose well-posedness has not been explored in the literature.
Read the full abstract

Group Theory

Groups acting on products of locally finite trees

We examine the question of which finitely generated groups act properly on a finite product of locally finite simplicial trees and present evidence in favour of hyperbolic surface groups having such an action. We also give a completely explicit embedding of the genus 2 closed hyperbolic surface group in $SL_2(\mathbb{F}_p(x,y))$ for any prime $p$.
Read the full abstract

Number Theory

On The Hausdorff Dimension of Weighted Badly Approximable Vectors

Let $\boldsymbol{\tau}=(\tau_1,\dots,\tau_m)\in \mathbb{R}_{\ge 0}^m$ satisfy $\sum_{i=1}^m \tau_i>1$ and $\tau_1\ge \cdots \ge \tau_m$ Let $\Psi_{\boldsymbol\tau}=(\psi_1,\dots,\psi_m)$ be given by $$ \psi_i(q)=q^{-\tau_i}, \qquad i=1,\dots,m,$$ and denote by $\mathcal{A}_m(\Psi_{\boldsymbol\tau})$ the set of $\Psi_{\boldsymbol\tau}$-approximable vectors in $[0,1]^m$. The associated set of weighted $\Psi_{\boldsymbol\tau}$-badly approximable vectors is defined by $$\mathcal{B}_m(\Psi_{\boldsymbol\tau}) = \mathcal{A}_m(\Psi_{\boldsymbol\tau}) \setminus \bigcap_{0<c<1}\mathcal{A}_m(c\Psi_{\boldsymbol\tau}).$$ The main result of this paper is that, for every ball $B\subseteq [0,1]^m$, \[ \dim_{\mathcal{H}}\bigl(B\cap \mathcal{B}_m(\Psi_{\boldsymbol\tau})\bigr) = \dim_{\mathcal{H}}\mathcal{A}_m(\Psi_{\boldsymbol\tau}). \] The proof extends the Cantor-type construction and mass distribution arguments of Koivusalo, Levesley, Ward, and Zhang from the unweighted to the weighted setting, and is independent of recent results on weighted exact approximation.
Read the full abstract

Quantum Algebra

Short star products for quantum symmetric pairs and applications

We prove that the star product for quantum symmetric pair coideal subalgebras is short. We apply this result to obtain new conceptual proofs, from first principles, of several fundamental facts about quantum symmetric pairs. In particular, we establish the existence of the algebra anti-automorphism $\sigma_\tau$ and of the bar involution, without making use of the quasi K-matrix. We give a new elementary proof of a conjecture by Balagović and Kolb, sometimes referred to as the fundamental lemma for quantum symmetric pairs. We obtain a conceptual formula expressing the tensor quasi K-matrix in terms of the much studied quasi R-matrix and the Letzter map. This also allows for a new independent proof of the intertwiner property of the quasi K-matrix.
Read the full abstract

Functional Analysis

Compact embeddings of generalised Morrey smoothness spaces on bounded domains

We study embeddings within different scales of generalised smoothness Morrey spaces defined on bounded smooth domains, i.e., in $\mathcal{N}^s_{\varphi,p,q}(\Omega)$, $\mathcal{E}^s_{\varphi,p,q}(\Omega)$, $B^{s,\varphi}_{p,q}(\Omega)$ and $F^{s,\varphi}_{p,q}(\Omega)$ spaces. We prove sufficient conditions for continuity and compactness of the embeddings. In some cases the conditions are also necessary. We generalise and even improve some earlier results known for the classical smoothness Morrey spaces. Our approach is based on wavelet characterisation of the function spaces.
Read the full abstract