Markus Steindl
YOU?
Author Swipe
View article: Not all nilpotent monoids are finitely related
Not all nilpotent monoids are finitely related Open
A finite semigroup is finitely related (has finite degree) if its term functions are determined by a finite set of finitary relations. For example, it is known that all nilpotent semigroups are finitely related. A nilpotent monoid is a nil…
View article: Not all nilpotent monoids are finitely related
Not all nilpotent monoids are finitely related Open
A finite semigroup is finitely related (has finite degree) if its term functions are determined by a finite set of finitary relations. For example, it is known that all nilpotent semigroups are finitely related. A nilpotent monoid is a nil…
View article: ON SEMIGROUPS WITH PSPACE-COMPLETE SUBPOWER MEMBERSHIP PROBLEM
ON SEMIGROUPS WITH PSPACE-COMPLETE SUBPOWER MEMBERSHIP PROBLEM Open
Fix a finite semigroup $S$ and let $a_{1},\ldots ,a_{k},b$ be tuples in a direct power $S^{n}$ . The subpower membership problem ( SMP ) for $S$ asks whether $b$ can be generated by $a_{1},\ldots ,a_{k}$ . For combinatorial Rees matrix sem…
View article: Constrained Best Linear Unbiased Estimation
Constrained Best Linear Unbiased Estimation Open
The least squares (LS) estimator and the best linear unbiased estimator (BLUE) are two well-studied approaches for the estimation of a deterministic but unknown parameter vector. In many applications it is known that the parameter vector f…
View article: The subpower membership problem for bands
The subpower membership problem for bands Open
View article: The subpower membership problem for semigroups
The subpower membership problem for semigroups Open
Fix a finite semigroup [Formula: see text] and let [Formula: see text] be tuples in a direct power [Formula: see text]. The subpower membership problem (SMP) asks whether [Formula: see text] can be generated by [Formula: see text]. If [For…