Peer Revenue Play credits. Real papers.

Papers

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

Mathematics

math Watch Mathematics (sign in to use)

Wednesday 8 April

Group Theory

Non-split sharply 2- and 3-transitive groups in SL_n(\mathbb Z)

We prove that $\mathrm{SL}_3(\mathbb{Z})$ contains a non-split sharply 2-transitive subgroup, answering a question of Glasner and Gulko. We also prove that $\mathrm{SL}_4(\mathbb{Z})$ contains a non-split sharply 3-transitive subgroup, but that $\mathrm{SL}_3(\mathbb{Z})$ does not contain an infinite sharply 3-transitive subgroup.
Read the full abstract

Combinatorics

Vertex-critical graphs in subfamilies of $(P_4+\ell P_1)$-free graphs

A graph $G$ is $k$-vertex-critical if $\chi(G)=k$ but $\chi(G-v)<k$ for all $v\in V(G)$. In this paper we make progress on the open problem of the finiteness of $k$-vertex-critical $(P_4+\ell P_1)$-free graphs by showing that there are only finitely many $k$-vertex-critical graphs in the following subfamilies of $(P_4+\ell P_1)$-free graphs for all $k\ge 1$ and $\ell\ge 0$: $\bullet$ $(P_4+\ell P_1,\text{chair})$-free graphs, $\bullet$ $(P_4+\ell P_1,P_5,\text{bull})$-free graphs, and $\bullet$ $(P_4+\ell P_1,P_5,\text{cricket})$-free graphs. In fact, all but the first of these are special cases of our general result that there are only finitely many $k$-vertex-critical $(P_4+\ell P_1,B_{4}(m),B_{3}(m)^{+})$-free graphs for all $k\ge 1$ and $\ell,m\ge 0$. Here $B_{n}(m)$ is the graph obtained from a path of order $n$ by identifying one of its leaves with the centre vertex of $K_{1,m}$ and $B_{n}(m)^{+}$ is the graph obtained by identifying an edge of $K_3$ with the edge of $B_{n}(m)$ with endpoints of degrees $2$ and $m$, respectively. Our results imply the existence of simple polynomial-time certifying algorithms to decide the $k$-colourability of all graphs in these subfamilies for every fixed $k$. We also show that $\chi(G)\le \ell+2$ for all $(P_4+\ell P_1,K_3)$-free graphs and all $\ell\ge 0$, improving the previously known upper bound of $2\ell+2$ that followed from Randerath and Schiermeyer's 2004 result on $(P_t,K_3)$-free graphs. More generally, we provide a $\chi$-bound in $O(\ell^{\omega-1})$ for $(P_4+\ell P_1)$-free graphs which improves the bound of $(2\ell+2)^{\omega-1}$ which followed from Gravier, Hoàng and Maffray in 2003 for $P_{t}$-free graphs.
Read the full abstract

Operator Algebras

The RFD property for graph $C^*$-algebras

It is proved that the C*-algebra of a graph is residually finite dimensional (RFD) if and only if the graph has no infinite receiver, no cycle with an exit, no infinite ackward chain and from each vertex, there is a finite path to a sink or a cycle or an infinite emitter.

Algebraic Geometry

The Deligne-Simpson problem via 2-Calabi-Yau categories

We provide a short proof of the necessity of Crawley-Boevey's condition in his solution to the Deligne-Simpson problem. The proof relies on the local neighbourhood theorem for $2$-Calabi-Yau categories due to Davison together with Crawley-Boevey's sufficient condition for the existence of local systems with prescribed conjugacy classes of monodromy around the punctures.
Read the full abstract

Operator Algebras

Selfless reduced amalgamated free products and HNN extensions

We find a general family of selfless inclusions in reduced amalgamated free products of C*-algebras. Apart from generalizing prior works due to McClanahan, Ivanov and Omland, our work yields a few other applications. We present a short new approach to construct HNN extensions of C*-algebras and find several new examples of selflessness using this. This generalizes results of Ueda, Ivanov and de la Harpe-Preaux. As another application our work yields a short proof of selflessness for arbitrary graph products of C*-algebras over graphs of more than 2 vertices and diameter greater than 3.
Read the full abstract

All authors David Gao, Srivatsav Kunnawalkam Elayavalli, Gregory Patchell, Lizzy Teryoshin

Analysis of PDEs

Global UCP For Parabolic Fractional $p$-Laplace Equation With Very Rough Potentials

