Results 11 to 20 of about 12,693 (255)
Locally finite M-solid varieties of semigroups
Discussiones Mathematicae - General Algebra and Applications, 2003 For a semigroup term \(f(x,y)\) in the variables \(x\) and \(y\), let \(\sigma_f\) stand for the corresponding hypersubstitution. The authors prove that the largest \(M\)-solid semigroup variety \(V_M\) (where \(M\) is a monoid of hypersubstitutions) is locally finite if and only if \(M\) contains one of the hypersubstitutions \(\sigma_{xyx}\) or ...
Denecke, Klaus-Dieter +1 more
openaire +3 more sources
Locally finite monoids in finitely based varieties
Logic Journal of the IGPL, 2019 AbstractIt is shown that given any finite system of monoid identities, it is decidable if the class of locally finite monoids that satisfy the system is a variety. This answers an open problem of Mark V. Sapir.
Edmond W H Lee, Lee, Edmond W. H.
openaire +3 more sources
Locally finite varieties of groups arising from Cross varieties [PDF]
Bulletin of the Australian Mathematical Society, 1971 Let be a Cross variety and let n be the least integer such that (n) is locally finite; then n ≤ 2d + 3 where d is an upper bound for the number of generators of certain critical groups in .
Macdonald, Sheila Oates
openaire +5 more sources
On locally finite varieties of Heyting algebras
, 2023 For every $n \in \mathbb{N}$, we construct a variety of Heyting algebras, whose $n$-generated free algebra is finite but whose $(n+1)$-generated free algebra is infinite.
Martins, M., Moraschini, T.
openaire +3 more sources
Local finiteness for Green’s relations in semigroup varieties [PDF]
Communications in Algebra, 2018 A semigroup variety V is said to be locally K-finite, where K stands for any of Green's relations H, R, L, D, or J, if every finitely generated semigroup from V has only finitely many K-classes. We characterize locally K-finite varieties of finite axiomatic rank in the language of "forbidden objects".
Mikhail V. Volkov +2 more
openaire +5 more sources
Locally recoverable J-affine variety codes [PDF]
, 2020 A locally recoverable (LRC) code is a code over a finite eld Fq such that any erased coordinate of a codeword can be recovered from a small number of other coordinates in that codeword.
Galindo, Carlos +2 more
core +1 more source
The Structure of Finite Commutative Idempotent Involutive Residuated Lattices
, 2021 We characterize commutative idempotent involutive residuated lattices as disjoint unions of Boolean algebras arranged over a distributive lattice. We use this description to introduce a new construction, called gluing, that allows us to build new members
Valota, Diego, Jipsen, Peter, Tuyt, Olim
core +2 more sources
Econometrics, 2015 We propose a random effects panel data model with both spatially correlated error components and spatially lagged dependent variables. We focus on diagnostic testing procedures and derive Lagrange multiplier (LM) test statistics for a variety of ...
Ming He, Kuan-Pin Lin
doaj +1 more source
From Lattice Boltzmann Method to Lattice Boltzmann Flux Solver
Entropy, 2015 Based on the lattice Boltzmann method (LBM), the lattice Boltzmann flux solver (LBFS), which combines the advantages of conventional Navier–Stokes solvers and lattice Boltzmann solvers, was proposed recently.
Yan Wang, Liming Yang, Chang Shu
doaj +1 more source
A note on locally finite varieties [PDF]
Bulletin of the Australian Mathematical Society, 1976 Evidence is presented which suggests that the following assertions about a variety ⊻ of groups may be equivalent:(a) ⊻ is locally finite,(b) all ⊻-groups satisfying the maximal condition for normal subgroups are finite, and(c) all ⊻-groups satisfying the minimal condition for normal subgroups are finite.
openaire +2 more sources