Related papers: Existence of small ordered orthogonal arrays
The article proves an assertion analogous to the Littlewood-Paley theorem for the orthoprojectors onto mutually orthogonal subspaces of piecewise polynomial functions on the cube $ I^d. $ This assertion provides an upper estimate for the…
The five parameter family of multivariable Askey-Wilson polynomials is studied with four parameters generically complex. The multivariable Askey-Wilson polynomials form an orthogonal system with respect to an explicit (in general complex)…
We prove that the set of orthogonal separable coordinates on an arbitrary (pseudo-)Riemannian manifold carries a natural structure of a projective variety, equipped with an action of the isometry group. This leads us to propose a new,…
In this paper, we use the Erd\"{o}s-Szekeres lemma to show that there exists a graph with partial order competition dimension greater than five.
Let $X_1, X_2,\ldots, X_n$ (resp. $Y_1, Y_2,\ldots, Y_n$) be independent random variables such that $X_i$ (resp. $Y_i$) follows generalized exponential distribution with shape parameter $\theta_i$ and scale parameter $\lambda_i$ (resp.…
The orthogonality relations of multivariate Krawtchouk polynomials are discussed. In case of two variables, the necessary and sufficient conditions of orthogonality is given by Gr\"unbaum and Rahman in [SIGMA 6 (2010), 090, 12 pages,…
Consider the family of bounded degree graphs in any minor-closed family (such as planar graphs). Let d be the degree bound and n be the number of vertices of such a graph. Graphs in these classes have hyperfinite decompositions, where, for…
In a recent paper (2018), D. Hofmann, R. Neves and P. Nora proved that the dual of the category of compact partially ordered spaces and monotone continuous maps is a quasi-variety - not finitary, but bounded by $\aleph_1$. An open question…
Let $(P,\leq)$ be a finite poset (partially ordered set), where $P$ has cardinality $n$. Consider linear extensions of $P$ as permutations $x_1x_2\cdots x_n$ in one-line notation. For distinct elements $x,y\in P$, we define…
There is a natural intuition that, given a large $n$, the distributions of small segments of a randomly sampled polygonal chain and those of a randomly sampled closed polygonal chain (drawn from the subspace measure of course), should be…
The lattice of partitions of a set and its d-divisible generalization have been much studied for their combinatorial, topological, and representation-theoretic properties. An ordered set partition is a set partition where the subsets are…
In this article we consider orthonormal systems consisting of tensor products of splines. We show some convergence results of the corresponding orthogonal series including a.e. convergence and unconditional convergence in $L^p$ for…
We present a new technique for proving logarithmic upper bounds for diameters of evolving random graph models, which is based on defining a coupling between random graphs and variants of random recursive trees. The advantage of the…
Orthogonal drawings, i.e., embeddings of graphs into grids, are a classic topic in Graph Drawing. Often the goal is to find a drawing that minimizes the number of bends on the edges. A key ingredient for bend minimization algorithms is the…
We explore "semibounded" expansions of arbitrary ordered groups; namely, expansions that do not define a field on the whole universe. We show that if $\mathcal R=\langle R, <, +, \dots\rangle$ is a semibounded o-minimal structure and…
Consider a semi-algebraic set A in R^d constructed from the sets which are determined by inequalities p_i(x)>0, p_i(x)\ge 0, or p_i(x)=0 for a given list of polynomials p_1,...,p_m. We prove several statements that fit into the following…
Let $\mathcal{C}$ be a class of graphs that is closed under taking subgraphs. We prove that if for some fixed $0<\delta\le 1$, every $n$-vertex graph of $\mathcal{C}$ has a balanced separator of order $O(n^{1-\delta})$, then any depth-$k$…
We find precise asymptotic estimates for the number of planar maps and graphs with a condition on the minimum degree, and properties of random graphs from these classes. In particular we show that the size of the largest tree attached to…
As part of the graph minor project, Robertson and Seymour showed in 1990 that the class of graphs that can be embedded in a given surface can be characterized by a finite set of minimal excluded minors. However, their proof, because…
Chow varieties are a parameter space for cycles of a given variety of a given codimension and degree. We construct their analog for differential algebraic varieties with differential algebraic subvarieties, answering a question of Gao, Li…