Related papers: Discrete correlation of order 2 of generalized Rud…
We derive simplified sphere-packing and Gilbert--Varshamov bounds for codes in the sum-rank metric, which can be computed more efficiently than previous ones. They give rise to asymptotic bounds that cover the asymptotic setting that has…
In this paper, we prove an asymptotic formula for the number of relatively prime pairs in the Piatetski-Shapiro sequence of arbitrarily large order. This improves the result of Pimsert, Srichan and Tangsupphathawat (2023), the order of…
The generalized second-order partial derivatives of 1/r, where r is the radial distance in 3D, are obtained using a result of the potential theory of classical analysis. Some non-spherical regularization alternatives to the standard…
An occurrence of a classical pattern p in a permutation \pi is a subsequence of \pi whose letters are in the same relative order (of size) as those in p. In an occurrence of a generalized pattern, some letters of that subsequence may be…
V. I. Arnold [Russian Math. Surveys 26, no. 2, 1971, 29-43] constructed smooth generic families of matrices with respect to similarity transformations depending smoothly on the entries of matrices and got bifurcation diagrams of such…
We consider the degree-diameter problem for undirected and directed circulant graphs. To date, attempts to generate families of large circulant graphs of arbitrary degree for a given diameter have concentrated mainly on the diameter 2 case.…
George R. Terrell (1983, {Ann. Probab., vol. 11(3), pp. 823--826) showed that the Pearson coefficient of correlation of an ordered pair from a random sample of size two is at most one-half, and the equality is attained only for rectangular…
Pseudo-random sequences with good statistical property, such as low autocorrelation, high linear complexity and large 2-adic complexity, have been applied in stream cipher. In general, it is difficult to give both the linear complexity and…
The purpose of this paper is to investigate the connection between context-free grammars and normal ordering problem, and then to explore various extensions of the Stirling grammar. We present grammatical characterizations of several well…
It is well known that, when normalized by n, the expected length of a longest common subsequence of d sequences of length n over an alphabet of size sigma converges to a constant gamma_{sigma,d}. We disprove a speculation by Steele…
We define a new family of generalized Stirling permutations that can be interpreted in terms of ordered trees and forests. We prove that the number of generalized Stirling permutations with a fixed number of ascents is given by a natural…
A discrete Gelfand-Tsetlin pattern is a configuration of particles in Z^2. The particles are arranged in a finite number of consecutive rows, numbered from the bottom. There is one particle on the first row, two particles on the second row,…
The statistical property of a growing scale-free network is studied based on an earlier model proposed by Krapivsky, Rodgers, and Redner [Phys. Rev. Lett. 86, 5401 (2001)], with the additional constraints of forbidden of self-connection and…
The generalized word length pattern of an orthogonal array allows a ranking of orthogonal arrays in terms of the generalized minimum aberration criterion (Xu and Wu [Ann. Statist. 29 (2001) 1066-1077]). We provide a statistical…
We consider a version of D. Price's model for the growth of a bibliographic network, where in each iteration a constant number of citations is randomly allocated according to a weighted combination of accidental (uniformly distributed) and…
We provide arguments for the property of the degree-degree correlations of giant components formed by the percolation process on uncorrelated random networks. Using the generating functions, we derive a general expression for the…
We consider special multiclass spectral, discrepancy, degree, and codegree properties of expanding graph sequences. As we can prove equivalences and implications between them and the definition of the generalized quasirandomness of…
Let $S_r(p,q)$ be the $r$-associated Stirling numbers of the second kind, the number of ways to partition a set of size $p$ into $q$ subsets of size at least $r$. For $r=1$, these are the standard Stirling numbers of the second kind, and…
Let $G$ be the group of $\mathbb R$--points of a semisimple algebraic group $\mathcal G$ defined over $\mathbb Q$. Assume that $G$ is connected and noncompact. We study Fourier coefficients of Poincar\' e series attached to matrix…
Algorithm and code to produce sequences whose members obey Gaussian distribution function is reported. Discreet and limited number of groups are defined in the distribution function, where each group is represented only with one value…