اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدCombinatorial Stokes formulas via minimal resolutions
130
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We describe an explicit chain map from the standard resolution to the minimal resolution for the finite cyclic group Z_k of order k. We then demonstrate how such a chain map induces a Z_k-combinatorial Stokes theorem, which in turn implies Dolds theorem that there is no equivariant map from an n-connected to an n-dimensional free Z_k-complex. Thus we build a combinatorial access road to problems in combinatorics and discrete geometry that have previously been treated with methods from equivariant topology. The special case k=2 for this is classical; it involves Tuckers (1949) combinatorial lemma which implies the Borsuk-Ulam theorem, its proof via chain complexes by Lefschetz (1949), the combinatorial Stokes formula of Fan (1967), and Meuniers work (2006).
قيم البحث
اقرأ أيضاً
An explicit combinatorial minimal free resolution of an arbitrary monomial ideal $I$ in a polynomial ring in $n$ variables over a field of characteristic $0$ is defined canonically, without any choices, using higher-dimensional generalizations of com
bined spanning trees for cycles and cocycles (hedges) in the upper Koszul simplicial complexes of $I$ at lattice points in $mathbb{Z}^n$. The differentials in these sylvan resolutions are expressed as matrices whose entries are sums over lattice paths of weights determined combinatorially by sequences of hedges (hedgerows) along each lattice path. This combinatorics enters via an explicit matroidal expression for the Moore-Penrose pseudoinverses of the differentials in any CW complex as weighted averages of splittings defined by hedges. This Hedge Formula also yields a projection formula from CW chains to boundaries. The translation from Moore-Penrose combinatorics to free resolutions relies on Wall complexes, which construct minimal free resolutions of graded ideals from vertical splittings of Koszul bicomplexes. The algebra of Wall complexes applied to individual hedgerows yields explicit but noncanonical combinatorial minimal free resolutions of arbitrary monomial ideals in any characteristic.
The notion of a contractible transformation on a graph was introduced by Ivashchenko as a means to study molecular spaces arising from digital topology and computer image analysis, and more recently has been applied to topological data analysis. Cont
ractible transformations involve a list of four elementary moves that can be performed on the vertices and edges of a graph, and it has been shown by Chen, Yau, and Yeh that these moves preserve the simple homotopy type of the underlying clique complex. A graph is said to be ${mathcal I}$-contractible if one can reduce it to a single isolated vertex via a sequence of contractible transformations. Inspired by the notions of collapsible and non-evasive simplicial complexes, in this paper we study certain subclasses of ${mathcal I}$-contractible graphs where one can collapse to a vertex using only a subset of these moves. Our main results involve constructions of minimal examples of graphs for which the resulting classes differ, as well as a miminal counterexample to an erroneous claim of Ivashchenko from the literature. We also relate these classes of graphs to the notion of $k$-dismantlable graphs and $k$-collapsible complexes, and discuss some open questions.
Motivated by questions of Mulmuley and Stanley we investigate quasi-polynomials arising in formulas for plethysm. We demonstrate, on the examples of $S^3(S^k)$ and $S^k(S^3)$, that these need not be counting functions of inhomogeneous polytopes of di
mension equal to the degree of the quasi-polynomial. It follows that these functions are not, in general, counting functions of lattice points in any scaled convex bodies, even when restricted to single rays. Our results also apply to special rectangular Kronecker coefficients.
Let $A$ be a semigroup whose only invertible element is 0. For an $A$-homogeneous ideal we discuss the notions of simple $i$-syzygies and simple minimal free resolutions of $R/I$. When $I$ is a lattice ideal, the simple 0-syzygies of $R/I$ are the bi
nomials in $I$. We show that for an appropriate choice of bases every $A$-homogeneous minimal free resolution of $R/I$ is simple. We introduce the gcd-complex $D_{gcd}(bf b)$ for a degree $mathbf{b}in A$. We show that the homology of $D_{gcd}(bf b)$ determines the $i$-Betti numbers of degree $bf b$. We discuss the notion of an indispensable complex of $R/I$. We show that the Koszul complex of a complete intersection lattice ideal $I$ is the indispensable resolution of $R/I$ when the $A$-degrees of the elements of the generating $R$-sequence are incomparable.
Convex geometries (Edelman and Jamison, 1985) are finite combinatorial structures dual to union-closed antimatroids or learning spaces. We define an operation of resolution for convex geometries, which replaces each element of a base convex geometry
by a fiber convex geometry. Contrary to what happens for similar constructions -- compounds of hypergraphs, as in Chein, Habib and Maurer (1981), and compositions of set systems, as in Mohring and Radermacher (1984) -- , resolutions of convex geometries always yield a convex geometry. We investigate resolutions of special convex geometries: ordinal and affine. A resolution of ordinal convex geometries is again ordinal, but a resolution of affine convex geometries may fail to be affine. A notion of primitivity, which generalize the corresponding notion for posets, arises from resolutions: a convex geometry is primitive if it is not a resolution of smaller ones. We obtain a characterization of affine convex geometries that are primitive, and compute the number of primitive convex geometries on at most four elements. Several open problems are listed.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
