20 citations · 35 across the 15 of their papers we have counts for
12 papers · 1 filter
The Loopy Polynomial: from Tutte's Universal -Function to Bizonotopal Geometry
Anatol Kirillov, Gleb Nenashev, Boris Shapiro +1
We study the loopy polynomial L_G, a multivariate graph invariant arising from bizonotopal graphical algebras and defined by deletion and loopy contraction, in which the contracted…
Repeatable patterns and the maximum multiplicity of a generator in a reduced word
Christian Gaetz, Yibo Gao, Pakawut Jiradilok +2
We study the maximum multiplicity of a simple transposition in a reduced word for the longest permutation , a…
Differential operators on Schur and Schubert polynomials
Gleb Nenashev
This paper deals with decreasing operators on back stable Schubert polynomials. We study two operators and of degree , which satisfy the Leibniz rule. Furthermore,…
Classification of external Zonotopal algebras
Gleb Nenashev
In this paper we work with power algebras associated to hyperplane arrangements. There are three main types of these algebras, namely, external, central, and internal zonotopal alg…
Trianguloids and Triangulations of Root Polytopes
Pavel Galashin, Gleb Nenashev, Alexander Postnikov
Triangulations of a product of two simplices and, more generally, of root polytopes are closely related to Gelfand-Kapranov-Zelevinsky's theory of discriminants, to tropical geomet…
On -deformations of Postnikov-Shapiro algebras
Anatol N. Kirillov, Gleb Nenashev
For any given loopless graph , we introduce - deformations of its Postnikov-Shapiro algebras counting spanning trees, counting spanning forests and - deformations of int…
"K-theoretic" analog of Postnikov-Shapiro algebra distinguishes graphs
G. Nenashev, B. Shapiro
In this paper we study a filtered "K-theoretical" analog of a graded algebra associated to any loopless graph G which was introduced in \cite{PS}. We show that two such filtered al…
Postnikov-Shapiro Algebras, Graphical Matroids and their generalizations
Gleb Nenashev
In this paper we consider the original and different generalizations of Postnikov-Shapiro algebra which enumerate forests and trees of graphs, see~\cite{PSh}. Our main result is th…
On commutative algebra associated to -labeled subforests of a graph
Gleb Nenashev
For a given graph , we construct an associated commutative algebra, whose dimension is equal to the number of -labeled forests of . We show that the dimension of the -t…
A short proof of Kotzig's theorem
Gleb Nenashev
A new shortest proof of Kotzig's Theorem about graphs with unique perfect matching is presented in this paper. It is well known that Kotzig's theorem is a consequence of Yeo's Theo…
On existence of noncritical vertices in digraphs
G. V. Nenashev
Let be a strongly connected digraphs on vertices. A vertex of is noncritical, if the digraph is strongly connected. We prove, that if sum of the degrees…
An Upper bound on the chromatic number of circle graphs without
G. V. Nenashev
Let be a circle graph without clique on 4 vertices. We prove that the chromatic number of doesn't exceed 30.