Related papers: On consecutive pattern-avoiding permutations of le…
We present a class of permutations for which the number of distinctly ordered subsequences of each permutation approaches an almost optimal value as the length of the permutation grows to infinity.
An important unsolved problem in Diophantine number theory is to establish a general method to effectively find all solutions to any given $S$-unit equation with at least four terms. Although there are many works contributing to this…
A growing self-avoiding walk (GSAW) is a walk on a graph that is directed, does not visit the same vertex twice, and has a trapped endpoint. We show that the generating function enumerating GSAWs on a half-infinite strip of finite height is…
We study the existence of various sign and value patterns in sequences defined by multiplicative functions or related objects. For any set $A$ whose indicator function is 'approximately multiplicative' and uniformly distributed on short…
We consider the problem of counting the copies of a length-$k$ pattern $\sigma$ in a sequence $f \colon [n] \to \mathbb{R}$, where a copy is a subset of indices $i_1 < \ldots < i_k \in [n]$ such that $f(i_j) < f(i_\ell)$ if and only if…
This is an exposition of the theorem from the title, which says that the number of self-avoiding walks with n steps in the hexagonal lattice has asymptotics (2cos(pi/8))^{n+o(n)}. We lift the key identity to formal level and simplify the…
We discuss the long time behaviour of the parabolic Anderson model, the Cauchy problem for the heat equation with random potential on $\Z^d$. We consider general i.i.d. potentials and show that exactly \emph{four} qualitatively different…
Circuits in deterministic decomposable negation normal form (d-DNNF) are representations of Boolean functions that enable linear-time model counting. This paper strengthens our theoretical knowledge of what classes of functions can be…
This paper determines the rate of growth to infinity of a scalar autonomous nonlinear functional differential equation with finite delay, where the right hand side is a positive continuous linear functional of $f(x)$. We assume $f$ grows…
We derive a set of equations for the wavefunction describing the marginal bound state of a single D0-brane with a single D4-brane. These are equations determining the vacuum of an N=8 abelian gauge theory with a charged hypermultiplet. We…
The busy beaver problem is a well-known example of a non-computable function. In order to determine a particular value of this function, it is necessary to generate and classify a large number of Turing machines. Previous work on this…
In this paper, we provide a uniform framework for investigating small circuit classes and bounds through the lens of ordinary differential equations (ODEs). Following an approach recently introduced to capture the class of polynomial-time…
In this paper, we introduce a new generating function called $d$-polynomial for the dimensions of $\tau$-tilting modules over a given finite dimensional algebra. Firstly, we study basic properties of $d$-polynomials and show that it can be…
We propose a new method for obtaining complete asymptotic expansions in a systematic manner, which is suitable for counting sequences of various graph families in dense regime. The core idea is to encode the two-dimensional array of…
We complete the proof of the fact that all principal permutation classes generated by a pattern longer than two have a nonrational generating function.
This paper starts the Wilf-classification of mesh patterns of length 2. Although there are initially 1024 patterns to consider we introduce automatic methods to reduce the number of potentially different Wilf-classes to at most 65. By…
The number of excursions (finite paths starting and ending at the origin) having a given number of steps and obeying various geometric constraints is a classical topic of combinatorics and probability theory. We prove that the sequence…
A 321-k-gon-avoiding permutation pi avoids 321 and the following four patterns: k(k+2)(k+3)...(2k-1)1(2k)23...(k+1), k(k+2)(k+3)...(2k-1)(2k)123...(k+1), (k+1)(k+2)(k+3)...(2k-1)1(2k)23...k, (k+1)(k+2)(k+3)...(2k-1)(2k)123...k. The…
In this paper we develop a classification of real functions based on growth rates of repeated iteration. We show how functions are naturally distinguishable when considering inverses of repeated iterations. For example, $n+2\to 2n\to 2^n\to…
We investigate a class of composite nonconvex functions, where the outer function is the sum of univariate extended-real-valued convex functions and the inner function is the limit of difference-of-convex functions. A notable feature of…