English
Related papers

Related papers: An additivity theorem for plain Kolmogorov complex…

200 papers

For any 1-reduced simplicial set $K$ we define a canonical, coassociative coproduct on $\Om C(K)$, the cobar construction applied to the normalized, integral chains on $K$, such that any canonical quasi-isomorphism of chain algebras from…

Algebraic Topology · Mathematics 2024-09-11 Kathryn Hess , Paul-Eugène Parent , Jonathan Scott , Andrew Tonks

We prove that for any positive integer c and any s > 0 there are representations of c as a sum a+b of two coprime positive integers a, b, such that the respective radicals are all greater than K(s)R(c)^(1-s)c^2. For the reprasentations in…

Number Theory · Mathematics 2007-05-23 Constantin M. Petridi

Simple optics are defined using actions of monoidal categories. Compound optics arise, for instance, as natural transformations between polynomial functors. Since a monoidal category is a special case of a bicategory, we formulate complex…

Category Theory · Mathematics 2022-03-24 Bartosz Milewski

A series of the form $\sum_{\ell=0}^{\infty}c(\kappa,\ell)\,M_{\kappa,\ell+1/2}(r_{0})W_{\kappa,\ell+1/2}(r)P_{\ell}(\cos(\gamma))$ is evaluated explicitly where $c(\kappa,\ell)$ are suitable complex coefficients, $M_{\kappa,\mu}$ and…

Mathematical Physics · Physics 2024-03-07 Pavel Šťovíček

We show that the Kirillov-Reshetikhin crystal B^{r,s} for nonexceptional affine types is simple and have the similarity property. As a corollary of the first fact we can derive that the tensor product of KR crystals is connected. Variations…

Representation Theory · Mathematics 2012-12-04 Masato Okado

Let $A$, $B$ be separable C*-algebras, $B$ stable. Elements of the E-theory group $E(A,B)$ are represented by asymptotic homomorphisms from the second suspension of $A$ to $B$. Our aim is to represent these elements by (families of) maps…

Operator Algebras · Mathematics 2017-08-08 Vladimir Manuilov

Kasparov $KK$-groups $KK(A,B)$ are represented as homotopy groups of the Pedersen-Weibel nonconnective algebraic $K$-theory spectrum of the additive category of Fredholm $(A,B)$-bimodules for $A$ and $B$, respectively, a separable and…

K-Theory and Homology · Mathematics 2007-05-23 Tamaz Kandelaki

Andrews and Simay showed that parity palindrome compositions have a surprisingly simple formula. We give a recursive proof.

Combinatorics · Mathematics 2021-09-28 Vincent Vatter

In this work we deduce explicit formulae for the elements of the matrices that represent the action of integro-differential operators over the coefficients of generalized Fourier series. Our formulae are obtained by performing operations on…

Numerical Analysis · Mathematics 2017-12-21 José M. A. Matos , Maria João Rodrigues , João Carrilho de Matos

In the paper where he first defined Communication Complexity, Yao asks: \emph{Is computing $CC(f)$ (the 2-way communication complexity of a given function $f$) NP-complete?} The problem of deciding whether $CC(f) \le k$, when given the…

Computational Complexity · Computer Science 2025-07-15 Shuichi Hirahara , Rahul Ilango , Bruno Loff

We study Krylov complexity for quantum systems whose Hamiltonians factorise as tensor products. We prove that complexity is superadditive under tensor products, $C_{12}\ge C_1+C_2$, and identify a positive operator that quantifies the…

High Energy Physics - Theory · Physics 2026-01-14 Jeff Murugan , Hendrik J. R. van Zyl

The goal of this expository article is to present a proof that is as direct and elementary as possible of the fundamental theorem of complex multiplication (Shimura, Taniyama, Langlands, Tate, Deligne et al.). The article is a revision of…

Number Theory · Mathematics 2007-05-24 J. S. Milne

Kolmogorov complexity is the length of the ultimately compressed version of a file (that is, anything which can be put in a computer). Formally, it is the length of a shortest program from which the file can be reconstructed. We discuss the…

Information Theory · Computer Science 2020-04-22 Paul Vitanyi

A set of valuable universal similarity factorization equalities is established over complex Clifford algebras $\Cn.$ Through them matrix representations of complex Clifford algebras $\Cn$ can directly be derived, and their properties can…

Mathematical Physics · Physics 2007-05-23 Yongge Tian

We introduce a multivariate generalization of normalized Chebyshev polynomials of the second kind. We prove that these polynomials arise in the context of cluster characters associated to Dynkin quivers of type $\mathbb A$ and…

Representation Theory · Mathematics 2009-10-14 G. Dupont

For a broad class of input-output maps, arguments based on the coding theorem from algorithmic information theory (AIT) predict that simple (low Kolmogorov complexity) outputs are exponentially more likely to occur upon uniform random…

Data Analysis, Statistics and Probability · Physics 2019-10-03 Kamaludin Dingle , Guillermo Valle Pérez , Ard A. Louis

We calculate the higher topological complexity TC$_s$ for the complements of reflection arrangements, in other words for the pure Artin type groups of all finite complex reflection groups. In order to do that we introduce a simple…

Algebraic Topology · Mathematics 2014-11-10 Sergey Yuzvinsky

We study the two-weighted off-diagonal compactness of commutators of rough singular integral operators $T_\Omega$ that are associated with a kernel $\Omega\in L^q(\mathbb{S}^{d-1})$. We establish a characterisation of compactness of the…

Classical Analysis and ODEs · Mathematics 2025-03-17 Aapo Laukkarinen , Jaakko Sinko

The relational complexity, introduced by G. Cherlin, G. Martin, and D. Saracino, is a measure of ultrahomogeneity of a relational structure. It provides an information on minimal arity of additional invariant relations needed to turn given…

Combinatorics · Mathematics 2013-09-18 David Hartman , Jan Hubicka , Jaroslav Nesetril

We analyse the logical complexity and absoluteness of natural statements about Ulam sequences, with particular emphasis on the rigidity phenomena introduced by Hinman, Kuca, Schlesinger and Sheydvasser for the family $U(1,n)$. For each pair…

Logic · Mathematics 2025-12-03 Frank Gilson