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

We prove that the partial-dual genus polynomial considered as a function on chord diagrams satisfies the four-term relation. Thus it is a weight system from the theory of Vassiliev knot invariants.

In the paper, we first classify all polynomial maps $H$ of the following form: $H=\big(H_1(x_1,x_2,\ldots,x_n),H_2(x_1,x_2),H_3(x_1,x_2),\ldots,H_n(x_1,x_2)\big)$ with $JH$ nilpotent. After that, we generalize the structure of $H$ to…

Hypergraphs are important objects to model ternary or higher-order relations of objects, and have a number of applications in analysing many complex datasets occurring in practice. In this work we study a new heat diffusion process in…

We call a digraph {\em $h$-semicomplete} if each vertex of the digraph has at most $h$ non-neighbors, where a non-neighbor of a vertex $v$ is a vertex $u \neq v$ such that there is no edge between $u$ and $v$ in either direction. This…

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…

For $p$ prime, let $\mathcal{H}^n$ be the linear span of characteristic functions of hyperplanes in $(\mathbb{Z}/p^k\mathbb{Z})^n$. We establish new upper bounds on the dimension of $\mathcal{H}^n$ over $\mathbb{Z}/p\mathbb{Z}$, or…

Let $G$ be a graph, and let $A(G)$ be the adjacency matrix of $G$. The permanental polynomial of $G$ is defined as $\pi(G,x)=\mathrm{per}(xI-A(G))$. The permanental sum of $G$ can be defined as the sum of absolute value of coefficients of…

In different areas of discrete mathematics, a certain type of polynomials, having coefficients in a field K of finite characteristic, has been considered. The form and the degree of these polynomials, here called projective, are simply…

We study the isomorphism problem for random hypergraphs. We show that it is solvable in polynomial time for the binomial random $k$-uniform hypergraph $H_{n,p;k}$, for a wide range of $p$. We also show that it is solvable w.h.p. for random…

We define a new combinatorial object, which we call a labeled hypergraph, uniquely associated to any square-free monomial ideal. We prove several upper bounds on the regularity of a square-free monomial ideal in terms of simple…

This paper proves that the characteristic polynomial is a complete unitary invariant for pairs of projection matrices. Some special cases involving three or more projections are also considered.

In this letter we proved this theorem: \emph{if $F$ be a holomorphic mapping of $T_{\Omega}$ to a mapping manifold $X$ such that for every compact subset $K\subset \Omega$ the mapping $F$ is uniformly continues on $T_{K}$ and $F(T_{K})$ is…

Let $\mathcal{H}=(X,\mathcal{E})$ be a hypergraph. A support is a graph $Q$ on $X$ such that for each $E\in\mathcal{E}$, the subgraph of $Q$ induced on the elements in $E$ is connected. In this paper, we consider hypergraphs defined on a…

It is well known that a graph is bipartite if and only if the spectrum of its adjacency matrix is symmetric. In the present paper, this assertion is dissected into three separate matrix results of wider scope, which are extended also to…

A multivariate polynomial is {\em stable} if it is nonvanishing whenever all variables have positive imaginary parts. We classify all linear partial differential operators in the Weyl algebra $\A_n$ that preserve stability. An important…

In semidefinite programming the dual may fail to attain its optimal value and there could be a duality gap, i.e., the primal and dual optimal values may differ. In a striking paper, Ramana proposed a polynomial size extended dual that does…

{\em Partial domination problem} is a generalization of the {\em minimum dominating set problem} on graphs. Here, instead of dominating all the nodes, one asks to dominate at least a fraction of the nodes of the given graph by choosing a…

The interior polynomial is an invariant of bipartite graphs, and a part of the HOMFLY polynomial of a special alternating link coincides with the interior polynomial of the Seifert graph of the link. We extend the interior polynomial to…

In this paper, we define a homogeneous polynomial for a general hypergraph, and establish a remarkable connection between clique number and the homogeneous polynomial of a general hypergraph. For a general hypergraph, we explore some…

We give a conditional proof of the Uniform Boundedness Conjecture of Morton and Silverman in the case of polynomials over number fields, assuming a standard conjecture in arithmetic geometry. Our technique simultaneously yields a dynamical…