English
Related papers

Related papers: A bound for Dickson's lemma

200 papers

Motivated by LHC results, we modify the usual criterion for naturalness by ignoring the uncomputable power divergences. The Standard Model satisfies the modified criterion ('finite naturalness') for the measured values of its parameters.…

High Energy Physics - Phenomenology · Physics 2015-06-15 Marco Farina , Duccio Pappadopulo , Alessandro Strumia

Zeckendorf's Theorem states that any positive integer can be uniquely decomposed into a sum of distinct, non-adjacent Fibonacci numbers. There are many generalizations, including results on existence of decompositions using only even…

In [5] Herzlich proved a new positive mass theorem for Riemannian 3-manifolds $(N, g)$ whose mean curvature of the boundary allows some positivity. In this paper we study what happens to the limit case of the theorem when, at a point of the…

Differential Geometry · Mathematics 2007-05-23 Eui Chul Kim

Consider the discrete maximal function acting on finitely supported functions on the integers, \[ \mathcal{C}_\Lambda f(n) := \sup_{\lambda \in \Lambda} | \sum_{p \in \pm \mathbb{P}} f(n-p) \log |p| \frac{e^{2\pi i \lambda p}}{p} |,\] where…

Classical Analysis and ODEs · Mathematics 2016-05-02 Laura Cladek , Kevin Henriot , Ben Krause , Izabella Laba , Malabika Pramanik

We study solutions to the equation $a+b=c$, where $a,b,c$ form a triple of coprime natural numbers. The $abc$ conjecture asserts that, for any $\epsilon>0$, such triples satisfy $\mathrm{rad}(abc) \ge c^{1-\epsilon}$ with finitely many…

Number Theory · Mathematics 2026-05-12 Christian Bernert , Tim Browning , Jared Duker Lichtman , Joni Teräväinen

A symmetric subset of the reals is one that remains invariant under some reflection x --> c-x. Given 0 < x < 1, there exists a real number D(x) with the following property: if 0 < d < D(x), then every subset of [0,1] with measure x contains…

Number Theory · Mathematics 2007-05-23 Greg Martin , Kevin O'Bryant

Efficient modeling of uncertain information in real world is still an open issue. Dempster-Shafer evidence theory is one of the most commonly used methods. However, the Dempster-Shafer evidence theory has the assumption that the hypothesis…

Artificial Intelligence · Computer Science 2014-05-14 Yong Deng

Fekete's lemma is a well known result from combinatorial mathematics that shows the existence of a limit value related to super- and subadditive sequences of real numbers. In this paper, we analyze Fekete's lemma in view of the arithmetical…

Information Theory · Computer Science 2024-09-02 Holger Boche , Yannik Böck , Christian Deppe

We give a proof-theoretic as well as a semantic characterization of a logic in the signature with conjunction, disjunction, negation, and the universal and existential quantifiers that we suggest has a certain fundamental status. We present…

Logic · Mathematics 2023-04-06 Wesley H. Holliday

This paper extends the study of fringe trees in random plane trees with a given degree statistic. While previous work established the asymptotic normality of the count of fringe trees isomorphic to a fixed tree, we investigate the case…

Probability · Mathematics 2026-04-08 Gabriel Berzunza Ojeda , Cecilia Holmgren , Svante Janson

The purpose of this paper is to prove directly, by an elementary method, the Poisson probability law. This proof is offered as an alternative to the more usual derivation from binomial distribution in the limit of small probabilities. The…

History and Overview · Mathematics 2022-10-28 Pier Franco Nali

We obtain various irreducibility criteria for pairs of polynomials $(f(X),g(X))$ with integer coefficients whose resultant $Res(f,g)$ is a prime number, or is divisible by a sufficiently large prime number, and also for some of their linear…

Number Theory · Mathematics 2025-04-25 Nicolae Ciprian Bonciocat

In this note we announce the proof of the inverse conjecture for the Gowers U^{s+1}[N]-norm for all s => 3; this is new for s => 4, the cases s = 1,2,3 having been previously established. More precisely we outline a proof (details of which…

Number Theory · Mathematics 2011-05-31 Ben Green , Terence Tao , Tamar Ziegler

We derive explicit upper bounds for various functions counting primes in arithmetic progressions. By way of example, if $q$ and $a$ are integers with $\gcd(a,q)=1$ and $3 \leq q \leq 10^5$, and $\theta(x;q,a)$ denotes the sum of the…

Number Theory · Mathematics 2018-11-29 Michael A. Bennett , Greg Martin , Kevin O'Bryant , Andrew Rechnitzer

For each $k\geq 3$, Green proved an arithmetic $k$-cycle removal lemma for any abelian group $G$. The best known bounds relating the parameters in the lemma for general $G$ are of tower-type. For $k>3$, even in the case $G=\mathbb{F}_2^n$…

Combinatorics · Mathematics 2018-09-05 Jacob Fox , László Miklós Lovász , Lisa Sauermann

The concept of (a,b)-module comes from the study the Gauss-Manin lattices of an isolated singularity of a germ of an holomorphic function. It is a very simple ''abstract algebraic structure'', but very rich, whose prototype is the formal…

Complex Variables · Mathematics 2007-09-05 Daniel Barlet

In their celebrated paper "On Siegel's Lemma", Bombieri and Vaaler found an upper bound on the height of integer solutions of systems of linear Diophantine equations. Calculating the bound directly, however, requires exponential time. In…

Number Theory · Mathematics 2017-07-20 Jun Zhang , Qi Cheng

We study the De Giorgi type conjecture, that is, one dimensional symmetry problem for entire solutions of an two components elliptic system in $\mathbb{R}^n$, for all $n\geq 2$. We prove that, if a solution $(u,v)$ has a linear growth at…

Analysis of PDEs · Mathematics 2014-01-16 Kelei Wang

Discretization of the uniform norm of functions from a given finite dimensional subspace of continuous functions is studied. Previous known results show that for any $N$-dimensional subspace of the space of continuous functions it is…

Functional Analysis · Mathematics 2024-05-08 E. D. Kosov , V. N. Temlyakov

We study the Poincare-Bendixson theorem for two-dimensional continuous dynamical systems in compact domains from the point of view of computation, seeking algorithms for finding the limit cycle promised by this classical result. We start by…

Computational Complexity · Computer Science 2015-11-25 Christos H. Papadimitriou , Nisheeth K. Vishnoi