相关论文: Hausdorff Reductions and the Exponential Hierarchi…
We introduce the entangled quantum polynomial hierarchy $\mathsf{QEPH}$ as the class of problems that are efficiently verifiable given alternating quantum proofs that may be entangled with each other. We prove $\mathsf{QEPH}$ collapses to…
We study the Hausdorff moment problem for a class of sequences, namely $(r(n))_{n\in\mathbb Z_+},$ where $r$ is a rational function in the complex plane. We obtain a necessary condition for such sequence to be a Hausdorff moment sequence.…
This article introduces innovative classes of open sets in \(\mathbb{R}^{N}\), where \(N=2, 3\), characterized by a geometric property associated with the inward normal. The focus lies on proving compactness results for the Hausdorff…
We study the existence of optimal and p-optimal proof systems for classes in the Boolean hierarchy over $\mathrm{NP}$. Our main results concern $\mathrm{DP}$, i.e., the second level of this hierarchy: If all sets in $\mathrm{DP}$ have…
This paper investigates a class of non-autonomous highly oscillatory ordinary differential equations characterized by a linear component inversely proportional to a small parameter $\varepsilon$, with purely imaginary eigenvalues, and an…
We describe a categorification of the Double Affine Hecke Algebra (${\mathcal{H}\kern -.4em\mathcal{H}}$) associated with an affine Lie algebra $\widehat{\mathfrak{g}}$, including a categorification of the polynomial representation and…
The Massively Parallel Computation (MPC) model serves as a common abstraction of many modern large-scale data processing frameworks, and has been receiving increasingly more attention over the past few years, especially in the context of…
The type III Hermite $X_m$ exceptional orthogonal polynomial family is generalized to a double-indexed one $X_{m_1,m_2}$ (with $m_1$ even and $m_2$ odd such that $m_2 > m_1$) and the corresponding rational extensions of the harmonic…
In this article, we introduce a notion of an exponential matrix, which is a polynomial matrix with exponential properties, and a notion of an equivalence relation of two exponential matrices, and then we initiate to study classifying…
The polynomial hierarchy is a grading of problems by difficulty, including P, NP and coNP as the best known classes. The promise polynomial hierarchy is similar, but extended to include promise problems. It turns out that the promise…
We prove some results on the Wadge order on the space of sets of natural numbers endowed with Scott topology, and more generally, on omega-continuous domains. Using alternating decreasing chains we characterize the property of Wadge…
Let $A \subseteq E$ be a given extension of Hopf (respectively Lie) algebras. We answer the \emph{classifying complements problem} (CCP) which consists of describing and classifying all complements of $A$ in $E$. If $H$ is a given…
We prove explicit doubling inequalities and obtain uniform upper bounds (under $(d-1)$-dimensional Hausdorff measure) of nodal sets of weak solutions for a family of linear elliptic equations with rapidly oscillating periodic coefficients.…
We generalize the classical theorem by Jarnik and Besicovitch on the irrationality exponents of real numbers and Hausdorff dimension. Let a be any real number greater than or equal to 2 and let b be any non-negative real less than or equal…
For a class of polynomial non-autonomous differential equations of degree n, we use phase plane analysis to show that each equation in this class has n periodic solutions. The result implies that certain rigid two-dimensional systems have…
In this paper, we propose a new convergent conic programming hierarchy of relaxations involving both semi-definite cone and second-order cone constraints for solving nonconvex polynomial optimization problems to global optimality. The…
Hopf algebras appear in connection with various problems in Pure Mathematics and Theoretical Physics, mainly through their categoriesof representations, which are examples of tensor categories. In recent years, there have been major…
To expand a fundamental theory of context-free languages, we equip nondeterministic one-way pushdown automata with additional oracle mechanisms, which naturally induce various nondeterministic reducibilities among formal languages. As a…
The classical Hausdorff dimension of finite or countable sets is zero. We define an analog for finite sets, called finite Hausdorff dimension which is non-trivial. It turns out that a finite bound for the finite Hausdorff dimension…
Our main results are in the following three sections: 1. We prove new relations between proof complexity conjectures that are discussed in \cite{pu18}. 2. We investigate the existence of p-optimal proof systems for $\mathsf{TAUT}$, assuming…