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)

Saturday 7 March

Mathematical Physics · Cross-listed from gr-qc

Frozen Motion: Why Single Carrollian Scalars Cannot Propagate

We investigate a class of first-order scalar field theories minimally coupled to a Carrollian connection that are defined intrinsically on the Carrollian plane, i.e., the theories are not defined via limits of Lorentzian theories. The theories built are invariant under the extended Carrollian transformations which include supertranslations. The symmetry allows for a large class of Lagrangians, independence of spacetime coordinates is all that is required. However, invariance under supertranslations (which include boosts as linear supertranslations) forces the energy density to be static and the momentum density to vanish – this precludes on-shell propagation of fields. Thus, to have propagating theories, one must move beyond single field theories that are minimally coupled to the geometry.
Read the full abstract

Optimization and Control

A unified high-resolution ODE framework for first-order methods

For a generic discrete-time algorithm (DTA): $z^+=g(z,s)$, where $s$ is the step size, Lu (Math. Program., 194(1):1061–1112, 2022) proposed an $O(s^r)$-resolution ordinary differential equation (ODE) framework based on the backward error analysis, which can be used to analyze many DTAs satisfying the fixed point assumption $g(z,0)=z$ such as gradient descent, extra gradient method and primal-dual hybrid gradient (PDHG). However, most first-order methods with momentum violate this critical assumption. To address this issue, in this work, we introduce a novel $O((\sqrt{s})^r)$-resolution ODE framework for accelerated first-order methods allowing momentum and variable parameters, such as Nesterov accelerated gradient (NAG), heavy-ball (HB) method and accelerated mirror gradient. The proposed high-resolution framework provides deeper insight into the convergence properties of DTAs. Especially, although the $O(1)$-resolution ODEs for HB and NAG are identical, their $O(\sqrt{s})$-resolution ODEs differ from the subtle existence of the Hessian-driven damping. Moreover, we propose a high-resolution correction approach and apply it to PDHG and HB for provably convergent modifications that achieve global optimal convergence rates. Numerical results are reported to confirm the theoretical predictions.
Read the full abstract

Dynamical Systems

Differentiable normal linearization of partially hyperbolic dynamical systems

A result on $C^0$ linearization which is differentiable at the hyperbolic fixed point is known. In this paper, we further investigate a partially hyperbolic diffeomorphism $F$ to find a local $C^0$ conjugacy, which is $C^1$ on the center manifold, to linearize the hyperbolic component (normal to the center direction) and obtain its Takens' normal form. Our result is optimal, as it needs no non-resonant condition usually required for smooth conjugacy (e.g., as in the Takens' theorem) and the $C^{1,\alpha}$ $(\alpha>0)$ smoothness condition is sharp. For the proof, the center direction obstructs the decoupling of $F$ as the stable and unstable foliations do not intersect. We overcome this difficulty via a semi-decoupling method only with the unstable foliation, where a modified Lyapunov-Perron equation needs to be established along the center direction. Subsequent issues of cocycle reduction and differentiable linearization for an expansive fiber-preserving mapping are then addressed by the Whitney's extension theory and a lifting technique, respectively. In the local context, our result improves the result of $C^0$ normal linearization by [C. Pugh and M. Shub, Invent. Math., 10 (1970): 187-198] to a differentiable one.
Read the full abstract

All authors Weijie Lu, Yonghui Xia, Weinian Zhang, Wenmeng Zhang

Number Theory

Remarks on polynomial count varieties

In this short note we prove a couple of facts about polynomial count varieties, answering natural questions that they raise. A polynomial count $X$ variety is essentially one for which its number of points over finite fields is given by a polynomial in the field size. Well-known examples include affine or projective space (or more generally the Grassmanian) and other standard varieties. The two questions we address are the following. 1) If $X$ is smooth, polynomial count with $\#X(q)=q^n$ for some $n$, is $X$ isomorphic to $n$-dimensional affine space? 2) If $X$ is a polynomial count, is it true that its Hodge numbers in a given graded piece of fixed weight satisfy~$h^{p,q}=0$ unless $p=q$? We show that in both cases the answer is no.
Read the full abstract

Statistics Theory · Cross-listed from stat.ME

Integrating Heterogeneous Information in Randomized Experiments: A Unified Calibration Framework

