Results 11 to 20 of about 89,551,811 (144)

Beyond Regular Semigroups [PDF]

, 2012
The topic of this thesis is the class of weakly U-abundant semigroups. This class is very wide, containing inverse, orthodox, regular, ample, adequate, quasi-adequate, concordant, abundant, restriction, Ehresmann and weakly abundant semigroups.
Wang, Yanhui
core   +6 more sources

Unary FA-Presentable Semigroups [PDF]

International journal of algebra and computation, 2012
Automatic presentations, also called FA-presentations, were introduced to extend nite model theory to innite structures whilst retaining the solubility of interesting decision problems.
Alan J. Cain, N. Ruškuc, R. Thomas
semanticscholar   +2 more sources

Convolution semigroups of states. [PDF]

, 2011
Convolution semigroups of states on a quantum group form the natural noncommutative analogue of convolution semigroups of probability measures on a locally compact group.
Lindsay, Martin, Skalski, Adam G.
core   +4 more sources

Automatic presentations for semigroups [PDF]

, 2009
Special Issue: 2nd International Conference on Language and Automata Theory and Applications (LATA 2008)This paper applies the concept of FA-presentable structures to semigroups.
Oliver, Graham, Cain, Alan James, Thomas, Richard M., Cain, Alan J., Ruskuc, Nik   +4 more
core   +2 more sources

A Kallman-Rota Inequality for Evolution Semigroups [PDF]

, 2002
A Kallman-Rota type inequality for evolution semigroups and applications for real valued functions are ...
Dragomir, Sever S, Buşe, Constantin
core   +6 more sources

Presentations of inverse semigroups, their kernels and extensions [PDF]

, 2011
"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, Gray, Robert, Carvalho, Catarina, CATARINA CARVALHO, Gray, R, Gray, Robert D., NIK RUSKUC, ROBERT D. GRAY, Carvalho, C.A.   +8 more
core   +1 more source

Classification and enumeration of finite semigroups [PDF]

, 2010
The classification of finite semigroups is difficult even for small orders because of their large number. Most finite semigroups are nilpotent of nilpotency rank 3.
Distler, Andreas
core   +2 more sources

Monochromatic Sums and Products of Polynomials

Discrete Analysis
Monochromatic sums and products of polynomials, Discrete Analysis 2024:5, 7 pp. An early result in Ramsey theory, Schur's theorem, states that if the positive integers are finitely coloured, then there will always be $x$ and $y$ such that $x,y$ and $x ...
Ryan Alweiss
doaj   +1 more source

Catalan Bounds for Symmetric Strength‐Two Orthogonal Arrays

Journal of Combinatorial Designs, EarlyView.
ABSTRACT A Hamming shell construction is a two‐level array obtained by taking every binary vector of a given Hamming weight a prescribed number of times, for each weight in turn. Such arrays are invariant under all permutations of the factors, and they are strength‐two orthogonal arrays exactly when the multiplicities satisfy three linear constraints ...
Ruwan C. Karunanayaka
wiley   +1 more source

Fragmentation–Coagulation Processes With Advection or Diffusion in Space

Mathematical Methods in the Applied Sciences, EarlyView.
ABSTRACT In this paper, we consider a continuous fragmentation–coagulation model in which the reacting particles can be transported in physical space through either advection or diffusion. We prove new results on the generation of C0$$ {C}_0 $$‐semigroups with parameter and use them to show that the abstract Cauchy problem associated with a more ...
Jacek Banasiak, Nduduzo Majozi
wiley   +1 more source