Related papers: Partial-dual genus polynomial as a weight system
In a recent paper Zhuoke Yang, New approaches to ${\mathfrak gl}(N)$ weight system, Izvestiya Mathematics, 2023, vol. 77:6, 150--166; arXiv:2202.12225 (2022) a construction of a weight system, which unifies ${\mathfrak gl}(N)$ weight…
We prove a constant term theorem which is useful for finding weight polynomials for Ballot/Motzkin paths in a strip with a fixed number of arbitrary `decorated' weights as well as an arbitrary `background' weight. Our CT theorem, like…
We show that certain weighted Fibonacci and Lucas series can always be expressed as linear combinations of polylogarithms. In some special cases we evaluate the series in terms of Bernoulli polynomials, making use of the connection between…
Permutation equivariant neural networks are often constructed using tensor powers of $\mathbb{R}^{n}$ as their layer spaces. We show that all of the weight matrices that appear in these neural networks can be obtained from Schur-Weyl…
We describe fast algorithms for approximating the connection coefficients between a family of orthogonal polynomials and another family with a polynomially or rationally modified measure. The connection coefficients are computed via…
We construct an action of a polynomial ring on the colored sl(2) link homology of Cooper-Krushkal, over which this homology is finitely generated. We define a new, related link homology which is finite dimensional, extends to tangles, and…
The p-adic valuation of a polynomial can be given by its valuation tree. This work describes the 2-adic valuation tree of the general degree 2 polynomial in 2 variables.
It is proved that the associative differential graded algebra of (polynomial) polyvector fields on a vector space (may be infinite- dimensional) is quasi-isomorphic to the corresponding cohomological Hochschild complex of (polynomial)…
We express the colored Jones polynomial as the inverse of the quantum determinant of a matrix with entries in the $q$-Weyl algebra of $q$-operators, evaluated at the trivial function (plus simple substitutions). The Kashaev invariant is…
We prove that a family of average weights for oscillating tableaux are polynomials in two variables, namely, the length of the oscillating tableau and the size of the ending partition, which generalizes a result of Hopkins and Zhang.…
It is known that a graph isomorphism testing algorithm is polynomially equivalent to a detecting of a graph non-trivial automorphism algorithm. The polynomiality of the latter algorithm, is obtained by consideration of symmetry properties…
We prove that if a finite order knot invariant does not distinguish mutant knots, then the corresponding weight system depends on the intersection graph of a chord diagram rather than on the diagram itself. The converse statement is easy…
The method of partial derivatives is one of the most successful lower bound methods for arithmetic circuits. It uses as a complexity measure the dimension of the span of the partial derivatives of a polynomial. In this paper, we consider…
We describe the integral equivariant cohomology ring of a weighted projective space in terms of piecewise polynomials, and thence by generators and relations. We deduce that the ring is a perfect invariant, and prove a Chern class formula…
A polynomial algorithm for graphs' isomorphism testing is constructed in assumption that there exists a corresponding polynomial algorithm for graphs with trivial automorphism group.
Binomial Cayley graphs are obtained by considering the binomial coefficient of the weight function of a given Cayley graph and a natural number. We introduce these objects and study two families: one associated with symmetric groups and the…
In this work, we study the interlace polynomial as a generalization of a graph invariant to delta-matroids. We prove that the interlace polynomial satisfies the four-term relation for delta-matroids and determines thus a finite type…
Although NP-Complete problems are the most difficult decisional problems, it is possible to discover in them polynomial (or easy) observables. We study the Graph Partitioning Problem showing that it is possible to recognize in it two…
In this paper, we build on the biquasiles and dual graph diagrams introduced in arXiv:1610.06969. We introduce \textit{biquasile Boltzmann weights} that enhance the previous knot coloring invariant defined in terms of finite biquasiles and…
We generalize the notion of the quandle polynomial to the case of singquandles. We show that the singquandle polynomial is an invariant of finite singquandles. We also construct a singular link invariant from the singquandle polynomial and…