In modern randomized experiments, large-scale data collection increasingly yields rich baseline covariates and auxiliary information from multiple sources. Such information offers opportunities for more precise treatment effect estimation, but it also raises the challenge of integrating heterogeneous information coherently without compromising validity. Covariate-adaptive randomization (CAR) is widely used to improve covariate balance at the design stage, but it typically balances only a small set of covariates used to form strata, making covariate adjustment at the analysis stage essential for more efficient estimation of treatment effects. Beyond standard covariate adjustment, it is often desirable to incorporate auxiliary information, including cross-stratum information, predictions from various machine learning models, and external data from historical trials or real-world sources. While this auxiliary information is widely available, existing covariate adjustment methods under CAR primarily exploit within-stratum covariates and do not provide a coherent mechanism for integrating it. We propose a unified calibration framework that integrates such information through an information proxy vector and calibration weights defined by a convex optimization problem. The resulting estimator recovers many recent covariate adjustment procedures as special cases while providing a systematic mechanism for both internal and external information borrowing within a single framework. We establish large-sample validity and a no-harm efficiency guarantee, showing that incorporating additional information sources cannot increase asymptotic variance, and we extend the theory to settings in which both the number of strata and the number of information sources grow with the sample size.
Read the full abstract

Mathematical Physics

Wave Function Renormalization for Particle-Field Interactions

In this paper, we develop a wave function renormalization scheme for models of non-relativistic quantum particles interacting with a quantized relativistic field, in the Hamiltonian formalism of quantum field theory. We construct the interacting Hamilton operator, in its ground state representation, for a large class of particle-field interactions; hereby addressing a number of open problems related to both ultraviolet and infrared singularities in the spin-boson and Nelson models, where the infinite wave function renormalization plays a fundamental role.
Read the full abstract

Analysis of PDEs

Asymptotic Behaviors of Global Solutions to Fourth-order Parabolic and Hyperbolic Equations with Dirichlet Boundary Conditions

This paper investigates the asymptotic behaviors of global solutions to fourth-order parabolic and hyperbolic equations with Dirichlet boundary conditions. The equations model Micro-Electro-Mechanical Systems (MEMS) and are depending on a positive voltage parameter $\lambda$. We establish the convergence of global solutions to an equilibrium, along with the convergence rate estimates. Supporting numerical simulations are presented.
Read the full abstract

Numerical Analysis · Cross-listed from physics.comp-ph

Full-Scale GPU-Accelerated Transient EM-Thermal-Mechanical Co-Simulation for Early-Stage Design of Advanced Packages

In the early-stage design of advanced electronic packages, designers face a critical trade-off between simulation fidelity and computational turnaround time. Conventional early-stage methodologies typically achieve speed by relying on steady-state assumptions and structural homogenization. While computationally efficient, these approximations fundamentally fail to capture dynamic thermal events and stress concentrations at fine-grained internal interfaces, effectively masking failure mechanisms driven by transient signal bursts. In this work, we present a GPU-accelerated transient coupled Electromagnetic-Thermal-Mechanical solver that resolves this bottleneck. The proposed solver enables full-scale, non-homogenized, time-domain simulation of large-scale packages with runtimes amenable for rapid design iteration. Simulation of a NEC SX-Aurora TSUBASA package demonstrates that the tool allows for the identification of signal-induced adiabatic stress that is typically invisible to steady-state and homogenized baselines. This capability brings sign-off level physics fidelity to the early design phase, facilitating the prevention of costly late-stage design failures and broader transient thermal performance degradation risks.
Read the full abstract

All authors Hongyang Liu, Tejas Kulkarni, Ganesh Subbarayan, Cheng-Kok Koh, Dan Jiao

Complex Variables

Fractional differ-integral involving bicomplex Prabhakar function in the kernel and applications

This paper introduces the bicomplex Prabhakar derivative, extending fractional calculus to four-dimensional bicomplex spaces. Using the generalized kernel involving bicomplex Prabhakar function, we construct the bicomplex Prabhakar derivative and prove fundamental operational properties including linearity, composition rules, and connections to Riemann-Liouville and Caputo operators. We further investigate how fractional operators act on the bicomplex Prabhakar function itself, developing integral representations and transformation formulas. This work provides a rigorous foundation for modeling complex phenomena with memory effects and multi-dimensional coupling in bicomplex domains. The rich algebraic structure of bicomplex numbers, combined with the flexibility of Prabhakar kernels, offers a versatile framework applicable across diverse scientific and engineering disciplines.
Read the full abstract

Dynamical Systems

