Related papers: Complexity of codes for Ramsey positive sets

Solecki has shown that a broad natural class of $G_{\delta}$ ideals of compact sets can be represented through the ideal of nowhere dense subsets of a closed subset of the hyperspace of compact sets. In this note we show that the closed…

In this paper, we give sufficient conditions for Cauchy-completeness of Kobayashi hyperbolic domains in complex manifolds. The first result gives a sufficient condition for completeness for relatively compact domains in several large…

In this article, we study a degenerate version of Ramsey's theorem for pairs and two colors ($\mathsf{RT}^2_2$), in which the homogeneous sets for color 1 are of bounded size. By $\mathsf{RT}^2_2$, it follows that every such coloring admits…

Goppa codes are particularly appealing for cryptographic applications. Every improvement of our knowledge of Goppa codes is of particular interest. In this paper, we present a sufficient and necessary condition for an irreducible monic…

The goal of this paper is to announce there is a single orbit of the c.e. sets with inclusion, $\E$, such that the question of membership in this orbit is $\Sigma^1_1$-complete. This result and proof have a number of nice corollaries: the…

We show that the big Ramsey degrees of every countable universal $u$-uniform $\omega$-edge-labeled hypergraph are infinite for every $u\geq 2$. Together with a recent result of Braunfeld, Chodounsk\'y, de Rancourt, Hubi\v{c}ka, Kawach, and…

Constraint satisfaction problems (CSPs) for first-order reducts of finitely bounded homogeneous structures form a large class of computational problems that might exhibit a complexity dichotomy, P versus NP-complete. A powerful method to…

We show that the well-partial orderedness of the finite downwards closed subsets of $\mathbb{N}^k$ ,ordered by inclusion, is equivalent to the well-foundedness of the ordinal $\omega^{\omega^\omega}$. This was conjectured to be the case by…

The aim of this paper is to prove radial symmetry results for positive weak solutions with finite energy to the following quasilinear doubly critical system \begin{equation} \begin{cases} -\Delta_p u\,=\gamma \frac{u^{p-1}}{|x|^p} +…

Let $\sigma =\{\sigma_{i} | i\in I\}$ be some partition of the set of all primes $\Bbb{P}$, $G$ a finite group and $\sigma (G) =\{\sigma_{i} |\sigma_{i}\cap \pi (G)\ne \emptyset \}$. A set ${\cal H}$ of subgroups of $G$ is said to be a…

In this paper we show that it is relatively consistent with ZFC that every gamma-set is countable while not every strong measure zero set is countable. This answers a question of Paul Szeptycki. A set is a gamma-set iff every omega-cover…

We conjecture that every oriented graph $G$ on $n$ vertices with $\delta ^+ (G) , \delta ^- (G) \geq 5n/12$ contains the square of a Hamilton cycle. We also give a conjectural bound on the minimum semidegree which ensures a perfect packing…

For graph $G$, a connected graph $H$ of order $n$ is said to be $G$-good if $r(G,H)=(\chi(G)-1)(n-1)+s(G)$, where $\chi(G)$ is the chromatic number of $G$ and $s(G)$ is the minimum size of a color class in a $\chi(G)$-coloring of $G$. Let…

We prove Tamura's theorem on partitions of the set of positive integers (a generalization of the more famous Rayleigh-Beatty theorem) using the positive $\mathbb{S}^1$-equivariant symplectic homology.

Let $\Omega\subset\mathbb{R}^{N}$, $N\geq1$, be a smooth bounded domain, and let $m:\Omega\rightarrow\mathbb{R}$ be a possibly sign-changing function. We investigate the existence of positive solutions for the semipositone problem $-\Delta…

We develop novel techniques which allow us to prove a diverse range of results relating to subset sums and complete sequences of positive integers, including solutions to several longstanding open problems. These include: solutions to the…

Let $H\xrightarrow{s} G$ denote that any $s$-coloring of $E(H)$ contains a monochromatic $G$. The degree Ramsey number of a graph $G$, denoted by $R_\Delta(G, s)$, is $\min \{\Delta(H): H \xrightarrow{s} G \}$. We consider degree Ramsey…

A cohesive power of a computable structure is an effective ultrapower where a cohesive set acts as an ultrafilter. Let $\omega$, $\zeta$, and $\eta$ denote the respective order-types of the natural numbers, the integers, and the rationals.…

Let $G$ be a finite abelian group and $s$ be a positive integer. A subset $A$ of $G$ is called a {\em perfect $s$-basis of $G$} if each element of $G$ can be written uniquely as the sum of at most $s$ (not-necessarily-distinct) elements of…

We investigate big Ramsey degrees of finite substructures of the universal countable homogeneous meet-tree and its binary variant. We prove that structures containing antichains have infinite big Ramsey degrees, and the big Ramsey degree of…