Ordering by Divisibility in Abstract Algebras

DOI10.1112/plms/s3-2.1.326zbMath0047.03402OpenAlexW2076508310WikidataQ29012533 ScholiaQ29012533MaRDI QIDQ5812263

Graham Higman

Publication date: 1952

Published in: Proceedings of the London Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1112/plms/s3-2.1.326

zbMATH Keywords

rings, modules, fields

Related Items

Noetherian Generalized Power Series Rings ⋮ Equivariant Hilbert series in non-Noetherian polynomial rings ⋮ On square-increasing ordered monoids and idempotent semirings ⋮ A comparison of well-known ordinal notation systems for \(\varepsilon _{0}\) ⋮ Unsplittable classes of separable permutations ⋮ Model Checking Parameterized Systems ⋮ Nondeterministic Ordered Restarting Automata ⋮ On the well-foundedness of adequate orders used for construction of complete unfolding prefixes ⋮ A Basic Parameterized Complexity Primer ⋮ Graph Minors and Parameterized Algorithm Design ⋮ Cayley graphs having nice enumerations ⋮ Graph minors. IV: Tree-width and well-quasi-ordering ⋮ Graph minors. VIII: A Kuratowski theorem for general surfaces ⋮ Computable linearizations of well-partial-orderings ⋮ A general version of standard basis and its application to T-ideals. ⋮ Infinite distributive laws versus local connectedness and compactness properties ⋮ On Upper and Lower Bounds on the Length of Alternating Towers ⋮ Eine verallgemeinerte Wohlordnung und die Endlichkeitsbedingungen der Ordnungstheorie ⋮ Ordinal notation systems corresponding to Friedman's linearized well-partial-orders with gap-condition ⋮ Integer packing sets form a well-quasi-ordering ⋮ Certified Kruskal’s Tree Theorem ⋮ Symblicit algorithms for mean-payoff and shortest path in monotonic Markov decision processes ⋮ Equimorphy: the case of chains ⋮ Petri Nets with Structured Data ⋮ Partially well-ordered sets of infinite matrices and closed classes of abelian groups ⋮ Geodesic geometry on graphs ⋮ Well-quasi-ordering \(H\)-contraction-free graphs ⋮ Rationality for subclasses of 321-avoiding permutations ⋮ Polynomial identities in Novikov algebras ⋮ Simple permutations and algebraic generating functions ⋮ Alternating complexity of counting first-order logic for the subword order ⋮ Locally countable pseudovarieties ⋮ NRCL - A Model Building Approach to the Bernays-Schönfinkel Fragment ⋮ When is the orbit algebra of a group an integral domain ? Proof of a conjecture of P.J. Cameron ⋮ On Von Neumann Regular Rings of Skew Generalized Power Series ⋮ Graded polynomial identities and Specht property of the Lie algebra \(sl_2\) ⋮ Bounded-rank tensors are defined in bounded degree ⋮ Well Quasi-orders in Formal Language Theory ⋮ Derivation Tree Analysis for Accelerated Fixed-Point Computation ⋮ Modal MTL-algebras ⋮ Specht property for the 2-graded identities of the Jordan algebra of a bilinear form ⋮ Cayley's and Holland's theorems for idempotent semirings and their applications to residuated lattices ⋮ Well, Better and In-Between ⋮ On Ordinal Invariants in Well Quasi Orders and Finite Antichain Orders ⋮ The Ideal Approach to Computing Closed Subsets in Well-Quasi-orderings ⋮ Strong WQO Tree Theorems ⋮ Recent Progress on Well-Quasi-ordering Graphs ⋮ The Reverse Mathematics of wqos and bqos ⋮ Well Quasi-orders and the Functional Interpretation ⋮ Well-Quasi Orders and Hierarchy Theory ⋮ A Mechanized Proof of Higman’s Lemma by Open Induction ⋮ Well-Partial Orderings and their Maximal Order Types ⋮ Injective envelopes of transition systems and Ferrers languages ⋮ Higman’s Lemma and Its Computational Content ⋮ The size of Higman-Haines sets ⋮ An Algebraic Characterization of Strictly Piecewise Languages ⋮ Simple permutations: Decidability and unavoidable substructures ⋮ Timed Petri nets and timed automata: On the discriminating power of Zeno sequences ⋮ The length of chains in modular algebraic lattices ⋮ Unnamed Item ⋮ Quantitative analysis of probabilistic lossy channel systems ⋮ Constantive Mal’cev clones on finite sets are finitely related ⋮ Proving a witness lemma in better-quasiordering theory: the method of ‘extensions’ ⋮ Finite Automata for the Sub- and Superword Closure of CFLs: Descriptional and Computational Complexity ⋮ Rational Selecting Relations and Selectors ⋮ The free product of algebras with standard bases for ideals. ⋮ Theories of orders on the set of words ⋮ On the laws of a metabelian variety ⋮ Minimal Elements for the Prime Numbers ⋮ Programming by predicates: a formal model for interactive synthesis ⋮ Forward analysis for WSTS, part I: completions ⋮ Well-Quasi-Ordering versus Clique-Width: New Results on Bigenic Classes ⋮ Stability in the homology of unipotent groups ⋮ Decidability Border for Petri Nets with Data: WQO Dichotomy Conjecture ⋮ Nice Enumerations of ω-categorical Groups ⋮ Free monoids and generalized metric spaces ⋮ Gröbner methods for representations of combinatorial categories ⋮ Well-quasi-ordering Does Not Imply Bounded Clique-width ⋮ Wohlquasigeordnete Klassen endlicher Graphen ⋮ A syntactic approach to the MacNeille completion of \(\Lambda^\ast\), the free monoid over an ordered alphabet \(\Lambda\) ⋮ FI- and OI-modules with varying coefficients ⋮ Some results relevant to embeddability of rings (especially group algebras) in division rings ⋮ Sur les premeilleurs ordres. (On prémeilleurs orderings) ⋮ The theory of well-quasi-ordering: a frequently discovered concept ⋮ AUTOMATED TERMINATION IN MODEL-CHECKING MODULO THEORIES ⋮ Some theorems for scattered ordered sets ⋮ Geometric grid classes of permutations ⋮ Well quasi-orders, unavoidable sets, and derivation systems ⋮ Simple permutations and pattern restricted permutations ⋮ Some complexity results for stateful network verification ⋮ Verification of probabilistic systems with faulty communication ⋮ Inflations of geometric grid classes of permutations ⋮ Tournament minors ⋮ Well-quasi-order for permutation graphs omitting a path and a clique ⋮ Rational subsets and submonoids of wreath products. ⋮ On the expressivity of time-varying graphs ⋮ Expressiveness Issues in Brane Calculi: A Survey ⋮ Homomorphic image orders on combinatorial structures. ⋮ Metanilpotent varieties of groups ⋮ On well quasi-order of graph classes under homomorphic image orderings ⋮ Minimal bad sequences are necessary for a uniform Kruskal theorem ⋮ Word problems of groups: formal languages, characterizations and decidability ⋮ On the expressive power of movement and restriction in pure mobile ambients ⋮ Well quasi-orders and regular languages ⋮ On the least exponential growth admitting uncountably many closed permutation classes ⋮ Finiteness spaces and generalized power series ⋮ A linear time algorithm for monadic querying of indefinite data over linearly ordered domains ⋮ An infinite antichain of planar tanglegrams ⋮ Weights for total division orderings on strings ⋮ Ordered colourings ⋮ On well quasiordering of finite languages ⋮ Patterns in Shi tableaux and Dyck paths ⋮ The wellordering on positive braids ⋮ Deciding atomicity of subword-closed languages ⋮ Well quasi-orders arising from finite ordered semigroups ⋮ Branch-well-structured transition systems and extensions ⋮ Semisimple rings and von Neumann regular rings of generalized power series ⋮ Braid group actions on left distributive structures, and well orderings in the braid groups ⋮ Internal characterizations of lattice-ordered power series fields ⋮ Simple termination of rewrite systems ⋮ The FEP for some varieties of fully distributive knotted residuated lattices ⋮ Lattice closures of polyhedra ⋮ Higher Lawrence configurations. ⋮ A characterisation of multiply recursive functions with Higman's lemma. ⋮ On termination and invariance for faulty channel machines ⋮ Controlling a random population ⋮ Noetherianity and Specht problem for varieties of bicommutative algebras ⋮ Some relational structures with polynomial growth and their associated algebras. I: Quasi-polynomiality of the profile ⋮ The computational power of population protocols ⋮ Expressivity of imperfect information logics without identity ⋮ Basic formulas and languages. II: Applications to EOL systems and forms ⋮ On two classes of hereditarily finitely based semigroup identities ⋮ Better quasi-orders for uncountable cardinals ⋮ Dickson's lemma, Higman's theorem and beyond: a survey of some basic results in order theory ⋮ Reduction and covering of infinite reachability trees ⋮ Petri nets and regular processes ⋮ Branch-depth: generalizing tree-depth of graphs ⋮ Varieties of modular \(p\)-algebras not containing \(M_{3,3}\) ⋮ What's so special about Kruskal's theorem and the ordinal \(\Gamma{}_ 0\)? A survey of some results in proof theory ⋮ Rings of generalized power series: Nilpotent elements ⋮ On the genus defect of positive braid knots ⋮ Well-quasi-ordering versus clique-width ⋮ Noetherian rings of generalized power series ⋮ Weak polynomial identities and their applications ⋮ Finite combinatorial generation of metabelian \(T\)-ideal ⋮ From wqo to bqo, via Ellentuck's theorem ⋮ Specht property for some varieties of Jordan algebras of almost polynomial growth ⋮ A counterexample regarding labelled well-quasi-ordering ⋮ Lattice-ordered fields as convolution algebras ⋮ Obituary: Ernest Corominas ⋮ On the regularity of languages on a binary alphabet generated by copying systems ⋮ Well quasi orders in subclasses of bounded treewidth graphs and their algorithmic applications ⋮ Construction of fuzzy automata from fuzzy regular expressions ⋮ Rationality of division orderings ⋮ A well-structured framework for analysing Petri net extensions ⋮ Well rewrite orderings and well quasi-orderings ⋮ Skolem functions and constructive models ⋮ On operations and linear extensions of well partially ordered sets ⋮ All normal extensions of S5-squared are finitely axiomatizable ⋮ Mind change complexity of inferring unbounded unions of restricted pattern languages from positive data ⋮ On commutativity based edge lean search ⋮ Machines that can output empty words ⋮ On the height of towers of subsequences and prefixes ⋮ Some varieties of Lie algebras ⋮ Identities for the special linear Lie algebra with the Pauli and Cartan gradings ⋮ Forbidden substructures and combinatorial dichotomies: WQO and universality ⋮ Two forbidden induced subgraphs and well-quasi-ordering ⋮ Well-quasi-ordered classes of groups ⋮ Finite basis theorem for rings and algebras satisfying a central condition ⋮ Partially ordered sets and nonmatrix identities of associative algebras ⋮ Parameterized verification of monotone information systems ⋮ Do subspaces have distinguished bases? ⋮ Well quasi-ordered sets and ideals in free semigroups and algebras ⋮ Polynomials satisfied by matrices ⋮ Lazy controller synthesis for monotone transition systems and directed safety specifications ⋮ The algebra of \(2 \times 2\) upper triangular matrices as a commutative algebra: gradings, graded polynomial identities and Specht property ⋮ Polynomial identities for the Jordan algebra of \(2 \times 2\) upper triangular matrices ⋮ Fifo nets without order deadlock ⋮ E-convex infix codes ⋮ On well quasi orders of free monoids ⋮ On quasi orders of words and the confluence property ⋮ Finite basis property of varieties with binomial identity ⋮ On power varieties of semigroups ⋮ Descriptional complexity of regular languages ⋮ Varieties ⋮ Loop checking in SLD-derivations by well-quasi-ordering of goals ⋮ Well-quasi-ordering and the Hausdorff quasi-uniformity ⋮ \texttt{VIC}-modules over noncommutative rings ⋮ Borel colouring bad rays ⋮ Injective envelope of graphs and transition systems ⋮ Exchange property and the natural preorder between simple modules over semi-Artinian rings ⋮ Minimal antichains in well-founded quasi-orders with an application to tournaments ⋮ On the stabilization problem for submodules of Specht modules ⋮ State complexity investigations on commutative languages -- the upward and downward closure, commutative aperiodic and commutative group languages ⋮ Verifying lossy channel systems has nonprimitive recursive complexity. ⋮ Model checking of systems with many identical timed processes ⋮ Games with unawareness ⋮ Well-quasi-ordering digraphs with no long alternating paths by the strong immersion relation ⋮ Algorithmic analysis of programs with well quasi-ordered domains. ⋮ A solution to the problem of (\(A\),\(B\))-invariance for series ⋮ Equality problem for center-by-metabelian Lie algebras ⋮ Stream/block ciphers, difference equations and algebraic attacks ⋮ On total regulators generated by derivation relations ⋮ Minimal forbidden subwords ⋮ The complexity of finding SUBSEQ\((A)\) ⋮ Letterplace ideals and non-commutative Gröbner bases. ⋮ Termination of rewriting ⋮ Minimal universal and dense minor closed classes ⋮ Minimal regular 2-graphs and applications ⋮ On well-quasi-ordering-finite graphs by immersion ⋮ Subword conditions and subword histories ⋮ A geometrical approach to multiset orderings ⋮ From monomials to words to graphs. ⋮ On well-quasi-ordering finite sequences ⋮ Rational Hilbert series of relatively free Jordan algebras ⋮ Using unavoidable set of trees to generalize Kruskal's theorem ⋮ Fields of generalized power series ⋮ Well-quasi-order of relabel functions ⋮ Finiteness of the standard basis of a \(T\)-ideal containing Lie nilpotency of index 4 ⋮ Definability in the structure of words with the inclusion relation ⋮ Boundary properties of well-quasi-ordered sets of graphs ⋮ Shuffle on trajectories: Syntactic constraints ⋮ Inventories of unavoidable languages and the word-extension conjecture ⋮ On codes defined by bio-operations ⋮ Well quasi-orders generated by a word-shuffle rewriting ⋮ The Dyck pattern poset ⋮ Labelled induced subgraphs and well-quasi-ordering ⋮ A well-quasi-order for tournaments ⋮ Rao's degree sequence conjecture ⋮ A decidability result for the dominating set problem ⋮ On the state complexity of closures and interiors of regular languages with subwords and superwords ⋮ Deciding safety properties in infinite-state pi-calculus via behavioural types ⋮ Meta-expansion of transseries ⋮ On partial well-order for monotone grid classes of permutations ⋮ The maximal linear extension theorem in second order arithmetic ⋮ Context-free like restrictions on selective rewriting ⋮ Proof pearl: a formal proof of Higman's lemma in ACL2 ⋮ On the recursive decomposition ordering with lexicographical status and other related orderings ⋮ On well-quasi-ordering finite structures with labels ⋮ Decidability of a temporal logic problem for Petri nets ⋮ Grid classes and partial well order ⋮ On the existence of closed terms in the typed lambda calculus II: Transformations of unification problems ⋮ Combinatorial theorems on contractive mappings in power sets ⋮ A note on division orderings on strings ⋮ Basic formulas and languages. I: The theory ⋮ Canonical antichains of unit interval and bipartite permutation graphs ⋮ Set systems: order types, continuous nondeterministic deformations, and quasi-orders ⋮ On the number of finite algebraic structures ⋮ Finite Gröbner bases in infinite dimensional polynomial rings and applications ⋮ Noetherian quotients of the algebra of partial difference polynomials and Gröbner bases of symmetric ideals ⋮ A well-ordering of dual braid monoids. ⋮ The subvariety lattice for representable idempotent commutative residuated lattices ⋮ T-spaces in associative algebras. ⋮ The finite antichain property in Coxeter groups. ⋮ Ideals of bounded rank symmetric tensors are generated in bounded degree ⋮ Kernel methods for learning languages ⋮ On Specht varieties of right alternative algebras ⋮ Combinatorial generators of the multilinear polynomial identities. ⋮ An order-theoretic characterization of the Howard-Bachmann-hierarchy ⋮ Stable sets versus independent sets ⋮ Partial orders on words, minimal elements of regular languages, and state complexity ⋮ Ordinal recursive complexity of unordered data nets ⋮ Block-graph width ⋮ When excluding one matroid prevents infinite antichains ⋮ Derivation tree analysis for accelerated fixed-point computation ⋮ Well quasi-orders and context-free grammars ⋮ A note on partially ordered tree automata ⋮ Codes, orderings, and partial words ⋮ Multiset rewriting for the verification of depth-bounded processes with name binding ⋮ Type-based homeomorphic embedding for online termination ⋮ Well-quasi-ordering versus clique-width: new results on bigenic classes ⋮ Completion and finite embeddability property for residuated ordered algebras. ⋮ Well-structured graph transformation systems ⋮ The ascending chain condition for principal left or right ideals of skew generalized power series rings. ⋮ On canonical antichains ⋮ Linearizing well quasi-orders and bounding the length of bad sequences ⋮ A new class of unique product monoids with applications to ring theory. ⋮ Images of rigid digraphs ⋮ Automating the Knuth Bendix ordering ⋮ Algorithmic graph minor theory: Improved grid minor bounds and Wagner's contraction ⋮ On regularity of context-free languages ⋮ On Fraïssé's conjecture for linear orders of finite Hausdorff rank ⋮ On the computational power of BlenX ⋮ Finite basis theorem for systems of semigroup identities ⋮ On the Specht property and the basic rank of some products of group varieties ⋮ Combinatorial properties of regressive mappings ⋮ An application of the matrix representation of transductions ⋮ Graphs without \(K_ 4\) and well-quasi-ordering ⋮ Partitionseigenschaft von endlichen Folgen ⋮ Commutative one-counter languages are regular ⋮ A regularity test for dual bordered OS systems ⋮ Une généralisation des théorèmes de Higman et de Simon aux mots infinis ⋮ On better quasi-ordering countable trees ⋮ 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] ⋮ A general finite basis condition for systems of semigroup identities ⋮ Dimension de Krull des ensembles ordonnés. (Krull dimension of ordered sets) ⋮ Another generalization of Higman's well quasi order result on \(\Sigma ^*\) ⋮ Specht varieties of soluble alternative algebras ⋮ Noncommutative invariants of reductive groups ⋮ Quasi finitely axiomatizable totally categorical theories ⋮ Fixed points and Noetherian topologies ⋮ The next 700 program transformers ⋮ Bachmann-Howard derivatives ⋮ Factorization under local finiteness conditions ⋮ Specht property of varieties of graded Lie algebras ⋮ POLYHEDRAL COMPLETENESS OF INTERMEDIATE LOGICS: THE NERVE CRITERION ⋮ Packing topological minors half‐integrally ⋮ Hereditary classes of ordered binary structures ⋮ 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 ⋮ A constructive picture of Noetherian conditions and well quasi-orders ⋮ Axioms for a theory of signature bases ⋮ A few characterizations of topological spaces with no infinite discrete subspace ⋮ Semiring systems arising from hyperrings ⋮ Semilinear idempotent distributive \(\ell\)-monoids ⋮ Finite embeddability property for residuated lattices via regular languages ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Specht property for the algebra of upper triangular matrices of size two with a Taft’s algebra action ⋮ The Subtrace Order and Counting First-Order Logic ⋮ Collaborating with Hans: Some Remaining Wonderments ⋮ About the theory of tree embedding ⋮ Letter Graphs and Geometric Grid Classes of Permutations ⋮ Labelled well-quasi-order for permutation classes ⋮ Relations on free monoids, their independent sets, and codes¹ ⋮ Ein in der reinen Zahlentheorie unbeweisbarer Satz über endliche Folgen von natürlichen Zahlen ⋮ On ground AC-completion ⋮ Linear interpretations by counting patterns ⋮ Totally unordered subsets of a partially well ordered set ⋮ Nichtbeweisbarkeit von gewissen kombinatorischen Eigenschaften endlicher Bäume;Unprovability of certain combinatorial properties of finite trees ⋮ Invariant Chains in Algebra and Discrete Geometry ⋮ Rational and Recognisable Power Series ⋮ Infinitary Noetherian constructions I. Infinite words ⋮ E-Unification based on Generalized Embedding ⋮ Topological isotopy and Cochran’s derived invariants ⋮ Unnamed Item ⋮ A Combinatorial Approach to Complexity Theory via Ordinal Hierarchies ⋮ Une extension d'un théorème de P. Jullien sur les âges de mots ⋮ On central ketabelian variety of algebras ⋮ Unnamed Item ⋮ Decidability of weak fairness in petri nets ⋮ Cost Automata, Safe Schemes, and Downward Closures ⋮ Generalized fusible numbers and their ordinals ⋮ Program extraction from classical proofs ⋮ Groups whose word problems are accepted by abelian \(G\)-automata ⋮ The length of an intersection ⋮ Unavoidable languages, cuts and innocent sets of words ⋮ Hypercodes, Right Convex Languages and their Syntactic Monoids ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Parametric Verification of Weighted Systems ⋮ Induced minors and well-quasi-ordering ⋮ A Pumping Lemma for Permitting Semi-Conditional Languages ⋮ Unnamed Item ⋮ SMT-based verification of data-aware processes: a model-theoretic approach ⋮ Path homomorphisms ⋮ Polynomial identities for a family of simple jordan algebras ⋮ Unboundedness Problems for Languages of Vector Addition Systems. ⋮ Unnamed Item ⋮ Varieties of Commutative Semigroups ⋮ Some relational structures with polynomial growth and their associated algebras II: Finite generation ⋮ Dynamic Networks of Timed Petri Nets ⋮ Further closure properties of input-driven pushdown automata ⋮ Gap Embedding for Well-Quasi-Orderings ⋮ Extended letterplace correspondence for nongraded noncommutative ideals and related algorithms ⋮ Recursive models and the divisibility poset ⋮ Long finite sequences ⋮ Well-structured transition systems everywhere! ⋮ Ensuring completeness of symbolic verification methods for infinite-state systems ⋮ On Shuffle Ideals ⋮ Contexts on trajectories ⋮ Associative Enveloping Pseudoalgebras of Finite Lie Pseudoalgebras ⋮ Finite generation of symmetric ideals ⋮ Unnamed Item ⋮ On the Qualitative Analysis of Conformon P Systems ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Levels of knowledge in distributed systems. ⋮ Clique-width and well-quasi-ordering of triangle-free graph classes ⋮ Two applications of analytic functors ⋮ The Length of Noetherian Polynomial Rings ⋮ Nested Petri Nets for Adaptive Process Modeling ⋮ On the effective and automatic enumeration of polynomial permutation classes ⋮ On Better-Quasi-Ordering Countable Series-Parallel Orders ⋮ Generalizing Kruskal's theorem to pairs of cohabitating trees ⋮ Laver's results and low-dimensional topology ⋮ Laver and set theory ⋮ Perfect failure detection with very few bits ⋮ Stochastic Games with Lossy Channels ⋮ Unnamed Item ⋮ On the finite embeddability property for residuated ordered groupoids ⋮ Combinatorics and algorithms for quasi-chain graphs ⋮ Unnamed Item ⋮ On the expressive power of process interruption and compensation ⋮ On the Polyhedrality of Closures of Multibranch Split Sets and Other Polyhedra with Bounded Max-Facet-Width ⋮ Well-quasi-orderings and sets of finite sequences ⋮ The Parametric Complexity of Lossy Counter Machines ⋮ Lambda-Definable Order-3 Tree Functions are Well-Quasi-Ordered ⋮ The Quantifier Alternation Hierarchy of Synchronous Relations ⋮ Monotonic Abstraction in Parameterized Verification ⋮ A characterization of well-founded algebraic lattices ⋮ Partial well‐ordering of sets of vectors ⋮ Metrically homogeneous graphs of diameter 3 ⋮ On the expressive power of recursion, replication and iteration in process calculi ⋮ Gröbner bases and gradings for partial difference ideals ⋮ INNER PALINDROMIC CLOSURE ⋮ Ideals of identities of representations of nilpotent lie algebras ⋮ Atomicity and Well Quasi-Order for Consecutive Orderings on Words and Permutations ⋮ Fermionic quantum cellular automata and generalized matrix-product unitaries ⋮ Calculating Maximal Order Types for Finite Rooted Unstructured Labeled Trees ⋮ Totally Categorical Structures ⋮ Nilpotency and the Hamiltonian property for cancellative residuated lattices ⋮ Well-Quasi-Ordering Infinite Graphs with Forbidden Finite Planar Minor ⋮ Systems of linear equations over associative algebras and the occurrence problem for lie algebras ⋮ On the dimension of downsets of integer partitions and compositions