scholarly journals Monochromatic Hilbert Cubes and Arithmetic Progressions

10.37236/7917 ◽  
2019 ◽  
Vol 26 (2) ◽  
Author(s):  
József Balogh ◽  
Mikhail Lavrov ◽  
George Shakan ◽  
Adam Zsolt Wagner

The Van der Waerden number $W(k,r)$ denotes the smallest $n$ such that whenever $[n]$ is $r$–colored there exists a monochromatic arithmetic progression of length $k$. Similarly, the Hilbert cube number $h(k,r)$ denotes the smallest $n$ such that whenever $[n]$ is $r$–colored there exists a monochromatic affine $k$–cube, that is, a set of the form$$\left\{x_0 + \sum_{b \in B} b : B \subseteq A\right\}$$ for some $|A|=k$ and $x_0 \in \mathbb{Z}$. We show the following relation between the Hilbert cube number and the Van der Waerden number. Let $k \geqslant 3$ be an integer. Then for every $\epsilon >0$, there is a $c > 0$ such that $$h(k,4) \geqslant \min\{W(\lfloor c k^2\rfloor, 2), 2^{k^{2.5-\epsilon}}\}.$$ Thus we improve upon state of the art lower bounds for $h(k,4)$ conditional on $W(k,2)$ being significantly larger than $2^k$. In the other direction, this shows that if the Hilbert cube number is close to its state of the art lower bounds, then $W(k,2)$ is at most doubly exponential in $k$. We also show the optimal result that for any Sidon set $A \subset \mathbb{Z}$, one has $$\left|\left\{\sum_{b \in B} b : B \subseteq A\right\}\right| = \Omega( |A|^3) .$$

1999 ◽  
Vol 60 (1) ◽  
pp. 21-35
Author(s):  
Tom C. Brown ◽  
Bruce M. Landman

A generalisation of the van der Waerden numbers w(k, r) is considered. For a function f: Z+ → R+ define w(f, k, r) to be the least positive integer (if it exists) such that for every r-coloring of [1, w(f, k, r)] there is a monochromatic arithmetic progression {a + id: 0 ≤ i ≤ k −1} such that d ≥ f(a). Upper and lower bounds are given for w(f, 3, 2). For k > 3 or r > 2, particular functions f are given such that w(f, k, r) does not exist. More results are obtained for the case in which f is a constant function.


10.37236/546 ◽  
2011 ◽  
Vol 18 (1) ◽  
Author(s):  
Kevin O'Bryant

Combining ideas of Rankin, Elkin, Green & Wolf, we give constructive lower bounds for $r_k(N)$, the largest size of a subset of $\{1,2,\dots,N\}$ that does not contain a $k$-element arithmetic progression: For every $\epsilon>0$, if $N$ is sufficiently large, then $$r_3(N) \geq N \left(\frac{6\cdot 2^{3/4} \sqrt{5}}{e \,\pi^{3/2}}-\epsilon\right) \exp\left({-\sqrt{8\log N}+\tfrac14\log\log N}\right),$$ $$r_k(N) \geq N \, C_k\,\exp\left({-n 2^{(n-1)/2} \sqrt[n]{\log N}+\tfrac{1}{2n}\log\log N}\right),$$ where $C_k>0$ is an unspecified constant, $\log=\log_2$, $\exp(x)=2^x$, and $n=\lceil{\log k}\rceil$. These are currently the best lower bounds for all $k$, and are an improvement over previous lower bounds for all $k\neq4$.


1994 ◽  
Vol 36 (1) ◽  
pp. 45-55 ◽  
Author(s):  
Jean Lagrange ◽  
John Leech

As in [3] let {a, b}designate the Pythagorean ratio (a2 − b2)/2ab between the sides of a rational right angled triangle. The principal result of [3] is that {a, b}is the arithmetic mean of two Pythagorean ratios, and hence is the middle term of a three term arithmetic progression, if and only if a /b is the geometric mean of two Pythagorean ratios. Here in Part II we study sets of four Pythagorean ratios in arithmetic progression. We show that sets of four in consecutive places in an arithmetic progression are closely related to sets of four in the first, second, third and fifth places in a progression; any one of the former sets determines two of the latter sets, and either one of the latter sets determines the other and the former. We construct an infinite sequence of sets of four ratios in consecutive places of arithmetic progressions, the last term of each set being the first term of the next set. These sets are related to solutions of the Diophantine equations r2 = 5p2q2 ± 4(p4 − 2q4). Computer searches, in addition to exhibiting enough members of this sequence to enable us to identify it, also exhibited two sets which do not belong to this sequence.


2014 ◽  
Vol 57 (3) ◽  
pp. 551-561 ◽  
Author(s):  
Daniel M. Kane ◽  
Scott Duke Kominers

AbstractFor relatively prime positive integers u0 and r, we consider the least common multiple Ln := lcm(u0, u1..., un) of the finite arithmetic progression . We derive new lower bounds on Ln that improve upon those obtained previously when either u0 or n is large. When r is prime, our best bound is sharp up to a factor of n + 1 for u0 properly chosen, and is also nearly sharp as n → ∞.


2008 ◽  
Vol 51 (1) ◽  
pp. 47-56 ◽  
Author(s):  
Ernie Croot

