相关论文: On the constant partial-dual polynomials of hyperm…

It is known that every surface-link can be presented by a marked graph diagram, and such a diagram presentation is unique up to moves called Yoshikawa moves. G. Kuperberg introduced a regular isotopy invariant, called the quantum A_2…

Every $n th$ order monic polynomial corresponds $n$-dimensional vector. If the given polynomial is stable that is all its roots lie in the open left half plane it is said to be Hurwitz polynomial and the corresponding vector is called…

We primarily investigate the properties of characteristic polynomials of semimatroids. In particular, we provide a combinatorial interpretation of their coefficients, generalizing the Whitney's Broken Circuit Theorem. We also prove that the…

We establish a one-to-one correspondence between 1-planar graphs and general and hole-free 4-map graphs and show that 1-planar graphs can be recognized in polynomial time if they are crossing-augmented, fully triangulated, and maximal…

We introduce the notion of P-polynomial coherent configurations and show that they can have at most two fibres. We then introduce a class of two-fibre coherent configurations which have two distinguished bases for the coherent algebra,…

Let $\mathbb F$ be a field and $P \in \mathbb F [x_1,\ldots, x_n]$ be a homogeneous polynomial such that $|\mathbb F| > \deg(P)$ and $\phi, \psi\colon \mathbb F^n \to \mathbb F^n$ be two maps such that $P(\mathbf{x} + \lambda\mathbf{y}) =…

A graph $H$ is an immersion of a graph $G$ if $H$ can be obtained by some sugraph $G$ after lifting incident edges. We prove that there is a polynomial function $f:\Bbb{N}\times\Bbb{N}\rightarrow\Bbb{N}$, such that if $H$ is a connected…

In this paper, we introduce a new concept namely degree polynomial for vertices of a simple graph. This notion leads to a concept namely degree polynomial sequence which is stronger than the concept of degree sequence. After obtaining the…

Let P be a convex polytope containing the origin, whose dual is a lattice polytope. Hibi's Palindromic Theorem tells us that if P is also a lattice polytope then the Ehrhart $\delta$-vector of P is palindromic. Perhaps less well-known is…

The partial Petrial polynomial was first introduced by Gross, Mansour, and Tucker as a generating function that enumerates the Euler genera of all possible partial Petrials on a ribbon graph. Yan and Li later extended this polynomial…

We characterize the signature of piecewise continuously differentiable paths transformed by a polynomial map in terms of the signature of the original path. For this aim, we define recursively an algebra homomorphism between two shuffle…

The generalized Lax conjecture asserts that each hyperbolicity cone is a linear slice of the cone of positive semidefinite matrices. We prove the conjecture for a multivariate generalization of the matching polynomial. This is further…

Here, we represent a general hypergraph by a matrix and study its spectrum. We extend the definition of equitable partition and joining operation for hypergraphs, and use those to compute eigenvalues of different hypergraphs. We derive the…

The purpose of this note is to extend in a simple and unified way the known results on interlacing of zeros of paraorthogonal polynomials on the unit circle. These polynomials can be regarded as the characteristic polynomials of any matrix…

We use the inverse pressure concept to estimate the stable dimension for hyperbolic non-invertible maps which are conformal in the stable fibers. The non-invertible case is different than the diffeomorphism case. In particular we show that…

Let $K$ be any field and $x = (x_1,x_2,\ldots,x_n)$. We classify all matrices $M \in {\rm Mat}_{m,n}(K[x])$ whose entries are polynomials of degree at most 1, for which ${\rm rk} M \le 2$. As a special case, we describe all such matrices…

It is known that if $f\colon {\mathbb R}^2 \to {\mathbb R}$ is a polynomial in each variable, then $f$ is a polynomial. We present generalizations of this fact, when ${\mathbb R}^2$ is replaced by $G\times H$, where $G$ and $H$ are…

The characteristic polynomial plays an important role in study of hyperplane arrangements. There are several refinements of the characteristic polynomial. One of them is the coboundary polynomial defined by Crapo. Another refinement is the…

In this paper, we investigate the geometric properties of complex-valued pluriharmonic mappings defined over convex Reinhardt domains in $\mathbb{C}^n$. We first establish a multidimensional analogue of the Noshiro-Warschawski Theorem,…

A theorem by Ding, Oporowski, Oxley, and Vertigan states that every sufficiently large bipartite graph without twins contains a matching, co-matching, or half-graph of any given size as an induced subgraph. We prove that this Ramsey…