Results 1 to 10 of about 569 (30)
Homological and combinatorial aspects of virtually Cohen–Macaulay sheaves
Transactions of the London Mathematical Society, 2021 When studying a graded module M over the Cox ring of a smooth projective toric variety X, there are two standard types of resolutions commonly used to glean information: free resolutions of M and vector bundle resolutions of its sheafification.
Christine Berkesch +3 more
doaj +1 more source
A note on minimal resolutions of vector–spread Borel ideals
Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2023 We consider vector–spread Borel ideals. We show that these ideals have linear quotients and thereby we determine the graded Betti numbers and the bigraded Poincaré series.
Crupi Marilena, Ficarra Antonino
doaj +1 more source
On applications of bipartite graph associated with algebraic structures
Open Mathematics, 2020 The latest developments in algebra and graph theory allow us to ask a natural question, what is the application in real world of this graph associated with some mathematical system? Groups can be used to construct new non-associative algebraic structures,
Zhang Xiujun +3 more
doaj +1 more source
THE POLYTABLOID BASIS EXPANDS POSITIVELY INTO THE WEB BASIS
Forum of Mathematics, Sigma, 2019 We show that the transition matrix from the polytabloid basis to the web basis of the irreducible $\mathfrak{S}_{2n}$-representation of shape $(n,n)$ has nonnegative integer entries. This proves a conjecture of Russell and Tymoczko [Int. Math. Res. Not.,
BRENDON RHOADES
doaj +1 more source
On the binomial edge ideals of block graphs
Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2016 We find a class of block graphs whose binomial edge ideals have minimal regularity. As a consequence, we characterize the trees whose binomial edge ideals have minimal regularity.
Chaudhry Faryal +2 more
doaj +1 more source
Algebraic properties of the binomial edge ideal of a complete bipartite graph
Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2014 Let JG denote the binomial edge ideal of a connected undirected graph on n vertices. This is the ideal generated by the binomials xiyj − xjyi, 1 ≤ i < j≤ n, in the polynomial ring S = K[x1, . . . , xn, y1, . . . , yn] where {i, j} is an edge of G.
Schenzel Peter, Zafar Sohail
doaj +1 more source
Some extensions of Alon's Nullstellensatz [PDF]
, 2011 Alon's combinatorial Nullstellensatz, and in particular the resulting nonvanishing criterion is one of the most powerful algebraic tools in combinatorics, with many important applications.
Kós, Géza +2 more
core +1 more source
On sortable intervals of monomials
Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2016 In 1996, in his study of Gröbner bases of toric ideals, Sturmfels introduced a sorting operator on pairs of monomials of degree d in n variables. This gave rise to the notion of sortable sets, namely sets B of monomials of degree d such that B×B is ...
Bonanzinga Vittoria, Eliahou Shalom
doaj +1 more source
f-vectors implying vertex decomposability [PDF]
, 2012 We prove that if a pure simplicial complex of dimension d with n facets has the least possible number of (d-1)-dimensional faces among all complexes with n faces of dimension d, then it is vertex decomposable. This answers a question of J.
Lasoń, Michał
core +2 more sources
A note on the asymptotics of the number of O-sequences of given length
, 2019 We look at the number $L(n)$ of $O$-sequences of length $n$. Recall that an $O$-sequence can be defined algebraically as the Hilbert function of a standard graded $k$-algebra, or combinatorially as the $f$-vector of a multicomplex.
Stanley, Richard P., Zanello, Fabrizio
core +1 more source