Emeric Deutsch

Orcid: 0000-0002-9666-9029

According to our database1, Emeric Deutsch authored at least 63 papers between 1998 and 2019.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2019
M-polynomial revisited: Bethe cacti and an extension of Gutman's approach.
J. Appl. Math. Comput., June, 2019

2018
A bijection between bargraphs and Dyck paths.
Discret. Appl. Math., 2018

2017
Statistics on bargraphs viewed as cornerless Motzkin paths.
Discret. Appl. Math., 2017

More on domination polynomial and domination root.
Ars Comb., 2017

2016
A Note On a Method of Erdős and the Stanley-Elder Theorems.
Integers, 2016

2014
The Hosoya polynomial of distance-regular graphs.
Discret. Appl. Math., 2014

2012
The run transform.
Discret. Math., 2012

Rooted tree statistics from Matula numbers.
Discret. Appl. Math., 2012

2011
Cycle-up-down permutations.
Australas. J Comb., 2011

2010
The largest and the smallest fixed points of permutations.
Eur. J. Comb., 2010

2009
Problem 11424.
Am. Math. Mon., 2009

2008
An Equality for Parts in Partitions of n: 11237.
Am. Math. Mon., 2008

Problem 11373.
Am. Math. Mon., 2008

2007
Compositions without Common Factors: 11161.
,
et al.
Am. Math. Mon., 2007

Dissecting a Polygon: 11170.
Am. Math. Mon., 2007

Peaks in Dyck Paths: 11150.
Am. Math. Mon., 2007

Problem 11281.
Am. Math. Mon., 2007

Refined restricted involutions.
Eur. J. Comb., 2007

2006
A Variation on t-Catalan Paths: 11071.
Am. Math. Mon., 2006

Counting Elevated Schröder Paths: 11108.
Am. Math. Mon., 2006

Problem 11237.
Am. Math. Mon., 2006

Old and young leaves on plane trees.
Eur. J. Comb., 2006

2005
Problem 11170.
Am. Math. Mon., 2005

Problem 11161.
Am. Math. Mon., 2005

Problem 11150.
Am. Math. Mon., 2005

Production matrices.
Adv. Appl. Math., 2005

2004
Enumeration of Permutations by Disorder: 10975.
Am. Math. Mon., 2004

Problem 11108.
Am. Math. Mon., 2004

Problem 11071.
Am. Math. Mon., 2004

Ordered trees with prescribed root degrees, node degrees, and branch lengths.
Discret. Math., 2004

Enumerating symmetric directed convex polyominoes.
Discret. Math., 2004

2003
A bijection between directed column-convex polyominoes and ordered trees of height at most three.
Theor. Comput. Sci., 2003

Derangements That Don't Rise Too Fast: 10902.
Am. Math. Mon., 2003

Three Recurrences for a Single Sequence: 10860.
Am. Math. Mon., 2003

Counting Tilings with L-Tiles and Squares: 10877.
Am. Math. Mon., 2003

2002
Special Motzkin Paths: 10816.
Am. Math. Mon., 2002

A Recursively Defined Sequence of Functions: 10785.
Am. Math. Mon., 2002

Problem 10975.
Am. Math. Mon., 2002

A bijection between ordered trees and 2-Motzkin paths and its many consequences.
Discret. Math., 2002

Statistics on non-crossing trees.
Discret. Math., 2002

Diagonally convex directed polyominoes and even trees: a bijection and related issues.
Discret. Math., 2002

Longest Increasing Subsequences in Pattern-Restricted Permutations.
Electron. J. Comb., 2002

2001
Counting the Solutions: 10540.
Am. Math. Mon., 2001

Another Path to Generalized Catalan Numbers: 10751.
Am. Math. Mon., 2001

Three-Dimensional Lattice Walks in the Upper Half-Space: 10795.
Am. Math. Mon., 2001

Problem 10902.
Am. Math. Mon., 2001

Problem 10877.
Am. Math. Mon., 2001

Problem 10860.
Am. Math. Mon., 2001

A survey of the Fine numbers.
Discret. Math., 2001

A bijective proof of the equation linking the Schro"der numbers, large and small.
Discret. Math., 2001

2000
Complex Roots of a Polynomial: 10688.
Am. Math. Mon., 2000

How Far Does the First Element Dominate?: 10649.
Am. Math. Mon., 2000

A Formula for the Pell Sequence: 10663.
Am. Math. Mon., 2000

Permutation Parameters with the Same Distribution: 10634.
Am. Math. Mon., 2000

Another Type of Lattice Path: 10658.
Am. Math. Mon., 2000

Problem 10816.
Am. Math. Mon., 2000

Problem 10795.
Am. Math. Mon., 2000

Problem 10785.
Am. Math. Mon., 2000

A Bijection on Ordered Trees and Its Consequences.
J. Comb. Theory, Ser. A, 2000

1999
Dyck path enumeration.
Discret. Math., 1999

An involution on Dyck paths and its consequences.
Discret. Math., 1999

1998
A bijection on Dyck paths and its consequences.
Discret. Math., 1998

A bijection on Dyck paths and its consequences (note) [discrete math. 179 (1998) 253-256]
Discret. Math., 1998


  Loading...