Results 101 to 110 of about 760 (210)
Open MathematicsFor n≥4n\ge 4, let OPDn{{\mathcal{OPD}}}_{n} be the orientation-preserving and order-decreasing transformation semigroup on the finite chain Xn ...
Toker Kemal
doaj +1 more source
Two-Sided Zero-Divisor Graphs of Order-Preserving and A-Decreasing Finite Transformation Semigroups
AxiomsLet On(A) be the order-preserving and A-decreasing finite transformation semigroup on Xn = {1, 2, …, n}. It is known that On(A) has zero element if and only if 1 ∈ A. In this paper, we investigate zero-divisor graphs of On(A) where 1 ∈ A and n ≥ 4. First,
Kemal Toker, Muhammet Uysal
doaj +1 more source
Generating uncountable transformation semigroups [PDF]
, 2010 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
core
On new symbolic key exchange protocols and cryptosystems based on a hidden tame homomorphism
Доповiдi Нацiональної академiї наук УкраїниMultivariate cryptosystems are divided into public rules, for which tools of encryption are open for users and systems of the El Gamal type, for which the encryption function is not given in public, and, for its generation, the opponent has to solve a ...
V.A. Ustimenko
doaj +1 more source
Semigroup models for biochemical reaction networks. [PDF]
J Math Biol, 2023 Loutchko D.
europepmc +1 more source
Generating uncountable transformation semigroups [PDF]
, 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 +2 more
core
An algebraic characterization of self-generating chemical reaction networks using semigroup models. [PDF]
J Math Biol, 2023 Loutchko D.
europepmc +1 more source
Graphs and finite transformation semigroups
Discrete Mathematics, 1973 Given a finite set X and a semigroup S of transformations of X, we study the orbitoids of S on X and on X^2 and, assuming S transitive, those of the statbilizer in S of an element @a @? X. The action of S as a semigroup of endomorphisms of some relevant graphs (having X as vertex set) is also considered.
openaire +1 more source
Ergodic decompositions of Dirichlet forms under order isomorphisms. [PDF]
J Evol Equ, 2023 Schiavo LD, Wirth M.
europepmc +1 more source
Computing Transformation Semigroups [PDF]
, 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 +3 more
core