The local Morse Homology of the critical points in the Lagrange problem

In this paper, we construct local Morse homology in a new way and compute the local Morse homology of the critical points of the Lagrange problem. As a corollary, we prove for the first time that each of the linear critical points is either a saddle point or a degenerate critical point compared to the previous conclusion that if all the linear critical points are non-degenerate, they are saddle points.
Read the full abstract

Statistics Theory · Cross-listed from stat.ME

Fréchet regression of multivariate distributions with nonparanormal transport

Regression with distribution-valued responses and Euclidean predictors has gained increasing scientific relevance. While methodology for univariate distributional data has advanced rapidly in recent years, multivariate distributions, which additionally encode dependence across univariate marginals, have received less attention and pose computational and statistical challenges. In this work, we address these challenges with a new regression approach for multivariate distributional responses, in which distributions are modeled within the semiparametric nonparanormal family. By incorporating the nonparanormal transport (NPT) metric – an efficient closed-form surrogate for the Wasserstein distance – into the Fréchet regression framework, our approach decomposes the problem into separate regressions of marginal distributions and their dependence structure, facilitating both efficient estimation and granular interpretation of predictor effects. We provide theoretical justification for NPT, establishing its bi-Lipschitz equivalence to the Wasserstein distance and proving that it mitigates the curse of dimensionality. We further prove uniform convergence guarantees for regression estimators, both when distributional responses are fully observed and when they are estimated from empirical samples, attaining fast convergence rates comparable to the univariate case. The utility of our method is demonstrated via simulations and an application to continuous glucose monitoring data.
Read the full abstract

Analysis of PDEs

Well-posedness and asymptotic behavior of solutions to a second order nonlocal parabolic MEMS equation

We consider a second-order nonlocal parabolic MEMS equation with Dirichlet boundary conditions: \[ u_t-\Delta u=\frac{\lambda}{(1-u)^2\bigl(1+\int_\Omega\frac{1}{1-u}\,dx\bigr)^2},\quad x\in\Omega,\ t>0, \] where \(\Omega\subset\mathbb{R}^N\) \((1\le N\le3)\) is a bounded smooth domain and \(\lambda>0\). Using operator semigroups and the contraction mapping principle, we prove local existence and give a quenching criterion. Under suitable smallness conditions on \(\lambda\) and the initial data, global existence and exponential convergence to the minimal steady state are obtained. Assuming the global solution stays uniformly away from the singularity \(u=1\), we show that the system forms a gradient system. By establishing analyticity of the energy and a Lojasiewicz–Simon inequality, we prove that the solution converges to a steady state with either exponential or algebraic rate depending on the Lojasiewicz exponent. Numerical experiments in 1D and 2D illustrate the results and support conjectures on the \(\lambda\)-dichotomy.
Read the full abstract

Combinatorics

A Class of Unrooted Phylogenetic Networks Inspired by the Properties of Rooted Tree-Child Networks

A directed phylogenetic network is tree-child if every non-leaf vertex has a child that is not a reticulation. As a class of directed phylogenetic networks, tree-child networks are very useful from a computational perspective. For example, several computationally difficult problems in phylogenetics become tractable when restricted to tree-child networks. At the same time, the class itself is rich enough to contain quite complex networks. Furthermore, checking whether a directed network is tree-child can be done in polynomial time. In this paper, we seek a class of undirected phylogenetic networks that is rich and computationally useful in a similar way to the class tree-child directed networks. A natural class to consider for this role is the class of tree-child-orientable networks which contains all those undirected phylogenetic networks whose edges can be oriented to create a tree-child network. However, we show here that recognizing such networks is NP-hard, even for binary networks, and as such this class is inappropriate for this role. Towards finding a class of undirected networks that fills a similar role to directed tree-child networks, we propose new classes called $q$-cuttable networks, for any integer $q\geq 1$. We show that these classes have many of the desirable properties, similar to tree-child networks in the rooted case, including being recognizable in polynomial time, for all $q\geq 1$. Towards showing the computational usefulness of the class, we show that the NP-hard problem Tree Containment is polynomial-time solvable when restricted to $q$-cuttable networks with $q\geq 3$.
Read the full abstract

All authors Leo van Iersel, Mark Jones, Simone Linz, Norbert Zeh

Number Theory

Quadratic Congruences for half-integral weight cusp forms with the eta multiplier

