DM 2011 - PDF Preprint Papers

DM 2011

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed DM-2011 Paper

click to vote

DM
2011

318views Education» more DM 2011»

The Legendre-Stirling numbers

12 years 12 months ago

Download www.math.psu.edu

Abstract. The Legendre-Stirling numbers were discovered in 2002 as a result of a problem involving the spectral theory of powers of the classical second-order Legendre di¤erential...

George E. Andrews, Wolfgang Gawronski, Lance L. Li...

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	318	The Legendre-Stirling numbers	claim
2	273	The degree sequence of Fibonacci and Lucas cubes	claim
3	264	Connectivity threshold and recovery time in rank-based models for complex networks	claim
4	253	On the hyperbolicity constant in graphs	claim
5	249	Acyclic vertex coloring of graphs of maximum degree 5	claim
6	238	A combinatorial approach to height sequences in finite partially ordered sets	claim
7	228	The largest missing value in a composition of an integer	claim
8	223	On graph equivalences preserved under extensions	claim
9	211	A generalization of plexes of Latin squares	claim
10	209	Brun expansions of stepped surfaces	claim
11	208	Digraphs that have at most one walk of a given length with the same endpoints	claim
12	207	Diameter bounds for planar graphs	claim
13	202	Two-ended regular median graphs	claim
14	201	On permutations avoiding arithmetic progressions	claim
15	192	Coding discretizations of continuous functions	claim
16	192	Loose Hamilton cycles in hypergraphs	claim
17	191	Notes on lattice points of zonotopes and lattice-face polytopes	claim
18	188	Singletons and adjacencies of set partitions of type B	claim
19	186	When linear and weak discrepancy are equal	claim
20	184	Graphs of arbitrary excessive class	claim
21	180	Large cycles in 4-connected graphs	claim
22	178	Strongly regular graphs with non-trivial automorphisms	claim
23	158	A survey of homogeneous structures	claim
24	154	Hall-Littlewood polynomials, alcove walks, and fillings of Young diagrams	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers