Results 51 to 60 of about 24,434 (204)
From Stability to Chaos: A Complete Classification of the Damped Klein‐Gordon Dynamics
Mathematical Methods in the Applied Sciences, Volume 49, Issue 9, Page 9696-9708, June 2026.ABSTRACT We investigate the transition between stability and chaos in the damped Klein‐Gordon equation, a fundamental model for wave propagation and energy dissipation. Using semigroup methods and spectral criteria, we derive explicit thresholds that determine when the system exhibits asymptotic stability and when it displays strong chaotic dynamics ...
Carlos Lizama +2 more
wiley +1 more source
Some ordered hypersemigroups which enter their properties into their σ-classes [PDF]
Journal of Hyperstructures, 2017 An important problem in the theory of ordered hypersemigroups is to describe the ordered hypersemigroups which enter their properties into their σ-classes.
Niovi Kehayopulu
doaj +1 more source
Connes-amenability of bidual and weighted semigroup algebras
, 2005 We investigate the notion of Connes-amenability for dual Banach algebras, as introduced by Runde, for bidual algebras and weighted semigroup algebras. We provide some simplifications to the notion of a $\sigma WC$-virtual diagonal, as introduced by Runde,
Daws, Matthew
core +1 more source
A priori bounds for the generalised parabolic Anderson model
Communications 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
On fuzzy soft bi-ideals over semigroups [PDF]
Songklanakarin Journal of Science and Technology (SJST), 2015 The aim of this paper is to study fuzzy soft bi-ideals over semigroups and give some properties of prime, strongly prime and semiprime fuzzy soft bi-ideals over semigroups.
Manoj Siripitukdet, Peerapong Suebsan
doaj
In‐and‐Out: Algorithmic Diffusion for Sampling Convex Bodies
Random 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
Maximal Syntactic Complexity of Regular Languages Implies Maximal Quotient Complexities of Atoms [PDF]
, 2013 We relate two measures of complexity of regular languages. The first is syntactic complexity, that is, the cardinality of the syntactic semigroup of the language.
Brzozowski, Janusz, Davies, Gareth
core
Stability of Blaschke products under forward iteration
Bulletin of the London Mathematical Society, Volume 58, Issue 5, May 2026.Abstract Forward iteration of holomorphic self‐maps generalizes the iteration of a single function in a natural way. This framework arises in complex dynamics, for instance, in the study of wandering domains and in seeking suitable extensions of the Denjoy–Wolff theorem. Here, we consider forward iteration of Blaschke products.
Daniela Kraus +2 more
wiley +1 more source
End-regular and End-orthodox generalized lexicographic products of bipartite graphs
Open Mathematics, 2016 A graph X is said to be End-regular (End-orthodox) if its endomorphism monoid End(X) is a regular (orthodox) semigroup. In this paper, we determine the End-regular and the End-orthodox generalized lexicographic products of bipartite graphs.
Gu Rui, Hou Hailong
doaj +1 more source
Some results on semigroups of transformations with restricted range
Open Mathematics, 2021 Let XX be a non-empty set and YY a non-empty subset of XX. Denote the full transformation semigroup on XX by T(X)T\left(X) and write f(X)={f(x)∣x∈X}f\left(X)=\{f\left(x)| x\in X\} for each f∈T(X)f\in T\left(X). It is well known that T(X,Y)={f∈T(X)∣f(X)⊆Y}
Yan Qingfu, Wang Shoufeng
doaj +1 more source