Let $\ell \geq 5$ be a prime, and let $\nu_\eta$ denote the Dedekind eta multiplier. For an odd integer $r$, and a real Dirichlet character $\psi$, recent work of Ahlgren, Andersen, and the author showed that quadratic congruences modulo $\ell$ hold for a wide range of half-integral weight cusp forms with multiplier $\psi\nu_\eta^r$, vastly generalizing certain congruences discovered by Atkin for the partition function. In this paper, we show that such congruences hold when $\psi$ is an arbitrary character. Our methods rely on the theory of modular Galois representations. For primes $\ell \geq 5$, the core of our work is the study of modular Galois representations modulo $\ell$ attached to integer-weight eigenforms with arbitrary Nebentypus whose images are large in a precise sense. Our key new result is that, given a finite set of such representations and $\gamma \in \SL_2(\F_\ell)$, there exists $\sigma \in \Gal(\bar{\Q}/\Q(\zeta_\ell))$ whose images under the representations are in the conjugacy class of $\gamma^2$.
Read the full abstract

Representation Theory

Gluing of cotorsion pairs via recollements of abelian categories

Let $( \mathcal{A^{'}},\mathcal{A},\mathcal{A^{''}},i^\ast,i_\ast,i^!,j_!,j^\ast,j_\ast)$ be a recollement of abelian categories. Suppose that we are given two cotorsion pairs $({\mathcal{U^{'}}},\mathcal{V{'}})$ and $({\mathcal{U}^{''}},{\mathcal{V}^{''}})$ in $\mathcal{A}^{'}$ and $\mathcal{A}^{''}$, respectively. We construct two cotorsion pairs $(^{\bot}{\mathcal{N}_{\mathcal{V^{''}}}^{\mathcal{V^{'}}}},\mathcal{N}_{\mathcal{V^{''}}}^{\mathcal{V^{'}}})$ and $(\mathcal{M}_{\mathcal{U^{''}}}^{\mathcal{U^{'}}}, ({\mathcal{M}_{\mathcal{U^{''}}}^{\mathcal{U^{'}}}})^\bot)$ in $\mathcal{A}$. Moreover, we provide a sufficient condition for these two cotorsion pairs to coincide, and we investigate the heredity and completeness of $(\mathcal{M}_{\mathcal{U^{''}}}^{\mathcal{U^{'}}},\mathcal{N}_{\mathcal{V^{''}}}^{\mathcal{V^{'}}})$. These results are applied to construct new cotorsion pairs in Morita rings. In the course of proof, we introduce a specific constraint on recollements of abelian categories, requiring $\varepsilon_P$ to be a monomorphism for any projective $P \in \mathcal{A}$, with $\varepsilon: j_!j^* \to \mathrm{id}_{\mathcal{A}}$ being the counit of $(j_!, j^*)$. Such recollements enjoy rich homological properties and hence might be of independent interest.
Read the full abstract

Algebraic Geometry

On Vanishing Theorems and Bogomolov's Inequality on Surfaces in Positive Characteristic

In this paper, we study the equivalence between Bogomolov's instability theorem and the Miyaoka-Sakai theorem on surfaces in positive characteristic. We show that Bogomolov's instability theorem can be derived from Miyaoka-Sakai theorem. Conversely, it implies a partial version of the Miyaoka-Sakai theorem that lacks the vanishing conclusion. This partial version is still sufficient to deduce the Mumford-Ramanujam vanishing theorem. Additionally, we identify a class of surfaces in positive characteristic for which the Miyaoka-Sakai theorem (or a weaker variant), or the Kawamata-Viehweg vanishing theorem holds. In particular, we present a new proof of the Kawamata-Viehweg vanishing theorem on smooth del Pezzo surfaces. As an application of the Miyaoka-Sakai theorem, we obtain Reider-type results concerning Fujita's conjecture.
Read the full abstract

Analysis of PDEs

Sharp quantitative integral inequalities for general conformally invariant extensions

In this paper, we develop a refined analysis of hypergeometric functions to establish sharp quantitative integral inequalities for a general family of conformally invariant extension operators and their adjoints. Our results extend the recent work of Frank, Peteranderl, and Read \cite{Frank&Peteranderl&Read} to the full admissible parameter range under the natural index constraints.
Read the full abstract

Friday 6 March

Differential Geometry

Stability of the Shrinking Semi-Circle Under the Free Boundary Curve Shortening Flow

We establish a sharp rate of convergence for a free-boundary curve shortening flow in a convex domain in $\mathbb{R}^{2}$ which converges in finite time to a round half-point.

