Related papers: Base Polynomials for Schultz Invariants of Linear …

The graph polynomial for the number of independent sets of size $k$ in a general undirected graph is shown to be equal to an elementary symmetric polynomial of the vertex monomials, which are determined by the edges incident at the…

Given a rank $n$ irreducible finite reflection group $W$, the $W$-invariant polynomial functions defined in ${\mathbb R}^n$ can be written as polynomials of $n$ algebraically independent homogeneous polynomial functions,…

A hexagonal patch is a plane graph in which inner faces have length 6, inner vertices have degree 3, and boundary vertices have degree 2 or 3. We consider the following counting problem: given a sequence of twos and threes, how many…

The weight enumerators (quant-ph/9610040) of a quantum code are quite powerful tools for exploring its structure. As the weight enumerators are quadratic invariants of the code, this suggests the consideration of higher-degree polynomial…

The onset and bifurcation points of the $n$-cycles of a polynomial map are located through a characteristic equation connecting cyclic polynomials formed by periodic orbit points. The minimal polynomials of the critical parameters of the…

Polynomial invariants are fundamental objects in analysis on Lie groups and symmetric spaces. Invariant differential operators on symmetric spaces are described by Weyl group invariant polynomial. In this article we give a simple criterion…

We introduce a graph structure on Euclidean polytopes. The vertices of this graph are the $d$-dimensional polytopes contained in $\mathbb{R}^d$ and its edges connect any two polytopes that can be obtained from one another by either…

The classical Weisfeiler-Lehman method WL[2] uses edge colors to produce a powerful graph invariant. It is at least as powerful in its ability to distinguish non-isomorphic graphs as the most prominent algebraic graph invariants. It…

To every finite metric space $X$, including all connected unweighted graphs with the minimum edge-distance metric, we attach an invariant that we call its blowup-polynomial $p_X(\{ n_x : x \in X \})$. This is obtained from the blowup…

The Frobenius manifold structure on the space of rational functions with multiple simple poles is constructed. In particular, the dependence of the Saito-flat coordinates on the flat coordinates of the intersection form is studied. While…

We study the dependence of solutions of equations of the form $a_0 + a_1 z^{\ell_1} + ... + a_m z^{\ell_m} = 0$, on the exponents $\ell_1, ..., \ell_m$. We apply our results to equations that appear in graph theory, the theory of…

Consider a group G and an epimorphism u_0:G\to\Z inducing a splitting of G as a semidirect product ker(u_0)\rtimes_\varphi\Z with ker(u_0) a finitely generated free group and \varphi\in Out(ker(u_0)) representable by an expanding…

We consider decompositions of digraphs into edge-disjoint paths and describe their connection with the $n$-th Weyl algebra of differential operators. This approach gives a graph-theoretic combinatorial view of the normal ordering problem…

A fullerene graph is a cubic bridgeless plane graph with only pentagonal and hexagonal faces. We exhibit an infinite family of fullerene graphs of diameter $\sqrt{4n/3}$, where $n$ is the number of vertices. This disproves a conjecture of…

We introduce a generalization of the quandle polynomial. We prove that our polynomial is an invariant of stuquandles. Furthermore, we use the invariant of stuquandles to define a polynomial invariant of stuck links. As a byproduct, we…

The orbits of the orthogonal and symplectic groups on the flag variety are in bijection, respectively, with the involutions and fixed-point-free involutions in the symmetric group $S_n$. Wyser and Yong have described polynomial…

FFLV polytopes describe monomial bases in irreducible representations of $\mathfrak{sl}_n$ and $\mathfrak{sp}_{2n}$. We study various sets of vertices of FFLV polytopes. First, we consider the special linear case. We prove the locality of…

Let $K_n$ be a complete graph with $n$ vertices. An embedding of $K_n$ in $S^3$ is called a spatial $K_n$-graph. Knots in a spatial $K_n$-graph corresponding to simple cycles of $K_n$ are said to be constituent knots. We consider the case…

We study discrete Lorentzian spectral geometry by investigating to what extent causal sets can be identified through a set of geometric invariants such as spectra. We build on previous work where it was shown that the spectra of certain…

For a Lie algebra ${\mathcal L}$ with basis $\{x_1,x_2,\cdots,x_n\}$, its associated characteristic polynomial $Q_{{\mathcal L}}(z)$ is the determinant of the linear pencil $z_0I+z_1\text{ad} x_1+\cdots +z_n\text{ad} x_n.$ This paper shows…