Renzo Pinzani

From MaRDI portal
Revision as of 16:09, 8 December 2023 by AuthorDisambiguator (talk | contribs) (AuthorDisambiguator moved page Renzo Pinzani to Renzo Pinzani: Duplicate)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:180270

Available identifiers

zbMath Open pinzani.renzoMaRDI QIDQ180270

List of research outcomes

PublicationDate of PublicationType
Sequences from Fibonacci to Catalan: A combinatorial interpretation via Dyck paths2024-04-16Paper
A Construction for Variable Dimension Strong Non-Overlapping Matrices2024-04-09Paper
A construction for enumerating k-coloured Motzkin paths2023-12-12Paper
https://portal.mardi4nfdi.de/entity/Q60761482023-10-23Paper
Classes of Dyck paths associated with numerical semigroups2023-01-23Paper
Non-overlapping matrices via Dyck words2022-12-07Paper
From the Fibonacci to Pell numbers and beyond via Dyck paths2022-11-09Paper
Directed column-convex polyominoes by recurrence relations2022-11-02Paper
Strings from linear recurrences and permutations: a gray code2022-10-24Paper
Strings from linear recurrences: a Gray code2022-05-20Paper
Strings from linear recurrences and permutations: a Gray code2022-04-21Paper
A strong non-overlapping Dyck code2022-03-25Paper
Exhaustive generation of some lattice paths and their prefixes2021-07-22Paper
Variable dimension non-overlapping matrices2020-06-10Paper
Recurrence relations, succession rules and the positivity problem2019-06-25Paper
Non-overlapping Dyck matrices2018-11-27Paper
A 2D non-overlapping code over a \(q\)-ary alphabet2018-03-09Paper
A New Approach to Cross-Bifix-Free Sets2017-07-12Paper
Prefix partitioned Gray codes for particular cross-bifix-free sets2017-04-04Paper
A generating function for bit strings with no Grand Dyck pattern matching2017-03-31Paper
Cross-bifix-free sets in two dimensions2017-03-16Paper
Non-overlapping matrices2016-12-19Paper
Cross-bifix-free sets generation via Motzkin paths2016-08-12Paper
The medians of discrete sets2016-06-09Paper
Recurrence Relations, Succession Rules, and the Positivity Problem2016-04-08Paper
Pattern 1^j0^i avoiding binary words2016-03-01Paper
Prefix partitioned Gray codes for particular cross-bifix-free sets2014-10-08Paper
https://portal.mardi4nfdi.de/entity/Q57461682014-02-18Paper
The Dyck pattern poset2014-01-27Paper
Catalan structures and Catalan pairs2014-01-10Paper
Combinatorial properties of Catalan pairs2013-10-10Paper
https://portal.mardi4nfdi.de/entity/Q53267182013-08-06Paper
Six bijections between deco polyominoes and permutations2013-08-06Paper
Avoiding cross-bifix-free binary words2013-06-28Paper
Generation and enumeration of some classes of interval orders2013-06-26Paper
Catalan Lattices on Series Parallel Interval Orders2013-03-25Paper
A tiling system for the class of \(L\)-convex polyominoes2013-03-04Paper
Recurrence relations versus succession rules2013-01-14Paper
https://portal.mardi4nfdi.de/entity/Q29186142012-10-08Paper
Pattern 1j+10j Avoiding Binary Words2012-07-11Paper
Polyominoes determined by permutations: enumeration via bijections2012-07-10Paper
https://portal.mardi4nfdi.de/entity/Q30773242011-02-22Paper
Catalan pairs: a relational-theoretic approach to Catalan numbers2010-09-30Paper
Enumeration of some classes of words avoiding two generalized patterns of length three2010-09-20Paper
https://portal.mardi4nfdi.de/entity/Q35750102010-07-05Paper
The average height of directed column-convex polyominoes having square, hexagonal and triangular cells2010-05-02Paper
Mixed succession rules: the commutative case2010-04-21Paper
The combinatorics of convex permutominoes2009-11-11Paper
A closed formula for the number of convex permutominoes2009-04-07Paper
Permutations defining convex permutominoes2008-05-13Paper
A general exhaustive generation algorithm for Gray structures2007-09-10Paper
https://portal.mardi4nfdi.de/entity/Q34287982007-03-29Paper
Enumerating permutations avoiding three Babson-Steingrímsson patterns2005-12-13Paper
Lattices of lattice paths2005-10-10Paper
A bijection for the total area of parallelogram polyominoes2005-02-23Paper
https://portal.mardi4nfdi.de/entity/Q31546602005-01-14Paper
Jumping succession rules and their generating functions2003-09-25Paper
https://portal.mardi4nfdi.de/entity/Q44289012003-09-22Paper
Lattice path moments by cut and paste2003-07-29Paper
https://portal.mardi4nfdi.de/entity/Q44839472003-05-27Paper
X-rays characterizing some classes of discrete sets2002-09-29Paper
A bijective approach to the area of generalized Motzkin paths2002-09-12Paper
Some permutations with forbidden subsequences and their inversion number2002-09-11Paper
An algebraic characterization of the set of succession rules2002-07-15Paper
A linear operator approach to succession rules2002-06-27Paper
Vexillary involutions are enumerated by Motzkin numbers2002-06-16Paper
https://portal.mardi4nfdi.de/entity/Q43312032002-06-10Paper
Stirling numbers interpolation using permutations with forbidden subsequences2002-05-15Paper
A bijection for some paths on the slit plane2002-05-07Paper
Approximating algebraic functions by means of rational ones2002-03-03Paper
ECO method and hill-free generalized Motzkin paths2001-11-08Paper
https://portal.mardi4nfdi.de/entity/Q27550372001-11-05Paper
https://portal.mardi4nfdi.de/entity/Q27550462001-11-05Paper
The height of directed column-convex polyominoes2001-11-05Paper
Schröder's paths and random hierarchies2001-08-20Paper
From Motzkin to Catalan permutations2001-08-02Paper
https://portal.mardi4nfdi.de/entity/Q45025942001-06-28Paper
https://portal.mardi4nfdi.de/entity/Q45245772001-03-19Paper
Steep polyominoes, \(q\)-Motzkin numbers and \(q\)-Bessel functions2000-11-02Paper
https://portal.mardi4nfdi.de/entity/Q49540082000-05-18Paper
Some combinatorial interpretations of \(q\)-analogs of Schröder numbers2000-04-10Paper
ECO:a methodology for the enumeration of combinatorial objects1999-12-02Paper
A combinatorial interpretation of the area of Schröder paths1999-11-24Paper
Directed animals, forests and permutations1999-09-02Paper
A methodology for plane tree enumeration1999-01-11Paper
Nondecreasing Dyck paths and \(q\)-Fibonacci numbers1998-05-04Paper
Reconstructing convex polyominoes from horizontal and vertical projections1997-02-27Paper
``Deco polyominoes, permutations and random generation1997-02-27Paper
Polyominoes defined by their vertical and horizontal projections1997-02-27Paper
The number of convex polyominoes reconstructible from their orthogonal projections1997-02-24Paper
https://portal.mardi4nfdi.de/entity/Q48621741996-02-15Paper
The random generation of underdiagonal walks1995-09-27Paper
The random generation of directed animals1995-02-09Paper
https://portal.mardi4nfdi.de/entity/Q40133491992-09-27Paper
https://portal.mardi4nfdi.de/entity/Q33597451991-01-01Paper
https://portal.mardi4nfdi.de/entity/Q34843781989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47282831986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q32198081985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39385241982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41536021978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41626271977-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40867061975-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40516211974-01-01Paper
https://portal.mardi4nfdi.de/entity/Q44037081973-01-01Paper
https://portal.mardi4nfdi.de/entity/Q51803501973-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56784161973-01-01Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Renzo Pinzani