Related papers: Sets of integers avoiding congruent subsets

We provide examples of a nested sequences of sets {S_n}, suitably sparse, residing in a group G, for which multidimensional averages fail converge pointwise for f in certain L^p spaces, but do converge in others, for any free group action…

The $h$-fold sumset of a set $A$ of integers is the set of all sums of $h$ not necessarily distinct elements of $A$. Let $(A_q)_{q=1}^{\infty}$ be a strictly decreasing sequence of sets of integers and let $A = \bigcap_{q=1}^{\infty} A_q$.…

We describe general connections between intersective properties of sets in Abelian groups and positive exponential sums. In particular, given a set $A$ the maximal size of a set whose difference set avoids $A$ will be related to positive…

Let $\Gamma$ be an abelian group and $g \geq h \geq 2$ be integers. A set $A \subset \Gamma$ is a $C_h[g]$-set if given any set $X \subset \Gamma$ with $|X| = k$, and any set $\{ k_1 , \dots , k_g \} \subset \Gamma$, at least one of the…

We study problems on uniqueness sets ($U$-sets) for multiple Walsh series converging over cubes and the properties of the coefficients of such series. New broad classes of $U$-sets are constructed. In particular, it is proved that…

We show that, in contrast to the integers setting, almost all even order abelian groups $G$ have exponentially fewer maximal sum-free sets than $2^{\mu(G)/2}$, where $\mu(G)$ denotes the size of a largest sum-free set in $G$. This confirms…

Let $A$ be a gentle algebra. For every collection of string and band diagrammes, we consider the constructible subset of the variety of representations containing all modules with this underlying diagramme. We study degenerations of such…

We give model-theoretic characterizations of UHF algebras and of AF algebras as C*-algebras that omit certain sets of types.

The set $\mathcal{R}_{G}(h,k)$ consists of all possible sizes for the $h$-fold sumset of sets containing $k$ elements from an additive abelian group $G$. The exact makeup of this set is still unknown, but there has been progress towards…

This paper presents a collection of experimental results regarding permutation pattern avoidance, focusing on cases where there are "many" patterns to be avoided.

A $\textit{covering system}$ is a collection of integer congruences such that every integer satisfies at least one congruence in the collection. A covering system is called $\textit{distinct}$ if all of its moduli are distinct. An expansive…

We discuss some types of congruences on Menger algebras of rank $n$, which are generalizations of the principal left and right congruences on semigroups. We also study congruences admitting various types of cancellations and describe their…

In this paper we continue our study, begun in part I, of the exceptional set of integers, not restricted by elementary congruence conditions, which cannot be represented as sums of three or four squares of primes. We correct a serious…

We present a variety of new results on finite sets A of integers for which the sumset A+A is larger than the difference set A-A, so-called MSTD (more sums than differences) sets. First we show that there is, up to affine transformation, a…

Counterexamples to the Modular Isomorphism Problem were discovered recently. These are non-isomorphic finite $2$-groups $G$ and $H$ that have isomorphic group algebras over the field $\mathbb{Z}/2\mathbb{Z}$ and non-isomorphic group…

We investigate the notion of almost avoiding a permutation: $\pi$ almost avoids $\beta$ if one can remove a single entry from $\pi$ to obtain a $\beta$-avoiding permutation.

Let $\mathcal{A}_1,\ldots,\mathcal{A}_m$ be families of $k$-subsets of an $n$-set. Suppose that one cannot choose pairwise disjoint edges from $s+1$ distinct families. Subject to this condition we investigate the maximum of…

We find finite-state recurrences to enumerate the words on the alphabet $[n]^r$ which avoid the patterns 123 and $1k(k-1)\dots2$, and, separately, the words which avoid the patterns 1234 and $1k(k-1)\dots2$.

We prove that if a set is `large' in the sense of Erd\H{o}s, then it approximates arbitrarily long arithmetic progressions in a strong quantitative sense. More specifically, expressing the error in the approximation in terms of the gap…

A set X subseteq R is strongly meager if for every measure zero set H, X+H not= R. Let SM denote the collection of strongly meager sets. We show that assuming CH, SM is not an ideal.