More about Latin Tableaux and their Embeddings
نویسندگان
چکیده
It is shown that any non-solvable Latin Tableau (LT) has a solvable LT-extension with the same shape, and an algorithm computing the minimal such extension is presented. Minimal Latin Square embeddings of solvable Latin Tableaux are established. The results depend partly on the truth of the Wide Partition Conjecture for Latin Tableaux. More about Latin Tableaux and their Embeddings Bart Demoen KU Leuven Phuong-Lan Nguyen IMA UCO Angers Abstract It is shown that any non-solvable Latin Tableau (LT) has a solvable LT-extension with the same shape. An algorithm computing the minimal such extension is presented. Minimal Latin Square embeddings of classes of solvable Latin Tableaux are established. Embeddings of LT(N) into LS(N+2) are studied in particular. The results depend partly on the truth of the Wide Partition Conjecture for Latin Tableaux.It is shown that any non-solvable Latin Tableau (LT) has a solvable LT-extension with the same shape. An algorithm computing the minimal such extension is presented. Minimal Latin Square embeddings of classes of solvable Latin Tableaux are established. Embeddings of LT(N) into LS(N+2) are studied in particular. The results depend partly on the truth of the Wide Partition Conjecture for Latin Tableaux.
منابع مشابه
Orientable Hamilton Cycle Embeddings of Complete Tripartite Graphs I: Latin Square Constructions
Abstract. In an earlier paper the authors constructed a hamilton cycle embedding of Kn,n,n in a nonorientable surface for all n ≥ 1 and then used these embeddings to determine the genus of some large families of graphs. In this two-part series, we extend those results to orientable surfaces for all n 6= 2. In part I, we explore a connection between orthogonal latin squares and embeddings. A pro...
متن کاملOn Biembeddings of Latin Squares
A known construction for face 2-colourable triangular embeddings of complete regular tripartite graphs is re-examined from the viewpoint of the underlying Latin squares. This facilitates biembeddings of a wide variety of Latin squares, including those formed from the Cayley tables of the elementary Abelian 2-groups Ck 2 (k 6= 2). In turn, these biembeddings enable us to increase the best known ...
متن کاملA Construction for Biembeddings of Latin Squares
An existing construction for face 2-colourable triangular embeddings of complete regular tripartite graphs is extended and then re-examined from the viewpoint of the underlying Latin squares. We prove that this generalization gives embeddings which are not isomorphic to any of those produced by the original construction.
متن کاملWeighted Staircase Tableaux, Asymmetric Exclusion Process, and Eulerian Type Recurrences
We consider a relatively new combinatorial structure called staircase tableaux. They were introduced in the context of the asymmetric exclusion process and Askey–Wilson polynomials; however, their purely combinatorial properties have gained considerable interest in the past few years. We will be interested in a general model of staircase tableaux in which symbols that appear in staircase tablea...
متن کاملBiembeddings of Metacyclic Groups and Triangulations of Orientable Surfaces by Complete Graphs
For each integer n > 3, n 6= 4, for each odd integer m > 3, and for any λ ∈ Zn of (multiplicative) order m′ where m′ | m, we construct a biembedding of Latin squares in which one of the squares is the Cayley table of the metacyclic group Zm nλ Zn. This extends the spectrum of Latin squares known to be biembeddable. The best existing lower bounds for the number of triangular embeddings of a comp...
متن کامل