English
Related papers

Related papers: Upper bounds for $B_h[g]$-sets with small $h$

200 papers

This paper establishes new bounds on the maximum number of electrons $ N_c(Z) $ that an atom with nuclear charge $Z$ can bind. Specifically, we show that \begin{equation*} N_c(Z) < 1.1185Z + O(Z^{1/3}) \end{equation*} with an explicit bound…

Mathematical Physics · Physics 2025-04-28 Dirk Hundertmark , Nikolaos Pattakos , Marvin Raimund Schulz

We show that there is a calculable upper limit on the mass of the lightest Higgs boson in any supersymmetric theory that remains perturbative up to a high scale . There are no restrictions on the Higgs sector, or the gauge group or particle…

High Energy Physics - Phenomenology · Physics 2009-10-22 G. L. Kane , Chris Kolda , James D. Wells

A set $A$ of natural numbers possesses property $\mathcal{P}_h$, if there are no distinct elements $a_0,a_1,\dots ,a_h\in A$ with $a_0$ dividing the product $a_1a_2\dots a_h$. Erd\H{o}s determined the maximum size of a subset of…

Combinatorics · Mathematics 2020-09-16 Péter Pál Pach , Richárd Palincza

For any elements b,c of a number field K, let G(b,c) denote the backwards orbit of b under the map f_c: C-->C given by f_c(x)=x^2+c. We prove an upper bound on the number of elements of G(b,c) whose degree over K is at most some constant B.…

We say that a pair $(\mathcal{A},\mathcal{B})$ is a recovering pair if $\mathcal{A}$ and $\mathcal{B}$ are set systems on an $n$ element ground set, such that for every $A,A' \in \mathcal{A}$ and $B,B' \in \mathcal{B}$ we have that ($A…

Combinatorics · Mathematics 2015-10-27 Daniel Soltész

We study the complexity of computing majority as a composition of local functions: \[ \text{Maj}_n = h(g_1,\ldots,g_m), \] where each $g_j :\{0,1\}^{n} \to \{0,1\}$ is an arbitrary function that queries only $k \ll n$ variables and $h :…

Computational Complexity · Computer Science 2022-05-18 Victor Lecomte , Prasanna Ramakrishnan , Li-Yang Tan

We prove that if $A\subseteq \{ 1,2,\dots, N \}$ does not contain any solution to the equation $x_1+\dots+x_k=y_1+\dots+y_k$ with distinct $x_1,\dots,x_k,y_1,\dots,y_k\in A$, then $|A|\ll {k^{3/2}}N^{1/k}.$

Number Theory · Mathematics 2016-11-22 Tomasz Schoen , Ilya D. Shkredov

To elucidate the significance of the effect of systematic uncertainties in light element abundance estimates on cosmological bounds derivable from Big Bang Nucleosynthesis (BBN) we present tables giving bounds on $\Omega_{baryon}$ and…

Astrophysics · Physics 2009-10-22 Lawrence M. Krauss , Peter J. Kernan

More than 50 years ago, Erd\H os asked the following question: what is the maximum size of a family $\mathcal F$ of $k$-element subsets of an $n$-element set if it has no $s+1$ pairwise disjoint sets? This question attracted a lot of…

Combinatorics · Mathematics 2021-09-14 Peter Frankl , Andrey Kupavskii

For probability distributions on $\mathbb{R}^n$, we study the optimal sample size N = N(n,p) that suffices to uniformly approximate the pth moments of all one-dimensional marginals. Under the assumption that the marginals have bounded 4p…

Probability · Mathematics 2014-05-21 Roman Vershynin

In this paper we rectify two previous results found in the literature. Our work leads to a new upper bound for the largest sum-free subset of $[1,n]$ with lowest value in $\left [\frac{n}{3},\frac{n}{2}\right ]$, and the identification of…

Combinatorics · Mathematics 2023-10-05 Renato Cordeiro de Amorim

A set of positive integers $A$ is called a $B_{h}[g]$ set if there are at most $g$ different sums of $h$ elements from $A$ with the same result. This definition has a generalization to abelian groups and the main problem related to this…

Number Theory · Mathematics 2014-12-22 Nidia Y. Caicedo , Carlos A. Gómez , Jhonny C. Gómez , Carlos A. Trujillo

Let $\alpha_{1} (G)$ denote the maximum size of an edge set that contains at most one edge from each triangle of $G$. Let $\tau_{B} (G)$ denote the minimum size of an edge set whose deletion makes $G$ bipartite. It was conjectured by Lehel…

Combinatorics · Mathematics 2016-09-20 Honghai Xu

Let $\mathcal{F}_1$ and $\mathcal{F}_2$ be two families of subsets of an $n$-element set. We say that $\mathcal{F}_1$ and $\mathcal{F}_2$ are multiset-union-free if for any $A,B\in \mathcal{F}_1$ and $C,D\in \mathcal{F}_2$ the multisets…

Combinatorics · Mathematics 2014-12-30 Or Ordentlich , Ofer Shayevitz

We present lower bounds on the Higgs boson mass in the Standard Model with three and four fermion generations SM(3,4), as well as upper bounds on the lightest Higgs boson mass in the minimal supersymmetric extension of the SM with three and…

High Energy Physics - Phenomenology · Physics 2009-10-30 David Dooling , Kyungsik Kang , Sin Kyu Kang

In this paper, we study the set $B(G, \{\mu\})$ of acceptable elements for any $p$-adic group $G$. We show that $B(G, \{\mu\})$ contains a unique maximal element and the maximal element is represented by an element in the admissible subset…

Algebraic Geometry · Mathematics 2016-10-21 Xuhua He , Sian Nie

We obtain an improved upper bound on the lightest neutral CP-even Higgs boson mass from a low energy renormalisation-group analysis of the Higgs sector of the next-to-minimal supersymmetric standard model. We find $m_h< 145$ GeV for…

High Energy Physics - Phenomenology · Physics 2009-10-22 T. Elliott , S. F. King , P. L. White

We present new upper and lower bounds to the primordial abundances of deuterium and helium-3 based on observational data from the solar system and the interstellar medium. Independent of any model for the primordial production of the…

Astrophysics · Physics 2009-10-22 N. Hata , R. J. Scherrer , G. Steigman , D. Thomas , T. P. Walker

The bondage number $b(G)$ of a graph $G$ is the smallest number of edges whose removal from $G$ results in a graph with larger domination number. Let $G$ be embeddable on a surface whose Euler characteristic $\chi$ is as large as possible,…

Combinatorics · Mathematics 2020-02-04 Jia Huang , Jian Shen

It is established that for any finite set of positive real numbers $A$, we have $$|A/A+A| \gg \frac{|A|^{\frac{3}{2}+\frac{1}{26}}}{\log^{1/2}|A|}.$$

Combinatorics · Mathematics 2018-10-26 Oliver Roche-Newton