We show that the global unique continuation principle holds for the parabolic fractional $p-$Laplace equation with very rough potentials $V(x,t) \in L^{p'}_tW^{-s,p'}_x$. Whereas the result is new even for the fractional $p-$Laplace operator, the corresponding local problem remains open even with zero potential. The short proof eschews extension techniques and Carleman estimates.
Read the full abstract

Algebraic Geometry

A note on complex Lie Algebras isomorphic to their conjugate

A real Lie algebra defines by extension of scalars a complex Lie algebra that is isomorphic to its Galois conjugate. In this paper, we are interested in the converse property: given a complex Lie algebra that is isomorphic to its conjugate, is it defined over the real numbers? We prove the existence of a $10$-dimensional nilpotent complex Lie algebra for which the answer is negative, disproving a recent conjecture by Deré. In addition, we compute the generic obstruction to this descent problem in terms of Brauer groups.
Read the full abstract

Functional Analysis

von Neumann Inequality for a class of Doubly Contractive Weighted Shifts

In this article, we investigate the ball version of von Neumann inequality for the class of doubly contractive $d$-tuple of weighted shift. We show that if the weighted shift is balanced or satisfies an appropriate weight condition, then it admits a spherical unitary dilation. Consequently, such tuples satisfy the von Neumann inequality over Euclidean unit ball. For the general class of commuting tuple of doubly contractive operators (not necessarily weighted shift) on a Hilbert space, we further establish von Neumann inequality for homogeneous polynomials of degree at most $2.$
Read the full abstract

Information Theory · Cross-listed from eess.SP

The Gaussian data assumption does not always lead to the largest CRB

This lecture note addresses the common misconception that the Gaussian distribution always yields the largest Cramér-Rao Bound (CRB). We show that this property only holds under restrictive conditions: specifically, when the mean and covariance parameters are decoupled in the Fisher Information Matrix (FIM), when the parameter of interest lies in the mean vector and when there are no additive nuisance parameters. Beyond this framework, we provide counterexamples demonstrating that non-Gaussian distributions can produce larger CRB.
Read the full abstract

Group Theory

A criterion for Tits alternative on the centralizer of a matrix

We give a necessary and sufficient condition on a matrix for its centralizer in $\sf{GL}(n,\mathbb{Z})$ to be polycyclic, or equivalently in this case, not to contain a non-abelian free subgroup. We give a simple condition on the matrix ensuring that it is abelian. This can be thought of as an effective Tits alternative on centralizers in $\sf{GL}(n,\mathbb{Z})$. We apply these criteria to the conjugacy problem in certain arithmetic groups preserving a non-degenerate $\mathbb{Q}$-bilinear form, such as integral symplectic groups. We derive an effective solution to the conjugacy problem in such groups when given matrices satisfy the above criterion. This solution is based on effective solutions to the conjugacy problem in $\sf{GL}(n,\mathbb{Z})$ by Eick-Hofmann-O'Brien and to an orbit problem for polycyclic groups, by Eick and Ostheimer.
Read the full abstract

Analysis of PDEs · Cross-listed from physics.flu-dyn

Solitary wave structure of transitional flow in the wake of a sphere

The soliton-like coherent structure (SCS), which has been verified to exist in both transitional and turbulent boundary layers1-4, still poses a challenge in the understanding of its formation and behavior. In our previous study (Niu et al.5), the SCS was also found to exist in the transitional wake flow behind a sphere. In present study, the formation and evolution of the SCS is further investigated at four Reynolds numbers by numerical simulation. The results show that at the early stage of the turbulence transition, the SCS appears as a form of wave packet during the Tollmien-Schlichting (T-S) wave stage. With the increase of the Reynolds number, the SCS reaches its maximum amplitude downstream where the velocity discontinuity occurs. This position is located after the breakdown of the T-S wave and the three-dimensional structure is formed. Then, the SCS conserves its shape and amplitude over a long distance downstream. The relationships among the SCS, the spikes, the vortex structures, and the high-shear layers are further analyzed. It is found that the SCS in the wake flow has similarities to the phenomena observed in boundary layer flows during the turbulent transition. The vortex structures and high-shear layers mostly wrap around the border of the SCS. The vortex structure is considered to be as a consequence of the development of the SCS rather than its cause.
Read the full abstract

All authors Lin Niu, Hua-Shu Dou, Changquan Zhou, Wenqian Xu

Functional Analysis

Carleson families of cubes related to porous sets

