English
Related papers

Related papers: Sequences with Inequalities

200 papers

Let $\ell \geq 5$ be prime. For the partition function $p(n)$ and $5 \leq \ell \leq 31$, Atkin found a number of examples of primes $Q \geq 5$ such that there exist congruences of the form $p(\ell Q^{3} n+\beta) \equiv 0 \pmod{\ell}.$…

Number Theory · Mathematics 2022-06-14 Robert Dicks

McNamara and Sagan conjectured that if $a_0,a_1, a_2, \ldots$ is a P\'olya frequency (PF) sequence, then so is $a_0^2, a_1^2 -a_0a_2, a_2^2-a_1a_3, \ldots$. We prove this conjecture for a natural class of PF-sequences which are interpolated…

Combinatorics · Mathematics 2014-05-27 Petter Brändén , Matthew Chasse

In this paper, we consider the set of partitions $ped(n)$ which counts the number of partitions of $n$ wherein the even parts are distinct (and the odd parts are unrestricted). Using an algorithm developed by Radu, we prove congruences…

Number Theory · Mathematics 2025-03-11 Hemjyoti Nath , Abhishek Sarma

We show for a class of sequences $(a_n)_{n\geq 1}$ of distinct positive integers, that for no $\alpha$ the sequence $(\left\{a_n \alpha \right\})_{n \geq 1}$ does have Poissonian pair correlation. This class contains for example all…

Number Theory · Mathematics 2018-01-31 Gerhard Larcher

A generic uniformly distributed sequence $(x_n)_{n \in \mathbb{N}}$ in $[0,1)$ possesses Poissonian pair correlations (PPC). Vice versa, it has been proven that a sequence with PPC is uniformly distributed. Grepstad and Larcher gave an…

Number Theory · Mathematics 2022-06-30 Christian Weiß

The number of solid partitions of a positive integer is an unsolved problem in combinatorial number theory. In this paper, solid partitions are studied numerically by the method of exact enumeration for integers up to 50 and by Monte Carlo…

Statistical Mechanics · Physics 2009-11-10 Ville Mustonen , R. Rajesh

We investigate congruence relations of the form $p_r(\ell m n + t) \equiv 0 \pmod{\ell}$ for all $n$, where $p_r(n)$ is the number of $r$-colored partitions of $n$ and $m,\ell$ are distinct primes.

Number Theory · Mathematics 2022-06-24 Olivia Beckwith , Alexander Caione , Jack Chen , Maddie Diluia , Oscar Gonzalez , Jamie Su

We give an algorithm A which assigns probabilities to logical sentences. For any simple infinite sequence of sentences whose truth-values appear indistinguishable from a biased coin that outputs "true" with probability p, we have that the…

Machine Learning · Computer Science 2015-10-13 Scott Garrabrant , Siddharth Bhaskar , Abram Demski , Joanna Garrabrant , George Koleszarik , Evan Lloyd

For fixed $m$ and $R\subseteq \{0,1,\ldots,m-1\}$, take $A$ to be the set of positive integers congruent modulo $m$ to one of the elements of $R$, and let $p_A(n)$ be the number of ways to write $n$ as a sum of elements of $A$. Nathanson…

Number Theory · Mathematics 2021-01-28 Asaf Cohen Antonir , Asaf Shapira

Let $P_{n,k}$ be the number of permutations $\pi$ on [n]={1, 2,..., n} such that the length of the longest increasing subsequences of $\pi$ equals k, and let $M_{2n, k}$ be the number of matchings on [2n] with crossing number k. Define…

Combinatorics · Mathematics 2008-06-23 William Y. C. Chen

We calculate the limiting gap distribution for the fractional parts of log n, where n runs through all positive integers. By rescaling the sequence, the proof quickly reduces to an argument used by Barra and Gaspard in the context of level…

Number Theory · Mathematics 2015-09-07 Jens Marklof , Andreas Strömbergsson

Elliott and Halberstam proved that $\sum_{p<n} 2^{\omega(n-p)}$ is asymptotic to $\phi(n)$. In analogy to the Erd\H{o}s--Kac Theorem, Elliott conjectured that if one restricts the summation to primes $p$ such that $\omega(n-p)\le 2 \log…

Number Theory · Mathematics 2024-10-15 Ofir Gorodetsky , Lasse Grimmelt

The Raney numbers $R_{p,r}(k)$ are a two-parameter generalization of the Catalan numbers. In this paper, we obtain a recurrence relation for the Raney numbers which is a generalization of the recurrence relation for the Catalan numbers.…

Combinatorics · Mathematics 2015-12-29 Robin DaPao Zhou

We prove that the number of partitions of an integer into at most b distinct parts of size at most n forms a unimodal sequence for n sufficiently large with respect to b. This resolves a recent conjecture of Stanley and Zanello.

Combinatorics · Mathematics 2014-03-05 Levent Alpoge

We prove that the number $q(n)$ of partitions into distinct parts is log-concave for $n \geq 33$ and satisfies the higher order Tur\'an inequalities for $n\geq 121$ conjectured by Craig and Pun. In doing so, we establish explicit error…

Combinatorics · Mathematics 2024-04-02 Janet J. W. Dong , Kathy Q. Ji

Given a Sheffer sequence of polynomials, we introduce the notion of an associated sequence called the cognate sequence. We study the relationship between the zeros of this pair of associated sequences and show that in case of an Appell…

Complex Variables · Mathematics 2023-01-13 Gi-Sang Cheon , Tamás Forgács , Khang Tran

Let $f$ be a power series with positive radius of convergence. In the present paper, we study the phenomenon of overconvergence of sequences of classical Pade' approximants pi{n,m_n} associated with f, where m(n)<=m(n+1)<=m(n) and m(n) =…

Complex Variables · Mathematics 2019-06-24 Ralitza K. Kovacheva

In this paper we study the ratio between the number of $p$-elements and the order of a Sylow $p$-subgroup of a finite group $G$. As well known, this ratio is a positive integer and we conjecture that, for every group $G$, it is at least the…

Group Theory · Mathematics 2020-07-03 Pietro Gheri

Majorization inequalities for symmetric polynomials have interested mathematicians for centuries, from the AM-GM inequality for two variables going back at least to Euclid, through classical results of Newton, Muirhead and Gantmacher, to…

Combinatorics · Mathematics 2026-05-14 Colin McSwiggen , Siddhartha Sahi

Heim, Neuhauser, and Tr\"oger recently established some inequalities for MacMahon's plane partition function $\mathrm{PL}(n)$ that generalize known results for Euler's partition function $p(n)$. They also conjectured that $\mathrm{PL}(n)$…

Number Theory · Mathematics 2022-09-13 Ken Ono , Sudhir Pujahari , Larry Rolen