Related papers: Space-Bounded Kolmogorov Extractors
Tensors are a fundamental operation in distributed computing, \emph{e.g.,} machine learning, that are commonly distributed into multiple parallel tasks for large datasets. Stragglers and other failures can severely impact the overall…
We show that the In\"on\"u-Wigner contraction naturally associated to a reduction chain $\frak{s}\supset \frak{s}^{\prime}$ of semisimple Lie algebras induces a decomposition of the Casimir operators into homogeneous polynomials, the terms…
We prove a real interpolation characterization for some non Euclidean H\"older spaces, built on the Lie structure induced by a class of ultra-parabolic Kolmogorov-type operators satisfying the H\"ormander condition. As a by-product we also…
A novel selection principle was introduced by Dorantes-Aldama and Shakhmatov: a topological space $X$ is termed {\em selectively pseudocompact} if for any sequence $(U_n:n\in {\omega})$ of pairwise disjoint non-empty open sets of $X$, one…
This work is based on the proposal of a deterministic randomness extractor of a random Diffie-Hellman element defined over two prime order multiplicative subgroups of a finite fields $\mathbb{F}_{p^n}$, $G_1$ and $G_2$. We show that the…
The concept of complementability is extended from bounded operators to densely defined operators on Hilbert spaces. By introducing appropriate projections and decomposition techniques, a framework is developed for analyzing…
We investigate the theory of finite observables, i.e., resolutions of the finite-dimensional identity by means of positive operators, that have a physical interpretation in terms of measurement schemes. We focus on extremal and rank-one…
An infinite binary sequence has randomness rate at least $\sigma$ if, for almost every $n$, the Kolmogorov complexity of its prefix of length $n$ is at least $\sigma n$. It is known that for every rational $\sigma \in (0,1)$, on one hand,…
In this article we define Kober fractional integral operators in the multivariable case. First we consider one sequence of independent random variables and an arbitrary function, which can act as the joint density of another sequence of…
Smoothed Wigner transforms have been used in signal processing, as a regularized version of the Wigner transform, and have been proposed as an alternative to it in the homogenization and / or semiclassical limits of wave equations. We…
The main result is that: function descriptions are not made equal, and they can be categorised in at least two categories using various computational methods for function evaluation. The result affects Kolmogorov complexity and Random…
We consider Arnoldi like processes to obtain symplectic subspaces for Hamiltonian systems. Large systems are locally approximated by ones living in low dimensional subspaces; we especially consider Krylov subspaces and some extensions. This…
The classical coding theorem in Kolmogorov complexity states that if an $n$-bit string $x$ is sampled with probability $\delta$ by an algorithm with prefix-free domain then K$(x) \leq \log(1/\delta) + O(1)$. In a recent work, Lu and…
We consider positive operator valued measures whose image is the bounded operators acting on an infinite-dimensional Hilbert space, and we relax, when possible, the usual assumption of positivity of the operator valued measure seen in the…
Non-compact symmetries cannot be fully broken by randomness since non-compact groups have no invariant probability distributions. In particular, this makes trickier the "Copernican" random choice of the place of the observer in infinite…
Random sets are used to get a continuous partition of the cardinality of the union of many overlapping sets. The formalism uses M\"obius transforms and adapts Shapley's methodology in cooperative game theory, into the context of set theory.…
Our understanding of the mechanisms governing the structure and secular evolution galaxies assume nearly integrable Hamiltonians with regular orbits; our perturbation theories are founded on the averaging theorem for isolated resonances. On…
The notion of Schnorr randomness refers to computable reals or computable functions. We propose a version of Schnorr randomness for subcomputable classes and characterize it in different ways: by Martin L\"of tests, martingales or measure…
We obtain estimates for the Kolmogorov distance to appropriately chosen gaussians, of linear functions \[ \sum_{i\in [n]^d} \theta_i X_i \] of random tensors $\boldsymbol{X}=\langle X_i:i\in [n]^d\rangle$ which are symmetric and…
We study operator-splitting schemes for approximating Koopman generators of linear semigroups induced by nonlinear flows, a framework originating with Dorroh and Neuberger. Building on ideas of Lie, Kowalewski, and Gr\"{o}bner, we analyze…