Related papers: Noise as a Boolean algebra of $\sigma$-fields
We prove that assuming suitable cardinal arithmetic, if B is a Boolean algebra every homomorphic image of which is isomorphic to a factor, then B has locally small density. We also prove that for an (infinite) Boolean algebra B, the number…
In an earlier work, the author observed that Boolean inverse semi-groups, with semigroup homomorphisms preserving finite orthogonal joins, form a congruence-permutable variety of algebras, called biases. We give a full description of…
The problem of continuous data assimilation for semilinear parabolic equations based on partial observations corrupted by noise is investigated. The noise is allowed to be multiplicative, with additive noise arising as a special case. In a…
We extend our study of phase transitions in the generalization behaviour of multilayer perceptrons with non-overlapping receptive fields to the problem of the influence of noise, concerning e.g. the input units and/or the couplings between…
We determine the algebra of holonomy symmetries of sigma models propagating on supersymmetric heterotic backgrounds with a non-compact holonomy group. We demonstrate that these close as a W-algebra, which in turn is specified by a Lie…
String algebras, in the usual sense, are finite-dimensional algebras over a given ground field. We recall a generalisation of the definition of a string algebra, which was introduced in a previous paper of the author. This generalisation…
We study when a map between two subsets of a Boolean domain W can be extended to an automorphism of W. Under many hypotheses, if the underlying Boolean algebra is complete or if the sets are finite or Boolean domains, the necessary and…
Noise, traditionally considered a nuisance in computational systems, is reconsidered for its unexpected and counter-intuitive benefits across a wide spectrum of domains, including nonlinear information processing, signal processing, image…
We consider a variant of the classical notion of noise on the Boolean hypercube which gives rise to a new approach to inequalities regarding noise stability. We use this approach to give a new proof of the Majority is Stablest theorem by…
Text data is often seen as "take-away" materials with little noise and easy to process information. Main questions are how to get data and transform them into a good document format. But data can be sensitive to noise oftenly called…
It was recently shown [2] that the resolvent algebra of a non-relativistic Bose field determines a gauge invariant (particle number preserving) kinematical algebra of observables which is stable under the automorphic action of a large…
Learning a parametric model of a data distribution is a well-known statistical problem that has seen renewed interest as it is brought to scale in deep learning. Framing the problem as a self-supervised task, where data samples are…
How many endomorphisms does a Boolean algebra have? Can we find Boolean algebras with as few endomorphisms as possible? Of course from any ultrafilter of the Boolean algebra we can define an endomorphism, and we can combine finitely many…
We introduce the notion of Gamma-Lie bialgebra, where Gamma is a group. These objects give rise to cocommutative co-Poisson algebras, for which we construct quantization functors. This enlarges the class of co-Poisson algebras for which a…
Noise shaping refers to an analog-to-digital conversion methodology in which quantization error is arranged to lie mostly outside the signal spectrum by means of oversampling and feedback. Recently it has been successfully applied to more…
A bialgebra is a structure which is simultaneously an algebra and a coalgebra, such that the algebraic and coalgebraic parts are "compatible". Bialgebras are normally studied over a field or commutative ring. In this paper, we show how to…
The dynamical properties of a quantum system can be profoundly influenced by its environment. Usually, the environment provokes decoherence and its action on the system can often be schematized by adding a noise term in the Hamiltonian.…
String backgrounds are described as purely geometric objects related to moduli spaces of Riemann surfaces, in the spirit of Segal's definition of a conformal field theory. Relations with conformal field theory, topological field theory and…
Typical properties of computing circuits composed of noisy logical gates are studied using the statistical physics methodology. A growth model that gives rise to typical random Boolean functions is mapped onto a layered Ising spin system,…
A graded-division algebra is an algebra graded by a group such that all nonzero homogeneous elements are invertible. This includes division algebras equipped with an arbitrary group grading (including the trivial grading). We show that a…