English
Related papers

Related papers: Omitting cohesive sets

200 papers

A tree is pathwise-random if all of its paths are Martin-Lof random. We show that (a) no weakly 2-random real computes a perfect pathwise-random tree; it follows that the class of perfect pathwise-random trees is null, with respect to any…

Logic · Mathematics 2024-05-24 George Barmpalias , Wei Wang

Clemens' conjecture states that the the number of rational curve in a generic quintic threefold is finite. If it is false we prove that certain periods of rational curves in such a quintic threefold must vanish. Our method is based on a…

Algebraic Geometry · Mathematics 2022-02-18 Hossein Movasati

A system of \ell linear equations in p unknowns Mx=b is said to have the removal property if every set S \subseteq {1,...,n} which contains o(n^{p-\ell}) solutions of Mx=b can be turned into a set S' containing no solution of Mx=b, by the…

Combinatorics · Mathematics 2014-02-26 Asaf Shapira

We say that a real X is n-generic relative to a perfect tree T if X is a path through T and for all Sigma^0_n (T) sets S, there exists a number k such that either X|k is in S or for all tau in T extending X|k we have tau is not in S. A real…

Logic · Mathematics 2008-07-19 Bernard A. Anderson

We prove the existence of primitive sets (sets of integers in which no element divides another) in which the gap between any two consecutive terms is substantially smaller than the best known upper bound for the gaps in the sequence of…

Number Theory · Mathematics 2019-02-06 Nathan McNew

A 3-simplex is a collection of four sets A_1,...,A_4 with empty intersection such that any three of them have nonempty intersection. We show that the maximum size of a set system on n elements without a 3-simplex is $2^{n-1} +…

Combinatorics · Mathematics 2010-10-26 Michael E. Picollelli

A set $B$ is said to be \emph{sum-free} if there are no $x,y,z\in B$ with $x+y=z$. We show that there exists a constant $c>0$ such that any set $A$ of $n$ integers contains a sum-free subset $A'$ of size $|A'|\geqslant n/3+c\log \log n$.…

Number Theory · Mathematics 2025-02-13 Benjamin Bedert

Let $F:\Bbb C^n\to\Bbb C^n$ be a polynomial mapping with a non vanishing Jacobian. If the set $S_F$ of non-properness of $F$ is smooth, then $F$ is a surjective mapping. Moreover, the set $S_F$ can not be connected (this is the…

Algebraic Geometry · Mathematics 2021-09-09 Zbigniew Jelonek

We present non-trivial examples of accumulation of secants for orbits (of real analytic three dimensional vector fields) having the origin as only $\omega$-limit point. These non-trivial sets have the structure of a proper algebraic variety…

Classical Analysis and ODEs · Mathematics 2016-11-04 André Belotto

We prove that if $p$ is a selective ultrafilter then ${\mathbb Q}^{(\kappa)}$ has a $p$-compact group topology without non-trivial convergent sequences, for each infinite cardinal $\kappa =\kappa^\omega$. In particular, this gives the first…

General Topology · Mathematics 2019-04-15 Matheus Koveroff Bellini , Vinicius de Oliveira Rodrigues , Artur Hideyuki Tomita

We study a family of infinite-type Coxeter groups defined by the avoidance of certain rank 3 parabolic subgroups. For this family, rationally smooth elements can be detected by looking at only a few coefficients of the Poincar\'{e}…

Combinatorics · Mathematics 2014-08-08 Edward Richmond , William Slofstra

A graph H is called common if the total number of copies of H in every graph and its complement asymptotically minimizes for random graphs. A former conjecture of Burr and Rosta, extending a conjecture of Erdos asserted that every graph is…

Combinatorics · Mathematics 2017-07-31 Hamed Hatami , Jan Hladky , Daniel Kral , Serguei Norine , Alexander Razborov

We classify the ultrahomogeneous complete 3-edge-coloured graphs (3-graphs) with simple theory. This extends Lachlan's result (a corollary of the Effective Classification Theorem for stable structures) classifying the stable homogeneous…

Logic · Mathematics 2015-05-07 Andres Aranda

We prove a number of elementary facts about computability in partial combinatory algebras (pca's). We disprove a suggestion made by Kreisel about using Friedberg numberings to construct extensional pca's. We then discuss separability and…

Logic · Mathematics 2020-02-06 S. A. Terwijn

The notion of generic reducibility was introduced by A.Rybalov in his CiE 2018 paper: a set A is generically reducible to set B if there exists a total computable function f that m-reduces A to B such that the f-preimage of every set that…

Logic · Mathematics 2018-10-02 Ruslan Ishkuvatov

A problem of recent interest has been to study how large subsets of the natural numbers can be while avoiding 3-term geometric progressions. Building on recent progress on this problem, we consider the analogous problem over quadratic…

We construct normal rationally connected varieties (of arbitrarily large dimension) not containing any smooth rational curves.

Algebraic Geometry · Mathematics 2018-05-09 Ilya Karzhemanov

Oeljeklaus-Toma (OT) manifolds are complex non-K\"ahler manifolds whose construction arises from specific number fields. In this note, we compute their de Rham cohomology in terms of invariants associated to the background number field.…

Differential Geometry · Mathematics 2018-10-01 Nicolina Istrati , Alexandra Otiman

Let $k$ be a number field and $B$ be a central simple algebra over $k$ of dimension $p^2$ where $p$ is prime. In the case that $p=2$ we assume that $B$ is not totally definite. In this paper we study sets of pairwise nonisomorphic maximal…

Number Theory · Mathematics 2014-09-04 Benjamin Linowitz

Let D denote the (n-1)-dimensional simplex. Let Y be a random 2-dimensional subcomplex of D obtained by starting with the full 1-skeleton of D and then adding each 2-simplex independently with probability p. For a fixed c>0 it is shown that…

Combinatorics · Mathematics 2013-08-20 Roy Meshulam