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)

Monday 2 March

Number Theory

An estimate for incomplete mixed character sums and applications

Let $q$ be a prime power and $m>1$ be any integer. Let $\mathbb F_{q^m}$ be the finite field of order $q^m$ and $\theta\in\mathbb F_{q^m}$ be such that $\mathbb F_{q^m} = \mathbb F(\theta)$. We obtain a nontrivial bound for the mixed character sum $\sum_{x \in\mathbb F}\chi(\theta+x)\psi(x)$, where $\chi$ and $\psi$ are multiplicative and additive characters of $\mathbb F_{q^m}$ and $\mathbb F$, respectively, using function field methods. As an application of our main result, we prove that for fixed $m$ and sufficiently large prime powers $q$, that satisfy certain conditions, $\mathbb F_{q^m}/\mathbb F$ possesses the weak line property for primitive normal elements. In particular, our result is a strengthening of existing results.
Read the full abstract

All authors Arpan Chandra Mazumder, Giorgos Kapetanakis, Sushant Kala, Dhiren Kumar Basnet

Probability

Random Walks on Virtual Persistence Diagrams

In the uniformly discrete case of virtual persistence diagram groups $K(X,A)$, we construct a translation-invariant heat semigroup. The kernels are supported on a countable subgroup $H$, and the restriction to $H$ has Fourier exponent $\lambda_H$ satisfying $\lambda_H(\theta)=\sum_{\kappa\in H\setminus\{0\}}\bigl(1-\Re\theta(\kappa)\bigr)\nu(\kappa),$ for a symmetric $\nu\in\ell^1(H\setminus\{0\})$. This gives a symmetric jump process on $H$. The exponent $\lambda_H$ determines heat kernels, which define reproducing kernel Hilbert spaces and their associated semimetrics. Convex orders on the mixing measures give monotonicity for the kernels, Hilbert spaces, and semimetrics.
Read the full abstract

Combinatorics

Horizontal Kakeya maximal operators in finite Heisenberg groups: Exact exponents and applications

Let $q$ be an odd prime power. We study Kakeya maximal operators associated with horizontal lines in the finite Heisenberg groups $\mathbb H_n(\mathbb F_q)$. Our principal object is the refined-direction maximal operator, whose parameter records the projective horizontal direction together with the central homogeneous coordinate determined by horizontality. In rank one, we prove \[ \|M_{\mathbb H_1}^{\mathrm{rd}}F\|_{\ell^2(\mathcal D_1)} \lesssim q^{\frac{1}{2}} \|F\|_{\ell^2(\mathbb H_1(\mathbb F_q))}, \] where the exponent $\frac{1}{2}$ is sharp. Combining this estimate with endpoint bounds and interpolation, we determine the exact mixed-norm growth exponent: \[ A^{\mathrm{rd}}_1(u,v) = \max\left\{ \frac1v,\, 1-\frac1u,\, \frac2v-\frac1u,\, 1+\frac2v-\frac3u \right\}, \qquad 1\le u,v\le\infty. \] As a consequence, if $E\subset\mathbb H_1(\mathbb F_q)$ meets, in at least $m$ points, a horizontal line in each refined direction from $\Omega\subset D_1$, then \[ |E|\gtrsim \frac{m^2|\Omega|}{q}. \] As a benchmark, we also analyze the coarser operator parameterized only by projective horizontal directions and determine its exact $\ell^u\to\ell^v$ growth exponent in every rank. In rank one, this benchmark is established by a self-contained $TT^*$ argument rather than polynomial vanishing, and the same planar estimate reappears as the zero-central-frequency component of the refined-direction proof. The nonzero central frequencies are controlled by Plancherel, character orthogonality, and a bounded-fiber property of an explicit quadratic map. Thus, the sharp refined-direction estimate is obtained by purely Fourier-analytic methods.
Read the full abstract

All authors Thang Pham, Andrea Pinamonti, Dung The Tran, Boqing Xue

Differential Geometry

Generalization of the catenary in the dual plane

In this paper, we study a dual analogue of the classical catenary within the class of admissible curves in the dual plane $\mathbb{D}^2$. We introduce $\alpha$-catenaries in $\mathbb{D}^2$ as stationary points of a potential energy functional, where $\alpha\in \mathbb{R}$ is a real parameter. We derive the corresponding Euler-Lagrange equations and obtain explicit equations of these curves for specific values of $\alpha$. Furthermore, we establish a geometric characterization of $\alpha$-catenaries in terms of their curvature and unit normal vector field.
Read the full abstract

