Related papers: An analogue of Cobham's theorem for graph directed…

Right multiplication operators $R_w: l_2G \rightarrow l_2G$, $w \in \C[G]$, are interpreted as random-walk operators on labelled graphs that are analogous to Cayley graphs. Applying a generalization of the graph convergence defined by R.…

In this paper, we study independent domination in directed graphs, which was recently introduced by Cary, Cary, and Prabhu. We provide a short, algorithmic proof that all directed acyclic graphs contain an independent dominating set. Using…

We introduce some classical complexity-theoretic techniques to Parameterized Complexity. First, we study relativization for the machine models that were used by Chen, Flum, and Grohe (2005) to characterize a number of parameterized…

We propose a wide class of preferential attachment models of random graphs, generalizing previous approaches. Graphs described by these models obey the power-law degree distribution, with the exponent that can be controlled in the models.…

We investigate the topological and metric properties of attractors of an iterated function system (IFS) whose functions may not be contractive. We focus, in particular, on invertible IFSs of finitely many maps on a compact metric space. We…

We provide several new examples in dynamics on the $2$-sphere, with the emphasis on better understanding the induced boundary dynamics of invariant domains in parametrized families. First, motivated by a topological version of the…

Goulden and Jackson (1996) introduced, using Jack symmetric functions, some multivariate generating series $\psi(x, y, z; t, 1+\beta)$ that might be interpreted as a continuous deformation of the generating series of rooted hypermaps. They…

Let $K\subset\mathbb{R}^d$ be a self-similar set generated by an iterated function system $\{\varphi_i\}_{i=1}^m$ satisfying the strong separation condition and let $f$ be a contracting similitude with $f(K)\subset K$. We show that $f(K)$…

We introduce iterated beta integrals, a new class of iterated integrals on the universal abelian covering of the punctured projective line that unifies hyperlogarithms and classical beta integrals while preserving their fundamental…

Let $\{f_\nu\}$ be a sequence of holomorphic self-maps of a hyperbolic Riemann surface $X$. In this paper we shall study the asymptotic behavior of the sequences obtained by iteratively left-composing or right-composing the maps…

We put forward the concept of measure graphs. These are (possibly uncountable) graphs equipped with an action of a groupoid and a measure invariant under this action. Examples include finite graphs, periodic graphs, graphings and…

We define an operation on finite graphs, called co-contraction. By showing that co-contraction of a graph induces an injective map between right-angled Artin groups, we exhibit a family of graphs, without any induced cycle of length at…

We show that, from a topological point of view, 2-tape B\"uchi automata have the same accepting power than Turing machines equipped with a B\"uchi acceptance condition. In particular, we show that for every non null recursive ordinal alpha,…

There is a Turing computable embedding $\Phi$ of directed graphs $A$ in undirected graphs. Moreover, there is a fixed tuple of formulas that give a uniform interpretation; i.e., for all directed graphs $A$, these formulas interpret $A$ in…

We study the dynamics of the periodically-forced May-Leonard system. We extend previous results on the field and we identify different dynamical regimes depending on the strength of attraction $\delta$ of the network and the frequency…

Given a countable abelian group $A$, we construct a row finite directed graph $\Gamma(A)$ such that the $K_{0}$-group of the graph $\textrm{C}^{\ast}$-algebra $\textrm{C}^{\ast}(\Gamma(A))$ is canonically isomorphic to $A$. Moreover, each…

For a directed graph $G$ without loops or parallel edges, let $\beta(G)$ denote the size of the smallest feedback arc set, i.e., the smallest subset $X \subset E(G)$ such that $G \sm X$ has no directed cycles. Let $\gamma(G)$ be the number…

The theory of finite automata concerns itself with words in a free monoid together with concatenation and without further structure. There are, however, important applications which use alphabets which are structured in some sense. We…

We prove Engstr\"{o}m's conjecture that the independence complex of graphs with no induced cycle of length divisible by $3$ is either contractible or homotopy equivalent to a sphere. Our result strengthens a result by Zhang and Wu,…

Automata networks, and in particular Boolean networks, are used to model diverse networks of interacting entities. The interaction graph of an automata network is its most important parameter, as it represents the overall architecture of…