Related papers: Preperiodic points for quadratic polynomials with …

In this paper, we prove that for any post-critically finite rational map $f$ on the Riemann sphere $\overline{\mathbb{C}}$, and for each sufficiently large integer $n$, there exists a finite and connected graph $G$ in the Julia set of $f$…

Let $f:\mathbb{A}^N\to\mathbb{A}^N$ be a regular endomorphism of algebraic degree $d\geq2$ (i.e., $f$ extends to an endomorphism on $\mathbb{P}^N$ of algebraic degree $d$) defined over a number field. We prove that if the set of cyclotomic…

We consider semigroup dynamical systems defined by several polynomials over a number field $\mathbb{K}$, and the orbit (tree) they generate at a given point. We obtain finiteness results for the set of preperiodic points of such systems…

We show that for any sufficiently large integer $Q$ and a real $0\leq\lambda\leq\frac34$ there exists a value $c(n,f,J)>0$ such that all strips $L(Q,\lambda)=\{(x,y):|y-f(x)|<Q^{-\lambda}, x\in J=[a,b]\}$ contain at least $c(n, f,…

The permanental polynomial of a graph $G$ is $\pi(G,x)\triangleq\mathrm{per}(xI-A(G))$. From the result that a bipartite graph $G$ admits an orientation $G^e$ such that every cycle is oddly oriented if and only if it contains no even…

Let $G$ be a finite simple graph on the vertex set $V(G) = \{x_1, \ldots, x_n\}$ and $I(G) \subset K[V(G)]$ its edge ideal, where $K[V(G)]$ is the polynomial ring in $x_1, \ldots, x_n$ over a field $K$ with each ${\rm deg} x_i = 1$ and…

Let $\mathbb F_{q^2}$ be the finite field with $q^2$ elements. We provide a simple and effective method, using reciprocal polynomials, for the construction of algebraic curves over $\mathbb F_{q^2}$ with many rational points. The curves…

Let $G$ be a graph with a perfect matching. Denote by $f(G)$ the minimum size of a matching in $G$ which is uniquely extendable to a perfect matching in $G$. Diwan (2019) proved by linear algebra that for $d$-hypercube $Q_d$ ($d\geq 2)$,…

In [DKY], it was conjectured that there is a uniform bound $B$, depending only on the degree $d$, so that any pair of holomorphic maps $f, g :\mathbb{P}^1\to\mathbb{P}^1$ with degree $d$ will either share all of their preperiodic points or…

We prove a conjecture of Bonamy, Bousquet, Pilipczuk, Rz\k{a}\.zewski, Thomass\'e, and Walczak, that for every graph $H$, there is a polynomial $p$ such that for every positive integer $s$, every graph of average degree at least $p(s)$…

Let K be a number field with algebraic closure K-bar, let S be a finite set of places of K containing the archimedean places, and let f be a Chebyshev polynomial. We prove that if a in K-bar is not preperiodic, then there are only finitely…

A polynomial $f$ of degree $d$ and coefficients in an algebraically closed field $k$ defines a morphism $f:\mathbb{P}^1_k\longrightarrow\mathbb{P}^1_k$ which, if char$(k)\nmid d$, is unramified outside a finite set of points in the image:…

Let $q$ be a prime power and $\phi$ a rational function with coefficients in a finite field $\mathbb{F}_q$. For $n \geq 1$, each element of $\mathbb{P}^1(\F_{q^n})$ is either periodic or strictly preperiodic under iteration of $\phi$.…

The oriented chromatic polynomial of a oriented graph outputs the number of oriented $k$-colourings for any input $k$. We fully classify those oriented graphs for which the oriented graph has the same chromatic polynomial as the underlying…

Let $X$ be a (repetitive) infinite connected simple graph with a finite upper bound $\Delta$ on the vertex degrees. The main theorem states that $X$ admits a (repetitive) limit aperiodic vertex coloring by $\Delta$ colors. This refines a…

We show that the k-Dominating Set problem is fixed parameter tractable (FPT) and has a polynomial kernel for any class of graphs that exclude K_{i,j} as a subgraph, for any fixed i, j >= 1. This strictly includes every class of graphs for…

The feasible region $\Omega_{{\rm ind}}(F)$ of a graph $F$ is the collection of points $(x,y)$ in the unit square such that there exists a sequence of graphs whose edge densities approach $x$ and whose induced $F$-densities approach $y$. A…

The period polynomial $r_f(z)$ for an even weight $k\geq 4$ newform $f\in S_k(\Gamma_0(N))$ is the generating function for the critical values of $L(f,s)$. It has a functional equation relating $r_f(z)$ to $r_f\left(-\frac{1}{Nz}\right)$.…

Let K be an algebraically closed field of characteristic zero. Given a polynomial f(x,y) in K[x,y] with one place at infinity, we prove that either f is equivalent to a coordinate, or the family (f+c) has at most two rational elements. When…

We view the determinant and permanent as functions on directed weighted graphs and introduce their analogues for the undirected graphs. We prove that the task of computing the undirected determinants as well as permanents for planar graphs,…