Results 71 to 80 of about 866 (222)

Stochastic Dynamics From Maximum Entropy in Action Space

open access: yesFortschritte der Physik, Volume 74, Issue 5, May 2026.
ABSTRACT We develop an information‐theoretic formulation of stochastic dynamics in which the fundamental stochastic variable is the total action connecting spacetime points, rather than individual paths. By maximizing Shannon entropy over a joint distribution of actions and endpoints, subject to normalization and a constraint on the mean action, we ...
Fabricio Souza Luiz   +3 more
wiley   +1 more source

In‐and‐Out: Algorithmic Diffusion for Sampling Convex Bodies

open access: yesRandom Structures &Algorithms, Volume 68, Issue 3, May 2026.
ABSTRACT We present a new random walk for uniformly sampling high‐dimensional convex bodies. It achieves state‐of‐the‐art runtime complexity with stronger guarantees on the output than previously known, namely in Rényi divergence (which implies TV, 𝒲2, KL, χ2$$ {\chi}^2 $$).
Yunbum Kook   +2 more
wiley   +1 more source

Natural Partial Order on Generalized Semigroups of Transformation Semigroups That Preserve Order and an Equivalence Relation

open access: yesJournal of Mathematics
Let X be a finite total order set and E be a convex equivalence relation on X. We denote that OEX=f∈TEX:∀x,y∈X,x≤y⟹fx≤fy , where TEX is an E− preserving transformation semigroup.
Meiqing Qin, Xuerong Fu
doaj   +1 more source

On the S-Invariance Property for S-Flows

open access: yesAbstract and Applied Analysis, 2010
We define an equivalence relation on a topological space which is acted by topological monoid S as a transformation semigroup. Then, we give some results about the S-invariant classes for this relation.
Amin Saif, Adem Kılıçman
doaj   +1 more source

Transformation Semigroups and Their Applications

open access: yes
In this chapter we present transformation semigroups and their applications. We begin with Klein's approach to geometry based on invariants of transformation groups. Then we present symmetry groups in chemistry and in classical mechanics. Next we introduce one-parameter semigroups of transformations and their applications in ergodic theory.
Pichór, Katarzyna, Rudnicki, Ryszard
openaire   +2 more sources

Littlewood, Paley and almost‐orthogonality: a theory well ahead of its time

open access: yesJournal of the London Mathematical Society, Volume 113, Issue 5, May 2026.
Abstract The classic paper by Littlewood and Paley [J. Lond. Math. Soc. (1), 6 (1931), 230–233] marked the birth of Littlewood–Paley theory. We discuss this paper and its impact from a historical perspective, include an outline of the results in the paper and their subsequent significance in relation to developments over the last century, and set them ...
Anthony Carbery
wiley   +1 more source

INCLUSION RELATIONS CONCERNING WEAKLY ALMOST PERIODIC FUNCTIONS AND FUNCTIONS VANISHING AT INFINITY [PDF]

open access: yesJournal of Sciences, Islamic Republic of Iran, 1995
We consider the space of weakly almost periodic functions on a transformation semigroup (S, X , ?) and show that if X is a locally compact noncompact uniform space, and ?
doaj  

a-minimal sets and related topics in transformation semigroups (I)

open access: yesInternational Journal of Mathematics and Mathematical Sciences, 2001
We deal with a-minimal sets instead of minimal right ideals of the enveloping semigroup and obtain a partition of disjoint isomorphic subgroups of some of its subsets.
Masoud Sabbaghan   +1 more
doaj   +1 more source

Global weak solutions for the compressible Poisson–Nernst–Planck–Navier–Stokes system

open access: yesJournal of the London Mathematical Society, Volume 113, Issue 5, May 2026.
Abstract We consider the compressible Poisson–Nernst–Planck–Navier–Stokes (PNPNS) system of equations, governing the transport of charged particles under the influence of the self‐consistent electrostatic potential, in a three‐dimensional bounded domain.
Daniel Marroquin, Dehua Wang
wiley   +1 more source

Computing in permutation groups without memory [PDF]

open access: yes, 2013
Funding: UK Engineering and Physical Sciences Research Council (EP/K033956/1)Memoryless computation is a new technique to compute any function of a set of registers by updating one register at a time while using no memory.
Maximilien Gadouleau   +10 more
core   +1 more source

Home - About - Disclaimer - Privacy