Related papers: A characterization of subshifts with bounded power…
The family of symmetric one sided subshifts in two symbols given by a sequence $a$ is studied. We analyse some of their topological properties such as transitivity, the specification property and intrinsic ergodicity. It is shown that…
In this paper, we establish a new zeta function based on the Bartholdi zeta function for an undirected graph G called the reduced Bartholdi zeta function. We study the relation between its coefficients and the structure of the graph, and…
The problem of finding graph structure of functions commuting with a given function in terms of their functional graphs is considered. Structure of functional graphs of commuting functions is described. The problem is reduced to describing…
This paper presents a general and systematic discussion of various symbolic representations of iterated maps through subshifts. We give a unified model for all continuous maps on a metric space, by representing a map through a general…
For certain pairs of unimodal maps on the interval with periodic critical orbits, it is known that one can combine them to create another map whose entropy is close to one while the poles of Artin-Mazur $\zeta$ function outside the unit…
This note deals with certain properties of convex functions. We provide results on the convexity of the set of minima of these functions, the behaviour of their subgradient set under restriction, and optimization of these functions over an…
We describe a combinatorial algorithm which, given a monotone and consistent symmetric set function d on a finite set V in the sense of Rizzi, constructs a non trivial set S minimizing d(S,V-S). This includes the possibility for the…
Exhibiting a new type of measure concentration, we prove uniform concentration bounds for measurable Lipschitz functions on product spaces, where Lipschitz is taken with respect to the metric induced by a weighted covering of the index set…
We investigate the existence of subinvariant metric functionals for commuting families of nonexpansive mappings in noncompact subsets of Banach spaces. Our findings underscore the practicality of metric functionals when searching for fixed…
We characterize $p-$harmonic functions in the Heisenberg group in terms of an asymptotic mean value property, where $1<p<\infty$, following the scheme described in Manfredi et al. (2009) for the Euclidean case. The new tool that allows us…
A sofic shift is a shift space consisting of bi-infinite labels of paths from a labelled graph. Being a dynamical system, the distribution of its closed orbits may indicate the complexity of the space. For this purpose, prime orbit and…
Given a base field $\Bbbk$ of characteristic zero, for each graph $G$, we associate the artinian algebra $A(G)$ defined by the edge ideal of $G$ and the squares of the variables. We study the weak Lefschetz property of $A(G)$. We classify…
Hypergraphs are structures that can be decomposed or described; in other words they are recursively countable. Here, we get exact and asymptotic enumeration results on hypergraphs by means of exponential generating functions. The number of…
We show a continuity result for the Weyl pseudometric on subshifts which are generated by model sets. This fact is then used for multiple constructions of subshifts that exhibit different behavior regarding entropy, amorphic complexity and…
We provide some necessary and sufficient conditions for a proper lower semicontinuous convex function, defined on a real Banach space, to be locally or globally Lipschitz continuous. Our criteria rely on the existence of a bounded selection…
Given a connected finite graph $G$, an integer-valued function $f$ on $V(G)$ is called $M$-Lipschitz if the value of $f$ changes by at most $M$ along the edges of $G$. In 2013, Peled, Samotij, and Yehudayoff showed that random $M$-Lipschitz…
A new method of metric space investigation, based on classification of its finite subspaces, is suggested. It admits to derive information on metric space properties which is encoded in metric. The method describes geometry in terms of only…
This paper introduces a new graph construction, the permutational power of a graph, whose adjacency matrix is obtained by the composition of a permutation matrix with the adjacency matrix of the graph. It is shown that this construction…
With the extensive application of submodularity, its generalizations are constantly being proposed. However, most of them are tailored for special problems. In this paper, we focus on quasi-submodularity, a universal generalization, which…
We consider infinite graphs and the associated energy forms. We show that a graph is canonically compactifiable (i.e. all functions of finite energy are bounded) if and only if the underlying set is totally bounded with respect to any…