#### Filter Results:

- Full text PDF available (4)

#### Publication Year

2011

2014

- This year (0)
- Last 5 years (3)
- Last 10 years (4)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Eric Chen, Dennis Tseng
- Finite Fields and Their Applications
- 2013

We answer a question by Niederreiter concerning the enumeration of a class of subspaces of finite dimensional vector spaces over finite fields by proving a conjecture by Ghorpade and Ram.

- Dennis Tseng
- 2012

Given a graph covering, there is an induced surjection of critical groups. We will try to determine the structure of the kernel and give results at different levels of generality. A main tool will be dualizing the short exact sequence and working instead with the cokernel. In the case of signed graphs and two-sheeted coverings, we will show that the kernel… (More)

- Victor Reiner, Dennis Tseng
- Discrete Mathematics
- 2014

Graph coverings are known to induce surjections of their critical groups. Here we describe the kernels of these morphisms in terms of data parametrizing the covering. Regular coverings are parametrized by voltage graphs, and the above kernel can be identified with a naturally defined voltage graph critical group. For double covers, the voltage graph is a… (More)

- Dennis Tseng
- 2011

Let the sequence Sm of nonnegative integers be generated by the following conditions. Set the first term a0 = 0, and for all k ≥ 0, let ak+1 be the least integer greater than ak such that no element of {a0, . . . , ak+1} is the average of m − 1 distinct other elements. Szekeres gave a closed-form description of S3 in 1936, and Layman provided a similar… (More)

- ‹
- 1
- ›