Optimization and Control

Solving Convex Quadratic Optimization with Indicators Over Structured Graphs

This paper studies convex quadratic minimization problems in which each continuous variable is coupled with a binary indicator variable. We focus on the structured setting where the Hessian matrix of the quadratic term is positive definite and exhibits sparsity. We develop an exact parametric dynamic programming algorithm whose computational complexity depends explicitly on the treewidth of the Hessian's support graph, its volume growth, and an appropriate margin parameter. Under suitable structural conditions, the overall complexity scales linearly with the problem dimension. To demonstrate the practical impact of our approach, we introduce a novel framework for joint forecasting and outlier detection by extending exponential smoothing to time series with outliers. Computational experiments on both synthetic and real data sets show that our method significantly outperforms state-of-the-art solvers.
Read the full abstract

All authors Aaresh Bhathena, Salar Fattahi, Andrés Gómez, Simge Küçükyavuz

Combinatorics

Sampling from the antiferromagnetic Ising model on bipartite, regular expander graphs

The antiferromagnetic Ising model samples subsets of vertices of a graph with weight decaying exponentially in the number of edges induced. We study the problem of sampling from this model on the class of bipartite, regular graphs with good vertex expansion. We show that a natural sampler, namely the Glauber dynamics, mixes exponentially slowly in a wide range of parameters. On the other hand, we give an efficient alternative algorithm for sampling from the Ising model and an FPTAS for its partition function, using polymer models and the cluster expansion method.
Read the full abstract

All authors Anna Geisler, Mihyun Kang, Michail Sarantis, Ronen Wdowinski

Geometric Topology

Coexact $1$-form spectral gaps of hyperbolic rational homology spheres

We discuss a construction of families of hyperbolic rational homology spheres with coexact $1$-form spectral gap uniformly bounded below which is well-suited for explicit computations. Using this, we provide several disjoint intervals containing a limit point of such spectral gaps, the rightmost of which is $[0.8196,0.8277]$. Furthermore, we also exhibit a family of arithmetic examples, answering a question of Abdurrahman-Adve-Giri-Lowe-Zung.
Read the full abstract

Optimization and Control · Cross-listed from cs.LG

Adam Converges Without Any Modification On Update Rules

Adam is the default algorithm for training neural networks, including large language models (LLMs). However, \citet{reddi2019convergence} provided an example that Adam diverges, raising concerns for its deployment in AI model training. We identify a key mismatch between the divergence example and practice: \citet{reddi2019convergence} pick the problem after picking the hyperparameters of Adam, i.e., $(\beta_1,\beta_2)$; while practical applications often fix the problem first and then tune $(\beta_1,\beta_2)$. In this work, we prove that Adam converges with proper problem-dependent hyperparameters. First, we prove that Adam converges when $\beta_2$ is large and $\beta_1 < \sqrt{\beta_2}$. Second, when $\beta_2$ is small, we point out a region of $(\beta_1,\beta_2)$ combinations where Adam can diverge to infinity. Our results indicate a phase transition for Adam from divergence to convergence when changing the $(\beta_1, \beta_2)$ combination. To our knowledge, this is the first phase transition in $(\beta_1,\beta_2)$ 2D-plane reported in the literature, providing rigorous theoretical guarantees for Adam optimizer. We further point out that the critical boundary $(\beta_1^*, \beta_2^*)$ is problem-dependent, and particularly, dependent on batch size. This provides suggestions on how to tune $\beta_1$ and $\beta_2$: when Adam does not work well, we suggest tuning up $\beta_2$ inversely with batch size to surpass the threshold $\beta_2^*$, and then trying $\beta_1< \sqrt{\beta_2}$. Our suggestions are supported by reports from several empirical studies, which observe improved LLM training performance when applying them.
Read the full abstract

All authors Yushun Zhang, Bingran Li, Congliang Chen, Zhi-Quan Luo, Ruoyu Sun

History and Overview of Mathematics

Looping Animations Using the Modular Flow and Elliptic Functions

