COMBINATORICS 2000

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed COMBINATORICS-2000 Paper

click to vote

COMBINATORICS
2000

142views more COMBINATORICS 2000»

Harmonic Functions on Multiplicative Graphs and Interpolation Polynomials

13 years 6 months ago

Download www.combinatorics.org

We construct examples of nonnegative harmonic functions on certain graded graphs: the Young lattice and its generalizations. Such functions first emerged in harmonic analysis on th...

Alexei Borodin, Grigori Olshanski

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	142	Harmonic Functions on Multiplicative Graphs and Interpolation Polynomials	claim
2	138	Quasi-Spectral Characterization of Strongly Distance-Regular Graphs	claim
3	129	Combinatorial statistics on type-B analogues of noncrossing partitions and restricted permutations	claim
4	128	Continued Fractions and Catalan Problems	claim
5	124	Colouring Planar Mixed Hypergraphs	claim
6	120	The Characteristic Polynomial of a Graph is Reconstructible from the Characteristic Polynomials of its Vertex-Deleted Subgraphs and Their Complements	claim
7	114	Restricted Permutations, Continued Fractions, and Chebyshev Polynomials	claim
8	114	Trees and Matchings	claim
9	112	A Note on Random Minimum Length Spanning Trees	claim
10	107	Counting Pattern-free Set Partitions II: Noncrossing and Other Hypergraphs	claim
11	103	The Action of the Symmetric Group on a Generalized Partition Semilattice	claim
12	101	Random Sampling of Labeled Tournaments	claim
13	101	Bound Graph Polysemy	claim
14	100	Separability Number and Schurity Number of Coherent Configurations	claim
15	97	Counting Lattice Paths by Narayana Polynomials	claim
16	96	Automorphisms and Enumeration of Switching Classes of Tournaments	claim
17	96	An Asymptotic Expansion for the Number of Permutations with a Certain Number of Inversions	claim
18	96	Bijections for Hook Pair Identities	claim
19	95	Improving Dense Packings of Equal Disks in a Square	claim
20	94	A Determinant of the Chudnovskys Generalizing the Elliptic Frobenius-Stickelberger-Cauchy Determinantal Identity	claim
21	92	Asymptotics for the Probability of Connectedness and the Distribution of Number of Components	claim
22	92	The Hamiltonian p-Median Problem	claim
23	91	On Descents in Standard Young Tableaux	claim
24	91	A Construction Method for Complete Sets of Mutually Orthogonal Frequency Squares	claim
25	90	Determinantal Expression and Recursion for Jack Polynomials	claim
26	89	A Note on the Non-Colorability Threshold of a Random Graph	claim
27	89	Large Dihedral Symmetry of the Set of Alternating Sign Matrices	claim
28	88	Note on Sparse Random Graphs and Cover Graphs	claim
29	88	An Infinite Antichain of Permutations	claim
30	87	Symmetric Sum-Free Partitions and Lower Bounds for Schur Numbers	claim
31	86	Large Equiangular Sets of Lines in Euclidean Space	claim
32	85	Parity Systems and the Delta-Matroid Intersection Problem	claim
33	85	Inequality Related to Vizing's Conjecture	claim
34	84	A Note on the Asymptotic Behavior of the Heights in b-Tries for b Large	claim
35	82	When Structures Are Almost Surely Connected	claim
36	82	The Strongly Regular (40, 12, 2, 4) Graphs	claim
37	81	Interchangeability of Relevant Cycles in Graphs	claim
38	79	Some Bijective Correspondences Involving Domino Tableaux	claim
39	78	Two New Extensions of the Hales-Jewett Theorem	claim
40	76	Linear Codes over Finite Chain Rings	claim
41	75	Franklin's Argument Proves an Identity of Zagier	claim
42	74	Frequency Squares and Affine Designs	claim
43	73	On the Twin Designs with the Ionin-type Parameters	claim
44	73	Note on Gy. Elekes's Conjectures Concerning Unavoidable Patterns in Proper Colorings	claim
45	72	Tournament Sequences and Meeussen Sequences	claim
46	71	Diagonal Checker-jumping and Eulerian Numbers for Color-signed Permutations	claim
47	71	Low Rank Co-Diagonal Matrices and Ramsey Graphs	claim
48	63	A Ramsey Treatment of Symmetry	claim
49	63	Some Pairwise Balanced Designs	claim
50	62	Min-Wise Independent Linear Permutations	claim
51	61	Where the Typical Set Partitions Meet and Join	claim
52	58	Constrained Graph Processes	claim
53	56	Linear Discrepancy of Basic Totally Unimodular Matrices	claim
54	54	Online Coloring Known Graphs	claim
55	49	A Short Proof of a Partition Relation for Triples	claim
56	47	Resolving Triple Systems into Regular Configurations	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers