In this paper, we extend to automorphisms of free groups some results and constructions that classically hold for morphisms of the free monoid, i.e., the so-called substitutions. A geometric representation of the attractive lamination of a class of automorphisms of the free group (irreducible with irreducible powers (iwip) automorphisms) is given in the case where the dilation coefficient of the automorphism is a unit Pisot number. The shift map associated with the attractive symbolic lamination...

The Erdős-Faber-Lovász conjecture is the statement that every graph that is the union of n cliques of size n intersecting pairwise in at most one vertex has chromatic number n. Kahn and Seymour proved a fractional version of this conjecture, where the chromatic number is replaced by the fractional chromatic number. In this note we investigate similar fractional relaxations of the Erdős-Faber-Lovász conjecture, involving variations of the fractional chromatic number. We exhibit some relaxations that...

Let G = (V,E) be a connected graph and let k be a positive integer with k ≤ rad(G). A subset D ⊆ V is called a distance k-dominating set of G if for every v ∈ V - D, there exists a vertex u ∈ D such that d(u,v) ≤ k. In this paper we study the fractional version of distance k-domination and related parameters.

Mynhardt has conjectured that if G is a graph such that γ(G) = γ(πG) for all generalized prisms πG then G is edgeless. The fractional analogue of this conjecture is established and proved by showing that, if G is a graph with edges, then ${\gamma }_f\left(G\times K₂\right)>{\gamma }_f\left(G\right)$.

Let G = (V,E) be a graph. A function g:V → [0,1] is called a global dominating function (GDF) of G, if for every v ∈ V, $g\left(N\left[v\right]\right)={\sum }_{u\in N\left[v\right]}g\left(u\right)\ge 1$ and $g\left(\overline{N\left(v\right)}\right)={\sum }_{u\notin N\left(v\right)}g\left(u\right)\ge 1$. A GDF g of a graph G is called minimal (MGDF) if for all functions f:V → [0,1] such that f ≤ g and f(v) ≠ g(v) for at least one v ∈ V, f is not a GDF. The fractional global domination number ${\gamma }_{fg}\left(G\right)$ is defined as follows: ${\gamma }_{fg}\left(G\right)$ = min|g|:g is an MGDF of G where $\left|g\right|={\sum }_{v\in V}g\left(v\right)$. In this paper we initiate a study of this parameter.

Let r, s ∈ N, r ≥ s, and P and Q be two additive and hereditary graph properties. A (P,Q)-total (r, s)-coloring of a graph G = (V,E) is a coloring of the vertices and edges of G by s-element subsets of Zr such that for each color i, 0 ≤ i ≤ r − 1, the vertices colored by subsets containing i induce a subgraph of G with property P, the edges colored by subsets containing i induce a subgraph of G with property Q, and color sets of incident vertices and edges are disjoint. The fractional (P,Q)-total...

An additive hereditary property of graphs is a class of simple graphs which is closed under unions, subgraphs and isomorphism. Let [...] be an additive hereditary property of graphs. A [...] -edge-coloring of a simple graph is an edge coloring in which the edges colored with the same color induce a subgraph of property [...] . In this paper we present some results on fractional [...] -edge-colorings. We determine the fractional [...] -edge chromatic number for matroidal properties of graphs.

In this study, we present an epidemic model that characterizes the behavior of a financial network of globally operating stock markets. Since the long time series have a global memory effect, we represent our model by using the fractional calculus. This model operates on a network, where vertices are the stock markets and edges are constructed by the correlation distances. Thereafter, we find an analytical solution to commensurate system and use the well-known differential transform method to obtain...

We study problems concerning the Samuel compactification of the automorphism group of a countable first-order structure. A key motivating question is a problem of Furstenberg and a counter-conjecture by Pestov regarding the difference between $S\left(G\right)$, the Samuel compactification, and $E\left(M\right(G\left)\right)$, the enveloping semigroup of the universal minimal flow. We resolve Furstenberg’s problem for several automorphism groups and give a detailed study in the case of $G=S_{\infty }$, leading us to define and investigate several new types...

A lattice $L$ is said to satisfy (the lattice theoretic version of) Frankl’s conjecture if there is a join-irreducible element $f\in L$ such that at most half of the elements $x$ of $L$ satisfy $f\le x$. Frankl’s conjecture, also called as union-closed sets conjecture, is well-known in combinatorics, and it is equivalent to the statement that every finite lattice satisfies Frankl’s conjecture. Let $m$ denote the number of nonzero join-irreducible elements of $L$. It is well-known that $L$ consists of at most $2^m$ elements....