相关论文: The gerrymander sequence, or A348456

We prove an existing conjecture that the sequence defined recursively by $a_1=1, a_2=2, a_n=4a_{n-1}-2a_{n-2}$ counts the number of length-$n$ permutations avoiding the four generalized permutation patterns 1-32-4, 1-42-3, 2-31-4, and…

This paper extends the inductive approach to the lace expansion of van der Hofstad and Slade in order to prove Gaussian asymptotic behaviour for models with critical dimension other than 4. The results are applied by Holmes to study…

We consider the uniform asymptotic expansion for the Gauss hypergeometric function \[F(a+\epsilon\lambda,m;c+\lambda;x),\qquad \lambda\to+\infty\] for $x<1$ and positive integer $m$ when the parameter $\epsilon>1$ and the constants $a$ and…

In this paper, we consider a multi-block generalized alternating direction method of multiplier (GADMM) algorithm for minimizing a linearly constrained separable nonconvex and possibly nonsmooth optimization problem. The GADMM generalizes…

We prove that the susceptibility of the continuous-time weakly self-avoiding walk on $\mathbb{Z}^d$, in the critical dimension $d=4$, has a logarithmic correction to mean-field scaling behaviour as the critical point is approached, with…

We describe a new algebraic technique, utilising transfer matrices, for enumerating self-avoiding lattice trails on the square lattice. We have enumerated trails to 31 steps, and find increased evidence that trails are in the self-avoiding…

Although known lower bounds for the growth rate $\lambda$ of polyominoes, or Klarner's constant, are already close to the empirically estimated value $4.06$, almost no conceptual progress on upper bounds has occurred since the seminal work…

We present simulation results for long ($N\leq 4000$) self-avoiding walks in four dimensions. We find definite indications of logarithmic corrections, but the data are poorly described by the asymptotically leading terms. Detailed…

Let $Q_n(x)=\sum_{i=0}^{n} A_{i}x^{i}$ be a random algebraic polynomial where the coefficients $A_0,A_1,... $ form a sequence of centered Gaussian random variables. Moreover, assume that the increments $\Delta_j=A_j-A_{j-1}$, $j=0,1,2,...$…

We study the entropy $S$ of longest increasing subsequences (LIS), i.e., the logarithm of the number of distinct LIS. We consider two ensembles of sequences, namely random permutations of integers and sequences drawn i.i.d.\ from a limited…

Given an increasing integer sequence $(a_n)$, a real number $\alpha$, and a sequence $\psi(n)$, we study the set $W$ of real numbers $\gamma$ for which $a_n\alpha - \gamma$ is a distance less than $\psi(n)$ away from an integer. This is…

Fourier series of smooth, non-periodic functions on $[-1,1]$ are known to exhibit the Gibbs phenomenon, and exhibit overall slow convergence. One way of overcoming these problems is by using a Fourier series on a larger domain, say $[-T,T]$…

In the degree-diameter problem for Abelian Cayley and circulant graphs of diameter 2 and arbitrary degree d there is a wide gap between the best lower and upper bounds valid for all d, being quadratic functions with leading coefficient 1/4…

A sequence of geometric random variables of length $n$ is a sequence of $n$ independent and identically distributed geometric random variables ($\Gamma_1, \Gamma_2, \dots, \Gamma_n$) where $\mathbb{P}(\Gamma_j=i)=pq^{i-1}$ for…

The Rademacher random walk associated with a deterministic sequence $(a_n)_{n \geq 1}$ is the walk which starts at zero and, at step $i$, independently steps either up or down by $a_i$ with equal probability. We continue the study begun by…

The three gap theorem, also known as the Steinhaus conjecture or three distance theorem, states that the gaps in the fractional parts of $\alpha,2\alpha,\ldots, N\alpha$ take at most three distinct values. Motivated by a question of…

Harvey Friedman gives a comparatively short description of an ``unimaginably large'' number $n(3)$ , beyond, e.g. the values $$ A(7,184)< A({7198},158386) < n(3)$$ of Ackermann's function - but finite. We implement Friedman's combinatorial…

We analyze the statistical properties of Poincar\'e recurrences of Homo sapiens, mammalian and other DNA sequences taken from Ensembl Genome data base with up to fifteen billions base pairs. We show that the probability of Poincar\'e…

For $d \geq 2$ and $n \in \mathbb{N}$, let $\mathsf{W}_n$ denote the uniform law on self-avoiding walks beginning at the origin in the integer lattice $\mathbb{Z}^d$, and write $\Gamma$ for a $\mathsf{W}_n$-distributed walk. We show that…

To enhance the reasoning capabilities of large language models (LLMs), self-consistency has become a popular approach, combining multiple samplings with majority voting. However, current methods are computationally expensive and…