Results 121 to 130 of about 760 (210)

Generating uncountable transformation semigroups

, 2009
We consider naturally occurring, uncountable transformation semigroups S and investigate the following three questions. (i) Is every countable subset F of S also a subset of a finitely generated subsemigroup of S?
Péresse, Yann, Quick, Martyn, Mitchell, James D   +2 more
core  

Non-Lorentzian supergravity and kinematical superalgebras

Journal of High Energy Physics
In this paper, we present and classify the supersymmetric extensions of extended kinematical algebras, at the basis of non-Lorentzian physics theories.
Patrick Concha, Lucrezia Ravera
doaj   +1 more source

A Consideration on the Synchronization of Sequential Machines and the Transformation Semigroups. [PDF]

, 1971
Following the previous report, this paper discusses the synchronization of sequential machines on the transformation semigroups which correspond to machines.
清木, 泰弌
core  

The ordinarization transform of a numerical semigroup and semigroups with a large number of intervals

Journal of Pure and Applied Algebra, 2012
A numerical semigroup is said to be ordinary if it has all its gaps in a row. Indeed, it contains zero and all integers from a given positive one. One can define a simple operation on a non-ordinary semigroup, which we call here the ordinarization transform, by removing its smallest non-zero non-gap (the multiplicity) and adding its largest gap (the ...
openaire   +2 more sources

Domination parameters on Cayley digraphs of full transformation semigroups relative to Green’s equivalence L $\mathcal{L}$ -classes and their complements

Open Mathematics
Let T(X) be a full transformation semigroup on a nonempty set X. The Cayley digraph Γ of a semigroup T(X) with respect to the Green’s L $\mathcal{L}$ -class is a digraph with vertex set T(X) and two vertices α, β ∈ T(X) are adjacent as an arc (α, β ...
Chaiya Yanisa, Pookpienlert Chollawat, Nupo Nuttawoot   +2 more
doaj   +1 more source

Computing Transformation Semigroups

, 2007
This paper describes algorithms for computing the structure of finite transformation semigroups. The algorithms depend crucially on a new data structure for an R-class in terms of a group and an action.
E. F. Robertson, N. Ruskuc, S. A. Linton, G. Pfeiffer   +3 more
core  

On Some Transformation Semigroups [PDF]

Indiana University Mathematics Journal, 1956
openaire   +2 more sources

Quantum Non-Markovian Environment-to-System Backflows of Information: Nonoperational vs. Operational Approaches. [PDF]

Entropy (Basel), 2022
Budini AA.
europepmc   +1 more source

A Semi-Self-Supervised Intrusion Detection System for Multilevel Industrial Cyber Protection. [PDF]

Comput Intell Neurosci, 2022
Ye F, Zhao W.
europepmc   +1 more source

Curvature-dimension conditions under time change. [PDF]

Ann Mat Pura Appl, 2022
Han BX, Sturm KT.
europepmc   +1 more source