DMTCS 2003 | Sciweavers

36

DMTCS
2008

80views Mathematics» more DMTCS 2008»

Counting Descents, Rises, and Levels, with Prescribed First Element, in Words

14 years 26 days ago

Recently, Kitaev and Remmel [8] refined the well-known permutation statistic "descent" by fixing parity of one of the descent's numbers. Results in [8] were extende...

Sergey Kitaev, Toufik Mansour, Jeffrey B. Remmel

claim paper

Read More »

32

click to vote

DMTCS
2008

59views Mathematics» more DMTCS 2008»

Spanning Forests on the Sierpinski Gasket

14 years 1 months ago

Download www.phys.ncue.edu.tw

Shu-Chiuan Chang, Lung-Chi Chen

claim paper

Read More »

38

click to vote

DMTCS
2007

73views Mathematics» more DMTCS 2007»

"Trivializing" Generalizations of some Izergin-Korepin-type Determinants

14 years 2 months ago

Download www.math.rutgers.edu

We generalize (and hence trivialize and routinize) numerous explicit evaluations of determinants and pfaﬃans due to Kuperberg, as well as a determinant of Tsuchiya. The level of ...

Tewodros Amdeberhan, Doron Zeilberger

claim paper

Read More »

31

click to vote

DMTCS
2007

99views Mathematics» more DMTCS 2007»

Latin Square Thue-Morse Sequences are Overlap-Free

14 years 2 months ago

Download www.math.vt.edu

We deﬁne a morphism based upon a Latin square that generalizes the Thue-Morse morphism. We prove that ﬁxed points of this morphism are overlap-free sequences, generalizing resu...

Christopher Robinson Tompkins

claim paper

Read More »

42

click to vote

DMTCS
2007

100views Mathematics» more DMTCS 2007»

On the Critical Exponent of Generalized Thue-Morse Words

14 years 2 months ago

Download www.crm.umontreal.ca

Alexandre Blondin Massé, Srecko Brlek, Amy ...

claim paper

Read More »

37

click to vote

DMTCS
2007

74views Mathematics» more DMTCS 2007»

Words and Bisimulations of Dynamical Systems

14 years 2 months ago

Download math.umh.ac.be

In this paper we study bisimulations on dynamical systems through a given partition. Our aim is to give a new vision of the notion of bisimulation by using words. To achieve this g...

Thomas Brihaye

claim paper

Read More »

32

click to vote

DMTCS
2007

49views Mathematics» more DMTCS 2007»

Waiting Time Distributions for Pattern Occurrence in a Constrained Sequence

14 years 2 months ago

Download www.cs.purdue.edu

A binary sequence of zeros and ones is called a (d, k)-sequence if it does not contain runs of zeros of length either less than d or greater than k, where d and k are arbitrary, b...

Valery T. Stefanov, Wojciech Szpankowski

claim paper

Read More »

44

click to vote

DMTCS
2007

91views Mathematics» more DMTCS 2007»

Complexity Results on Graphs with Few Cliques

14 years 2 months ago

Download intractable.ca

Bill Rosgen, Lorna Stewart

claim paper