Related papers: Hausdorff Reductions and the Exponential Hierarchi…

We study complex networks formed by triangulations and higher-dimensional simplicial complexes representing closed evolving manifolds. In particular, for triangulations, the set of possible transformations of these networks is restricted by…

We introduce a new ladder of function spaces which is shown to fill in the gap between the weak $L^{p\infty}$ spaces and the larger Morrey spaces, $M^p$. Our motivation for introducing these new spaces, denoted $\V^{pq}$, is to gain a more…

For every odd prime $p$ and every integer $n\geq 12$ there is a Heisenberg group of order $p^{5n/4+O(1)}$ that has $p^{n^2/24+O(n)}$ pairwise nonisomorphic quotients of order $p^{n}$. Yet, these quotients are virtually indistinguishable.…

We investigate machine models similar to Turing machines that are augmented by the operations of a first-order structure $\mathcal{R}$, and we show that under weak conditions on $\mathcal{R}$, the complexity class $\text{NP}(\mathcal{R})$…

Constructor rewriting systems are said to be cons-free if, roughly, constructor terms in the right-hand sides of rules are subterms of constructor terms in the left-hand side; the computational intuition is that rules cannot build new data…

We combine the classical notions and techniques for bounded query classes with those developed in quantum computing. We give strong evidence that quantum queries to an oracle in the class NP does indeed reduce the query complexity of…

We consider a new hierarchy of semidefinite relaxations for the general polynomial optimization problem $(P):\:f^{\ast}=\min \{\,f(x):x\in K\,\}$ on a compact basic semi-algebraic set $K\subset\R^n$. This hierarchy combines some advantages…

Second-order polynomials generalize classical first-order ones in allowing for additional variables that range over functions rather than values. We are motivated by their applications in higher-order computational complexity theory,…

The class of problems complete for NP via first-order reductions is known to be characterized by existential second-order sentences of a fixed form. All such sentences are built around the so-called generalized IS-form of the sentence that…

When are two algorithms the same? How can we be sure a recently proposed algorithm is novel, and not a minor twist on an existing method? In this paper, we present a framework for reasoning about equivalence between a broad class of…

We consider classification problems for manifolds and discrete subgroups of Lie groups from a descriptive set-theoretic point of view. This work is largely foundational in conception and character, recording both a framework for general…

The Heisenberg hierarchy and its Hamiltonian structure are derived respectively by virtue of the zero curvature equation and the trace identity. With the help of the Lax matrix we introduce an algebraic curve $\mathcal{K}_{n}$ of arithmetic…

We consider the minimization problem of a sum of a number of functions having Lipshitz $p$-th order derivatives with different Lipschitz constants. In this case, to accelerate optimization, we propose a general framework allowing to obtain…

We study an equivalence class of iterated rational Darboux transformations applied on the harmonic oscillator, showing that many choices of state adding and state deleting transformations lead to the same transformed potential. As a…

In the nineties Immerman and Medina initiated the search for syn- tactic tools to prove NP-completeness. In their work, amongst several results, they conjecture that the NP-completeness of a problem defined by the conjunction of a sentence…

In 2008, Bodirsky and Grohe showed that for every $\Pi_n^{\mathrm{P}}$-level of the Polynomial Hierarchy (PH) there are $\omega$-categorical Constraint Satisfaction Problems (CSPs) complete for this level. We show that, in fact, there are…

Let A be an abelian category of finite type and homological dimension 1. Then by results of Green R(A), the extended Hall-Ringel algebra of A, has a natural Hopf algebra structure. We consider its Heisenberg double Heis(A) and study its…

Noncrossing arc diagrams are combinatorial models for the equivalence classes of the lattice congruences of the weak order on permutations. In this paper, we provide a general method to endow these objects with Hopf algebra structures.…

Algorithms with unitary oracles can be nested, which makes them extremely versatile. An example is the phase estimation algorithm used in many candidate algorithms for quantum speed-up. The search for new quantum algorithms benefits from…

We generalize the classical Henneberg minimal surface by giving an infinite family of complete, finitely branched, non-orientable, stable minimal surfaces in $\mathbb{R}^3$. These surfaces can be grouped into subfamilies depending on a…