Related papers: Regular Finite Decomposition Complexity
The thesis deals with recognizing diffeomorphisms from fractal properties of discrete orbits, generated by iterations of such diffeomorphisms. The notion of fractal properties of a set refers to the box dimension, the Minkowski content and…
We present an abstract framework for asymptotic analysis of convergence based on the notions of eventual families of sets that we define. A family of subsets of a given set is called here an "eventual family" if it is upper hereditary with…
The compactness phenomenon is one of the featured aspects of structuralism in mathematics. In simple and broad words, a compactness property holds in a structure if a related property is satisfied by sufficiently many substructures of that…
The computational efficiency of the Finite-Difference Time-Domain (FDTD) method can be significantly reduced by the presence of complex objects with fine features. Small geometrical details impose a fine mesh and a reduced time step,…
Let $(R,\fm)$ be a local ring, and let $C$ be a semidualizing complex. We establish the equality $r_R(Z) = \nu(\Ext^{g-\inf C}_R(Z,C))\mu^{\depth C}_R(\mathfrak{m}, C)$ for a homologically finite and bounded complex $Z$ with finite…
We construct an absolutely normal number whose continued fraction expansion is normal in the sense that it contains all finite patterns of partial quotients with the expected asymptotic frequency as given by the Gauss-Kuzmin measure. The…
We show that most arithmetic circuit lower bounds and relations between lower bounds naturally fit into the representation-theoretic framework suggested by geometric complexity theory (GCT), including: the partial derivatives technique…
We initiate the study of pseudofiniteness in continuous logic. We introduce a related concept, namely that of pseudocompactness, and investigate the relationship between the two concepts. We establish some basic properties of…
In this article we study convexity properties of distance functions in infinite dimensional Finsler unitary groups, such as the full unitary group, the unitary Schatten perturbations of the identity and unitary groups of finite von Neumann…
Graphons are analytic objects associated with convergent sequences of dense graphs. Finitely forcible graphons, i.e., those determined by finitely many subgraph densities, are of particular interest because of their relation to various…
We consider the set of affine permutations that avoid a fixed permutation pattern. Crites has given a simple characterization for when this set is infinite. We find the generating series for this set using the Coxeter length statistic and…
This paper investigates certain classes of entire functions in C^n that, together with their partial derivatives, share a finite set consisting of three elements. By employing normality criteria, we study the behaviour of such functions and…
To seek for a possible origin of fractal pattern in nature, we perform a molecular dynamics simulation for a fragmentation of an infinite fcc lattice. The fragmentation is induced by the initial condition of the model that the lattice…
Gromov \cite{Gr$_1$} and Dranishnikov \cite{Dr$_1$} introduced asymptotic and coarse dimensions of proper metric spaces via quite different ways. We define coarse and asymptotic dimension of all metric spaces in a unified manner and we…
A theorem of A.A. Brudno says that the Kolmogorov-Sinai entropy of a subshift X over $\mathbb{N}$ with respect to an ergodic measure $\mu$ equals the asymptotic Kolmogorov complexity of almost every word $\omega$ in X. The purpose of this…
The paper deals with a class of cooperative functional differential equations (FDEs) with infinite delay, for which sufficient conditions for persistence and permanence are established. Here, the persistence refers to all solutions with…
The paper treats density measures as typical examples of finitely additive measures in $\mathbb{R}^n$. We study their structure and derive basic properties. In addition, estimates for related integrals are provided. The results are applied…
The notion of almost periodicity nontrivially generalizes the notion of periodicity. Strongly almost periodic sequences (=uniformly recurrent infinite words) first appeared in the field of symbolic dynamics, but then turned out to be…
A standard way of approximating or discretizing a metric space is by taking its Rips complexes. These approximations for all parameters are often bound together into a filtration, to which we apply the fundamental group or the first…
In this paper we prove tight bounds on the combinatorial and topological complexity of sets defined in terms of $n$ definable sets belonging to some fixed definable family of sets in an o-minimal structure. This generalizes the…