Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
134
search results - page 4 / 27
»
Combinatorics of diagrams of permutations
Sort
relevance
views
votes
recent
update
View
thumb
title
15
click to vote
COMBINATORICS
2006
83
views
more
COMBINATORICS 2006
»
A Permutation Regularity Lemma
13 years 9 months ago
Download
www.math.sc.edu
We introduce a permutation analogue of the celebrated Szemer
Joshua N. Cooper
claim paper
Read More »
24
click to vote
COMBINATORICS
2004
73
views
more
COMBINATORICS 2004
»
Minuscule Heaps over Dynkin Diagrams of Type A~
13 years 9 months ago
Download
www.emis.de
Manabu Hagiwara
claim paper
Read More »
24
click to vote
COMBINATORICS
2002
83
views
more
COMBINATORICS 2002
»
The Minimum Number of Monotone Subsequences
13 years 9 months ago
Download
www.combinatorics.org
Erdos and Szekeres showed that any permutation of length n k2 + 1 contains
Joseph Samuel Myers
claim paper
Read More »
18
click to vote
COMBINATORICS
2004
105
views
more
COMBINATORICS 2004
»
An Answer to a Question by Wilf on Packing Distinct Patterns in a Permutation
13 years 9 months ago
Download
www.combinatorics.org
We present a class of permutations for which the number of distinctly ordered subsequences of each permutation approaches an almost optimal value as the length of the permutation ...
Micah Coleman
claim paper
Read More »
10
click to vote
COMBINATORICS
2002
80
views
more
COMBINATORICS 2002
»
321-Polygon-Avoiding Permutations and Chebyshev Polynomials
13 years 9 months ago
Download
www.combinatorics.org
A 321-k-gon-avoiding permutation avoids 321 and the following four patterns: k(k + 2)(k + 3)
Toufik Mansour, Zvezdelina Stankova
claim paper
Read More »
« Prev
« First
page 4 / 27
Last »
Next »