Related papers: Forcing for hL and hd

Let $C\subseteq \{1,\ldots,k\}^n$ be such that for any $k$ distinct elements of $C$ there exists a coordinate where they all differ simultaneously. Fredman and Koml\'os studied upper and lower bounds on the largest cardinality of such a set…

Among the variety of statistical intervals, highest-density regions (HDRs) stand out for their ability to effectively summarize a distribution or sample, unveiling its distinctive and salient features. An HDR represents the minimum size set…

We study some approximation problems on a strict subset of the circle by analytic functions of the Hardy space H2 of the unit disk (in C), whose modulus satisfy a pointwise constraint on the complentary part of the circle. Existence and…

Our main objective is to demonstrate how homological perturbation theory (HPT) results over the last 40 years immediately or with little extra work give some of the Koszul duality results that have appeared in the last decade. Higher…

We develop axiomatics of highest weight categories and quasi-hereditary algebras in order to incorporate two semi-infinite situations which are in Ringel duality with each other; the underlying posets are either upper finite or lower…

This paper studies eigenvalues of the buckling problem of arbitrary order on compact domains in Euclidean spaces and spheres. We prove universal bounds for the $k$-th eigenvalue in terms of the lower ones independent of the domains. Our…

Let H be the supremum of finitely many real polynomials of degree d and assume that H has a strict local minimum at 0. We prove a \L ojasiewicz-type inequality $H(x_1,...,x_n) > ||(x_1,...,x_n)||^s$ where s depends only on d and n. This…

Let $A$ be a central division algebra of prime degree $p$ over $\mathbb{Q}$. We obtain subconvex hybrid bounds, uniform in both the eigenvalue and the discriminant, for the sup-norm of Hecke-Maass forms on the compact quotients of…

A cardinal lambda is called omega-inaccessible if for all mu < lambda we have mu^omega<lambda. We show that for every omega-inaccessible cardinal lambda there is a CCC (hence cardinality and cofinality preserving) forcing that adds a…

This work focuses on minimizing the eigenvalue of a noncommutative polynomial subject to a finite number of noncommutative polynomial inequality constraints. Based on the Helton-McCullough Positivstellensatz, the noncommutative analog of…

The well known duality between the Sobolev inequality and the Hardy-Littlewood-Sobolev inequality suggests that the Nash inequality could also have an interesting dual form, even though the Nash inequality relates three norms instead of…

We consider the problem of approximating the reachable set of a discrete-time polynomial system from a semialgebraic set of initial conditions under general semialgebraic set constraints. Assuming inclusion in a given simple set like a box…

We investigate the computational complexity of computing the Hausdorff distance. Specifically, we show that the decision problem of whether the Hausdorff distance of two semi-algebraic sets is bounded by a given threshold is complete for…

In this paper, we investigate the sharp Hardy-Littlewood-Sobolev inequalities on the Heisenberg group. On one hand, we apply the concentration compactness principle to prove the existence of the maximizers. While the approach here gives a…

We provide a natural generalization to submanifolds of the holographic method used to extract higher-order local invariants of both Riemannian and conformal embeddings, some of which depend on a choice of parallelization of the normal…

The aim of this article is to provide a simple and unified way to obtain the sharp upper bounds of nodal sets of eigenfunctions for different types of eigenvalue problems on real analytic domains. The examples include biharmonic Steklov…

Derived equivalences between finite dimensional algebras do, in general, not pass to centraliser (or other) subalgebras, nor do they preserve homological invariants of the algebras, such as global or dominant dimension. We show that,…

We determine the computational complexity of approximately counting the total weight of variable assignments for every complex-weighted Boolean constraint satisfaction problem (or CSP) with any number of additional unary (i.e., arity 1)…

Let $1 \leq p < q < \infty$. We show that \[ \sup{\frac{\left\| D\right\|_{\mathcal{H}_{q}}}{\left\| D\right\|_{\mathcal{H}_{p}}}} = \exp{\left( \frac{\log{x}}{\log{\log{x}}} \left(\log{\sqrt{\frac{q}{p}}} +…

This paper proposes a new hybrid high-order discretization for the biharmonic problem and the corresponding eigenvalue problem. The discrete ansatz space includes degrees of freedom in $n-2$ dimensional submanifolds (e.g., nodal values in…