Related papers: Linear repetitivity and subadditive ergodic theore…
We show that semiprojectivity of a C*-algebra is preserved when passing to C*-subalgebras of finite codimension. In particular, any pullback of two semiprojective C*-algebras over a finite-dimensional C*-algebra is again semiprojective.
The purpose of this paper is to prove that every finite set of points that can be constructed in the Euclidean plane by using a compass and a ruler can also be constructed by using unitary match-sticks in a non-simultaneous way and…
Oseledets' celebrated Multiplicative Ergodic Theorem (MET) is concerned with the exponential growth rates of vectors under the action of a linear cocycle on R^d. When the linear actions are invertible, the MET guarantees an…
We employ an extension of ergodic theory to the random setting to investigate the existence of random periodic solutions of random dynamical systems. Given that a random dynamical system has a dissipative structure, we proved that a random…
Motivated by the study of a certain family of classical geometric problems we investigate the existence of multiplicative connections on proper Lie groupoids. We show that one can always deform a given connection which is only approximately…
We study correlation estimates of automatic sequences (that is, sequences computable by finite automata) with polynomial phases. As a consequence, we provide a new class of good weights for classical and polynomial ergodic theorems, not…
We examine the maximum dimension of a linear system of plane cubic curves whose $\mathbb{F}_q$-members are all geometrically irreducible. Computational evidence suggests that such a system has a maximum (projective) dimension of $3$. As a…
A central property of a classical geometry is that the geodesic distance between two events is \emph{additive}. When considering quantum fluctuations in the metric or a quantum or statistical superposition of different spacetimes,…
Based on the fact that projective monomial curves in the plane are complete intersections, we give an effective inductive method for creating infinitely many monomial curves in the projective $n$-space that are set theoretic complete…
The generation of curves and surfaces from given data is a well-known problem in Computer-Aided Design that can be approached using subdivision schemes. They are powerful tools that allow obtaining new data from the initial one by means of…
We reprove the countable splitting lemma by adapting Nawrotzki's algorithm which produces a sequence that converges to a solution. Our algorithm combines Nawrotzki's approach with taking finite cuts. It is constructive in the sense that…
We explicitly construct and list all unitary superconformal multiplets, along with their index contributions, in five and six dimensions. From this data, we uncover various unifying themes in the representation theory of five- and…
In this work, we show the consistency of an approach for solving robust optimization problems using sequences of sub-problems generated by ergodic measure preserving transformations. The main result of this paper is that the minimizers and…
Homogeneous continued fraction algorithms are multidimensional generalizations of the classical Euclidean algorithm, the dissipative map $$ (x_1,x_2) \in \mathbb{R}_+^2 \longmapsto \left\{\begin{array}{ll} (x_1 - x_2, x_2), & \mbox{if $x_1…
It is well known that the edge vector space of an oriented graph can be decomposed in terms of cycles and cocycles (alias cuts, or bonds), and that a basis for the cycle and the cocycle spaces can be generated by adding and removing edges…
In this paper a special piecewise linear system is studied. It is shown that, under a mild assumption, the semi-smooth Newton method applied to this system is well defined and the method generates a sequence that converges linearly to a…
We propose an efficient linear-time graph-based divisive cluster analysis approach called Reductive Clustering. The approach tries to reveal the hierarchical structural information through reducing the graph into a more concise one…
We construct vertex transitive lattices on products of trees of arbitrary dimension $d \geq 1$ based on quaternion algebras over global fields with exactly two ramified places. Starting from arithmetic examples, we find non-residually…
We survey the distributional properties of progressively dilating sets under projection by covering maps, focusing on manifolds of constant sectional curvature. In the Euclidean case, we review previously known results and formulate some…
The randomized row method is a popular representative of the iterative algorithm because of its efficiency in solving the overdetermined and consistent systems of linear equations. In this paper, we present an extended randomized multiple…