On the Number of Fully Packed Loop Configurations with a Fixed Associated Matching
نویسندگان
چکیده
We show that the number of fully packed loop configurations corresponding to a matching with m nested arches is polynomial in m if m is large enough, thus essentially proving two conjectures by Zuber [Electronic J. Combin. 11(1) (2004), Article #R13].
منابع مشابه
Solving the tandem AGV network design problem using tabu search: Cases of maximum workload and workload balance with fixed and non-fixed number of loops
A tandem AGV configuration connects all cells of a manufacturing area by means of non-overlapping, sin-gle-vehicle closed loops. Each loop has at least one additional P/D station, provided as an interface between adjacent loops. This study describes the development of three tabu search algorithms for the design of tandem AGV systems. The first algorithm was developed based on the basic definiti...
متن کاملFrom Fully-Packed Loops to Meanders: Exact Exponents
We address the meander problem “enumerate all topologically inequivalent configurations of a closed nonselfintersecting plane curve intersecting a given line through a fixed number of points”. We show that meanders may be viewed as the configurations of a suitable fully-packed loop statistical model defined on a random surface. Using standard results relating critical singularities of a lattice...
متن کاملWieland Drift for Triangular Fully Packed Loop Configurations
Triangular fully packed loop configurations (TFPLs) emerged as auxiliary objects in the study of fully packed loop configurations on a square (FPLs) corresponding to link patterns with a large number of nested arches. Wieland gyration, on the other hand, was invented to show the rotational invariance of the numbers Aπ of FPLs corresponding to a given link pattern π. The focus of this article is...
متن کاملFully Packed Loop configurations in a triangle and Littlewood-Richardson coefficients
We are interested in Fully Packed Loops in a triangle (TFPLs), as introduced by Caselli at al. and studied by Thapper. We show that for Fully Packed Loops with a fixed link pattern (refined FPL), there exist linear recurrence relations with coefficients computed from TFPL configurations. We then give constraints and enumeration results for certain classes of TFPL configurations. For special bou...
متن کاملTriangular Fully Packed Loop Configurations of Excess 2
Triangular fully packed loop configurations (TFPLs) came up in the study of fully packed loop configurations on a square (FPLs) corresponding to link patterns with a large number of nested arches. To a TFPL is assigned a triple (u, v;w) of 01-words encoding its boundary conditions that must necessarily satisfy d(u) + d(v) 6 d(w), where d(u) denotes the number of inversions in u. Wieland gyratio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electr. J. Comb.
دوره 11 شماره
صفحات -
تاریخ انتشار 2005