Related papers: Colorful fractional Helly theorem via weak saturat…
Our aim is to constrain the properties of dark matter halos inhabiting high density environments, such as is the case in massive galaxy clusters. We use galaxy-galaxy lensing techniques that utilize a maximum likelihood method to constrain…
We advance a probabilistic approach to the Hadwiger-Nelson problem initially developed by the Polymath16 project, in particular relating the approach to finite unit-distance graphs. We define the numerical \textit{badness} of a given…
Ramsey's theorem, concerning the guarantee of certain monochromatic patterns in large enough edge-coloured complete graphs, is a fundamental result in combinatorial mathematics. In this work, we highlight the connection between this…
Ramsey's theorem states that each coloring has an infinite homogeneous set, but these sets can be arbitrarily spread out. Paul Erdos and Fred Galvin proved that for each coloring f, there is an infinite set that is "packed together" which…
The Shapley-Folkman theorem shows that Minkowski averages of uniformly bounded sets tend to be convex when the number of terms in the sum becomes much larger than the ambient dimension. In optimization, Aubin and Ekeland [1976] show that…
The Calder\'on problem for the fractional Schr\"odinger equation was introduced in the work \cite{GSU}, which gave a global uniqueness result also in the partial data case. This article improves this result in two ways. First, we prove a…
A possible solution to the small scale problems of the cold dark matter (CDM) scenario is that the dark matter consists of two components, a cold and a warm one. We perform a set of high resolution simulations of the Milky Way halo varying…
We describe a rational approach to reduce the computational and communication complexities of lossless point-to-point compression for computation with side information. The traditional method relies on building a characteristic graph with…
Ramsey's theorem states that for any coloring of the n-element subsets of N with finitely many colors, there is an infinite set H such that all n-element subsets of H have the same color. The strength of consequences of Ramsey's theorem has…
We study the weak universality of the two-dimensional fractional nonlinear wave equation. For a sequence of Hamiltonians of high-degree potentials scaling to the fractional $\Phi_2^4$, we first establish a \emph{sufficient and almost…
We consider extensions of the language of Peano arithmetic by transfinitely iterated truth definitions satisfying uniform Tarskian biconditionals. Without further axioms, such theories are known to be conservative extensions of the original…
We study amalgamation properties in a family of abstract elementary classes that we call coloring classes. The family includes the examples previously studied in previous work of Baldwin, Kolesnikov, and Shelah. We establish that the…
In this paper, we investigate the chiral boundary value problem for the Landau-Lifshitz equation with helical derivatives. By introducing Sobolev spaces adapted to the helical derivative and establishing energy estimates that are compatible…
The two model-theoretic concepts of weak saturation and weak amalgamation property are studied in the context of accessible categories. We relate these two concepts providing sufficient conditions for existence and uniqueness of weakly…
We study a generalisation of Vizing's theorem, where the goal is to simultaneously colour the edges of graphs $G_1,\dots,G_k$ with few colours. We obtain asymptotically optimal bounds for the required number of colours in terms of the…
In this paper we examine the reverse mathematical strength of a variation of Hindman's Theorem HT constructed by essentially combining HT with the Thin Set Theorem TS to obtain a principle which we call thin-HT. thin-HT says that every…
Weak diameter coloring of graphs recently attracted attention partially due to its connection to asymptotic dimension of metric spaces. We consider weak diameter list-coloring of graphs in this paper. Dvo\v{r}\'{a}k and Norin proved that…
We construct a bipartite generalization of Alon and Szegedy's nearly orthogonal vectors, thereby obtaining strong bounds for several extremal problems involving the Lov\'asz theta function, vector chromatic number, minimum semidefinite…
Given a finite coloring (or finite partition) of the free semigroup $A^+$ over a set $A$, we consider various types of monochromatic factorizations of right sided infinite words $x\in A^\omega$. Some stronger versions of the usual notion of…
We continue the development of the basic theory of generalized derivatives as introduced in \cite{JPA} and give some of their applications. In particular, we formulate versions of a weak maximum principle, Rolle's theorem, the Mean value…