The limit of a Stanley–Wilf sequence is not always rational, and layered patterns beat monotone patterns

We show the first known example for a pattern q for which is not an integer, where S_n(q) denotes the number of permutations of length n avoiding the pattern q. We find the exact value of the limit and show that it is irrational, but algebraic. Then we generalize our results to an infinite sequence of patterns. We provide further generalizations that start explaining why certain patterns are easier to avoid than others. Finally, we show that if q is a layered pattern of length k, then L(q)(k-1)² holds.     

Factors of generalised polynomials and automatic sequences

The aim of this short note is to generalise the result of Rampersad–Shallit saying that an automatic sequence and a Sturmian sequence cannot have arbitrarily long common factors. We show that the same result holds if a Sturmian sequence is replaced by an arbitrary sequence whose terms are given by a generalised polynomial (i.e., an expression involving algebraic operations and the floor function) that is not periodic except for a set of density zero.     

Forbidden patterns and shift systems

The scope of this paper is two-fold. First, to present to the researchers in combinatorics an interesting implementation of permutations avoiding generalized patterns in the framework of discrete-time dynamical systems. Indeed, the orbits generated by piecewise monotone maps on one-dimensional intervals have forbidden order patterns, i.e., order patterns that do not occur in any orbit. The allowed patterns are then those patterns avoiding the so-called forbidden root patterns and their shifted patterns. The second scope is to study forbidden patterns in shift systems, which are universal models in information theory, dynamical systems and stochastic processes. Due to its simple structure, shift systems are accessible to a more detailed analysis and, at the same time, exhibit all important properties of low-dimensional chaotic dynamical systems (e.g., sensitivity to initial conditions, strong mixing and a dense set of periodic points), allowing to export the results to other dynamical systems via order-isomorphisms.     

A note on Schrage's generalised variable upper bounds

An improved procedure for implementing pivoting, based upon ideas from generalised upper bounds, is suggested for Schrage's generalised variable upper bounds.     

On Finite Racks and Quandles

We revisit finite racks and quandles using a perspective based on permutations which can aid in the understanding of the structure. As a consequence we recover old results and prove new ones. We also present and analyze several examples.

Communicated by M. Dixon.     

Point regular groups of automorphisms of generalised quadrangles

We study the point regular groups of automorphisms of some of the known generalised quadrangles. In particular we determine all point regular groups of automorphisms of the thick classical generalised quadrangles. We also construct point regular groups of automorphisms of the generalised quadrangle of order (q−1,q+1) obtained by Payne derivation from the classical symplectic quadrangle W(3,q). For q=pf with f?2 we obtain at least two nonisomorphic groups when p?5 and at least three nonisomorphic groups when p=2 or 3. Our groups include nonabelian 2-groups, groups of exponent 9 and nonspecial p-groups. We also enumerate all point regular groups of automorphisms of some small generalised quadrangles.     

Chebyshev-Legendre pseudo-spectral method for the generalised Burgers-Fisher equation

In this paper, we consider numerical approximation of generalised Burgers-Fisher equation using the pseudo-spectral method. For the time discretization we apply Crank-Nicolson /leapfrog scheme. The space discretization is based on Legendre Galerkin formulation while the Chebyshev-Gauss-Lobatto (CGL) nodes are used in practical computation, which is called “Chebyshev-Legendre” method. The stability and convergence are rigorously set up. Numerical experiments are presented to demonstrate the effectiveness of the method and to confirm the theoretical results.     

On the zeros of a class of generalised Dirichlet series-XIV

We prove a general theorem on the zeros of a class of generalised Dirichlet series. We quote the following results as samples. Theorem A.Let 0<θ<1/2and let {a _n }be a sequence of complex numbers satisfying the inequality for N = 1,2,3,…,also for n = 1,2,3,…let α _n be real and |α_n| ≤ C(θ)where C(θ) > 0is a certain (small)constant depending only on θ. Then the number of zeros of the function in the rectangle (1/2-δ⩽σ⩽1/2+δ,T⩽t⩽2T) (where 0<δ<1/2)is ≥C(θ,δ)T logT where C(θ,δ)is a positive constant independent of T provided T ≥T ₀(θ,δ)a large positive constant. Theorem B.In the above theorem we can relax the condition on a _n to and |a_N| ≤ (1/2-θ)^-1.Then the lower bound for the number of zeros in (σ⩾1/3−δ,T⩽t⩽2T)is > C(θ,δ) Tlog T(log logT)^-1.The upper bound for the number of zeros in σ⩾1/3+δ,T⩽t⩽2T) isO(T)provided for every ε > 0. Dedicated to the memory of Professor K G Ramanathan     

On eigenfunctions and maximal cliques of generalised Paley graphs of square order

