Related papers: Complexity theory for spaces of integrable functio…
The main purpose of this paper is to investigate some natural problems regarding the order structure of representable functionals on $^*$-algebras. We describe the extreme points of order intervals, and give a nontrivial sufficient…
In a recent work I showed that the family of smooth steep time functions can be used to recover the order, the topology and the (Lorentz-Finsler) distance of spacetime. In this work I present the main ideas entering the proof of the…
Ergodic theory includes several notions of entropy for probability-preserving actions of countable groups. These include Kolmogorov--Sinai entropy based on F\o lner sequences for amenable groups, entropy defined using a random ordering of…
The class of functions from the integers to the integers computable in polynomial time has been characterized recently using discrete ordinary differential equations (ODE), also known as finite differences. In the framework of ordinary…
We introduce a notion of complexity of diagrams (and in particular of objects and morphisms) in an arbitrary category, as well as a notion of complexity of functors between categories equipped with complexity functions. We discuss several…
One of the major open problems in complexity theory is proving super-logarithmic lower bounds on the depth of circuits (i.e., $\mathbf{P}\not\subseteq\mathbf{NC}^1$). Karchmer, Raz, and Wigderson (Computational Complexity 5(3/4), 1995)…
Representations of Boolean functions by real polynomials play an important role in complexity theory. Typically, one is interested in the least degree of a polynomial p(x_1,...,x_n) that approximates or sign-represents a given Boolean…
The irreducible integrable representations with finite-dimensional weight spaces of toroidal Lie algebras on which the center acts non-trivially were classified by S.Eswara Rao. In this paper we give a compact proof of the results that lead…
We investigate partial functions and computability theory from within a constructive, univalent type theory. The focus is on placing computability into a larger mathematical context, rather than on a complete development of computability…
Let $F$ be a totally real field unramified at all places above $p$ and $D$ be a quaternion algebra which splits at either none, or exactly one, of the infinite places. Let $\bar{r}:\mathrm{Gal}(\bar{F}/F)\to…
This paper defines a linear representation for nonlinear maps $F:\mathbb{F}^n\rightarrow\mathbb{F}^n$ where $\mathbb{F}$ is a finite field, in terms of matrices over $\mathbb{F}$. This linear representation of the map $F$ associates a…
We study the relations between the notions of highness, lowness and logical depth in the setting of complexity theory. We introduce a new notion of polylog depth based on time bounded Kolmogorov complexity. We show polylog depth satisfies…
A notable feature of the TTE approach to computability is the representation of the argument values and the corresponding function values by means of infinitistic names. Two ways to eliminate the using of such names in certain cases are…
We use the complexity function of an invariant, not necessary closed, subset of a two-sided shift space to compute the polynomial entropy of the induced dynamics on the hyperspace of continua for certain one-dimensional dynamical systems.…
Soft linear logic ([Lafont02]) is a subsystem of linear logic characterizing the class PTIME. We introduce Soft lambda-calculus as a calculus typable in the intuitionistic and affine variant of this logic. We prove that the (untyped) terms…
Two representations of a reductive group G are spectrally equivalent if the same irreducible representations appear in both of them. The semigroup of finite dimensional representations of G with tensor product and up to spectral equivalence…
The algebra of functions on kappa-Minkowski noncommutative spacetime is studied as algebra of operators on Hilbert spaces. The representations of this algebra are constructed and classified. This new approach leads to a natural construction…
We give two natural definitions of polynomial-time computability for L2 functions; and we show them incomparable (unless complexity class FP_1 includes #P_1).
We study in detail certain natural continuous representations of G = GL(n,K) in locally convex vector spaces over a locally compact, non-archimedean field K of characteristic zero. We construct boundary value maps, or integral transforms,…
We provide a general treatment of perturbations of a class of functionals modeled on convolution energies with integrable kernel which approximate the $p$-th norm of the gradient as the kernel is scaled by letting a small parameter…