Ordering by Divisibility in Abstract Algebras

Cited in

(only showing first 100 items - show all)

The Dyck pattern poset
Minimal antichains in well-founded quasi-orders with an application to tournaments
Controlling a random population
Stream/block ciphers, difference equations and algebraic attacks
Combinatorial generators of the multilinear polynomial identities.
On the genus defect of positive braid knots
On the stabilization problem for submodules of Specht modules
Higman's lemma and its computational content
Some relational structures with polynomial growth and their associated algebras. I: Quasi-polynomiality of the profile
Levels of knowledge in distributed systems.
Partially ordered sets and nonmatrix identities of associative algebras
Multiset rewriting for the verification of depth-bounded processes with name binding
The theory of well-quasi-ordering: a frequently discovered concept
Totally unordered subsets of a partially well ordered set
Well-quasi-ordering digraphs with no long alternating paths by the strong immersion relation
Decidability of a temporal logic problem for Petri nets
On the recursive decomposition ordering with lexicographical status and other related orderings
Geometric grid classes of permutations
Topology on semi-well ordered sets
Extended letterplace correspondence for nongraded noncommutative ideals and related algorithms.
Graph minors. VIII: A Kuratowski theorem for general surfaces
scientific article; zbMATH DE number 7551770 (Why is no real title available?)
Well quasi-orders, unavoidable sets, and derivation systems
On the finite embeddability property for residuated ordered groupoids
Theories of orders on the set of words
On the effective and automatic enumeration of polynomial permutation classes
Block-graph width
Collaborating with Hans: Some Remaining Wonderments
On the expressivity of time-varying graphs
An application of the matrix representation of transductions
Simple termination of rewrite systems
Noetherian rings of generalized power series
Simple permutations and algebraic generating functions
Integer packing sets form a well-quasi-ordering
The free product of algebras with standard bases for ideals.
Modal MTL-algebras
Finite combinatorial generation of metabelian \(T\)-ideal
Cayley's and Holland's theorems for idempotent semirings and their applications to residuated lattices
Long finite sequences
Rings of generalized power series: Nilpotent elements
Lambda-Definable Order-3 Tree Functions are Well-Quasi-Ordered
Contexts on trajectories
A well-quasi-order for tournaments
Testing Simon's congruence
Two forbidden induced subgraphs and well-quasi-ordering
Hereditary classes of ordered sets of width at most two
Nondeterministic ordered restarting automata
scientific article; zbMATH DE number 7561313 (Why is no real title available?)
Well-quasi-ordering \(H\)-contraction-free graphs
A characterisation of multiply recursive functions with Higman's lemma.
On the number of finite algebraic structures
Dynamic networks of timed Petri nets
Rationality of division orderings
A Mechanized Proof of Higman’s Lemma by Open Induction
When excluding one matroid prevents infinite antichains
Shuffle on trajectories: Syntactic constraints
Dickson's lemma, Higman's theorem and beyond: a survey of some basic results in order theory
FI- and OI-modules with varying coefficients
The Parametric Complexity of Lossy Counter Machines
The complexity of finding SUBSEQ(A)
Wohlquasigeordnete Klassen endlicher Graphen
Polynomials satisfied by matrices
A Lie algebra over a finite field of characteristic 2: graded polynomial identities and Specht property
Well-quasi-ordering Friedman ideals of finite trees proof of Robertson's magic-tree conjecture
Fixed points and Noetherian topologies
A solution to the problem of (\(A\),\(B\))-invariance for series
Fields of generalized power series
Petri nets with structured data
Clique-width and well-quasi-ordering of triangle-free graph classes
E-unification based on generalized embedding
Fermionic quantum cellular automata and generalized matrix-product unitaries
On well-quasi-ordering-finite graphs by immersion
All normal extensions of S5-squared are finitely axiomatizable
On the Qualitative Analysis of Conformon P Systems
On total regulators generated by derivation relations
Atomicity and Well Quasi-Order for Consecutive Orderings on Words and Permutations
Minimal elements for the prime numbers
Inflations of geometric grid classes of permutations
Deciding safety properties in infinite-state pi-calculus via behavioural types
A note on partially ordered tree automata
Better quasi-orders for uncountable cardinals
Deciding atomicity of subword-closed languages
Certified Kruskal's tree theorem
Hereditary classes of ordered binary structures
A constructive picture of Noetherian conditions and well quasi-orders
Axioms for a theory of signature bases
Derivation tree analysis for accelerated fixed-point computation
A basic parameterized complexity primer
scientific article; zbMATH DE number 7204383 (Why is no real title available?)
On power varieties of semigroups
Equivariant lattice bases
Well-quasi-ordering versus clique-width
Graph minors and parameterized algorithm design
Rao's degree sequence conjecture
Tournament minors
Ordinal notation systems corresponding to Friedman's linearized well-partial-orders with gap-condition
Partial orders on words, minimal elements of regular languages, and state complexity
Rational selecting relations and selectors
On upper and lower bounds on the length of alternating towers
Minimal bad sequences are necessary for a uniform Kruskal theorem

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)