Related papers: Existence of small ordered orthogonal arrays

For a finite partially ordered set we calculate the dimension of the variety of its subspace representations having fixed dimension vector. The dimension is given in terms of the Euler quadratic form associated with a partially ordered set,…

Several polytopes arise from finite graphs. For edge and symmetric edge polytopes, in particular, exhaustive computation of the Ehrhart polynomials not merely supports the conjecture of Beck {\it et al.}\ that all roots $\alpha$ of Ehrhart…

Analogous to Kolmogorov's theorem for the existence of stochastic processes describing random functions, we consider theorems for the existence of stochastic processes describing random measures, as limits of inverse measure systems.…

An old conjecture of Kahn and Saks says, roughly, that any poset $P$ of large enough width contains elements $x,y$ which are "balanced" in the sense that the probability that $x$ precedes $y$ in a uniformly random linear extension of $P$ is…

It is well known that if a finite order linear differential operator with polynomial coefficients has as eigenfunctions a sequence of orthogonal polynomials with respect to a positive measure (with support in the real line), then its order…

In recent years, chain sequences and their perturbations have played a significant role in characterising the orthogonal polynomials both on the real line as well as on the unit circle. In this note, a particular disturbance of the chain…

We consider random orthonormal polynomials $$ P_{n}(x)=\sum_{i=0}^{n}\xi_{i}p_{i}(x), $$ where $\xi_{0}$, . . . , $\xi_{n}$ are independent random variables with zero mean, unit variance and uniformly bounded $(2+\ep_0)$-moments, and…

NOTE: Unfortunately, most of the results mentioned here were already known under the name of "d-separated interval piercing". The result that T_d(m) exists was first proved by Gya\'rfa\'s and Lehel in 1970, see [5]. Later, the result was…

For a $k$-uniform hypergraph $G$ with vertex set $\{1,\ldots,n\}$, the ordered Ramsey number $\operatorname{OR}_t(G)$ is the least integer $N$ such that every $t$-coloring of the edges of the complete $k$-uniform graph on vertex set…

The problem of finding a nontrivial factor of a polynomial f(x) over a finite field F_q has many known efficient, but randomized, algorithms. The deterministic complexity of this problem is a famous open question even assuming the…

The degree/diameter problem for mixed graphs asks for the largest possible order of a mixed graph with given diameter and degree parameters. Similarly the \emph{degree/geodecity} problem concerns the smallest order of a $k$-geodetic mixed…

In this paper we define the concept of orthogonality between two factors "through another factor". Exploiting this property we have been able to obtain orthogonal main effect plans (OMEP) on non-orthogonal blocks requiring considerably…

It is well-known that orthogonal polynomials on the real line satisfy a three-term recurrence relation and conversely every system of polynomials satisfying a three-term recurrence relation is orthogonal with respect to some positive Borel…

In this paper, we study the well extension of strict(irreflective) partial well orderings. We first prove that any partially well-ordered structure <A, R> can be extended to a well-ordered one. Then we prove that every linear extension of…

In this thesis we consider ordered graphs (that is, graphs with a fixed linear ordering on their vertices). We summarize and further investigations on the number of edges an ordered graph may have while avoiding a fixed forbidden ordered…

We study asymptotic clustering of zeros of random polynomials, and show that the expected discrepancy of roots of a polynomial of degree $n$, with not necessarily independent coefficients, decays like $\sqrt{\log n/n}$. Our proofs rely on…

We prove logarithmic upper bounds for the diameters of the random-surfer Webgraph model and the PageRank-based selection Webgraph model, confirming the small world phenomenon holds for them. In the special case when the generated graph is a…

We show that the order dimension of the weak order on a Coxeter group of type A, B or D is equal to the rank of the Coxeter group, and give bounds on the order dimensions for the other finite types. This result arises from a unified…

Ordinal pattern dependence has been introduced in order to capture co-monotonic behavior between two time series. This concept has several features one would intuitively demand from a dependence measure. It was believed that ordinal pattern…

We give the strong asymptotic of Cauchy biorthogonal polynomials under the assumption that the defining measures are supported on non intersecting intervals of the real line and satisfy Szeg\H{o}'s condition. The biorthogonal polynomials…