Given a porous set $E\in \mathbb{R}^d$ and a dyadic lattice $\mathcal{D}$, we refine the Carleson packing condition and the sparseness property for the dyadic cover $\mathcal{D}_E=\{Q \in \mathcal{D}: \: Q \cap E \neq \varnothing\}$. We study the inverse problem, when a Carleson family $\mathcal{S} \subset \mathcal{D}$ generates the porous set $E$ such that $\mathcal{S} \subset \mathcal{D}_E$.
Read the full abstract

Number Theory

Arithmetic intersections on non-split Cartan modular curves

Let $p$ be a prime number, and let $\Delta_1,\Delta_2 < 0$ be two coprime fundamental discriminants. When $p$ splits in $\mathbb{Q}(\sqrt{\Delta_1})$ and $\mathbb{Q}(\sqrt{\Delta_2})$ the height pairings of the corresponding CM divisors on $X_{\mathrm{spl}}^+(p)$ were determined by Gross–Kohnen–Zagier [GKZ87]. When $p$ is inert, we determine the arithmetic intersection numbers of the corresponding divisors on $X_{\mathrm{ns}}^+(p)$ at all finite primes. The key point of our analysis is at the prime of bad reduction $p$: to determine the intersection numbers at $p$, we provide a moduli interpretation for the smooth locus in the regular model of $X_{\mathrm{ns}}^+(p)$ over $\mathrm{Spec}(\mathbb{Z})$ constructed by Edixhoven–Parent [EP24].
Read the full abstract

Differential Geometry

Multidimensional cost geometry

In this paper, we study the geometric structure induced by the canonical reciprocal cost function and its natural $n$-dimensional extension. In logarithmic coordinates, the potential depends only on the linear combination $S=\alpha\cdot t$, and the associated Hessian metric has rank one at every point. The geometry is intrinsically degenerate and effectively one-dimensional, with an $(n-1)$-dimensional null distribution. On the other hand, when the same function is expressed in the original $x$-coordinates, the corresponding Hessian is generically nondegenerate and defines a pseudo-Riemannian metric away from explicit singular hypersurfaces. We further analyze affine and Levi-Civita geodesics and compare their behavior. In particular, affine geodesics in logarithmic coordinates are globally defined, while in $x$-coordinates their behavior is restricted by the domain and the singular set. Finally, we relate the construction to symmetrized Itakura-Saito and Bregman divergences, and give a Fisher-Rao realization of the logarithmic Hessian metric.
Read the full abstract

Symplectic Geometry

On the Rigidity of Hamiltonians which are Zoll Near a Minimum, with an Application to Magnetic Systems and Almost-Kähler Manifolds

We study Hamiltonian systems near a compact symplectic Morse-Bott minimum. Our first result shows that if the flow is Zoll (that is, it induces a free circle action) along a sequence of energy levels converging to the minimum, then the Hessian of the Hamiltonian in the symplectic normal directions must be compatible with the restriction of the symplectic structure to the normal bundle (that is, its representing endomorphism is a complex structure of the symplectic normal bundle). For our second result, we specialize to magnetic systems on closed manifolds with symplectic magnetic form. In this setting, if the system is Zoll along a sequence of energy levels converging to the minimum, then the metric is compatible with the magnetic form and therefore defines an almost Kähler structure. We show that a natural curvature quantity, consisting of the holomorphic sectional curvature corrected by a term measuring the non-integrability of the almost complex structure, must be constant. In particular, we obtain a dynamical characterization of complex space forms among Kähler manifolds. Together, these results establish strong rigidity of systems which are Zoll at energies close to a Morse-Bott minimum, in the symplectic and in the magnetic settings.
Read the full abstract

Numerical Analysis

Continuum dynamics from quantised interaction rules

Hyperbolic conservation laws are conventionally solved by evolving reconstructed floating-point fields, incurring both computational overhead and structural diffusion near discontinuities. Here we introduce the Fast Quantised Numerical Method (FQNM), in which the conservative operator is realised directly as an antisymmetric integer transfer rule on a countable state space, with continuum fields appearing only as reconstructed observables. For scalar conservation laws with monotone flux splitting, we establish exact conservation, monotonicity, TVD and $L^1$ stability, and convergence of the reconstructed solution to the entropy solution under $\delta/\Delta x \to 0$. We further show that distinct classical flux formulations collapse to identical dynamics whenever they induce the same integer transfer rule, identifying the transfer operator as the effective computational object. Across representative regimes, FQNM remains stable near the Nyquist limit in high-frequency transport, preserves grid-level shock structure in Burgers dynamics, and in a matched Roe-flux Sod prototype preserves shock structure at the density-scale conserved-state level relative to an exact Riemann reference, while achieving order-of-magnitude prototype acceleration over floating-point baselines. These results demonstrate that, for conservative hyperbolic dynamics, executing the operator as quantised transfer rather than reconstructed field evolution can simultaneously alter structural fidelity and reduce computational cost, establishing a new representation paradigm for conservation-law solvers.
Read the full abstract

