Related papers: Complexity theory for spaces of integrable functio…
We point out that a proper use of the Hoeffding--ANOVA decomposition for symmetric statistics of finite urn sequences, previously introduced by the author, yields a decomposition of the space of square-integrable functionals of a…
We consider computational complexity of problems related to the fundamental group and the first homology group of (embeddable) $2$-complexes. We show, as an extension of an earlier work, that computing first homology of $2$-complexes is…
Using a Poisson bracket representation, in 3D, of the Lie algebra $\mathfrak{sl}(2)$, we first use highest weight representations to embed this into larger Lie algebras. These are then interpreted as symmetry and conformal symmetry algebras…
The polynomial multiplication problem has attracted considerable attention since the early days of computer algebra, and several algorithms have been designed to achieve the best possible time complexity. More recently, efforts have been…
We explain that the set of new integrable systems generalizing the Calogero family and implied by the study of WLZZ models, which was described in arXiv:2303.05273, is only the tip of the iceberg. We provide its wide generalization and…
The paper deals with partial and weak preference relations defined on infinite-dimensional vector spaces and compatible with algebraic operations. By a partial preference we mean an asymmetric and transitive binary relation, while a weak…
This paper studies the following question: given a piecewise-linear function, find its minimal algebraic representation as a tropical rational signomial. We put forward two different notions of minimality, one based on monomial length, the…
Representations by linear integral operators on $L_p$ spaces over measure spaces are investigated for the polynomial covariance type commutation relations and more general two-sided generalizations of covariance commutation relations…
Polyhedral Lyapunov functions can approximate any norm arbitrarily well. Because of this, they are used to study the stability of linear time varying and linear parameter varying systems without being conservative. However, the…
This article is a fundamental study in computable analysis. In the framework of Type-2 effectivity, TTE, we investigate computability aspects on finite and infinite products of effective topological spaces. For obtaining uniform results we…
Conformal algebras, recently introduced by Kac, encode an axiomatic description of the singular part of the operator product expansion in conformal field theory. The objective of this paper is to develop the theory of ``multi-dimensional''…
The existence of string functions, which are not polynomial time computable, but whose graph is checkable in polynomial time, is a basic assumption in cryptography. We prove that in the framework of algebraic complexity, there are no such…
The notion of Anosov representations has been introduced by Labourie in his study of the Hitchin component for SL(n,R). Subsequently, Anosov representations have been studied mainly for surface groups, in particular in the context of higher…
Is it possible to find a shortest description for a binary string? The well-known answer is "no, Kolmogorov complexity is not computable." Faced with this barrier, one might instead seek a short list of candidates which includes a laconic…
Descriptive complexity theory aims at inferring a problem's computational complexity from the syntactic complexity of its description. A cornerstone of this theory is Fagin's Theorem, by which a graph property is expressible in existential…
In this paper we develop representation theory of the two fold central extension of SL(2) over the field of 2-adic numbers. As a consequence, we obtain a local Shimura correspondence between the two fold central extension of SL(2) and the…
We present forms of the classical Riesz-Kolmogorov theorem for compactness that are applicable in a wide variety of settings. In particular, our theorems apply to classify the precompact subsets of the Lebesgue space $L^2$, Paley-Wiener…
We develop a theory of complexity for numerical computations that takes into account the condition of the input data and allows for roundoff in the computations. We follow the lines of the theory developed by Blum, Shub, and Smale for…
We recall the notions of Fr\"olicher and diffeological spaces and we build regular Fr\"olicher Lie groups and Lie algebras of formal pseudo-differential operators in one independent variable. Combining these constructions with a smooth…
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)…