Ordering by Divisibility in Abstract Algebras

Cited In (only showing first 100 items - show all)

The Dyck pattern poset
Extended letterplace correspondence for nongraded noncommutative ideals and related algorithms.
Combinatorial generators of the multilinear polynomial identities.
On the finite embeddability property for residuated ordered groupoids
The theory of well-quasi-ordering: a frequently discovered concept
Geometric grid classes of permutations
Graph minors. VIII: A Kuratowski theorem for general surfaces
Noetherian rings of generalized power series
Two forbidden induced subgraphs and well-quasi-ordering
A well-quasi-order for tournaments
On the number of finite algebraic structures
Shuffle on trajectories: Syntactic constraints
On total regulators generated by derivation relations
Deciding safety properties in infinite-state pi-calculus via behavioural types
Better quasi-orders for uncountable cardinals
A basic parameterized complexity primer
Rao's degree sequence conjecture
Partial orders on words, minimal elements of regular languages, and state complexity
Quasi finitely axiomatizable totally categorical theories
Algorithmic graph minor theory: Improved grid minor bounds and Wagner's contraction
The maximal linear extension theorem in second order arithmetic
A well-ordering of dual braid monoids.
Unavoidable languages, cuts and innocent sets of words
Partial well‐ordering of sets of vectors
Proof pearl: a formal proof of Higman's lemma in ACL2
Well-quasi-ordering and the Hausdorff quasi-uniformity
Stochastic Games with Lossy Channels
Higher Lawrence configurations.
Forbidden substructures and combinatorial dichotomies: WQO and universality
Varieties of Commutative Semigroups
Simple permutations: Decidability and unavoidable substructures
On Von Neumann Regular Rings of Skew Generalized Power Series
The wellordering on positive braids
Gröbner methods for representations of combinatorial categories
Finite Gröbner bases in infinite dimensional polynomial rings and applications
Labelled well-quasi-order for permutation classes
Well-structured transition systems everywhere!
On Better-Quasi-Ordering Countable Series-Parallel Orders
Sur les premeilleurs ordres. (On prémeilleurs orderings)
Termination of rewriting
On regularity of context-free languages
Title not available (Why is that?)
Reduction and covering of infinite reachability trees
The computational power of population protocols
Noetherian Generalized Power Series Rings
Construction of fuzzy automata from fuzzy regular expressions
The size of Higman-Haines sets
Simple permutations and pattern restricted permutations
[[Publication:1064394|Varieties of Lie algebras with the identity \([[x_ 1,x_ 2,x_ 3],[x_ 4,x_ 5,x_ 6]]=0\) over a field of characteristic zero]]
Semisimple rings and von Neumann regular rings of generalized power series
Bounded-rank tensors are defined in bounded degree
Inventories of unavoidable languages and the word-extension conjecture
On central ketabelian variety of algebras
Verifying lossy channel systems has nonprimitive recursive complexity.
Well quasi orders in subclasses of bounded treewidth graphs and their algorithmic applications
A well-structured framework for analysing Petri net extensions
Infinite distributive laws versus local connectedness and compactness properties
Exchange property and the natural preorder between simple modules over semi-Artinian rings
Algorithmic analysis of programs with well quasi-ordered domains.
Minimal forbidden subwords
Regular tree languages in low levels of the Wadge hierarchy
On the laws of a metabelian variety
Kernel methods for learning languages
Ordered colourings
A decidability result for the dominating set problem
Well-quasi-orderings and sets of finite sequences
Completion and finite embeddability property for residuated ordered algebras.
A comparison of well-known ordinal notation systems for \(\varepsilon _{0}\)
Constantive Mal’cev clones on finite sets are finitely related
On the expressive power of recursion, replication and iteration in process calculi
Verification of probabilistic systems with faulty communication
Nice Enumerations of ω-categorical Groups
Two applications of analytic functors
Title not available (Why is that?)
Totally Categorical Structures
A new class of unique product monoids with applications to ring theory.
Metanilpotent varieties of groups
Finite generation of symmetric ideals
Computable linearizations of well-partial-orderings
Systems of linear equations over associative algebras and the occurrence problem for lie algebras
Finiteness of the standard basis of a \(T\)-ideal containing Lie nilpotency of index 4
Boundary properties of well-quasi-ordered sets of graphs
Stability in the homology of unipotent groups
Graph minors. IV: Tree-width and well-quasi-ordering
Relations on free monoids, their independent sets, and codes¹
On termination and invariance for faulty channel machines
Letterplace ideals and non-commutative Gröbner bases.
Ein in der reinen Zahlentheorie unbeweisbarer Satz über endliche Folgen von natürlichen Zahlen
On two classes of hereditarily finitely based semigroup identities
Mind change complexity of inferring unbounded unions of restricted pattern languages from positive data
On partial well-order for monotone grid classes of permutations
Grid classes and partial well order
Stream/block ciphers, difference equations and algebraic attacks
Some relational structures with polynomial growth and their associated algebras. I: Quasi-polynomiality of the profile
Well quasi-orders, unavoidable sets, and derivation systems
Cayley's and Holland's theorems for idempotent semirings and their applications to residuated lattices
Well-quasi-ordering \(H\)-contraction-free graphs
When excluding one matroid prevents infinite antichains
Wohlquasigeordnete Klassen endlicher Graphen
The complexity of finding SUBSEQ\((A)\)

This page was built for publication: Ordering by Divisibility in Abstract Algebras

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5812263)