Information Theory · Cross-listed from cs.CR

Empirical Ciphertext Distinguishability Testing of KEMs and Hybrid Encryption via Deep Learning

We model indistinguishability under chosen-plaintext attack (IND-CPA) games as binary classification tasks for deep neural networks (DNNs). We apply this methodology to the public-key encryption (PKE) schemes used to construct PQC key encapsulation mechanisms (KEMs) such as ML-KEM and HQC, and to cascaded symmetric algorithms, demonstrating methodological generality. Moreover, we present a novel extension of this approach to empirical distinguishability testing of hybrid KEMs. For IND-CPA-secure schemes and their combinations, no DNN achieves accuracy significantly different from random guessing (measured via Bonferroni-corrected binomial tests), consistent with theoretical security guarantees. For insecure schemes, such as plain RSA, AES-CTR and AES-CBC with IV or counter reuse, or RC4, the DNNs classify the ciphertexts better than random guessing. Thus, this framework is shown to serve as a practical, scheme-agnostic tool for flagging distinguishable ciphertexts in both individual and composed constructions.
Read the full abstract

Optimization and Control

Adaptive Distributionally Robust Optimal Control with Bayesian Ambiguity Sets

In stochastic optimal control (SOC), uncertainty may arise from incomplete knowledge of the true probability distribution of the underlying environment, which is known as Knightian or epistemic uncertainty. Distributionally robust optimal control (DROC) models are subsequently proposed to tackle this source of uncertainty. While such models are effective in some practical applications, most existing DROC models are offline and can be overly conservative when data are scarce. Moreover, they cannot be applied to the case when samples are generated episodically. Motivated by the Bayesian SOC framework recently proposed by Shapiro et al.~\cite{shapiro2025episodic}, we propose an adaptive DROC model in which the ambiguity set is updated via Bayesian learning from new data. Under some moderate conditions, we derive a tractable risk-averse reformulation, establish consistency of the optimal value function and optimal policy for an infinite-horizon SOC and establish a finite-sample posterior credibility guarantee for the policy value induced by the proposed episodic Bayesian DROC model. We also study the stability and statistical robustness of the proposed model with respect to sample perturbations that often arise in data-driven environments. To solve the episodic Bayesian DROC model, we propose a Bellman-operator cutting-plane (BOCP) algorithm that is computationally efficient and provably convergent. Numerical results on an inventory control problem demonstrate the effectiveness, adaptivity, and robust performance of the proposed model and algorithm.
Read the full abstract

All authors Wentao Ma, Zhiping Chen, Huifu Xu, Enlu Zhou

Optimization and Control

Continuous-Time Dynamics of the Difference-of-Convex Algorithm

We study the continuous-time structure of the difference-of-convex algorithm (DCA) for smooth DC decompositions with a strongly convex component. In dual coordinates, classical DCA is exactly the full-step explicit Euler discretization of a nonlinear autonomous system. This viewpoint motivates a damped DCA scheme, which is also a Bregman-regularized DCA variant, and whose vanishing-step limit yields a Hessian-Riemannian gradient flow generated by the convex part of the decomposition. For the damped scheme we prove monotone descent, asymptotic criticality, Kurdyka-Lojasiewicz convergence under boundedness, and a global linear rate under a metric DC-PL inequality. For the limiting flow we establish an exact energy identity, asymptotic criticality of bounded trajectories, explicit global rates under metric relative error bounds, finite-length and single-point convergence under a Kurdyka-Lojasiewicz hypothesis, and local exponential convergence near nondegenerate local minima. The analysis also reveals a global-local tradeoff: the half-relaxed scheme gives the best provable global guarantee in our framework, while the full-step scheme is locally fastest near a nondegenerate minimum. Finally, we show that different DC decompositions of the same objective induce different continuous dynamics through the metric generated by the convex component, providing a geometric criterion for decomposition quality and linking DCA with Bregman geometry.
Read the full abstract

