相关论文: New Lower Bound Formulas for Multicolored Ramsey N…
We obtain tight upper and lower bounds to the eigenvalues of an anharmonic oscillator with a rational potential. We compare our bounds with results given by other approaches.
The graph-theoretic Ramsey numbers are notoriously difficult to calculate. In fact, for the two-color Ramsey numbers $R(m,n)$ with $m,n\geq 3$, only nine are currently known. We present a quantum algorithm for the computation of the Ramsey…
We draw two incomplete, biased maps of challenges in computational complexity lower bounds.
For a given graph $H$, the Ramsey number $r(H)$ is the minimum $N$ such that any 2-edge-coloring of the complete graph $K_N$ yields a monochromatic copy of $H$. Given a positive integer $n$, a \emph{fan }$F_n$ is a graph formed by $n$…
We provide a technique to obtain explicit bounds for problems that can be reduced to linear forms in three complex logarithms of algebraic numbers. This technique can produce bounds significantly better than general results on lower bounds…
We provide a lower bound on the probability that a binomial random variable is exceeding its mean. Our proof employs estimates on the mean absolute deviation and the tail conditional expectation of binomial random variables.
This paper studies explicit and theoretical bounds for several interesting quantities in number theory, conditionally on the Generalized Riemann Hypothesis. Specifically, we improve the existing explicit bounds for the least quadratic…
In this paper, we consider a variant of Ramsey numbers which we call complementary Ramsey numbers $\bar{R}(m,t,s)$. We first establish their connections to pairs of Ramsey $(s,t)$-graphs. Using the classification of Ramsey $(s,t)$-graphs…
New exceptional (i.e. non-repeating) prime number multiplets are given and formulated in terms of arithmetic progressions, along with laws governing them. Accompanying repeating prime number multiplets are pointed out. Prime number…
We derive a new estimate of the size of finite sets of points in metric spaces with few distances. The following applications are considered: (1) we improve the Ray-Chaudhuri--Wilson bound of the size of uniform intersecting families of…
Gaitan and Clark [Phys. Rev. Lett. 108, 010501 (2012)] have recently presented a quantum algorithm for the computation of the Ramsey numbers R(m, n) using adiabatic quantum evolution. We consider that the two-color Ramsey numbers R(m, n; r)…
We reveal a connection between the incompressibility method and the Lovasz local lemma in the context of Ramsey theory. We obtain bounds by repeatedly encoding objects of interest and thereby compressing strings. The method is demonstrated…
We construct a new family of $K_s$-free graphs that leads to improved lower bounds for Ramsey numbers across a wide range of parameters. For any fixed $s \ge 4$, we show that the off-diagonal Ramsey numbers satisfy $r(s, k) \ge k^{s-2 +…
Denote by k_4(n) the minimal number of monochromatic copies of a K_4 in a 2-colouring of the edges of K_n and let c_4 := lim k_4(n)/\binom{n}{4}. The best known bounds so far were given by Thomason, who proved that c_4 < 1/33 \approx…
Improved bounds on the copula of a bivariate random vector are computed when partial information is available, such as the values of the copula on a given subset of $[0,1]^2$, or the value of a functional of the copula, monotone with…
We determine Tur\'an numbers for the family of 3-uniform minimal paths of length four \emph{for all $n$}. We also establish the second and third order Tur\'an numbers and use them to compute the corresponding Ramsey numbers for up to four…
We propose a new method for proving lower bounds on quantum query algorithms. Instead of a classical adversary that runs the algorithm with one input and then modifies the input, we use a quantum adversary that runs the algorithm with a…
In this paper an explicit formula for a lower bound on the volume of a hyperbolic orbifold, dependent on dimension and the maximal order of torsion in the orbifolds' fundamental group, is constructed.
We apply Ramsey theoretic tools to show that there is a family of graphs which have tree-chromatic number at most~$2$ while the path-chromatic number is unbounded. This resolves a problem posed by Seymour.
The bounds for the ratios of first and second kind modified Bessel functions of consecutive orders are important quantities appearing in a large number of scientific applications. We obtain new bounds which are accurate in a large region of…