This paper describes an approach to generating looping animations using the modular flow and elliptic functions. The modular flow is a flow on lattices with many periodic orbits, and elliptic functions are meromorphic, doubly-periodic functions which can be visualized using domain coloring.
Read the full abstract

Numerical Analysis

Reinforcement Learning-Based Filters for Convection-Dominated Flows: Reference-Free and Reference-Guided Training

We propose a reinforcement learning (RL) framework for the dynamic selection of the filter parameter in Evolve-Filter (EF) regularization strategies for incompressible turbulent flows. Instead of prescribing the filter radius heuristically, the RL agent learns to adaptively control the filtering intensity in time, balancing numerical stability and physical accuracy. The methodology is assessed on two benchmark problems with fundamentally different dynamics: flow past a cylinder and decaying homogeneous turbulence. Both reference-guided and reference-free reward formulations are investigated. In the reference-guided setting, the agent is trained using direct numerical simulation (DNS) data over a limited time window and then evaluated in extrapolation. In the reference-free setting, the reward relies exclusively on physics-based quantities, without access to reference solutions, i.e., completely eliminating the computational costs related to DNS simulations. The results show that the proposed RL-EF strategies prevent numerical blow-up while avoiding the excessive dissipation typical of standard EF approaches based on a fixed Kolmogorov length scale. The learned policies accurately reproduce the relevant flow dynamics across scales, preserving the correct balance between large-scale structures and small-scale dissipation. Notably, the reference-free reward achieves performance comparable to the reference-guided approach, demonstrating that stable and spectrally consistent filtering strategies can be learned even without DNS data, drastically reducing the computational costs of the training phase. The proposed framework provides a robust and flexible alternative to manually tuned regularization parameters, enabling adaptive, physically consistent control of filtering in turbulent flow simulations.
Read the full abstract

Information Theory · Cross-listed from quant-ph

Transmitting Correlation for Data Transmission over the Bosonic Arbitrarily Varying Channel

Shared randomness is the central ingredient for stabilizing symmetrizable communication systems against arbitrarily varying jammers. Given the presence of the jammer, however, the question arises how this precious resource could have been distributed. Several works discuss the use of external sources for this task. In this work, we show, based on the most standard optical communication model, how the sender and receiver can employ either classically correlated thermal light or entangled two-mode squeezed states created at and transmitted by the sender to counter the jamming attack of an energy-limited jammer during the distribution phase. Both sender and receiver are only allowed to use homodyne detection in our model, and the sender has to obey a power limit as well.
Read the full abstract

Optimization and Control · Cross-listed from cs.LG

Scaling Laws of SignSGD in Linear Regression: When Does It Outperform SGD?

We study scaling laws of signSGD under a power-law random features (PLRF) model that accounts for both feature and target decay. We analyze the population risk of a linear model trained with one-pass signSGD on Gaussian-sketched features. We express the risk as a function of model size, training steps, learning rate, and the feature and target decay parameters. Comparing against the SGD risk analyzed by Paquette et al. (2024), we identify a drift-normalization effect and a noise-reshaping effect unique to signSGD. We then obtain compute-optimal scaling laws under the optimal choice of learning rate. Our analysis shows that the noise-reshaping effect can make the compute-optimal slope of signSGD steeper than that of SGD in regimes where noise is dominant. Finally, we observe that the widely used warmup-stable-decay (WSD) schedule further reduces the noise term and sharpens the compute-optimal slope, when feature decay is fast but target decay is slow.
Read the full abstract

Probability

Convergence rate of the diagonal-valued Cauchy-transform for permutation invariant random matrices

Let $A$ be a permutation invariant random matrix and $B$ another random matrix. We give a quantitative bound on the difference between the diagonal of the resolvent of $A+B$ and the diagonal of the resolvent of the free sum with amalgamation over the diagonal of $A$ and $B$. Moreover, we improve the rate of convergence whenever the matrices $A$ and $B$ are sparse and bounded in operator norm. Doing so, we explicitly construct the free sum over the diagonal of $A$ and $B$ as an adjacency operator of a weighted locally finite graph.
Read the full abstract

Optimization and Control

Polynomial Turnpike Property for a Class of Infinite-Dimensional Oscillating Systems