Let GP $(q^2,m)$ be the m-Paley graph defined on the finite field with order $q^2$. We study eigenfunctions and maximal cliques in generalised Paley graphs GP $(q^2,m)$, where $m|(q+1)$. In particular, we explicitly construct maximal cliques of size $\frac{q+1}{m}$ or $\frac{q+1}{m}+1$ in GP $(q^2,m)$, and show the weight-distribution bound on the cardinality of the support of an eigenfunction is tight for the smallest eigenvalue $-\frac{q+1}{m}$ of GP $(q^2,m)$. These new results extend the work of Baker et al. and Goryainov et al. on Paley graphs of square order. We also study the stability of the Erdős-Ko-Rado theorem for GP $(q^2,m)$ (first proved by Sziklai).     

Extending the multivariate generalised and generalised distributions

The GGH family of multivariate distributions is obtained by scale mixing on the Exponential Power distribution using the Extended Generalised Inverse Gaussian distribution. The resulting GGH family encompasses the multivariate generalised hyperbolic (GH), which itself contains the multivariate t and multivariate Variance-Gamma (VG) distributions as special cases. It also contains the generalised multivariate t distribution [O. Arslan, Family of multivariate generalised t distribution, Journal of Multivariate Analysis 89 (2004) 329–337] and a new generalisation of the VG as special cases. Our approach unifies into a single GH-type family the hitherto separately treated t-type [O. Arslan, A new class of multivariate distribution: Scale mixture of Kotz-type distributions, Statistics and Probability Letters 75 (2005) 18–28; O. Arslan, Variance–mean mixture of Kotz-type distributions, Communications in Statistics-Theory and Methods 38 (2009) 272–284] and VG-type cases. The GGH distribution is dual to the distribution obtained by analogous mixing on the scale parameter of a spherically symmetric stable distribution. Duality between the multivariate t and multivariate VG [S.W. Harrar, E. Seneta, A.K. Gupta, Duality between matrix variate t and matrix variate V.G. distributions, Journal of Multivariate Analysis 97 (2006) 1467–1475] does however extend in one sense to their generalisations.     

On codewords in the dual code of classical generalised quadrangles and classical polar spaces

In [J.L. Kim, K. Mellinger, L. Storme, Small weight codewords in LDPC codes defined by (dual) classical generalised quadrangles, Des. Codes Cryptogr. 42 (1) (2007) 73-92], the codewords of small weight in the dual code of the code of points and lines of Q(4,q) are characterised. Inspired by this result, using geometrical arguments, we characterise the codewords of small weight in the dual code of the code of points and generators of Q⁺(5,q) and H(5,q²), and we present lower bounds on the weight of the codewords in the dual of the code of points and k-spaces of the classical polar spaces. Furthermore, we investigate the codewords with the largest weights in these codes, where for q even and k sufficiently small, we determine the maximum weight and characterise the codewords of maximum weight. Moreover, we show that there exists an interval such that for every even number w in this interval, there is a codeword in the dual code of Q⁺(5,q), q even, with weight w and we show that there is an empty interval in the weight distribution of the dual of the code of Q(4,q), q even. To prove this, we show that a blocking set of Q(4,q), q even, of size q²+1+r, where 0<r<(q+4)/6, contains an ovoid of Q(4,q), improving on [J. Eisfeld, L. Storme, T. Sz?nyi, P. Sziklai, Covers and blocking sets of classical generalised quadrangles, Discrete Math. 238 (2001) 35-51, Theorem 9].     

Uniqueness and extinction properties of generalised Markov branching processes

This paper focuses on the basic problems regarding uniqueness and extinction properties for generalised Markov branching processes. The uniqueness criterion is firstly established and a differential-integral equation satisfied by the transition functions of such processes is derived. The extinction probability is then obtained. A closed form is presented for both the mean extinction time and the conditional mean extinction time. It turns out that these important quantities are closely related to the elementary gamma function.     

Self-decomposability of weak variance generalised gamma convolutions

Weak variance generalised gamma convolution processes are multivariate Brownian motions weakly subordinated by multivariate Thorin subordinators. Within this class, we extend a result from strong to weak subordination that a driftless Brownian motion gives rise to a self-decomposable process. Under moment conditions on the underlying Thorin measure, we show that this condition is also necessary. We apply our results to some prominent processes such as the weak variance alpha–gamma process, and illustrate the necessity of our moment conditions in some cases.     

Eigenvalue distribution of certain ray patterns

In this paper, the eigenvalue distribution of complex matrices with certain ray patterns is investigated. Cyclically real ray patterns and ray patterns that are signature similar to real sign patterns are characterized, and their eigenvalue distribution is discussed. Among other results, the following classes of ray patterns are characterized: ray patterns that require eigenvalues along a fixed line in the complex plane, ray patterns that require eigenvalues symmetric about a fixed line, and ray patterns that require eigenvalues to be in a half-plane. Finally, some generalizations and open questions related to eigenvalue distribution are mentioned.