Ordering by Divisibility in Abstract Algebras

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

On the genus defect of positive braid knots
On the stabilization problem for submodules of Specht modules
On the effective and automatic enumeration of polynomial permutation classes
Well-quasi-ordering digraphs with no long alternating paths by the strong immersion relation
On the expressivity of time-varying graphs
Integer packing sets form a well-quasi-ordering
Contexts on trajectories
Modal MTL-algebras
Finite combinatorial generation of metabelian \(T\)-ideal
Fermionic quantum cellular automata and generalized matrix-product unitaries
A solution to the problem of (\(A\),\(B\))-invariance for series
SMT-based verification of data-aware processes: a model-theoretic approach
Well-quasi-ordering versus clique-width
Ordinal notation systems corresponding to Friedman's linearized well-partial-orders with gap-condition
Ideals of identities of representations of nilpotent lie algebras
A linear time algorithm for monadic querying of indefinite data over linearly ordered domains
A counterexample regarding labelled well-quasi-ordering
Specht property for some varieties of Jordan algebras of almost polynomial growth
Forward analysis for WSTS, part I: completions
A characterization of well-founded algebraic lattices
Identities for the special linear Lie algebra with the Pauli and Cartan gradings
Nested Petri Nets for Adaptive Process Modeling
Well-quasi-order for permutation graphs omitting a path and a clique
A Combinatorial Approach to Complexity Theory via Ordinal Hierarchies
Timed Petri nets and timed automata: On the discriminating power of Zeno sequences
On Ordinal Invariants in Well Quasi Orders and Finite Antichain Orders
Generalizing Kruskal's theorem to pairs of cohabitating trees
Graded polynomial identities and Specht property of the Lie algebra \(sl_2\)
Rational and Recognisable Power Series
Equivariant Hilbert series in non-Noetherian polynomial rings
Internal characterizations of lattice-ordered power series fields
Branch-depth: generalizing tree-depth of graphs
Specht property for the 2-graded identities of the Jordan algebra of a bilinear form
Unboundedness problems for languages of vector addition systems
Program extraction from classical proofs
Some complexity results for stateful network verification
Parameterized verification of monotone information systems
Lazy controller synthesis for monotone transition systems and directed safety specifications
Composable computation in leaderless, discrete chemical reaction networks
The FEP for some varieties of fully distributive knotted residuated lattices
The length of an intersection
Expressivity of imperfect information logics without identity
Some relational structures with polynomial growth and their associated algebras. II: Finite generation.
Gap embedding for well-quasi-orderings
Descriptional complexity of regular languages
Fifo nets without order deadlock
\texttt{VIC}-modules over noncommutative rings
Borel colouring bad rays
Associative Enveloping Pseudoalgebras of Finite Lie Pseudoalgebras
Lattice closures of polyhedra
NRCL -- a model building approach to the Bernays-Schönfinkel fragment
State complexity investigations on commutative languages -- the upward and downward closure, commutative aperiodic and commutative group languages
Controlling a random population
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)\)
All normal extensions of S5-squared are finitely axiomatizable
A note on partially ordered tree automata
Graph minors and parameterized algorithm design
On upper and lower bounds on the length of alternating towers
Noetherianity and Specht problem for varieties of bicommutative algebras
What's so special about Kruskal's theorem and the ordinal \(\Gamma{}_ 0\)? A survey of some results in proof theory
On Shuffle Ideals
A general version of standard basis and its application to T-ideals.
Subword conditions and subword histories
Varieties
Recent progress on well-quasi-ordering graphs
Laver's results and low-dimensional topology
On codes defined by bio-operations
Well quasi-orders generated by a word-shuffle rewriting
Linearizing well quasi-orders and bounding the length of bad sequences
Nichtbeweisbarkeit von gewissen kombinatorischen Eigenschaften endlicher Bäume;Unprovability of certain combinatorial properties of finite trees
Ensuring completeness of symbolic verification methods for infinite-state systems
A general finite basis condition for systems of semigroup identities
Varieties of modular \(p\)-algebras not containing \(M_{3,3}\)
Images of rigid digraphs
Automating the Knuth Bendix ordering
On the existence of closed terms in the typed lambda calculus II: Transformations of unification problems
When is the orbit algebra of a group an integral domain ? Proof of a conjecture of P.J. Cameron
Model checking parameterized systems
Petri nets and regular processes
On the computational power of BlenX
A note on division orderings on strings
On the Specht property and the basic rank of some products of group varieties
Finite automata for the sub- and superword closure of CFLs: descriptional and computational complexity
Model checking of systems with many identical timed processes
Graphs without \(K_ 4\) and well-quasi-ordering
Partitionseigenschaft von endlichen Folgen
A regularity test for dual bordered OS systems
The length of chains in modular algebraic lattices
Combinatorial properties of regressive mappings
Commutative one-counter languages are regular
On better quasi-ordering countable trees
Well quasi-ordered sets and ideals in free semigroups and algebras
Combinatorial theorems on contractive mappings in power sets

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)