Related papers: Rudin-Kisler ordering on the P-hierarchy

Karlin's (1982) Theorem 5.2 shows that linear systems alternating between growth and mixing phases have lower asymptotic growth with greater mixing. Here this result is extended to linear differential equations that combine site-specific…

In this paper we prove local gradient estimates and higher differentiability result for the solutions of variational obstacle inequalities \int_\Omega\big<\mathcal{A}(x,u,Du),D(\phi-u)\big>dx\geq \int_\Omega\mathcal{B}(x,u,Du)(\phi-u)dx.…

In this expository paper we discuss the volume product P(K) of convex bodies K in $R^n$; this is the product of volumes of K and its polar K*. The Blaschke- Santalo inequalities state that always $ P(K) \le P(B_2)$ and $ P(B_1)\le P(K)$ .…

We use the Schmidt Subspace Theorem to establish the transcendence of a class of quasi-periodic continued fractions. This improves earlier works of Maillet and of A. Baker. We also improve an old result of Davenport and Roth on the rate of…

Felsner and Reuter introduced the linear extension diameter of a partially ordered set $\mathbf{P}$, denoted $\mbox{led}(\mathbf{P})$, as the maximum distance between two linear extensions of $\mathbf{P}$, where distance is defined to be…

Let $F$ be an $n$-point set in $\mathbb{K}^d$ with $\mathbb{K}\in\{\mathbb{R},\mathbb{Z}\}$ and $d\geq 2$. A (discrete) X-ray of $F$ in direction $s$ gives the number of points of $F$ on each line parallel to $s$. We define…

Reynolds' theory of relational parametricity formalizes parametric polymorphism for System F, thus capturing the idea that polymorphically typed System F programs always map related inputs to related results. This paper shows that Reynolds'…

We study the problem of finding an acyclic orientation of an undirected graph with constrained in-degree parities specified by a subset T of vertices. An orientation is called T -odd if a vertex v has odd in-degree if and only if v P T .…

Let $U_0,U_1$ be two normal measures on $\kappa .$ We say that $U_0$ is in the Mitchell ordering less then $U_1,$ $U_0\vartriangleleft U_1,$ if $U_0 \in Ult(V,U_1) .$ The ordering is well-known to be transitive and well-founded. It has been…

We prove that the Kalton-Peck twisted sum $Z_2^n$ of $n$-dimensional Hilbert spaces has GL-l.u.st.\ constant of order $\log n$ and bounded GL constant. This is the first concrete example which shows different explicit orders of growth in…

We consider the problem of clustering in the learning-augmented setting, where we are given a data set in $d$-dimensional Euclidean space, and a label for each data point given by an oracle indicating what subsets of points should be…

Given $n$ polynomials $p_1, \dots, p_n$ of degree at most $n$ with $\|p_i\|_\infty \le 1$ for $i \in [n]$, we show there exist signs $x_1, \dots, x_n \in \{-1,1\}$ so that \[\Big\|\sum_{i=1}^n x_i p_i\Big\|_\infty < 30\sqrt{n}, \] where…

We revise a method by Kalnins, Kress and Miller (2010) for constructing a canonical form for symmetry operators of arbitrary order for the Schr\"odinger eigenvalue equation $H\Psi \equiv (\Delta_2 +V)\Psi=E\Psi$ on any 2D Riemannian…

Hemaspaandra, Hempel, and Wechsung [cs.CC/9909020] initiated the field of query order, which studies the ways in which computational power is affected by the order in which information sources are accessed. The present paper studies, for…

The $p$-rank of a Steiner triple system $B$ is the dimension of the linear span of the set of characteristic vectors of blocks of $B$, over GF$(p)$. We derive a formula for the number of different Steiner triple systems of order $v$ and…

We show that the number of partitions of n with alternating sum k such that the multiplicity of each part is bounded by 2m+1 equals the number of partitions of n with k odd parts such that the multiplicity of each even part is bounded by m.…

We establish a relation between intersection numbers of special cycles on a Shimura curve and special values of derivatives of metaplectic Eisenstein series at a place of bad reduction where p-adic uniformization in the sense of Cherednik…

Let P(x,d,a) denote the number of primes p<=x with p=a(mod d). Chebyshev's bias is the phenomenon that `more often' P(x;d,n)>P(x;d,r) than the other way around, where n is a quadratic non-residue mod d and r is a quadratic residue mod d. If…

This paper studies the problem of upper bounding the number of independent sets in a graph, expressed in terms of its degree distribution. For bipartite regular graphs, Kahn (2001) established a tight upper bound using an…

An optimal first-order global regularity theory, in spaces of functions defined in terms of oscillations, is established for solutions to Dirichlet problems for the $p$-Laplace equation and system, with right-hand side in divergence form.…