Mathematical Physics

Variational derivation of the homogeneous Boltzmann equation

We introduce a variational formulation of the homogeneous Boltzmann equation, with hard-sphere cross section, which selects the unique energy conserving solution. We prove that this solution arises from the microscopic dynamics, namely Kac's walk, and we establish the propagation in time of entropic chaoticity, under the minimal assumption that the initial distribution is entropically chaotic.
Read the full abstract

Optimization and Control

Multi-layer Predictor Feedback Design for Nonlinear Integro-Differential Equations with State-dependent Input Delays

We develop a novel multi-layer predictor-feedback to achieve exact compensation of state-dependent input delay of general nonlinear integro-differential equations. The system of interest is an unconventional mixed Partial Differential Equation (PDE)-Ordinary Differential Equation (ODE) system, in which a nonlinear ODE is actuated through an inhomogeneous advection PDE. Moreover, the propagation speed of the PDE depends on a moving window integral of the ODE state. The two above features are not addressed yet in standard PDE backstepping-based predictor-feedback designs. Unlike the conventional Lyapunov-based approaches used in the field, our stability and well-posedness analysis rely on the characteristic method and a fixed-point argument. Both of our designs achieve global asymptotic stability (GAS) in the supremum norm of the PDE and ODE states under the mild assumption that the nonlinearity in the PDE governing equation is uniformly Lipschitz continuous. The transport speed, governed by the integral of the ODE state, models systems such as production or queuing processes in which the state of a finite buffer-namely, the inventory level-determines the production or service rate. Numerical simulations demonstrate the effectiveness of the proposed control design for buffer-regulated production lines and queuing systems, ensuring asymptotic stability under a locally safe softened bang-bang feedback law that preserves the positivity of both the system state and the actuation signal.
Read the full abstract

Numerical Analysis

A discontinuous Galerkin method for elliptic-hyperbolic equations: the Tricomi problem

We present and analyze a discontinuous Galerkin method for the numerical solution of a class of second-order linear mixed-type partial differential equations, i.e. equations that change their nature from elliptic to hyperbolic through the computational domain. Well-posedness of the discrete problem is established via coercivity in an energy norm, achieved through the Morawetz multiplier technique. We derive $hp$-a priori error estimates in the energy norm, which we use to prove convergence rates for standard and quasi-Trefftz polynomial spaces. Numerical experiments validate the theoretical results.
Read the full abstract

All authors Chiara Perinati, Lise-Marie Imbert-Gérard, Andrea Moiola, Paul Stocker

Optimization and Control

Mini-Batch Stochastic Krasnosel'ski\u\i-Mann Algorithm for Nonexpansive Fixed Point Problems

The Krasnosel'ski\u\i-Mann algorithm is a well-known method for finding fixed points of a nonexpansive mapping with strong theoretical guarantees. However, there are practical large-scale problems to which this algorithm cannot be applied. Here, to resolve the issue caused by the computational difficulty of the mapping, we define a computable mini-batch stochastic mapping, which is a unbiased estimator of the nonexpansive mapping, and implement it in the Krasnosel'ski\u\i-Mann algorithm. We show that the algorithm with increasing batch sizes converges almost surely to a fixed point of the nonexpansive mapping. We also perform a convergence rate analysis on the algorithm.
Read the full abstract

Information Theory · Cross-listed from quant-ph

Quantum Relative-alpha-Entropies: A Structural and Geometric Perspective

Most quantum divergences derive their structure from classical f-divergences or Renyi-type constructions, a dependence that obscures several quantum geometric effects. We introduce a quantum relative-alpha-entropy that extends Umegaki's relative entropy while falling outside the f-divergence class. The proposed divergence exhibits a nonlinear convexity property, which yields a generalized convexity result for the Petz-Renyi divergence for alpha greater than one, complementing the known convexity for alpha less than one. It is additive under tensor products, invariant under unitary transformations, and depends only on the relative geometry of quantum states rather than their absolute magnitudes. Using Nussbaum-Szkola-type distributions, we also establish an exact correspondence of this divergence with classical relative-alpha-entropy. This reveals relative-alpha-entropy as a fundamentally geometric notion of quantum distinguishability not captured by existing divergence frameworks.
Read the full abstract

All authors Sayantan Roy, Atin Gayen, Aditi Kar Gangopadhyay, Sugata Gangopadhyay

Combinatorics

Topological Indices of Divisor Prime Graphs

