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

We give a notion of "combinatorial proximity" among strongly stable ideals in a given polynomial ring with a fixed Hilbert polynomial. We show that this notion guarantees "geometric proximity" of the corresponding points in the Hilbert…

We develop iterated forcing constructions dual to finite support iterations in the sense that they add random reals instead of Cohen reals in limit steps. In view of useful applications we focus in particular on two-dimensional "random"…

The Grid Theorem of Robertson and Seymour [JCTB, 1986], is one of the most important tools in the field of structural graph theory, finding numerous applications in the design of algorithms for undirected graphs. An analogous version of the…

This paper deals with analytic families of holomorphic iterated function systems. Using real analyticity of the pressure function (which we prove), we establish a classification theorem for analytic families of holomorphic iterated function…

For a finite simplicial graph $\Gamma$, let $A(\Gamma)$ denote the right-angled Artin group on $\Gamma$. Recently Kim and Koberda introduced the extension graph $\Gamma^e$ for $\Gamma$, and established the Extension Graph Theorem: for…

Emil Artin defined a zeta function for algebraic curves over finite fields and made a conjecture about them analogous to the famous Riemann hypothesis. This and other conjectures about these zeta functions would come to be called the Weil…

Let $ \mu $ be the self-similar measure associated with a homogeneous iterated function system $ \Phi = \{ \lambda x + t_j \}_{j=1}^m $ on ${\Bbb R}$ and a probability vector $ (p_{j})_{j=1}^m$, where $0\neq \lambda\in (-1,1)$ and $t_j\in…

Given a Farey-type map F with full branches in the extended Hecke group Gamma_m, its dual F_# results from constructing the natural extension of F, letting time go backwards, and projecting. Although numerical simulations may suggest…

We prove a regularized determinant formula for the zeta functions of certain 3-dimensional Riemannian foliated dynamical systems, in terms of the infinitesimal operator induced by the flow acting on the reduced leafwise cohomologies. It is…

We continue to investigate branching systems of directed graphs and their connections with graph algebras. We give a sufficient condition under which the representation induced from a branching system of a directed graph is faithful and…

We establish a broad generalization of Whitney's broken circuit theorem on the chromatic polynomial of a graph to sums of type $\sum_{A\subseteq S} f(A)$ where $S$ is a finite set and $f$ is a mapping from the power set of $S$ into an…

Inspired by the work of Wang and Zhou [4] for Rota-Baxter algebras, we develop a cohomology theory of Rota-Baxter systems and justify it by interpreting the lower degree cohomology groups as formal deformations and as abelian extensions of…

We present the theory of multifunctions applied to graphs. Its interesting feature is that walks are recognized as iterations. We consider the graphs with arbitrary number of vertices which are determined by multifunctions. The mutually…

Conditions are given which imply that certain non-autonomous analytic iterated function systems (NIFS's) in the complex plane C have uniformly perfect attractor sets. Examples are given to illustrate the main theorem, as well as to indicate…

We expand upon the notion of bottlenecking introduced in our earlier work, characterizing a spectrum of graphs and showing that this naturally extends to a concept of coarse bottlenecking. We show how the notion of bottlenecking provides a…

If two homogeneous IFSs satisfying the OSC with opposite common contraction factors share the same attractor on the real line, we show that this attractor is symmetric. This answers a question of Feng and Wang [Adv. Math. 222 (2009),…

We prove a Law of Iterated Logarithm for random walks on a family of diagonal products constructed by Brieussel and Zheng (2021). This provides a wide variety of new examples of Law of Iterated Logarithm behaviours for random walks on…

In this paper we present a systematic study of continuous local iterated function systems. We prove local iterated function systems admit compact attractors and, under a contractivity assumption, construct their code space and present an…

In recent years Lichtenbaum has conjectured a description for the special values of Hasse--Weil zeta functions in terms of ``Weil-\'etale cohomology''. In earlier papers we studied a class of foliated dynamical systems which had some…

We employ techniques from optimal transport in order to prove decay of transfer operators associated to iterated functions systems and expanding maps, giving rise to a new proof without requiring a Doeblin-Fortet (or Lasota-Yorke)…