Related papers: The universality of polynomial time Turing equival…

We prove a generalization of classical Montel's theorem for the mixed differences case, for polynomials and exponential polynomial functions, in commutative setting.

Here we propose a way to construct generalized Kostka polynomials. Namely, we construct an equivariant filtration on tensor products of irreducible representations. Further, we discuss properties of the filtration and the adjoint graded…

This paper relates the well-known Linear Temporal Logic with the logic of propositional schemata introduced by the authors. We prove that LTL is equivalent to a class of schemata in the sense that polynomial-time reductions exist from one…

We introduce the notion of feedback computable functions from $2^\omega$ to $2^\omega$, extending feedback Turing computation in analogy with the standard notion of computability for functions from $2^\omega$ to $2^\omega$. We then show…

We give a new method to calculate the universal cohomology classes of coincident root loci. We show a polynomial behavior of them and apply this result to prove that generalized Pl\"ucker formulas are polynomials in the degree, just as the…

We present a collection of algebraic equivalences between tautological cycles on the Jacobian $J$ of a curve, i.e., cycles in the subring of the Chow ring of $J$ generated by the classes of certain standard subvarieties of $J$. These…

This short survey of recent work in tile self-assembly discusses the use of simulation to classify and separate the computational and expressive power of self-assembly models. The journey begins with the result that there is a single…

The Connes Embedding Problem (CEP) asks whether every separable II_1 factor embeds into an ultrapower of the hyperfinite II_1 factor. We show that the CEP is equivalent to the computability of the universal theory of every type II_1 von…

This paper provides a new and more direct proof of the assertion that a Turing computable function of the natural numbers is primitive recursive if and only if the time complexity of the corresponding Turing machine is bounded by a…

Contrary to the classical case, the relation between quantum programming languages and quantum Turing Machines (QTM) has not being fully investigated. In particular, there are features of QTMs that have not been exploited, a notable example…

We propose a definition of quantum computable functions as mappings between superpositions of natural numbers to probability distributions of natural numbers. Each function is obtained as a limit of an infinite computation of a quantum…

An interplay between the Lambert series and Euler's Pentagonal Number Theorem gives an Euler-type recurrence relation for any given arithmetical function. As consequences of this, we present Euler-type recurrence relations for some…

We prove simultaneous Universal Approximation of a certain type of Pade Approximants and of Taylor series with the same indexes. This is a generic phenomenon in the space of holomorphic functions in any simply connected domain, as well as…

Given a countable o-minimal theory T, we characterize the Borel complexity of isomorphism for countable models of T up to two model-theoretic invariants. If T admits a nonsimple type, then it is shown to be Borel complete by embedding the…

We establish a dichotomy theorem characterizing the circumstances under which a treeable Borel equivalence relation E is essentially countable. Under additional topological assumptions on the treeing, we in fact show that E is essentially…

Let $E\subseteq F$ and $E'\subseteq F'$ be Borel equivalence relations on the standard Borel spaces $X$ and $Y$, respectively. The pair $(E,F)$ is simultaneously Borel reducible to the pair $(E',F')$ if there is a Borel function $f:X\to Y$…

We study the question which Boolean algebras have the property that for every generating set there is an ultrafilter selecting maximal number of its elements. We call it the ultrafilter selection property. For cardinality aleph-one the…

We show for very general classes of measures on locally compact second countable groups that every Borel measurable quasimorphism is at bounded distance from a quasi-biharmonic one. This allows us to deduce non-degenerate central limit…

We compare ambient and outer Lipschitz geometry of Lipschitz normally embedded H\"older triangles in $\mathbb{R}^4$. In contrast to the case of $\mathbb{R}^3$ there are infinitely many equivalence classes. The equivalence classes are…

I study the class of problems efficiently solvable by a quantum computer, given the ability to "postselect" on the outcomes of measurements. I prove that this class coincides with a classical complexity class called PP, or Probabilistic…