相关论文: Hausdorff Reductions and the Exponential Hierarchi…

Let $X$ be a topological space. A subset of $C(X)$, the space of continuous real-valued functions on $X$, is a partially ordered set in the pointwise order. Suppose that $X$ and $Y$ are topological spaces, and $A(X)$ and $A(Y)$ are subsets…

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…

We study the complexity theory for the local distributed setting introduced by Korman, Peleg and Fraigniaud. They have defined three complexity classes LD (Local Decision), NLD (Nondeterministic Local Decision) and NLD^#n. The class LD…

We give a comprehensive characterization of the computational power of shallow quantum circuits combined with classical computation. Specifically, for classes of search problems, we show that the following statements hold, relative to a…

We introduce some new symmetric tensor categories based on the combinatorics of trees: a discrete family $\mathcal{D}(n)$, for $n \ge 3$ an integer, and a continuous family $\mathcal{C}(t)$, for $t \ne 1$ a complex number. The construction…

We describe the boundary of chaos separating regions of parameter space with positive topological entropy from those with zero topological entropy for a class of piecewise smooth maps. This coincides with the boundary of positive Hausdorff…

Hierarchies allow feature sharing between objects at multiple levels of representation, can code exponential variability in a very compact way and enable fast inference. This makes them potentially suitable for learning and recognizing a…

This paper is an exploration in a functional programming framework of {\em isomorphisms} between elementary data types (natural numbers, sets, multisets, finite functions, permutations binary decision diagrams, graphs, hypergraphs,…

We study a new class of NP search problems, those which can be proved total using standard combinatorial reasoning based on approximate counting. Our model for this kind of reasoning is the bounded arithmetic theory $\mathrm{APC}_2$ of…

It is known that $Q$-conditional symmetries of the classical Burgers' equation express in terms of three functions satisfying a coupled system of Burgers-like equations. The search of conditional symmetries of this system leads to a system…

We provide a list of new natural $\mathsf{VNP}$-intermediate polynomial families, based on basic (combinatorial) $\mathsf{NP}$-complete problems that are complete under parsimonious reductions. Over finite fields, these families are in…

We classify finite-dimensional Hopf algebras over an algebraically closed field of characteristic zero whose Hopf coradcial is isomorphic to the smallest non-pointed basic Hopf algebra, under the assumption that the diagrams are strictly…

For symbolic dynamics with some mild conditions, we solve the lowering topological entropy problem for subsystems and determine the Hausdorff dimension of the level set with given complexity, where the complexity is represented by Hausdorff…

We address facts and open questions concerning the degree of ill-posedness of the composite Hausdorff moment problem aimed at the recovery of a function $x \in L^2(0,1)$ from elements of the infinite dimensional sequence space $\ell^2$ that…

It is known that solutions to second order uniformly elliptic and parabolic equations, either in divergence or nondivergence (general) form, are H\"{o}lder continuous and satisfy the interior Harnack inequality. We show that even in the…

We study similarity classes of point configurations in $\R^d$. Given a finite collection of points, a well-known question is: How high does the Hausdorff dimension $\hd(E)$ of a compact set $E \subset {\Bbb R}^d$, $d \ge 2$, need to be to…

Motivated by previous work leveraging factorizations of second- and fourth-order differential operators, a general integral inequality involving higher order derivatives is proven by elementary means. It is then shown how this framework…

We prove that the problem of deciding the consequence relation of the full Lambek calculus with weakening is complete for the class HAck of hyper-Ackermannian problems (i.e., level F_{\omega}^{\omega} of the ordinal-indexed hierarchy of…

The Polynomial-Time Hierarchy ($\mathsf{PH}$) is a staple of classical complexity theory, with applications spanning randomized computation to circuit lower bounds to ''quantum advantage'' analyses for near-term quantum computers.…

The classical theorems of Banach and Stone, Gelfand and Kolmogorov, and Kaplansky show that a compact Hausdorff space $X$ is uniquely determined by the linear isometric structure, the algebraic structure, and the lattice structure,…