English
Related papers

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

200 papers

A sequence of integers $ \{ s_n \}_{n \in \mathbb{N}} $ is called a T-sequence if there exists a Hausdorff group topology on $ \mathbb{Z} $ such that $ \{ s_n \}_{n \in \mathbb{N}} $ converges to zero. For every finite set of primes $ S $…

Group Theory · Mathematics 2019-11-28 Saveliy Skresanov

In this paper we consider the Borel combinatorics of Schreier graphs of $\mathbb{Z}$-actions with arbitrary finite generating sets. We formulate the Borel combinatorics in terms of existence of Borel equivariant maps from…

Combinatorics · Mathematics 2025-11-03 Su Gao , Yingying Jiang , Tianhao Wang

Colouring problems arising from group-based constructions provide a natural link between combinatorics and algebra, particularly in the study of Cayley graphs and Latin squares. We introduce the notion of colouring bijections of finite…

Combinatorics · Mathematics 2026-03-25 Piotr Grzeszczuk

Let $G$ be a discrete abelian group. F{\o}lner showed that if $A \subseteq G$ has positive upper Banach density, then $A - A$ contains an almost Bohr set -- a set of the form $B \setminus E$ where $B$ is a Bohr set and $E$ has zero Banach…

Dynamical Systems · Mathematics 2026-05-27 Pierre-Yves Bienvenu , John T. Griesmer , Anh N. Le , Thái Hoàng Lê

Let $G$ be a countable abelian group. We study ergodic averages associated with configurations of the form $\{ag,bg,(a+b)g\}$ for some $a,b\in\mathbb{Z}$. Under some assumptions on $G$, we prove that the universal characteristic factor for…

Dynamical Systems · Mathematics 2022-01-12 Or Shalom

Let $F$ be a graph. We say that a hypergraph $H$ is a {\it Berge}-$F$ if there is a bijection $f : E(F) \rightarrow E(H )$ such that $e \subseteq f(e)$ for every $e \in E(F)$. Note that Berge-$F$ actually denotes a class of hypergraphs. The…

Combinatorics · Mathematics 2017-06-15 Cory Palmer , Michael Tait , Craig Timmons , Adam Zsolt Wagner

A graph $G$ covers a graph $H$ if there exists a locally bijective homomorphism from $G$ to $H$. We deal with regular covers in which this locally bijective homomorphism is prescribed by an action of a subgroup of ${\rm Aut}(G)$. Regular…

Combinatorics · Mathematics 2014-05-29 Jiří Fiala , Pavel Klavík , Jan Kratochvíl , Roman Nedela

In this article, we investigate homogeneous versions of certain nonlinear Ramsey-theoretic results, with three significant applications. As the first application, we prove that for every finite coloring of $\mathbb{Z}^+$, there exist an…

Combinatorics · Mathematics 2025-04-16 Sukumar Das Adhikari , Sayan Goswami

Fix an abelian variety $A_0$ and a non-isotrivial abelian scheme over a smooth irreducible curve, both defined over the algebraic numbers. Consider the union of all images of translates of a fixed finite-rank subgroup of $A_0$, also defined…

Number Theory · Mathematics 2021-10-05 Gabriel Andreas Dill

We generalize the polynomial Szemer\'{e}di theorem to intersective polynomials over the ring of integers of an algebraic number field, by which we mean polynomials having a common root modulo every ideal. This leads to the existence of new…

Dynamical Systems · Mathematics 2014-09-29 Vitaly Bergelson , Donald Robertson

In this paper we are interested in the fine-grained complexity of deciding whether there is a homomorphism from an input graph $G$ to a fixed graph $H$ (the $H$-Coloring problem). The starting point is that these problems can be viewed as…

Computational Complexity · Computer Science 2024-04-16 Ambroise Baril , Miguel Couceiro , Victor Lagerkvist

According to Markov, a subset of an abelian group G of the form {x in G: nx=a}, for some integer n and some element a of G, is an elementary algebraic set; finite unions of elementary algebraic sets are called algebraic sets. We prove that…

Group Theory · Mathematics 2010-10-01 Dikran Dikranjan , Dmitri Shakhmatov

We explore a family of nested recurrence relations with arbitrary levels of nesting, which have an interpretation in terms of fixed points of morphisms over a countably infinite alphabet. Recurrences in this family are related to a number…

Combinatorics · Mathematics 2013-07-02 Marcel Celaya , Frank Ruskey

For separable $C^*$-algebras $A$ and $B$, we define a topology on the set $[[A, B]]$ consisting of homotopy classes of asymptotic morphisms from $A$ to $B$. This gives an enrichment of the Connes--Higson asymptotic category over topological…

Operator Algebras · Mathematics 2024-10-21 José R. Carrión , Christopher Schafhauser

We prove that many seemingly simple theories have Borel complete reducts. Specifically, if a countable theory has uncountably many complete 1-types, then it has a Borel complete reduct. Similarly, if $Th(M)$ is not small, then $M^{eq}$ has…

Logic · Mathematics 2021-09-21 Michael C. Laskowski , Douglas S. Ulrich

Given a graph $G$, the Bell $k$-coloring graph $\mathcal{B}_k(G)$ has vertices given by partitions of $V(G)$ into $k$ independent sets (allowing empty parts), with two partitions adjacent if they differ only in the placement of a single…

Combinatorics · Mathematics 2025-12-12 Shamil Asgarli , Sara Krehbiel , Simon MacLean

In a recent paper, Caro, Lauri, Mifsud, Yuster, and Zarb ask which parameters $r$ and $c$ admit the existence of an $r$-regular graph such that the neighborhood of each vertex induces exactly $c$ edges. They show that every $r$ with $c$…

Combinatorics · Mathematics 2025-07-22 Nathan S. Sheffield , Zoe Xi

For an arbitrary homogeneous linear recurrence sequence of order d with constant coefficients, we derive recurrence relations for all subsequences with indices in arithmetic progression. The coefficients of these recurrences are given…

Number Theory · Mathematics 2016-11-29 Daniel Birmajer , Juan B. Gil , Michael D. Weiner

We present a system of axioms motivated by a topological intuition: The set of subsets of any set is a topology on that set. On the one hand, this system is a common weakening of Zermelo-Fraenkel set theory ZF, the positive set theory GPK…

Logic · Mathematics 2012-06-12 Andreas Fackler

In this paper we continue the study of a natural generalization of Tur\'an's forbidden subgraph problem and the Ruzsa-Szemer\'edi problem. Let $ex_F(n,G)$ denote the maximum number of edge-disjoint copies of a fixed simple graph $F$ that…

Combinatorics · Mathematics 2024-04-02 Benedek Kovács , Zoltán Lóránt Nagy
‹ Prev 1 4 5 6 7 8 10 Next ›