We establish a polynomial turnpike estimate for an optimal control problem consisting of a system of infinitely many controlled oscillators, considered as an abstract differential equation in a Hilbert space, with a quadratic cost. Our proof relies on spectral considerations and on the construction of a Riesz basis. A concrete example is given, which involves a rotating bodybeam system. To our knowledge, this is the first example of a pointwise turnpike estimate around a steady-state that is polynomial but not exponential.
Read the full abstract

Information Theory

SINR Estimation under Limited Feedback via Online Convex Optimization

We introduce a novel online convex optimization (OCO) framework to estimate the user's signal-to-interference-plus-noise ratio (SINR) from ACK/NACK feedback, channel quality indicator (CQI) reports, and previously selected modulation and coding scheme (MCS) values. Specifically, the proposed approach minimizes a regularized binary cross-entropy loss using mirror descent enhanced with Nesterov momentum for accelerated SINR tracking. Its parameters are tuned online via an expert-advice algorithm, endowing the estimator with continual learning capabilities. Numerical experiments in ray-traced scenarios show that the proposed method outperforms state-of-the-art schemes in estimation accuracy and adapts robustly to time-varying SINR regimes.
Read the full abstract

All authors Lorenzo Maggi, Boris Bonev, Reinhard Wiesmayr, Sebastian Cammerer, Alexander Keller

Probability

Exact Asymptotics for the Exit Time Probabilities of Scalar Ornstein-Uhlenbeck Bridges

This paper aims to derive accurate asymptotic estimates for the exit time probabilities of scalar Ornstein-Uhlenbeck (OU) bridges. The exit time probabilities are expressed as an asymptotic series in powers of a small parameter that characterizes the intensity of the noise inputs. It is shown that the series is valid in certain regions where all its terms are smooth functions. The results enable an accurate evaluation of the probability for a corresponding OU process to escape from a domain before a specified time, provided its initial and terminal states are known.
Read the full abstract

All authors Feng Zhao, Yang Li, Jianlong Wang, Xianbin Liu, Dongping Jin

Dynamical Systems

Boundary driven weakly asymmetric Blume-Capel model: Large deviations for mixed Dirichlet-Neumann boundary conditions

We consider the Blume-Capel spin model on a finite cylinder with reservoirs at the boundary. A model with spin variable $\sigma$ taking values in {-1, 0, 1}, with the superposition of two dynamics: in the bulk, the spins evolve according to a weakly asymmetric dynamics; and the boundary dynamics follows a mechanism of creation, annihilation and spin flip, its action is accelerated differently on the left and on the right in a way to produce mixed boundary conditions. For the dynamics in the bulk, two quantities are conserved, the magnetization which corresponds to the sum of the spin values, and the concentration which corresponds to the sum of the squared spin values. We first establish, in the diffusive scaling, the hydrodynamic limit for this model which states that the couple of empirical measures (magnetization, concentration) converges to the solution of a system of coupled equations with mixed boundary conditions. Then we prove the associated dynamical large deviations principle.
Read the full abstract

Functional Analysis

A note on the Kolmogorov-type inequalities for more than three norms

In this note we show that sharp Kolmogorov-type inequalities that estimate the uniform norm $\|f^{(k)}\|$ of the $k$-th derivative of a function $f\colon \mathbb{R}\to\mathbb{R}$ by the values of the uniform norm of $f$ and uniform norms of several its higher derivatives ($\|f^{(r)}\|$ and $\|f^{(r-1)}\|$, or $\|f^{(r)}\|$ and $\|f^{(r-2)}\|$, or $\|f^{(r)}\|$, $\|f^{(r-1)}\|$ and $\|f^{(r-2)}\|$) using standard techniques can be obtained from the known solutions to the Kolmogorov problem about existence of a function with given norms of its derivatives.
Read the full abstract

Algebraic Geometry

Positivity of vector bundles and Dominance

Let $E$ be a vector bundle and $S_a$, $S_b$ the Schur functors associated to partitions $a$ and $b$. Previously we have shown that ampleness of $S_aE$ implies ampleness of $S_bE$ when $a$ is greater than $b$ in the dominance partial order. Here we prove that this result generalizes to $k$-ample, semiample and nef vector bundles. Our proof uses the common algebraic nature of these three properties and an investigation of the Littlewood-Richardson rules.
Read the full abstract

Dynamical Systems · Cross-listed from q-bio.PE

