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
PDF Tools
Image Tools
Text Tools
OCR Tools
Symbol and Emoji Tools
On-screen Keyboard
Latex Math Equation to Image
Smart IPA Phonetic Keyboard
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
2
search results - page 1 / 1
»
An Answer to a Question by Wilf on Packing Distinct Patterns...
Sort
relevance
views
votes
recent
update
View
thumb
title
123
click to vote
COMBINATORICS
2004
105
views
more
COMBINATORICS 2004
»
An Answer to a Question by Wilf on Packing Distinct Patterns in a Permutation
15 years 3 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 »
132
click to vote
CPC
2000
58
views
more
CPC 2000
»
Packing Ferrers Shapes
15 years 3 months ago
Download
www.cs.tau.ac.il
Answering a question of Wilf, we show that if n is sufficiently large, then one cannot cover an n
Noga Alon, Miklós Bóna, Joel Spencer
claim paper
Read More »
« Prev
« First
page 1 / 1
Last »
Next »