On the cartesian product of well-orderings

02/15/2022
by   Isa Vialard, et al.
0

The width of a well partial ordering (wpo) is the ordinal rank of the set of its antichains ordered by inclusion. We compute the width of wpos obtained as cartesian products of finitely many well-orderings.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/20/2023

Ordinal measures of the set of finite multisets

Well-partial orders, and the ordinal invariants used to measure them, ar...
research
06/08/2023

Twin-width of subdivisions of multigraphs

For each d≤3, we construct a finite set F_d of multigraphs such that for...
research
02/23/2022

Bounds on the Twin-Width of Product Graphs

Twin-width is a graph width parameter recently introduced by Bonnet, Kim...
research
06/10/2019

On the Structure of Ordered Latent Trait Models

Ordered item response models that are in common use can be divided into ...
research
10/16/2017

Commutator width in the first Grigorchuk group

Let G be the first Grigorchuk group. We show that the commutator width o...
research
06/04/2021

On (co-lex) Ordering Automata

The states of a deterministic finite automaton A can be identified with ...
research
06/23/2021

Width-based Lookaheads with Learnt Base Policies and Heuristics Over the Atari-2600 Benchmark

We propose new width-based planning and learning algorithms applied over...

Please sign up or login with your details

Forgot password? Click here to reset