Related papers: On the constant partial-dual polynomials of hyperm…

We prove the real non-attractive fixed point conjecture for complex polynomial and rational harmonic functions. A harmonic function $f=h+\overline{g}$ is polynomial (rational) if both $h$ and $g$ are polynomials (rational functions) of…

It is known that a graph isomorphism testing algorithm is polynomially equivalent to a detecting of a graph non-trivial automorphism algorithm. The polynomiality of the latter algorithm, is obtained by consideration of symmetry properties…

The existence of conservative quasipolynomial (QP) maps is investigated. A classification is given for dimensions two and three, and the analytical solution of the former case is constructed. General properties of n-dimensional QP…

We describe polynomial time algorithms for determining whether an undirected graph may be embedded in a distance-preserving way into the hexagonal tiling of the plane, the diamond structure in three dimensions, or analogous structures in…

A non-zero constant Jacobian polynomial map $F=(P,Q):\mathbb{C}^2 \longrightarrow \mathbb{C}^2$ has a polynomial inverse if the component $P$ is a simple polynomial, i.e. if, when $P$ extended to a morphism $p:X\longrightarrow \mathbb{P}^1$…

In the paper, we first classify all polynomial maps of the form $H=(u(x,y),v(x,y,z), h(x,y))$ in the case that $JH$ is nilpotent and $(\deg_yu,\deg_yh)\leq 3$, $H(0)=0$. Then we classify all polynomial maps of the form…

Here we explore, in a series of articles, semiclassical quasimodes u(h,b), approximative solutions P(h)u(h,b)\sim 0, depending on $0<h<1$, and on b, the subprincipal symbol. We study a pseudodifferential operator with transversal…

In this article we are introducing combinatorial spectra of graphs, this is a generalization of $H$-Hamiltonian spectra. The main motivation was to made from $H$-Hamiltonian spectra an operation and develop some algebra in this field. An…

In order to apply quantum topology methods to nonplanar graphs, we define a planar diagram category that describes the local topology of embeddings of graphs into surfaces. These \emph{virtual graphs} are a categorical interpretation of…

One of the main questions that arise when studying random and quasi-random structures is which properties P are such that any object that satisfies P "behaves" like a truly random one. In the context of graphs, Chung, Graham, and Wilson…

We consider matrices of the form $qD+A$, with $D$ being the diagonal matrix of degrees, $A$ being the adjacency matrix, and $q$ a fixed value. Given a graph $H$ and $B\subseteq V(G)$, which we call a coalescent pair $(H,B)$, we derive a…

The geometric dual of a cellularly embedded graph is a fundamental concept in graph theory and also appears in many other branches of mathematics. The partial dual is an essential generalization which can be obtained by forming the…

Alphatrion conjectured that it is possible to label the vertices of an $n$-dimensional hypercube with distinct positive integers such that for every Hamiltonian path $a_1, \dots, a_{2^n},$ we have $a_i + a_{i+1}$ prime for all $i.$ We prove…

Let F : W --> V be a dominant rational map between quasi-projective varieties of the same dimension. We give two proofs that h_V(F(P)) >> h_W(P) for all points P in a nonempty Zariski open subset of W. For dominant rational maps F : P^n -->…

Let $n$ be a positive integer and $H$ a Hilbert space. The description of the general form of bijective maps on the set of $n$-dimensional subspaces of $H$ preserving the maximal principal angle has been obtained recently. This is a…

A hypermap is (hypervertex-) bipartite if its hypervertices can be 2-coloured in such a way that ``neighbouring'' hypervertices have different colours. It is bipartite-uniform if within each of the sets of hypervertices of the same colour,…

We study extensions of piecewise polynomial data prescribed on faces and possibly in elements of a patch of simplices sharing a vertex. In the $H^1$ setting, we look for functions whose jumps across the faces are prescribed, whereas in the…

In this paper we explore the general conditions in order that a 2-dimensional natural Hamiltonian system possess a second invariant which is a polynomial in the momenta and is therefore Liouville integrable. We examine the possibility that…

For any $r$-uniform hypergraph $\mathcal{H}$ with $m$ ($\geq 2$) edges, let $P(\mathcal{H},k)$ and $P_l(\mathcal{H},k)$ be the chromatic polynomial and the list-color function of $\mathcal{H}$ respectively, and let $\rho(\mathcal{H})$…

Fox, Gromov, Lafforgue, Naor, and Pach proved a regularity lemma for semi-algebraic $k$-uniform hypergraphs of bounded complexity, showing that for each $\epsilon>0$ the vertex set can be equitably partitioned into a bounded number of parts…