English
Related papers

Related papers: $\Delta^1_1$ Effectivization in Borel Combinatoric…

200 papers

Based on the Lagarias-Odlyzko effectivization of the Chebotarev density theorem, Kumar Murty gave an effective version of the Sato-Tate conjecture for an elliptic curve conditional on analytic continuation and Riemann hypothesis for the…

Number Theory · Mathematics 2015-06-09 Alina Bucur , Kiran S. Kedlaya

In the paper "Uniformity of Mordell-Lang" by Vesselin Dimitrov, Philipp Habegger and Ziyang Gao (arXiv:2001.10276), they use Silverman-Tate's Height Inequality and they give a proof of the same which makes use of Cartier divisors and hence…

Number Theory · Mathematics 2024-04-04 Debam Biswas , Zhelun Chen

We prove first-order convergence of semi-discrete monotone finite difference schemes for Hamilton--Jacobi equations on the Wasserstein space over a finite graph. A central challenge is the boundary degeneracy of the Wasserstein simplex,…

Numerical Analysis · Mathematics 2026-05-22 Jianbo Cui , Tonghe Dang

Let $X$ be a connected scheme, smooth and separated over an algebraically closed field $k$ of characteristic $p\geq 0$, let $f:Y\rightarrow X$ be a smooth proper morphism and $x$ a geometric point on $X$. We prove that the tensor invariants…

Number Theory · Mathematics 2017-02-24 Anna Cadoret , Chun Yin Hui , Akio Tamagawa

We prove the Hardy-Littlewood-Sobolev type $L^p$ estimates for the gain term of the Boltzmann collision operator including Maxwellian molecule, hard potential and hard sphere models. Combining with the results of Alonso et al. [2] for the…

Analysis of PDEs · Mathematics 2024-10-25 Ling-Bing He , Jin-Cheng Jiang , Hung-Wen Kuo , Meng-Hao Liang

We propose a new algorithm for computing validated bounds for the solutions to the first order variational equations associated to ODEs. These validated solutions are the kernel of numerics computer-assisted proofs in dynamical systems…

Numerical Analysis · Mathematics 2020-10-15 Irmina Walawska , Daniel Wilczak

Multi-objective reinforcement learning (MORL) is increasingly relevant due to its resemblance to real-world scenarios requiring trade-offs between multiple objectives. Catering to diverse user preferences, traditional reinforcement learning…

Machine Learning · Computer Science 2024-04-08 Junlin Lu , Patrick Mannion , Karl Mason

We construct "soft-collinear gravity", the effective field theory which describes the interaction of collinear and soft gravitons with matter (and themselves), to all orders in the soft-collinear power expansion. Despite the absence of…

High Energy Physics - Phenomenology · Physics 2022-04-14 Martin Beneke , Patrick Hager , Robert Szafron

We develop new tools to analyze the complexity of the conjugacy equivalence relation $E_\mathsf{lo}(G)$, whenever $G$ is a left-orderable group. Our methods are used to demonstrate non-smoothness of $E_\mathsf{lo}(G)$ for certain groups $G$…

Logic · Mathematics 2024-10-01 Filippo Calderoni , Adam Clay

We consider the complexity of counting homomorphisms from an $r$-uniform hypergraph $G$ to a symmetric $r$-ary relation $H$. We give a dichotomy theorem for $r>2$, showing for which $H$ this problem is in FP and for which $H$ it is…

Computational Complexity · Computer Science 2010-01-04 Martin Dyer , Leslie Ann Goldberg , Mark Jerrum

We present an improved method for symbolic regression that seeks to fit data to formulas that are Pareto-optimal, in the sense of having the best accuracy for a given complexity. It improves on the previous state-of-the-art by typically…

Machine Learning · Computer Science 2020-12-17 Silviu-Marian Udrescu , Andrew Tan , Jiahai Feng , Orisvaldo Neto , Tailin Wu , Max Tegmark

The soft bootstrap is an on-shell method to constrain the landscape of effective field theories (EFTs) of massless particles via the consistency of the low-energy S-matrix. Given assumptions on the on-shell data (particle spectra, linear…

High Energy Physics - Theory · Physics 2019-02-20 Henriette Elvang , Marios Hadjiantonis , Callum R. T. Jones , Shruti Paranjape

In this paper we obtain quite general and definitive forms for Hardy-Littlewood type inequalities. Moreover, when restricted to the original particular cases, our approach provides much simpler and straightforward proofs and we are able to…

Functional Analysis · Mathematics 2014-06-24 Nacib Albuquerque , Frédéric Bayart , Daniel Pellegrino , Juan B. Seoane-Sepúlveda

The paper investigates the problem of performing correlation analysis when the number of observations is very large. In such a case, it is often necessary to combine the random observations to achieve dimensionality reduction of the…

Information Theory · Computer Science 2020-10-19 Pavel Loskot

Proofs are traditionally syntactic, inductively generated objects. This paper reformulates first-order logic (predicate calculus) with proofs which are graph-theoretic rather than syntactic. It defines a combinatorial proof of a formula…

Logic · Mathematics 2019-06-27 Dominic J. D. Hughes

We prove a factorization theorem for heavy-to-light form factors. Our result differs in several important ways from previous proposals. A proper separation of scales gives hard kernels that are free of endpoint singularities. A general…

High Energy Physics - Phenomenology · Physics 2009-11-07 Christian W. Bauer , Dan Pirjol , Iain W. Stewart

It is a classical result in rational approximation theory that certain non-smooth or singular functions, such as $|x|$ and $x^{1/p}$, can be efficiently approximated using rational functions with root-exponential convergence in terms of…

Numerical Analysis · Mathematics 2025-06-27 Kingsley Yeon , Steven B. Damelin

We give a new proof of the Hansen-Mullen irreducibility conjecture. The proof relies on an application of a (seemingly new) sufficient condition for the existence of elements of degree $n$ in the support of functions on finite fields. This…

Number Theory · Mathematics 2016-04-15 Aleksandr Tuxanidy , Qiang Wang

This paper provides a deeper study of the Hardy and $\rm BMO$ spaces associated to the Neumann Laplacian $\Delta_N$. For the Hardy space $H^1_{\Delta_N}(\mathbb{R}^n)$ (which is a proper subspace of the classical Hardy space…

Classical Analysis and ODEs · Mathematics 2017-05-30 Ji Li , Brett D. Wick

Representing a proof tree by a combinator term that reduces to the tree lets subtle forms of duplication within the tree materialize as duplicated subterms of the combinator term. In a DAG representation of the combinator term these…

Logic in Computer Science · Computer Science 2022-09-27 Christoph Wernhard