Related papers: Existence of small ordered orthogonal arrays
We prove the extensions of Birkhoff's and Cotlar's ergodic theorems to multi-dimensional polynomial subsets of prime numbers $\mathbb{P}^k$. We deduce them from $\ell^p$-boundedness of $r$-variational seminorms for the corresponding…
We prove a version of Rao decomposition for quasi-martingales indexed by a linearly ordered set.
In this article, we prove some factorization results for several classes of polynomials having integer coefficients, which in particular yield several classes of irreducible polynomials. Such classes of polynomials are devised by imposing…
An {\em ordered $r$-graph} is an $r$-uniform hypergraph whose vertex set is linearly ordered. Given $2\leq k\leq r$, an ordered $r$-graph $H$ is {\em interval} $k$-{\em partite} if there exist at least $k$ disjoint intervals in the ordering…
The paper studies the question of existence of polynomials with given roots over associative non-commutative rings with identity. It is shown that in the case of an associative division ring for arbitrary n elements of this ring there…
We describe a family of polynomials discovered via a particular recursion relation, which have connections to Chebyshev polynomials of the first and the second kind, and the polynomial version of Pell's equation. Many of their properties…
We apply ideas from the theory of limits of dense combinatorial structures to study order types, which are combinatorial encodings of finite point sets. Using flag algebras we obtain new numerical results on the Erd\H{o}s problem of finding…
We prove the existence of locally distance increasing maps with it controllable small curvatures
The law of the iterated logarithm for discrepancies of geometric progressions with small ratios is proved.
Order of magnitude reasoning - reasoning by rough comparisons of the sizes of quantities - is often called 'back of the envelope calculation', with the implication that the calculations are quick though approximate. This paper exhibits an…
In this paper, we exhibit new monotonicity properties of roots of families of orthogonal polynomials $P_n^{(z)}(x)$ depending polynomially on a parameter (Laguerre and Gegenbauer). By establishing that $P_n^{(z)}(x)$ are realrooted in $z$…
We continue studying polynomials generated by the Szeg\H{o} recursion when a finite number of Verblunsky coefficients lie outside the closed unit disk. We prove some asymptotic results for the corresponding orthogonal polynomials and then…
Let $(P_N)_{N\ge0}$ one of the classical sequences of orthogonal polynomials, i.e., Hermite, Laguerre or Jacobi polynomials. For the roots $z_{1,N},\ldots, z_{N,N}$ of $P_N$ we derive lower estimates for $\min_{i\ne j}|z_{i,N}-z_{j,N}|$ and…
The theorem of orthogonal-orthogonal duality of Rowe, Repka, and Carvalho is proven by a method based on characters that is very different from theirs and akin to Helmers's half a century earlier proof of the analogous sympletic-symplectic…
Let P be a polygon with rational vertices in the plane. We show that for any finite odd-sized collection of translates of P, the area of the set of points lying in an odd number of these translates is bounded away from 0 by a constant…
We show that several problems of compacting orthogonal graph drawings to use the minimum number of rows, area, length of longest edge or total edge length cannot be approximated better than within a polynomial factor of optimal in…
In 2015, Felsner, Trotter, and Wiechert showed that posets with outerplanar cover graphs have bounded dimension. We generalise this result to posets with $k$-outerplanar cover graphs. Namely, we show that posets with $k$-outerplanar cover…
We study two families of orthogonal polynomials. The first is a finite family related to the Askey-Wilson polynomials but the orthogonality is on the real line. A limiting case of this family is an infinite system of orthogonal polynomials…
The dimension of partial derivatives (Nisan and Wigderson, 1997) is a popular measure for proving lower bounds in algebraic complexity. It is used to give strong lower bounds on the Waring decomposition of polynomials (called Waring rank).…
We use a non-linear characterization of orthonormal polynomials due to Saff in order to show that the behavior of orthonormal polynomials is determined only by its leading coefficient and its normalization. Several applications of this…