Lag-Induced Critical Transitions to Extinction in Replicating Systems

Replicating systems sustained by error-prone enzymatic amplification can undergo critical transitions between persistence and extinction. In RNA viruses, such transitions are classically governed by mutation rates and fitness landscapes, giving rise to error thresholds and lethal mutagenesis. Motivated by experimental evidence that polymerase-targeting antivirals constrain replication, we analyze replicating systems with explicit delays in replication-enzyme availability. We identify a lag-induced (dynamical) critical transition driven by the loss of temporal coordination between genome translation and replication. At a fixed mutation rate and replicative fitness landscape, populations cross an extinction threshold solely due to time delays. Within the quasispecies framework, replication-translation timing emerges as an independent control parameter, defining a distinct dynamical route to extinction and suggesting new antiviral strategies based on modulating replicase availability. More generally, we propose that the pathway to collapse described in this article can be understood as lag-time-induced tipping (\tau-tipping).
Read the full abstract

All authors Edward A. Turner, Francisco Crespo, Joan Gimeno, Ernest Fontich, Santiago F. Elena, Josep Sardanyés

Information Theory

Characterization of Blind Code Rate Recovery in Linear Block Codes

Forward Error Correction (FEC) is used ubiquitously in the communication pipeline. We explore noncooperative decoding where we aim to recover the code rate of a linear block code. We present a metric to characterize the quality of the code rate recovery which uses any rank based estimation technique. We derive a closed form expression for this metric in terms of the algorithmic and the environmental parameters and assert that it should be low for good recovery. We use this metric to derive an expression for a better code rate estimate in high noise conditions and compare it with existing estimates. Finally we validate the derived expression for the metric and the improved performance in the code rate estimate by simulating the recovery of a Low Density Parity Check (LDPC) code. This also enables us to derive the optimal algorithmic parameters for recovery.
Read the full abstract

Classical Analysis and ODEs

$\ell^1$ mapping properties, smoothness and decay for $SU(2)$-valued nonlinear Fourier transform

We prove an analog of Baxter's theorem for $SU(2)$-valued nonlinear Fourier transform (NLFT). That is, we prove that under certain natural conditions on the NLFT data, the potential is in $\ell^1$ if and only if the linear Fourier coefficients of the NLFT data are in $\ell^1$. Furthermore, we prove some smoothness-decay estimates for the NLFT motivated by similar estimates for the linear Fourier transform.
Read the full abstract

General Topology

Functional countability and exponential separability of product spaces and subspaces

We investigate the behavior of functional countability and exponential separability in products and subspaces of topological spaces. We solve a problem of Tkachuk by showing that the product of functionally countable pseudocompact spaces is itself functionally countable. Solving another problem of Tkachuk, we show that it is independent of ZFC whether regular spaces which have all their subspaces functionally countable are hereditarily Lindelöf. Finally, we prove that the $\sigma$-product of non-zero ordinals is exponentially separable, thereby extending a result of Kemoto and Szeptycki.
Read the full abstract

Number Theory

Partial weight one modularity for Galois representations associated to mod $p$ Hilbert modular forms

Let $p$ be an odd prime. Let $\rho: G_F \to \mathrm{GL}_2(\overline{\mathbb{F}}_p)$ be a Galois representation of a totally real field $F$. For a small partial weight one weight $(k,0)$, we prove that modularity of $\rho$ can be characterised using $p$-adic Hodge theory, as conjectured by Diamond and Sasaki. We show that if $\rho$ is modular with respect to a partial weight one mod $p$ Hilbert modular form, then each of its local representations has a crystalline lift with prescribed Hodge–Tate weights. Conversely, if for each $v|p$ the restriction $\rho|_{G_{F_v}}$ has a crystalline lift with certain irregular weights, we show that $\rho$ arises from a partial weight one Hilbert modular form. Our method consists of translating results from regular to irregular weights. We do this globally, relating modularity of regular weights to modularity of irregular weights and vice versa, and also use the local, $p$-adic Hodge theory analogue of this, which is recent work of the author.
Read the full abstract

Classical Analysis and ODEs

Revisiting second-order linear differential equations over Hardy fields

