English
Related papers

Related papers: Finite searches, Chowla's cosine problem, and larg…

200 papers

Let $A\subset \mathbf{N}$ be a finite set of $n=|A|$ positive integers, and consider the cosine sum $f_A(x)=\sum_{a\in A}\cos ax$. We prove that $$\min_x f_A(x)\leqslant -n^{ 1/7-o(1)},$$ thereby establishing polynomial bounds for the…

Classical Analysis and ODEs · Mathematics 2025-09-24 Benjamin Bedert

Let $Z(N)$ denote the minimum number of zeros in $[0,2\pi]$ that a cosine polynomial of the form $$f_A(t)=\sum_{n\in A}\cos nt$$ can have when $A$ is a finite set of non-negative integers of size $|A|=N$. It is an old problem of Littlewood…

Classical Analysis and ODEs · Mathematics 2025-01-09 Benjamin Bedert

Chowla's cosine problem concerns the largest minimum of an expression of the form $\cos a_1\theta + ... + \cos a_n\theta$ where the $a_i$ are distinct positive integers. We compute this largest minimum when $n$ is 2 or 3.

Classical Analysis and ODEs · Mathematics 2012-06-25 Idris Mercer

Let $\mathbb Z_n$ be the cyclic group of order $n \ge 3$ additively written. S. Savchev \& F. Chen (2007) proved that for each zero-sum free sequence $S = a_1 \bullet \dots \bullet a_t$ over $\mathbb Z_n$ of length $t > n/2$, there is an…

Number Theory · Mathematics 2018-11-12 Sávio Ribas

A $\lambda$-quiddity of size $n$ is an $n$-tuple of elements from a fixed set, which is a solution to a matrix equation that arises in the study of Coxeter's friezes. The study of these solutions involves in particular the use of a notion…

Combinatorics · Mathematics 2025-03-10 Flavien Mabilat

In this article, we refine a result of Andrews and Newman, that is, the sum of minimal excludants over all the partitions of a number $n$ equals the number of partitions of $n$ into distinct parts with two colors. As a consequence, we find…

Number Theory · Mathematics 2025-07-24 Nayandeep Deka Baruah , Subhash Chand Bhoria , Pramod Eyyunni , Bibekananda Maji

Affine $\lambda$-terms are $\lambda$-terms in which each bound variable occurs at most once and linear $\lambda$-terms are $\lambda$-terms in which each bound variables occurs once. and only once. In this paper we count the number of closed…

Discrete Mathematics · Computer Science 2017-05-24 Pierre Lescanne

The lambda-dilate of a set A is lambda*A={lambda a : a \in A}. We give an asymptotically sharp lower bound on the size of sumsets of the form lambda_1*A+...+lambda_k*A for arbitrary integers lambda_1,...,lambda_k and integer sets A. We also…

Number Theory · Mathematics 2008-04-03 Boris Bukh

The minimal excludant of a partition $\lambda$, $\rm{mex}(\lambda)$, is the smallest positive integer that is not a part of $\lambda$. For a positive integer $n$, $ \sigma\, \rm{mex}(n)$ denotes the sum of the minimal excludants of all…

Number Theory · Mathematics 2020-06-11 Cristina Ballantine , Mircea Merca

We determine the density of the largest sum-free subset of the lattice cube $\{1, 2, \dots, n\}^d$ for $d = 3$ and $d = 4$. This solves a conjecture of Cameron and Aydinian in dimensions $3$ and $4$.

Combinatorics · Mathematics 2025-12-18 Saba Lepsveridze , Yihang Sun

Let $\a$ be a complex random variable with mean zero and bounded variance $\sigma^{2}$. Let $N_{n}$ be a random matrix of order $n$ with entries being i.i.d. copies of $\a$. Let $\lambda_{1}, ..., \lambda_{n}$ be the eigenvalues of…

Probability · Mathematics 2008-02-29 Terence Tao , Van Vu

Every finite group $G$ has a normal series each of whose factors is either a solvable group or a direct product of nonabelian simple groups. The minimum number of nonsolvable factors attained on all possible such series is called the…

Group Theory · Mathematics 2018-05-16 Francesco Fumagalli , Felix Leinen , Orazio Puglisi

The finite n-th polylogarithm li_n(z) in Z/p[z] is defined as the sum on k from 1 to p-1 of z^k/k^n. We state and prove the following theorem. Let Li_k:C_p to C_p be the p-adic polylogarithms defined by Coleman. Then a certain linear…

Number Theory · Mathematics 2007-05-23 Amnon Besser

Let $f(x)\in\mathbb{Z}[x]$ be a nonconstant polynomial. Let $n, k$ and $c$ be integers such that $n\ge 1$ and $k\ge 2$. An integer $a$ is called an $f$-exunit in the ring $\mathbb{Z}_n$ of residue classes modulo $n$ if $\gcd(f(a),n)=1$. In…

Number Theory · Mathematics 2021-08-03 Junyong Zhao , Shaofang Hong , Chaoxi Zhu

The Ulam sequence is defined as $a_1 =1, a_2 = 2$ and $a_n$ being the smallest integer that can be written as the sum of two distinct earlier elements in a unique way. This gives $$1, 2, 3, 4, 6, 8, 11, 13, 16, 18, 26, 28, 36, 38, 47,…

Combinatorics · Mathematics 2016-07-07 Stefan Steinerberger

A sequence in the additive group ${\mathbb Z}_n$ of integers modulo $n$ is called $n$-zero-free if it does not contain subsequences with length $n$ and sum zero. The article characterizes the $n$-zero-free sequences in ${\mathbb Z}_n$ of…

Combinatorics · Mathematics 2007-05-23 Svetoslav Savchev , Fang Chen

Let $n\ge 1, e\ge 1, k\ge 2$ and $c$ be integers. An integer $u$ is called a unit in the ring $\mathbb{Z}_n$ of residue classes modulo $n$ if $\gcd(u, n)=1$. A unit $u$ is called an exceptional unit in the ring $\mathbb{Z}_n$ if…

Number Theory · Mathematics 2021-09-28 Yulu Feng , Shaofang Hong

Let $G$ be an abelian group, let $S$ be a sequence of terms $s_1,s_2,...,s_{n}\in G$ not all contained in a coset of a proper subgroup of $G$, and let $W$ be a sequence of $n$ consecutive integers. Let $$W\odot S=\{w_1s_1+...+w_ns_n:\;w_i…

Number Theory · Mathematics 2011-06-29 David J. Grynkiewicz , Andreas Philipp , Vadim Ponomarenko

By studying the n-dimensional cube, the author finds a new way, and use it to proves that the indefinite equation $x^n+y^n=z^n(n=>3)$ has no any solutions of positive integers.

General Mathematics · Mathematics 2009-06-06 Kaida Shi

We show that if $A$ is a finite set of non-negative integers then the number of zeros of the function \[ f_A(\theta) = \sum_{a \in A} \cos(a\theta), \] in $[0,2\pi]$, is at least $(\log \log \log |A|)^{1/2-\varepsilon}$. This gives the…

Classical Analysis and ODEs · Mathematics 2019-02-07 Julian Sahasrabudhe
‹ Prev 1 2 3 10 Next ›