Related papers: Representing polynomial of ST-CONNECTIVITY

The A-polynomial is a knot invariant related to the space of $SL_2(\mathbb{C})$ representations of the knot group. In this paper our interests lies in the logarithmic Gauss map of the A-polynomial. We develop a homological point of view on…

Motivated by the definition of the edge elimination polynomial of a graph we define the covered components polynomial counting spanning subgraphs with respect to their number of components, edges and covered components. We prove a…

Knot polynomials colored with symmetric representations of $SL_q(N)$ satisfy difference equations as functions of representation parameter, which look like quantization of classical ${\cal A}$-polynomials. However, they are quite difficult…

We prove a result on the representation of squares by second degree polynomials in the field of $p$-adic meromorphic functions in order to solve positively B\"uchi's $n$ squares problem in this field (that is, the problem of the existence…

Let T be a topology on the finite set Xn. We consider the open polynomial associated with the topology T. Its coefficients are the cardinality of open sets of size j=0,...,n. J. Brown [4] asked when this polynomial has only real zeros. We…

We present higher order polynomial algebras which are the dynamical symmetry algebras of a wide class of multi-mode boson systems in non-linear optics. We construct their unitary representations and the corresponding single-variable…

If a knot is represented by an m-strand braid, then HOMFLY polynomial in representation R is a sum over characters in all representations Q\in R^{\otimes m}. Coefficients in this sum are traces of products of quantum R-matrices along the…

The chromatic polynomial $P(G,x)$ of a graph $G$ of order $n$ can be expressed as $\sum\limits_{i=1}^n(-1)^{n-i}a_{i}x^i$, where $a_i$ is interpreted as the number of broken-cycle free spanning subgraphs of $G$ with exactly $i$ components.…

First, we extend Otal's result for the trivial knot to trivial spatial graphs, namely, we show that for any bridge tangle decomposing sphere $S^2$ for a trivial spatial graph $\Gamma$, there exists a 2-sphere $F$ such that $F$ contains…

Our aim is to bring the theory of analogous polytopes to bear on the study of quasitoric manifolds, in the context of stably complex manifolds with compatible torus action. By way of application, we give an explicit construction of a…

We consider multilinear Littlewood polynomials, polynomials in $n$ variables in which a specified set of monomials $U$ have $\pm 1$ coefficients, and all other coefficients are $0$. We provide upper and lower bounds (which are close for $U$…

Semialgebraic graphs are graphs whose vertices are points in $\mathbb{R}^d$, and adjacency between two vertices is determined by the truth value of a semialgebraic predicate of constant complexity. We show how to harness polynomial…

Let $P\subset\mathbb R^n$ be a convex polytope and let $\ell$ be a linear functional which is nonconstant on every edge of $P$. The induced acyclic orientation determines positive and negative Bia{\l}ynicki-Birula type partitions of $P$…

In this paper, we show that the solution to a large class of "tiling" problems is given by a polynomial sequence of binomial type. More specifically, we show that the number of ways to place a fixed set of polyominos on an $n\times n$…

A partition polynomial is a refinement of the partition number p(n) whose coefficients count some special partition statistic. Just as partition numbers have useful asymptotics so do partition polynomials. In fact, their asymptotics…

A finite dimensional operator that commutes with some symmetry group admits quotient operators, which are determined by the choice of associated representation. Taking the quotient isolates the part of the spectrum supporting the chosen…

The independence polynomial $I(G, x)$ of a graph $G$ is the polynomial in variable $x$ in which the coefficient $a_n$ on $x^n$ gives the number of independent subsets $S \subseteq V(G)$ of vertices of $G$ such that $|S| = n$. $I(G, x)$ is…

We study learnable logic gate networks that stack layers of 2-input Boolean gates to build combinational circuits. Every 2-input gate has a unique multilinear polynomial with 4 coefficients, so the 16 Boolean gates form a codebook of…

We study the problem of deterministic approximate counting of matchings and independent sets in graphs of bounded connective constant. More generally, we consider the problem of evaluating the partition functions of the monomer-dimer model…

Considering commutator monomials of the non-commutative associative variables $X_1,\ldots,X_n$; we determine the maximal possible number of alternating associative monomials in their noncommutative polynomial expansions. This is achieved by…