Related papers: A binomial Laurent phenomenon algebra associated t…

In this paper we verify that the graph forms a complete invariant for Banach algebra isomorphisms of tensor algebras of graphs. For tensor algebras associated with countable directed graphs having no sinks the graph forms an invariant for…

We straighten a result of [5] about arithmetic properties of the Laurent coefficients of the conformal isomorphism from the complement of the unit disk onto the complement of the Mandelbrot set. This confirms an empirical observation by Don…

We investigate the structure of the fixed-point algebra of $\mathcal{O}_n$ under the action of the cyclic permutation of the generating isometries. We prove that it is $*$-isomorphic with $\mathcal{O}_n$, thus generalizing a result of Choi…

We extend recent work by Howie, Mathews and Purcell to simplify the calculation of A-polynomials for any family of hyperbolic knots related by twisting. The main result follows from the observation that equations defining the deformation…

Kontsevich has proven that the Lie homology of the Lie algebra of symplectic vector fields can be computed in terms of the homology of a graph complex. We prove that the Leibniz homology of this Lie algebra can be computed in terms of the…

Motivated by the remarkable interplay between (chordal) graphs and matrix algebra, we associate to each graph a so-called completion number that might encode some aspects of that interplay. We show that this number is not trivial, and we…

Let R be monomial sub-algebra of $k[x_1,...,x_N]$ generated by square free monomials of degree two. This paper addresses the following question: when is R a complete intersection? For such a k-algebra we can associate a graph G whose…

We examine spaces of connected tri-/univalent graphs subject to local relations which are motivated by the theory of Vassiliev invariants. It is shown that the behaviour of ladder-like subgraphs is strongly related to the parity of the…

Let $\Sigma$ be Laurent phenomenon (LP) seed of rank $n$, $\mathcal{A}(\Sigma)$, $\mathcal{U}(\Sigma)$ and $\mathcal{L}(\Sigma)$ be its corresponding Laurent phenomenon algebra, upper bound and lower bound respectively. We prove that each…

We consider the restriction of interval exchange transformations to algebraic number fields, which leads to maps on lattices. We characterize renormalizability arithmetically, and study its relationships with a geometrical quantity that we…

We introduce a generalisation of Condition (K) to finitely separated graphs and show that it is equivalent to essential freeness of the associated partial action as well as the exchange property of any of the associated tame algebras. As a…

We enumerate factorisations of the complete bipartite graph into spanning semiregular graphs in several cases, including when the degrees of all the factors except one or two are small. The resulting asymptotic behaviour is seen to…

A graph $X$ is said to be a pattern polynomial graph if its adjacency algebra is a coherent algebra. In this study we will find a necessary and sufficient condition for a graph to be a pattern polynomial graph. Some of the properties of the…

We introduce a new equivalence relation on decorated ribbon graphs, and show that its equivalence classes directly correspond to virtual links. We demonstrate how this correspondence can be used to convert any invariant of virtual links…

A $\lambda$-graph bisystem $\mathcal{L}$ consists of two labeled Bratteli diagrams $(\mathcal{L}^-,\mathcal{L}^+)$, that presents a two-sided subshift $\Lambda_\mathcal{L}$. We will construct a compact totally disconnected metric space with…

A recurrence relation is said to have the Laurent property if all of its iterates are Laurent polynomials in the initial values with integer coefficients. We consider a family of nonlinear recurrences with the Laurent property, which were…

In this paper, we extend the recently introduced concept of partially dual ribbon graphs to graphs. We then go on to characterize partial duality of graphs in terms of bijections between edge sets of corresponding graphs. This result…

To any directed graph we associate an algebra with edges of the graph as generators and with relations defined by all pairs of directed paths with the same origin and terminus. Such algebras are related to factorizations of polynomials over…

We characterize Leavitt path algebras which are exchange rings in terms of intrinsic properties of the graph and show that the values of the stable rank for these algebras are 1, 2 or $\infty$. Concrete criteria in terms of properties of…

We show that for every m in N, there exists an n in N such that every embedding of the complete graph K_n in R^3 contains a link of two components whose linking number is at least m. Furthermore, there exists an r in N such that every…