English
Related papers

Related papers: Special cases and equivalent forms of Katznelson's…

200 papers

The paper deals with a problem of Additive Combinatorics. Let ${\mathbf G}$ be a finite abelian group of order $N$. We prove that the number of subset triples $A,B,C\subset {\mathbf G}$ such that for any $x\in A$, $y\in B$ and $z\in C$ one…

Number Theory · Mathematics 2020-12-29 Aliaksei Semchankau , Dmitry Shabanov , Ilya Shkredov

Motivated by a problem in additive Ramsey theory, we extend Todorcevic's partitions of three-dimensional combinatorial cubes to handle additional three-dimensional objects. As a corollary, we get that if the continuum hypothesis fails, then…

Logic · Mathematics 2023-01-05 Ido Feldman , Assaf Rinot

A countable graph is ultrahomogeneous if every isomorphism between finite induced subgraphs can be extended to an automorphism. Woodrow and Lachlan showed that there are essentially four types of such countably infinite graphs: the random…

Group Theory · Mathematics 2017-01-30 J. Jonušas , J. D. Mitchell

The goal of this paper is to generalize, refine, and improve results on large intersections. We show that if $G$ is a countable abelian group and $\varphi, \psi : G \to G$ are homomorphisms such that at least two of the three subgroups…

Dynamical Systems · Mathematics 2023-02-28 Ethan Ackelsberg , Vitaly Bergelson , Or Shalom

We study the relationship between hyperfiniteness and problems in Borel graph combinatorics by adapting game-theoretic techniques introduced by Marks to the hyperfinite setting. We compute the possible Borel chromatic numbers and edge…

We say that $S\subset\mathbb Z$ is a set of $k$-recurrence if for every measure preserving transformation $T$ of a probability measure space $(X,\mu)$ and every $A\subseteq X$ with $\mu(A)>0$, there is an $n\in S$ such that $\mu(A\cap…

Dynamical Systems · Mathematics 2024-05-08 John T. Griesmer

We present proofs of the basic isopermetric structure theory, obtaining some new simplified proofs. As an application, we obtain simple descriptions for subsets $S$ of an abelian group with $|kS|\le k|S|-k+1$ or $|kS-rS|- (k+r)|S|,$ where…

Combinatorics · Mathematics 2010-11-09 Yahya Ould Hamidoune

We study the Borel complexity of sets of normal numbers in several numeration systems. Taking a dynamical point of view, we offer a unified treatment for continued fraction expansions and base $r$ expansions, and their various…

Dynamical Systems · Mathematics 2020-01-17 Dylan Airey , Steve Jackson , Dominik Kwietniak , Bill Mance

For any dynamical system $T:X\rightarrow X$ of a compact metric space $X$ with $g-$almost product property and uniform separation property, under the assumptions that the periodic points are dense in $X$ and the periodic measures are dense…

Dynamical Systems · Mathematics 2015-11-19 Xueting Tian

Let K be the kernel of an epimorphism G -> Z, where G is a finitely presented group. If K has infinitely many subgroups of index 2, 3, or 4, then it has uncountably many. Moreover, if K is the commutator subgroup of a classical knot group…

Geometric Topology · Mathematics 2007-05-23 Daniel S. Silver , Susan G. Williams

We give an affirmative answer to the following question: Is any Borel subset of a Cantor set $\textbf{ C}$ a sum of a countable number of pairwise disjoint $h$-homogeneous subspaces that are closed in $X$? It follows that every Borel set $X…

Logic · Mathematics 2011-02-17 Alexey Ostrovsky

A nonempty set $F$ is Schreier if $\min F\ge |F|$. Bird observed that counting Schreier sets in a certain way produces the Fibonacci sequence. Since then, various connections between variants of Schreier sets and well-known sequences have…

Combinatorics · Mathematics 2025-09-08 Hung Viet Chu , Yubo Geng , Julian King , Steven J. Miller , Garrett Tresch , Zachary Louis Vasseur

We study the complexity of the classification problem for countable models of set theory (ZFC). We prove that the classification of arbitrary countable models of ZFC is Borel complete, meaning that it is as complex as it can conceivably be.…

Logic · Mathematics 2020-07-21 John Clemens , Samuel Coskey , Samuel Dworetzky

Global amoebas are a wide and rich family of graphs that emerged from the study of certain Ramsey-Tur\'an problems in $2$-colorings of the edges of the complete graph $K_n$ that deal with the appearance of unavoidable patterns once a…

Combinatorics · Mathematics 2021-04-21 Adriana Hansberg , Amanda Montejano , Yair Caro

We investigate topologies on groups which arise naturally from their algebraic structure, including the Frech\'et-Markov, Hausdorff-Markov, and various kinds of Zariski topologies. Answering a question by Dikranjan and Toller, we show that…

Group Theory · Mathematics 2025-06-24 S. Bardyla , L. Elliott , J. D. Mitchell , Y. Péresse

We prove a criterion for continuity of bilinear maps on countable direct sums of topological vector spaces. As a first application, we get a new proof for the fact (due to Hirai et al. 2001) that the map taking a pair of test functions on…

Functional Analysis · Mathematics 2011-12-22 Helge Glockner

A recurrence equation is a discrete integrable equation whose solutions are all periodic and the period is fixed. We show that infinitely many recurrence equations can be derived from the information about invariant varieties of periodic…

Mathematical Physics · Physics 2009-11-11 Satoru Saito , Noriko Saitoh

Recently, connections have been explored between the complexity of finite problems in graph theory and the complexity of their infinite counterparts. As is shown in our paper (and in independent work of Tirza Hirst and D. Harel from a…

Logic · Mathematics 2009-09-25 Jeffry L. Hirst , Steffen Lempp

We establish multiple recurrence results for pretentious measure-preserving multiplicative actions along generalized Pythagorean triples, that is, solutions to the equation $ax^2 + b y^2 = c z^2$. This confirms the ergodic-theoretic form of…

Dynamical Systems · Mathematics 2025-08-26 Nikos Frantzikinakis , Andreas Mountakis

Let $G$ be a group. The BCI problem asks whether two Haar graphs of $G$ are isomorphic if and only if they are isomorphic by an element of an explicit list of isomorphisms. We first generalize this problem in a natural way and give a…

Combinatorics · Mathematics 2024-11-13 Ted Dobson , Gregory Robson