Related papers: Preperiodic points for quadratic polynomials over …

We show that the groupoids of two directed graphs are isomorphic if and only if the two graphs are orbit equivalent by an orbit equivalence that preserves isolated eventually periodic points. We also give a complete description of the…

We investigate $f$-Diophantine sets over finite fields via new explicit constructions of families of quasi-random hypergraphs from multivariate polynomials. In particular, our construction not only offers a systematic method for…

For a prime $p$, positive integers $r,n$, and a polynomial $f$ with coefficients in $\mathbb{F}_{p^r}$, let $W_{p,r,n}(f)=f^n\left(\mathbb{F}_{p^r}\right)\setminus f^{n+1}\left(\mathbb{F}_{p^r}\right)$. As $n$ varies, the $W_{p,r,n}(f)$…

In 2011, Penttila and Williford constructed an infinite new family of primitive $Q$-polynomial 3-class association schemes, not arising from distance regular graphs, by exploring the geometry of the lines of the unitary polar space…

For a class $\mathcal{G}$ of graphs, the objective of \textsc{Subgraph Complementation to} $\mathcal{G}$ is to find whether there exists a subset $S$ of vertices of the input graph $G$ such that modifying $G$ by complementing the subgraph…

We achieve an extremely useful description (up to isomorphism) of the Leavitt path algebra $L_K(E)$ of a finite graph $E$ with coefficients in a field $K$ as a direct sum of matrix rings over $K$, direct sum with a corner of the Leavitt…

The Graded Classification Conjecture (GCC) states that the pointed $K_0^{\operatorname{gr}}$-group is a complete invariant of the Leavitt path algebras of finite graphs when these algebras are considered with their natural grading by…

Graph polynomials are deemed useful if they give rise to algebraic characterizations of various graph properties, and their evaluations encode many other graph invariants. Algebraic: The complete graphs $K_n$ and the complete bipartite…

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…

Given a connected graph G with p vertices and q edges, the G-graphicahedron is a vertex-transitive simple abstract polytope of rank q whose edge-graph is isomorphic to a Cayley graph of the symmetric group S_p associated with G. The paper…

We give new characterizations of the algebra $\mathscr{L}_n(\mathbb{F}_{q^n})$ formed by all linearized polynomials over the finite field $\mathbb{F}_{q^n}$ after briefly surveying some known ones. One isomorphism we construct is between…

In this paper, we introduce the concept of $k$-integral graphs. A graph $\Gamma$ is called $k$-integral if the extension degree of the splitting field of the characteristic polynomial of $\Gamma$ over rational field $\mathbb Q$ is equal to…

Let $f_t$ be a one-parameter family of rational maps defined over a number field $K$. We show that for all $t$ outside of a set of natural density zero, every $K$-rational preperiodic point of $f_t$ is the specialization of some…

The Gordian graph and H(2)-Gordian graphs of knots are abstract graphs whose vertex sets represent isotopy classes of unoriented knots, and whose edge sets record whether pairs of knots are related by crossing changes or H(2)-moves,…

Let $G$ be a bipartite graph with adjacency matrix $A(G)$. The characteristic polynomial $\phi(G,x)=\det(xI-A(G))$ and the permanental polynomial $\pi(G,x) = \text{per}(xI-A(G))$ are both graph invariants used to distinguish graphs. For…

Counting dominating sets in a graph $G$ is closely related to the neighborhood complex of $G$. We exploit this relation to prove that the number of dominating sets $d(G)$ of a graph is determined by the number of complete bipartite…

Let F be a local henselian nonarchimedean field of residual field k, and let G be the group of F-points of a connected reductive group defined over F. It is well-known that the quotient of any parahoric subgroup of G by its first congruence…

Let P a locally finite partially ordered set, F a field, G a group, and I(P,F) the incidence algebra of P over F. We describe all the inequivalent elementary G-gradings on this algebra. If P is bounded, F is a infinite field of…

\begin{abstract} In this paper, we investigate a shift arising from graph $G$. We prove that any $k$-dimensional shift of finite type can be generated through a $k$-dimensional graph. We investigate the structure of the shift space using…

We consider a class $G(S^n)$ of orientation preserving Morse-Smale diffeomorphisms of the sphere $S^{n}$ of dimension $n>3$ in assumption that invariant manifolds of different saddle periodic points have no intersection. We put in a…