Search Results - "Tasoulas, I"

Equivalence classes of ballot paths modulo strings of length 2 and 3 by Manes, K., Sapounakis, A., Tasoulas, I., Tsikouras, P.

“…Two paths are equivalent modulo a given string τ, whenever they have the same length and the positions of the occurrences of τ are the same in both paths. This…”
Get full text

Counting strings in Dyck paths by Sapounakis, A., Tasoulas, I., Tsikouras, P.

“…This paper deals with the enumeration of Dyck paths according to the statistic “number of occurrences of τ ”, for an arbitrary string τ . In this direction,…”
Get full text

Counting strings at height j in Dyck paths by Manes, K., Sapounakis, A., Tasoulas, I., Tsikouras, P.

“…Let τ be an arbitrary lattice path, called in this context string, consisting of two kinds of steps (rises and falls) and let j be a non-negative integer. In…”
Get full text

Enumeration of strings in Dyck paths: A bijective approach by Sapounakis, A., Tasoulas, I., Tsikouras, P.

“…The statistics concerning the number of appearances of a string τ in Dyck paths as well as its appearances in odd and even level have been studied extensively…”
Get full text

Ordered trees and the inorder traversal by Sapounakis, A., Tasoulas, I., Tsikouras, P.

“…In this paper ordered trees are studied with respect to the inorder traversal. New decompositions of ordered trees are introduced and used to obtain…”
Get full text

Hamiltonian Intervals in the Lattice of Binary Paths by Tasoulas, I., Manes, K., Sapounakis, A.

“…Let $\mathcal{P}_n$ be the set of all binary paths (i.e., lattice paths with upsteps $u = (1,1)$ and downsteps $d = (1,-1)$) of length $n$ endowed with the…”
Get full text

Nonleft peaks in Dyck paths: A combinatorial approach by Manes, K., Sapounakis, A., Tasoulas, I., Tsikouras, P.

“…A peak in a Dyck path is called nonleft, if the ascent preceding it is greater than or equal to the descent following it. In this paper, we present a…”
Get full text

Chains of binary paths and shifted tableaux by Manes, K, Tasoulas, I, Sapounakis, A, Tsikouras, P

“…In this paper, a natural bijection between multichains of binary paths and shifted tableaux is presented, and it is used for the enumeration of the chains with…”
Get full text

Chains with Small Intervals in the Lattice of Binary Paths by Tasoulas, I, Manes, K, Sapounakis, A, Tsikouras, P

“…We call an interval $[x,y]$ in a poset {\em small} if $y$ is the join of some elements covering $x$. In this paper, we study the chains of paths from a given…”
Get full text

The average number of times a stack exceeds a certain size by Manes, K., Tasoulas, I.

“…We obtain an explicit as well as an asymptotic formula for the average number of times a stack exceeds a fixed size j, after the execution of n push…”
Get full text

Equivalence classes of ballot paths modulo strings of length 2 and 3 by Manes, K, Sapounakis, A, Tasoulas, I, Tsikouras, P

“…Two paths are equivalent modulo a given string $\tau$, whenever they have the same length and the positions of the occurrences of $\tau$ are the same in both…”
Get full text