JCT 2011 - PDF Preprint Papers

JCT 2011

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed JCT-2011 Paper

click to vote

JCT
2011

141views more JCT 2011»

Bijections for Baxter families and related objects

12 years 11 months ago

Download www.math.tu-berlin.de

The Baxter number Bn can be written as Bn = n k=0 Θk,n−k−1 with Θk,ℓ = 2 (k + 1)2 (k + 2) k + ℓ k k + ℓ + 1 k k + ℓ + 2 k . These numbers have ﬁrst appeared in the...

Stefan Felsner, Éric Fusy, Marc Noy, David ...

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	141	Bijections for Baxter families and related objects	claim
2	128	The chromatic number of almost stable Kneser hypergraphs	claim
3	115	Sharp thresholds for hypergraph regressive Ramsey numbers	claim
4	108	The number of extreme points of tropical polyhedra	claim
5	106	Bounds for separating hash families	claim
6	104	Bounds for solid angles of lattices of rank three	claim
7	101	Almost all triple systems with independent neighborhoods are semi-bipartite	claim
8	100	On polynomial integrals over the orthogonal group	claim
9	97	The method of combinatorial telescoping	claim
10	93	A graph-theoretic approach to quasigroup cycle numbers	claim
11	91	On a generalisation of the Dipper-James-Murphy conjecture	claim
12	90	Extended Bressoud-Wei and Koike skew Schur function identities	claim
13	90	Small subgraphs in random graphs and the power of multiple choices	claim
14	89	On lines, joints, and incidences in three dimensions	claim
15	87	Chain enumeration of k-divisible noncrossing partitions of classical types	claim
16	86	Descendant-homogeneous digraphs	claim
17	86	Circumference of 3-connected claw-free graphs and large Eulerian subgraphs of 3-edge-connected graphs	claim
18	85	Substitution-closed pattern classes	claim
19	85	Relatively prime polynomials and nonsingular Hankel matrices over finite fields	claim
20	84	Explicit separating invariants for cyclic P-groups	claim
21	84	Enumerating isodiametric and isoperimetric polygons	claim
22	83	Sandpile groups and spanning trees of directed line graphs	claim
23	83	The weighted hook length formula	claim
24	78	The Max-Flow Min-Cut theorem for countable networks	claim
25	77	Hypercube orientations with only two in-degrees	claim
26	75	Dimensions of some binary codes arising from a conic in PG(2, q)	claim
27	75	The structure of almost all graphs in a hereditary property	claim
28	75	The group marriage problem	claim
29	74	Quasisymmetric Schur functions	claim
30	74	Basis theorems for continuous n-colorings	claim
31	71	Pseudograph associahedra	claim
32	67	A curious q-analogue of Hermite polynomials	claim
33	67	Inversion arrangements and Bruhat intervals	claim
34	66	Enumeration of non-crossing pairings on bit strings	claim
35	66	A chain theorem for internally 4-connected binary matroids	claim
36	62	Anti-lecture hall compositions and overpartitions	claim
37	60	A well-quasi-order for tournaments	claim
38	60	QSym over Sym has a stable basis	claim
39	58	Embedding a Latin square with transversal into a projective space	claim
40	57	Generalized Stirling permutations, families of increasing trees and urn models	claim
41	56	Twins of rayless graphs	claim
42	56	On the structure of 3-nets embedded in a projective plane	claim
43	55	A Pieri rule for skew shapes	claim
44	52	Laurent polynomials and Eulerian numbers	claim
45	52	New interpretations for noncrossing partitions of classical types	claim
46	49	Generalized Davenport-Schinzel sequences and their 0-1 matrix counterparts	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers