Related papers: Discrete correlation of order 2 of generalized Rud…
Let $\{X_{n}, n\ge 1\}$ be a sequence of independent random variables with common general error distribution $GED(v)$ with shape parameter $v>0$, and let $M_{n,r}$ denote the $r$th largest order statistics of $X_{1}, X_{2}, \cdots, X_{n}$.…
We introduce a family of coefficients based on U-statistics that generalize the notion of correlation and explore their properties in the large dimensional multivariate case, showing that in the null case of uncorrelated variables, the…
Suppose that $\alpha,\beta\in\mathbb{R}$. Let $\alpha\geqslant1$ and $c$ be a real number in the range $1<c< 12/11$. In this paper, it is proved that there exist infinitely many primes in the generalized Piatetski--Shapiro sequence, which…
We study a distributed estimation problem in which two remotely located parties, Alice and Bob, observe an unlimited number of i.i.d. samples corresponding to two different parts of a random vector. Alice can send $k$ bits on average to…
We study the random composition of a small family of O(n^3) simple permutations on {0,1}^n. Specifically we ask how many randomly selected simple permutations need be composed to yield a permutation that is close to k-wise independent. We…
We introduce a new class of combinatorial objects, named tight gradings, which are certain nonnegative integer-valued functions on maximal Dyck paths. Using tight gradings, we derive a manifestly positive formula for any wall-function in a…
This article treats the Picard group of the moduli (stack) of r-spin curves and its compactification. Generalized spin curves, or r-spin curves are a natural generalization of 2-spin curves (algebraic curves with a theta-characteristic),…
Using the Moore--Penrose pseudoinverse, this work generalizes the gradient approximation technique called centred simplex gradient to allow sample sets containing any number of points. This approximation technique is called the…
We study a family of directed random graphs whose arcs are sampled independently of each other, and are present in the graph with a probability that depends on the attributes of the vertices involved. In particular, this family of models…
Generalized Cullen Numbers are positive integers of the form $C_b(n):=nb^n+1$. In this work we generalize some known divisibility properties of Cullen Numbers and present two primality tests for this family of integers. The first test is…
Given a group G, the model $\mathcal{G}(G,p)$ denotes the probability space of all Cayley graphs of G where each element of the generating set is chosen independently at random with probability p. In this article we show that for any…
In this paper, we construct directed strongly regular graphs with new parameters by using partial sum families with local rings. 16 families of new directed strongly regular graphs are obtained and the uniform partial sum families are…
Pseudo-random arrays and perfect maps are the two-dimensional analogs of M-sequences and de Bruijn sequences, respectively. We modify the definitions to be applied to codes. These codes are also the two-dimensional analogs of certain…
Recent applications in queuing theory and statistical mechanics have isolated the process formed by the eigenvalues of successive minors of the GUE. Analogous eigenvalue processes, formed in general from the eigenvalues of nested sequences…
This paper is originally designed as a part of revision of the author's preprint math.AG/9908174 "P-adic Schwarzian triangle groups of Mumford type". Recently, Yves Andr'e pointed out a flaw in that preprint; more precisely, Proposition II…
Motivated by the recent proof of the Stanley-Wilf conjecture, we study the asymptotic behavior of the number of permutations avoiding a generalized pattern. Generalized patterns allow the requirement that some pairs of letters must be…
We introduce a random coding technique for transmission over discrete memoryless channels, reminiscent of the basic construction attaining the Gilbert-Varshamov bound for codes in Hamming spaces. The code construction is based on drawing…
Partially ordered sets of type (k, n) are the sets such that a) cardinality of each set is n, b) dimension of each set is two, c) length of the maximal antichain in each set is k. Let \alpha_k(n) be the number of partially ordered sets of…
Strongly regular Cayley graphs with Paley parameters over abelian groups of rank 2 were studied in [J.A Davis, Partial difference sets in p-groups, Arch.Math.63 (1994) 103-110; K.H Leung, S.L. Ma, Partial difference sets with Paley…
We establish fully-discrete a priori and semi-discrete in time a posteriori error estimates for a discontinuous-continuous Galerkin discretization of the wave equation in second order formulation; the resulting method is a Petrov-Galerkin…