Graph theory provides powerful tools for modeling concepts in number theory, leading to the introduction of graphs derived from arithmetic properties. One such structure is the divisor prime graph, $G_{Dp(n)}$. For any positive integer $n$, let $D(n)$ be the set of its positive divisors. The vertex set of $G_{Dp(n)}$ consists of the elements of $D(n)$, with the adjacency condition that two vertices $x$ and $y$ share an edge if and only if their greatest common divisor is $1$. The primary focus of this study is to evaluate the topological characteristics of $G_{Dp(n)}$. To achieve this, we analyze and compute various distance and degree-based indices, specifically focusing on the Wiener, Harary, hyper-Wiener, First and Second Zagreb, Schultz, Gutman, and Eccentric connectivity indices.
Read the full abstract

Analysis of PDEs

Inverse problems for the spectral fractional Laplacian with inhomogeneous Dirichlet boundary data

In this paper, we study the spectral fractional Laplacian with inhomogeneous Dirichlet boundary data. Our contributions are twofold: first we introduce a Dirichlet-to-Neumann map for this operator and analyze an associated inverse problem; and second we establish an additional density result for the spectral fractional Laplacian.
Read the full abstract

Information Theory

Affine Subcode Ensemble Decoding of Linear Block Codes

In the short block length regime, ensemble decoding schemes with their inherently parallel structure can improve error correction performance and reduce latency compared to stand-alone suboptimal decoders such as belief propagation (BP). In this work, we introduce affine subcode ensemble decoding (aSCED), which uses an ensemble of decoders operating on linear block codes and both linear and strictly affine subcodes. This generalizes the recently proposed subcode ensemble decoding (SCED), which is restricted to linear subcodes. We derive BP update rules for affine subcodes and show that aSCED simplifies ensemble design compared to SCED, multiple bases BP, and automorphism ensemble decoding. Monte-Carlo simulations of two low-density parity-check codes and two Bose-Chaudhuri-Hocquenghem (BCH) codes demonstrate improved error correction performance of aSCED over competing existing ensemble schemes. Notably, for one BCH code, when combining ensemble design with algorithms for constructing high-performance parity-check matrices, aSCED achieves near-maximum likelihood performance using only 64 BP decoding paths.
Read the full abstract

All authors Jonathan Mandelbaum, Paul Bezner, Holger Jäkel, Stephan ten Brink, Laurent Schmalen

Analysis of PDEs

Inverse problems for a coupled system of wave equations with point source-receiver data

The present manuscript consists of inverse problems for a coupled system of wave equations with potential in $\mathbb{R}^3$. By establishing the fundamental solution to the aforementioned operator, we study the uniqueness aspects of the inverse problem of recovering the matrix-valued potential coefficient from time-dependent measurements. We consider these inverse problems in two different cases: (i) the coincident setup, where the source and receiver are located at a single point, and (ii) the non-coincidence or separated setup, in which case source and receiver are situated at distinct locations. The problems considered here are under-determined; hence, some additional assumptions for the potential are expected to guarantee the uniqueness of the inverse problems considered in this article. We proved the desired uniqueness results under some extra assumptions on the coefficients.
Read the full abstract

Analysis of PDEs

Leray-Trudinger Type Exponential Integrability in Log-Weighted Sobolev Spaces

In this article, we conduct a comprehensive study of weighted Sobolev spaces with logarithmic weights, orginially introduced by Calanchi and Ruf to analyze the sharp exponential integrability of radial functions belonging to these spaces. By exploring the connection between these logarithmically weighted energies and the Leray energy, we expand the framework to incorporate non-radial functions. More precisely, we establish optimal exponential integrability for general functions in the spirit of optimal Leray-Trudinger inequalities established by Di Blasio, Pisante and Psaradakis. Furthermore, we prove sharp versions of these inequalities when restricted to radial functions. Notably, the inequalities presented here are fundamentally different in nature from those of Calanchi and Ruf, for which the non-radial extension fails to hold.
Read the full abstract

Algebraic Geometry

A symplectic fourfold

We present a method to construct irreducible symplectic varieties by studying terminalisations of quotient of hyper-Kähler manifolds by non-natural group actions. In particular, we construct irreducible symplectic varieties of dimension $4$ with $b_2 = 4$ and non-quotient singularities: this provides explicit examples of ISVs for which a global Torelli theorem is not known to hold.
Read the full abstract

All authors Maria Donten-Bury, Grzegorz Kapustka, Benedetta Piroddi, Tomasz Wawak