Title	Counting shared sites of three friendly directed lattice paths and related problems
Creator	Owczarek, Aleks
Publisher	Banff International Research Station for Mathematical Innovation and Discovery
Date Issued	2017-09-21T14:00
Description	We study the enumeration of three friendly directed walks on the square lattice. We show how one can count different types of shared sites (interactions) by solving the associated functional equations using the obstinate kernel method. However, we also highlight that the introduction of finer counting problems that introduce asymmetry can lead to as yet unsolvable functional equations. We survey related results over the past few years counting extra features in multiple path problems.
Extent	56 minutes
Subject	Mathematics; Combinatorics; Sequences, series, summability; Discrete mathematics
Type	Moving Image
File Format	video/mp4
Language	eng
Notes	Author affiliation: The University of Melbourne
Series	BIRS Workshop Lecture Videos (Banff, Alta)
Date Available	2018-04-01
Provider	Vancouver : University of British Columbia Library
Rights	Attribution-NonCommercial-NoDerivatives 4.0 International
DOI	10.14288/1.0364606
URI	http://hdl.handle.net/2429/65050
Affiliation	Non UBC
Peer Review Status	Unreviewed
Scholarly Level	Faculty
Rights URI	http://creativecommons.org/licenses/by-nc-nd/4.0/
Aggregated Source Repository	DSpace

Open Collections

BIRS Workshop Lecture Videos