English
Related papers

Related papers: Explicit solutions to certain inf max problems fro…

200 papers

For integers $n,k \geq 1$, let $S_k(n)$ denote the power sum $1^k +2^k + \cdots + n^k$. In this note, we first recall the minimal recurrence relation connecting $S_k(n)$ and $S_{k-1}(n)$ established by Abramovich (1973). We then discuss an…

History and Overview · Mathematics 2026-01-30 José L. Cereceda

In 2013 Zhi-Wei Sun conjectured that $p(n)$ is never a power of an integer when $n>1.$ We confirm this claim in many cases. We also observe that integral powers appear to repel the partition numbers. If $k>1$ and $\Delta_k(n)$ is the…

Combinatorics · Mathematics 2025-01-10 Mircea Merca , Ken Ono , Wei-Lun Tsai

We consider the sum of squares function in the ring $\mathbb{Z}_{n}$. We determine formulae in a number of cases when $n$ is a power of a prime.

Number Theory · Mathematics 2022-01-19 Rob Burns

Given a positive integer $n$ and an $r$-uniform hypergraph (or $r$-graph for short) $F$, the Turan number $ex(n,F)$ of $F$ is the maximum number of edges in an $r$-graph on $n$ vertices that does not contain $F$ as a subgraph. The extension…

Combinatorics · Mathematics 2016-09-29 Tao Jiang , Yuejian Peng , Biao Wu

Suppose that $n$ is $0$ or $4$ modulo $6$. We show that there are infinitely many primes of the form $p^2 + nq^2$ with both $p$ and $q$ prime, and obtain an asymptotic for their number. In particular, when $n = 4$ we verify the `Gaussian…

Number Theory · Mathematics 2024-10-15 Ben Green , Mehtaab Sawhney

The problem of finding the sum of a polynomial's values is considered. In particular, for any $n\geq 3$, the explicit formula for the sum of the $n$th powers of natural numbers $S_n=\sum_{x=1}^{m}x^{n}$ is proved:…

General Mathematics · Mathematics 2024-11-20 Eteri Samsonadze

We give a very short and simple proof of Zykov's generalization of Tur\'{a}n's theorem, which implies that the number of maximum independent sets of a graph of order $n$ and independence number $\alpha$ with $\alpha<n$ is at most…

Combinatorics · Mathematics 2018-05-08 Elena Mohr , Dieter Rautenbach

We study the following question posed by Turan. Suppose K is a convex body in Euclidean space which is symmetric with respect to the origin. Of all positive definite functions supported in K, and with value 1 at the origin, which one has…

Classical Analysis and ODEs · Mathematics 2007-05-23 Mihail N. Kolountzakis , Szilard Gy. Revesz

The classical problem of maximizing the Shannon entropy of a sum of independent random variables supported on a finite alphabet is considered and settled in the ternary case. Namely, the following theorem is established: if…

Information Theory · Computer Science 2026-05-13 Mladen Kovačević

Let $k$ and $n$ be positive integers, $n>k$. Define $r(n,k)$ to be the minimum positive value of $$ |\sqrt{a_1} + ... + \sqrt{a_k} - \sqrt{b_1} - >... -\sqrt{b_k} | $$ where $ a_1, a_2, ..., a_k, b_1, b_2, ..., b_k $ are positive integers…

Computational Geometry · Computer Science 2007-05-23 Qi Cheng

In the subset sum problem we are given n positive integers along with a target integer t. A solution is a subset of these integers summing to t. In this short note we show that for a given subset sum instance there is a proof of size…

Computational Complexity · Computer Science 2016-02-05 Jesper Nederlof

Let q be a prime, A be a subset of a finite field $F=\Bbb Z/q\Bbb Z$, $|A|<\sqrt{|F|}$. We prove the estimate $\max(|A+A|,|A\cdot A|)\ge c|A|^{1+\epsilon}$ for some $\epsilon>0$ and c>0. This extends the result of J. Bourgain, N. Katz, and…

Number Theory · Mathematics 2007-05-23 S. V. Konyagin

For any fixed $k\geq 2$, we prove that every sufficiently large integer can be expressed as the sum of a $k$th power of a prime and a number with at most $M(k)=6k$ prime factors. For sufficiently large $k$ we also show that one can take…

Number Theory · Mathematics 2025-05-15 Daniel R. Johnston , Simon N. Thomas

Let $G$ be a graph on $n$ vertices with degree sequence $(d_1,d_2......d_n)$. For a real $p \geq 1$, let $D_p(G)=\sum_{i=1}^nd_i^p$. A Tur\'an-type problem of degree power sum was initiated by Caro and Yuster \cite{caro2000degpower}:…

Combinatorics · Mathematics 2024-04-11 Jiangdong Ai , Fankang He , Yihang Liu , Bo Ning

Let $\alpha$ be a real number such that $1< \alpha <2$ and let $x_0=x_0(\alpha)$ be a {\rm(}unique{\rm)} positive solution of the equation $$ x^{\alpha-1} -\frac{\pi}{e^2\sqrt{3}}x +1=0. $$ Then we prove that for each positive integer…

Number Theory · Mathematics 2012-11-21 Romeo Meštrović

Euler totient function $\phi(n)$ plays a central role in number theory and is applied in areas such as cryptography. In this paper, we study iterations of the totient function. We first prove that for any integer $n>2$, iteratively applying…

General Mathematics · Mathematics 2026-01-05 Xiang Li , Allison Pacelli

Let $\mathscr{F}$ be a family of graphs. A graph $G$ is $\mathscr{F}$-free if $G$ does not contain any $F\in \mathcal{F}$ as a subgraph. The general Tur\'an number, denoted by $ex(n, H,\mathscr{F})$, is the maximum number of copies of $H$…

Combinatorics · Mathematics 2024-12-30 Xiamiao Zhao , Mei Lu

We consider an infinite version of the bipartite Tur\'{a}n problem. Let $G$ be an infinite graph with $V(G) = \mathbb{N}$ and let $G_n$ be the $n$-vertex subgraph of $G$ induced by the vertices $\{1,2, \dots, n \}$. We show that if $G$ is…

Combinatorics · Mathematics 2013-05-31 Xing Peng , Craig Timmons

We study two optimization problems for positive definite functions on Euclidean space with restrictions on their support and sign: the Turan problem and the Delsarte problem. These problems have been studied also for their connections to…

Classical Analysis and ODEs · Mathematics 2025-10-14 Mihail N. Kolountzakis , Nir Lev , Máté Matolcsi

What is the maximum number of $r$-term sums admitting rational values in $n$-element sets of irrational numbers? We determine the maximum when $r<4$ or $r\geq n/2$ and also in case when we drop the condition on the number of summands. It…

Combinatorics · Mathematics 2025-09-25 Benjamin Móricz , Zoltán Lóránt Nagy