We review second-order homogeneous linear differential equations with coefficient functions whose germs lie in a Hardy field (and hence are strongly non-oscillating). We prove a conjecture of Boshernitzan (1982): the oscillating solutions to such an equation are given by amplitude and phase functions with germs in a bigger Hardy field, and hence oscillate in a very regular way. We give sharp conditions for the uniqueness of such germs, study their asymptotic behavior, and use this to obtain information about the zeros and critical points of oscillating solutions.
Read the full abstract

Analysis of PDEs

The Quintic Wave Equation with Kelvin-Voigt Damping: Strichartz estimates, Well-posedness and Global Stabilization

We study the three-dimensional energy-critical quintic wave equation with localized Kelvin–Voigt damping. While the viscoelastic dissipation provides a remarkably efficient mechanism for removing energy, it simultaneously introduces a loss of derivatives that places the problem outside the classical hyperbolic framework for critical wave equations. We develop a frequency-space approach based on Littlewood–Paley theory that yields well-posedness for arbitrarily large initial data despite the derivative loss. We then establish uniform exponential stabilization by combining critical Strichartz estimates, microlocal defect measures, and the unique continuation principle of Duyckaerts, Zhang and Zuazua, obtaining observability under highly localized damping regions. The paper also identifies a structural distinction between Kelvin–Voigt damping and all previously studied lower-order dissipations. Under the critical rescaling associated with energy concentration, the Kelvin–Voigt operator becomes supercritical, revealing an obstruction absent from the classical theory. We isolate this obstruction explicitly and propose a new parabolic viewpoint suggesting that concentration inside the strictly damped region is governed by intrinsic local regularization rather than by the traditional hyperbolic concentration mechanism.
Read the full abstract

Mathematical Physics · Cross-listed from cond-mat.stat-mech

On the upper critical dimension of the KPZ universality class: KPZ and related equations on a fully connected graph

We investigate the infinite-dimensional limit of nonequilibrium surface growth by numerically integrating stochastic growth equations on a fully connected graph. In particular, we study the Edwards-Wilkinson (EW), Kardar-Parisi-Zhang (KPZ), and tensionless KPZ (TKPZ) equations. Using a network discretization adapted to the all-to-all interaction topology, we analyze the global roughness, height-fluctuation statistics, time power spectra, and two-time correlations. For the EW equation, we obtain an exact expression for the roughness that matches the numerical simulations and shows that the interface becomes flat as the number of nodes in the graph, $N$, tends to infinity. We also compute analytically the time power spectrum, show that height fluctuations are Gaussian, and derive an explicit expression for the two-time height autocorrelation function, indicating that the aging behavior is trivial. For the KPZ equation, finite-size and strong-coupling effects can cause deviations from EW behavior at moderate system sizes $N$, often accompanied by numerical instabilities; however, these differences disappear as $N$ increases. In the large-$N$ limit, KPZ dynamics converges to EW behavior, as the four observables analyzed exhibit identical scaling properties. Overall, our results indicate that on a fully connected graph the KPZ nonlinearity is irrelevant as $N\to\infty$, leading to EW-like dynamics with asymptotically flat interfaces. These findings are interpreted in the context of the upper critical dimension of the KPZ universality class.
Read the full abstract

All authors J. M. Marcos, J. J. Meléndez, R. Cuerno, J. J. Ruiz-Lorenzo

Functional Analysis

Maximal subspaces of strong continuity for composition semigroups

Let $(\varphi_t)_{t\geq 0} $ a semigroup of holomorphic self-maps of the unit disk and $C_t f = f \circ \varphi_t $ the semigroup of composition operators which corresponds to $\varphi_t. $ Given a non-separable Banach space of analytic functions $X $ we study the properties of the maximal subspace of $X $ on which the semigroup $C_t $ is strongly continuous. In particular when $X $ contains the polynomials an interesting question is for which semigroups the maximal subspace of strong continuity coincides with the norm closure of the polynomials. This problem has been investigated in several function spaces including $BMOA$, $BMOA_p $, the Bloch space, $Q_s $ space and analytic Morrey spaces. However, in most cases only partial results are available. We offer a unified approach to this problem which encompasses all of the above spaces as particular examples. Moreover, we completely characterize the semigroups for which the maximal subspace of strong continuity coincides with the norm-closure of the polynomials in the space, giving therefore sharp versions of a number of results in the literature.
Read the full abstract