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

We consider a large family of theories of equivalence relations, each with finitely many classes, and assuming the existence of an $\omega$-Erdos cardinal, we determine which of these theories are Borel complete. We develop machinery,…

We study the complexity of computational problems arising from existence theorems in extremal combinatorics. For some of these problems, a solution is guaranteed to exist based on an iterated application of the Pigeonhole Principle. This…

We start the general structure theory of not necessarily semisimple finite tensor categories, generalizing the results in the semisimple case (i.e. for fusion categories), obtained recently in our joint work with D.Nikshych. In particular,…

The $P$ versus $NP$ problem is still unsolved. But there are several oracles with $P$ unequal $NP$ relative to them. Here we will prove, that $P\not=NP$ relative to a $P$-complete oracle. In this paper, we use padding arguments as the proof…

We provide the first evidence for the inherent difficulty of finding complex sets with optimal proof systems. For this, we construct oracles $O_1$ and $O_2$ with the following properties, where $\mathrm{RE}$ denotes the class of recursively…

Condensed mathematics, developed by Clausen and Scholze over the last few years, proposes a generalization of topology with better categorical properties. It replaces the concept of a topological space by that of a condensed set, which can…

We consider a dominance order on positive vectors induced by the elementary symmetric polynomials. Under this dominance order we provide conditions that yield simple proofs of several monotonicity questions. Notably, our approach yields a…

We introduce a new hierarchy of higher-order nested pushdown trees generalising Alur et al.'s concept of nested pushdown trees. Nested pushdown trees are useful representations of control flows in the verification of programs with recursive…

We recall results concerning one-dimensional classical and quantum systems with ladder operators. We obtain the most general one-dimensional classical systems respectively with a third and a fourth order ladder operators satisfying…

Starting from degree N solutions of a time dependent Schroedinger-like equation for classical orthogonal polynomials, a linear matrix equation describing perturbations around the N zeros of the polynomial is derived. The matrix has…

Linear differential equations and recurrences reveal many properties about their solutions. Therefore, these equations are well-suited for representing solutions and computing with special functions. We identify a large class of existing…

Complexity theory provides a wealth of complexity classes for analyzing the complexity of decision and counting problems. Despite the practical relevance of enumeration problems, the tools provided by complexity theory for this important…

The complexity class $\exists\mathbb R$, standing for the complexity of deciding the existential first order theory of the reals as real closed field in the Turing model, has raised considerable interest in recent years. It is well known…

We consider two-variable first-order logic FO2 over infinite words. Restricting the number of nested negations defines an infinite hierarchy; its levels are often called the half-levels of the FO2 quantifier alternation hierarchy. For every…

We consider a class of exponentials in the Weyl-Heisenberg algebra with exponents of type at most linear in coordinates and arbitrary functions of momenta. They are expressed in terms of normal ordering where coordinates stand to the left…

We introduce the general polynomial algebras characterizing a class of higher order superintegrable systems that separate in Cartesian coordinates. The construction relies on underlying polynomial Heisenberg algebras and their defining…

We consider a particular type of matrices which belong at the same time to the class of Hessenberg and Toeplitz matrices, and whose determinants are equal to the number of a type of compositions of natural numbers. We prove a formula in…

We introduce a general class of combinatorial objects, which we call \emph{multi-complexes}, which simultaneously generalizes graphs, multigraphs, hypergraphs and simplicial and delta complexes. We introduce a natural algebra of…

We consider infinite $\Z_\Z$-index complexes $\mathcal C$ of spaces with elements depending on a number of parameters, complete with respect to a linear associative regular inseparable multilinear product. The existence of nets of vanishing…

The Penrose triangle, staircase, and related ``impossible objects'' have long been understood as related to first cohomology $H^1$: the obstruction to extending locally consistent interpretations around a loop. This paper develops a…