29 search results - page 6 / 6 » Counting 1324-Avoiding Permutations |
COMBINATORICS
1998
13 years 4 months ago
1998
We show that the moments of the trace of a random unitary matrix have combinatorial interpretations in terms of longest increasing subsequences of permutations. To be precise, we s...
COMBINATORICS
2002
13 years 4 months ago
2002
: We generalize the notion of pattern avoidance to arbitrary functions on ordered sets, and consider specifically three scenarios for permutations: linear, cyclic and hybrid, the f...
RSA
2010
13 years 2 months ago
2010
We study here the spectra of random lifts of graphs. Let G be a finite connected graph, and let the infinite tree T be its universal cover space. If λ1 and ρ are the spectral ...
ESORICS
2003
Springer
13 years 9 months ago
2003
Springer
Recently, David Chaum proposed an electronic voting scheme that combines visual cryptography and digital processing. It was designed to meet not only mathematical security standard...