Optimization and Control

A geometric simplex method in infinite-dimensional spaces

We expand the basic geometric elements of the simplex method to linear programs in locally convex topological vector spaces and provide conditions under which the method converges in value to optimality. This setting generalizes many previous investigations of the simplex method, which are restricted to Hilbert spaces or otherwise specially structured instances. Our generality is obtained by avoiding the “algebraic” machinery of pivoting via column operations, which has required stronger topological conditions in establishing a connection between basic feasible solutions and extreme point structure. We show that our definition of polytopes captures optimization over the Hilbert cube, a quintessential object in infinite-dimensional spaces known for its surprisingly complicated properties. Moreover, all polytopes (under our definition) have exposed extreme points connected by edge paths.
Read the full abstract

Optimization and Control · Cross-listed from cs.LG

Joint MDPs and Reinforcement Learning in Coupled-Dynamics Environments

Many distributional quantities in reinforcement learning are intrinsically joint across actions, including distributions of gaps and probabilities of superiority. However, the classical Markov decision process (MDP) formalism specifies only marginal laws and leaves the joint law of counterfactual one-step outcomes across multiple possible actions at a state unspecified. We study coupled-dynamics environments with a multi-action generative interface which can sample counterfactual one-step outcomes for multiple actions under shared exogenous randomness. We propose joint MDPs (JMDPs) as a formalism for such environments by augmenting an MDP with a multi-action sample transition model which specifies a coupling of one-step counterfactual outcomes, while preserving standard MDP interaction as marginal observations. We adopt and formalize a one-step coupling regime where dependence across actions is confined to immediate counterfactual outcomes at the queried state. In this regime, we derive Bellman operators for $n$th-order return moments, providing dynamic programming and incremental algorithms with convergence guarantees.
Read the full abstract

Statistics Theory

Demonstration Experiments

Adaptive experiments are used extensively in online platforms, healthcare and biotechnology, and the social sciences. Often, the primary goal is not to precisely estimate a treatment effect but to demonstrate that at least one candidate intervention yields a positive effect, for some subpopulation and on some measured outcome. We formalize this objective as testing the global null in a threshold bandit framework, and develop two inference procedures that are valid under general adaptive sampling: one that pools information across promising arms, and one based on time-uniform multiple testing of individual arm means. To support the latter, we establish a moderate-deviations principle for the sequential $t$-statistic, justifying asymptotic confidence sequences in settings where the number of arms is large relative to the sample size. To illustrate how adaptive designs can target the proposed statistics, we recast experimental design as bandit optimization with an arm's reward given by its signal-to-noise ratio, and analyze an allocation rule for which we establish a logarithmic regret bound. We apply the methods in a simulation study of targeting unconditional cash transfer programs.
Read the full abstract

All authors Guido Imbens, Lorenzo Masoero, Alexander Rakhlin, Thomas S. Richardson, Suhas Vijaykumar

Representation Theory

On the Zassenhaus varieties of finite $W$-algebras in prime characteristic

Let $Z(\mathcal{W})$ be the center of the finite $W$-algebra $\mathcal{W}({\mathfrak{g}},e)$ associated with $\mathfrak{g}=\text{Lie}(G)$ and a nilpotent element $e\in\mathfrak{g}$ for a connected reductive algebraic group $G$ over an algebraically closed field $\mathbf{k}$ of prime characteristic $p$ under the standard hypotheses (H1)-(H3) in [Jantzen]. In this paper, we first demonstrate that our previous results in [Shu-Zeng] on the structure and geometric properties of $Z(\mathcal{W})$ for $p>>0$ are still true under the present weakened restriction on $p$. Then we study the Zassenhaus variety $\mathscr{Z}$ of $\mathcal{W}(\mathfrak{g},e)$, which is by definition the maximal spectrum $\text{Specm}(Z(\mathcal{W}))$ of $Z({\mathcal{W}})$. On basis of the structure properties of $Z({\mathcal{W}})$, we describe $\mathscr{Z}$ via a good transverse slice $\mathcal{S}$ and show that $\mathscr{Z}$ is birationally equivalent to $\mathcal{S}$, thereby a rational affine scheme. In the special case when $e=0$, we reobtain one of the main results of [Tange] on the rationality of the Zassenhaus varieites for reductive Lie algebras in prime characteristic.
Read the full abstract

Optimization and Control

