English
Related papers

Related papers: Modular Schur numbers

200 papers

Let $S$ be a finite set of positive integers with largest element $m$. Let us randomly select a composition $a$ of the integer $n$ with parts in $S$, and let $m(a)$ be the multiplicity of $m$ as a part of $a$. Let $0\leq r<q$ be integers,…

Combinatorics · Mathematics 2007-05-23 Miklos Bona

Cameron and Erd\H{o}s asked whether the number of \emph{maximal} sum-free sets in $\{1, \dots , n\}$ is much smaller than the number of sum-free sets. In the same paper they gave a lower bound of $2^{\lfloor n/4 \rfloor }$ for the number of…

Combinatorics · Mathematics 2018-05-14 József Balogh , Hong Liu , Maryam Sharifzadeh , Andrew Treglown

An integer $k$ is called regular (mod $n$) if there exists an integer $x$ such that $k^2x\equiv k$ (mod $n$). This holds true if and only if $k$ possesses a weak order (mod $n$), i.e., there is an integer $m\ge 1$ such that $k^{m+1} \equiv…

Number Theory · Mathematics 2015-05-14 Brăduţ Apostol , László Tóth

For all positive integers $k,l,n$, the Little Glaisher theorem states that the number of partitions of $n$ into parts not divisible by $k$ and occurring less than $l$ times is equal to the number of partitions of $n$ into parts not…

Combinatorics · Mathematics 2022-07-26 Isaac Konan

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

Let 0<\theta<\pi such that \cos\theta\in \Q. In this paper, we prove that for given positive square-free coprime integers k,l, there exist infinitely many pairs (M,N) of \theta-congruent numbers such that lN=kM. This generalize the previous…

Number Theory · Mathematics 2010-06-01 Yan Li , Su Hu

A subset $\mathcal{A}\subseteq\mathbb{Z}$ is called $s$-almost square universal if every sufficiently large positive integer can be written as a sum of at most $s$ squares of integers from $\mathcal{A}$. In this article, we study the…

Number Theory · Mathematics 2026-02-17 Daejun Kim

Let, for r>=2, (m_r(n)),n>=0, be Moser sequence such that every nonnegative integer is the unique sum of the form s_k+rs_l. In this article we give an explicit decomposition formulas of such form and an unexpectedly simple recursion…

Number Theory · Mathematics 2008-12-02 Vladimir Shevelev

A set A of integers is said to be sum-free if there are no solutions to the equation x + y = z with x,y and z all in A. Answering a question of Cameron and Erdos, we show that the number of sum-free subsets of {1,...,N} is O(2^(N/2)).

Number Theory · Mathematics 2007-05-23 Ben Green

We try to find all quadruples of positive integers $(m,a,b,c)$ with $a \geq b \geq c$ such that there exists a distinct covering system with minimum modulus $m$ and least common multiple of the moduli $2^a 3^b 5^c$. We obtain complete…

Number Theory · Mathematics 2026-05-19 Joshua Harrington , Jonah Klein , Joshua Lowrance , Ognian Trifonov

We prove the following theorem: for all positive integers $b$ there exists a positive integer $k$, such that for every finite set $A$ of integers with cardinality $|A| > 1$, we have either $$ |A + ... + A| \geq |A|^b$$ or $$ |A \cdot ...…

Combinatorics · Mathematics 2007-05-23 Jean Bourgain , Mei-Chu Chang

Let $(F_n)_{n \geq 1}$ be the sequence of Fibonacci numbers. For all integers $a$ and $b \geq 1$ with $\gcd(a, b) = 1$, let $[a^{-1} \!\bmod b]$ be the multiplicative inverse of $a$ modulo $b$, which we pick in the usual set of…

Number Theory · Mathematics 2023-06-16 Carlo Sanna

For positive integers m and r, one can easily show there exist integers N such that for every map D:{1,2,...,N} -> {1,2,...,r} there exist 2m integers x_1 < ... < x_m < y_1 < ... < y_m which satisfy: (a) D(x_1) = ... = D(x_m), (b) D(y_1) =…

Combinatorics · Mathematics 2007-05-23 Andrew Schultz

This paper records some apparently new results for the partition of integer intervals [1, n] into weakly sum-free subsets. These were produced using a method closely related to that used by Schur in 1917. New lower bounds can be produced in…

Combinatorics · Mathematics 2021-06-10 Fred Rowley

All Lie algebras and representations will be assumed to be finite dimensional over the complex numbers. Let $V(m)$ be the irreducible $\sl(2)$-module with highest weight $m\geq 1$ and consider the perfect Lie algebra $\g=\sl(2)\ltimes…

Representation Theory · Mathematics 2012-02-02 Leandro Cagliero , Fernando Szechtman

Let $\mathcal{R}$ denote the set of integers $n$ that can be represented as the sum $n = x^2 + y^2$ with $(x,y) = 1$. Let $a$ and $b$ be integers with $a>0$, $a \nmid b$. We show that for sufficiently large positive integer $N$ there are…

Number Theory · Mathematics 2026-05-26 Artyom Radomskii

Let $\Delta(n)$ denote the smallest positive integer $m$ such that $a^3+a(1\le a\le n)$ are pairwise distinct modulo $m$. The purpose of this paper is to determine $\Delta(n)$ for all positive integers $n$.

Number Theory · Mathematics 2021-11-25 Quan-Hui Yang , Lilu Zhao

We define, for each subset $S$ of primes, an $S_n$-module $Lie_n^S$ with interesting properties. When $S=\emptyset,$ this is the well-known representation $Lie_n$ of $S_n$ afforded by the free Lie algebra. The most intriguing case is…

Representation Theory · Mathematics 2020-04-30 Sheila Sundaram

The modular transformation properties of admissible characters of the affine superalgebra sl(2|1;C) at fractional level k=1/u-1, u=2,3,... are presented. All modular invariants for u=2 and u=3 are calculated explicitly and an A-series and…

High Energy Physics - Theory · Physics 2009-10-31 Gavin Johnstone

As a well-known enumerative problem, the number of solutions of the equation $m=m_1+...+m_k$ with $m_1\leqslant...\leqslant m_k$ in positive integers is $\Pi(m,k)=\sum_{i=0}^k\Pi(m-k,i)$ and $\Pi$ is called the additive partition function.…

Combinatorics · Mathematics 2018-05-01 Daniel Yaqubi , Madjid Mirzavaziri
‹ Prev 1 4 5 6 7 8 10 Next ›