Related papers: Complexity theory for spaces of integrable functio…

Usual termination proofs for a functional program require to check all the possible reduction paths. Due to an exponential gap between the height and size of such the reduction tree, no naive formalization of termination proofs yields a…

We introduce intrinsic Sobolev-Slobodeckij spaces for a class of ultra-parabolic Kolmogorov type operators satisfying the weak H\"ormander condition. We prove continuous embeddings into Lorentz and intrinsic H\"older spaces. We also prove…

We show that basic notions of locally analytic representation theory can be reformulated in the language of topological coalgebras (Hopf algebras) and comodules. We introduce the notion of admissible comodule and show that it corresponds to…

In contrast with the notion of complexity, a set $A$ is called anti-complex if the Kolmogorov complexity of the initial segments of $A$ chosen by a recursive function is always bounded by the identity function. We show that, as for…

It is well-known that the embedding of the Sobolev space of weakly differentiable functions into H\"{o}lder spaces holds if the integrability exponent is higher than the space dimension. In this paper, the embedding of the Sobolev functions…

Motivated by the interest in computing explicit formulas for resultants and discriminants initiated by B\'ezout, Cayley and Sylvester in the eighteenth and nineteenth centuries, and emphasized in the latest years due to the increase of…

In previous work, the second author introduced a topology, for spaces of irreducible representations, that reduces to the classical Zariski topology over commutative rings but provides a proper refinement in various noncommutative settings.…

This dissertation is a contribution to the project of second-order set theory, which has seen a revival in recent years. The approach is to understand second-order set theory by studying the structure of models of second-order set theories.…

We establish quantitative second-order Sobolev regularity for functions having a $2$-integrable $p$-Laplacian in bounded RCD spaces, with $p$ in a suitable range. In the finite-dimensional case, we also obtain Lipschitz regularity under the…

We reduce the isomorphism problem for undirected graphs without loops to the isomorphism problems for a class of finite dimensional $2$-step nilpotent Lie algebras over a field and for a class of finite $p$-groups. We show that the…

In this paper we study the representation theory of three monoids of partial functions on an $n$-set. The monoid of all order-preserving functions (i.e., functions satisfying $f(x)\leq f(y)$ if $x\leq y$) the monoid of all order-decreasing…

We extend classical methods of computational complexity to the realm of distributed computing, where they sometimes prove more effective than in their original context. Our focus is on decision problems in the LOCAL model, a setting in…

Challenging the standard notion of totality in computable functions, one has that, given any sufficiently expressive formal axiomatic system, there are total functions that, although computable and "intuitively" understood as being total,…

This short note investigates the compact embedding of degenerate matrix weighted Sobolev spaces into weighted Lebesgue spaces. The Sobolev spaces explored are defined as the abstract completion of Lipschitz functions in a bounded domain…

We present an algebraic characterization of the complexity classes Logspace and NLogspace, using an algebra with a composition law based on unification. This new bridge between unification and complexity classes is inspired from proof…

We introduce a restricted second-order logic $\mathrm{SO}^{\mathit{plog}}$ for finite structures where second-order quantification ranges over relations of size at most poly-logarithmic in the size of the structure. We demonstrate the…

We study representations of the double affine Lie algebra associated to a simple Lie algebra. We construct a family of indecomposable integrable representations and identify their irreducible quotients. We also give a condition for the…

We give a representation of the classical theory of multiplicative arithmetic functions (MF)in the ring of symmetric polynomials. The basis of the ring of symmetric polynomials that we use is the isobaric basis, a basis especially sensitive…

We compute the integer cohomology rings of the ``polygon spaces'' introduced in [Hausmann,Klyachko,Kapovich-Millson]. This is done by embedding them in certain toric varieties; the restriction map on cohomology is surjective and we…

We analyze the bit complexity of efficient algorithms for fundamental optimization problems, such as linear regression, $p$-norm regression, and linear programming (LP). State-of-the-art algorithms are iterative, and in terms of the number…