New results on production matrices for geometric graphs

Home | About RECERCAT | Contact

Català | Castellano

All of RECERCAT

By Communities &
Collections By Defense Date By Authors By Titles By Subject

This Collection

By Defense Date By Authors By Titles By Subject

Statistics

View Statistics All RECERCAT

My RECERCAT

Other repositories directory

RECERCAT Home > Universitat Politècnica de Catalunya > Documents de recerca > View document

To access the full text documents, please follow this link: http://hdl.handle.net/2117/121756

dc.contributor	Universitat Politècnica de Catalunya. Departament de Matemàtiques
dc.contributor	Universitat Politècnica de Catalunya. DCG - Discrete and Combinatorial Geometry
dc.contributor	Universitat Politècnica de Catalunya. CGA -Computational Geometry and Applications
dc.contributor.author	Esteban Pascual, Guillermo
dc.contributor.author	Huemer, Clemens
dc.contributor.author	Silveira, Rodrigo Ignacio
dc.date	2018-07-01
dc.identifier.citation	Esteban, G., Huemer, C., Silveira, R.I. New results on production matrices for geometric graphs. "Electronic notes in discrete mathematics", 1 Juliol 2018, vol. 68, núm. July 2018, p. 215-220.
dc.identifier.citation	1571-0653
dc.identifier.citation	10.1016/j.endm.2018.06.037
dc.identifier.uri	http://hdl.handle.net/2117/121756
dc.language.iso	eng
dc.relation	https://www.sciencedirect.com/science/article/pii/S1571065318301288
dc.rights	info:eu-repo/semantics/openAccess
dc.subject	Àrees temàtiques de la UPC::Matemàtiques i estadística::Matemàtica discreta::Combinatòria
dc.subject	Combinatorial analysis
dc.subject	geometric graph
dc.subject	production matrix
dc.subject	Riordan array
dc.subject	Anàlisi combinatòria
dc.title	New results on production matrices for geometric graphs
dc.type	info:eu-repo/semantics/submittedVersion
dc.type	info:eu-repo/semantics/article
dc.description.abstract	We present novel production matrices for non-crossing partitions, connected geometric graphs, and k-angulations, which provide another way of counting the number of such objects. For instance, a formula for the number of connected geometric graphs with given root degree, drawn on a set of n points in convex position in the plane, is presented. Further, we find the characteristic polynomials and we provide a characterization of the eigenvectors of the production matrices.

Show simple item record

All of RECERCAT

This Collection

Statistics

My RECERCAT

Related documents

Other documents of the same author