Related papers: Representing polynomial of ST-CONNECTIVITY

Let $G$ be a simple graph of order $n$. The {\em domination polynomial} of $G$ is the polynomial ${D(G, x)=\sum_{i=0}^{n} d(G,i) x^{i}}$, where $d(G,i)$ is the number of dominating sets of $G$ of size $i$. Let $n$ be any positive integer…

The Heilmann-Lieb Theorem on (univariate) matching polynomials states that the polynomial $\sum_k m_k(G) y^k$ has only real nonpositive zeros, in which $m_k(G)$ is the number of $k$-edge matchings of a graph $G$. There is a stronger…

We describe a model $\mathcal{M}_3^{comb}$ for the boundary of the connectedness locus $\mathcal{M}^{sy}_3$ of the parameter space of cubic symmetric polynomials $p_c(z)=z^3-3c^2z$. We show that there exists a monotone continuous function…

We investigate, using the notion of linear quotients, significative classes of connected graphs whose monomial edge ideals, not necessarily squarefree, have linear resolution, in order to compute standard algebraic invariants of the…

The $M$-polynomial of a graph $G$ is defined as $\sum_{i\le j} m_{i,j}(G)x^iy^j$, where $m_{i,j}(G)$, $i,j\ge 1$, is the number of edges $uv$ of $G$ such that $\{d_v(G), d_u(G)\} = \{i,j\}$. Knowing the $M$-polynomial, formulas for bond…

Given a polynomial $x \in {\mathbb R}^n \mapsto p(x)$ in $n=2$ variables, a symbolic-numerical algorithm is first described for detecting whether the connected component of the plane sublevel set ${\mathcal P} = \{x : p(x) \geq 0\}$…

We develop a new algebraic technique that solves the following problem: Given a black box that contains an arithmetic circuit $f$ over a field of characteristic $2$ of degree~$d$. Decide whether $f$, expressed as an equivalent multivariate…

We give an especially simple proof of a theorem in graph theory that forms the key part of the solution to a problem in commutative algebra, on how to characterize the integral closure of a polynomial ring generated by quadratic monomials.

We construct explicit representations of the Heisenberg-Weyl algebra [P,M]=1 in terms of ladder operators acting in the space of Sheffer-type polynomials. Thus we establish a link between the monomiality principle and the umbral calculus.…

Let $D_n$ denote the set of monotone Boolean functions with $n$ variables. Elements of $D_n$ can be represented as strings of bits of length $2^n$. Two elements of $D_0$ are represented as 0 and 1 and any element $g\in D_n$, with $n>0$, is…

The classical problem of computing a complete system of Stokes multipliers of a linear system of ODEs of rank one in terms of some connection coefficients of an associated hypergeometric system of ODEs, is solved with no genericness…

We introduce the strong alliance polynomial of a graph. The strong alliance polynomial of a graph $G$ with order n and strong defensive alliance number $a(G)$ is the polynomial $a(G;x):=\sum_{i=a(G)}^{n}\, a_i(G)\ x^i$, where $a_{k}(G)$ is…

The nonlinearity of a Boolean function is a key property in deciding its suitability for cryptographic purposes, e.g. as a combining function in stream ciphers, and so the nonlinearity computation is an important problem for applications.…

In this thesis we develop a full characterization of abelian quantum statistics on graphs. We explain how the number of anyon phases is related to connectivity. For 2-connected graphs the independence of quantum statistics with respect to…

A beautiful result of Br\"ocker and Scheiderer on the stability index of basic closed semi-algebraic sets implies, as a very special case, that every $d$-dimensional polyhedron admits a representation as the set of solutions of at most…

Graph polynomials are deemed useful if they give rise to algebraic characterizations of various graph properties, and their evaluations encode many other graph invariants. Algebraic: The complete graphs $K_n$ and the complete bipartite…

The present paper mainly considers the representation type of the enveloping algebra of monomial algebra. Let $A$ be a monomial algebra and $A^e= A\otimes_{\mathrm{l}\!\mathrm{k}} A^{\mathrm{op}}$ its enveloping algebra. It is shown that…

We consider multiple orthogonal polynomials associated with the exponential cubic weight e^{-x^3} over two contours in the complex plane. We study the basic properties of these polynomials, including the Rodrigues formula and…

The orientation morphism $Or(\cdot)(P)\colon \gamma\mapsto\dot{P}$ associates differential-polynomial flows $\dot{P}=Q(P)$ on spaces of bi-vectors $P$ on finite-dimensional affine manifolds $N^d$ with (sums of) finite unoriented graphs…

Let $F(x)=(f_1(x), \dots, f_m(x))$ be such that $1, f_1, \dots, f_m$ are linearly independent polynomials with real coefficients. Based on ideas of Bachoc, DeCorte, Oliveira and Vallentin in combination with estimating certain oscillatory…