A Note on the Gradient-Evaluation Sequence in Accelerated Gradient Methods

Nesterov's accelerated gradient descent method (AGD) is a seminal deterministic first-order method known to achieve the optimal order of iteration complexity for solving convex smooth optimization problems. Two distinct sequences of iterates are included in the description of AGD: gradient evaluations are performed at one sequence, while approximate solutions are selected from the other. The iteration complexity on minimizing objective function value has been well-studied in the literature, but such analysis is almost always performed only at the approximate solution sequence. To the best of our knowledge, for projection-based AGD that solves problems with feasible sets, it is still an open research question whether the gradient evaluation sequence (when treated as approximate solutions) could also achieve the same optimal order of iteration complexity. It is also unknown whether such results still hold in the non-Euclidean setting. Motivated by computer-aided algorithm analysis, we provide positive results that answer the open problems affirmatively. Specifically, for (possibly constrained) problem $f^*:=\min_{x\in X}f(x)$ where $f$ is convex and $L$-smooth and $X$ is closed, convex and projection friendly, we prove that the gradient-evaluation sequence $\{\underline{x}_k\}$ in AGD satisfies that $f(\underline{x}_k) - f^*\le \mathcal O(L/k^2)$.
Read the full abstract

All authors Yan Wu, Yipeng Zhang, Lu Liu, Yuyuan Ouyang

Combinatorics

Explicit Formulas and Unimodality Phenomena for General Position Polynomials

The general position problem in graphs seeks the largest set of vertices such that no three vertices lie on a common geodesic. Its counting refinement, the general position polynomial $\psi(G)$, asks for all such possible sets. In this paper, We describe general position sets for several classes of graphs and provide explicit formulas for the general position polynomials of complete multipartite graphs. We specialize to balanced complete multipartite graphs and show that for part size $r\le 4$, the polynomial $\psi(K_{r,\dots,r})$ is log-concave and unimodal for all numbers of parts, while for larger $r$, counterexamples show that these properties fail. Finally, we analyze the corona $G\circ K_1$ and prove that unimodality of $\psi(G)$ is retained for some classes, and counterexamples exists for complete bipartite and complete multipartite graphs. The results verify the analogy between general position polynomials and classical position-type parameters, and establish balanced multipartite graphs and coronas as potential subjects for further investigation.
Read the full abstract

Functional Analysis

The Stockwell transform on Gelfand pairs and localization operators

This paper addresses the extension of the Stockwell transform from locally compact abelian groups to Gelfand pairs. A suitable definition of the Stockwell transform is provided in this framework. Some major properties of this transform are examined. Also, the localization operators related to the Stockwell transform are defined and studied. Mainly, their boundedness and their belonging to Schatten-von Neumann classes are investigated.
Read the full abstract

Numerical Analysis

Finite element error analysis for elliptic parameter identification with power-type nonlinearity

This paper studies the numerical analysis of a parameter identification problem governed by elliptic equations with power-type nonlinearity. We propose a numerical reconstruction via a suitable least-squares minimization problem based on piecewise linear finite elements. As one of our main novelties, we establish conditional stability estimates at the continuous level, which form the theoretical foundation of the present finite element analysis. Our stability analysis relies on tailored analytical tools, including Hardy-type inequalities, fractional Gagliardo-Nirenberg inequalities, and weighted spaces with singular distance weights. By invoking the achieved conditional stability together with the Carstensen quasi-interpolation operator and associated estimates in negative Sobolev spaces, we derive a priori error estimates for the proposed finite element approximation in terms of the mesh size, the regularization parameter, the noise level, and the nonlinearity exponent. Our results extend the recent stability and error estimates for the linear case by Jin et al. \cite{jin2022convergence} and sharpen their error estimates and convergence order under weaker regularity assumptions.
Read the full abstract

Logic

Quantifier elimination for lovely pairs of strongly geometric fields

Let $T$ be a complete strongly geometric theory of fields with quantifier elimination. We show that the theory of lovely pairs of $T$ has quantifier elimination in Delon's definitional expansion by predicates for linear independence and function symbols for the corresponding coordinate functions. Apart from recovering Delon's original results for pairs of algebraically closed fields and dense pairs of algebraically closed valued fields, we obtain as particular cases, quantifier elimination for theories of dense pairs of real closed and $p$-adically closed fields.
Read the full abstract

All authors Pablo Cubides Kovacsics, Felipe Estrada, Juan Pérez, David Rincón