English
Related papers

Related papers: Sets of integers avoiding congruent subsets

200 papers

We study the isoperimetric problem in H-type groups and Grushin spaces, emphasizing a relation between them. We prove existence, symmetry and regularity properties of isoperimetric sets, under a symmetry assumption that depends on the…

Optimization and Control · Mathematics 2020-12-02 Valentina Franceschi , Roberto Monti

We consider avoiding squares and overlaps over the natural numbers, using a greedy algorithm that chooses the least possible integer at each step; the word generated is lexicographically least among all such infinite words. In the case of…

Combinatorics · Mathematics 2009-04-12 Mathieu Guay-Paquet , Jeffrey Shallit

In this paper we investigate how small the density of a multiplicative basis of order $h$ can be in $\{1,2,\dots,n\}$ and in $\mathbb{Z}^+$. Furthermore, a related problem of Erd\H os is also studied: How dense can a set of integers be, if…

Number Theory · Mathematics 2016-02-23 Péter Pál Pach , Csaba Sándor

Sharpening (a particular case of) a result of Szemeredi and Vu and extending earlier results of Sarkozy and ourselves, we find, subject to some technical restrictions, a sharp threshold for the number of integer sets needed for their sumset…

Number Theory · Mathematics 2008-06-30 Vsevolod F. Lev

In this note, we prove an obstruction theorem for the existence of A infinite-structures over a commutative ring R on an algebra A associative up to homotopy, in terms of the Hochschild cohomology of the associative algebra H(A). The hidden…

Rings and Algebras · Mathematics 2011-10-12 Muriel Livernet

The structure of the defining ideal of the semigroup ring $k[H]$ of a numerical semigroup $H$ over a field $k$ is described, when the pseudo-Frobenius numbers of $H$ are multiples of a fixed integer.

Commutative Algebra · Mathematics 2017-05-22 Shiro Goto , Do Van Kien , Naoyuki Matsuoka , Hoang Le Truong

We construct subsets of {1,...,N} of cardinality at least N exp(-C(log N)^{1/(k+1)}) which do not contain arithmetic progressions of length 2^k+1. This extends a result of Behrend (1946) concerning sets which do not contain aritmetic…

Combinatorics · Mathematics 2007-05-23 Izabella Laba , Michael T. Lacey

Let~$A$ be a set of nonnegative integers. Let~$(h A)^{(t)}$ be the set of all integers in the sumset~$hA$ that have at least~$t$ representations as a sum of~$h$ elements of~$A$. In this paper, we prove that, if~$k \geq 2$,…

Number Theory · Mathematics 2020-12-23 Jun-Yu Zhou , Quan-Hui Yang

We show that for every positive integer $k$ there are positive constants $C$ and $c$ such that if $A$ is a subset of $\{1, 2, \dots, n\}$ of size at least $C n^{1/k}$, then, for some $d \leq k-1$, the set of subset sums of $A$ contains a…

Combinatorics · Mathematics 2023-11-03 David Conlon , Jacob Fox , Huy Tuan Pham

We investigate prime avoidance for an arbitrary set of prime ideals in a commutative ring. Various necessary and/or sufficient conditions for prime avoidance are given, which yield natural classes of infinite sets of primes that satisfy…

Commutative Algebra · Mathematics 2017-10-17 Justin Chen

A conjecture of Graham (repeated by Erd\H{o}s) asserts that for any set $A \subseteq \mathbb{F}_p \setminus \{0\}$, there is an ordering $a_1, \ldots, a_{|A|}$ of the elements of $A$ such that the partial sums $a_1, a_1+a_2, \ldots,…

Combinatorics · Mathematics 2024-08-20 Noah Kravitz

In this article, we studied the inverse Erd\H{o}s-Heilbronn problem with the restricted sumset from two components $A$ and $B$ that are not necessarily the same. We give a completely elementary proof for the problem in $\mathbb{Z}$ and some…

Combinatorics · Mathematics 2024-08-27 Shengning Zhang

Upper bounds to the size of a family of subsets of an n-element set that avoids certain configurations are proved. These forbidden configurations can be described by inclusion patterns and some sets having the same size. Our results are…

Combinatorics · Mathematics 2016-08-25 Dániel T. Nagy

Given a graph $G$, denote by $h(G)$ the smallest size of a subset of $V(G)$ which intersects every maximum independent set of $G$. We prove that any graph $G$ without induced matching of size $t$ satisfies $h(G)\le \omega(G)^{3t-3+o(1)}$.…

Combinatorics · Mathematics 2024-04-01 Jiangdong Ai , Hong Liu , Zixiang Xu , Qiang Zhou

In this article, we prove some subsets of the set of natural numbers $\mathbb{N}$ and any non-zero ideals of an order of imaginary quadratic fields are fractionally dense in $\mathbb{R}_{>0}$ and $\mathbb{C}$ respectively.

Number Theory · Mathematics 2018-10-02 Jaitra Chattopadhyay , Bidisha Roy , Subha Sarkar

We study the arithmetic structure of the exceptional set of projections. For any bounded subset $E\subset \mathbb{R}^d$, let $$ \Omega=\{\xi\in \mathbb{R}: \dim_B(E+\xi E)=\dim_B E\}. $$ We prove that either $\Omega=\{0\}$ or $\Omega$ is a…

Classical Analysis and ODEs · Mathematics 2024-11-18 Changhao Chen , Zhengyan Miao

We investigate the behavior of some thin sets of integers defined through random trigonometric polynomial when one replaces Gaussian or Rademacher variables by p-stable ones, with 1 < p < 2. We show that in one case this behavior is…

Functional Analysis · Mathematics 2009-02-17 Pascal Lefèvre , Daniel Li , Hervé Queffélec , Luis Rodriguez-Piazza

It was proven in 1915 by Leopold Theisinger that the $H_n$ harmonic numbers are never integers. In 1996 Conway and Guy have defined the concept of hyperharmonic numbers. The question naturally arises: are there any integer hyperharmonic…

Number Theory · Mathematics 2008-11-04 István Mező

A set of integers is sum-free if it contains no solution to the equation $x+y=z$. We study sum-free subsets of the set of integers $[n]=\{1,\ldots,n\}$ for which the integer $2n+1$ cannot be represented as a sum of their elements. We prove…

Combinatorics · Mathematics 2018-12-27 Ishay Haviv

We present a new approach to the problem of enumerating permutations of length n that avoid a fixed consecutive pattern of length m. We use this idea to give explicit upper and lower bounds on the number of permutations avoiding a pattern…

Combinatorics · Mathematics 2012-08-29 Guillem Perarnau
‹ Prev 1 8 9 10 Next ›