اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدFace rings of cycles, associahedra, and standard Young tableaux
112
0
0.0
(
0
)
تأليف
Anton Dochtermann
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We show that J_n, the Stanley-Reisner ideal of the n-cycle, has a free resolution supported on the (n-3)-dimensional simplicial associahedron A_n. This resolution is not minimal for n > 5; in this case the Betti numbers of J_n are strictly smaller than the f-vector of A_n. We show that in fact the Betti numbers of J_n are in bijection with the number of standard Young tableaux of shape (d+1, 2, 1^{n-d-3}). This complements the fact that the number of (d-1)-dimensional faces of A_n are given by the number of standard Young tableaux of (super)shape (d+1, d+1, 1^{n-d-3}); a bijective proof of this result was first provided by Stanley. An application of discrete Morse theory yields a cellular resolution of J_n that we show is minimal at the first syzygy. We furthermore exhibit a simple involution on the set of associahedron tableaux with fixed points given by the Betti tableaux, suggesting a Morse matching and in particular a poset structure on these objects.
قيم البحث
اقرأ أيضاً
In this paper, we propose a notion of colored Motzkin paths and establish a bijection between the $n$-cell standard Young tableaux (SYT) of bounded height and the colored Motzkin paths of length $n$. This result not only gives a lattice path interpre
tation of the standard Young tableaux but also reveals an unexpected intrinsic relation between the set of SYTs with at most $2d+1$ rows and the set of SYTs with at most 2d rows.
Let $mathcal{T}_3$ be the three-rowed strip. Recently Regev conjectured that the number of standard Young tableaux with $n-3$ entries in the skew three-rowed strip $mathcal{T}_3 / (2,1,0)$ is $m_{n-1}-m_{n-3}$, a difference of two Motzkin numbers. Th
is conjecture, together with hundreds of similar identities, were derived automatically and proved rigorously by Zeilberger via his powerful program and WZ method. It appears that each one is a linear combination of Motzkin numbers with constant coefficients. In this paper we will introduce a simple bijection between Motzkin paths and standard Young tableaux with at most three rows. With this bijection we answer Zeilbergers question affirmatively that there is a uniform way to construct bijective proofs for all of those identites.
This paper has two related parts. The first generalizes Hochsters formula on resolutions of Stanley-Reisner rings to a colorful version, applicable to any proper vertex-coloring of a simplicial complex. The second part examines a universal system of
parameters for Stanley-Reisner rings of simplicial complexes, and more generally, face rings of simplicial posets. These parameters have good properties, including being fixed under symmetries, and detecting depth of the face ring. Moreover, when resolving the face ring over these parameters, the shape is predicted, conjecturally, by the colorful Hochster formula.
This paper completely characterizes the standard Young tableaux that can be reconstructed from their sets or multisets of $1$-minors. In particular, any standard Young tableau with at least $5$ entries can be reconstructed from its set of $1$-minors.
We resolve a conjecture of Kalai asserting that the $g_2$-number of any simplicial complex $Delta$ that represents a connected normal pseudomanifold of dimension $dgeq 3$ is at least as large as ${d+2 choose 2}m(Delta)$, where $m(Delta)$ denotes the
minimum number of generators of the fundamental group of $Delta$. Furthermore, we prove that a weaker bound, $h_2(Delta)geq {d+1 choose 2}m(Delta)$, applies to any $d$-dimensional pure simplicial poset $Delta$ all of whose faces of co-dimension $geq 2$ have connected links. This generalizes a result of Klee. Finally, for a pure relative simplicial poset $Psi$ all of whose vertex links satisfy Serres condition $(S_r)$, we establish lower bounds on $h_1(Psi),ldots,h_r(Psi)$ in terms of the $mu$-numbers introduced by Bagchi and Datta.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
