English
Related papers

Related papers: Oscilation stability for continuous monotone surje…

200 papers

We prove that for a positive integer $c$ and any given $\varepsilon$, $0<\varepsilon<1$, the number $N(c)$ of equations $c=a+b$, $a<b$, with positive coprime integers $a$ and $b$, which satisfy the inequality $$c <…

Number Theory · Mathematics 2009-04-14 Constantin M. Petridi

We establish a "neighborhood" variant of the cubical KKM lemma and the Lebesgue covering theorem and deduce a discretized version which is a "neighborhood" variant of Sperner's lemma on the cube. The main result is the following: for any…

Combinatorics · Mathematics 2023-06-23 Jason Vander Woude , Peter Dixon , A. Pavan , Jamie Radcliffe , N. V. Vinodchandran

We formulate a stability conjecture for the coefficients of the colored Jones polynomial of a knot, colored by irreducible representations in a fixed ray of a simple Lie algebra, and verify it for all torus knots and all simple Lie algebras…

Geometric Topology · Mathematics 2013-10-29 Stavros Garoufalidis , Thao Vuong

For an integer $b\geq 2$, a positive integer is called a $b$-Niven number if it is a multiple of the sum of the digits in its base-$b$ representation. In this article, we show that every arithmetic progression contains infinitely many…

Number Theory · Mathematics 2024-05-17 Joshua Harrington , Matthew Litman , Tony W. H. Wong

We prove that for any $\ell_p$-norm in the plane with $1<p<\infty$ and for every infinite $\mathcal{M} \subset \mathbb{R}^2$, there exists a two-colouring of the plane such that no isometric copy of $\mathcal{M}$ is monochromatic. On the…

Combinatorics · Mathematics 2025-09-29 Nóra Frankl , Panna Gehér , Arsenii Sagdeev , Géza Tóth

Given a natural $n$, we construct a two-coloring of $\mathbb{R}^n$ with the maximum metric satisfying the following. For any finite set of reals $S$ with diameter greater than $5^{n}$ such that the distance between any two consecutive…

Metric Geometry · Mathematics 2023-07-26 Valeriya Kirova , Arsenii Sagdeev

We prove an old conjecture of Erd{\H o}s and Graham on sums of unit fractions: There exists a constant $b>0$ such that if we $r$-color the integers in $2,b^r]$, then there exists a monochromatic set $S$ such that $\sum_{n \in S} 1/n=1$.

Number Theory · Mathematics 2007-05-23 Ernest S. Croot

N. Hindman, I. Leader and D. Strauss proved that it is consistent that there is a finite colouring of $\mathbb R$ so that no infinite sumset $X+X=\{x+y:x,y\in X\}$ is monochromatic. Our aim in this paper is to prove a consistency result in…

We define finite distortion $\omega$-curves and we show that for some forms $\omega$ and when the distortion function is sufficiently exponentially integrable the map is continuous, differentiable almost everywhere and has Lusin's (N)…

Complex Variables · Mathematics 2022-10-21 Lauri Hitruhin , Athanasios Tsantaris

In the paper, we search for monochromatic infinite additive structures involving polynomials over $\mathbb{N}$. It is proved that for any $r\in \mathbb{N}$, any two distinct natural numbers $a,b$, and any $2$-coloring of $\mathbb{N}$, there…

Combinatorics · Mathematics 2026-01-21 Zhengxing Lian , Rongzhong Xiao

Holmsen, Kyn\v{c}l and Valculescu recently conjectured that if a finite set $X$ with $\ell n$ points in $\mathbb{R}^d$ that is colored by $m$ different colors can be partitioned into $n$ subsets of $\ell$ points each, such that each subset…

Combinatorics · Mathematics 2019-12-04 Pavle V. M. Blagojević , Nevena Palić , Pablo Soberón , Günter M. Ziegler

For $x$ real, let $ \{ x \}$ be the fractional part of $x$ (i.e. $\{x\} = x - \lfloor x \rfloor $). The lonely runner conjecture can be stated as follows: for any $n$ positive integers $ v_1 < v_2 < \dots < v_n $ there exists a real number…

Number Theory · Mathematics 2021-09-22 Tom Bohman , Fei Peng

We observe that an old theorem of Graham implies that for any positive integer $s$, there exists some positive integer $T(s)$ such that every $s$-colouring of $\mathbb{Z}^2$ contains a monochromatic pair of points $(x,y),(x',y')$ with…

Combinatorics · Mathematics 2024-11-19 James Davies

This paper focuses on using curvature and torsion to describe the stability of linear time-invariant system. We prove that for a two-dimensional system $\dot{r}(t)= Ar(t)$, (i) if there exists an initial value, such that zero is not the…

Optimization and Control · Mathematics 2018-09-17 Yuxin Wang , Huafei Sun , Yang Song , Yueqi Cao , Shiqiang Zhang

We show that for every sufficiently large $n$, the number of monotone subsequences of length four in a permutation on $n$ points is at least $\binom{\lfloor n/3 \rfloor}{4} + \binom{\lfloor(n+1)/3\rfloor}{4} + \binom{\lfloor…

Combinatorics · Mathematics 2015-06-03 József Balogh , Ping Hu , Bernard Lidický , Oleg Pikhurko , Balázs Udvari , Jan Volec

In this paper, we consider the isoperimetric problem in the space $\mathbb{R}^N$ with density. Our result states that, if the density f is l.s.c. and converges to a positive limit at infinity, being smaller than this limit far from the…

Analysis of PDEs · Mathematics 2014-11-20 Guido De Philippis , Giovanni Franzina , Aldo Pratelli

A majority edge-coloring of a graph without pendant edges is a coloring of its edges such that, for every vertex $v$ and every color $\alpha$, there are at most as many edges incident to $v$ colored with $\alpha$ as with all other colors.…

Combinatorics · Mathematics 2023-12-05 Rafał Kalinowski , Monika Pilśniak , Marcin Stawiski

We study colorful no-dimensional Tverberg-type problems and obtain several optimal results. A colorful no-dimensional Tverberg-type theorem provides a bound on a radius $R$ such that, for any pairwise disjoint $k$-element subsets…

Metric Geometry · Mathematics 2025-09-29 Polina Barabanshchikova , Grigory Ivanov , Alexander Polyanskii

We prove that for every $\varepsilon>0$ and a nonnegative integer $\omega$ there exist primes $p_1,p_2,\ldots,p_\omega$ such that for $n=p_1p_2\ldots p_\omega$ the height of the cyclotomic polynomial $\Phi_n$ is at least…

Number Theory · Mathematics 2016-06-27 Bartlomiej Bzdega

Let $M$ be a positive integer and $p(n)$ be the number of partitions of a positive integer $n$. Newman's Conjecture asserts that for each integer $r$, there are infinitely many positive integers $n$ such that \[ p(n)\equiv r \pmod{M}. \]…

Number Theory · Mathematics 2025-05-30 Dohoon Choi , Youngmin Lee