相关论文: The gerrymander sequence, or A348456
The main contribution of this paper is a six-step semi-automatic algorithm that obtains a recursion satisfied by a family of determinants by systematically and iteratively applying Laplace expansion to the underlying matrix family. The…
We design new approximation algorithms for the Multiway Cut problem, improving the previously known factor of 1.32388 [Buchbinder et al., 2013]. We proceed in three steps. First, we analyze the rounding scheme of Buchbinder et al., 2013 and…
In this paper we show that two of the Worpitzky Number Triangles, OEIS A028246 and A019538, may each be used in look-up table fashion, along with specific diagonals of a polynomial sequence's difference triangle to easily solve for the…
We discuss Pad\'e-improvement of known four-loop order results based upon an asymptotic three-parameter error formula for Pad\'e-approximants. We derive an explicit formula estimating the next-order coefficient $R_4$ from the previous…
A sequence $S=s_{1}s_{2}..._{n}$ is \emph{nonrepetitive} if no two adjacent blocks of $S$ are identical. In 1906 Thue proved that there exist arbitrarily long nonrepetitive sequences over 3-element set of symbols. We study a generalization…
Shanks's sequence of quadratic fields $\Q(\sqrt{S_{n}})$ where $S_{n}=(2^n+1)^2 + 2^{n+2}$ instances a class of quadratic fields for which the class number is large and, therefore, the continued fraction period is relatively short. Indeed,…
For $d \geq 2$ and $n \in \mathbb{N}$, let $\mathsf{W}_n$ denote the uniform law on self-avoiding walks of length $n$ beginning at the origin in the nearest-neighbour integer lattice $\mathbb{Z}^d$, and write $\Gamma$ for a…
We investigate the application of quantum computing algorithms to enhance the efficiency of enumerating self-avoiding walks (SAWs), utilizing quantum properties such as superposition and interference. A Quantum Amplitude Estimation…
If the edges of the complete graph $K_n$ are totally ordered, a simple path whose edges are in ascending order is called increasing. The worst-case length of the longest increasing path has remained an open problem for several decades, with…
In his `Memoir on Elliptic Divisibility Sequences', Morgan Ward's definition of the said sequences has the remarkable feature that it does not become at all clear until deep into the paper that there exist nontrivial such sequences. Even…
Lame equation arises from deriving Laplace equation in ellipsoidal coordinates; in other words, it's called ellipsoidal harmonic equation. Lame functions are applicable to diverse areas such as boundary value problems in ellipsoidal…
We address the problem of estimating how different parts of the brain develop and change throughout the lifespan, and how these trajectories are affected by genetic and environmental factors. Estimation of these lifespan trajectories is…
It is well-known that for a quickly increasing sequence $(n_k)_{k \geq 1}$ the functions $(\cos 2 \pi n_k x)_{k \geq 1}$ show a behavior which is typical for sequences of independent random variables. If the growth condition on $(n_k)_{k…
As an extension of Polya's classical result on random walks on the square grids ($\Z^d$), we consider a random walk where the steps, while still have unit length, point to different directions. We show that in dimensions at least 4, the…
We study approximation algorithms for the following three string measures that are widely used in practice: edit distance (ED), longest common subsequence (LCS), and longest increasing sequence (LIS). All three problems can be solved…
We study numerically the distributions of the length $L$ of the longest increasing subsequence (LIS) for the two cases of random permutations and of one-dimensional random walks. Using sophisticated large-deviation algorithms, we are able…
Ascent sequences are sequences of nonnegative integers with restrictions on the size of each letter, depending on the number of ascents preceding it in the sequence. Ascent sequences have recently been related to (2+2)-free posets and…
We give a deterministic, nearly logarithmic-space algorithm that given an undirected graph $G$, a positive integer $r$, and a set $S$ of vertices, approximates the conductance of $S$ in the $r$-step random walk on $G$ to within a factor of…
A considerable amount of the standard model's three-generation structure can be realised from just the $8\hspace{.3mm}\mathbb{C}$-dimensional algebra of the complex octonions. Indeed, it is a little-known fact that the complex octonions can…
We develop a general criterion about coarsening for a class of nonlinear evolution equations describing one dimensional pattern-forming systems. This criterion allows one to discriminate between the situation where a coarsening process…