Related papers: Oscilation stability for continuous monotone surje…

Let $\Sigma$ be a strictly convex, compact patch of a $C^2$ hypersurface in $\mathbb{R}^n$, with non-vanishing Gaussian curvature and surface measure $d\sigma$ induced by the Lebesgue measure in $\mathbb{R}^n$. The Mizohata--Takeuchi…

We prove that if a continuous piecewise-smooth map on $\mathbb{R}^n$ is comprised of two linear functions, has a bounded orbit, and satisfies a certain non-degeneracy condition, then it has a fixed point. The result has important…

We prove the existence of nowhere continuous bijections that satisfy the Costas property, as well as (countably and uncountably) infinite Golomb rulers. We define and prove the existence of real and rational Costas clouds, namely nowhere…

Given a family of curves $\mathcal{C}$ in the plane, its disjointness graph is the graph whose vertices correspond to the elements of $\mathcal{C}$, and two vertices are joined by an edge if and only if the corresponding sets are disjoint.…

We show that there is always a uniformly antisymmetric f:A-> {0,1} if A subset R is countable. We prove that the continuum hypothesis is equivalent to the statement that there is an f:R-> omega with |S_x| <= 1 for every x in R. If the…

This article is concerned with the energy decay of an infinite memory wave equation with a logarithmic nonlinear term and a frictional damping term. The problem is formulated in a bounded domain in $\mathbb R^d$ ($d\ge3$) with a smooth…

Reed conjectured that for every $\varepsilon>0$ and every integer $\Delta$, there exists $g$ such that the fractional total chromatic number of every graph with maximum degree $\Delta$ and girth at least $g$ is at most…

A Ramsey-like theorem is a statement of the form ``For every 2-coloring of $[\mathbb{N}]^2$, there exists an infinite set~$H \subseteq \mathbb{N}$ such that $[H]^2$ avoids some pattern''. We prove that none of these statements are…

An asymmetric coloring of a graph is a coloring of its vertices that is not preserved by any non-identity automorphism of the graph. The motion of a graph is the minimal degree of its automorphism group, i.e., the minimum number of elements…

We prove that there exist infinitely many coprime numbers $a$, $b$, $c$ with $a+b=c$ and $c>\operatorname{rad}(abc)\exp(6.563\sqrt{\log c}/\log\log c)$. These are the most extremal examples currently known in the $abc$ conjecture, thereby…

We give a counterexample to a conjecture made by Cigler, Jerman and Wojciechowski stating that all posets are conclusive. We also provide combinatorial characterizations for conclusiveness of finite posets and the existence of outer…

It is shown that if every projective set of reals is Lebesgue measurable and has the property of Baire, if every projective set in the plane has a projective uniformization, and if Steel's K exists, then J^K_{\omega_1} \models "there are…

We show that for every $\varepsilon>0$ there is an absolute constant $c(\varepsilon)>0$ such that the following is true. The union of any $n$ arithmetic progressions, each of length $n$, with pairwise distinct differences must consist of at…

For a domain $\Omega \subset \mathbb{R}^n$ and a small number $\frak{T} > 0$, let \[ \mathcal{E}_0(\Omega) = \lambda_1(\Omega) + {\frak{T}} {\text{tor}}(\Omega) = \inf_{u, w \in H^1_0(\Omega)\setminus \{0\}} \frac{\int |\nabla u|^2}{\int…

We prove several results which imply the following consequences. For any $\varepsilon>0$ and any sufficiently large prime $p$, if $\cI_1,\ldots, \cI_{13}$ are intervals of cardinalities $|\cI_j|>p^{1/4+\varepsilon}$ and $abc\not\equiv…

We show that, for every $\epsilon>0$, the 4-regular tree has an fiid 4-coloring where a given vertex is assigned the 4th color with probability at most $\epsilon$. We also construct 5-colorings of $T_6$ improving known bounds on the…

We report on the existence and stability of multicolor lattice vortex solitons constituted by coupled fundamental frequency and second-harmonic waves in optical lattices in quadratic nonlinear media. It is shown that the solitons are stable…

For any countably infinite graph $G$, Ramsey's theorem guarantees an infinite monochromatic copy of $G$ in any $r$-coloring of the edges of the countably infinite complete graph $K_\mathbb{N}$. Taking this a step further, it is natural to…

We introduce the concept of constant $2$-labelling of a weighted graph and show how it can be used to obtain perfect weighted coverings. Roughly speaking, a constant $2$-labelling of a weighted graph is a $2$-colouring of its vertex set…

We study the decidability of the Skolem Problem, the Positivity Problem, and the Ultimate Positivity Problem for linear recurrences with real number initial values and real number coefficients in the bit-model of real computation. We show…