Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2404.04502

The interplay between additive and symmetric large sets and their combinatorial applications

Arkabrata Ghosh·Sayan Goswami·Sourav Kanti Patra
View original source ↗Read source document ↗Export metadata ↓

Abstract

The study of symmetric structures is a new trend in Ramsey theory. Recently in [7], Di Nasso initiated a systematic study of symmetrization of classical Ramsey theoretical results, and proved a symmetric version of several Ramsey theoretic results. In this paper Di Nasso asked if his method could be adapted to find new non-linear Diophantine equations that are partition regular [7,Final remarks (4)]. By analyzing additive, multiplicative, and symmetric large sets, we construct new partition regular equations that give a first affirmative answer to this question. A special case of our result shows that if $P$ is a polynomial with no constant term then the equation $x+P(y-x)=z+w+zw$, where $y\neq x$ is partition regular. Also we prove several new monochromatic patterns involving additive, multiplicative, and symmetric structures. Throughout our work, we use tools from the Algebra of the Stone-Čech Compactifications of discrete semigroups.

Explore related subjects

math.CO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Arkabrata Ghosh, Sayan Goswami, Sourav Kanti Patra. 2025-05-31. The interplay between additive and symmetric large sets and their combinatorial applications. https://arxiv.org/abs/2404.04502

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO↗
arXiv2026

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO↗