Results 81 to 90 of about 760 (210)

Oppenheim–Schur inequalities for causal products

open access: yesBulletin of the London Mathematical Society, Volume 58, Issue 6, June 2026.
Abstract We establish a class of Oppenheim–Schur‐type inequalities for the convolutional Jury product of positive semidefinite matrices. These results extend the classical Schur and Oppenheim inequalities associated with the Hadamard product to a causal convolutional setting.
Dominique Guillot   +2 more
wiley   +1 more source

Isotopy and equivalence of knots in 3‐manifolds

open access: yesJournal of the London Mathematical Society, Volume 113, Issue 6, June 2026.
Abstract Two knots K$K$ and J$J$ in S3$S^3$ are isotopic if and only if they are related by an orientation‐preserving diffeomorphism of S3$S^3$. This claim follows from the fact that any orientation‐preserving self‐diffeomorphism of S3$S^3$ is isotopic to the identity. We show that this same idea applies to any prime oriented closed 3‐manifold.
Paolo Aceto   +4 more
wiley   +1 more source

A priori bounds for the generalised parabolic Anderson model

open access: yesCommunications on Pure and Applied Mathematics, Volume 79, Issue 5, Page 1315-1394, May 2026.
Abstract We show a priori bounds for solutions to (∂t−Δ)u=σ(u)ξ$(\partial _t - \Delta) u = \sigma (u) \xi$ in finite volume in the framework of Hairer's Regularity Structures [Invent Math 198:269–504, 2014]. We assume σ∈Cb2(R)$\sigma \in C_b^2 (\mathbb {R})$ and that ξ$\xi$ is of negative Hölder regularity of order −1−κ$- 1 - \kappa$ where κ<κ¯$\kappa <
Ajay Chandra   +2 more
wiley   +1 more source

Some faces of Smarandache semigroups ’ concept in transformation semigroups ’ approach [PDF]

open access: yes, 2014
In the following text, the main aim is to distinguish some relations between Smaradche semigroups and (topological) transformation semigroups areas.
A. Hosseini, F. Ayatollah, Zadeh Shirazi
core  

Generating sets of infinite full transformation semigroups with restricted range [PDF]

open access: yes, 2016
In the present paper, we consider minimal generating sets of infinite full transformation semigroups with restricted range modulo specific subsets.
K. Tinpun   +5 more
core   +1 more source

On the annihilator graphs of partial transformation semigroups

open access: yesArab Journal of Basic and Applied Sciences
Let [Formula: see text] and [Formula: see text] be a partial transformation semigroup on [Formula: see text] Obviously, the empty set [Formula: see text] is a zero element of [Formula: see text] and denoted by 0.
Chollawat Pookpienlert   +2 more
doaj   +1 more source

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

Regularity and Green's Relations on a Semigroup of Transformations with Restricted Range

open access: yesInternational Journal of Mathematics and Mathematical Sciences, 2008
Let T(X) be the full transformation semigroup on the set X and let T(X,Y)={α∈T(X):Xα⊆Y}. Then T(X,Y) is a sub-semigroup of T(X) determined by a nonempty subset Y of X.
Jintana Sanwong, Worachead Sommanee
doaj   +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

Computing automorphisms of semigroups [PDF]

open access: yes, 2010
In this paper an algorithm is presented that can be used to calculate the automorphism group of a finite transformation semigroup. The general algorithm employs a special method to compute the automorphism group of a finite simple semigroup.
Bünau, P.V.   +3 more
core   +3 more sources

Home - About - Disclaimer - Privacy