English
Related papers

Related papers: A top hat for Moser's four mathemagical rabbits

200 papers

We develop the algebraic theory behind the constructions of Yekhanin (2008) and Efremenko (2009), in an attempt to understand the ``algebraic niceness'' phenomenon in $\mathbb{Z}_m$. We show that every integer $m = pq = 2^t -1$, where $p$,…

Computational Complexity · Computer Science 2010-08-11 Yeow Meng Chee , Tao Feng , San Ling , Huaxiong Wang , Liang Feng Zhang

We study the question of whether for each n there is another integer m with lambda(m)=lambda(n), where lambda is Carmichael's function. We give a "near" proof of the fact that this is the case unconditionally, and a complete conditional…

Number Theory · Mathematics 2014-03-24 Kevin Ford , Florian Luca

The following special case of a conjecture by Loehr and Warrington was proved recently by Ekhad, Vatter, and Zeilberger: There are 10^n zero-sum words of length 5n in the alphabet {+3,-2} such that no zero-sum consecutive subword that…

Combinatorics · Mathematics 2016-09-07 Jonas Sjostrand

Zeckendorf's theorem states that every positive integer can be uniquely decomposed as a sum of nonconsecutive Fibonacci numbers, where the Fibonacci numbers satisfy $F_n=F_{n-1}+F_{n-2}$ for $n\geq 3$, $F_1=1$ and $F_2=2$. The distribution…

In his beautiful paper [1], Ben Andrews obtained the complete classification of the solutions of the planar isotropic $L_p$ Minkowski problem. In this paper, by generalizing Ben Andrews's result we obtain the complete classification of the…

Differential Geometry · Mathematics 2022-10-03 Haizhong Li , Yao Wan

In this paper we establish some new results similar to Lagrange's four-square theorem. For example, we prove that any integer $n>1$ can be written as $w(5w+1)/2+x(5x+1)/2+y(5y+1)/2+z(5z+1)/2$ with $w,x,y,z\in\mathbb Z$. Let $a$ and $b$ be…

Number Theory · Mathematics 2024-12-06 Zhi-Wei Sun

We investigate the average number of representations of a positive integer as the sum of $k + 1$ perfect $k$-th powers of primes. We extend recent results of Languasco and the last Author, which dealt with the case $k = 2$ [6] and $k = 3$…

Number Theory · Mathematics 2020-03-23 Marco Cantarini , Alessandro Gambini , Alessandro Zaccagnini

We consider the Lebesgue-Ramanujan-Nagell type equation $x^2+5^a13^b17^c=2^m y^n$, where $a,b,c, m\geq 0, n \geq 3$ and $x, y\geq 1$ are unknown integers with $\gcd(x,y)=1$. We determine all integer solutions to the above equation. The…

Number Theory · Mathematics 2024-02-27 Priyanka Baruah , Anup Das , Azizul Hoque

An old problem of Moser asks: how large of a union-free subfamily does every family of m sets have? A family of sets is called union-free if there are no three distinct sets in the family such that the union of two of the sets is equal to…

Combinatorics · Mathematics 2011-03-17 Jacob Fox , Choongbum Lee , Benny Sudakov

Bollob\'{a}s and Gy\'{a}rf\'{a}s conjectured that for any $k, n \in \mathbb{Z}^+$ with $n > 4(k-1)$, every 2-edge-coloring of the complete graph on $n$ vertices leads to a $k$-connected monochromatic subgraph with at least $n-2k+2$…

Combinatorics · Mathematics 2023-03-22 Chunlok Lo , Hehui Wu , Qiqin Xie

Suppose that $p$ is an odd prime and $m$ is an integer not divisible by $p$. Sun and Tauraso [Adv. in Appl. Math., 45(2010), 125--148] gave $\sum_{k=0}^{n-1}\binom{2k}{k+d}/m^k$ and $\sum_{k=0}^{n-1}\binom{2k}{k+d}/(km^k)$ modulo $p$ for…

Number Theory · Mathematics 2021-10-22 He-Xia Ni

Let $\Lambda$ be the von Mangoldt function and $r_{Q}\left(n\right)=\sum_{m_{1}+m_{2}^{2}+m_{3}^{2}=n}\Lambda\left(m_{1}\right)$ be the counting function for the numbers that can be written as sum of a prime and two squares (that we will…

Number Theory · Mathematics 2017-08-24 Marco Cantarini

We give a direct combinatorial proof of a famous identity, $$ \sum_{i+j=n} m{2i}{i} \binom{2j}{j} = 4^n $$ by actually counting pairs of $k$-subsets of $2k$-sets. Then we discuss two different generalizations of the identity, and end the…

Combinatorics · Mathematics 2016-11-22 Rui Duarte , António Guedes de Oliveira

Stanley, building on work of Stern, defined an array of numbers by the recurrence $s(n, 2k) = s(n-1, k)$, $s(n, 2k+1) = s(n-1, k) + s(n-1, k+1)$. Stanley showed that, for each positive integer $r$, the sequence $s_n^r:= \sum_k s(n,k)^r$…

Combinatorics · Mathematics 2019-01-21 David E Speyer

Suppose that each number $1,2,...,N$ has one of n colours assigned. We show that if there are no monochromatic solutions to the equation $x_1+x_2+x_3=y_1+y_2$, then $N=O((n!)^{1/2})$, improving upon a result of Cwalina and Schoen. Further,…

Combinatorics · Mathematics 2025-07-30 Tomasz Kosciuszko

In 1920, P. A. MacMahon generalized the (classical) notion of divisor sums by relating it to the theory of partitions of integers. In this paper, we extend the idea of MacMahon. In doing so we reveal a wealth of divisibility theorems and…

Combinatorics · Mathematics 2023-09-07 Tewodros Amdeberhan , George E. Andrews , Roberto Tauraso

We show that the number of linear spaces on a set of $n$ points and the number of rank-3 matroids on a ground set of size $n$ are both of the form $(cn+o(n))^{n^2/6}$, where $c=e^{\sqrt 3/2-3}(1+\sqrt 3)/2$. This is the final piece of the…

Combinatorics · Mathematics 2024-05-31 Matthew Kwan , Ashwin Sah , Mehtaab Sawhney

Consider $k\ge 2$ distinct, linearly independent, homogeneous linear recurrences of order $k$ satisfying the same recurrence relation. We prove that the recurrences are related to a decomposable form of degree $k$, and there is a very broad…

Number Theory · Mathematics 2023-08-29 Kalman Gyory , Attila Petho , Laszlo Szalay

For positive integers $k < n$ such that $k$ divides $n$, let $(n)^k_{\hom}$ be the set of homogeneous $k$-partitions of $\{1, \dots, n\}$, that is, the set of partitions of $\{1, \dots, n\}$ into $k$ classes of the same cardinality. In the…

Combinatorics · Mathematics 2019-07-16 Jose G. Mijares

Let f(x_1,x_2,...,x_m) = u_1x_1+u_2 x_2+... + u_mx_m be a linear form with positive integer coefficients, and let N_f(k) = min{|f(A)| : A \subseteq Z and |A|=k}. A minimizing k-set for f is a set A such that |A|=k and |f(A)| = N_f(k). A…

Number Theory · Mathematics 2021-01-06 Melvyn B. Nathanson
‹ Prev 1 4 5 6 7 8 10 Next ›