English
Related papers

Related papers: Ramsey theory for layered semigroups

200 papers

We give asymptotically optimal constructions in generalized Ramsey theory using results about conflict-free hypergraph matchings. For example, we present an edge-coloring of $K_{n,n}$ with $2n/3 + o(n)$ colors such that each $4$-cycle…

Combinatorics · Mathematics 2022-08-29 Felix Joos , Dhruv Mubayi

We study algebraic varieties parametrized by topological spaces and enlarge the domains of Lawson homology and morphic cohomology to this category. We prove a Lawson suspension theorem and splitting theorem. A version of Friedlander-Lawson…

Algebraic Geometry · Mathematics 2012-01-04 J. H. Teh

Size-Ramsey numbers are a central notion in combinatorics and have been widely studied since their introduction by Erd\H{o}s, Faudree, Rousseau and Schelp in 1978. Research has mainly focused on the size-Ramsey numbers of $n$-vertex graphs…

Combinatorics · Mathematics 2023-09-06 Nemanja Draganić , Marc Kaufmann , David Munhá Correia , Kalina Petrova , Raphael Steiner

We investigate the notion of a semi-retraction between two first order structures (in typically different signatures) that was introduced by the second author as a link between the Ramsey property and generalized indiscernible sequences. We…

Logic · Mathematics 2024-03-05 Dana Bartošová , Lynn Scow

We prove that, for a finitely generated residually finite group, having solvable word problem is not a sufficient condition to be a subgroup of a finitely presented residually finite group. The obstruction is given by a residually finite…

Group Theory · Mathematics 2021-03-19 Emmanuel Rauzy

We show a short proof of Higman's lemma using Friedman's adjacent Ramsey theorem for pairs. This provides an alternative proof of the known upper bound for the reverse mathematical status of Higman's lemma and that of its miniaturised…

Logic · Mathematics 2016-03-01 Florian Pelupessy

Let $X$ be an uncountable Polish space and let $\mathcal{H}$ be the Hindman ideal, that is, the family of all $S\subseteq \omega$ which are not $IP$-sets. For each sequence $x=(x_n)_{n \in \omega}$ taking values in $X$, let…

General Topology · Mathematics 2026-01-21 Rafał Filipów , Adam Kwela , Paolo Leonetti

In a recent work [3], the authors established new results about general linear Mahler systems in several variables from the perspective of transcendental number theory, such as a multivariate extension of Nishioka's theorem. Working with…

Number Theory · Mathematics 2022-10-27 Boris Adamczewski , Colin Faverjon

S.B. Rao conjectured in 1971 that graphic degree sequences are well quasi ordered by a relation defined in terms of the induced subgraph relation. In 2008, M. Chudnovsky and P. Seymour proved this long standing Rao's Conjecture by giving…

Combinatorics · Mathematics 2010-10-27 Christian Joseph Altomare

Given a dense additive subgroup $G$ of $\mathbb R$ containing $\mathbb Z$, we consider its intersection $\mathbb G$ with the interval $[0,1[$ with the induced order and the group structure given by addition modulo $1$. We axiomatize the…

Logic · Mathematics 2017-07-20 Luc Bélair , Françoise Point

An n-vertex graph is called C-Ramsey if it has no clique or independent set of size C log n. All known constructions of Ramsey graphs involve randomness in an essential way, and there is an ongoing line of research towards showing that in…

Combinatorics · Mathematics 2021-09-08 Matthew Kwan , Benny Sudakov

Let G be a finite graph with the non-k-order property (essentially, a uniform finite bound on the size of an induced sub-half-graph). A major result of the paper applies model-theoretic arguments to obtain a stronger version of…

Logic · Mathematics 2015-08-20 M. Malliaris , S. Shelah

Hirst investigated a slight variant of Hindman's Finite Sums Theorem -- called Hilbert's Theorem -- and proved it equivalent over $\RCA_0$ to the Infinite Pigeonhole Principle for all colors. This gave the first example of a natural…

Logic · Mathematics 2024-01-10 Lorenzo Carlucci

In this article we aim to develop from first principles a theory of sum sets and partial sum sets, which are defined analogously to difference sets and partial difference sets. We obtain non-existence results and characterisations. In…

Combinatorics · Mathematics 2012-06-26 Robert S. Coulter , Todd Gutekunst

Szemer\'edi's regularity lemma is a fundamental tool in extremal combinatorics. However, the original version is only helpful in studying dense graphs. In the 1990s, Kohayakawa and R\"odl proved an analogue of Szemer\'edi's regularity lemma…

Combinatorics · Mathematics 2015-10-26 David Conlon , Jacob Fox , Yufei Zhao

In 2012 M. Soki\'c proved that the class of all finite permutations has the Ramsey property. Using different strategies the same result was then reproved in 2013 by J. B\"ottcher and J. Foniok, in 2014 by M. Bodirsky and in 2015 yet another…

Combinatorics · Mathematics 2017-10-31 Dragan Masulovic

Ramsey--Tur\'an theory considers Tur\'an type questions in Ramsey-context, asking for the existence of a small subgraph in a graph $G$ where the complement $\overline{G}$ lacks an appropriate subgraph $F$, such as a clique of linear size.…

Combinatorics · Mathematics 2024-11-28 Jie Han , Seonghyuk Im , Jaehoon Kim , Donglei Yang

For each integer q>0 there is a cohomology theory such that the zero cohomology group of a manifold N of dimension n is a certain group of cobordism classes of proper fold maps of manifolds of dimension n+q into N. We prove a splitting…

Geometric Topology · Mathematics 2012-03-06 Rustam Sadykov

We investigate the intersection problem for finite semigroups, which asks for a given set of regular languages, represented by recognizing morphisms to finite semigroups, whether there exists a word contained in their intersection. We…

Formal Languages and Automata Theory · Computer Science 2018-06-14 Lukas Fleischer

We prove a sharp structural result concerning finite colorings of pairs in well-founded trees.

Combinatorics · Mathematics 2019-05-17 R. M. Causey , C. Doebele