AbstractHow few three-term arithmetic progressions can a subset S ⊆ ℤN := ℤ/Nℤ have if |S| ≥ υN (that is, S has density at least υ)? Varnavides showed that this number of arithmetic progressions is at least c(υ)N2 for sufficiently large integers N. It is well known that determining good lower bounds for c(υ) > 0 is at the same level of depth as Erdös's famous conjecture about whether a subset T of the naturals where Σn∈T 1/n diverges, has a k-term arithmetic progression for k = 3 (that is, a three-term arithmetic progression).We answer a question posed by B. Green about how this minimial number of progressions oscillates for a fixed density υ as N runs through the primes, and as N runs through the odd positive integers.


10.37236/925 ◽  
2007 ◽  
Vol 14 (1) ◽  
Author(s):  
P. R. Herwig ◽  
M.J.H. Heule ◽  
P. M. Van Lambalgen ◽  
H. Van Maaren

We present the Cyclic Zipper Method, a procedure to construct lower bounds for Van der Waerden numbers. Using this method we improved seven lower bounds. For natural numbers $r$, $k$ and $n$ a Van der Waerden certificate $W(r,k,n)$ is a partition of $\{1, \ldots, n\}$ into $r$ subsets, such that none of them contains an arithmetic progression of length $k$ (or larger). Van der Waerden showed that given $r$ and $k$, a smallest $n$ exists - the Van der Waerden number $W(r,k)$ - for which no certificate $W(r,k,n)$ exists. In this paper we investigate Van der Waerden certificates which have certain symmetrical and repetitive properties. Surprisingly, it shows that many Van der Waerden certificates, which must avoid repetitions in terms of arithmetic progressions, reveal strong regularities with respect to several other criteria. The Cyclic Zipper Method exploits these regularities. To illustrate these regularities, two techniques are introduced to visualize certificates.


1968 ◽  
Vol 11 (3) ◽  
pp. 409-414 ◽  
Author(s):  
E.R. Berlekamp

For k ≥2, t ≥2, let W(k, t) denote the least integer m such that in every partition of m consecutive integers into k sets, atleast one set contains an arithmetic progression of t+1 terms. This paper presents a construction which improves the best previously known lower bounds on W(k, t) for small k and large t.


1999 ◽  
Vol 18 (3-4) ◽  
pp. 265-273
Author(s):  
Giovanni B. Garibotto

The paper is intended to provide an overview of advanced robotic technologies within the context of Postal Automation services. The main functional requirements of the application are briefly referred, as well as the state of the art and new emerging solutions. Image Processing and Pattern Recognition have always played a fundamental role in Address Interpretation and Mail sorting and the new challenging objective is now off-line handwritten cursive recognition, in order to be able to handle all kind of addresses in a uniform way. On the other hand, advanced electromechanical and robotic solutions are extremely important to solve the problems of mail storage, transportation and distribution, as well as for material handling and logistics. Finally a short description of new services of Postal Automation is referred, by considering new emerging services of hybrid mail and paper to electronic conversion.


Author(s):  
Alexander Diederich ◽  
Christophe Bastien ◽  
Karthikeyan Ekambaram ◽  
Alexis Wilson

The introduction of automated L5 driving technologies will revolutionise the design of vehicle interiors and seating configurations, improving occupant comfort and experience. It is foreseen that pre-crash emergency braking and swerving manoeuvres will affect occupant posture, which could lead to an interaction with a deploying airbag. This research addresses the urgent safety need of defining the occupant’s kinematics envelope during that pre-crash phase, considering rotated seat arrangements and different seatbelt configurations. The research used two different sets of volunteer tests experiencing L5 vehicle manoeuvres, based in the first instance on 22 50th percentile fit males wearing a lap-belt (OM4IS), while the other dataset is based on 87 volunteers with a BMI range of 19 to 67 kg/m2 wearing a 3-point belt (UMTRI). Unique biomechanics kinematics corridors were then defined, as a function of belt configuration and vehicle manoeuvre, to calibrate an Active Human Model (AHM) using a multi-objective optimisation coupled with a Correlation and Analysis (CORA) rating. The research improved the AHM omnidirectional kinematics response over current state of the art in a generic lap-belted environment. The AHM was then tested in a rotated seating arrangement under extreme braking, highlighting that maximum lateral and frontal motions are comparable, independent of the belt system, while the asymmetry of the 3-point belt increased the occupant’s motion towards the seatbelt buckle. It was observed that the frontal occupant kinematics decrease by 200 mm compared to a lap-belted configuration. This improved omnidirectional AHM is the first step towards designing safer future L5 vehicle interiors.


2021 ◽  
Vol 18 (4) ◽  
pp. 1-22
Author(s):  
Jerzy Proficz

Two novel algorithms for the all-gather operation resilient to imbalanced process arrival patterns (PATs) are presented. The first one, Background Disseminated Ring (BDR), is based on the regular parallel ring algorithm often supplied in MPI implementations and exploits an auxiliary background thread for early data exchange from faster processes to accelerate the performed all-gather operation. The other algorithm, Background Sorted Linear synchronized tree with Broadcast (BSLB), is built upon the already existing PAP-aware gather algorithm, that is, Background Sorted Linear Synchronized tree (BSLS), followed by a regular broadcast distributing gathered data to all participating processes. The background of the imbalanced PAP subject is described, along with the PAP monitoring and evaluation topics. An experimental evaluation of the algorithms based on a proposed mini-benchmark is presented. The mini-benchmark was performed over 2,000 times in a typical HPC cluster architecture with homogeneous compute nodes. The obtained results are analyzed according to different PATs, data sizes, and process numbers, showing that the proposed optimization works well for various configurations, is scalable, and can significantly reduce the all-gather elapsed times, in our case, up to factor 1.9 or 47% in comparison with the best state-of-the-art solution.


Sign in / Sign up

Export Citation Format

Share Document