I disabled #13855 because I have re-implement the latex method of 
abstract_tree.py and this one is also redefine in q_tree_factorial-fc.patch.
(the attached file contains some examples of latex output)

Le jeudi 20 décembre 2012 18:40:10 UTC+1, Jean-Baptiste Priez a écrit :
>
> I try to implement some hopf algebra:
>
>    - FQSym
>    - WQSym
>    - PQSym
>    - PBT 
>
> The 3 firsts are in #13793 (no dependance in combinat) and PBT in #13855 
> (depends of binary_trees).
>
> To build these Hopf algebra, I implemented two new combinatoric objets : 
> PackedWord for WQSym and ParkingFunctions for PQSym.
>
> FQSym is clean I think... with some bases.
>
> Please comment and help me to improve that.
>
> Jean-Baptiste Priez (phd student of F. Hivert and N.M. Thiéry)
> (Humm... Sorry for my bad english)
>

-- 
You received this message because you are subscribed to the Google Groups 
"sage-combinat-devel" group.
To view this discussion on the web visit 
https://groups.google.com/d/msg/sage-combinat-devel/-/adiARSihQTsJ.
To post to this group, send email to sage-combinat-devel@googlegroups.com.
To unsubscribe from this group, send email to 
sage-combinat-devel+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/sage-combinat-devel?hl=en.

sage: t = BinaryTree()
sage: print latext(t)

{\begin{tikzpicture}[auto]
\end{tikzpicture}}

sage: t = BinaryTree([])
sage: print latext(t)

{ \newcommand{\nodea}{\node[draw,circle] (a) {$$}
;}\begin{tikzpicture}[auto]
\matrix[column sep=.3cm, row sep=.3cm,ampersand replacement=\&]{
\nodea\\
};
\end{tikzpicture}}

sage: t = OrderedTree([])
sage: print latext(t)

{ \newcommand{\nodea}{\node[draw,circle] (a) {$$}
;}\begin{tikzpicture}[auto]
\matrix[column sep=.3cm, row sep=.3cm,ampersand replacement=\&]{
\nodea\\
};
\end{tikzpicture}}

sage: t = OrderedTree([[[],[]],[[],[]]]).canonical\_labelling(); print latext(t)

{ \newcommand{\nodea}{\node[draw,circle] (a) {$1$}
;}\newcommand{\nodeb}{\node[draw,circle] (b) {$2$}
;}\newcommand{\nodec}{\node[draw,circle] (c) {$3$}
;}\newcommand{\noded}{\node[draw,circle] (d) {$4$}
;}\newcommand{\nodee}{\node[draw,circle] (e) {$5$}
;}\newcommand{\nodef}{\node[draw,circle] (f) {$6$}
;}\newcommand{\nodeg}{\node[draw,circle] (g) {$7$}
;}\begin{tikzpicture}[auto]
\matrix[column sep=.3cm, row sep=.3cm,ampersand replacement=\&]{
         \&         \&         \& \nodea  \&         \&         \&         \\ 
         \& \nodeb  \&         \&         \&         \& \nodee  \&         \\ 
 \nodec  \&         \& \noded  \&         \& \nodef  \&         \& \nodeg  \\
};

\path[ultra thick, red] (b) edge (c) edge (d)
	(e) edge (f) edge (g)
	(a) edge (b) edge (e);
\end{tikzpicture}}

sage: t = BinaryTree([[],[[],[]]]); print latext(t)

{ \newcommand{\nodea}{\node[draw,circle] (a) {$$}
;}\newcommand{\nodeb}{\node[draw,circle] (b) {$$}
;}\newcommand{\nodec}{\node[draw,circle] (c) {$$}
;}\newcommand{\noded}{\node[draw,circle] (d) {$$}
;}\newcommand{\nodee}{\node[draw,circle] (e) {$$}
;}\begin{tikzpicture}[auto]
\matrix[column sep=.3cm, row sep=.3cm,ampersand replacement=\&]{
         \& \nodea  \&         \&         \&         \\ 
 \nodeb  \&         \&         \& \nodec  \&         \\ 
         \&         \& \noded  \&         \& \nodee  \\
};

\path[ultra thick, red] (c) edge (d) edge (e)
	(a) edge (b) edge (c);
\end{tikzpicture}}

sage: t = OrderedTree([[[],[]],[],[[],[]]]).canonical\_labelling(); print latext(t)

{ \newcommand{\nodea}{\node[draw,circle] (a) {$1$}
;}\newcommand{\nodeb}{\node[draw,circle] (b) {$2$}
;}\newcommand{\nodec}{\node[draw,circle] (c) {$3$}
;}\newcommand{\noded}{\node[draw,circle] (d) {$4$}
;}\newcommand{\nodee}{\node[draw,circle] (e) {$5$}
;}\newcommand{\nodef}{\node[draw,circle] (f) {$6$}
;}\newcommand{\nodeg}{\node[draw,circle] (g) {$7$}
;}\newcommand{\nodeh}{\node[draw,circle] (h) {$8$}
;}\begin{tikzpicture}[auto]
\matrix[column sep=.3cm, row sep=.3cm,ampersand replacement=\&]{
         \&         \&         \& \nodea  \&         \&         \&         \\ 
         \& \nodeb  \&         \& \nodee  \&         \& \nodef  \&         \\ 
 \nodec  \&         \& \noded  \&         \& \nodeg  \&         \& \nodeh  \\
};

\path[ultra thick, red] (b) edge (c) edge (d)
	(f) edge (g) edge (h)
	(a) edge (b) edge (e) edge (f);
\end{tikzpicture}}

sage: t = OrderedTree([[],[],[[],[],[],[],[]]]).canonical\_labelling(); print latext(t)

{ \newcommand{\nodea}{\node[draw,circle] (a) {$1$}
;}\newcommand{\nodeb}{\node[draw,circle] (b) {$2$}
;}\newcommand{\nodec}{\node[draw,circle] (c) {$3$}
;}\newcommand{\noded}{\node[draw,circle] (d) {$4$}
;}\newcommand{\nodee}{\node[draw,circle] (e) {$5$}
;}\newcommand{\nodef}{\node[draw,circle] (f) {$6$}
;}\newcommand{\nodeg}{\node[draw,circle] (g) {$7$}
;}\newcommand{\nodeh}{\node[draw,circle] (h) {$8$}
;}\newcommand{\nodei}{\node[draw,circle] (i) {$9$}
;}\begin{tikzpicture}[auto]
\matrix[column sep=.3cm, row sep=.3cm,ampersand replacement=\&]{
         \& \nodea  \&         \&         \&         \&         \&         \\ 
 \nodeb  \& \nodec  \&         \&         \& \noded  \&         \&         \\ 
         \&         \& \nodee  \& \nodef  \& \nodeg  \& \nodeh  \& \nodei  \\
};

\path[ultra thick, red] (d) edge (e) edge (f) edge (g) edge (h) edge (i)
	(a) edge (b) edge (c) edge (d);
\end{tikzpicture}}

Reply via email to