Impacts of Covid-19 mode shift on road traffic

This article is driven by the following question: as the communities reopen after the COVID-19 pandemic, will changing transportation mode share lead to worse traffic than before? This question could be critical especially if many people rush to single occupancy vehicles. To this end, we estimate how congestion will increases as the number of cars increase on the road, and identify the most sensitive cites to drop in transit usage. Travel time and mode share data from the American Community Survey of the US Census Bureau, for metro areas across the US. A BPR model is used to relate average travel times to the estimated number of commuters traveling by car. We then evaluate increased vehicle volumes on the road if different portions of transit and car pool users switch to single-occupancy vehicles, and report the resulting travel time from the BPR model. The scenarios predict that cities with large transit ridership are at risk for extreme traffic unless transit systems can resume safe, high throughput operations quickly.Comment: 14 pages, 11 figure

The Method of Combinatorial Telescoping

We present a method for proving q-series identities by combinatorial telescoping, in the sense that one can transform a bijection or a classification of combinatorial objects into a telescoping relation. We shall illustrate this method by giving a combinatorial proof of Watson's identity which implies the Rogers-Ramanujan identities.Comment: 11 pages, 5 figures; to appear in J. Combin. Theory Ser.

Applicability of the qq-Analogue of Zeilberger's Algorithm

The applicability or terminating condition for the ordinary case of Zeilberger's algorithm was recently obtained by Abramov. For the $q$-analogue, the question of whether a bivariate $q$-hypergeometric term has a $qZ$-pair remains open. Le has found a solution to this problem when the given bivariate $q$-hypergeometric term is a rational function in certain powers of $q$. We solve the problem for the general case by giving a characterization of bivariate $q$-hypergeometric terms for which the $q$-analogue of Zeilberger's algorithm terminates. Moreover, we give an algorithm to determine whether a bivariate $q$-hypergeometric term has a $qZ$-pair.Comment: 15 page

The Abel-Zeilberger Algorithm

We use both Abel's lemma on summation by parts and Zeilberger's algorithm to find recurrence relations for definite summations. The role of Abel's lemma can be extended to the case of linear difference operators with polynomial coefficients. This approach can be used to verify and discover identities involving harmonic numbers and derangement numbers. As examples, we use the Abel-Zeilberger algorithm to prove the Paule-Schneider identities, the Apery-Schmidt-Strehl identity, Calkin's identity and some identities involving Fibonacci numbers.Comment: 18 page

A Telescoping method for Double Summations

We present a method to prove hypergeometric double summation identities. Given a hypergeometric term $F(n,i,j)$, we aim to find a difference operator $L=a_0(n) N^0 + a_1(n) N^1 +...+a_r(n) N^r$ and rational functions $R_1(n,i,j),R_2(n,i,j)$ such that $L F = \Delta_i (R_1 F) + \Delta_j (R_2 F)$. Based on simple divisibility considerations, we show that the denominators of $R_1$ and $R_2$ must possess certain factors which can be computed from $F(n, i,j)$. Using these factors as estimates, we may find the numerators of $R_1$ and $R_2$ by guessing the upper bounds of the degrees and solving systems of linear equations. Our method is valid for the Andrews-Paule identity, Carlitz's identities, the Ap\'ery-Schmidt-Strehl identity, the Graham-Knuth-Patashnik identity, and the Petkov\v{s}ek-Wilf-Zeilberger identity.Comment: 22 pages. to appear in J. Computational and Applied Mathematic