Related papers: On sumsets of dissociated sets

In the paper, we establish a new estimate for Kloosterman sum over primes with respect to an arbitrary modulus $q$. This estimate together with some recent results of the second author are applied to the problem of solvability of the…

For any large prime $q$, $1 \leq x \leq q$ and any real $0 \leq k \leq 1$, we prove an upper bound for the following $2k$-th moment $$\displaystyle \sum_{\substack{\chi \bmod q}} \Big| \sum_{n\leq x} \chi(n)\lambda(n)\Big|^{2k},$$ where…

We say that a subset of $\mathbb{P}^n(\mathbb{R})$ is maximally singular if its contains points with $\mathbb{Q}$-linearly independent homogenous coordinates whose uniform exponent of simultaneous rational approximation is equal to $1$, the…

A sufficient condition for the convergence of a generalized formal power series solution to an algebraic $q$-difference equation is provided. The main result leans on a geometric property related to the semi-group of (complex) power…

In this paper, we construct explicit families of polynomials $P \in \mathbb{F}_q[x_1,\dots,x_n]$ with large root sets which have restricted intersections with affine lines. We use these sets to make substantial progress on a number of…

We study the distribution of consecutive sums of two squares in arithmetic progressions. If $\{E_n\}_{n \in \mathbb{N}}$ is the sequence of sums of two squares in increasing order, we show that for any modulus $q$ and any congruence classes…

We present outlines of a general method to reach certain kinds of $q$-multiple sum identities. Throughout our exposition, we shall give generalizations to the results given by Dilcher, Prodinger, Fu and Lascoux, Zeng, and Guo and Zhang…

This paper studies the polynomial optimization problem whose feasible set is a union of several basic closed semialgebraic sets. We propose a unified hierarchy of Moment-SOS relaxations to solve it globally. Under some assumptions, we prove…

We obtain a lifting property for finite quotients of algebraic groups, and applications to the structure of these groups.

Let $S_n$ and $S_{n,k}$ be, respectively, the number of subsets and $k$-subsets of $\mathbb{N}_n=\{1,\ldots,n\}$ such that no two subset elements differ by an element of the set $\mathcal{Q}$, the largest element of which is $q$. We prove a…

In this paper, we propose a new algebraic structure of permutation polynomials over $\mathbb{F}_{q^n}$. As an application of this new algebraic structure, we give some classes of new PPs over $\mathbb{F}_{q^n}$ and answer an open problem in…

The height of a rational number $p/q$ is denoted by $h(p/q)$ and equals $\text{max}(|p|,|q|)$ provided p/q is written in lowest terms. The height of a rational tuple $(x_1,...,x_n)$ is denoted by $h(x_1,...,x_n)$ and equals…

We prove a lemma that is useful to get upper bounds for the number of partitions without a given subsum. From this we can deduce an improved upper bound for the number of sets represented by the (unrestricted or into unequal parts)…

Let $\mathbb{F}_q[t]$ denote the ring of polynomials over $\mathbb{F}_q$, the finite field of $q$ elements. We prove an estimate for fractional parts of polynomials over $\mathbb{F}_q[t]$ satisfying a certain divisibility condition…

In this paper, we study the binomial sum $S_{n}(q):=% \overset{n}{\underset{k=0}{\sum }}a_{k}\binom{n}{k}\left( 1-q\right) ^{k}q^{n-k}$ for a given sequence $\left( a_{n}\right) $ of real or complex numbers. We express $S_{n}(q)$ in…

The primary focus of this paper is overpartitions, a type of partition that plays a significant role in $q$-series theory. In 2006, Treneer discovered an explicit infinite family of congruences of overpartitions modulo $5$. In our research,…

A variation on the sum-product problem seeks to show that a set which is defined by additive and multiplicative operations will always be large. In this paper, we prove new results of this type. In particular, we show that for any finite…

By the m-spectrum of a real number q>1 we mean the set Y^m(q) of values p(q) where p runs over the height m polynomials with integer coefficients. These sets have been extensively investigated during the last fifty years because of their…

The partition functions $P(n,m,p)$, the number of integer partitions of $n$ into exactly $m$ parts with each part at most $p$, and $Q(n,m,p)$, the number of integer partitons of $n$ into exactly $m$ distinct parts with each part at most…

Let $A \subset \mathbb{Z}_{>0}$ of size $n$. It is conjectured that for any $C >0$ and $n$ large enough that $A$ contains a sum-free subset of size at least $n/3 +C$. We study this problem and find an alternate proof of Bourgain's result…