English
Related papers

Related papers: 3AP-free permutations have no exponential growth r…

200 papers

A new derivation of the classic asymptotic expansion of the n-th prime is presented. A fast algorithm for the computation of its terms is also given, which will be an improvement of that by Salvy (1994). Realistic bounds for the error with…

Number Theory · Mathematics 2014-03-25 Juan Arias de Reyna , Toulisse Jeremy

Recently, Romik determined in [9] the Taylor expansion of the Jacobi theta constant \theta_3, around the point x = 1. He discovered a new integer sequence, (d(n))_0^\infty=1, 1, -1, 51, 849, -26199, \dots, from which the Taylor coefficients…

Number Theory · Mathematics 2020-03-19 Robert Scherer

We solve the enumeration of the set $\textrm{AP}(n)$ of partitions of a positive integer $n$ in which the nondecreasing sequence of parts forms an arithmetic progression. In particular, we establish a formula for the number of nondecreasing…

Number Theory · Mathematics 2022-06-13 F. Javier de Vega

Define $S_n(R;T)$ to be the number of permutations on $n$ letters which avoid all patterns in the set $R$ and contain each pattern in the multiset $T$ exactly once. In this paper we enumerate $S_n(\{\alpha\};\{\beta\})$ and…

Combinatorics · Mathematics 2007-05-23 Aaron Robertson

We give a simple proof of the fact that - in all dimensions - there are no homogeneous solutions to the thin obstacle problem with frequency $\lambda$ belonging to intervals of the form $(2k,2k+1)$, $k \in \mathbb{N}$. In particular, there…

Analysis of PDEs · Mathematics 2024-12-19 Federico Franceschini , Ovidiu Savin

We prove that for $q\in (-1,0)\cup (0,1)$, the partial theta function $\theta (q,x):=\sum _{j=0}^{\infty}q^{j(j+1)/2}x^j$ has no zeros in the closed unit disk.

Classical Analysis and ODEs · Mathematics 2024-12-17 Vladimir Petrov Kostov

In this paper we study the structure of the limit aggregate $A_\infty = \bigcup_{n\geq 0} A_n$ of the one-dimensional long range diffusion limited aggregation process defined in [AABK09]. We show (under some regularity conditions) that for…

Probability · Mathematics 2015-04-07 Gideon Amir

For $\eta\in S_3$, let $S_n^{\text{av}(\eta)}$ denote the set of permutations in $S_n$ that avoid the pattern $\eta$, and let $E_n^{\text{av}(\eta)}$ denote the expectation with respect to the uniform probability measure on…

Probability · Mathematics 2023-04-28 Ross G. Pinsky

We show that once $\theta>17/30$, every sufficiently long interval $[x,x+x^\theta]$ contains many $k$-term arithmetic progressions of primes, uniformly in the starting point $x$. More precisely, for each fixed $k\ge3$ and $\theta>17/30$,…

Number Theory · Mathematics 2025-09-25 Le Duc Hieu

We show that for c >= 2.4682, a random graph on n vertices with c n (1+o(1)) edges almost surely has no 3-colouring. This improves on the current best upper bound of 2.4947.

Combinatorics · Mathematics 2007-05-23 O. Dubois , J. Mandler

We study asymptotic infinitesimal distributions of Gaussian Unitary Ensembles with permuted entries. We show that for random uniform permutations, the asymptotically permuted GUE matrix has a null infinitesimal distribution. Moreover, we…

Probability · Mathematics 2024-09-30 M. Popa , K. Szpojankowski , P. -L. Tseng

The problem of N-digit sets all permutations of which give primes is discussed. Such sets may include only digits 1, 3, 7 and 9, and none of 0, 2, 5, 4, 6, 8. Direct calculations show that such full-permutation digit sets occur at N = 1, 2,…

Number Theory · Mathematics 2007-05-23 Zakir F. Seidov

A {\em theta} is a graph made of three internally vertex-disjoint chordless paths $P_1 = a \dots b$, $P_2 = a \dots b$, $P_3 = a \dots b$ of length at least~2 and such that no edges exist between the paths except the three edges incident to…

Discrete Mathematics · Computer Science 2023-10-23 Marcin Pilipczuk , Ni Luh Dewi Sintiari , Stéphan Thomassé , Nicolas Trotignon

We present a random isometry-invariant subgraph of a Cayley graph such that with probability 1 its exponential growth rate does not exist.

Probability · Mathematics 2020-05-11 Adam Timar

We describe the distribution of the number and location of the fixed points of permu- tations that avoid the pattern 321 via a bijection with rooted plane trees on n + 1 vertices. Using the local limit theorem for Galton-Watson trees, we…

Combinatorics · Mathematics 2019-04-02 Christopher Hoffman , Douglas Rizzolo , Erik Slivken

We exhibit an $n$-node graph whose independent set polytope requires extended formulations of size exponential in $\Omega(n/\log n)$. Previously, no explicit examples of $n$-dimensional $0/1$-polytopes were known with extension complexity…

Computational Complexity · Computer Science 2016-04-26 Mika Göös , Rahul Jain , Thomas Watson

Let $\{f_n\}$ be the Fibonacci sequence. For any positive integer $n$, let $r(n)$ be the number of solutions of $n=p+f_{k_1^{2}} +f_{k_{2}^{2}}$, where $p$ is a prime and $k_1, k_2$ are nonnegative integers with $k_1\le k_2$. In this paper,…

Number Theory · Mathematics 2025-06-05 Ji-Zhen Xu , Yong-Gao Chen

Given any irrational number $\alpha$, we show that for any $0<\theta<6/17$, there are infinitely many $y$-smooth (friable) numbers $n$ such that $$\|n\alpha\| < n^{-\theta},$$ where $(\log n)^C\leq y\leq n$ for some large constant $C>0$.…

Number Theory · Mathematics 2026-03-31 Kunjakanan Nath , Habibur Rahaman

We prove various obstructions to the existence of regular maps (or coarse embeddings) between commonly studied spaces. For instance, there is no regular map (or coarse embedding) $\mathbb H^n\to\mathbb H^{n-1}\times Y$ for $n\geq 3$, or…

Metric Geometry · Mathematics 2025-05-14 David Hume , John M. Mackay , Romain Tessera

Let $K$ be a number field with ring of integers $\mathcal O_{K}$. We prove that if $3$ does not divide $ [K:\mathbb Q]$ and $3$ splits completely in $K$, then the unit equation has no solutions in $K$. In other words, there are no $x, y \in…

Number Theory · Mathematics 2020-04-08 Nicholas Triantafillou