Results 11 to 20 of about 333 (139)
Unary FA-presentable semigroups [PDF]
Automatic presentations, also called FA-presentations, were introduced to extend nite model theory to innite structures whilst retaining the solubility of interesting decision problems.
Cain, Alan James +2 more
core +1 more source
Presentations of inverse semigroups, their kernels and extensions [PDF]
"Part of this work was done while Gray was an EPSRC Postdoctoral Research Fellow at the University of St Andrews, Scotland"Let S be an inverse semigroup and let π:S→T be a surjective homomorphism with kernel K.
Ruskuc, Nik +8 more
core +1 more source
Nonlinear Markov semigroups and interacting Lévy type processes [PDF]
Semigroups of positivity preserving linear operators on measures of a measurable space X describe the evolutions of probability distributions of Markov processes on X.
Kolokoltsov, V. N. (Vasiliĭ Nikitich)
core +1 more source
On maximal subgroups of free idempotent generated semigroups [PDF]
We prove the following results: (1) Every group is a maximal subgroup of some free idempotent generated semigroup. (2) Every finitely presented group is a maximal subgroup of some free idempotent generated semigroup arising from a finite semigroup.
Ruskuc, N. +5 more
core +1 more source
RESEARCH ON NUMBER THEORY AND SMARANDACHE NOTIONS [PDF]
This Book is devoted to the proceedings of the Sixth International Conference on Number Theory and Smarandache Notions held in Tianshui during April 24-25, 2010.
Wenpeng, Zhang
core +1 more source
Growth of generating sets for direct powers of classical algebraic structures [PDF]
For an algebraic structure A denote by d(A) the smallest size of a generating set for A, and let d(A)=(d(A),d(A2),d(A3),…), where An denotes a direct power of A.
Ruskuc, Nik, Quick, Martyn
core +1 more source
Evolution of the Dependence of Residual Lifetimes [PDF]
We investigate the dependence properties of a vector of residual lifetimes by means of the copula associated with the conditional distribution function.
Durante F +5 more
core +1 more source
Semilatice decompositions of semigroups. Hereditariness and periodicity—An overview [PDF]
A semigroup is an algebraic structure consisting of a set with an associative binary operation defined on it. We can say that most of the work within theory is done on semigroups with a finiteness condition, i.e.
Silvestrov, Sergei, +1 more
core +1 more source
Fast Fourier transforms for finite inverse semigroups [PDF]
We extend the theory of fast Fourier transforms on finite groups to finite inverse semigroups. We use a general method for constructing the irreducible representations of a finite inverse semigroup to reduce the problem of computing its Fourier transform
Martin E. Malandro, Malandro, Martin E.
core +1 more source
Computing in matrix groups without memory [PDF]
Funding: UK Engineering and Physical Sciences Research Council award EP/K033956/1Memoryless computation is a novel means of computing 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

