Related papers: Level {\epsilon}
We describe dimensional entropies introduced in a previous work list some of their properties and give some new proofs. These entropies allowed the definition of entropy-expanding maps. We introduce a new notion of entropy-hyperbolicity for…
Universal algebraic geometry allows considering of geometric properties of every universal algebra. When two algebras have same algebraic geometry? We must consider the categories of algebraic closed sets of these algebras to answer this…
A generic method for combinatorial constructions of intrinsic geometrical spaces is presented. It is based on the well known inverse sequences of finite graphs that determine (in the limit) topological spaces. If a pattern of the…
We present a generalization of the notion of an algebra norm relevant to real finite-dimensional unital associative algebras. Among other things, this leads to a novel set of algebra isomorphism invariants, some of which are computationally…
We prove a category-theoretic independence theorem for four fundamental notions: meaning, object, name, and existence. Working in a Lawvere-style categorical semantics and in particular in toposes, we show that these notions occupy distinct…
The main objective of this paper is to show that the notion of type which was developed within the frames of logic and model theory has deep ties with geometric properties of algebras. These ties go back and forth from universal algebraic…
For any hyperbolic 3-manifold $M$ with totally geodesic boundary, there are finitely many boundary slopes for essential immersed surfaces of a given genus. There is a uniform bound for the number of such boundary slopes if the genus of…
In this paper we introduce a general framework for the study of limits of relational structures in general and graphs in particular, which is based on a combination of model theory and (functional) analysis. We show how the various…
Consider a set of $n$ vertices, where each vertex has a location in $\mathbb{R}^d$ that is sampled uniformly from the unit cube in $\mathbb{R}^d$, and a weight associated to it. Construct a random graph by placing edges independently for…
Since the time when the first optical instruments have been invented, an idea that the visible image of an object under observation depends on tools of observation became commonly assumed in physics. A way to formalize it in mathematics is…
In his work on singularities, expanders and topology of maps, Gromov showed, using isoperimetric inequalities in graded algebras, that every real valued map on the $n$-torus admits a fibre whose homological size is bounded below by some…
The problem of finding an appropriate geometrical/physical index for measuring a degree of inhomogeneity for a given space-time manifold is posed. Interrelations with the problem of understanding the gravitational/informational entropy are…
In this note we elaborate on some notions of surface area for discrete graphs which are closely related to the inverse degree. These notions then naturally lead to associated connectivity measures of graphs and to the definition of a…
We study the dynamics of piecewise affine surface homeomorphisms from the point of view of their entropy. Under the assumption of positive topological entropy, we establish the existence of finitely many ergodic and invariant probability…
We characterize the fundamental group of a locally finite graph G with ends combinatorially, as a group of infinite words. Our characterization gives rise to a canonical embedding of this group in the inverse limit of the (free) fundamental…
The notion of epsilon multiplicity was originally defined by Ulrich and Validashti as a limsup and they used it to detect integral dependence of modules. It is important to know if it can be realized as a limit. In this article we show that…
We give inequalities relating the eigenvalues of the adjacency matrix and the Laplacian of a graph, and its minimum and maximum degrees. The results are applied to derive new conditions for quasi-randomness of graphs.
We establish that for q>=1, the class of convex combinations of q translates of a smooth probability density has local doubling dimension proportional to q. The key difficulty in the proof is to control the local geometric structure of…
One considers geometry with the intransitive equaivalence relation. Such a geometry is a physical geometry, i.e. it is described completely by the world function, which is a half of the squared distance function. The physical geometry…
For projectivizations of rational maps Bellon and Viallet defined the notion of algebraic entropy using the exponential growth rate of the degrees of iterates. We want to call this notion to the attention of dynamicists by computing…