English
Related papers

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

200 papers

A new observation of D in a primordial gas cloud, made using the high resolution spectrograph at the Keck telescope, indicates an abundance $ D/H =(1.9-2.5) \times 10^{-4}$ \cite{SCHR}. Since deuterium is destroyed by stars, and the…

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

An upperbound on the mass of the lightest neutral scalar Higgs boson is calculated in an extended version of the minimal supersymmetric standard model that contains an additional Higgs singlet. We integrate the renormalization group…

High Energy Physics - Phenomenology · Physics 2007-05-23 W. T. A. ter Veldhuis

Various upper and lower bounds are provided for the (angular) Kronecker constants of sets of integers. Some examples are provided where the bounds are attained. It is proved that 5=16 bounds the angular Kronecker constants of 3-element sets…

Functional Analysis · Mathematics 2011-08-22 L. Thomas Ramsey , Kathryn E. Hare

We discuss the upper bound on the lightest CP-even Higgs boson mass in the next-to-minimal supersymmetric standard model within the framework of a low energy renormalisation group analysis. We find $m_h$ < 146 GeV for $m_t$ = 90 GeV,…

High Energy Physics - Phenomenology · Physics 2007-05-23 T. Elliott

Using a combination of renormalisation group and effective potential methods, we discuss the bound on the lightest CP-even Higgs boson mass $m_h$ in the next-to-minimal supersymmetric standard model. We find $m_h\leq 146,139,149 \ GeV$ for…

High Energy Physics - Phenomenology · Physics 2007-05-23 Stephen F. King

Let $C$ be a binary code of length $n$ with distances $0<d_1<\cdots<d_s\le n$. In this note we prove a general upper bound on the size of $C$ without any restriction on the distances $d_i$. The bound is asymptotically optimal.

Combinatorics · Mathematics 2025-03-13 Ivan Landjev , Konstantin Vorobev

Constraints are presented on the total width of the recently discovered Higgs boson, Gamma[H], using its relative on-shell and off-shell production and decay rates to a pair of Z bosons, where one Z boson decays to an electron or muon pair,…

High Energy Physics - Experiment · Physics 2014-07-29 CMS Collaboration

We obtain the bounds on all the gauge invariant, flavour symmetric, CP-even operators of dimension 6 that can affect the electroweak precision tests. For the preferred Higgs mass of about 100 GeV, their minimal scales range from 2 to 10…

High Energy Physics - Phenomenology · Physics 2009-10-09 Riccardo Barbieri , Alessandro Strumia

We investigate the extremal properties of saturated partial plane embeddings of maximal planar graphs. For a planar graph $G$, the plane-saturation number $\mathrm{sat}_{\mathcal{P}}(G)$ denotes the minimum number of edges in a plane…

Combinatorics · Mathematics 2025-02-11 János Barát , Zoltán L. Blázsik , Balázs Keszegh , Zeyu Zheng

We obtain an upper bound for the number of pairs $ (a,b) \in {A\times B} $ such that $ a+b $ is a prime number, where $ A, B \subseteq \{1,...,N \}$ with $|A||B| \, \gg \frac{N^2}{(\log {N})^2}$, $\, N \geq 1$ an integer. This improves on a…

Number Theory · Mathematics 2017-10-24 Kummari Mallesham

Let $H_n$ be the minimal number of smaller homothetic copies of an $n$-dimensional convex body required to cover the whole body. Equivalently, $H_n$ can be defined via illumination of the boundary of a convex body by external light sources.…

Metric Geometry · Mathematics 2020-10-01 A. Prymak , V. Shepelska

According to a classical result of Spencer, Szemer\'edi, and Trotter (1984), the maximum number of times the unit distance can occur among $n$ points in the plane is $O(n^{4/3})$. This is far from Erd\H{o}s's lower bound, $n^{1+O(1/\log\log…

Combinatorics · Mathematics 2025-07-22 János Pach , Orit E. Raz , József Solymosi

We provide an improvement over Meshulam's bound on cap sets in $F_3^N$. We show that there exist universal $\epsilon>0$ and $C>0$ so that any cap set in $F_3^N$ has size at most $C {3^N \over N^{1+\epsilon}}$. We do this by obtaining quite…

Classical Analysis and ODEs · Mathematics 2011-04-05 Michael Bateman , Nets Hawk Katz

Motivated by the recent discovery of a compact object with mass in the range $2.5{-}2.67\, \mathrm{M}_\odot$ in the binary merger GW190814, we revisit the question of the maximum mass of neutron stars (NSs). We use a Markov Chain Monte…

High Energy Astrophysical Phenomena · Physics 2021-06-22 Daniel A. Godzieba , David Radice , Sebastiano Bernuzzi

The maximum size of a binary code is studied as a function of its length N, minimum distance D, and minimum codeword weight W. This function B(N,D,W) is first characterized in terms of its exponential growth rate in the limit as N tends to…

Information Theory · Computer Science 2010-09-21 Christine Bachoc , Venkat Chandar , Gerard Cohen , Patrick Sole , Aslan Tchamkerten

The cycle set of a graph $G$ is the set consisting of all sizes of cycles in $G$. Answering a conjecture of Erd\H{o}s and Faudree, Verstra\"{e}te showed that there are at most $2^{n - n^{1/10}}$ different cycle sets of graphs with $n$…

Combinatorics · Mathematics 2025-09-23 Rajko Nenadov

We examine Big Bang nucleosynthesis (BBN) in the case of inhomogenous neutrino degeneracy, in the limit where the fluctuations are sufficiently small on large length scales that the present-day element abundances are homogeneous. We…

Astrophysics · Physics 2009-10-31 Scott E. Whitmire , Robert J. Scherrer

The neutral Higgs sector of the Minimal non Minimal Supersymmetric Standard Model is considered. By effective potential and R.G.E. supported method; an upper bound of the lightest Higgs is analysed. From the request of perturbativity of the…

High Energy Physics - Phenomenology · Physics 2007-05-23 D. Comelli

We give an upper bound of $n((n-1)!-(n-3)!)$ for the possible largest size of a subsemigroup of the full transformational semigroup over $n$ elements consisting only of nonpermutational transformations. As an application we gain the same…

Formal Languages and Automata Theory · Computer Science 2014-03-03 Szabolcs Ivan , Judit Nagy-Gyorgy

Let $K = \mathbb{R}$ or $\mathbb{C}$. An $n$-element subset $A$ of $K$ is a $B_h$-set if every element of $K$ has at most one representation as the sum of $h$ not necessarily distinct elements of $A$. Associated to the $B_h$ set $A =…

Combinatorics · Mathematics 2025-03-07 Melvyn B. Nathanson