Searcharxiv⌕ Search

arXiv subjects

David Bevan

Publications and source records attributed to David Bevan.

26 records · Page 2Linked to original sources
arXiv2015

Intervals of permutation class growth rates

We prove that the set of growth rates of permutation classes includes an infinite sequence of intervals whose infimum is $θ_B\approx2.35526$, and that it also contains every value at least $λ_B\approx2.35698$. These results improve on a theorem of Vatter, who determined that there are permutation classes of every growth rate at least $λ_A\approx2.48187$. Thus, we also refute his conjecture that the set of growth rates below $λ_A$ is nowhere dense. Our proof is based upon an analysis of expansions of real numbers in non-integer bases, the study of which was initiated by Rényi in the 1950s. In particular, we prove two generalisations of a result of Pedicini concerning expansions in which the digits are drawn from sets of allowed values.

math.CO↗
arXiv2015

On the growth of permutation classes

We study aspects of the enumeration of permutation classes, sets of permutations closed downwards under the subpermutation order. First, we consider monotone grid classes of permutations. We present procedures for calculating the generating function of any class whose matrix has dimensions $m \times 1$ for some $m$, and of acyclic and unicyclic classes of gridded permutations. We show that almost all large permutations in a grid class have the same shape, and determine this limit shape. We prove that the growth rate of a grid class is given by the square of the spectral radius of an associated graph and deduce some facts relating to the set of grid class growth rates. In the process, we establish a new result concerning tours on graphs. We also prove a similar result relating the growth rate of a geometric grid class to the matching polynomial of a graph, and determine the effect of edge subdivision on the matching polynomial. We characterise the growth rates of geometric grid classes in terms of the spectral radii of trees. We then investigate the set of growth rates of permutation classes and establish a new upper bound on the value above which every real number is the growth rate of some permutation class. In the process, we prove new results concerning expansions of real numbers in non-integer bases in which the digits are drawn from sets of allowed values. Finally, we introduce a new enumeration technique, based on associating a graph with each permutation, and determine the generating functions for some previously unenumerated classes. We conclude by using this approach to provide an improved lower bound on the growth rate of the class of permutations avoiding the pattern $1324$. In the process, we prove that, asymptotically, patterns in Łukasiewicz paths exhibit a concentrated Gaussian distribution.

math.CO↗
arXiv2015

The permutation classes Av(1234,2341) and Av(1243,2314)

We investigate the structure of the two permutation classes defined by the sets of forbidden patterns {1234,2341} and {1243,2314}. By considering how the Hasse graphs of permutations in these classes can be built from a sequence of rooted source graphs, we determine their algebraic generating functions. Our approach is similar to that of "adding a slice", used previously to enumerate various classes of polyominoes and other combinatorial structures. To solve the relevant functional equations, we make extensive use of the kernel method.

math.CO↗
arXiv2015

Permutations avoiding 1324 and patterns in Łukasiewicz paths

The class Av(1324), of permutations avoiding the pattern 1324, is one of the simplest sets of combinatorial objects to define that has, thus far, failed to reveal its enumerative secrets. By considering certain large subsets of the class, which consist of permutations with a particularly regular structure, we prove that the growth rate of the class exceeds 9.81. This improves on a previous lower bound of 9.47. Central to our proof is an examination of the asymptotic distributions of certain substructures in the Hasse graphs of the permutations. In this context, we consider occurrences of patterns in Łukasiewicz paths and prove that in the limit they exhibit a concentrated Gaussian distribution.

math.CO↗
arXiv2014

Growth rates of geometric grid classes of permutations

Geometric grid classes of permutations have proven to be key in investigations of classical permutation pattern classes. By considering the representation of gridded permutations as words in a trace monoid, we prove that every geometric grid class has a growth rate which is given by the square of the largest root of the matching polynomial of a related graph. As a consequence, we characterise the set of growth rates of geometric grid classes in terms of the spectral radii of trees, explore the influence of "cycle parity" on the growth rate, compare the growth rates of geometric grid classes against those of the corresponding monotone grid classes, and present new results concerning the effect of edge subdivision on the largest root of the matching polynomial.

math.CO↗
arXiv2013

Growth rates of permutation grid classes, tours on graphs, and the spectral radius

Monotone grid classes of permutations have proven very effective in helping to determine structural and enumerative properties of classical permutation pattern classes. Associated with grid class $\mathrm{Grid}(M)$ is a graph, $G(M)$, known as its "row-column" graph. We prove that the exponential growth rate of $\mathrm{Grid}(M)$ is equal to the square of the spectral radius of $G(M)$. Consequently, we utilize spectral graph theoretic results to characterise all slowly growing grid classes and to show that for every $γ\geqslant2+\sqrt{5}$ there is a grid class with growth rate arbitrarily close to $γ$. To prove our main result, we establish bounds on the size of certain families of tours on graphs. In the process, we prove that the family of tours of even length on a connected graph grows at the same rate as the family of "balanced" tours on the graph (in which the number of times an edge is traversed in one direction is the same as the number of times it is traversed in the other direction).

math.CO↗
arXiv2002

Optimization of inhomogeneous electron correlation factors in periodic solids

A method is presented for the optimization of one-body and inhomogeneous two-body terms in correlated electronic wave functions of Jastrow-Slater type. The most general form of inhomogeneous correlation term which is compatible with crystal symmetry is used and the energy is minimized with respect to all parameters using a rapidly convergent iterative approach, based on Monte Carlo sampling of the energy and fitting energy fluctuations. The energy minimization is performed exactly within statistical sampling error for the energy derivatives and the resulting one- and two-body terms of the wave function are found to be well-determined. The largest calculations performed require the optimization of over 3000 parameters. The inhomogeneous two-electron correlation terms are calculated for diamond and rhombohedral graphite. The optimal terms in diamond are found to be approximately homogeneous and isotropic over all ranges of electron separation, but exhibit some inhomogeneity at short- and intermediate-range, whereas those in graphite are found to be homogeneous at short-range, but inhomogeneous and anisotropic at intermediate- and long-range electron separation.

cond-mat.str-el↗